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 2005
MCQ (Single Correct Answer)
+2
-0.6
Consider three decision problems P1, P2 and P3. It is known that P1 is decidable and P2 is undecidable. Which one of the following is TRUE?
A
P3 is decidable if P1 is reducible to P3
B
P3 is undecidable if P3 is reducible to P2
C
P3 is undecidable if P2 is reducible to P3
D
P3 is decidable if P3 is reducible to P2 's complement
2
GATE CSE 1992
MCQ (Single Correct Answer)
+2
-0.6
Which of the following problems is not NP-hard?
A
Hamiltonian circuit problem
B
The 0/1 Knapsack problem
C
Finding bi-connected components of a graph
D
The graph coloring problem
Previous
Questions Asked from Marks 2
GATE CSE 2014 Set 3 (1) GATE CSE 2014 Set 1 (1) GATE CSE 2008 (1) GATE CSE 2006 (1) GATE CSE 2005 (1) GATE CSE 1992 (1)
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