**Anna University CS6402 Design and Analysis of Algorithms**

**Notes Syllabus 2 marks with answers Part A Question Bank with answers Key - CSE & IT 4th Semester**

Anna University CS6402 Design and Analysis of Algorithms Syllabus Notes 2 marks with answer is provided below. CS6402 Notes Syllabus all 5 units notes are uploaded here. here CS6402 DAA Syllabus notes download link is provided and students can download the CS6402 Syllabus and Lecture Notes and can make use of it.

**Click below link to download**

**Design and Analysis of Algorithms**

**Study Materials .**

**CS6402 DESIGN AND ANALYSIS OF ALGORITHUM**

**SYLLABUS REGULATION 2013****UNIT I INTRODUCTION**

Notion of an Algorithm – Fundamentals of Algorithmic Problem Solving – Important Problem Types – Fundamentals of the Analysis of Algorithm Efficiency – Analysis Framework – Asymptotic Notations and its properties – Mathematical analysis for Recursive and Non-recursive algorithms.

**UNIT II BRUTE FORCE AND DIVIDE-AND-CONQUER**

Brute Force - Closest-Pair and Convex-Hull Problems-Exhaustive Search - Traveling Salesman Problem - Knapsack Problem - Assignment problem. Divide and conquer methodology – Merge sort – Quick sort – Binary search – Multiplication of Large Integers – Strassen’s Matrix Multiplication-Closest-Pair and Convex-Hull Problems.

**UNIT III DYNAMIC PROGRAMMING AND GREEDY TECHNIQUE**

Computing a Binomial Coefficient – Warshall’s and Floyd’ algorithm – Optimal Binary Search Trees – Knapsack Problem and Memory functions. Greedy Technique– Prim’s algorithm- Kruskal's Algorithm- Dijkstra's Algorithm-Huffman Trees.

**UNIT IV ITERATIVE IMPROVEMENT**

The Simplex Method-The Maximum-Flow Problem – Maximm Matching in Bipartite Graphs- The Stable marriage Problem.

**UNIT V COPING WITH THE LIMITATIONS OF ALGORITHM POWER**

Limitations of Algorithm Power-Lower-Bound Arguments-Decision Trees-P, NP and NP-Complete Problems--Coping with the Limitations - Backtracking – n-Queens problem – Hamiltonian Circuit Problem – Subset Sum Problem-Branch and Bound – Assignment problem – Knapsack Problem – Traveling Salesman Problem- Approximation Algorithms for NP – Hard Problems – Traveling Salesman problem – Knapsack problem.

**Click below link to download the Notes and 2 marks with answers Question Bank**

**CS6402 DAA Notes - Click here (Notes 1) | Notes R2008 Link**

**CS6402 DAA**

**Click here (Notes 2)**

**CS6402 DAA**

**Click here (Notes 3)**

**CS6402 DAA**

**Click here (Notes 4)**

**CS6402 DAA**

**Click here (Notes 5)**

**CS6402 DAA 2 marks with answers - Click here**

**CS6402 DAA Question Bank - Click here**

**CS6402 DAA Question Papers ( Previous year) - Click here**

**If you have any problem in downloading the above material, you can comment below.**

**search by students**

CS6402 Design and Analysis of Algorithms Anna university 4th semester Regulation 2013 notes

CS6402 Design and Analysis of Algorithms Syllabus Notes CSE IT 4th Semester

Anna University CS6402 Notes Syllabus Question Papers Question Bank 2 marks with answers

CS6402 Design and Analysis of Algorithms Lecture Notes Subject Notes Anna University

Anna University CSE 4th Semester Notes Syllabus Question Bank Question Papers

Anna University 4th semester Lecture Notes Syllabus Question Bank Regulation 2013

## 0 Comments

Post Your comments,Views and thoughts Here, Give Us Time To Respond Your Queries