ExamSIDE
Questions (Powered by ExamGOAL)
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
Previous Next
1
GATE CSE 1999
MCQ (Single Correct Answer)
+2
-0.6
If T1 = O(1), give the correct matching for the following pairs:

List - I

(M) Tn = Tn - 1 + n
(N) Tn = Tn/2 + n
(O) Tn = Tn/2 + nlog n
(P) Tn = Tn - 1 + log n

List - II

(U) Tn= O(n)
(V) Tn = O(nlogn)
(W) Tn = O(n2)
(X) Tn = O(log2n)
A
M – W N – V O – U P – X
B
M – W N – U O – X P – V
C
M – V N – W O – X P – U
D
M – W N – U O – V P – X
2
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
3
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}$$
4
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.
Previous Next
Questions Asked from Marks 2
GATE CSE 2025 Set 2 (1) GATE CSE 2016 Set 2 (1) GATE CSE 2016 Set 1 (1) GATE CSE 2015 Set 3 (1) GATE CSE 2015 Set 2 (1) GATE CSE 2015 Set 1 (1) GATE CSE 2009 (2) GATE CSE 2008 (1) GATE CSE 2007 (1) GATE CSE 2006 (3) GATE CSE 2005 (2) GATE CSE 2004 (1) GATE CSE 1999 (1) GATE CSE 1996 (2) GATE CSE 1994 (1) GATE CSE 1992 (1) GATE CSE 1991 (1) GATE CSE 1990 (2)
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