Learners will be introduced to Huffman coding, which is another form of lossless compression. They will discover how the algorithm works and practise applying it to some sample data, and they will practise interpreting Huffman trees.
- Explain how data can be compressed using Huffman coding
- Interpret a Huffman tree
- Calculate the number of bits required to store a piece of data compressed using Huffman coding