CECS 528 Lectures

1. Asymptotic Analysis
2. Recurrence Relations
3. Divide and Conquer Algorithms
4. Divide and Conquer Applications
5. Dynamic Programming Algorithms I
6. Dynamic Programming Algorithms II
7. Greedy Algorithms
8. Formal Languages and Machines
9. Complexity Theory
10. The Class of NP and NP-Complete Problems
11. Stephen Cook's Theorem