LIST OF EXPERIMENTS
1. Apply the divide and Conquer technique to arrange a set of numbers using
merge sort method.
2. Perform Strassen’s matrix multiplication using divide and conquer method.
3. Solve the knapsack problem using greedy method.
4. Construct a minimum spanning tree using greedy method.
5. Construct optimal binary search trees using dynamic programming method of
problem solving.
6. Find the solution for traveling salesperson problem using dynamic programming
approach.
7. Perform graph traversals.
8. Implement the 8-Queens Problem using backtracking.
9. Implement knapsack problem using backtracking.
10. Find the solution of traveling salesperson problem using branch and bound
technique.