1
GATE CSE 1999
MCQ (Single Correct Answer)
+1
-0.3
Suppose we want to arrange the n numbers stored in any array such that all negative values occur before all positive ones. Minimum number of exchanges required in the worst case is
A
n - 1
B
n
C
n + 1
D
None of the above
2
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 46 English
A
0
B
1
C
2
D
3
3
GATE CSE 1998
MCQ (Single Correct Answer)
+1
-0.3

Give the correct matching for the following pairs:

Group - 1

(A) $${\rm O}(\log n)$$
(B) $${\rm O}(n)$$
(C) $${\rm O}(n\log n)$$
(D) $${\rm O}({n^2})$$

Group - 2

(P) Selection
(Q) Insertion sort
(R) Binary search
(S) Merge sort
A
A – R B – P C – Q D – S
B
A – R B – P C – S D – Q
C
A – P B – R C – S D – Q
D
A – P B – S C – R D – Q
4
GATE CSE 1997
MCQ (Single Correct Answer)
+1
-0.3
The correct matching for the following pairs is
A. All pairs shortest path 1. Greedy
B. Quick Sort 2. Depth-First Search
C. Minimum weight spanning tree 3. Dynamic Programming
D. Connected Components 4. Divide and Conquer
A
$$\text{A-2 B-4 C-1 D-3}$$
B
$$\text{A-3 B-4 C-1 D-2}$$
C
$$\text{A-3 B-4 C-2 D-1}$$
D
$$\text{A-4 B-1 C-2 D-3}$$
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