Skip to content
Try on iPad

Hash tables: AQA A‑Level Computer Science questions

Every AQA A-Level Computer Science exam question on 4.2.6 Hash tables, 2020–2025, with its mark scheme and examiner’s report.

Find questions561
Calculations

561 questions

  1. Q01.1

    June 2025 · Paper 1

    1 mark4.2.6 Hash tables
    The whole paper ↗
    June 2025 Paper 1, question 01.1: Explain why a record in a hash table can normally be found more quickly than a record in a sorted list. [1 mark]

  2. Q01.2

    June 2025 · Paper 1

    4 marks4.2.6 Hash tables
    The whole paper ↗
    June 2025 Paper 1, question 01.2: Describe the steps involved in adding a new record to a hash table. [4 marks]

  3. Q01.3

    June 2025 · Paper 1

    1 mark4.2.6 Hash tables
    The whole paper ↗
    June 2025 Paper 1, question 01.3: Explain why the time taken to find a specific record in a hash table can increase when lots of records are stored in the table. [1 mark]

  4. Q04

    November 2021 · Paper 1

    5 marks4.2.6 Hash tables
    The whole paper ↗
    November 2021 Paper 1, question 04: Describe the steps involved in adding a record to a hash table. [5 marks]
All 4 questions on Hash tables, as a list
  1. June 2025, Paper 1, Q01.1 (1 mark): Explain why a record in a hash table can normally be found more quickly than a record in a sorted list. [1 mark]
  2. June 2025, Paper 1, Q01.2 (4 marks): Describe the steps involved in adding a new record to a hash table. [4 marks]
  3. June 2025, Paper 1, Q01.3 (1 mark): Explain why the time taken to find a specific record in a hash table can increase when lots of records are stored in the table. [1 mark]
  4. November 2021, Paper 1, Q04 (5 marks): Describe the steps involved in adding a record to a hash table. [5 marks]

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.