1
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)$$
2
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
3
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 40 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
4
GATE CSE 2006
MCQ (Single Correct Answer)
+1
-0.3
An element in an array X is called a leader if it is greater than all elements to the right of it in X. The best algorithm to find all leaders in an array
A
Solves it in linear time using a left to right pass of the array
B
Solves it in linear time using a right to left pass of the array
C
Solves it using divide and conquer in time $$\theta \left( {n\log n} \right)$$
D
Solves it in time $$\theta \left( {{n^2}} \right)$$
GATE CSE Subjects
Software Engineering
Web Technologies
EXAM MAP