CSC 222 Schedule: Fall 2006

*This is a tentative ordering and subject to change as the semester progresses.
Reading quizzes are due the night before the lecture they are written next to.
Problem sets are due at the start of the class they are written next to.

DateTopicPre-ReadingAssignment
August 23Intro, Syllabus, 221 Survey
August 25Basics of Algorithmic AnalysisLevitin 42-50RQ
August 28Common Analyses of Algorithms
August 30Average & Amortized Efficiency, Formal AnalysisLevitin 52-59RQ
September 1Formal Analysis, 221 Topic ReviewPS 1 Due
September 4Homework Review, In Class ExerciseLevitin 61-66,69-76RQ
September 6Analyzing Non-Recursive Algorithms
September 8Analyzing Recursive AlgorithmsPS 2 Due
September 11Recursive Algorithms
September 13Homework Review
September 15Recursive AlgorithmsPS3 Due
September 18Homework Review, Recursive Algorithms
September 20Test Review, Lower Bound Arguments?
September 22Test 1
September 25Lower Bound ArgumentsLevitin 386-392RQ
End of SeptemberLower Bound Arguments, Test Review
October 4thAdversary Arguments, HW Review
October 6thIntroduction to Complexity ClassesLevitin 393-397RQ
............
September 27Last Day To Drop
October 13Fall Break - No Class
October 27Test 2
November 22Thanksgiving Break - No Class
November 24Thanksgiving Break - No Class
December 5Final Exam (9:00am)