MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 97 Mcqs, each offering curated multiple-choice questions to sharpen your Computer Science Engineering (CSE) knowledge and support exam preparation. Choose a topic below to get started.
| 51. |
A compression technique consists of two basic components such as |
| A. | Coding, Decoding |
| B. | Encoding , Coding |
| C. | Encoding , Decoding |
| D. | None of Above. |
| Answer» D. None of Above. | |
| 52. |
Data compression consists of taking a stream of symbols and transforming them into_______. |
| A. | Bits |
| B. | Codes |
| C. | Error |
| D. | Image |
| Answer» C. Error | |
| 53. |
Advantages of data compression |
| A. | The user can experience rich quality signals for data representation |
| B. | Reliability of the records gets reduced by Data compression. |
| C. | Disorder of data properties of a compressed data will result in compressed data different from the original data. |
| Answer» B. Reliability of the records gets reduced by Data compression. | |
| 54. |
Disadvantages of data compression |
| A. | The rate of input output operations in a computing device can be greatly increased due to shorter presentation of data. |
| B. | Compressed, sensitive data transmitted through a noisy communication channel is risky because the burst errors introduced by the noisy channel can destroy the transmitted data. |
| Answer» C. | |
| 55. |
Lossy compression algorithm is applied to.. |
| A. | Images And Sound |
| B. | Sound And Text |
| C. | Image And Text |
| Answer» B. Sound And Text | |
| 56. |
Lossless compression algorithm is applied to.. |
| A. | Image |
| B. | Sound |
| C. | Scientific Data |
| Answer» D. | |
| 57. |
Example of entropy based compression is |
| A. | RLE , Arithmetic , Huffman |
| B. | Lempel-Ziv , Arithmetic |
| Answer» B. Lempel-Ziv , Arithmetic | |
| 58. |
Example of dictionary based compression is |
| A. | RLE , Arithmetic , Huffman |
| B. | Lempel-Ziv |
| Answer» C. | |
| 59. |
Which of the following programs support xml or xml applications? |
| A. | Internet Explorer 5.5 |
| B. | Netscape D.7 |
| C. | Realplayer. |
| D. | Both A And B |
| Answer» E. | |
| 60. |
The idea with wavelets is to represent a complicated function by |
| A. | Sinus Functions |
| B. | Simple Basic Functions |
| C. | Lines |
| D. | Square Functions |
| Answer» C. Lines | |
| 61. |
Information lost when expressed mathematically is called |
| A. | Markov |
| B. | Finite Memory Source |
| C. | Fidelity Criteria |
| D. | Noiseless Theorem |
| Answer» D. Noiseless Theorem | |
| 62. |
Sequence of code assigned is called |
| A. | Code Word |
| B. | Word |
| C. | Byte |
| D. | Nibble |
| Answer» B. Word | |
| 63. |
Well formed xml document means |
| A. | It Contains A Root Element |
| B. | It Contain An Element |
| C. | It Contains One Or More Elements |
| D. | Must Contain One Or More Elements And Root Element Must Contain All Other Elements |
| Answer» E. | |
| 64. |
What is the correct syntax of the declaration which defines the xml version? |
| A. | <Xml Version="A.0" /> |
| B. | <?Xml Version="A.0"?> |
| C. | <?Xml Version="A.0" /> |
| D. | None Of The Above |
| Answer» C. <?Xml Version="A.0" /> | |
| 65. |
Comment in xml document is given by |
| A. | <?-- --> |
| B. | <!-- --!> |
| C. | <!-- --> |
| D. | </-- -- > |
| Answer» D. </-- -- > | |
| 66. |
Xml document can be viewed in |
| A. | IE C.0 |
| B. | IE B.0 |
| C. | IE 6.0 |
| D. | IE X.0 |
| Answer» D. IE X.0 | |
| 67. |
The Attribute Used To Define A New Namespace Is |
| A. | XMLNS |
| B. | Xmlnamespace |
| C. | Xmlns |
| D. | Xmlns |
| Answer» D. Xmlns | |
| 68. |
Attribute standalone="no" should be included in xml declaration if a document |
| A. | Is linked to an external xsl stylesheet |
| B. | Has external general references |
| C. | Has processing instructions |
| D. | Has an external dtd |
| Answer» E. | |
| 69. |
What does xml stand for? |
| A. | Extra Modern Link |
| B. | Extensible Markup Language |
| C. | Example Markup Language |
| D. | X-Markup Language |
| Answer» C. Example Markup Language | |
| 70. |
Whats so great about xml? |
| A. | Easy data exchange |
| B. | High speed on network |
| C. | Only b.is correct |
| D. | Both A. & B. |
| Answer» E. | |
| 71. |
The xml dom object is |
| A. | Entity |
| B. | Entity Reference |
| C. | Comment Reference |
| D. | Comment Data |
| Answer» C. Comment Reference | |
| 72. |
Entropy coding can be used for |
| A. | Sequence of digital data values |
| B. | Random of digital data values |
| C. | Regular of digital data values |
| Answer» B. Random of digital data values | |
| 73. |
Entropy coding can be used for compression of any type of data in a |
| A. | Media system |
| B. | File system. |
| C. | Bit system |
| Answer» C. Bit system | |
| 74. |
Huffman coding is to find a way to compress the storage of data using |
| A. | Data Length Codes. |
| B. | Variable Length Codes. |
| Answer» C. | |
| 75. |
RLE Is Designed Especially For Data With |
| A. | Image of repeated symbols |
| B. | Sound of repeated symbols |
| C. | Strings of repeated symbols |
| Answer» D. | |
| 76. |
System of symbols to represent event is called |
| A. | Storage |
| B. | Word |
| C. | Code |
| D. | Nibble |
| Answer» D. Nibble | |
| 77. |
Huffman coding is constructed in such a way that no ___constructed code are prefixes to each other. |
| A. | Three |
| B. | One |
| C. | Two |
| Answer» D. | |
| 78. |
Limitations of huffman coding is |
| A. | Each symbol is encoded with integer number of bits |
| B. | Each symbol is encoded with integer number of value |
| C. | Each symbol is encoded with integer number of level |
| Answer» B. Each symbol is encoded with integer number of value | |
| 79. |
Every run length pair introduce new |
| A. | Pixels |
| B. | Matrix |
| C. | Frames |
| D. | Intensity |
| Answer» E. | |
| 80. |
Arithmetic coding completely bypass the idea of replacing every input symbol with a |
| A. | Bits |
| B. | String |
| C. | Codeword |
| Answer» D. | |
| 81. |
The main aim of arithmetic coding is to assign the _____to each symbol. |
| A. | Interval |
| B. | Image |
| C. | Symbol |
| Answer» B. Image | |
| 82. |
Variations on lz77 scheme, like |
| A. | LZS, LZ And LZB |
| B. | LZSS, LZH And LB |
| C. | LZSS, LZH And LZB |
| Answer» D. | |
| 83. |
Limitations of arithmetic coding |
| A. | The precision required to represent the intervals grows with length of the message. |
| B. | The precision required to represent the intervals grows with bit of the message. |
| C. | The precision required to represent the random grows with length of the message. |
| Answer» B. The precision required to represent the intervals grows with bit of the message. | |
| 84. |
Arithmetic algorithms as well as huffman algorithms are based on |
| A. | Statistical model |
| B. | String model |
| C. | Probability model |
| Answer» B. String model | |
| 85. |
The lempel ziv algorithm is an algorithm for |
| A. | Lossless data compression |
| B. | Lossy data compression |
| Answer» B. Lossy data compression | |
| 86. |
In the coding redundancy technique we use |
| A. | Fixed Length Code |
| B. | Variable Length Code |
| C. | Byte |
| D. | Both A And B |
| Answer» E. | |
| 87. |
In LZ77 encoding process one reference (a triple) is transmitted for several input symbols and hence it is |
| A. | Less Quick. |
| B. | Quick. |
| C. | Very Quick. |
| Answer» D. | |
| 88. |
Lz77 exploits the fact that words and phrases within a ____would be repeated. |
| A. | Video File |
| B. | Text File |
| C. | Image File |
| Answer» C. Image File | |
| 89. |
LZH is performed in ___ phases |
| A. | Two |
| B. | Four |
| C. | One |
| Answer» B. Four | |
| 90. |
Regardless of the length of the phrase, every LZSS pointer is of |
| A. | Different Size |
| B. | Same Size |
| Answer» C. | |
| 91. |
Markov models are more widely known |
| A. | Finite context models |
| B. | Text context models |
| Answer» B. Text context models | |
| 92. |
Coding redundancy works on |
| A. | Pixels |
| B. | Matrix |
| C. | Intensity |
| D. | Coordinates |
| Answer» D. Coordinates | |
| 93. |
The basic idea behind huffman coding is to |
| A. | Compress data by using more bits to encode more frequently occurring characters |
| B. | Compress data by using fewer bits to encode more frequently occurring characters |
| C. | Expand data by using fewer bits to encode more frequently occurring characters |
| D. | Compress data by using fewer bits to encode fewer frequently occurring characters |
| Answer» C. Expand data by using fewer bits to encode more frequently occurring characters | |
| 94. |
An Alphabet Consist Of The Letters A, B, C And D. The probability of occurrence isp(a) = 0.4,p(b) = 0.1,p(c) = 0.2and p(d) = 0.3.The huffman code is |
| A. | A = 0 , B = 11 , C = 10 , D = 111 |
| B. | A = 0 , B = 111 , C = 110 , D = 10 |
| C. | A = 01 , B = 111 , C = 110 , D = 10 |
| D. | A = 0 , B = 111 , C = 11 , D = 101 |
| Answer» C. A = 01 , B = 111 , C = 110 , D = 10 | |
| 95. |
A huffman encoder takes a set of characters with fixed length and produces a set of characters of |
| A. | Constant Length |
| B. | Random Length |
| C. | Fixed Length |
| D. | Variable Length |
| Answer» E. | |
| 96. |
Huffman coding is an encoding algorithm used for |
| A. | Lossy Data Compression |
| B. | Broadband Systems |
| C. | Lossless Data Compression |
| D. | Files Greater Than 1 Mbit |
| Answer» D. Files Greater Than 1 Mbit | |
| 97. |
A Huffman Code: A = 1, B = 000, C = 001, D = 01, P(A) = 0.4, P(B) = 0.1, P(C) = 0.2, P(D) = 0.3 The Average Number Of Bits Per Letter Is |
| A. | 8.0 Bit |
| B. | 2.0 Bit |
| C. | 2.1 Bit |
| D. | 1.9 Bit |
| Answer» E. | |