Scribd
Upload
238 views

Ada Lab

1. Implement algorithms for sorting, searching, shortest paths, minimum spanning trees, knapsack problem, traveling salesperson problem, n-queens using concepts like recursion, dynamic programming, and parallel programming. 2. Measure time taken to run algorithms on different sized inputs and plot graphs comparing performance. 3. Implement classic graph algorithms like topological sorting, connectivity checking, transitive closure.

Uploaded by

sanjeevkunte
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
238 views

Ada Lab

1. Implement algorithms for sorting, searching, shortest paths, minimum spanning trees, knapsack problem, traveling salesperson problem, n-queens using concepts like recursion, dynamic programming, and parallel programming. 2. Measure time taken to run algorithms on different sized inputs and plot graphs comparing performance. 3. Implement classic graph algorithms like topological sorting, connectivity checking, transitive closure.

Uploaded by

sanjeevkunte
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 2

1.

Sort a given set of elements using the Quicksort method and determine the time required to sort the elements. Repeat the experiment for different values of n, the number of elements in the list to be sorted and 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. 2. Using OpenMP, implement a parallelized Merge Sort algorithm to sort a given set of elements and determine the time required to sort the elements. Repeat the experiment for different values of n, the number of elements in the list to be sorted and 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. 3. a. Obtain the Topological ordering of vertices in a given digraph. b. Compute the transitive closure of a given directed graph using Warshall's algorithm. 4. Implement 0/1 Knapsack problem using Dynamic Programming. 5. From a given vertex in a weighted connected graph, find shortest paths to other vertices using Dijkstra's algorithm. 6. Find Minimum Cost Spanning Tree of a given undirected graph using Kruskal's algorithm. 7. a. Print all the nodes reachable from a given starting node in a digraph using BFS method. b. Check whether a given graph is connected or not using DFS method. 8. Find a subset of a given set S = {sl, s2,.....,sn} of n positive integers whose sum is equal to a given positive integer d. For example, if S= {1, 2, 5, 6, 8} and d = 9 there are two solutions{1,2,6}and{1,8}.A suitable message is to be displayed if the given problem instance doesn't have a solution. 9. Implement any scheme to find the optimal solution for the Traveling Salesperson problem and then solve the same problem instance using any approximation algorithm and determine the error in the approximation. 10. Find Minimum Cost Spanning Tree of a given undirected graph using Prims algorithm. 11. Implement All-Pairs Shortest Paths Problem using Floyd's algorithm. Parallelize this algorithm, implement it using OpenMP and determine the speed-up achieved. 12. Implement N Queen's problem using Back Tracking. OLD 1. Implement Recursive Binary search and Linear search and determine the time required to search an element. Repeat the experiment for different values of n, the number of elements in the list to be searched and plot a graph of the time taken versus n. 2. Sort a given set of elements using the Heapsort method and determine the time required to sort the elements. Repeat the experiment for different values of n, the number of elements in the list to be sorted and plot a graph of the time taken versus n. 3. Sort a given set of elements using Merge sort method and determine the time required to sort the elements. Repeat the experiment for different values of n, the number of elements in the list to be sorted and plot a graph of the time taken versus n. 4. Sort a given set of elements using Selection sort and determine the time required to sort elements. Repeat the experiment for different values of n, the number of elements in the list to be sorted and plot a graph of the time taken versus n. 5. Implement 0/1 Knapsack problem using dynamic programming. 6. From a given vertex in a weighted connected graph, find shortest paths to other vertices using Dijkstra's algorithm.

7. Sort a given set of elements using Quick sort method and determine the time required sort the elements. Repeat the experiment for different values of n, the number of elements in the list to be sorted and plot a graph of the time taken versus n. 8. Find Minimum Cost Spanning Tree of a given undirected graph using Kruskal's algorithm. 9. a. Print all the nodes reachable from a given starting node in a digraph using BFS method. b. Check whether a given graph is connected or not using DFS method. 10. Find a subset of a given set S = {sl,s2,.....,sn} of n positive integers whose sum is equal to a given positive integer d. For example, if S= {1,2, 5, 6, 8} and d = 9 there are two solutions{1,2,6}and{1,8}.A suitable message is to be displayed if the given problem instance doesn't have a solution. 11. a. Implement Horspool algorithm for String Matching. b. Find the Binomial Co-efficient using Dynamic Programming. 12. Find Minimum Cost Spanning Tree of a given undirected graph using Prims algorithm. 13. a. Implement Floyds algorithm for the All-Pairs- Shortest-Paths problem. b. Compute the transitive closure of a given directed graph using Warshall's algorithm. 14. Implement N Queen's problem using Back Tracking.

You might also like