NAME OF THE LAB AD3351 / DESIGN AND ANALYSIS OF ALGORITHMS
ACADEMIC YEAR 2024-2025
YEAR/SEMESTER II YR/III SEM
REGULATION 2021
CORE/ELECTIVE CORE
MAIN/INTEGRATED INTEGRATED
SOFTWARE USED IDE
LIST OF EXPERIMENTS
1. Implement recursive and non-recursive algorithms and study the order of growth from
log2n to n!.
2. Divide and Conquer - Strassen’s Matrix Multiplication.
3. Decrease and Conquer - Topological Sorting.
4. Transform and Conquer - Heap Sort.
5. Dynamic programming - Coin change Problem, Warshall’s and Floyd‘s algorithms,
Knapsack Problem.
6. Greedy Technique – Dijkstra’s algorithm, Huffman Trees and codes.
7. Iterative improvement - Simplex Method.
8. Backtracking – N-Queen problem, Subset Sum Problem.
9. Branch and Bound - Assignment problem, Traveling Salesman Problem.
COURSE OUTCOMES:
CO1. Analyze the efficiency of recursive and non-recursive algorithms mathematically.
CO2. Analyze the efficiency of brute force, divide and conquer, decrease and conquer,
Transform and conquer algorithmic techniques
CO3. Implement and Analyze the problems using dynamic programming and greedy
algorithmic techniques.
CO4. Solve the problems using iterative improvement techniques for optimization.
CO5. Compute the limitations of algorithmic power and solve the problems using
backtracking and branch and bound techniques.
TOTAL: 30 PERIODS
HOD STAFF INCHARGE
