(a) Define Travelling Salesman Problem (TSP). Explain the basic steps…
Previous year question for Analysis & Design of Algorithms.
Question
(a) Define Travelling Salesman Problem (TSP). Explain the basic steps that are to be followed to solve TSP using branch and bound. Illustrate with an example.
(b) State and explain N Queens Problem. Write the backtracking algorithm for solving N Queens problem.
- Year: 2022
- Subject: Analysis & Design of Algorithms