GATE CS 2026 (Afternoon) — Question 24

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

Consider the following functions, where \( n \) is a positive integer.
\[ n^{1/3}, \log(n), \log(n!), 2^{\log(n)} \]
Which one of the following options lists the functions in increasing order of asymptotic growth rate? Note: Assume the base of log to be 2.
  1. A
    \( \log(n), n^{1/3}, 2^{\log(n)}, \log(n!) \)
  2. B
    \( n^{1/3}, \log(n), \log(n!), 2^{\log(n)} \)
  3. C
    \( \log(n), n^{1/3}, \log(n!), 2^{\log(n)} \)
  4. D
    \( 2^{\log(n)}, n^{1/3}, \log(n), \log(n!) \)
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