AD3351 Design and Analysis of Algorithms Study Materials
Anna University – AD3351 Design and Analysis of Algorithms Regulation 2021 Syllabus, Notes, Important Questions, Question Paper with Answers, Previous Year Question Paper
UNIT I INTRODUCTION AD3351 Design and Analysis of Algorithms Syllabus
Notion of an Algorithm – Fundamentals of Algorithmic Problem Solving – Important Problem Types
–Fundamentals of the Analysis of Algorithm Efficiency – Analysis Framework – Asymptotic Notations
and their properties – Empirical analysis – Mathematical analysis of Recursive and Non-recursive
algorithms – Visualization.
UNIT II BRUTE FORCE AND DIVIDE AND CONQUER AD3351 Design and Analysis of Algorithms Notes
Brute Force – String Matching – Exhaustive Search – Traveling Salesman Problem – Knapsack
Problem – Assignment problem. Divide and Conquer Methodology – Multiplication of Large Integers
and Strassen’s Matrix Multiplication – Closest-Pair and Convex – Hull Problems. Decrease and
Conquer: – Topological Sorting – Transform and Conquer: Presorting – Heaps and Heap Sort.
UNIT III DYNAMIC PROGRAMMING AND GREEDY TECHNIQUE AD3351 Design and Analysis of Algorithms Important Questions
Dynamic programming – Principle of optimality – Coin changing problem – Warshall’s and Floyd‘s
algorithms – Optimal Binary Search Trees – Multi stage graph – Knapsack Problem and Memory
functions. Greedy Technique – Dijkstra’s algorithm – Huffman Trees and codes – 0/1 Knapsack
problem.
UNIT IV ITERATIVE IMPROVEMENT AD3351 Design and Analysis of Algorithms Question Paper
The Simplex Method-The Maximum-Flow Problem – Maximum Matching in Bipartite Graphs- The
Stable marriage Problem.
UNIT V LIMITATIONS OF ALGORITHM POWER AD3351 Design and Analysis of Algorithms Question Bank
Lower – Bound Arguments – P, NP, NP- Complete and NP Hard Problems. Backtracking – N-Queen
problem – Hamiltonian Circuit Problem – Subset Sum Problem. Branch and Bound – LIFO Search
and FIFO search – Assignment problem – Knapsack Problem – Traveling Salesman Problem –
Approximation Algorithms for NP-Hard Problems – Traveling Salesman problem – Knapsack
problem.
| Syllabus | Click Here |
| Notes | Click Here |
| Important Questions | Click Here |
| Previous Year Question Paper | Click Here |
| Question Bank | Click Here |
TEXT BOOKS: AD3351 Design and Analysis of Algorithms Important Questions
1. Anany Levitin, Introduction to the Design and Analysis of Algorithms, Third Edition, Pearson
Education, 2012.
REFERENCES: AD3351 Design and Analysis of Algorithms Notes
1. Ellis Horowitz, Sartaj Sahni and Sanguthevar Rajasekaran, Computer Algorithms/ C++,
Second Edition, Universities Press, 2019.
2. Thomas H.Cormen, Charles E.Leiserson, Ronald L. Rivest and Clifford Stein, Introduction to
Algorithms, Third Edition, PHI Learning Private Limited, 2012.
3. S. Sridhar, Design and Analysis of Algorithms, Oxford university press, 2014.
4. Alfred V. Aho, John E. Hopcroft and Jeffrey D. Ullman, Data Structures and Algorithms,
Pearson Education, Reprint 2006.
Related Links
Anna University Syllabus Regulation 2021
Anna University Regulation 2021 Study Materials
CGPA Calculator For Anna University
Download Padeepz App for Android