SCHEDULE FOR CPT S 223 (FALL 2010, section 01)
| Class | Day | Date | Topic | Readings (sections) |
Assignments* |
|
| Due | Posting | |||||
| 1 | M | 8/23 | Introduction | 1.1, 1.2 | ||
| 2 | W | Math review | 1.2, 1.3 | |||
| 3 | F | Math review | ||||
| 4 | M | 8/30 | Math review | |||
| 5 | W | C++ and STL review | 1.4-1.6 | HW1 | ||
| 6 | F | Data structures review (stacks, queues, lists, arrays) | 3 | |||
| --- | M | 9/6 | Labor day - no class | 2.1, 2.2, 2.3 | ||
| 7 | W | Algorithmic analysis | Program 1 | |||
| 8 | F | Algorithmic analysis | HW1 | |||
| 9 | M | 9/13 | Algorithmic analysis | |||
| 10 | W* | HW1 review (TA) | HW2 | |||
| 11 | F | Maximum subsequence sum problem | 2.4 | |||
| 12 | M | 9/20 | Maximum subsequence sum problem | 2.4 | Program 1 | Program 2 |
| 13 | W* | Program 1 review, Trees (TA) | 4.2 | |||
| 14 | F* | Trees (TA) | 4.3 | HW2 | ||
| 15 | M | 9/27 | Trees: AVL tree | |||
| 16 | W | Trees | 4.4 | HW3 | ||
| 17 | F | Trees | Program 2 | |||
| 18 | M | 10/4 | Trees | 4.7 | ||
| 19 | W | Trees: B-tree | 6.3, 6.8 | |||
| 20 | F | Trees | HW3 | |||
| 21 | M | 10/11 | Priority queues: Binary heap, Binomial heap | |||
| 22 | W | Midterm Review | ||||
| 23 | F | Midterm I | ||||
| 24 | M | 10/18 | Priority queues +Midterm discussion | Program 3 | ||
| 25 | W | Priority queues | ||||
| 26 | F | Priority queues | HW4 | |||
| 27 | M | 10/25 | Hashing | 5.1 to 5.6 | ||
| 28 | W | Hashing | ||||
| 29 | F | Hashing | Program 3 | Program 4 | ||
| 30 | M | 11/1 | Disjoint sets: Union-find | 8.1 - 8.5 | ||
| 31 | W | Disjoint sets | HW4 | HW5 | ||
| 32 | F | Sorting: Insertion sort | 7.2 | |||
| 33 | M | 11/8 | Sorting: Heap sort, Merge sort | 7.5, 7.6 | ||
| 34 | W | Sorting: Quick sort | 7.7 | |||
| 35 | F | Sorting: External sorting | 7.11 | HW5 | ||
| 36 | M | 11/15 | Homeworks review | 9.2 | Program 4 | Program 5 |
| 37 | W | Midterm Review | ||||
| 38 | F | Midterm II | 9.3 | |||
| --- | M | 11/22 | THANKSGIVING WEEK - NO CLASSES | |||
| --- | W | |||||
| --- | F | |||||
| 38 | M | 11/29 | Graphs: shortest path | HW6 | ||
| 39 | W | Graphs: minimum spanning tree | 9.4 | |||
| 40 | F | Graphs | ||||
| 41 | M | 12/6 | String data structure: Suffix tree | lecture notes | Program 5, HW6 | |
| 42 | W | Course Review | lecture notes | |||
| 43 | F | Discussion/Q&A | ||||
| --- | M | 12/13 | FINAL EXAM Thursday, December 16, 8:00-10:00am | |||
| --- | W | |||||
| --- | F | |||||