GATE 1992
March 17, 2025GATE 1992
March 17, 2025GATE 1992
|
Question 16
|
Which of the following problems is not NP-hard?
|
Hamiltonian circuit problem
|
|
|
The 0/1 Knapsack problem
|
|
|
Finding bi-connected components of a graph
|
|
|
The graph colouring problem
|
Question 16 Explanation:
Note: Out of syllabus.
Correct Answer: A
Question 16 Explanation:
Note: Out of syllabus.