Scribd
Upload
17 views2 pages

DAA Assignment

Uploaded by

chikkiii1903
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
17 views2 pages

DAA Assignment

Uploaded by

chikkiii1903
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
You are on page 1/ 2

Department of Information Technology

National Institute of Technology Raipur

Design and Analysis of Algorithm Lab


(IT105402IT)
Program List

Note: Implement the following Algorithmic problem using Java/Python programming


language on LINUX or Windows like platform.

1. Write a program to implement Insertion sort and test it with appropriate list of input
data.
2. Write a program to implement Merge Sort and test it with appropriate list of input
data.
3. Write a program to implement Maximum Subarray Algorithm using Divide and
Conquer approach and test it with appropriate list of input data.
4. Write a program for Building the Max heap and then sort the given elements using
Heap sorting and show the result by using different test-cases with appropriate input
data.
5. Write a program for finding the kth minimum and maximum element in a Max-Heap
and test it with appropriate input data.
6. Write a program to implement Quick Sort using first/last/any random element as pivot
and test it with appropriate list of input data.
7. Write a program to implement Counting sort and test it with appropriate list of input
data.
8. Write a program to implement Radix Sort and test it with appropriate list of input
data.
9. Write a program to implement Red-Black Tree Insertion Algorithm and test it with
appropriate list of input data.
10. Write a program to implement the rod-cutting problem using top-down with
memorization technique and show the result by using different test-cases with
appropriate input data.
11. Write a program to implement the matrix chain multiplication problem using
Dynamic programming approach and show the result by using different test-cases
with appropriate input data.
12. Write a program to implement the fractional- Knapsack problem using Greedy
approach and show the result by using different test-cases with appropriate input data.
13. Write a program to implement Dijkstra's shortest path algorithm. For a given vertex in
a weighted connected graph, show the result by using different test-cases.
14. Write a program to implement Minimum Cost Spanning Tree problem. For a given
weighted connected graph, show the result by using different test-cases.
15. Write a program to implement all-pair shortest path algorithm. show the result by
using different test-cases.

You might also like