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 2012
MCQ (Single Correct Answer)
+1
-0.3
The worst case running time to search for an element in a balanced binary search tree with n2n elements is
A
$$\Theta (n\,\log \,n)$$
B
$$\Theta (n{2^n})$$
C
$$\Theta (n)$$
D
$$\Theta (\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
Defence
NDA
CBSE
Class 12