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
1
GATE CSE 1995
MCQ (Single Correct Answer)
+1
-0.3
For merging two sorted lists of sizes m and n into a sorted list of size m+n, we require comparisons of
A
O(m)
B
O(n)
C
O(m+n)
D
O(log m + log n)
2
GATE CSE 1995
MCQ (Single Correct Answer)
+1
-0.3
Merge sort uses
A
Divide and conquer strategy
B
Backtracking approach
C
Heuristic search
D
Greedy approach
Previous
Questions Asked from Marks 1
GATE CSE 2021 Set 2 (2) GATE CSE 2021 Set 1 (1) GATE CSE 2019 (1) GATE CSE 2014 Set 3 (2) GATE CSE 2014 Set 2 (1) GATE CSE 2014 Set 1 (1) GATE CSE 2009 (1) GATE CSE 2003 (1) GATE CSE 2002 (1) GATE CSE 2001 (1) GATE CSE 2000 (1) GATE CSE 1999 (2) GATE CSE 1995 (3)
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