Lecture Schedule (Approximate)
Week Date Topic
1 01/17, 01/19 Time Efficiency, Asymptotic Notation
2 01/24, 01/26 Modular arithmetic, Euclid method, Primality and RSA
3 01/31, 02/02 Divide and Conquer
4 02/07, 02/09 Decompositions of Graph
5 02/14, 02/16 Paths in Graphs
6 02/21, 02/23 Exhaustive Search
7 02/28, 03/01 Midterm Exam and Review
8 03/06, 03/08 Spring Break, Relax
9 03/13, 03/15 Greedy Algorithms
10 03/20, 03/22 Greedy algorithms
11 03/27, 03/29 Dynamic Programming
12 04/03 Dynamic Programming
13 04/10, 04/12 Linear Programming
14 04/17, 04/19 Linear Programming
15 04/24, 04/26 NP-Complete Problems
16 05/01, 05/03 NP-complete problems, Course review
17 05/14 Final Exam