• 1. Write a program to sort a given elements using Merge sort method and find the time required to sort the elements.
• 2. Write a program to sort a given elements using Quick sort method and find the time required to sort the elements.
• 3. Write a program to print all the nodes reachable from a given starting node in a graph using Depth First Search method and Breadth First method. Also check connectivity of the graph. If the graph is not connected, display the number of components in the graph.
• 4. Write a program to obtain the Topological ordering of vertices in a given digraph using a)Vertices deletion method b)DFS method
• 5. Write a program to sort a given set of elements using Heap sort method. Find the time complexity
• 6. Write a program to implement Horspool’s algorithm for String Matching.
• 7. Write a program to implement 0/1 Knapsack problem using dynamic programming
• 8. Write a program to find Minimum cost spanning tree of a given undirected graph usingPrim’s algorithm