Skip to content
Try on iPad

Classification of algorithms: AQA A‑Level Computer Science questions

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

Find questions561
Calculations

561 questions

  1. Q01.7

    June 2025 · Paper 1

    1 mark4.4.4 Classification of algorithms
    The whole paper ↗
    June 2025 Paper 1, question 01.7: Explain why both these sorting algorithms are tractable. [1 mark]

  2. Q03.1

    June 2024 · Paper 1

    2 marks4.4.4 Classification of algorithms
    The whole paper ↗
    June 2024 Paper 1, question 03.1: Describe the Halting problem. [2 marks]

  3. Q03.2

    June 2024 · Paper 1

    1 mark4.4.4 Classification of algorithms
    The whole paper ↗
    June 2024 Paper 1, question 03.2: Explain the importance of the Halting problem. [1 mark]

  4. Q03.5

    June 2023 · Paper 1

    1 mark4.4.4 Classification of algorithms
    The whole paper ↗
    June 2023 Paper 1, question 03.5: Explain why searching for an item in a list or tree is a tractable problem. [1 mark]

  5. Q03.6

    June 2023 · Paper 1

    2 marks4.4.4 Classification of algorithms
    The whole paper ↗
    June 2023 Paper 1, question 03.6: Heuristics can be used when working with an intractable problem. Explain what heuristics are. [2 marks]

  6. Q03.7

    June 2023 · Paper 1

    2 marks4.4.4 Classification of algorithms
    The whole paper ↗
    June 2023 Paper 1, question 03.7: Explain what is meant by constant time complexity. [2 marks]

  7. Q03.1

    November 2020 · Paper 1

    1 mark4.4.4 Classification of algorithms
    The whole paper ↗
    November 2020 Paper 1, question 03.1: There are four athletes taking part in a race. Each athlete is allocated a lane that they run in. There can only be one athlete in each lane and there are four

  8. Q03.2

    November 2020 · Paper 1

    1 mark4.4.4 Classification of algorithms
    The whole paper ↗
    November 2020 Paper 1, question 03.2: If there are n athletes taking part in a race and n lanes available, with each athlete being allocated to one lane and each lane only used by one athlete, how m

  9. Q03.3

    November 2020 · Paper 1

    1 mark4.4.4 Classification of algorithms
    The whole paper ↗
    November 2020 Paper 1, question 03.3: An anagram of a string is another string that contains exactly the same number of each character as in the original string but the characters may not all be in

  10. Q03.4

    November 2020 · Paper 1

    2 marks4.4.4 Classification of algorithms
    The whole paper ↗
    November 2020 Paper 1, question 03.4: The travelling salesperson problem (TSP) is when a salesperson has to visit every city in a set of cities and needs to find the shortest route that does this wi

  11. Q03.5

    November 2020 · Paper 1

    1 mark4.4.4 Classification of algorithms
    The whole paper ↗
    November 2020 Paper 1, question 03.5: Assuming that the time complexities in Figure 3 are for the most time efficient algorithm that solves a problem, how many of the time complexities in Figure 3 a
All 11 questions on Classification of algorithms, as a list
  1. June 2025, Paper 1, Q01.7 (1 mark): Explain why both these sorting algorithms are tractable. [1 mark]
  2. June 2024, Paper 1, Q03.1 (2 marks): Describe the Halting problem. [2 marks]
  3. June 2024, Paper 1, Q03.2 (1 mark): Explain the importance of the Halting problem. [1 mark]
  4. June 2023, Paper 1, Q03.5 (1 mark): Explain why searching for an item in a list or tree is a tractable problem. [1 mark]
  5. June 2023, Paper 1, Q03.6 (2 marks): Heuristics can be used when working with an intractable problem. Explain what heuristics are. [2 marks]
  6. June 2023, Paper 1, Q03.7 (2 marks): Explain what is meant by constant time complexity. [2 marks]
  7. November 2020, Paper 1, Q03.1 (1 mark): There are four athletes taking part in a race. Each athlete is allocated a lane that they run in. There can only be one athlete in each lane and there are four
  8. November 2020, Paper 1, Q03.2 (1 mark): If there are n athletes taking part in a race and n lanes available, with each athlete being allocated to one lane and each lane only used by one athlete, how m
  9. November 2020, Paper 1, Q03.3 (1 mark): An anagram of a string is another string that contains exactly the same number of each character as in the original string but the characters may not all be in
  10. November 2020, Paper 1, Q03.4 (2 marks): The travelling salesperson problem (TSP) is when a salesperson has to visit every city in a set of cities and needs to find the shortest route that does this wi
  11. November 2020, Paper 1, Q03.5 (1 mark): Assuming that the time complexities in Figure 3 are for the most time efficient algorithm that solves a problem, how many of the time complexities in Figure 3 a

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.