Design and Analysis of Algorithms Notes Anna University CS2251 DAA Notes

Tags : Anna University, CSE, Notes, , , , , .

Design and Analysis of Algorithms Notes Anna University CS2251 DAA Lecture Notes, Subject Notes for CSE 4th Semester

Design and Analysis of Algorithms Notes anna university CS2251 DAA Notes download. Here we have provided the Anna University notes for CSE 4th Semester for the Subjects Design and Analysis of Algorithms Notes and content of CS2251 DAA Notes.

CS2251 DESIGN AND ANALYSIS OF ALGORITHMS ANNA UNIVERSITY NOTES – CS2251 DAA NOTES

Subjects : Design and Analysis of Algorithms (DAA)

Subject Code : CS2251

Department : CSE

Semester : 4th Sem

University : Anna University, Chennai

CS2251 Design and Analysis of Algorithms (DAA) Anna University Notes download

CS2251 DAA notes Unit 1 Notes download

 

CS2251 DAA notes Unit 2 Notes download

CS2251 DAA notes Unit 3 Notes download

CS2251 DAA notes Unit 4 Notes download

CS2251 DAA notes Unit 5 Notes download

 

 

Content in CS2251 DAA notes :

UNIT I

Algorithm Analysis – Time Space Tradeoff – Asymptotic Notations – Conditional

asymptotic notation – Removing condition from the conditional asymptotic notation -

Properties of big-Oh notation – Recurrence equations – Solving recurrence equations –

Analysis of linear search.

UNIT II

Divide and Conquer: General Method – Binary Search – Finding Maximum and Minimum

– Merge Sort – Greedy Algorithms: General Method – Container Loading – Knapsack

Problem.

UNIT III

Dynamic Programming: General Method – Multistage Graphs – All-Pair shortest paths –

Optimal binary search trees – 0/1 Knapsack – Travelling salesperson problem .

UNIT IV

Backtracking: General Method – 8 Queens problem – sum of subsets – graph coloring –

Hamiltonian problem – knapsack problem.

UNIT V

Graph Traversals – Connected Components – Spanning Trees – Biconnected

components – Branch and Bound: General Methods (FIFO & LC) – 0/1 Knapsack

problem – Introduction to NP-Hard and NP-Completeness.

TEXT BOOKS:

1. Ellis Horowitz, Sartaj Sahni and Sanguthevar Rajasekaran, Computer Algorithms/

C++, Second Edition, Universities Press, 2007. (For Units II to V)

2. K.S. Easwarakumar, Object Oriented Data Structures using C++, Vikas Publishing

House pvt. Ltd., 2000 (For Unit I)

REFERENCES:

1. T. H. Cormen, C. E. Leiserson, R.L.Rivest, and C. Stein, “Introduction to Algorithms”,

Second Edition, Prentice Hall of India Pvt. Ltd, 2003.

2. Alfred V. Aho, John E. Hopcroft and Jeffrey D. Ullman, “The Design and Analysis of

Computer Algorithms”, Pearson Education, 1999.

Anna University DAA notes for CSE 4th Semester.Anna University CS2251 DAA  Notes – CS2251 Design and Analysis of Algorithms Notes download. if you have any problem in downloading the material or if you want any more study materials for CS2251 kindly comment below.