**Design & Analysis of Algorithms Lab Manual BTCS508**

- To find HCF and LCM of two numbers
- Code and analyses to find median element in an array of integers.
- Code and analyse to find majority element in an array of integers.
- Code and analyse to sort an array of integers using merge sort
- Code and analyse to sort an array of integers using quick sort
- To implement maximum and minimum problem using divide and conquer strategy
- To implement binary search using divide and conquer strategy
- To implement program of Heap Sort.
- WAP of minimum spanning tree using Kruskal algorithm.
- WAP of minimum spanning tree using Prim’s algorithm.
- WAP to implement matrix chain multiplication
- Code to find the shortest path in graph using Dijkstra’s algorithm.
- Code to find the shortest path using Bellman-Ford algorithm.
- To implement LCS problem using Dynamic Programming.
- To implement matrix chain multiplication problem using dynamic programming.
- Code and analyze to find the minimum spanning tree in a weighted, undirected graph.
- Code and analyze to find all occurrences of a pattern P in a given string S.
- Code and analyze to do a depth-first search (DFS) on an undirected graph. Implementing an application of DFS such as

(i) to find the topological sort of a directed acyclic graph.

(ii) to find a path from source to goal in a maze. - Code and analyze to do a breadth-first search (BFS) on an undirected graph. Implementing an application of BFS such as

(i) to find connected components of an undirected graph.

(ii) to check whether a given graph is bipartite.

(Visited 418 times, 1 visits today)

Written by: 13/03/2018

Thanks, it is very informative