1
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)
2
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)
3
GATE CSE 2013
MCQ (Single Correct Answer)
+1
-0.3
What is the time complexity of Bellman-Ford single-source shortest path algorithm on a complete graph of n vertices?
A
$$\Theta ({n^2})$$
B
$$\Theta ({n^2}\log n)$$
C
$$\Theta ({n^3})$$
D
$$\Theta ({n^3}\log n)$$
4
GATE CSE 2013
MCQ (Single Correct Answer)
+2
-0.6
The number of elements that can be stored in $$\Theta (\log n)$$ time using heap sort is
A
$$\Theta (1)$$
B
$$\Theta (\sqrt {\log n} )$$
C
$$\Theta ({{\log \,n} \over {\log \,\log \,n}})$$
D
$$\Theta (\log n)$$
EXAM MAP
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
CBSE
Class 12