CS8451 Syllabus Design and Analysis Of Algorithms
CS8451 Syllabus Design and Analysis Of Algorithms Regulation 2017 Anna University free download. Design and Analysis Of Algorithms Syllabus CS8451 pdf free download.
UNIT I INTRODUCTION 9 CS8451 Syllabus Design and Analysis Of Algorithms
Notion of an Algorithm – Fundamentals of Algorithmic Problem Solving – Important Problem Types – Fundamentals of the Analysis of Algorithmic Efficiency –Asymptotic Notations and their properties. Analysis Framework – Empirical analysis – Mathematical analysis for Recursive and Non-recursive algorithms – Visualization
UNIT II BRUTE FORCE AND DIVIDE-AND-CONQUER 9 CS8451 Syllabus Design and Analysis Of Algorithms
Brute Force – Computing an – String Matching – Closest-Pair and Convex-Hull Problems – Exhaustive Search – Travelling Salesman Problem – Knapsack Problem – Assignment problem. Divide and Conquer Methodology – Binary Search – Merge sort – Quick sort – Heap Sort – Multiplication of Large Integers – Closest-Pair and Convex – Hull Problems.
UNIT III DYNAMIC PROGRAMMING AND GREEDY TECHNIQUE 9 CS8451 Syllabus Design and Analysis Of Algorithms
Dynamic programming – Principle of optimality – Coin changing problem, Computing a Binomial Coefficient – Floyd‘s algorithm – Multi stage graph – Optimal Binary Search Trees – Knapsack Problem and Memory functions. Greedy Technique – Container loading problem – Prim‘s algorithm and Kruskal’s Algorithm – 0/1 Knapsack problem, Optimal Merge pattern – Huffman Trees.
UNIT IV ITERATIVE IMPROVEMENT 9 CS8451 Syllabus Design and Analysis Of Algorithms
The Simplex Method – The Maximum-Flow Problem – Maximum Matching in Bipartite Graphs, Stable marriage Problem.
UNIT V COPING WITH THE LIMITATIONS OF ALGORITHM POWER 9 CS8451 Syllabus Design and Analysis Of Algorithms
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 – Travelling Salesman Problem – Approximation Algorithms for NP-Hard Problems – Travelling Salesman problem – Knapsack problem.
| Subject name | Design and Analysis Of Algorithms |
| Short Name | DAA |
| Semester | 4 |
| Subject Code | CS8451 |
| Regulation | 2017 regulation |
CS8451 Design and Analysis Of Algorithms Syllabus Click Here To Download
CS8451 Design and Analysis Of Algorithms Notes
CS8451 Design and Analysis Of Algorithms Important Questions
CS8451 Design and Analysis Of Algorithms Question Bank