Algorithms
Complexity Analysis and Asymptotic Notations
Marks 1Marks 2
Searching and Sorting
Marks 1Marks 2
Divide and Conquer Method
Marks 1Marks 2
Greedy Method
Marks 1Marks 2
P and NP Concepts
Marks 1Marks 2
Dynamic Programming
Marks 1Marks 2
1
GATE CSE 1990
MCQ (Single Correct Answer)
+2
-0.6
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 Subjects
Theory of Computation
Operating Systems
Algorithms
Digital Logic
Database Management System
Data Structures
Computer Networks
Software Engineering
Compiler Design
Web Technologies
General Aptitude
Discrete Mathematics
Programming Languages
Computer Organization