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