Design Analysis of Algorithm Practical Codes
Practical No 1
Aim- Study analyze implement tower of Hanoi where end is Two Move entire Stack to another rods for N=3 and Understand the Concept of Recursion
Practical No 2
Aim- Explain the Knapsack Algorithm to find the optimal Solution of getting the MAX Profit and Implement using the C-Program
Practical No 3
Aim- Develop a Program to implement floyd Algorithm which will produce a shortest distance between all vertex pair of Weighted Graph
Practical No 4
Aim- Write a Program to Implement a Binary search Algorithm using Recursion
Practical No 5
Aim- Implement a LCS (Longest Common Subsequence) using Dyanamic Programming
Practical No 6
Aim- Develop a Program to print all node reachable from starting Node using Dept First Search (DFS)
Practical No 7
Aim- Write a Program to implement a Quick sort using Divide and Conquer Approach
Practical No 8
Aim- Write a Program to implement merge sort using Divide and Conquer Approach
Practical No 9
Aim- Write a Program to implement BFS Using Backtracking
Practical No 10
Aim- Implement c Program for N-Queen Problem using Backtracking