- Computer Science Engineering (CSE)
- Design and Analysis of Algorithms
- Hamiltonian path problem is ...

Q. |
## Hamiltonian path problem is |

A. | np problem |

B. | n class problem |

C. | p class problem |

D. | np complete problem |

Answer» D. np complete problem | |

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

View all MCQs in:
Design and Analysis of Algorithms

- There is no existing relationship between a Hamiltonian path problem and Hamiltonian circuit problem.
- Which of the following algorithm can be used to solve the Hamiltonian path problem efficiently?
- Which of the following problems is similar to that of a Hamiltonian path problem?
- Who formulated the first ever algorithm for solving the Hamiltonian path problem?
- In what time can the Hamiltonian path problem can be solved using dynamic programming?
- Who invented the inclusion-exclusion principle to solve the Hamiltonian path problem?
- For a graph of degree three, in what time can a Hamiltonian path be found?
- What is the time complexity for finding a Hamiltonian path for a graph having N vertices (using permutation)?
- The longest increasing subsequence problem is a problem to find the length of a subsequence from a sequence of array elements such that the subsequence is sorted in increasing order and it’s length is maximum. This problem can be solved using
- Given a rod of length n and the selling prices of all pieces smaller than equal to n, find the most beneficial way of cutting the rod into smaller pieces. This problem is called the rod cutting problem. Which of these methods can be used to solve the rod cutting problem?

Login to Continue

It will take less than 2 minutes

Report MCQ