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 | W 9/4 NOON: HW0 Part A due |
2 | R 9/5 | Compiling & linking; Makefile | 01 | R 9/5: HW0 Part B due |
3 | T 9/10 | Makefile; Binary number; Data types | 02, HW1 | |
4 | R 9/12 | Binary number; Data types; Expressions & statements | ||
5 | T 9/17 | Automatic v. static variables; Process address space | ||
6 | R 9/19 | Recursion; Selection sort | 03, HW2 | F 9/20: lab1 due |
7 | T 9/24 | Merge sort; HW2 code walk-through | ||
8 | R 9/26 | Pointers & arrays | 04 | |
9 | T 10/1 | Pointers & arrays | ||
10 | R 10/3 | Heap allocation; Pointer to pointer; Struct | HW3 | Sa 10/5: lab2 due |
11 | T 10/8 | Function pointer; Linked list I | 05 | |
12 | R 10/10 | Linked list II | 06 | |
13 | T 10/15 | Linked list II; Big-O notation | ||
14 | R 10/17 | I/O | 07, HW4 | |
15 | T 10/22 | Midterm Exam | ||
16 | R 10/24 | Introduction to C++ | 08 | Sa 10/26: lab3 due |
17 | T 10/29 | MyString class I | 09, HW5 | |
18 | R 10/31 | MyString class II | ||
T 11/5 | No Class | |||
19 | R 11/7 | Binary Search Tree I | ||
20 | T 11/12 | Binary Search Tree II | 10 | |
21 | R 11/14 | Templates and STL I | 11 | W 11/13: lab4 due |
22 | T 11/19 | Templates and STL II | 12, HW6 | |
23 | R 11/21 | Graph I: data structure | ||
24 | T 11/26 | Graph II: DFS & BFS | 13 | |
25 | R 11/28 | Thanksgiving | ||
26 | T 12/3 | TBD | Sa 12/7: lab5 due | |
27 | R 12/5 | Course wrap-up & review | Sa 12/14: lab6 due | |
TBD | Final exam: TBD |