Algorithms
- Algorithm Analysis and Notations: Algorithm Analysis, Time Space Tradeoff, Asymptotic Notations, Conditional asymptotic notation, Removing condition from the conditional asymptotic notation, Properties of big-Oh notation.
- Recurrences and Divide & Conquer: Recurrence equations, Solving recurrence equations, Analysis of linear search; Divide and Conquer: General Method, Binary Search, Finding Maximum and Minimum, Merge Sort.
- Dynamic Programming: General Method, Multistage Graphs, All-Pair shortest paths, Optimal binary search trees.
- Backtracking: General Method, 8-Queens problem, Hamiltonian problem.
- Graphs and Complexity Classes: Connected Components, Spanning Trees, Biconnected components; Complexity: Introduction to NP Hard and NP-Completeness.