Q.

Which of the following problems is not NP complete?

A. hamiltonian circuit
B. bin packing
C. partition problem
D. halting problem
Answer» D. halting problem
Explanation: hamiltonian circuit, bin packing, partition problems are np complete problems. halting problem is an undecidable problem.
2k
0
Do you find this helpful?
8

View all MCQs in

Design and Analysis of Algorithms

Discussion

No comments yet

Related MCQs