Scribd
Upload
14 views2 pages

Design and Analysis of Algorithms

The document outlines a series of lab programs focused on the design and analysis of algorithms. It includes tasks such as implementing sorting techniques, solving optimization problems like the traveling salesman and knapsack problems, and utilizing graph theory concepts. Additionally, it covers algorithms related to dynamic programming, backtracking, and minimum spanning trees.

Uploaded by

udhay9203
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
14 views2 pages

Design and Analysis of Algorithms

The document outlines a series of lab programs focused on the design and analysis of algorithms. It includes tasks such as implementing sorting techniques, solving optimization problems like the traveling salesman and knapsack problems, and utilizing graph theory concepts. Additionally, it covers algorithms related to dynamic programming, backtracking, and minimum spanning trees.

Uploaded by

udhay9203
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

DESIGN AND ANALYSIS OF ALGORITHMS

LAB PROGRAMS

1. Write a program to sort a list of N elements using selection sort


technique .

2. Write a program to perform travelling salesman problem .

3. Write a program to implement dynamic programming algorithm


for all 0/1 knapsack problem.

4. Write a program to perform knapsack problem using greedy


solution.

5. Write a program to find minimum and maximum value in an


array using divide and conquer.

6. Write a test program to implement divide and conquer strategy.


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

8. Implement function to print In-Degree, Out-Degree and to display


adjacency matrix.

9. Write a program to implement backtracking algorithm for solving


problems like N queens.

10. Write a program to implement the backtracking algorithm for


the sum of subsets problem.

11. Write a program to implement dynamic programming algorithm


for the optimal binary search tree problem.

12. Write a program that implements kruskal’s algorithm to


generate minimum cost spanning tree.

You might also like