ANNA University Design And Analysis Of Algorithms
Smartxlr8 Provides the Online Notes for free for Anna University Students. Here We have Provided Anna University Notes for IT/CSE Department Students.
Syllabus :
UNIT I 9
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 9
Divide and Conquer: General Method – Binary Search – Finding Maximum and Minimum– Merge Sort – Greedy Algorithms: General Method – Container Loading – Knapsack Problem.
UNIT III 9
Dynamic Programming: General Method – Multistage Graphs – All-Pair shortest paths –Optimal binary search trees – 0/1 Knapsack – Travelling salesperson problem .
UNIT IV 9
Backtracking: General Method – 8 Queens problem – sum of subsets – graph coloring –Hamiltonian problem – knapsack problem.
UNIT V 9
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.
You Can Download The Material Of DAA From The Below Link
Syllabus :
UNIT I 9
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 9
Divide and Conquer: General Method – Binary Search – Finding Maximum and Minimum– Merge Sort – Greedy Algorithms: General Method – Container Loading – Knapsack Problem.
UNIT III 9
Dynamic Programming: General Method – Multistage Graphs – All-Pair shortest paths –Optimal binary search trees – 0/1 Knapsack – Travelling salesperson problem .
UNIT IV 9
Backtracking: General Method – 8 Queens problem – sum of subsets – graph coloring –Hamiltonian problem – knapsack problem.
UNIT V 9
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.
You Can Download The Material Of DAA From The Below Link
