Home / Engineering / Design and Analysis of Algorithms / Question

M

Mr. Dubey • 51.43K Points
Coach 

Q.) Hamiltonian path problem is

(A) np problem
(B) n class problem
(C) p class problem
(D) np complete problem
Correct answer : Option (D) - np complete problem

Explanation: 
 hamiltonian path problem is found to be np complete. hamiltonian cycle problem is also an np- complete problem.

Share

Previous

Next

Discusssion

Login to discuss.

Related MCQs on Design and Analysis of Algorithms

Q. What is the max data transfer rate of STP cables?

Q. Use case scenario is a specific sequence of ________

Q. A decision table has

Q. What makes a CUDA code runs in parallel

Q. _________is the specialized data warehouse database.

Q. The A Priori algorithm is a____________

Q. Control Charts is a statistical technique to assess, monitor, and maintain the stability of a process.

Q. Unix system treats devices as a ……..

Q. The number and size of tasks into which a problem is decomposed determines the __

Q. It is a set of levels that defines a testing maturity hierarchy