SCHEDULE

Note: The schedule is subject to change. Check back for changes and updates

Semester Timeline
Date	Topic	Readings	Assignments	Lecture Notes
Week 1
1/7	Course Overview Interval Scheduling	CLRS 16.5		Intro Lecture
1/9	Computational Geometry Closest Pair	CLRS ch 33		Closest Pair
Week 2
1/14	Line Segment Intersection Convex Hull			Convex Hull
1/16	Problem Complexity Lower Bounds		HW 1 Due	Lower Bounds
Week 3
1/21	Lower Bounds Continued Quick Select			Lower Bounds 2
1/23	Median of Medians Dynamic Programming Overview	CLRS ch 9, 15	HW 2 Due	Median Finding
Week 4
1/28	Matrix Chain Multiplication	CLRS ch 15		Median Finding
1/30	Minimum Edit Distance	CLRS ch 15		Min Edit Distance
Week 5
2/4	Greedy Algorithm File Ordering	CLRS ch 16	HW 3 Due	Greedy Algorithms
2/6	Minimum Spanning Trees	CLRS ch 23		MST
Week 6
2/11	Midterm
2/13	Universal Hashing	CLRS ch 11		Hash Tables
Week 7
2/18	Hash Functions		HW 4 Due	Hash Functions
2/20	Amortized Analysis	CLRS ch 17		Amortized Analysis
Week 8
2/25	Dynamic Tables		Midterm Corrections HW 5 Due	Dynamic Tables
2/27	Union Find			Union Find
Week 9
3/3	P vs NP	CLRS ch 34	HW 6 Due	P vs NP
3/5	NP-Completeness			Vertex Cover Subset Sum
Week 10
3/10	Approximation Algorithms		HW 7 Due	VC Approx TSP Approx
3/12	Fast Fourier Transformation		Project Due(3/13)	FFT
Finals Week
3/17	Final Exam 17:30 - 19:20