Tentative F11 CS4321 Schedule

Week	Lecture Topic	Readings	Assignments
1: Aug 29	Introduction: Syllabus, Problem Types Asymptotic Notation Counting	1.1-1.4 2.1-2.2 2.3
2: Sept 5	Labor Day recess Analysis of Recursive Algorithms K-Day recess	2.4
3: Sept 12	Brute Force Sorts & String Matching Brute Force Closest Pair & Exhaustive Search Divide and Conquer Sorts	3.1 & 3.2 3.3 & 3.4 4.1 & 4.2	Assignment 1
4: Sept 19	At conference the entire week - no class
5: Sept 26	Binary Search & Tree Searches D-C Closest Pair & Convex-Hull Insertion Sort, DFS & BFS	4.3 & 4.4 4.6 5.1 & 5.2
6: Oct 3	Generating Combinatorics and Variable Size D-C Transform and Conquer: Presorting and Heaps T-C Exponentiation and Problem Reduction	5.4 & 5.6 6.1 & 6.4 6.5 & 6.6	Assignment 2
7: Oct 10	Space and Time: Boyer-Moore Algorithm Dynamic Programming Binomial Coefficients Warshall's and Floyd's Algorithms	7.2 8.1 8.2
8: Oct 17	Dynamic Programming Knapsack Problem Mid Semester Review Mid Semester Exam	8.4	Assignment 3
9: Oct 24	Exam Review Prim's Algorithm Kurskal's Algorithm	9.1 9.2
10: Oct 31	Dijkstra's Algorithm Iterative Improvements & Maximum-Flow More Maximum-Flow	9.3 10.2 10.2	Assignment 4
11: Nov 7	Matching in Bipartite Graphs Stable Marriage Complexity	10.3 10.4 11.1 & 11.2
12: Nov 14	P and NP		Assignment 5
	Thanksgiving Break
13: Nov 28	Backtracking Branch and Bound Approximation Algorithms	12.1 12.2 12.3
14: Dec 5	Project Presentations		Assignment 6
	Finals Week