
8525 AQA GCSE 3.3.8 Huffman & RLE
Authored by David Anderson
Computers
10th - 11th Grade
Used 72+ times

AI Actions
Add similar questions
Adjust reading levels
Convert to real-world scenario
Translate activity
More...
Content View
Student View
15 questions
Show all answers
1.
MULTIPLE CHOICE QUESTION
10 sec • 5 pts
Which type of compression ensures that all of the data is kept?
Lossless
Lossy
2.
MULTIPLE CHOICE QUESTION
10 sec • 5 pts
Lossy compression removes data that isn't needed...
True
False
3.
MULTIPLE CHOICE QUESTION
20 sec • 5 pts
The correct encoding of the letter C in this tree is...
11
10
01
00
4.
MULTIPLE CHOICE QUESTION
30 sec • 5 pts
Huffman trees use the _______________ of each character to work out their encoding.
Frequency
Order in ASCII
Number value
5.
MULTIPLE CHOICE QUESTION
20 sec • 5 pts
How do you move through a Huffman tree?
0 = right 1= left
1 = left 2 = right
0 = left 1 = right
0 = middle 1 = back
6.
MULTIPLE CHOICE QUESTION
30 sec • 5 pts
How do you calculate the number of bits of a body of text in ASCII?
Number of characters * 7
Number of characters (including spaces) *7
bits in Huffman * 7
bits in Huffman / 7
7.
MULTIPLE CHOICE QUESTION
30 sec • 5 pts
Use this Huffman tree to encode "ban"
111001
100011
010
143
Access all questions and much more by creating a free account
Create resources
Host any resource
Get auto-graded reports

Continue with Google

Continue with Email

Continue with Classlink

Continue with Clever
or continue with

Microsoft
%20(1).png)
Apple
Others
Already have an account?