![Mcqmate logo](https://mcqmate.com/public/images/logos/logo-black.png)
![Mcqmate logo](https://mcqmate.com/public/images/logos/logo-white.png)
McqMate
Q. |
Which of the following problems is similar to that of a Hamiltonian path problem? |
A. | knapsack problem |
B. | closest pair problem |
C. | travelling salesman problem |
D. | assignment problem |
Answer» C. travelling salesman problem | |
Explanation: hamiltonian path problem is similar to that of a travelling salesman problem since both the problem traverses all the nodes in a graph exactly once. |
View all MCQs in
Design and Analysis of AlgorithmsNo comments yet