Design and Analysis of Algorithms Lab

List of Experiments:

1. Sort a given set of elements using the quick sort algorithm and find the time complexity for different values of n.
   
   
2. Implement merge sort algorithm using divide & conquer method to sort a given set of elements and determine the time and space required to sort the elements.
   
   
3. Write a program to implement knapsack problem using greedy method.
   
   
4. Program to implement job sequencing with deadlines using greedy method.
   
   
5. Write a program to find minimum cost spanning tree using Prim’s Algorithm.
   
   
6. Write a program to find minimum cost spanning tree using Kruskal’s Algorithm.
   
   
7. Implement 0/1 Knapsack problem using dynamic programming.
   
   
8. Write a program to perform Single source shortest path problem for a given graph.
   
   
9. Program for finding shortest path for multistage graph using dynamic programming.
   
   
10. Program to implement 8-queens problem using backtrack method.