DESIGN ALGORITHM AND ANALYSIS LAB FILE

DESIGN ALGORITHM AND ANALYSIS LAB FILE

 1. Write a Program for iterative and recursive Binary Search.

2. Write a Program to sort a given set of elements using the Quick Sort/Merge Sort/Selection Sort method and determine the time required to sort the elements.

3. Write a Program for implementation of Fractional Knapsack problem using Greedy Method and 0/1 Knapsack problem using Dynamic Programming.

4.Write a Program to find the shortest path from a given vertex to other vertices in a weighted connected graph using Dijkstra’s algorithm 

5. Write a Program to find the minimum cost spanning tree (MST) of a given undirected graph using Kruskal’s algorithm/Prim’s Algorithms. 

6.Write a Program to implement N-Queens problem using back tracking. 

7. Write a Program to check whether a given graph is connected or not using DFS method. 

8.Write a program to implement the Travelling Salesman Problem (TSP).