ExamSIDE.Com

GATE CSE 1990 Question

Match the pairs in the following:

List - I

(a) Straseen's matrix multiplication algorithm
(b) Kruskal's minimum spanning tree algorithm
(c) Bioconnected components algorithm
(d) Floyd's shortest path algorithm

List - II

(p) Greedy method
(q) Dynamic programming
(r) Divide and Conquer
(s) Depth first search
A
a - r, b - p, c - s, d - q
B
a - r, b - p, c - q, d - s
C
a - r, b - s, c - p, d - q
D
a - q, b - p, c - s, d - r

GATE CSE 1990 Question

Match the pairs in the following:

List - I

(a) Heap construction
(b) Constructing hash table witn linear probing
(c) AVL Tree construction
(d) Digital tree construction

List - II

(p) $\Omega \left( {n\log _{10}^n} \right)$
(q) O(n)
(r) O(n2)
(s) $\Omega \left( {n\log _2^n} \right)$
A
a - r, b - q, c - s, d - p
B
a - q, b - r, c - p, d - s
C
a - q, b - r, c - s, d - p
D
a - q, b - s, c - r, d - p

GATE CSE 1991 Question

Integer Type Question
Minimum number of comparisons required to sort 5 elements
1
2
3
4
5
6
7
8
9
.
0
-