GateAI
Asymptotic Analysis

GATE CSE 2026 Set 1 · Q17

MCQ1 markMedium

Time

Consider the following recurrence relations: For all n>1n > 1, T1(n)=4T1(n2)+T2(n)T_1(n) = 4T_1\left(\frac{n}{2}\right) + T_2(n) T2(n)=5T2(n4)+Θ(log⁡2n)T_2(n) = 5T_2\left(\frac{n}{4}\right) + \Theta(\log_2 n) Assume that for all n≤1n \le 1, T1(n)=1T_1(n) = 1 and T2(n)=1T_2(n) = 1. Which one of the following options is correct?

Select one answerSingle correct

Pick an option to check

Solution

Step-by-step verified solution

Official answer: A) T1(n) = (n2)

Asymptotic Analysis

First, solve the recurrence for T2(n)T_2(n) using the Master Theorem:

T2(n)=5T2(n4)+Θ(log⁡2n)T_2(n) = 5T_2\left(\frac{n}{4}\right) + \Theta(\log_2 n)

Here, a=5a = 5, b=4b = 4, and f(n)=Θ(log⁡2n)f(n) = \Theta(\log_2 n).

Compare f(n)f(n) with nlog⁡ba=nlog⁡45≈n1.161n^{\log_b a} = n^{\log_4 5} \approx n^{1.161}: Since f(n)=O(nlog⁡45−ϵ)f(n) = O\left(n^{\log_4 5 - \epsilon}\right) for ϵ>0\epsilon > 0, by Case 1 of the Master Theorem:

T2(n)=Θ(nlog⁡45)T_2(n) = \Theta\left(n^{\log_4 5}\right)

Now substitute T2(n)T_2(n) into the recurrence for T1(n)T_1(n):

T1(n)=4T1(n2)+Θ(nlog⁡45)T_1(n) = 4T_1\left(\frac{n}{2}\right) + \Theta\left(n^{\log_4 5}\right)

Here, a=4a = 4, b=2b = 2, and f(n)=Θ(nlog⁡45)f(n) = \Theta\left(n^{\log_4 5}\right).

Calculate nlog⁡ban^{\log_b a}:

nlog⁡24=n2n^{\log_2 4} = n^2

Since log⁡45≈1.161<2\log_4 5 \approx 1.161 < 2, we have f(n)=O(n2−ϵ)f(n) = O\left(n^{2 - \epsilon}\right) for some ϵ>0\epsilon > 0.

By Case 1 of the Master Theorem:

T1(n)=Θ(n2)T_1(n) = \Theta\left(n^2\right)

Thus, the correct option is (A).

Try the question first, then check your work.

Think the official key or this write-up is wrong?

Report error or challenge

Examiner trap

The misconception this question tests

This Asymptotic Analysis previous year question is Q17 of the GATE CSE 2026 Set 1 paper. Find more GATE CSE PYQs on Asymptotic Analysis in Algorithms, or browse all GATE CSE PYQs.

Free diagnostic

Where do you stand for GATE?

Take the 20-minute diagnostic: the 3 topics that cost you the most marks, and a rank range. Or sit 5 related Asymptotic Analysis PYQs now with no account.

One GATE CSE PYQ every morning

An official question by email at 7 AM IST, with a link to its verified solution. Unsubscribe in one click.

Asymptotic Analysis in GATE CSE

Asymptotic Analysis has 31 GATE CSE PYQs across 19 papers from 2011 to 2026. 15 of them are 1-mark MCQs like this one, and it is the only one in GATE CSE 2026 Set 1.

How GATE tests Asymptotic Analysis

More from GATE CSE 2026 Set 1

Share this solution

A plain-text card for WhatsApp or Telegram study groups.

GateAI solution cardGATE CSE 2026 Set 1 · Q17 · MCQ

Consider the following recurrence relations: For all n > 1, T1(n) = 4T1 ((n)/(2) ) + T2(n) T2(n) = 5T2 ((n)/(4) ) + (log2 n) Assume that for all n ≤ 1, T1(n) = 1 and T2(n) = 1. Which one of the following options is correct?

Topic-wise GATE CS PYQs with verified steps

Independent practice explanation verified by the GateAI team. GATE is conducted by the IITs; question text follows the official paper.