ACADEMY OF TECHNOLOGY

ACADEMY OF TECHNOLOGY
AEDCONAGAR, HOOGHLY – 712121

DEPARTMENT OF CSE/IT

Name of the Faculty : DILIP KUMAR MAITY, ARINDRAJIT PAL, SUBRATA DAS
Subject with code : Design and Analysis of Algorithm Lab (CS591/IT591)
Semester/ Branches : 5th Semester/CSE & IT
Credit: 4

LABORATORY ASSIGNMRNTS FOR CSE/IT

Use: File handing, Function and dynamic memory allocation mechanisms.

1. Program to implement Insertion Sort Algorithm to arrange a set of unsorted numbers

into ascending order.
2. Program to implement Selection Sort Algorithm to arrange a set of unsorted numbers
into ascending order.
3. Program to implement Tower of Hanoi problem of at least three disks.

4. Program to implement a graph in a file using adjacency matrix.

i. Read the content of the file in a 2D array.
ii. Find the total cost/weight of the graph.
iii. Find the minimum, maximum and frequency of same weighted edges.
5. Program to implement a graph from a file using link representation.

6. Program to implement Binary Search Algorithm using Divide & Conquer approach to
search a number from a set of sorted numbers.
7. Program to find Maximum and Minimum element from an array of integer using Divide
& Conquer approach.
8. Program to implement Merge Sort Algorithm using Divide & Conquer Approach to
arrange a set of unsorted number into ascending order.

9. Program to implement Quick Sort Algorithm using Divide & Conquer Approach to
arrange a set of unsorted number into ascending order.
10. Program to implement Heap Sort Algorithm to arrange a set of unsorted number into
ascending order.

11. Program to implement Breadth First Search (BFS) Algorithm to traverse a graph.

12. Program to implement Depth First Search (DFS) Algorithm to traverse a graph.

13. Program to implement Knapsack problem (Fractional) using Greedy Approach.

14. Program to implement the Fractional Knapsack problem.

LAB assignment CS 591/IT 591

Page 1
 ACADEMY OF TECHNOLOGY

15. Program to implement Job sequencing with deadlines problem using Greedy Approach.

16. Program to implement Prim’s Algorithm using Greedy Approach.

17. Program to implement Krushkal’s Algorithm using Greedy Approach.

18. Program to implement Dijkstra’s Algorithm using Dynamic Programming Approach.

19. Program to implement Matrix Chain Multiplication using Dynamic Programming

Approach.

20. Program to implement All pairs shortest path (Floyd-Warshall Algorithm) using
Dynamic Programming Approach.

21. Program to implement Eight Queens problem using Backtracking Approach.

LAB assignment CS 591/IT 591

Page 2