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
I have been asked this question in an internship interview.
I'd like to ask this question from Problem Solving topic in portion Problem Solving of Artificial Intelligence
Select the correct answer from above options
Interview Questions and Answers, Database Interview Questions and Answers for Freshers and Experience
