adplus-dvertising
frame-decoration

Question

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

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. The _______ is a touring problem in which each city must be visited exactly once. The aim is to find the shortest tour.

Similar Questions

Discover Related MCQs

Q. Web Crawler is a/an

Q. A production rule consists of

Q. Which is the best way to go for Game playing problem?

Q. Satellite Image Analysis System is

Q. Which search strategy is also called as blind search?

Q. How many types are available in uninformed search method?

Q. Which search is implemented with an empty first-in-first-out queue?

Q. When is breadth-first search is optimal?

Q. How many successors are generated in backtracking search?

Q. Which algorithm is used to solve any kind of problem?

Q. Which search algorithm imposes a fixed depth limit on nodes?

Q. Which search implements stack operation for searching the states?

Q. What is the other name of informed search strategy?

Q. How many types of informed search method are in artificial intelligence?

Q. Which search uses the problem specific knowledge beyond the definition of the problem?

Q. A problem is first connected to its proposed solution during the _____ stage.

Q. Which technique is being investigated as an approach to automatic programming?

Q. One definition of AI focuses on problem-solving methods that process:

Q. What is the main task of a problem-solving agent?

Q. What is Initial state + Goal state in Search Terminology?