plumiSearching algorithms: AQA GCSE Computer Science questions
Every AQA GCSE Computer Science exam question on 3.1.3 Searching algorithms, 2022–2025, with its mark scheme and examiner’s report.
Paper
All papers
Exam
All years
Calculations
Q06.4
The whole paper ↗Q06.4
The whole paper ↗Q06.4
The whole paper ↗Q12.1
The whole paper ↗Q12.2
The whole paper ↗Q12.3
The whole paper ↗Q12.1
The whole paper ↗Q12.2
The whole paper ↗Q12.3
The whole paper ↗Q12.1
The whole paper ↗Q12.2
The whole paper ↗Q12.3
The whole paper ↗
All 15 questions on Searching algorithms, as a list
- June 2025, Paper 1 (C#), Q06.4 (2 marks): The programmer has an array of 2500 numbers, stored in ascending order (smallest to largest). The programmer needs to write a program to search for a value in t
- June 2025, Paper 1 (Python), Q06.4 (2 marks): The programmer has an array of 2500 numbers, stored in ascending order (smallest to largest). The programmer needs to write a program to search for a value in t
- June 2025, Paper 1 (VB.NET), Q06.4 (2 marks): The programmer has an array of 2500 numbers, stored in ascending order (smallest to largest). The programmer needs to write a program to search for a value in t
- June 2024, Paper 1 (C#), Q13 (3 marks): Explain how the linear search algorithm works. [3 marks]
- June 2024, Paper 1 (Python), Q13 (3 marks): Explain how the linear search algorithm works. [3 marks]
- June 2024, Paper 1 (VB.NET), Q13 (3 marks): Explain how the linear search algorithm works. [3 marks]
- June 2023, Paper 1 (C#), Q12.1 (4 marks): Figure 11 shows a binary search algorithm that has been programmed in C#. The CompareTo method is used to compare two strings. It returns: • –1 if the first str
- June 2023, Paper 1 (C#), Q12.2 (7 marks): Figure 12 shows a line of C# code that creates an array of fruit names. Figure 12 string[] fruits = {"banana", "apple", "orange", "pear", "grape", "pineapple"};
- June 2023, Paper 1 (C#), Q12.3 (1 mark): State why a binary search cannot be used on the array fruits [1 mark]
- June 2023, Paper 1 (Python), Q12.1 (4 marks): Figure 11 shows a binary search algorithm that has been programmed in Python. Figure 11 animals = ["cat", "dog", "hippo", "llama", "ox", "rat", "tiger", "wolf"]
- June 2023, Paper 1 (Python), Q12.2 (7 marks): Figure 12 shows a line of Python code that creates a list of fruit names. Figure 12 fruits = ["banana", "apple", "orange", "pear", "grape", "pineapple"] Extend
- June 2023, Paper 1 (Python), Q12.3 (1 mark): State why a binary search cannot be used on the list fruits [1 mark]
- June 2023, Paper 1 (VB.NET), Q12.1 (4 marks): Figure 11 shows a binary search algorithm that has been programmed in VB.NET. Figure 11 Dim animals As string() = {"cat", "dog", "hippo", "llama", "ox", "rat",
- June 2023, Paper 1 (VB.NET), Q12.2 (7 marks): Figure 12 shows a line of VB.NET code that creates an array of fruit names. Figure 12 Dim fruits() As String = {"banana", "apple", "orange", "pear", "grape", "p
- June 2023, Paper 1 (VB.NET), Q12.3 (1 mark): State why a binary search cannot be used on the array fruits [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.