Recursion

Term Check

Jump to a topic

See every item in the sequence

Definition

A subroutine that calls itself on a smaller version of the problem until it reaches a base case that stops it.

Example: Factorial: n * factorial(n-1) with base case n = 0.

Check this one: Not named in the 2022 syllabus text; included because of the functional paradigm and past SDD coding questions.

Found in: course specifications.

Where you'll use it in the test

Syllabus area: Y11 Programming Fundamentals.

Question types it can appear in

Multiple choice: Pick the option that matches the definition or example.
Code reading: Code or algorithm reading: interpret a fragment and state its output or purpose.
Python: Write or complete it in the online Python tool.

How to use it

A model sentence

General advice, built from the definition and example above

“A subroutine that calls itself on a smaller version of the problem until it reaches a base case that stops it.” Then apply it: Factorial: n * factorial(n-1) with base case n = 0.

In a short answer, give the definition in your own words first, then tie it to the situation in the question. Do not copy the example above unless it fits the scenario.

Go deeper

Flashcard: Recursion in Programming Fundamentals (Year 11) · study that set
Memorise: Software development steps and algorithm design
Notes: Programming paradigms (Year 11 content (Programming fundamentals, OOP, Mechatronics))
Full term page: every question, note and marking comment for Recursion

Check yourself

Explain “Recursion” in one sentence, give an example, and name a question type that could test it.

Reveal the answer

A subroutine that calls itself on a smaller version of the problem until it reaches a base case that stops it.

Example: Factorial: n * factorial(n-1) with base case n = 0.

Could be tested as: Multiple choice, Code reading, Python.