Skip to content

Course home

Data compression

Data compression

EasyMedium
123456789101112131415161718192021222324
Question 11

When a Huffman tree is used, the string in Figure 1 can be represented using 138 bits.

Figure 1

ARTIFICIAL INTELLIGENCE ALGORITHM

The 33-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.

[2]
Markscheme

Data compression Questions

  1. GCSE
  2. /Computer Science
  3. /Data compression

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.

Question bank