| Assignments | due at the beginning of the lecture on the due date | ||
| 20% | |||
| 20% | |||
| Exams | no make-ups or substitutions | ||
| 20% | |||
| 40% |
Supplemental Reading:
| Week of | Chapter | Description |
| September 27 | S&G 1-3 | Algorithmic foundations: problem solving, algorithms, computation |
| October 4 | S&G 2-3 | Algorithms: correctness and efficiency |
| October 11 | S&G 3 | Algorithms: complexity |
| October 18 | L&L 13, S&G 3 | Algorithms: sorting and searching |
| October 25 | L&L 12 | Algorithms: recursion. Midterm: October 29 |
| November 1 | S&G 4-5, L&L 1 | Hardware world: logic, gates and circuits. |
| November 8 | S&G 5 | Computer system organization |
| November 15 | S&G 6 | Virtual machines: assembly language, operating systems |
| November 22 | S&G 7-9 | High-level languages; translation |
| November 29 | S&G 10 | Theoretical models of computation |
| December 7 | S&G 1-10 | Final Exam, Tuesday, 15:15, 16 Pacific |