CS 2251 DESIGN AND ANALYSIS OF ALGORITHMS Lecture Notes (DAA Notes) for CSE - Fourth (4th) Semester - by R.Anirudhan

CS 2251 DESIGN AND ANALYSIS OF ALGORITHMS Lecture Notes (DAA Notes) for CSE - Fourth (4th) Semester


CS2251 Lecture Notes

Syllabus :


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.



download Design and Analysis of Algorithms Lecture Notes -1 

download Design and Analysis of Algorithms Lecture Notes -2  

download Design and Analysis of Algorithms Lecture Notes -3  

download Design and Analysis of Algorithms Lecture Notes -4  

download Design and Analysis of Algorithms Lecture Notes -5 










To Get alert, like us in facebook or subscribe us and To find what you need very easy Click G+
Previous
Next Post »