Skip to content
Android waitlistTry on iPad

Data compression: AQA GCSE Computer Science questions

Every AQA GCSE Computer Science exam question on 3.3.8 Data compression, 2022–2025, with its mark scheme and examiner’s report.

Paper
All papers
Exam
All years
Calculations

740 questions

  1. Q09.1

    June 2024 · Paper 2

    The whole paper ↗
  2. Q09.2

    June 2024 · Paper 2

    The whole paper ↗
  3. Q07.4

    June 2023 · Paper 2

    The whole paper ↗
  4. Q17.1

    June 2022 · Paper 2

    The whole paper ↗
  5. Q17.2

    June 2022 · Paper 2

    The whole paper ↗
  6. Q17.3

    June 2022 · Paper 2

    The whole paper ↗
  7. Q01.7

    Specimen · Paper 2

    The whole paper ↗
  8. Q01.8

    Specimen · Paper 2

    The whole paper ↗
All 8 questions on Data compression, as a list
  1. June 2024, Paper 2, Q09.1 (2 marks): Figure 7 contains a Huffman tree. Figure 7 The Huffman tree in Figure 7 was used to encode a string, which resulted in the following bit pattern: 0001011001 Sta
  2. June 2024, Paper 2, Q09.2 (3 marks): Table 1 shows the Huffman codes for the characters used in the string HESELLSSEASHELLASHES Table 1 Character Character frequency Huffman code S 6 11 E 5 10 L 4
  3. June 2023, Paper 2, Q07.4 (2 marks): A black and white image has been compressed using run length encoding (RLE). The first bit in each byte of the bit pattern represents the colour and the remaini
  4. June 2022, Paper 2, Q17.1 (2 marks): State two reasons why data are compressed. [2 marks] 1 2
  5. June 2022, Paper 2, Q17.2 (2 marks): Figure 2 shows a string. Figure 2 MISSISSIPPI One method for compressing data is run length encoding (RLE). When using RLE, the data in Figure 2 become: 1M 1I 2
  6. June 2022, Paper 2, Q17.3 (1 mark): Another method for compressing data is Huffman coding. In Huffman coding, the codes for the characters can be created based on their position in a tree. Figure
  7. Specimen, Paper 2, Q01.7 (3 marks): Using the Huffman code in Figure 3, complete the table to show the Huffman coding for the characters O, SPACE and B. [3 marks] Character Huffman coding O SPACE
  8. Specimen, Paper 2, Q01.8 (3 marks): Using Huffman coding, the text ZOE SAW A ZEBRA AT THE ZOO can be stored in 83 bits. Calculate how many additional bits are needed to store the same piece of tex

Questions, mark schemes and examiner’s reports are © AQA, from their published past papers. Plumi isn’t affiliated with any exam board. Want whole papers? Full past papers.

Rather write your answers by hand on iPad? Plumi marks them against the same mark schemes.