Back
to top
GCSE Computing Huffman Trees
Watch
Announcements
Page 1 of 1
I need help with these two questions, please:
The Huffman tree (attached) can be used to encode the sentence “AGED BADGERS GRADE EGGS”.
(iii) What would be the storage requirement for the word “BREAD” using uncompressed 7-bit ASCII?
(iv) Calculate the compression achieved by Huffman coding, by giving
the percentage saving over the ASCII version.
The Huffman tree (attached) can be used to encode the sentence “AGED BADGERS GRADE EGGS”.
(iii) What would be the storage requirement for the word “BREAD” using uncompressed 7-bit ASCII?
(iv) Calculate the compression achieved by Huffman coding, by giving
the percentage saving over the ASCII version.
0
reply
X
Page 1 of 1
Quick Reply
Today on TSR
-
Ofqual consultationTeachers to use 'mini-exams' and other work to decide grades
- Is it too late to do well in my A-levels?
- What Harry Potter house are you in?
- 2021 wellbeing blog launch
- Student tips on lockdown mental health