Examplary
Start for free
Oak ComputingTest · Computing

Comparing compression algorithms

The starter and exit quiz of the lesson “Comparing compression algorithms”, from the unit “Data compression” (Year 10 Computing) by Oak National Academy.

Copy to my workspaceGet started for free

Free to use. Edit it, share it and hand it out to your students.

Oak National Academy

12 questions

  1. What does encoding mean in data compression?
  2. What is used to visually represent the encoding scheme in Huffman coding?
  3. What lossless compression technique reduces file size by encoding repeating sequences of data?
  4. What term describes repeated or extra data that can be removed without losing essential meaning?
  5. What is run length encoding?
  6. What is the main goal of Huffman coding?
  7. Match each term to its definition.
  8. Why is compression efficiency important?
  9. What does compression speed refer to?
  10. Why isn’t the smallest file size always the best result for compression?
  11. What is a limitation of some compression methods?
  12. Put these steps in order for comparing compression methods:

License: OGL

Comparing compression algorithms · Examplary