The following schedule outlines the material to be covered in the semester and the assigned reading for each lecture. Chapters under "Required Reading" refer to A Book on C, by Kelley and Pohl. Chapters under "Optional Reading" refer to the optional textbook Programming Abstractions in C, by Roberts. In addition, there will be assigned readings from material which will be distributed via the course web pages.
| Date | Topic | Required Reading | Optional Reading |
|---|---|---|---|
| Tu 1/27 | Introduction | 6.1-6.6, 11.1-11.5 | 2.1-2.5, 3.4 |
| Th 1/29 | Review | 9.1-9.6, 11.17 | 2.6 |
| Tu 2/3 | Recursion | 5.14-5.15, On-line notes | 4.1-4.5 |
| Th 2/5 | Recursion | 5.1-5.2 | |
| Tu 2/10 | Merge Sort | 6.7-6.9 | 7.1-7.4 |
| Th 2/12 | Quicksort | 8.15 | 7.5-7.6 |
| Tu 2/17 | Binary Search | On-line notes | |
| Th 2/19 | More Recursion | ||
| Tu 2/24 | TBA | ||
| Th 2/26 | Exam 1 | ||
| Tu 3/3 | Pointers | 6.10-6.14, On-line notes | 2.7 |
| Th 3/5 | Pointers | ||
| Tu 3/10 | Pointers | ||
| Th 3/12 | Lists | 10.1-10.4, On-line notes | 12.1-12.3 |
| Tu 3/17 | Lists | ||
| Th 3/19 | TBA | ||
| Tu 3/24 | Spring Break | ||
| Th 3/26 | Spring Break | ||
| Tu 3/31 | Exam 2 | ||
| Th 4/2 | Stacks | 10.5, On-line notes | 8.1-8.4 |
| Tu 4/7 | Stacks | ||
| Th 4/9 | Queues | 10.7, On-line notes | 10.1-10.3 |
| Tu 4/14 | Trees | 10.8, On-line notes | 13.1-13.2 |
| Th 4/16 | Tree Traversal | 10.9 | |
| Tu 4/21 | Binary Search Trees | On-line notes | |
| Th 4/23 | Hashing | On-line notes | 11.1-11.2 |
| Tu 4/28 | Functional Parameters | 6.16-6.18, On-line notes | |
| Th 4/30 | Object-Oriented Programming | 13.1-13.11 | |
| Tu 5/5 | Object-Oriented Programming | ||
| Th 5/7 | Object-Oriented Programming | ||
| Tu 5/12 | Object-Oriented Programming | ||
| Th 5/21 | Final Exam, 10:30am - 12:30pm, LH5 |