plumiAbstraction and automation: AQA A‑Level Computer Science questions
Every AQA A-Level Computer Science exam question on 4.4.1 Abstraction and automation, 2020–2025, with its mark scheme and examiner’s report.
Find questions561
Calculations
![June 2025 Paper 1, question 02: Define the term decomposition. [2 marks] Dijkstra’s algorithm is an example of a breadth-first traversal algorithm.](https://pub-e8a9dbab8e2a4d089f52b2a45e0d0b50.r2.dev/bank/75171-jun25-02-qp.webp?v=3)
![June 2025 AS Paper 1, question 01: Figure 1 shows the data structures Letter, L and R used by the algorithm shown in Figure 2. Figure 1 Letter L R [0] [0] 5 [0] 20 [1] A [1] 18 [1] 23 [2] B [2] -](https://pub-e8a9dbab8e2a4d089f52b2a45e0d0b50.r2.dev/bank/75161-jun25-01-qp.webp?v=3)
Q03.3
The whole paper ↗![June 2025 AS Paper 1, question 03.3: State one reason why the algorithm in Figure 5 is not efficient. [1 mark]](https://pub-e8a9dbab8e2a4d089f52b2a45e0d0b50.r2.dev/bank/75161-jun25-03-3-qp.webp?v=3)
![June 2025 AS Paper 1, question 05: Explain what is meant by data abstraction. [1 mark]](https://pub-e8a9dbab8e2a4d089f52b2a45e0d0b50.r2.dev/bank/75161-jun25-05-qp.webp?v=3)
![June 2024 AS Paper 1, question 01: Figure 1 S1 ← "011101" S2 ← "001100" C ← "0" R ← "" FOR J = 0 TO 5 X ← 5 - J D1 ← S1[X] D2 ← S2[X] IF C = "0" THEN IF D1 = D2 THEN S ← "0" C ← D1 ELSE S ← "1" E](https://pub-e8a9dbab8e2a4d089f52b2a45e0d0b50.r2.dev/bank/75161-jun24-01-qp.webp?v=3)
Q02.1
The whole paper ↗![June 2023 Paper 1, question 02.1: After they have both replied to Tabitha’s first question, what does Lionel now know about Tabitha’s choice because Walter said “No”? [1 mark]](https://pub-e8a9dbab8e2a4d089f52b2a45e0d0b50.r2.dev/bank/75171-jun23-02-1-qp.webp?v=3)
Q02.2
The whole paper ↗![June 2023 Paper 1, question 02.2: After they have both replied to Tabitha’s first question, what does Walter now know about Tabitha’s choice because Lionel said “No”? [1 mark]](https://pub-e8a9dbab8e2a4d089f52b2a45e0d0b50.r2.dev/bank/75171-jun23-02-2-qp.webp?v=3)
Q02.3
The whole paper ↗![June 2023 Paper 1, question 02.3: Which coloured shape had Tabitha chosen? [1 mark] for the next question](https://pub-e8a9dbab8e2a4d089f52b2a45e0d0b50.r2.dev/bank/75171-jun23-02-3-qp.webp?v=3)
![June 2023 AS Paper 1, question 02: The algorithm, represented using pseudo-code in Figure 2, describes a method to rearrange four numbers in a data structure. Figure 2 Numbers[0] ← 45 Numbers[1]](https://pub-e8a9dbab8e2a4d089f52b2a45e0d0b50.r2.dev/bank/75161-jun23-02-qp.webp?v=3)
![June 2023 AS Paper 1, question 04: Define the term algorithm. [2 marks]](https://pub-e8a9dbab8e2a4d089f52b2a45e0d0b50.r2.dev/bank/75161-jun23-04-qp.webp?v=3)
Q03.1
The whole paper ↗![June 2022 Paper 1, question 03.1: Explain why Statement 1 is not correct. [1 mark]](https://pub-e8a9dbab8e2a4d089f52b2a45e0d0b50.r2.dev/bank/75171-jun22-03-1-qp.webp?v=3)
Q03.2
The whole paper ↗![June 2022 Paper 1, question 03.2: Which one of the six statements in Figure 2 is correct? [1 mark]](https://pub-e8a9dbab8e2a4d089f52b2a45e0d0b50.r2.dev/bank/75171-jun22-03-2-qp.webp?v=3)
Q03.3
The whole paper ↗![June 2022 Paper 1, question 03.3: For two statements other than Statement 1 and your answer to Question 03.2, explain why those statements are not correct. [2 marks]](https://pub-e8a9dbab8e2a4d089f52b2a45e0d0b50.r2.dev/bank/75171-jun22-03-3-qp.webp?v=3)
![November 2021 Paper 1, question 03: Explain what is meant by procedural decomposition. [3 marks]](https://pub-e8a9dbab8e2a4d089f52b2a45e0d0b50.r2.dev/bank/75171-nov21-03-qp.webp?v=3)
Q02.1
The whole paper ↗
Q02.2
The whole paper ↗![November 2020 AS Paper 1, question 02.2: Comment on the result of the trace and describe how the algorithm should be modified. [2 marks]](https://pub-e8a9dbab8e2a4d089f52b2a45e0d0b50.r2.dev/bank/75161-nov20-02-2-qp.webp?v=3)
Q03.3
The whole paper ↗![November 2020 AS Paper 1, question 03.3: What is true for all valid inputs for X that output a number of numbers which is not true for all other valid inputs that output No result? [1 mark]](https://pub-e8a9dbab8e2a4d089f52b2a45e0d0b50.r2.dev/bank/75161-nov20-03-3-qp.webp?v=3)
All 18 questions on Abstraction and automation, as a list
- June 2025, Paper 1, Q02 (2 marks): Define the term decomposition. [2 marks] Dijkstra’s algorithm is an example of a breadth-first traversal algorithm.
- June 2025, AS Paper 1, Q01 (3 marks): Figure 1 shows the data structures Letter, L and R used by the algorithm shown in Figure 2. Figure 1 Letter L R [0] [0] 5 [0] 20 [1] A [1] 18 [1] 23 [2] B [2] -
- June 2025, AS Paper 1, Q03.3 (1 mark): State one reason why the algorithm in Figure 5 is not efficient. [1 mark]
- June 2025, AS Paper 1, Q05 (1 mark): Explain what is meant by data abstraction. [1 mark]
- June 2024, AS Paper 1, Q01 (5 marks): Figure 1 S1 ← "011101" S2 ← "001100" C ← "0" R ← "" FOR J = 0 TO 5 X ← 5 - J D1 ← S1[X] D2 ← S2[X] IF C = "0" THEN IF D1 = D2 THEN S ← "0" C ← D1 ELSE S ← "1" E
- June 2023, Paper 1, Q02.1 (1 mark): After they have both replied to Tabitha’s first question, what does Lionel now know about Tabitha’s choice because Walter said “No”? [1 mark]
- June 2023, Paper 1, Q02.2 (1 mark): After they have both replied to Tabitha’s first question, what does Walter now know about Tabitha’s choice because Lionel said “No”? [1 mark]
- June 2023, Paper 1, Q02.3 (1 mark): Which coloured shape had Tabitha chosen? [1 mark] for the next question
- June 2023, AS Paper 1, Q02 (5 marks): The algorithm, represented using pseudo-code in Figure 2, describes a method to rearrange four numbers in a data structure. Figure 2 Numbers[0] ← 45 Numbers[1]
- June 2023, AS Paper 1, Q04 (2 marks): Define the term algorithm. [2 marks]
- June 2022, Paper 1, Q03.1 (1 mark): Explain why Statement 1 is not correct. [1 mark]
- June 2022, Paper 1, Q03.2 (1 mark): Which one of the six statements in Figure 2 is correct? [1 mark]
- June 2022, Paper 1, Q03.3 (2 marks): For two statements other than Statement 1 and your answer to Question 03.2, explain why those statements are not correct. [2 marks]
- June 2022, AS Paper 1, Q01 (5 marks): The algorithm, represented using pseudo-code in Figure 1, describes a method to access numbers in the data structure, List, shown in Table 1. Figure 1 SUBROUTIN
- November 2021, Paper 1, Q03 (3 marks): Explain what is meant by procedural decomposition. [3 marks]
- November 2020, AS Paper 1, Q02.1 (3 marks): Complete Table 1 by hand-tracing the algorithm in Figure 1. You may not need to use all the rows in Table 1. The first row of Table 1 has already been completed
- November 2020, AS Paper 1, Q02.2 (2 marks): Comment on the result of the trace and describe how the algorithm should be modified. [2 marks]
- November 2020, AS Paper 1, Q03.3 (1 mark): What is true for all valid inputs for X that output a number of numbers which is not true for all other valid inputs that output No result? [1 mark]
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.