![Mcqmate logo](https://mcqmate.com/images/logos/logo-black.png)
![Mcqmate logo](https://mcqmate.com/images/logos/logo-white.png)
McqMate
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. |
View all MCQs in
Design and Analysis of AlgorithmsNo comments yet