A Level 9618 · Paper 3 · 19.2
Recursion
Routines that call themselves, and how the computer keeps track of them. Try the past-paper questions, then check the mark scheme.
Past papers from November 2021 to November 20259 questions · 35 marks
In this subtopic
- What makes an algorithm recursive
- Writing and tracing recursive algorithms
- When recursion is a good choice
- How a compiler uses a stack, and unwinding
Notes for 19.2 are on the way.
The past-paper questions and the mark scheme for this subtopic are ready now.
Past-paper questions and mark schemes © Cambridge University Press & Assessment. Compiled for revision by Zain Merchant.
Past-paper questions and mark schemes © Cambridge University Press & Assessment. Compiled for revision by Zain Merchant.
Try the questions first.
Write your answers, then check them against the mark scheme. Your choice is remembered on this device.