CS3851 -- Tentative Schedule

Week	Period	Topics	Reading	Lab
1 12/01-12/05	Lecture 1	Course Introduction		Lab 1: Searching
	Lecture 2	Algorithm Analysis	3-50
	Lecture 3	Mathematical Toolbox	51-61, 1058-1069
2 12/08-12/12	Lecture 1	Examples
	Lecture 2	Recursion and Induction Execution time	62-75
	Lecture 3	Examples
3 12/15-12/19	Lecture 1	Sorting -- Heapsort	123-144	Lab 2: Sorting
	Lecture 2	Sorting -- Quicksort	145-164
	Lecture 3	Sorting -- Misc.	165-182
Christmas Break
4 01/05-01/09	Lecture 1	Examples		Lab 2: Sorting
	Lecture 2	Order Statistics	183-195
	Lecture 3	Greedy Algorithms	370-392
5 01/12-01/16	Lecture 1	Review		Lab 3: Compressing
	Lecture 2	Midterm Exam
	Lecture 3	Graphs, BFS, DFS	525-560
6 01/19-01/23	Lecture 1	Kruskal, Prim	561-606
	Lecture 2	Dijkstra
	Lecture 3	Work on Presentation
7 01/26-01/30	Lecture 1	Graph Applications
	Lecture 2	Dynamic Programming	323-354
	Lecture 3	Work on Presentation
8 02/02-02/06	Lecture 1	NP Complete	966-983	Lab 4: Roll your own
	Lecture 2	NP Complete cont...	984-994, 1003-1018
	Lecture 3	Examples
9 02/09-02/13	Lecture 1	Examples/Review
	Lecture 2	Practice Presentation
	Lecture 3	Student Presentation
10 02/16-02/20	Lecture 1	Student Presentation
	Lecture 2	Student Presentation
	Lecture 3	Student Presentation
11 Wednesday, 2/25/2009	Final Exam 2-4pm in L104