1
GATE CSE 1996
MCQ (Single Correct Answer)
+2
-0.6
The minimum number of interchanges needed to convert the array

89, 19, 40, 17, 12, 10, 2, 5, 7, 11, 6, 9, 70

into a heap with the maximum element at the root is
A
0
B
1
C
2
D
3
2
GATE CSE 1996
MCQ (Single Correct Answer)
+2
-0.6
The average number of key comparisons done on a successful sequential search in list of length n is
A
log n
B
$${{n - 1} \over 2}$$
C
$${n \over 2}$$
D
$${{n + 1} \over 2}$$
3
GATE CSE 1996
MCQ (Single Correct Answer)
+2
-0.6
Quicksort is run on two inputs shown below to sort in ascending order taking first element as pivot
i) 1, 2, 3,......., n
ii) n, n-1, n-2,......, 2, 1
Let C1 and C2 be the number of comparisons made for the inputs (i) and (ii) respectively. Then,
A
$$C_1 < C_2$$
B
$$C_1 > C_2$$
C
$$C_1 = C_2$$
D
we cannot say anything for arbitrary n
4
GATE CSE 1996
MCQ (Single Correct Answer)
+2
-0.6
The recurrence relation
T(1) = 2
T(n) = 3T(n/4) + n
has the solution, T(n) equals to
A
O(n)
B
O(log n)
C
O(n^3/4)
D
None of the above
EXAM MAP
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
CBSE
Class 12