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/29 | Introduction & Overview | 1.1-1.8 | 1.1-1.6 | ||
Tu 09/03 | Data Representation I | 2.1-2.2, 3.1-3.3 | 2.4-2.7, 3.6-3.8 | HW1 | |
Th 09/05 | Data Representation II | ||||
Tu 09/10 | i386 Assembly Language I | 3.10-3.13, 4.1-4.8 | HW2 | HW1 | |
Th 09/12 | i386 Assembly Language II | 6.1-6.5 | Proj1 | ||
Tu 09/17 | i386 Assembly Language III | HW2 | |||
Th 09/19 | Examples I | Proj2 | Proj1 | ||
Tu 09/24 | Machine Language | 5.1-5.7 | |||
Th 09/26 | Compiling, Assembling & Linking | 5.1-5.3 | Proj3 | Proj2 | |
Tu 10/01 | Subroutines | 7.1-7.4 | |||
Th 10/03 | The Stack & C Functions | ||||
Tu 10/08 | Examples II | ||||
Th 10/10 | Linux Memory Model | 7.7 | 8.1-8.8 | Proj4 | Proj3 |
Tu 10/15 | Interrupts & System Calls | 9.1-9.8 | |||
Th 10/17 | TBA | Proj4 | |||
Tu 10/22 | Midterm Exam | ||||
Th 10/24 | Introduction to Digital Logic | A.1-A.2 | 3.1-3.3 | DigSim1 | |
Tu 10/29 | Transistors & Logic Gates | A.3-A.4 | |||
Th 10/31 | Boolean Functions & Truth Tables | A.5-A.9 | HW3 | DigSim1 | |
Tu 11/05 | Circuits for Addition | 3.5 | |||
Th 11/07 | Combinational Logic Components | A.10 | HW4 | HW3 | |
Tu 11/12 | Flip Flops | A.11 | |||
Th 11/14 | Finite State Machines | A.12-A.15 | DigSim2 | HW4 | |
Tu 11/19 | Circuit Simplification I | B.1-B.2 | |||
Th 11/21 | Circuit Simplification II | B.3 | HW5 | DigSim2 | |
Tu 11/26 | Finite State Machine Design | ||||
Th 11/28 | Thanksgiving break | ||||
Tu 12/03 | More Finite State Machine Design | DigSim3 | HW5 | ||
Th 12/05 | I/O & Memory | 7.1-7.6, 8.1-8.3 | |||
Tu 12/10 | TBA | DigSim3 | |||
Th 12/12 | Final Exam 10:30am-12:30pm |