daa practical list
DESCRIPTION
DAATRANSCRIPT
MEERUT INSTITUTE OF ENGINEERING & TECHNOLOGY, MEERUTN.H. 58, Delhi-Roorkee Highway, Baghpat Road Bypass Crossing, Meerut-250005
Computer Science & Engineering DepartmentB. Tech. 3rd Year/ 5th Semester
(Session: 2013 – 14)
DAA Lab (ECS-552) L T P0 0 2
1. Write Program in C to implement Insertion Sort.
2. Write Program in C to implement Merge Sort.
3. Write Program in C to implement Quick Sort.
4. Write Program in C to implement Heap Sort.
5. Write Program in C to implement Radix Sort
6. Write Program in C to implement Counting Sort.
7. Write Program in C for implementation of Matrix multiplication algorithm.
8. Write Program in C for implementation of 0-1 knapsack algorithm.
9. Write Program in C for implementation of Kruskal algorithm of minimum spanning tree.
10. Write Program in C for implementation of Dijkstra’s algotithm for single source shortest path
problem.
11. Write Program in C for implementation of Floyd and Warshall’s algorithm for all pair shortest
path problem,
VALUE ADDED PROGRAMS
12. Write Program in C for implementation of TSP by backtracking.
13. Write Program in C for implementation of sum of subset problem.
14. Write Program in C for implementation of Bellmanford algorithm.
15. Write Program in C for implementation of N- Queen problem.
…………………………………………………….
NAME & SIGNATURE OF CONCERNED FACULTY