Skip to content
Try on iPad

Searching algorithms: AQA A‑Level Computer Science questions

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

Find questions561
Calculations

561 questions

  1. Q01.4

    June 2025 · Paper 1

    1 mark4.3.4 Searching algorithms
    The whole paper ↗
    June 2025 Paper 1, question 01.4: Explain why the linear search algorithm has time complexity of O(n). [1 mark]

  2. Q01.5

    June 2025 · Paper 1

    1 mark4.3.4 Searching algorithms
    The whole paper ↗
    June 2025 Paper 1, question 01.5: Explain why the binary search algorithm has time complexity of O(log n). [1 mark]

  3. Q01.6

    June 2025 · Paper 1

    1 mark4.3.4 Searching algorithms
    The whole paper ↗
    June 2025 Paper 1, question 01.6: State one advantage of a linear search compared to a binary search. [1 mark]

  4. Q03.2

    June 2023 · Paper 1

    4 marks4.3.4 Searching algorithms
    The whole paper ↗
    June 2023 Paper 1, question 03.2: Figure 2 shows a binary tree and its representation using an array of records called Tree. Each record consists of three fields, Data, Left and Right. Figure 2

  5. Q03.3

    June 2023 · Paper 1

    1 mark4.3.4 Searching algorithms
    The whole paper ↗
    June 2023 Paper 1, question 03.3: There are similarities in how the binary tree search and the binary search algorithms work. State the big-O time complexity of the binary search algorithm. [1 m

  6. Q03.4

    June 2023 · Paper 1

    1 mark4.3.4 Searching algorithms
    The whole paper ↗
    June 2023 Paper 1, question 03.4: Explain why the binary search algorithm has the time complexity stated in your answer for 03.3. [1 mark]

  7. Q01

    June 2022 · Paper 1

    3 marks4.3.4 Searching algorithms4.3.5 Sorting algorithms
    The whole paper ↗
    June 2022 Paper 1, question 01: Big-O notation is used to express the time complexity of an algorithm. Table 1 contains a list of algorithms. State the Big-O time complexity of each of these a

  8. Q03.6

    November 2020 · Paper 1

    2 marks4.3.4 Searching algorithms
    The whole paper ↗
    November 2020 Paper 1, question 03.6: State which of the time complexities shown in Figure 3 is the time complexity of the linear search algorithm and explain why it has that time complexity. [2 mar

  9. Q03.7

    November 2020 · Paper 1

    2 marks4.3.4 Searching algorithms
    The whole paper ↗
    November 2020 Paper 1, question 03.7: State which of the time complexities shown in Figure 3 is the time complexity of the binary search algorithm and explain why it has that time complexity. [2 mar
All 9 questions on Searching algorithms, as a list
  1. June 2025, Paper 1, Q01.4 (1 mark): Explain why the linear search algorithm has time complexity of O(n). [1 mark]
  2. June 2025, Paper 1, Q01.5 (1 mark): Explain why the binary search algorithm has time complexity of O(log n). [1 mark]
  3. June 2025, Paper 1, Q01.6 (1 mark): State one advantage of a linear search compared to a binary search. [1 mark]
  4. June 2023, Paper 1, Q03.2 (4 marks): Figure 2 shows a binary tree and its representation using an array of records called Tree. Each record consists of three fields, Data, Left and Right. Figure 2
  5. June 2023, Paper 1, Q03.3 (1 mark): There are similarities in how the binary tree search and the binary search algorithms work. State the big-O time complexity of the binary search algorithm. [1 m
  6. June 2023, Paper 1, Q03.4 (1 mark): Explain why the binary search algorithm has the time complexity stated in your answer for 03.3. [1 mark]
  7. June 2022, Paper 1, Q01 (3 marks): Big-O notation is used to express the time complexity of an algorithm. Table 1 contains a list of algorithms. State the Big-O time complexity of each of these a
  8. November 2020, Paper 1, Q03.6 (2 marks): State which of the time complexities shown in Figure 3 is the time complexity of the linear search algorithm and explain why it has that time complexity. [2 mar
  9. November 2020, Paper 1, Q03.7 (2 marks): State which of the time complexities shown in Figure 3 is the time complexity of the binary search algorithm and explain why it has that time complexity. [2 mar

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.