Loading previous year questions
Algorithms · Recursion
Official IIT answer key · IIT Delhi · Audited Aug 2026
GATE CSE 2012 Q16 · MCQ · 1 mark
Key concept
No account needed
Sit 1 related RecursionPYQs as a guest. We'll score the set and show which traps cost marks — sign in only if you want to save the run.
Topic notes
GATE tests recursion under Algorithms by evaluating the ability to formulate exact recurrence relations for classic recursive paradigms and puzzles, such as the Towers of Hanoi. Questions assess whether candidates understand the subproblem structure (number of recursive calls and subproblem size) and the non-recursive work performed at each step.
Full Recursion guide →The recurrence relation capturing the optimal execution time of the Towers of Hanoi problem with n discs is
Topic-wise GATE CS PYQs with verified steps
Independent practice explanation verified by the GateAI team. GATE is conducted by the IITs; question text follows the official paper.