GATE CS 2024 (Afternoon) — Question 15

Discrete MathematicsRecurrence Relations and Generating FunctionsMCQ1 mark · −1/3 if wrongMedium

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 \ge 2 \) Which one of the following statements is TRUE?
  1. A
    \( T(n) = \Theta(2^n) \)
  2. B
    \( T(n) = \Theta(n2^n) \)
  3. C
    \( T(n) = \Theta(3^n) \)
  4. D
    \( T(n) = \Theta(n3^n) \)
Practise the full 2024-AN paper
Challenge a friend: WhatsApp Telegram
From RENYXERAPractise this subject in the exam simulatorTimed, GATE-style tests with analytics that find your weak topics.
Practise more on Recurrence Relations and Generating FunctionsTimed, in the real exam interface · free to start

A GATE question every morning

One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.

Join
Stuck? Ask in the student group