Scribd
Upload
24 views1 page

Ada Lab Programs

The document outlines various programming tasks related to algorithm design and analysis. It includes implementing solutions for the Travelling Salesman Problem, 0/1 Knapsack Problem, graph traversal algorithms (DFS and BFS), and sorting algorithms (Quick sort and Merge sort). Additionally, it covers graph representation using adjacency matrices, calculating in-degrees and out-degrees, and implementing Prim's algorithm for minimum cost spanning trees.

Uploaded by

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

Ada Lab Programs

The document outlines various programming tasks related to algorithm design and analysis. It includes implementing solutions for the Travelling Salesman Problem, 0/1 Knapsack Problem, graph traversal algorithms (DFS and BFS), and sorting algorithms (Quick sort and Merge sort). Additionally, it covers graph representation using adjacency matrices, calculating in-degrees and out-degrees, and implementing Prim's algorithm for minimum cost spanning trees.

Uploaded by

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

DESIGN AND ANALYSIS OF ALGORITHM

1. Write a program to perform Travelling salesman problem.


2. Write a program to implement Dynamic programming algorithm for the 0/1
knapsack problem.
3. Write a program to perform Knapsack problem using Greedy solution.
4. Write a program to implementing DFS and BFS algorithm for a graph.
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 [Link]: Quick
sort algorithm for sorting list of integers in ascending order.
7. Write a program to implement Merge sort algorithm for sorting a list of
integers in ascending order.
8. Write a C program that accepts the vertices and edges for a graph and store it
as an adjacency matrix.
9. Implement function to print In-degree,Out- degree and to display that
adjacency matrix.
[Link] a program to implement backtracking algorithm for solving problems
like N Queens
[Link] a program that implements Prim's algorithm to generate minimum cost
spanning Tree.

You might also like