For parameters a and b, both of which are (1), T(n) = T(n1/a) + 1, and T(b) = 1. Then T(n) is
Topic-wise GATE CS PYQs with verified steps
GATE CSE 2020 · Q2
Time
Select one answerSingle correct
Solution
Official answer: A) (loga logb n)
Asymptotic AnalysisTo solve the recurrence $T(n) = T(n^{1/a}) + 1$ with base case $T(b) = 1$:
Apply the change of variables by taking the logarithm to base : Let , which implies:
Now rewrite the recurrence in terms of :
Define . Then:
For the base case , we have :
Unrolling the recurrence:
Thus, .
Therefore, option (A) is correct.
Try the question first, then check your work.
Examiner trap
Transform the variable using and unroll the recurrence in terms of .
This Asymptotic Analysis previous year question is Q2 of the GATE CSE 2020 paper. Find more GATE CSE PYQs on Asymptotic Analysis in Algorithms, or browse all GATE CSE PYQs.
Free diagnostic
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.
An official question by email at 7 AM IST, with a link to its verified solution. Unsubscribe in one click.
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 GATE CSE 2020 has 2.
How GATE tests Asymptotic AnalysisIndependent practice explanation verified by the GateAI team. GATE is conducted by the IITs; question text follows the official paper.