GATE CS 2025 (Forenoon) — Question 20

AlgorithmsAsymptotic Analysis (O, Omega, Theta Complexities)MCQ1 mark · −1/3 if wrongHard

Consider the following recurrence relation: \( T(n) = 2T(n - 1) + n2^n \) for \( n > 0 \), \( T(0) = 1 \) Which ONE of the following options is CORRECT?
  1. A
    \( T(n) = \Theta(n^2 2^n) \)
  2. B
    \( T(n) = \Theta(n 2^n) \)
  3. C
    \( T(n) = \Theta((\log n)^2 2^n) \)
  4. D
    \( T(n) = \Theta(4^n) \)
Practise the full 2025-FN paper
Challenge a friend: WhatsApp Telegram
Recommended book · affiliate linkIntroduction to Algorithms (CLRS)The standard reference behind most GATE algorithm questions.
Practise more on Asymptotic Analysis (O, Omega, Theta Complexities)Timed, 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