1
GATE CSE 2020
MCQ (Single Correct Answer)
+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)$$
2
GATE CSE 2015 Set 3
MCQ (Single Correct Answer)
+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}$$
3
GATE CSE 2013
MCQ (Single Correct Answer)
+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)
4
GATE CSE 2013
MCQ (Single Correct Answer)
+1
-0.3
Which one of the following is the tightest upper bound that represents the time complexity of inserting an object in to a binary search tree of n nodes?
A
O(1)
B
O(log n)
C
O(n)
D
O(n log n)
GATE CSE Subjects
Software Engineering
Web Technologies
EXAM MAP
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
Civil Services
UPSC Civil Service
CBSE
Class 12