Category PYQ’s

10. How the branch and bound technique is different from backtracking? Solve the following instance of knapsack problem using Branch and Bound technique. Give knapsack capacity = 10. Answer: The…

8. Apply the branch and bound algorithm to solve the travelling salesman problem for the graph below. Answer:

5. Explain Subset sum problem with suitable example. Answer:

4. What are the two additional items required by Branch and Bound technique compared with backtracking. Solve the following assignment problem using branch and bound technique whose cost matrix for…

2. Discuss graph coloring problem. Find different solutions for 4 nodes and all possible 3 coloring problem. Answer:

11. Find the optimal tour for sales person using dynamic programming technique for the given graph and its corresponding edge length matrix. Answer:

10. Solve the following travelling sales person problem represented as a graph shown in Fig below using dynamic programming. Answer:

9. Using Dynamic Programming solve the below instance of knapsack problem. Capacity W=5 Item Weight Value 1 2 12 2 1 10 3 3 20 4 2 15 Answer:

Q. Apply Warshall’s algorithm to compute transitive closure for the graph below. Answer: