When a Huffman tree is used, the string in Figure 1 can be represented using 98 bits.
CYBER SECURITY PROTOCOLS
The 24-character string shown in Figure 1 could also be encoded using standard 8-bit ASCII.
How many bits are saved when Huffman coding is used rather than ASCII to represent the string shown in Figure 1?
You must show your working.
37 exam-style questions on AQA GCSE Computer Science Data compression. Each one has a worked solution and a mark scheme showing where the marks go.