Compression (3 of 3): Huffman Coding/Trees

Curriculum support15 minsFREE

Share:
Key takeaways
An introduction to compression types and techniques.
Understanding the process of data compression using RLE and Huffman.
How best to present answers to typical exam questions.
Jez WhitworthHost: Together with a background in software development and his teaching experience, Jez is able to create innovative and exciting approaches to deliver fun and creative lessons for all ages and abilities. He is Head of Computer Science at a special needs school and is the founder of First Coding which offers creative coding courses in and around the Salisbury area.

In this three part series, Jez will introduce students to compression; why it is used and the different types and methods of compression.

Part 1: Compression introduction.

Students will be given a broad overview of compressions and its uses as well as the different types of methods used.

Part 2: Run Length Encoding (RLE).

Students will be introduced to Run Length Encoding, looking at the techniques used as well as reviewing its effectiveness and a compression method.

Part 3: Huffman Coding/Trees.

Students will be given the opportunity to explore Huffman Trees, stepping through the process of compressing data and calculating its effectiveness and a compression method.

Safeguarding reminder:The safety of your child is of the utmost importance. All of our classes are pre-recorded to remove any concerns around live participation. For reruns of our past live classes, students' webcams and microphones were disabled and only the chat history, if participation was requested, is visible.

Suitable for:
Class requirements:
You will need a laptop or device with internet connection to watch the class, as well as a pen and notepad for taking notes.
What to expect:
Already have an account? Login
Please see our privacy policy here