Which of the following problem is not NP complete but undecidable?
2025
Which of the following problem is not NP complete but undecidable?
Answer: B. Halting problem
- A.
Partition
- B.
Halting problem
- C.
Hamiltonian circuit
- D.
None of the above
Attempted by 60 students.
Show answer & explanation
Correct answer: B
Explore the full course: Mppsc Assistant Professor Computer Science Paper 2
Loading lesson…