1
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)$$
2
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)
3
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)$$
4
GATE CSE 2012
MCQ (Single Correct Answer)
+1
-0.3
Let W(n) and A(n) denote respectively, the worst case and average case running time of an algorithm executed on an input of size n. Which of the following is ALWAYS TRUE?
A
$$A(n) = \Omega (W(n))$$
B
$$A(n) = \Theta (W(n))$$
C
$$A(n) = O (W(n))$$
D
$$A(n) = 0 (W(n))$$
GATE CSE Subjects
Software Engineering
Web Technologies
EXAM MAP
Medical
NEETAIIMS
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
Civil Services
UPSC Civil Service
Defence
NDA
Staff Selection Commission
SSC CGL Tier I
CBSE
Class 12