1
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 36 English
A
MNOPQR
B
NQMPOR
C
QMNPRO
D
QMNPOR
2
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)$$
3
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
4
GATE CSE 2007
MCQ (Single Correct Answer)
+1
-0.3
Consider the DAG with $$V = \{1,2,3,4,5,6\}$$, shown below. GATE CSE 2007 Algorithms - Searching and Sorting Question 39 English Which of the following is NOT a topological ordering?
A
1 2 3 4 5 6
B
1 3 2 4 5 6
C
1 3 2 4 6 5
D
3 2 4 1 6 5
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