Loading previous year questions
Engineering Mathematics · Recurrence Relations
Official IIT answer key · IISc Bangalore · Audited Aug 2026
GATE CSE 2024 Set 2 Q15 · MCQ · 1 mark
Key concept
No account needed
Sit 4 related Recurrence RelationsPYQs 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
In GATE CS, Recurrence Relations under Engineering Mathematics is tested as a concise 1-mark topic focused on linear homogeneous recurrence relations of degree 2. Questions either require setting up a recurrence relation from a combinatorial constraint (e.g., restricted binary strings) or solving a second-order linear recurrence relation using characteristic roots to find either an explicit closed-form formula or its asymptotic tight bound ( ). All provided PYQs are conceptual, analytical 1-mark multiple-choice questions without diagrams.
Full Recurrence Relations guide →Let T(n) be the recurrence relation defined as follows: T(0) = 1, T(1) = 2, and T(n) = 5T(n - 1) - 6T(n - 2) for n 2 Which one of the following statements is TRUE?
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.