Syllabus for UCLA Computer Science 33, Fall 2016.
Introduction to Computer Organization

[33 home]

Text

Schedule

This schedule is tentative and most likely will be revised. Among other things, the assignments are not yet cast in stone. More assignments may be added.

In the readings column, ordinary section numbers apply to both 3/E and 2/E, underlined section numbers apply to just 3/E, and strikethrough section numbers apply to just 2/E.

date due readings lecture topics
09-26 M 1. Introduction
09-28 W §1–§2.3, §2.5 2. Integers
09-30 F HW #1
10-03 M §3–§3.5, §3.13 3. Machine-level programming basics
10-05 W §3.6 4. Control
10-07 F Data Lab
10-10 M §3.7 5. Procedures
10-12 W §3.8–§3.9 6. Data structures
10-14 F HW #2
10-17 M §3.10, §3.11, §3.12, §3.15 7. Pointer problems
10-19 W (midterm 1, in lecture)
10-24 M HW #3 §2.4, §3.11, §3.14 8. Floating point
10-26 W Pexex Lab §5–§5.6, §5.13–§5.15 9. Program optimization
10-31 M §5.7–5.12 10. Instruction-level parallelism
11-02 W §6 11. The memory hierarchy
11-04 F HW #4
11-07 M §12–§12.4 12. Thread-level parallelism
11-09 W (midterm 2, in lecture)
11-10 R Smashing Lab
11-14 M §12.5–12.8 13. Synchronization
11-16 W §10 14. I/O
11-21 M HW #5 §9 15. Virtual memory
11-23 W §7 16. Linking
11-28 M §8, Appendix A 17. Exceptions and errors
11-30 W Blem et al. "ISA Wars" 18. Other architectures
12-01 R OpenMP Lab

The following textbook chapters are useful and entertaining but are not part of this course: §4, §11.

All assignments are due at 23:55 on the date specified.

Final exam

The final exam is three hours and will be held at the time scheduled by the registrar.


© 2015, 2016 Paul Eggert. See copying rules.
$Id: syllabus.html,v 1.11 2016/11/23 01:25:11 eggert Exp $