SHSubjectHub

Stack frames and recursion

AQA 75174.1 L6A-levelLesson packSubscription
Also online

This worksheet marks itself

Set it as homework or classwork and every answer is marked as pupils go, with feedback on what they got wrong. The scores go straight into your mark book, so you can see who needs help before the next lesson.

  • 11 questions
  • 30 marks
  • about 35 minutes
  • marked instantly

Question types: short answer, multiple choice, matching, true or false.

Try it with a class, freeHow it works

Try one from this worksheet

State what this C# procedure prints when Show(3) is called. static void Show(int n) { if (n > 0) { Show(n - 1); Console.Write(n + " "); } }

Pick an answer: it's marked straight away, just as your pupils would see it.

About this resource

AQA A-level Computer Science (7517) 4.1.1.15 Role of stack frames in subroutine calls · 4.1.1.16 Recursive techniques. C# lesson 6 of 10 in 4.1 Programming: a trace-the-recursion Do Now, a short key idea, an 11-challenge ladder in three sets with exact test data, two exam questions and a workshee…

15 slides.

Lesson outline

  1. Do Now: trace the recursion
  2. Do Now: answers
  3. Key idea: Recursion and the call stack
  4. Key idea: Before or after the call?
  5. Set 1: base case first
  6. Set 2: make the problem smaller
  7. Exam question E1: base case and frames
  8. Model answer E1
  9. Exam question E2: why does it crash?
  10. Model answer E2
  11. Set 3: arrays
  12. Finished? harder recursion
Unit bundle4.1 Programming · full C# lessons
Part of: 4.1 Programming · full C# lessons: the whole unitEvery resource in the unit in one zip.

More from 4.1 Programming · full C# lessons