- Computer Science Engineering (CSE)
- Design and Analysis of Algorithms
- The travelling salesman problem can be s...

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 |

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. |

View all MCQs in:
Design and Analysis of Algorithms

- The longest increasing subsequence problem is a problem to find the length of a subsequence from a sequence of array elements such that the subsequence is sorted in increasing order and it’s length is maximum. This problem can be solved using
- You are given infinite coins of denominations v1, v2, v3,…..,vn and a sum S. The coin change problem is to find the minimum number of coins required to get the sum S. This problem can be solved using
- In what time can the Hamiltonian path problem can be solved using dynamic programming?
- The 0-1 Knapsack problem can be solved using Greedy algorithm.
- Which of the following problems can be solved using the longest subsequence problem?
- Tower of hanoi problem can be solved iteratively.
- Fractional knapsack problem can be solved in time O(n).
- The Euler’s circuit problem can be solved in?
- Which of the following problems can’t be solved using recursion?
- Can stable marriage cannot be solved using branch and bound algorithm.

Login to Continue

It will take less than 2 minutes

Report MCQ