Huffman Coding (AQA GCSE Computer Science): Quizzes
📚Quizzes
Practise the questions
12 questions from this quiz
ShowHide
Practise the questions
12 questions from this quiz
What type of compression method is Huffman coding?
What type of compression method is Huffman coding?
Lossless
What data structure does Huffman coding use to organize characters?
What data structure does Huffman coding use to organize characters?
Binary tree
In 'HOT HOT HOTTER', how many times does the letter T appear?
In 'HOT HOT HOTTER', how many times does the letter T appear?
4 times
When building a Huffman tree, which nodes should you combine first?
When building a Huffman tree, which nodes should you combine first?
Two with lowest frequencies
If you combine nodes with frequencies 1 and 1, what is the new node's frequency?
If you combine nodes with frequencies 1 and 1, what is the new node's frequency?
2
What should the root node frequency equal?
What should the root node frequency equal?
Total character count
In the standard convention, what value is assigned to left branches?
In the standard convention, what value is assigned to left branches?
0
In the example tree, what is the binary code for the letter H?
In the example tree, what is the binary code for the letter H?
11
Which characters get the shortest binary codes in Huffman coding?
Which characters get the shortest binary codes in Huffman coding?
Most frequent characters
How many bits per character does ASCII use?
How many bits per character does ASCII use?
8 bits
What type of encoding does Huffman coding use?
What type of encoding does Huffman coding use?
Variable-length
How do you find a character's binary code in the tree?
How do you find a character's binary code in the tree?
Follow path from root to character