GATE CSE 2024 Session 2 Q15: Growth of T(n) = 5T(n−1) − 6T(n−2) with T(0)=1, T(1)=2
- Algorithms
- 1 mark
- MCQ
- −1/3 if wrong
Question
Let be the recurrence relation defined as follows:
Which one of the following statements is TRUE?
Try it: multiple choice: exactly one correct option
Wrong answer costs 1/3 mark in GATE.
Show answer and explanation
Answer: A (official GATE 2024 final answer key)
Concept used: Linear homogeneous recurrence: the initial conditions fix the coefficients of each root's term.
First step: The characteristic equation has roots 2 and 3, so ; solve for from .
Full step-by-step solution
Detailed working, common mistakes and linked mock tests will be available with a free GATEiit account. Log-in is coming soon.
Share this question
Source: official GATE 2024 Session 2 CS question paper and final answer key, organised by IISc Bangalore. Question paper · Answer key
More Algorithms PYQs
- 2026 Session 1 · Q17Solve nested recurrences T1 = 4T1(n/2) + T2, T2 = 5T2(n/4) + log n
- 2026 Session 1 · Q41Shortest paths with at most k edges: two statements
- 2026 Session 1 · Q47Condition forcing a vertex into every minimum vertex cover
- 2026 Session 1 · Q49Cycle and cut properties of MSTs with distinct weights
- 2026 Session 1 · Q50Impossible DFS discovery/finish orderings for a DAG edge
- 2026 Session 1 · Q55Properties of 2-colorable (bipartite) graphs