1
GATE CSE 1999
MCQ (Single Correct Answer)
+1
-0.3
The number of articulation points of the following graph is GATE CSE 1999 Algorithms - Searching and Sorting Question 45 English
A
0
B
1
C
2
D
3
2
GATE CSE 1999
MCQ (Single Correct Answer)
+1
-0.3
A sorting technique is called stable if:
A
It takes O(nlog n)time
B
It maintains the relative order of occurrence of non-distinct elements
C
It uses divide and conquer paradigm
D
It takes O(n) space
3
GATE CSE 1999
MCQ (Single Correct Answer)
+1
-0.3
If one uses straight two-way merge sort algorithm to sort the following elements in ascending order 20, 47, 15, 8, 9, 4, 40, 30, 12, 17 then the order of these elements after the second pass of the algorithm is:
A
8, 9, 15, 20, 47, 4, 12, 17, 30, 40
B
8, 15, 20, 47, 4, 9, 30, 40, 12, 17
C
15, 20, 47, 4, 8, 9, 12, 30, 40, 17
D
4, 8, 9, 15, 20, 47, 12, 17, 30, 40
4
GATE CSE 1999
MCQ (Single Correct Answer)
+2
-0.6
If T1 = O(1), give the correct matching for the following pairs:

List - I

(M) Tn = Tn - 1 + n
(N) Tn = Tn/2 + n
(O) Tn = Tn/2 + nlog n
(P) Tn = Tn - 1 + log n

List - II

(U) Tn= O(n)
(V) Tn = O(nlogn)
(W) Tn = O(n2)
(X) Tn = O(log2n)
A
M – W N – V O – U P – X
B
M – W N – U O – X P – V
C
M – V N – W O – X P – U
D
M – W N – U O – V P – X
EXAM MAP
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
CBSE
Class 12