Q. The travelling salesman problem can be solved using

  • (A) a spanning tree
  • (B) a minimum spanning tree
  • (C) bellman – ford algorithm
  • (D) dfs traversal
💬 Discuss
✅ Correct Answer: (B) a minimum spanning tree
Explanation: in the travelling salesman problem we have to find the shortest possible route that visits every city exactly once and returns to the starting point for the given a set of cities. so, travelling salesman problem can be solved by contracting the minimum spanning tree.

Published by Mr. Dubey ⭐ 104.82K Points at 16-Sep-2023 03:43 pm in Design and Analysis of Algorithms

Explanation by: Mr. Dubey
in the travelling salesman problem we have to find the shortest possible route that visits every city exactly once and returns to the starting point for the given a set of cities. so, travelling salesman problem can be solved by contracting the minimum spanning tree.

💬 Discussion

Related MCQs

Q. Which one of the following protocol delivers/stores mail to reciever server?

Q. For the given weather data, Calculate probability

Q. Once you load the suitable program and provide required data, computer does not need human intervention. This feature is known as

Q. Which of the following is not a logical layer of the application in client server system?

Q. Which unit holds data permanently?

Q. Which of these interviews is adapted for computer programmers?

Q. The accelerometers are commonly used in vibration measurement due to their ___________.

Q. Consider the language L1,L2,L3 as given below. L1={0^{p}1^{q} | p,q \in N} L2={0^{p}1^{q} | p,q \in N and p=q} L3={0^{p}1^{q}1^{r} | p,q,r \in N and p

Q. __________ is the heart of the warehouse.

Q. The first Network:

📊 Question Analytics

👁️
734
Total Visits
📽️
3 y ago
Published
🎖️
Mr. Dubey
Publisher
📈
89%
Success Rate