Algorithms & Complexity
Topic overview
Search, recursion, growth rates and reasoning training given simple rules; professional algorithms whose definitions are not provided are not required.
Key concepts
Supplementary assessment for some colleges; currently available public sources are insufficient to confirm the paper structure on this site. For preparation training only; no claim is made that it is a current full mock paper.
Key points
- ◆Follow the prerequisite knowledge requirements given by the examination body; new concepts may only be used when the question provides sufficient guidance.
- ◆The examples on this site are training with a limited scope and do not represent full syllabus coverage or official difficulty.
Worked examples
Try each example yourself before checking the explanation.
A robot starts at 1. At each step it may double its current number or add 3.
Find a shortest sequence of operations that reaches 29.
Describe an algorithm that finds a shortest sequence to any reachable target n, and justify why it is shortest.
Give a target that is not reachable and prove it.
Ready to practise this topic?
Practise the available questions for this topic. Difficulty labels are platform references.
Practise Algorithms & Complexity →