[Solved] Which of the following problems is not NP complete?

Computer Science Engineering (CSE)
Design and Analysis of Algorithms
Which of the following problems is not N...

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 Algorithms

Discussion

Related Questions

Which of the following is not an Eigen value of the adjacency matrix of the complete bipartite graph?
Which of the following is not an Eigen value of the Laplacian matrix of the complete bipartite graph?
Which of the following problems is NOT solved using dynamic programming?
Which complete graph is not present in minor of Outer Planar Graph?
Which of the following problems can’t be solved using recursion?
Which of the following problems should be solved using dynamic programming?
Which of the following problems is equivalent to the 0-1 Knapsack problem?
Which of the following problems can be solved using the longest subsequence problem?
Which of the following problems can be used to solve the minimum number of insertions to form a palindrome problem?
Which of the following problems is related to stable marriage problem?