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 1994
MCQ (Single Correct Answer)
+2
-0.6
Which one of the following statements is false?
A
Optimal binary search tree construction can be performed efficiently using dynamic programming.
B
Breadth-first search cannot be used to find connected components of a graph
C
Given the prefix and postfix walks over a binary tree, the binary tree cannot be uniquely constructed.
D
Depth-first search can be used to find connected components of a graph.
3
GATE CSE 1992
MCQ (Single Correct Answer)
+2
-0.6
Following algorithm(s) can be used to sort n integers in the range [1....... n3] in O(n) time
A
Heapsort
B
Quicksort
C
Merge sort
D
Radix sort
4
GATE CSE 1991
Numerical
+2
-0
Minimum number of comparisons required to sort 5 elements
Your input ____
GATE CSE Subjects
Software Engineering
Web Technologies
EXAM MAP
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
Civil Services
UPSC Civil Service
Defence
NDA
CBSE
Class 12