Scribd
Upload
338 views

Daa Practical List

This document contains a list of 15 programming assignments for a Data Structures and Algorithms Lab course at Meerut Institute of Engineering & Technology. The assignments include implementing sorting algorithms like insertion sort and merge sort, graph algorithms like minimum spanning tree and shortest path, and other algorithms like matrix multiplication, knapsack problem, N-queen problem, and Bellman-Ford algorithm. Students are required to write C programs to solve these algorithmic problems over the course of the semester.

Uploaded by

Jyoti Goswami
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
338 views

Daa Practical List

This document contains a list of 15 programming assignments for a Data Structures and Algorithms Lab course at Meerut Institute of Engineering & Technology. The assignments include implementing sorting algorithms like insertion sort and merge sort, graph algorithms like minimum spanning tree and shortest path, and other algorithms like matrix multiplication, knapsack problem, N-queen problem, and Bellman-Ford algorithm. Students are required to write C programs to solve these algorithmic problems over the course of the semester.

Uploaded by

Jyoti Goswami
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 1

MEERUT INSTITUTE OF ENGINEERING & TECHNOLOGY, MEERUT

N.H. 58, Delhi-Roorkee Highway, Baghpat Road Bypass Crossing, Meerut-250005

Computer Science & Engineering Department B. Tech. 3rd Year/ 5th Semester (Session: 2013 14)

DAA Lab (ECS-552)


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.

L 0

T 0

P 2

9. Write Program in C for implementation of Kruskal algorithm of minimum spanning tree. 10. Write Program in C for implementation of Dijkstras algotithm for single source shortest path problem. 11. Write Program in C for implementation of Floyd and Warshalls 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

You might also like