A Level Computer Science 9618, topic 19.2
Recursion: past paper questions
16 Cambridge A Level Computer Science 9618 questions on Recursion (19.2) from 16 papers, 2023 to 2026. Open the paper or try a question free.
Practising builds a set from this topic, free with an account. One question opens straight away, with no account.
- Questions
- 16
- Papers
- 16
- Years
- 2023 to 2026
- Total marks
- 225
- Average per question
- 14.1 marks
- Largest question
- 30 marks
By type: Structured 16
How hard the questions are
- Recall4
- Apply11
- Analyse1
- Not banded0
Derived from the command word Cambridge prints in each question, banded by a fixed table beside the syllabus's own definitions. A question printing no command word is unbanded: unknown, not middling.
Command words
- writeRecall10 questions
write an answer in a specific way
- completeApply7 questions
add information to an incomplete diagram or table
- useApply5 questions
- describeApply4 questions
state the points of a topic / give characteristics and main features
- findApply3 questions
- explainAnalyse1 question
set out purposes or reasons / make the relationships between things clear / say why and/or how and support with relevant evidence
- identifyRecall1 question
name/select/recognise
- stateRecall1 question
express in clear terms
Where the questions come from
By year
- 20261
- 20259
- 20241
- 20235
By session
- May/June8
- Oct/Nov8
By paper
- Paper 38
- Paper 48
Questions on this topic
Showing 14 of 16, spread across the years. Open one to write your answer and have it marked.
- Try this questionQuestion 3May/June 2026, paper 43Structured25 marksHas a diagram
A binary tree is designed to store up to 100 positive integers. The binary tree stores data in ascending numerical order.
- Try this questionQuestion 9Oct/Nov 2025, paper 31Structured9 marks
A stack has been implemented using pseudocode to store a maximum of 100 string items using the global variables in the following table: Identifier | Data type…
- Try this questionQuestion 3May/June 2024, paper 42Structured23 marks
A program sorts an array of integers and searches the array for a particular value. The array of integers, NumberArray, stores the following data in the order given: 100 85 644 22 15 8 1 The array is declared and initialised local to the main program.
- Try this questionQuestion 1Oct/Nov 2023, paper 41Structured16 marks
This iterative pseudocode algorithm for the function IterativeVowels() takes a string as a parameter and counts the number of lower-case vowels in this string.
- Try this questionQuestion 12Oct/Nov 2025, paper 32Structured9 marks
A stack has been implemented using pseudocode to store a maximum of 100 string items using the global variables in the following table: Identifier Data type…
- Try this questionQuestion 2Oct/Nov 2023, paper 42Structured17 marks
An integer is said to be divisible by another integer if the result of the division is also an integer.
- Try this questionQuestion 11Oct/Nov 2025, paper 33Structured3 marks
Describe when the use of recursion would be beneficial and give an example.
- Try this questionQuestion 2Oct/Nov 2025, paper 42Structured26 marks
A program stores 20 unique random integers between 0 and 100 (inclusive) in a 1D array that is local to the main program. Write program code to declare the array local to the main program and store 20 unique random numbers between 0 and 100 (inclusive) in the array.
- Try this questionQuestion 12May/June 2023, paper 31Structured7 marks
Describe what is meant by recursion.
- Try this questionQuestion 3Oct/Nov 2025, paper 43Structured20 marks
A program is written to perform different individual processes using arrays. (a) A 1D array stores 10 integers.
- Try this questionQuestion 4May/June 2025, paper 31Structured7 marksHas a diagram
A linked list of nodes is used to store an ordered list of integers. Each node consists of the data, a left pointer and a right pointer, for example: Left pointer Data Right pointer 20 The linked list will be organised as a binary tree. −1 is used to represent a null pointer.
- Try this questionQuestion 11May/June 2025, paper 32Structured6 marksHas a diagram
A linked list of nodes is used to store an ordered list of strings. Each node consists of the data, a left pointer and a right pointer. The linked list will be organised as a binary tree.
- Try this questionQuestion 13May/June 2025, paper 33Structured4 marks
The recursive procedure Delete() is defined as follows: PROCEDURE Delete(Index, Target) IF Numbers[Index] > 0 THEN IF Numbers[Index] >= Target THEN…
- Try this questionQuestion 3May/June 2025, paper 41Structured30 marks
A program stores data in a binary tree that is designed using Object-Oriented Programming (OOP). The tree stores data in ascending numerical order, for example: 30 20 45 1 21 33 63 The class Node stores data about the nodes.