Oak ComputingTest · Computing

Huffman coding

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

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

Oak National Academy

12 questions

What is the purpose of run length encoding?
What does redundancy in data refer to?
Which of the following is a characteristic of lossless compression?
What type of data is best suited for run length encoding?
Why might run length encoding not always reduce file size?
What does 'lossless' mean in data compression?
What is Huffman coding?
Match each term with its correct description.
What does a Huffman tree represent?
Arrange the steps for creating a Huffman tree in the correct order.
What is the main purpose of Huffman coding?
Order the following characters based on their bit sequence length in Huffman coding (shortest to longest).

License: OGL