Tentative Schedule

date	subject			topics			reading	deadlines
----	-------			------			-------	---------

1/23	Preliminaries	Analyzing algorithms		1-32	
1/25 	"		Asymptotic notation		32-37	HW1 OUT

1/30	"		Recurrence relations		53-64
2/1	Sorting		Heapsort			140-150

2/6 	"		Quicksort			153-167	HW1 IN/HW2 OUT
2/8 	"		Linear Sorting			172-182

2/13	Searching	Data structures			200-215	PROJECTS OUT
2/15			Binary search trees		244-245

2/20	"		Red-Black trees: insertion	262-272
2/22	"		Red-Black trees: deletion	272-277	HW2 IN

2/27	MIDTERM 1
2/29	Comb. Search	Backtracking				HW3 OUT

3/5	"		Elements of dynamic programming	301-314
3/7	"		Examples of dynamic programming	314-323

3/12 	Graph Algorithm Data structures for graphs	465-477	
3/14			Breadth/depth-first search	477-483	GRAD PROPOSALS

3/19	"		Topological Sort/Connectivity	485-493	HW3 IN/HW4 OUT
3/22	"		Minimum Spanning Trees		498-510

3/26	"		Single-source shortest paths	514-532		
3/28	MIDTERM 2

4/1-5	Spring Break	

4/9	"		All-pairs shortest paths	550-563	HW4 IN
4/11	Randomized Algorithms

4/16	Intractability	P and NP			916-928 HW5 OUT
4/18	"		NP-completeness			929-939

4/23	"		NP-completeness proofs		939-951
4/25	"		Further reductions		951-960

4/30	"		Approximiation algorithms	964-983		
5/1	Graduate Student Project Presentations  	five minute talks
5/2	Semester Review					HW5 IN

5/10	FINAL EXAM, 8:30-11:30AM