CSCI 235, Analysis of Algorithms, Fall 2007
Home | | Syllabus | | Assignments | | Lecture Notes
This schedule will give you an idea of the order of topics and chapters that will be covered. It may change during the semester depending on how quickly we cover the various topics.
Week Dates Chapter Topic
1 8/29-8/31 1,2 Introduction, Asymptotic analysis
2 9/3-9/7 2,3 Asymptotic analysis, Functions
3 9/10-9/14 4 Recurrences
4 9/17-9/21 5 Probability, Elementary Sorts
5 9/24-9/28 6 Elementary Sorts, Heap Sort
6 10/1-10/5 7, 8 Quick Sort, Linear Sort
7 10/8 NO CLASS. COLUMBUS DAY
10/10-10/12 9 Order Statistics
8 10/15 Review/catchup
10/17 MIDTERM EXAM (4:00 - 6:00 p.m.)
10/19 Binary Search Trees
9 10/22-10/26 Red-Black Trees
10 10/29-11/2 15 Dynamic Programming
11 11/5-11/9 16 Greedy Algorithms
12 11/12-11/16 22 Graph Algorithms
13 11/19 22 Graph Algorithms II
11/21-11/23 THANKSGIVING BREAK -- NO CLASS
14 11/26-11/30 34 Computational Complexity
15 12/3 Review/Catchup
Final Exam: Saturday, December 15, 8:30 a.m.
Home | | Syllabus | | Assignments | | Lecture Notes
Constance Royden--croyden@mathcs.holycross.edu
Computer Science 235--Analysis of Algorithms
Date Created: August 26, 2005
Last Modified: August 24, 2007
Page Expires: August 24, 2008