Scribd
Upload
23 views1 page

Daa Lab Programs

The document outlines a series of programming tasks for a lab focused on design and analysis of algorithms. It includes both sorting algorithms like Selection Sort, Merge Sort, and Quick Sort, as well as graph-related algorithms such as Prim's algorithm and the Travelling Salesman Problem. Additionally, it covers concepts like Divide and Conquer, Greedy Solutions, and Dynamic Programming.

Uploaded by

athifaparveez429
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
23 views1 page

Daa Lab Programs

The document outlines a series of programming tasks for a lab focused on design and analysis of algorithms. It includes both sorting algorithms like Selection Sort, Merge Sort, and Quick Sort, as well as graph-related algorithms such as Prim's algorithm and the Travelling Salesman Problem. Additionally, it covers concepts like Divide and Conquer, Greedy Solutions, and Dynamic Programming.

Uploaded by

athifaparveez429
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 & ANALYSIS OF ALGORITHMS LAB PROGRAMS (DSC13)

PART – A
1. Write a program to sort a list of “N” elements using Selection Sort
Technique
2. Write a program to implement Merge sort algorithm for sorting a list of
integers in ascending order.
3. Write a program that implements Prim’s algorithm to generate minimum
cost spanning Tree.
4. 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.
5. Write a program in C to find the min and max value in an array using Divide
and Conquer method
6. WAP to perform Knapsack Problem using Greedy Solution

PART – B
1. Write a test program to implement Divide and Conquer Strategy.
2. Write C program that accepts the vertices and edges for a graph and stores it
as an adjacency matrix.
3. Write a Program to perform Travelling Salesman Problem
4. 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.
5. Write program to implement Dynamic Programming algorithm for the
Optimal Binary Search Tree Problem.
6. Implement function to print In-Degree, Out-Degree and to display that
adjacency matrix

You might also like