Q. Which of the following problems is not NP complete?

(A) hamiltonian circuit
(B) bin packing
(C) partition problem
(D) halting problem

💬 Discuss

✅ Correct Answer: (D) halting problem

Explanation: hamiltonian circuit, bin packing, partition problems are np complete problems. halting problem is an undecidable problem.

Published by Mr. Dubey ⭐ 104.82K Points at 16-Sep-2023 03:44 pm in Design and Analysis of Algorithms

Explanation by: Mr. Dubey

hamiltonian circuit, bin packing, partition problems are np complete problems. halting problem is an undecidable problem.

💬 Discussion

📊 Question Analytics

👁️

766

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

90%

Success Rate