91¶¶Òõ

Please consent to cookies to view content.

' ); iframeDoc.close(); } } } } } const observer = new MutationObserver(switchSrc); observer.observe(document.documentElement, { childList: true, subtree: true, }); })();

91¶¶Òõ

Last updated

28 June 2026

docx, 15.56 KB
docx, 15.56 KB

The most thorough recursion revision resource for Cambridge A Level Computer Science 9618. Recursion questions regularly appear in Paper 2 and require students to both write recursive functions and trace them — skills that demand careful practice, all covered here.

What’s included:
• Learning Objectives aligned to 9618 syllabus
• Syllabus Mapping (Paper 2, Sections 2.3 & 2.4)
• Knowledge Organiser — base case, recursive case, call stack, stack overflow explained
• Complete Revision Notes — definition, call stack mechanics, factorial worked through step by step, recursion vs iteration comparison table
• Worked Examples — recursive factorial FUNCTION in full Cambridge pseudocode
• Common Mistakes — missing base case, wrong trace order, LIFO/FIFO confusion
• Examiner Tips — how to trace recursive calls (down then back up)
• Exam Technique — always identify base case before writing recursive case
• Exam-Style Questions (Fibonacci trace, sum function)
• Topic 91¶¶Òõt
• Mini Mock Exam
• Full Mock Exam
• Detailed Mark Scheme
• Model Answers
• Revision Checklist
• Progress Tracker
• Glossary

Essential for Cambridge 9618 Paper 2 and all courses covering recursion.

If you found this useful, please leave a review. it really helps!

Check out my other resources and bundles in my TES shop.

Reviews

Something went wrong, please try again later.

This resource hasn't been reviewed yet

To ensure quality for our reviews, only customers who have purchased this resource can review it

to let us know if it violates our terms and conditions.
Our customer service team will review your report and will be in touch.