Analysis and Design of Algorithms Lab BCSL404

Design and implement C/C++ Program to find Minimum Cost Spanning Tree of a given connected undirected graph using Kruskal’s algorithm.

Design and implement C/C++ Program to find Minimum Cost Spanning Tree of a given connected undirected graph using Prim’s algorithm.

Design and implement C/C++ Program to solve All-Pairs Shortest Paths problem using Floyd’s algorithm.

Design and implement C/C++ Program to find the transitive closure using Warshal’s algorithm.

Design and implement C/C++ Program to find shortest paths from a given vertex in a weighted connected graph to other vertices using Dijkstra’s algorithm.

Design and implement C/C++ Program to obtain the Topological ordering of vertices in a given digraph.

Design and implement C/C++ Program to solve 0/1 Knapsack problem using Dynamic Programming method.

Design and implement C/C++ Program to solve discrete Knapsack and continuous Knapsack problems using greedy approximation method.

Design and implement C/C++ Program to find a subset of a given set S = {s1 , s2,…..,sn} of n positive integers whose sum is equal to a given positive integer d.

Design and implement C/C++ Program to sort a given set of n integer elements using Selection Sort method and compute its time complexity. Run the program for varied values of n> 5000 and record the time taken to sort. Plot a graph of the time taken versus n. The elements can be read from a file or can be generated using the random number generator.