CS6402 Design and Analysis of Algorithms Syllabus Notes Question Papers 2 Marks with Answers Question Bank with answers Anna University CS6402 DAA Notes Syllabus 2 Marks with answers CSE & IT 4th Semester - Regulation 2013 4th Semester Syllabus Notes

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.

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.

Other Subjects related to CSE 4th Semester

CSE Regulation 2008 2nd 4th 6th 8th Semester Notes - Click here
CSE Regulation 2008 1st 3rd 5th 7th Semester Notes - Click here

CHECK ALSO
Anna University Regulation 2013 UG Syllabus - Click here

search by students

CS6402 Design and Analysis of Algorithms Anna university 4th semester Regulation 2013 notes
Anna University Regulation 2013 4th Semester Notes
Regulation 2013 4th Semester Notes Anna University
CS6402 Design and Analysis of Algorithms Syllabus Notes CSE IT 4th Semester
CS6402 Design and Analysis of Algorithms Notes Syllabus Question Papers Question Bank 2 marks with answers
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 IT 4th Semester notes
Anna University chennai madurai,coimbatore Mechanical 4th semester notes
Anna University 4th Semester notes Regulation 2013
Anna University CS6402 DAA CSE IT 4th Semester Notes
Anna University 4th Semester Notes Regulation 2013
Anna University CSE 4th Semester Notes Syllabus Question Bank Question Papers
Anna University 4th semester Lecture Notes Syllabus Question Bank Regulation 2013