Unpacked Content
Knowledge
Students know:
- How to construct a binary tree with vertices and edges
Skills
Students are able to:
- Use variable length codes to recode data with shorter codes for the more frequently used characters.
- Use a data compression code to decode.
- Construct a Huffman code for a given set of characters and their frequencies.
Understanding
Students understand that:
- Data compression is accomplished by using shorter binary strings for commonly used characters.
Vocabulary
- Variable-length codes
- Prefix (or prefix-free) codes
- Huffman codes
- Huffman trees
