plumiAQA A‑Level Computer Science questions by topic
Every question from every AQA A-Level Computer Science paper, 2020–2025, part by part. Filter by topic, paper or year, open the mark scheme under any question, and download a set as a PDF. Paper 1 is sat on screen around a Skeleton Program AQA gives schools before the exam: its written questions and its programming task are here; the questions on the Skeleton Program, which can’t be answered without it, are left out.
Find questions561
Q01.1
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]](https://pub-e8a9dbab8e2a4d089f52b2a45e0d0b50.r2.dev/bank/75171-jun25-01-1-qp.webp?v=3)
Q01.2
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]](https://pub-e8a9dbab8e2a4d089f52b2a45e0d0b50.r2.dev/bank/75171-jun25-01-2-qp.webp?v=3)
Q01.3
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]](https://pub-e8a9dbab8e2a4d089f52b2a45e0d0b50.r2.dev/bank/75171-jun25-01-3-qp.webp?v=3)
Q01.4
The whole paper ↗![June 2025 Paper 1, question 01.4: Explain why the linear search algorithm has time complexity of O(n). [1 mark]](https://pub-e8a9dbab8e2a4d089f52b2a45e0d0b50.r2.dev/bank/75171-jun25-01-4-qp.webp?v=3)
Q01.5
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]](https://pub-e8a9dbab8e2a4d089f52b2a45e0d0b50.r2.dev/bank/75171-jun25-01-5-qp.webp?v=3)
Q01.6
The whole paper ↗![June 2025 Paper 1, question 01.6: State one advantage of a linear search compared to a binary search. [1 mark]](https://pub-e8a9dbab8e2a4d089f52b2a45e0d0b50.r2.dev/bank/75171-jun25-01-6-qp.webp?v=3)
Q01.7
The whole paper ↗![June 2025 Paper 1, question 01.7: Explain why both these sorting algorithms are tractable. [1 mark]](https://pub-e8a9dbab8e2a4d089f52b2a45e0d0b50.r2.dev/bank/75171-jun25-01-7-qp.webp?v=3)
Q01.8
The whole paper ↗![June 2025 Paper 1, question 01.8: After how many passes is bubble sort guaranteed to have sorted any list of 100 items? [1 mark]](https://pub-e8a9dbab8e2a4d089f52b2a45e0d0b50.r2.dev/bank/75171-jun25-01-8-qp.webp?v=3)
![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)
Q03.1
The whole paper ↗![June 2025 Paper 1, question 03.1: State the purpose of Dijkstra’s algorithm. [1 mark]](https://pub-e8a9dbab8e2a4d089f52b2a45e0d0b50.r2.dev/bank/75171-jun25-03-1-qp.webp?v=3)
Q03.2
The whole paper ↗![June 2025 Paper 1, question 03.2: State both the reasons why the graph in Figure 1 is not a tree. [2 marks]](https://pub-e8a9dbab8e2a4d089f52b2a45e0d0b50.r2.dev/bank/75171-jun25-03-2-qp.webp?v=3)
Q03.3
The whole paper ↗
Q03.4
The whole paper ↗![June 2025 Paper 1, question 03.4: Describe one of the base cases for the recursive subroutine Traverse. [1 mark] Figure 4 shows a trace table for the subroutine call Traverse(1, 6) The subroutin](https://pub-e8a9dbab8e2a4d089f52b2a45e0d0b50.r2.dev/bank/75171-jun25-03-4-qp.webp?v=3)
Q03.5
The whole paper ↗
Q04.1
The whole paper ↗![June 2025 Paper 1, question 04.1: Your PROGRAM SOURCE CODE. [12 marks]](https://pub-e8a9dbab8e2a4d089f52b2a45e0d0b50.r2.dev/bank/75171-jun25-04-1-qp.webp?v=3)
Q04.2
The whole paper ↗
Q01.1
The whole paper ↗
Q01.2
The whole paper ↗![June 2025 Paper 2, question 01.2: One function of the operating system is to allocate I/O devices to competing processes. Describe two other functions of an operating system. [2 marks] Function](https://pub-e8a9dbab8e2a4d089f52b2a45e0d0b50.r2.dev/bank/75172-jun25-01-2-qp.webp?v=3)
Q01.3
The whole paper ↗
Q02.1
The whole paper ↗
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.