GATE CS 2026 (Afternoon) — Question 25

AlgorithmsAsymptotic Analysis (O, Omega, Theta Complexities)MSQ1 markMedium

Which of the following can be recurrence relation(s) corresponding to an algorithm with time complexity \( \Theta(n) \)?
  1. A
    \( T(n) = T(n - 1) + 1, \quad T(1) = 1 \)
  2. B
    \( T(n) = 2T\left(\frac{n}{2}\right) + 1, \quad T(1) = 1 \)
  3. C
    \( T(n) = 2T\left(\frac{n}{2}\right) + n, \quad T(1) = 1 \)
  4. D
    \( T(n) = T(n - 1) + n, \quad T(1) = 1 \)
Practise the full 2026-AN 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