GCSE
Lesson 17 Huffman coding
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.
Learning objectives
- 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
Package contents
- Lesson plans
- Learning graphs
- Unit overviews
- Activities
Not registered yet?
Create an account and get access to over 500 hours of free teaching resources.
GCSE revision
A comprehensive range of content and helpful practice questions are also available for this topic.