A1.   Sort a given set of elements using the Quick 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. The elements can be read from a file or can be generated using the random number generator.

A2.   Implement a 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. The elements can be read from a file or can be generated using the random number generator.

A3.   Write a program to sort a list of N elements using Selection Sort Technique.

A4.   Write a program to perform Travelling Salesman Problem

A5.   Write program to implement Dynamic Programming algorithm for the 0/1 Knapsack problem.

A6.   Write a program to perform Knapsack Problem using Greedy Solution

A7.   Write program to implement the DFS and BFS algorithm for a graph.

A8.   Write a program to find minimum and maximum value in an array using divide and conquer.

A9.   Write a test program to implement Divide and Conquer Strategy. Eg: Quick sort algorithm for sorting list of integers in ascending order.

A10.   Write a program to implement Merge sort algorithm for sorting a list of integers in ascending order.

B1.   Write a program to Sort a given set of n integer elements using Merge Sort method and compute its time complexity. Run the program for varied values of n> 5000, and record the time taken to sort.

B2.   Write a program to Sort a given set of n integer elements using Quick Sort method and compute its time complexity. Run the program for varied values of n> 5000 and record the time taken to sort.

B3.   Write C program that accepts the vertices and edges for a graph and stores it as an adjacency matrix.

B4.   Write a program to Implement a function to print In-Degree, Out-Degree and to display that adjacency matrix.

B5.   Write program to implement backtracking algorithm for solving problems like N queens.

B6.   Write a program to implement the backtracking algorithm for the sum of subsets problem

B7.   Write program to implement greedy algorithm for job sequencing with deadlines.

B8.   Write program to implement Dynamic Programming algorithm for the Optimal Binary Search Tree Problem.

B9.   Write a program that implements Prim's algorithm to generate minimum cost spanning Tree.

B10.   Write a program that implements Kruskal's algorithm to generate minimum cost spanning tree.