Are these Recursion notes free?

Yes. The full 3-page Recursion sheet is free inside CapCompass, which runs in your browser with no account needed.

What does the Recursion revision sheet cover?

What makes a method recursive, Factorial, written recursively, Base case against recursive case, Base case, Recursive case, Tracing fact(3) call by call, What the call stack is doing, Recursion against iteration, Recursion, Iteration, Fibonacci, the recursive case with two calls, Traps that cost marks.

Is this for Class 11 ISC Computer Science?

Yes, it is written for the ISC Computer Science syllabus.

🧭 CapCompassfree study planner

Recursion — Class 11 ISC Computer Science revision notes

A 3-page visual revision sheet for Recursion, written for Class 11 ISC Computer Science. Formulas, diagrams and the traps that cost marks, laid out to be read the night before rather than the term before. Free, and it opens inside CapCompass.

Recursion revision notes, page 1 of 3 — A preview of page 1 — all 3 pages open full size in the app.

Recursion in one look

a method that finishes its own job by calling a smaller copy of itself

What makes a method recursive

a recursive method calls itself, but always on a smaller or simpler version of the same problem
every recursive method needs a base case, a version of the problem small enough to answer directly, with no further call
it also needs a recursive case, which does a small piece of work and then calls itself on what remains
without a base case that is actually reached, the calls never stop, and the program fails with a stack overflow error

Factorial, written recursively

public int fact(int n) starts with the base case: if n equals 0, return 1
otherwise, the recursive case runs: return n times fact(n minus 1)
each call passes a smaller n down, and n keeps shrinking by exactly 1 every time, so it is guaranteed to reach 0 eventually
the multiplication in each call cannot actually happen until the call it depends on has returned a value

Base case against recursive case

Base case

answered directly, with no further call made
must actually be reachable from every starting value the method is given

Recursive case

does one small piece of work, then calls the method again on a smaller version of the problem
must move the input closer to the base case on every single call

Page 1 of 3. The full sheet, all 3 pages, opens free in the app.

What this Recursion sheet covers

What makes a method recursive
Factorial, written recursively
Base case against recursive case
Base case
Recursive case
Tracing fact(3) call by call
What the call stack is doing
Recursion against iteration
Recursion
Iteration
Fibonacci, the recursive case with two calls
Traps that cost marks
Tricks that save time

Open the full Recursion sheet →Free, works offline, no account needed. All 3 pages, plus a study plan built around your own exam dates.

How CapCompass uses this sheet

These notes are not a standalone PDF. CapCompass plans Computer Science chapter by chapter against your real exam dates and free hours, and when the plan reaches Recursion the sheet opens inside the study block itself — at the page covering the sub-topic that block is on, with the timer still running. Revision arrives at the moment the plan says revise, instead of having to be gone looking for.