GATE CS 2017 (Afternoon) — Question 30

AlgorithmsAsymptotic Analysis (O, Omega, Theta Complexities)MCQ2 marks · −2/3 if wrongHard

Consider the recurrence function \(T(n) = \begin{cases} 2T(\sqrt{n}) + 1, & n > 2 \\ 2, & 0 < n \leq 2 \end{cases}\) Then \(T(n)\) in terms of \(\Theta\) notation is
  1. A
    \(\Theta(\log \log n)\)
  2. B
    \(\Theta(\log n)\)
  3. C
    \(\Theta(\sqrt{n})\)
  4. D
    \(\Theta(n)\)
Practise the full 2017-AN paper
Challenge a friend: WhatsApp Telegram
From RENYXERAThis week's 10-question challengeSame 10 past-GATE questions for everyone this week — see where you stand.
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