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