Scribd
Upload
19 views

Design & Analysis Algorithm Lab Code: IT591 Contact: 3P Credits: 2 Programming Language Used:c

This document outlines the labs for a Design & Analysis Algorithm course with the code IT591. The course is worth 2 credits and uses C as the programming language. The 11 labs cover various algorithm design techniques including divide and conquer, dynamic programming, branch and bound, backtracking, greedy methods, and graph traversal. Students will implement classic algorithms like binary search, merge sort, quick sort, shortest path problems, the knapsack problem, and graph traversal algorithms.

Uploaded by

ayushbhargav
Copyright
© © All Rights Reserved
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
19 views

Design & Analysis Algorithm Lab Code: IT591 Contact: 3P Credits: 2 Programming Language Used:c

This document outlines the labs for a Design & Analysis Algorithm course with the code IT591. The course is worth 2 credits and uses C as the programming language. The 11 labs cover various algorithm design techniques including divide and conquer, dynamic programming, branch and bound, backtracking, greedy methods, and graph traversal. Students will implement classic algorithms like binary search, merge sort, quick sort, shortest path problems, the knapsack problem, and graph traversal algorithms.

Uploaded by

ayushbhargav
Copyright
© © All Rights Reserved
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 1

Design & Analysis Algorithm Lab

Code: IT591
Contact: 3P
Credits: 2
Programming Language used :C

Lab :1 : Divide and Conquer :


> Implement Binary Search using Divide and Conquer approach
> Find Maximum and Minimum element from a array of integer using Divide and
Conquer approach
Lab :2 : Divide and Conquer :
> Implement Merge Sort using Divide and Conquer approach.
> Implement Quick Sort using Divide and Conquer approach.
Lab :3 : Dynamic Programming :
> Find the minimum number of scalar multiplication needed for chain of matrix
Lab :4 : Dynamic Programming :
>Implement all pair of Shortest path for a graph ( Floyed- Warshall Algorithm)
>Implement Traveling Salesman Problem
Lab :5 : Dynamic Programming :
>Implement Single Source shortest Path for a graph (Dijkstra , Bellman Ford Algorithm)
Lab :6 : Brunch and Bound :
>Implement 15 Puzzle Problem
Lab :7 : Backtracking :
>Implement 8 Queen problem
Lab :8 : Backtracking (implement any one of the following problem):
>Graph Coloring Problem
>Hamiltonian Problem
Lab :9 : Greedy method(implement any one of the following problem) :
>Knapsack Problem
>Job sequencing with deadlines
Lab :10 : Greedy method (implement any one of the following problem) :
>Minimum Cost Spanning Tree by Prim's Algorithm
>Minimum Cost Spanning Tree by Kruskal's Algorithm
Lab :11 : Graph Traversal Algorithm :
>Implement Breadth First Search (BFS)
>Implement Depth First Search (DFS)

You might also like