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.
| 1. |
In a typical picture, most pixels will be |
| A. | Very similar to their neighbors |
| B. | Very different to their neighbors |
| C. | Bright |
| D. | Equal |
| Answer» B. Very different to their neighbors | |
| 2. |
Makes the file smaller by deleting parts of the file permanently (forever) |
| A. | Lossy Compression |
| B. | Lossless Compression |
| Answer» B. Lossless Compression | |
| 3. |
Which of these is an advantage for Lossy compression? |
| A. | The file size becomes significantly (much) smaller |
| B. | The file size does not become much smaller than 50% |
| Answer» B. The file size does not become much smaller than 50% | |
| 4. |
Which of the following would not be suitable for Lossy Compression? |
| A. | Images |
| B. | Sounds |
| C. | Videos |
| D. | Text |
| Answer» E. | |
| 5. |
What type of compression allows you to reconstruct the original data? |
| A. | Lossless compression |
| B. | Lossy compression |
| Answer» B. Lossy compression | |
| 6. |
Lossy or lossless? This type of compression does not get rid of any data |
| A. | Lossy |
| B. | Lossless |
| C. | Both |
| Answer» C. Both | |
| 7. |
Lossy or lossless? Used for web images as it gives the smallest file size - this makes images easier to upload/download/share. |
| A. | Lossy |
| B. | Lossless |
| C. | Both |
| Answer» B. Lossless | |
| 8. |
What are the key reasons for compressing data? |
| A. | Less space needed for storage |
| B. | Less time to transmit |
| C. | Reduced amount of processing power |
| D. | A and b |
| Answer» E. | |
| 9. |
Lossless compression... |
| A. | Is used when not all the information is needed |
| B. | Would be a sensible choice for a music download site |
| C. | Can fully regenerate the original file |
| D. | a and c |
| Answer» E. | |
| 10. |
Lossy compression... |
| A. | Permanently removes data from a file |
| B. | Aims to remove redundant data |
| C. | Would be a sensible choice for a music download site. |
| D. | all of the above |
| Answer» E. | |
| 11. |
Dictionary based compression... |
| A. | Is a lossless compression format |
| B. | Doesn't need to send the dictionary with the data |
| C. | Is a lossless compression format |
| D. | all of the above |
| Answer» E. | |
| 12. |
Run-length encoding.. |
| A. | Is Lossless |
| B. | Records the number of repeats of an individual element |
| C. | Can be used for a wide variety of file types |
| D. | all of the above |
| Answer» E. | |
| 13. |
Hashing gives each item |
| A. | A sequential address |
| B. | A logarithmic address |
| C. | No address |
| D. | A unique address |
| Answer» E. | |
| 14. |
When is Run Length Encoding used? |
| A. | When we want to compress patterns of data |
| B. | When we want to decompress patterns of data |
| C. | When we want to encode running videos |
| D. | Option. |
| Answer» B. When we want to decompress patterns of data | |
| 15. |
Identify types of lossless compression |
| A. | Run length encoding |
| B. | Dictionary encoding |
| C. | Transform Coding |
| D. | a and b |
| Answer» E. | |
| 16. |
What is the correct Run-length encoding for the data: cccmmmmmsssssdcccccc |
| A. | 3c5m5s1d6c |
| B. | C3m5s5d1c6 |
| C. | Cmsdc35516 |
| D. | Cccmmmmmsssssdcccccc |
| Answer» B. C3m5s5d1c6 | |
| 17. |
Which of the following are not in a compressed format? |
| A. | JPEG |
| B. | Bitmap |
| C. | MPEG |
| D. | MP3 |
| Answer» C. MPEG | |
| 18. |
Digitizing the image intensity amplitude is called |
| A. | Sampling |
| B. | Quantization |
| C. | Framing |
| D. | Both A And B |
| Answer» C. Framing | |
| 19. |
Digital video is sequence of |
| A. | Pixels |
| B. | Matrix |
| C. | Frames |
| D. | Coordinates |
| Answer» D. Coordinates | |
| 20. |
Compressed image can be recovered back by |
| A. | Image Enhancement |
| B. | Image Decompression |
| C. | Image Contrast |
| D. | Image Equalization |
| Answer» C. Image Contrast | |
| 21. |
Compression is done for saving |
| A. | Storage |
| B. | Bandwidth |
| C. | Money |
| D. | Both A And B |
| Answer» E. | |
| 22. |
Down sampling is to make a digital image file smaller by |
| A. | Removing noise |
| B. | Adding noise |
| C. | Removing pixels |
| D. | Adding pixels |
| Answer» D. Adding pixels | |
| 23. |
The best visual compression quality is achieved using |
| A. | Dolby |
| B. | Wavelets |
| C. | Fourier transform |
| D. | DCT |
| Answer» C. Fourier transform | |
| 24. |
LZW would only send the _____to the dictionary |
| A. | Image |
| B. | Index |
| C. | File |
| Answer» C. File | |
| 25. |
LZB achieves a better compression than |
| A. | LZH |
| B. | LZB |
| C. | LZSS |
| Answer» D. | |
| 26. |
The decompression in LZ78 Is __compared to the process of compression. |
| A. | Slower |
| B. | Faster |
| Answer» C. | |
| 27. |
How can we make attributes have multiple values |
| A. | <Myelement myattribute="value1 value2"/> |
| B. | <Myelement myattribute="value1" myattribute="value2"/> |
| C. | <Myelement myattribute="value1, value2"/> |
| D. | Attributes cannot have multiple values |
| Answer» E. | |
| 28. |
In arithmetic coding a ___identifier or tag is generated for the sequence to be encoded. |
| A. | Unique |
| B. | Different |
| Answer» B. Different | |
| 29. |
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» B. A Bit | |
| 30. |
Once we have started decoding, all we have to do is ___the encoder algorithm. |
| A. | Mimic |
| B. | Long |
| C. | Static |
| Answer» B. Long | |
| 31. |
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» B. It is hard to implement a system with multiple arithmetic codes | |
| 32. |
In file compression unix once the dictionary has filled up, the size of the dictionary is ____to 1024 entries. |
| A. | Single |
| B. | Doubled |
| Answer» C. | |
| 33. |
GIF is another implementation of the ___ algorithm |
| A. | LZW |
| B. | LZSS |
| C. | LZH |
| Answer» B. LZSS | |
| 34. |
Without losing quality, JPEG-2000 can achieve compression ratios of |
| A. | 2000:1 |
| B. | 20:1 |
| C. | 200:1 |
| D. | 2:1 |
| Answer» D. 2:1 | |
| 35. |
GIF has become quite popular for encoding all kinds of images, both computergenerated and ___ images. |
| A. | Distorted |
| B. | Natural |
| Answer» C. | |
| 36. |
PNG is based on |
| A. | LZSS |
| B. | LZH |
| C. | LZ77 |
| Answer» D. | |
| 37. |
The PNG standard is one of the first standards to be collaboratively developed over the |
| A. | Image |
| B. | Internet |
| C. | File |
| Answer» C. File | |
| 38. |
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» B. Image Network | |
| 39. |
Models for certain telemetry data can also be obtained through ____of the underlying process. |
| A. | Knowledge |
| B. | Text |
| C. | Data |
| Answer» B. Text | |
| 40. |
Shannon Defined A Quantity Called |
| A. | Self-Information |
| B. | Information |
| Answer» B. Information | |
| 41. |
Bwt algorithm requires that the entire sequence to be coded be available to the ____before the coding takes place |
| A. | Decoder. |
| B. | Encoder |
| Answer» C. | |
| 42. |
Markov process called |
| A. | Discrete time markov chain |
| B. | Random time markov chain |
| Answer» B. Random time markov chain | |
| 43. |
Probability Models Know As.. |
| A. | Knowledge model |
| B. | Statistical model |
| C. | Ignorance model |
| Answer» D. | |
| 44. |
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» C. | |
| 45. |
Composite source model, which can be viewed as a |
| A. | Single Model To Describe The Source |
| B. | Combination Or Composition Of Several Sources |
| Answer» C. | |
| 46. |
The set of binary sequences is called a |
| A. | Code |
| B. | Unit |
| C. | Digit |
| Answer» B. Unit | |
| 47. |
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» D. | |
| 48. |
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» C. | |
| 49. |
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» C. | |
| 50. |
In Huffman coding, the actual output of the encoder is determined by a set of |
| A. | Probabilities |
| B. | Function |
| C. | Codes |
| D. | Model |
| Answer» B. Function | |