CS 2251 DESIGN AND ANALYSIS OF ALGORITHMS Lecture Notes (DAA Notes) for CSE - Fourth (4th) Semester
CS2251 Lecture Notes
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.
Divide and Conquer: General Method – Binary Search – Finding Maximum and Minimum
– Merge Sort – Greedy Algorithms: General Method – Container Loading – Knapsack
Dynamic Programming: General Method – Multistage Graphs – All-Pair shortest paths –
Optimal binary search trees – 0/1 Knapsack – Travelling salesperson problem .
Backtracking: General Method – 8 Queens problem – sum of subsets – graph coloring –
Hamiltonian problem – knapsack problem.
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.
To Get alert, like us in facebook or subscribe us and To find what you need very easy Click G+