McqMate
| Q. |
The is a touring problem in which each city must be visited exactly once. The aim is to find the shortest tour. |
| A. | finding shortest path between a source and a destination |
| B. | travelling salesman problem |
| C. | map coloring problem |
| D. | depth first search traversal on a given map represented as a graph |
| Answer» B. travelling salesman problem | |
| Explanation: refer the tsp problem. | |
View all MCQs in
Information Retrival TechniquesNo comments yet