GateAI
Asymptotic Analysis

GATE CSE 2021 Set 1 · Q3

MCQ1 markEasy

Time

Consider the following three functions. f1=10nf2=nlog⁡nf3=nn f_1 = 10^n \qquad f_2 = n^{\log n} \qquad f_3 = n^{\sqrt{n}} Which one of the following options arranges the functions in the increasing order of asymptotic growth rate?

Select one answerSingle correct

Pick an option to check

Solution

Step-by-step verified solution

Official answer: D) f2, f3, f1

Asymptotic Analysis

To compare the asymptotic growth rate of the functions, take the natural logarithm (or base-2 logarithm) of each function:

  1. For f1=10nf_1 = 10^n:

    log⁡f1=log⁡(10n)=nlog⁡10=Θ(n)\log f_1 = \log(10^n) = n \log 10 = \Theta(n)
  2. For f2=nlog⁡nf_2 = n^{\log n}:

    log⁡f2=log⁡(nlog⁡n)=(log⁡n)⋅(log⁡n)=(log⁡n)2\log f_2 = \log(n^{\log n}) = (\log n) \cdot (\log n) = (\log n)^2
  3. For f3=nnf_3 = n^{\sqrt{n}}:

    log⁡f3=log⁡(nn)=nlog⁡n\log f_3 = \log(n^{\sqrt{n}}) = \sqrt{n} \log n

Comparing the growth rates of their logarithms for large nn:

(log⁡n)2<nlog⁡n<n(\log n)^2 < \sqrt{n} \log n < n

Therefore:

log⁡f2<log⁡f3<log⁡f1  ⟹  f2<f3<f1\log f_2 < \log f_3 < \log f_1 \implies f_2 < f_3 < f_1

Thus, the increasing order of asymptotic growth rate is f2,f3,f1f_2, f_3, f_1, which corresponds to (D).

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 Q3 of the GATE CSE 2021 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 GATE CSE 2021 Set 1 has 2.

How GATE tests Asymptotic Analysis

More from GATE CSE 2021 Set 1

Share this solution

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

GateAI solution cardGATE CSE 2021 Set 1 · Q3 · MCQ

Consider the following three functions. f1 = 10n f2 = nlog n f3 = n√(n) Which one of the following options arranges the functions in the increasing order of asymptotic growth rate?

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.