McqMate
These multiple-choice questions (MCQs) are designed to enhance your knowledge and understanding in the following areas: Computer Science Engineering (CSE) , Information Technology Engineering (IT) .
| 51. |
Data compression consists of taking a stream of symbols and transforming them into_______. |
| A. | Bits |
| B. | Codes |
| C. | Error |
| D. | Image |
| Answer» B. Codes | |
| 52. |
In Huffman coding, the actual output of the encoder is determined by a set of |
| A. | Probabilities |
| B. | Function |
| C. | Codes |
| D. | Model |
| Answer» A. Probabilities | |
| 53. |
A compression technique consists of two basic components such as |
| A. | Coding, Decoding |
| B. | Encoding , Coding |
| C. | Encoding , Decoding |
| D. | None of Above. |
| Answer» C. Encoding , Decoding | |
| 54. |
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» A. The user can experience rich quality signals for data representation | |
| 55. |
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» 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. | |
| 56. |
Lossy compression algorithm is applied to.. |
| A. | Images And Sound |
| B. | Sound And Text |
| C. | Image And Text |
| Answer» A. Images And Sound | |
| 57. |
Lossless compression algorithm is applied to.. |
| A. | Image |
| B. | Sound |
| C. | Scientific Data |
| Answer» C. Scientific Data | |
| 58. |
Example of entropy based compression is |
| A. | RLE , Arithmetic , Huffman |
| B. | Lempel-Ziv , Arithmetic |
| Answer» A. RLE , Arithmetic , Huffman | |
| 59. |
Example of dictionary based compression is |
| A. | RLE , Arithmetic , Huffman |
| B. | Lempel-Ziv |
| Answer» B. Lempel-Ziv | |
| 60. |
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» A. Sequence of digital data values | |
| 61. |
Entropy coding can be used for compression of any type of data in a |
| A. | Media system |
| B. | File system. |
| C. | Bit system |
| Answer» B. File system. | |
| 62. |
RLE Is Designed Especially For Data With |
| A. | Image of repeated symbols |
| B. | Sound of repeated symbols |
| C. | Strings of repeated symbols |
| Answer» C. Strings of repeated symbols | |
| 63. |
Huffman coding is to find a way to compress the storage of data using |
| A. | Data Length Codes. |
| B. | Variable Length Codes. |
| Answer» B. Variable Length Codes. | |
| 64. |
Huffman coding is constructed in such a way that no ___constructed code are prefixes to each other. |
| A. | Three |
| B. | One |
| C. | Two |
| Answer» C. Two | |
| 65. |
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» A. Each symbol is encoded with integer number of bits | |
| 66. |
Arithmetic coding completely bypass the idea of replacing every input symbol with a |
| A. | Bits |
| B. | String |
| C. | Codeword |
| Answer» C. Codeword | |
| 67. |
The main aim of arithmetic coding is to assign the _____to each symbol. |
| A. | Interval |
| B. | Image |
| C. | Symbol |
| Answer» A. Interval | |
| 68. |
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» A. The precision required to represent the intervals grows with length of the message. | |
| 69. |
Arithmetic algorithms as well as huffman algorithms are based on |
| A. | Statistical model |
| B. | String model |
| C. | Probability model |
| Answer» A. Statistical model | |
| 70. |
The lempel ziv algorithm is an algorithm for |
| A. | Lossless data compression |
| B. | Lossy data compression |
| Answer» A. Lossless data compression | |
| 71. |
Variations on lz77 scheme, like |
| A. | LZS, LZ And LZB |
| B. | LZSS, LZH And LB |
| C. | LZSS, LZH And LZB |
| Answer» C. LZSS, LZH And LZB | |
| 72. |
Lz77 exploits the fact that words and phrases within a ____would be repeated. |
| A. | Video File |
| B. | Text File |
| C. | Image File |
| Answer» B. Text File | |
| 73. |
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» C. Very Quick. | |
| 74. |
LZH is performed in ___ phases |
| A. | Two |
| B. | Four |
| C. | One |
| Answer» A. Two | |
| 75. |
Regardless of the length of the phrase, every LZSS pointer is of |
| A. | Different Size |
| B. | Same Size |
| Answer» B. Same Size | |
| 76. |
LZB achieves a better compression than |
| A. | LZH |
| B. | LZB |
| C. | LZSS |
| Answer» C. LZSS | |
| 77. |
The decompression in LZ78 Is __compared to the process of compression. |
| A. | Slower |
| B. | Faster |
| Answer» B. Faster | |
| 78. |
LZW would only send the _____to the dictionary |
| A. | Image |
| B. | Index |
| C. | File |
| Answer» B. Index | |
| 79. |
In arithmetic coding a ___identifier or tag is generated for the sequence to be encoded. |
| A. | Unique |
| B. | Different |
| Answer» A. Unique | |
| 80. |
The use of the cumulative distribution function to generate a binary code for _____has a rather interesting history. |
| A. | A Sequence |
| B. | A Bit |
| C. | A Image |
| Answer» A. A Sequence | |
| 81. |
Once we have started decoding, all we have to do is ___the encoder algorithm. |
| A. | Mimic |
| B. | Long |
| C. | Static |
| Answer» A. Mimic | |
| 82. |
Advantage of arithmetic coding is that |
| A. | It is easy to implement a system with multiple arithmetic codes |
| B. | It is hard to implement a system with multiple arithmetic codes |
| C. | It is easy to implement a system with single arithmetic codes |
| Answer» A. It is easy to implement a system with multiple arithmetic codes | |
| 83. |
In file compression—unix once the dictionary has filled up, the size of the dictionary is ____to 1024 entries. |
| A. | Single |
| B. | Doubled |
| Answer» B. Doubled | |
| 84. |
GIF is another implementation of the ___ algorithm |
| A. | LZW |
| B. | LZSS |
| C. | LZH |
| Answer» A. LZW | |
| 85. |
GIF has become quite popular for encoding all kinds of images, both computergenerated and “___” images. |
| A. | Distorted |
| B. | Natural |
| Answer» B. Natural | |
| 86. |
The PNG standard is one of the first standards to be collaboratively developed over the |
| A. | Image |
| B. | Internet |
| C. | File |
| Answer» B. Internet | |
| 87. |
PNG is based on |
| A. | LZSS |
| B. | LZH |
| C. | LZ77 |
| Answer» C. LZ77 | |
| 88. |
The ITU-T recommendation V.42 bis is a compression standard devised for use over a |
| A. | Telephone Network |
| B. | Image Network |
| C. | Text File Network |
| Answer» A. Telephone Network | |
| 89. |
Bwt algorithm requires that the entire sequence to be coded be available to the ____before the coding takes place |
| A. | Decoder. |
| B. | Encoder |
| Answer» B. Encoder | |
| 90. |
Shannon Defined A Quantity Called |
| A. | Self-Information |
| B. | Information |
| Answer» A. Self-Information | |
| 91. |
Models for certain telemetry data can also be obtained through ____of the underlying process. |
| A. | Knowledge |
| B. | Text |
| C. | Data |
| Answer» A. Knowledge | |
| 92. |
Probability Models Know As.. |
| A. | Knowledge model |
| B. | Statistical model |
| C. | Ignorance model |
| Answer» C. Ignorance model | |
| 93. |
Markov process called |
| A. | Discrete time markov chain |
| B. | Random time markov chain |
| Answer» A. Discrete time markov chain | |
| 94. |
Markov models are more widely known |
| A. | Finite context models |
| B. | Text context models |
| Answer» A. Finite context models | |
| 95. |
The ppm algorithms first attempt to find if the symbol to be encoded has a _____probability with respect to the maximum context length. |
| A. | Zero |
| B. | Nonzero |
| Answer» B. Nonzero | |
| 96. |
Composite source model, which can be viewed as a |
| A. | Single Model To Describe The Source |
| B. | Combination Or Composition Of Several Sources |
| Answer» B. Combination Or Composition Of Several Sources | |
| 97. |
The set of binary sequences is called a |
| A. | Code |
| B. | Unit |
| C. | Digit |
| Answer» A. Code | |
| 98. |
The set of binary sequences is called a code, and the individual members of the set are called |
| A. | Sequence Model |
| B. | Unit Model |
| C. | Codewords. |
| Answer» C. Codewords. | |
| 99. |
The ASCII code uses the same number of bits to represent each symbol. Such a code is called |
| A. | Random Length Code. |
| B. | Fixed-Length Code. |
| Answer» B. Fixed-Length Code. | |
| 100. |
Unique decodability from the code; that is, any given sequence of codewords can be decoded in |
| A. | One, And Two, Way. |
| B. | One, And Only One, Way. |
| Answer» B. One, And Only One, Way. | |
Done Studing? Take A Test.
Great job completing your study session! Now it's time to put your knowledge to the test. Challenge yourself, see how much you've learned, and identify areas for improvement. Don’t worry, this is all part of the journey to mastery. Ready for the next step? Take a quiz to solidify what you've just studied.