topic - solutions adda

NP-Complete

Please wait while the activity loads.
If this activity does not load, try refreshing your browser. Also, this page requires javascript. Please visit using a browser with javascript enabled.

If loading fails, click here to try again

Question 1

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 colouring problem

Theory-of-ComputationNP-CompleteGATE 1992Video-Explanation

Question 1 Explanation:

Note: Out of syllabus.

There is 1 question to complete.

Access quiz wise question and answers by becoming as a solutions adda PRO SUBSCRIBER with Ad-Free content

If you have registered and made your payment please contact solutionsadda.in@gmail.com to get access