AlgorithmsBasic Concepts of Complexity Classes P, NP, NPHard, NPComplete (GATE Computer Science): Questions 1  4 of 4
Get 1 year subscription: Access detailed explanations (illustrated with images and videos) to 913 questions. Access all new questions we will add tracking exampattern and syllabus changes. View Sample Explanation or View Features.
Rs. 450.00 or
Question number: 1
» Algorithms » Basic Concepts of Complexity Classes P, NP, NPHard, NPComplete
Question
Travelling salesperson problem solved by
Choices
Choice (4)  Response  

a.  Branch and bound method 

b.  Back tracking 

c.  Dynamic programming 

d.  All of the above 

Question number: 2
» Algorithms » Basic Concepts of Complexity Classes P, NP, NPHard, NPComplete
Question
NP (nonpolynomial) complete refers to how many classless?
Choices
Choice (4)  Response  

a.  Three 

b.  Two 

c.  One 

d.  All of the above 

Question number: 3
» Algorithms » Basic Concepts of Complexity Classes P, NP, NPHard, NPComplete
Question
The problems 3SAT and 2SAT are
Choices
Choice (4)  Response  

a.  complete 

b.  in P 

c.  NPcomplete and in P respectively 

d.  Question does not provide sufficient data or is vague 

Question number: 4
» Algorithms » Basic Concepts of Complexity Classes P, NP, NPHard, NPComplete
Question
NPcomplete and in P respectively
Choices
Choice (4)  Response  

a.  Undecidable and NPcomplete respectively 

b.  NP  complete 

c.  The problems 3SAT and 2SAT are 

d.  in P 
