📊 Design and Analysis of Algorithms
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.

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

💬 Discussion

Related MCQs

Q. As a system administrator, you need to set up one Ethernet interface on the Cisco router to allow for both sap and Novell-ether encapsulations. Which

Q. How many architectural paradigms in microprocessor

Q. A data structure where elements can be added or removed at either end but not in the middle is called …

Q. Which of the unit operation is used in Model view controller?

Q. What is the name of the organization helping to foster security standards for cloud computing?

Q. Agility is nothing more than the ability of project team to respond rapidly to change.

Q. Which of the following allows a virtual machine to run on two or more physical processors at the same time ?

Q. Computer is free from tiresome and boardoom. We call it

Q. As the resources are reserved between two communicating end systems in circuit switching, is achieved.

Q. Which is used to compute the truth of any sentence?

📊 Question Analytics

👁️
748
Total Visits
📽️
3 y ago
Published
🎖️
Mr. Dubey
Publisher
📈
97%
Success Rate