GATE CS 2020 (Forenoon) — Question 12

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

For parameters \( a \) and \( b \), both of which are \( \omega(1) \), \( T(n) = T(n^{1/a}) + 1 \), and \( T(b) = 1 \). Then \( T(n) \) is
  1. A
    \( \Theta(\log_a \log_b n) \)
  2. B
    \( \Theta(\log_{ab} n) \)
  3. C
    \( \Theta(\log_b \log_a n) \)
  4. D
    \( \Theta(\log_2 \log_2 n) \)
Practise the full 2020-FN 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