M

Mr. Dubey • 53.43K 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. Which of the following calls never returns an error?

Q. Rabin Karp algorithm and naive pattern searching algorithm have the same worst case time complexity.

Q. A UML diagram that facilitates requirements gathering and interacts between system and external users, is called as

Q. :x is used for

Q. For applications that demand very high data-processing requirements, or if double precision floating point calculation is needed, then best choice wil

Q. Which of the statements are not true to classify VPN systems?

Q. ECC stands for

Q. Data re-engineering may be part of the process of migrating from a file-based system to a DBMS-based system or changing from one DBMS to another.

Q. Bayesian classifiers is

Q. The parameter can assume different values which determine how the data matrix is initially processed.

Question analytics