A syllabus being a plan rather than a record of events, the actual topics covered during each lecture are available on a separate Lecture Topics page. The links off the Lecture Topics page also contains an expanded topics list and source code for programs shown during lecture.
| Date | Topic | M&H Reading | Neveln Reading | Assign | Due |
|---|---|---|---|---|---|
| Th 08/30 | Introduction & Overview | 1.1-1.8 | 1.1-1.6 | ||
| Tu 09/04 | Data Representation I | 2.1-2.2 | 2.4-2.7 | HW1 | |
| Th 09/06 | Data Representation II | 2.3.1-3, 2.5 | |||
| Tu 09/11 | Arithmetic I | 3.1-3.2 | 3.6-3.7 | HW2 | HW1 |
| Th 09/13 | Arithmetic II | 3.3-3.4 | |||
| Tu 09/18 | Intel x86 Registers | 4.1, 4.4 | 3.10-3.13 | Proj 0 | HW2 |
| Th 09/20 | i386 Instruction Overview | ||||
| Tu 09/25 | Comparison & Branching | 4.1-4.8 | Proj1 | Proj0 | |
| Th 09/27 | Machine Language | 5.1-5.7 | |||
| Tu 10/02 | Addressing Modes | 6.1-6.5 | |||
| Th 10/04 | Case Study: the PDP-8 | ||||
| Tu 10/09 | The Stack & C Functions | 7.1-7.4 | Proj2 | Proj1 | |
| Th 10/11 | Linux Memory Model | 8.1-8.8 | |||
| Tu 10/16 | Interrupts | 9.1-9.8 | |||
| Th 10/18 | Compiling, Assembling & Linking | 5.1-5.3 | |||
| Tu 10/23 | Review | Proj2 | |||
| Th 10/25 | Midterm Exam | ||||
| Tu 10/30 | Introduction to Digital Logic | A.1-A.9 | Proj3 | ||
| Th 11/01 | Combinational Logic Components | A.10 | |||
| Tu 11/06 | High Performance Arithmetic | 3.5 | |||
| Th 11/08 | Sequential Logic I | A.11 | |||
| Tu 11/13 | Sequential Logic II | HW3 | Proj3 | ||
| Th 11/15 | Finite State Machines | A.12-A.13 | |||
| Tu 11/20 | Registers & Counters | A.14-A.15 | HW3 | ||
| Th 11/22 | Thanksgiving | ||||
| Tu 11/27 | Circuit Simplification I | B.1-B.2 | HW4 | ||
| Th 11/29 | Circuit Simplification II | ||||
| Tu 12/04 | I/O & Bus Architectures | 8.1-8.4 | HW5 | HW4 | |
| Th 12/06 | Mass Storage & Input Devices | 8.5-8.6 | |||
| Tu 12/11 | Review | HW5 | |||
| Tu 12/18 | Final Exam 10:30am-12:30pm | ||||
to Fall 2001 CMSC 313 Section Homepage