Schedule

Week	Link	Date	Topic	Reading and Assignments
1		T 1/27	Introduction
	Lec 01	R 1/29	Stable Matching	Chapter 1
2	Lec 02	T 2/3	Proof Review
	Lec 03	R 2/5	Algorithm Analysis	Chapter 2.1
		F 2/6		Homework 1 Due
3	Lec 04	T 2/10	Algorithm Analysis	Chapter 2.2
	Lec 05	R 2/12	Algorithm Analysis	Chapter 2.4
		F 2/13		Homework 2 Due
4	Lec 06	T 2/17	Recap
	Lec 07	R 2/19	Graphs	Chapter 3.1, 3.2
		F 2/20		Homework 3 Due
5	Lec 08	T 2/24	Graphs	Chapter 3.3
	Lec 09	R 2/26	Graphs	Chapter 3.4
		F 2/27		Quiz 1, Ind Project 1 Due
6	Lec 10	T 3/3	Greedy Algorithms	Chapter 4.1
	Lec 11	R 3/5	Greedy Algorithms	Chapter 4.2
		F 3/6		Homework 4 Due
7	Lec 12	T 3/10	Greedy Algorithms	Chapter 4.4
	Lec 13	R 3/12	Greedy Algorithms	Chapter 4.5
		F 3/13		Homework 5, Ind Project 2 Due
		T 3/17	Spring
		R 3/19	Break
8	Lec 14	T 3/24	Divide and Conquer	Chapter 5.1
	Lec 15	R 3/26	Divide and Conquer	Chapter 5.2
		F 3/27		Homework 6 Due
9	Lec 16	T 3/31	Divide and Conquer	Chapter 5.4, 5.5
	Lec 17	R 4/2	Dynamic Programming	Chapter 6.1, 6.2
		F 4/3		Quiz 2 Due
10	Lec 18	T 4/7	Dynamic Programming	Chapter 6.3, 6.4
	Lec 19	R 4/9	Dynamic Programming	Chapter 6.6
		F 4/10		Homework 7, Ind Project 3 Due
11	Lec 20	T 4/14	Network Flow	Chapter 7.1, 7.2
	Lec 21	R 4/16	Network Flow	Chapter 7.3
		F 4/17		Homework 8 Due
12	Lec 22	T 4/21	Intractability	Chapter 8.1, 8.2
	Lec 23	R 4/23	Intractability	Chapter 8.3
		F 4/24		Quiz 3, Ind Project 4 Due
13	Lec 24	T 4/28	Intractability	Chapter 8.4
		R 4/30	Group Presentations
		F 5/1		Homework 9 Due
14		T 5/5	Group Presentations