Syllabus for UCLA Computer Science 33, Fall 2018.
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.

date due readings lecture topics
01-07 T 1. Introduction
01-09 R §1–§2.3, §2.5 2. Integers
01-14 T §3–§3.5 3. Machine-level programming basics
01-15 W HW #1
01-16 R §3.6 4. Control
01-21 T Data Lab (CCLE) §3.7 5. Procedures
01-23 R §3.8–§3.9 6. Data structures
01-28 T HW #2 §3.10, §3.12 7. Pointer problems
01-30 R (midterm 1, in lecture)
02-04 T HW #3 §2.4, §3.11 8. Floating point
02-06 R Pexex Lab §5–§5.6, §5.13–§5.15 9. Program optimization
02-11 T §5.7–5.12 10. Instruction-level parallelism
02-13 R HW #4 §6 11. The memory hierarchy
02-18 T §12–§12.4 12. Thread-level parallelism
02-20 R Smashing Lab 13. Catching up
02-25 T (midterm 2, in lecture)
02-27 R §12.5–12.8 13. Synchronization
03-03 T §10 14. I/O
03-05 R HW #5 §9 15. Virtual memory
03-10 T §7 16. Linking
03-12 R OpenMP Lab §8, Appendix A 17. Exceptions and errors
03-13 F (No late submissions are accepted after the last day of instruction.)

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.