Note that the following schedule is tentative. It will be updated as we go.
# | Date | Topic | Note | Deadline |
---|---|---|---|---|
1 | T 9/2 | Course overview | 00 | |
2 | R 9/4 | Compiling & linking | 01 | |
3 | T 9/9 | Makefile | HW1 | |
4 | R 9/11 | Binary number; Data types | 02 | |
5 | T 9/16 | Expressions & statements | ||
6 | R 9/18 | Automatic v. static variables; Process address space | ||
7 | T 9/23 | Recursion; Selection sort | 03, HW2 | W 9/24: HW1 due |
8 | R 9/25 | Merge sort; HW2 code walk-through | ||
9 | T 9/30 | Pointers & arrays | 04 | |
10 | R 10/2 | Pointers & arrays | Su 10/5: HW2 due | |
11 | T 10/7 | Heap allocation; Pointer to pointer; Struct | ||
12 | R 10/9 | Function pointer; Linked list I | 05, HW3 | |
13 | T 10/14 | Midterm exam | ||
14 | R 10/16 | Linked list II | 06 | |
15 | T 10/21 | Linked list II; Big-O notation | ||
16 | R 10/23 | I/O | 07 | |
17 | T 10/28 | Introduction to C++ | 08 | |
18 | R 10/30 | MyString class I | 09, HW4 | R 10/30: HW3 due |
T 11/4 | No class - Election day | |||
19 | R 11/6 | MyString class II | HW5 | |
20 | T 11/11 | Binary Search Tree I | 10 | |
21 | R 11/13 | Binary Search Tree II | 11 | Su 11/16: HW4 due |
22 | T 11/18 | Templates and STL I | 12 | |
23 | R 11/20 | Templates and STL II | ||
24 | T 11/25 | Graph I: data structure | 13 | |
R 11/27 | No class - Thanksgiving day | M 12/1: HW5 due | ||
25 | T 12/2 | Graph II: DFS & BFS | HW6 | |
26 | R 12/4 | Course wrap-up & review | T 12/9: HW6 due | |
R 12/18 | Final exam: 4:10–7pm, Thursday, Dec 18, 309 Havemeyer |