1. Implementation of Matrix –chain multiplication algorithm with dynamic programming.
2. Implementation of Quick Sort using divide and conquer.
3. Implementation of TSP using dynamic programming.
4. Implementation of Min-Max using divide and conquer,
5. Implementation of Reliability Design problem.
6. Implementation of Merge Sort using divide and conquer.
7. Implementation of OBST using dynamic programming.
8. Implementation of Binary Search using divide and conquer.
9. Implementation of LCS algorithm and print Longest common subsequence.
10. Implement Knapsack Algorithm using Greedy approach.
11. Implementation of All-pairs shortest path algorithms using dynamic programming.
12. Implementation of optimal merge patterns.
13. Implementation of 0/1 Knapsack algorithm using dynamic programming.
14. Implement connected components with appropriate graph traversal.
15. Implementation of multi-stage graph using dynamic programming.
16. Implementation of Heap Sort.
17. Implementation of N-queens problem with back tracking.
18. Implement depth first search (DFS) tree traversal. (Using Adjacency Matrix)
19. Implementation of Graph coloring problem with back tracking.
20. Implement Breadth first search (BFS) tree traversal.
21. Implementation of Hamiltonian cycle using backtracking.
22. Implement inorder-order traversal of binary tree without recursion.
23. Implementation of TSP by branch and bound.
24. Implementation of Hashing.Linear probing, hash chaining , Quadratic probing
25. Implementation of 0/1 knapsack by branch and bound.
26. Implement post-order traversal of binary tree without recursion.
27. Implement Dijkstra’s single source shortest path algorithm. (Using Adjacency Matrix)
28. Implement pre-order traversal of binary tree without recursion.
29. Implement Kruskal’s spanning tree algorithm.
30. Implementation of optimal storage on tapes.(Multiple tapes)
31. Implement Prim’s spanning tree algorithms.
32. Implement a program to find an in-order successor and predecessor of specified node in a tree.