# Hamiltonian Path Problem Multiple choice Questions and Answers (MCQs)

## Hamiltonian Path Problem Multiple choice Questions and Answers (MCQs)

Congratulations - you have completed Hamiltonian Path Problem Multiple choice Questions and Answers (MCQs).

You scored %%SCORE%% out of %%TOTAL%%.

Your performance has been rated as %%RATING%%

 Question 11 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER]
What is the time complexity for finding a Hamiltonian path for a graph having N vertices (using permutation)?
 A O(N!) B O(N! * N) C O(log N) D O(N)
Question 11 Explanation:
For a graph having N vertices traverse the permutations in N! iterations and it traverses the permutations to see if adjacent vertices are connected or not takes N iterations (i.e.) O(N! * N).

 Question 12 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER]
How many Hamiltonian paths does the following graph have?
 A 1 B 2 C 3 D 4
Question 12 Explanation:
The above graph has only one Hamiltonian path that is from a-b-c-d-e.

 Question 13 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER]
How many Hamiltonian paths does the following graph have?
 A 1 B 2 C 0 D 3
Question 13 Explanation:
The above graph has no Hamiltonian paths. That is, we cannot traverse the graph with meeting vertices exactly once.

Once you are finished, click the button below. Any items you have not completed will be marked incorrect.
There are 13 questions to complete.