| 1. |
Makes the file smaller by deleting parts of the file permanently (forever) |
| A. | Lossy Compression |
| B. | Lossless Compression |
| Answer» A. Lossy Compression | |
| 2. |
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» A. The file size becomes significantly (much) smaller | |
| 3. |
Which of the following would not be suitable for Lossy Compression? |
| A. | Images |
| B. | Sounds |
| C. | Videos |
| D. | Text |
| Answer» D. Text | |
| 4. |
Lossy or lossless? This type of compression does not get rid of any data |
| A. | Lossy |
| B. | Lossless |
| C. | Both |
| Answer» B. Lossless | |
| 5. |
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» A. Lossy | |
| 6. |
What type of compression allows you to reconstruct the original data? |
| A. | Lossless compression |
| B. | Lossy compression |
| Answer» A. Lossless compression | |
| 7. |
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» D. A and b | |
| 8. |
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» D. a and c | |
| 9. |
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» D. all of the above | |
| 10. |
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» D. all of the above | |
| 11. |
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» D. all of the above | |
| 12. |
Hashing gives each item |
| A. | A sequential address |
| B. | A logarithmic address |
| C. | No address |
| D. | A unique address |
| Answer» D. A unique address | |
| 13. |
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» A. When we want to compress patterns of data | |
| 14. |
What is the correct Run-length encoding for the data: cccmmmmmsssssdcccccc |
| A. | 3c5m5s1d6c |
| B. | C3m5s5d1c6 |
| C. | Cmsdc35516 |
| D. | Cccmmmmmsssssdcccccc |
| Answer» A. 3c5m5s1d6c | |
| 15. |
Which of the following are not in a compressed format? |
| A. | JPEG |
| B. | Bitmap |
| C. | MPEG |
| D. | MP3 |
| Answer» B. Bitmap | |
| 16. |
Identify types of lossless compression |
| A. | Run length encoding |
| B. | Dictionary encoding |
| C. | Transform Coding |
| D. | a and b |
| Answer» D. a and b | |
| 17. |
Digitizing the image intensity amplitude is called |
| A. | Sampling |
| B. | Quantization |
| C. | Framing |
| D. | Both A And B |
| Answer» B. Quantization | |
| 18. |
Compressed image can be recovered back by |
| A. | Image Enhancement |
| B. | Image Decompression |
| C. | Image Contrast |
| D. | Image Equalization |
| Answer» B. Image Decompression | |
| 19. |
Digital video is sequence of |
| A. | Pixels |
| B. | Matrix |
| C. | Frames |
| D. | Coordinates |
| Answer» C. Frames | |
| 20. |
Coding redundancy works on |
| A. | Pixels |
| B. | Matrix |
| C. | Intensity |
| D. | Coordinates |
| Answer» C. Intensity | |
| 21. |
An Alphabet Consist Of The Letters A, B, C And D. The probability of occurrence 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» B. A = 0 , B = 111 , C = 110 , D = 10 | |
| 22. |
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» B. Compress data by using fewer bits to encode more frequently occurring characters | |
| 23. |
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» C. Lossless Data Compression | |
| 24. |
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» D. Variable Length | |
| 25. |
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» D. 1.9 Bit | |