1
GATE CSE 2009
MCQ (Single Correct Answer)
+1
-0.3
What is the number of swaps required to sort n elements using selection sort, in the worst case?
A
$$\Theta(n)$$
B
$$\Theta(n \log n)$$
C
$$\Theta(n^2)$$
D
$$\Theta(n^2 \log n)$$
2
GATE CSE 2008
MCQ (Single Correct Answer)
+1
-0.3
The Breadth First Search algorithm has been implemented using the queue data structure. One possible order of visiting the nodes of the following graph is GATE CSE 2008 Algorithms - Searching and Sorting Question 37 English
A
MNOPQR
B
NQMPOR
C
QMNPRO
D
QMNPOR
3
GATE CSE 2008
MCQ (Single Correct Answer)
+1
-0.3
The most efficient algorithm for finding the number of connected components in an undirected graph on n vertices and m edges has time complexity
A
$$\Theta (n)$$
B
$$\Theta (m)$$
C
$$\Theta (n+m)$$
D
$$\Theta (mn)$$
4
GATE CSE 2007
MCQ (Single Correct Answer)
+1
-0.3
Which of the following sorting algorithms has the lowest worst-case complexity?
A
Merge sort
B
Bubble sort
C
Quick sort
D
Selection sort
GATE CSE Subjects
Software Engineering
Web Technologies
EXAM MAP