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