1
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}$$
2
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
3
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
4
GATE CSE 1996
MCQ (Single Correct Answer)
+2
-0.6
A binary search tree is generated by inserting in order the following integers:

50, 15, 62, 5, 20, 58, 91, 3, 8, 37, 60, 24

The number of nodes in the left subtree and right subtree of the root respectively is
A
(4, 7)
B
(7, 4)
C
(8, 3)
D
(3, 8)
EXAM MAP
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
CBSE
Class 12