M

Mr. Dubey • 52.63K Points
Coach 

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

(A) hamiltonian circuit
(B) bin packing
(C) partition problem
(D) halting problem
Share
Explanation by: Mr. Dubey 
 hamiltonian circuit, bin packing, partition problems are np complete problems. halting problem is an undecidable problem.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.

Related MCQs

Q. Network bottlenecks occur when ______ data sets must be transferred

Q. Charles Babbage is considered the father of modern computers because

Q. Testing activity which is performed to expose defects in the interfaces and in the interaction between integrated components is :-

Q. The ___________ is used to translate the interface of one class into another interface.

Q. A floppy disk contains

Q. According to which method, maximum kinetic energy at mean position is equal to maximum potential energy at extreme position?

Q. The is used as an index into the page table.

Q. Which of the following is an example of an unmanaged storage utility set up to do automated backups?

Q. ISAKMP stands for ______

Q. The situation wherein the data of operands are not available is called

Question analytics