GATE CS 2026 (Forenoon) — Question 17

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

Consider the following recurrence relations: For all \( n > 1 \),
\[ T_1(n) = 4T_1\left(\frac{n}{2}\right) + T_2(n) \]
\[ T_2(n) = 5T_2\left(\frac{n}{4}\right) + \theta(\log_2 n) \]
Assume that for all \( n \le 1 \), \( T_1(n) = 1 \) and \( T_2(n) = 1 \). Which one of the following options is correct?
  1. A
    \( T_1(n) = \theta(n^2) \)
  2. B
    \( T_1(n) = \theta(n^2 \log_2 n) \)
  3. C
    \( T_1(n) = \theta(n^{\log_4 5}) \)
  4. D
    \( T_1(n) = \theta(n^{\log_4 5} \log_2 n) \)
Practise the full 2026-FN paper
Challenge a friend: WhatsApp Telegram
From RENYXERAWhat rank do your marks get?GATE score, likely All-India Rank and qualifying marks for your category.
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