1
GATE CSE 2022
MCQ (More than One Correct Answer)
+1
-0.33

Consider the following recurrence:

f(1) = 1;

f(2n) = 2f(n) $$-$$ 1, for n $$\ge$$ 1;

f(2n + 1) = 2f(n) + 1, for n $$\ge$$ 1;

Then, which of the following statements is/are TRUE?

A
f(2n $$-$$ 1) = 2n $$-$$ 1
B
f(2n) = 1
C
f(5 . 2n) = 2n + 1 + 1
D
f(2n + 1) = 2n + 1
2
GATE CSE 2020
+1
-0.33
For parameters a and b, both of which are $$\omega \left( 1 \right)$$,
T(n) = $$T\left( {{n^{1/a}}} \right) + 1$$, and T(b) = 1.
Then T(n) is
A
$$\Theta \left( {{{\log }_a}{{\log }_b}n} \right)$$
B
$$\Theta \left( {{{\log }_{ab}}n} \right)$$
C
$$\Theta \left( {{{\log }_b}{{\log }_a}n} \right)$$
D
$$\Theta \left( {{{\log }_2}{{\log }_2}n} \right)$$
3
GATE CSE 2015 Set 3
+1
-0.3
Consider the equality $$\sum\limits_{i = 0}^n {{i^3}} = X$$ and the following choices for $$X$$
\eqalign{ & \,\,\,\,\,\,\,{\rm I}.\,\,\,\,\,\,\Theta \left( {{n^4}} \right) \cr & \,\,\,\,\,{\rm I}{\rm I}.\,\,\,\,\,\,\Theta \left( {{n^5}} \right) \cr & \,\,\,{\rm I}{\rm I}{\rm I}.\,\,\,\,\,\,O\left( {{n^5}} \right) \cr & \,\,\,{\rm I}V.\,\,\,\,\,\,\Omega \left( {{n^3}} \right) \cr}
The equality above remains correct if $$𝑋$$ is replaced by
A
Only $${\rm I}$$
B
Only $${\rm II}$$
C
$${\rm I}$$ or $${\rm III}$$ or $${\rm IV}$$ but not $${\rm II}$$
D
$${\rm II}$$ or $${\rm III}$$ or $${\rm IV}$$ but not $${\rm I}$$
4
GATE CSE 2013
+1
-0.3
Which of the following is the tightest upper bound that represents the number of swaps required to sort n numbers using selection sort?
A
O(log n)
B
O(n)
C
O(n log n)
D
O(n2)
GATE CSE Subjects
EXAM MAP
Medical
NEET