SCHEDULE

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

Semester Timeline
Date	Topic	Readings	Assignments	Notes
Week 1
9/30	Course Overview Algorithm analysis framework	Chapter 1		Intro Lecture
10/2	Asymptotic Analysis	2.1, 2.2		Asymptotic Analysis
Week 2
10/7	Summation Review Analyzing Iterative Algorithms	2.3		Iterative Algorithms
10/9	Recurrence Relations Analyzing Recursive Algorithms	2.4	HW1 Due	Recursive Algorithms
Week 3
10/14	Selection Sort Insertion Sort Merge Sort	3.1, 4.1, 5.1		Sorting
10/16	QuickSort Lower Bound of Comparison Sort	5.2, 11.1, 11.2	HW2 Due	QuickSort
Week 4
10/21	Heaps Heapsort	6.4		Heaps
10/23	Linear Time Sorting	7.1		Linear Sorting
Week 5
10/28	Graphs DFS, BFS	3.5	HW3 Due	Graphs
10/30	Midterm			Practice Midterm
Week 6
11/4	Closest Pair	3.3, 5.5		Closest Pair
11/6	Convex Hull		HW4 Due	Convex Hull
Week 7
11/11	Campus Closed
11/13	Dynamic Programming	8.1	HW5 Due	Dynamic Programming
Week 8
11/18	0/1 Knapsack Problem	3.4, 8.2		0/1 Knapsack
11/20	Greedy Algorithms MST	9.1		Greedy Algorithms
Week 9
11/25	Approximation Algorithms		HW6 Due	Vertex Cover P vs NP
11/27	Class Cancelled
Week 10
12/2	P vs NP Vertex Cover	11.3	HW7 Due	Vertex Cover Reduction
12/4	Super Mario TSP Approximation			Super Mario TSP Approximation
Finals Week
12/9 08:00	FINAL EXAM			Practice Final Part 1 Practice Final Part 2