Syllabus for UCLA Computer Science 33, Fall 2017.
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
09-28 R 1. Introduction
10-03 T §1–§2.3, §2.5 2. Integers
10-05 R §3–§3.5 3. Machine-level programming basics
10-06 F HW #1
10-10 T §3.6 4. Control
10-12 R Data Lab (CCLE) §3.7 5. Procedures
10-17 T §3.8–§3.9 6. Data structures
10-19 R HW #2 §3.10, §3.12 7. Pointer problems
10-24 T (midterm 1, in lecture)
10-26 R HW #3 §2.4, §3.11 8. Floating point
10-31 T Pexex Lab §5–§5.6, §5.13–§5.15 9. Program optimization
11-02 R §5.7–5.12 10. Instruction-level parallelism
11-07 T §6 11. The memory hierarchy
11-09 R HW #4 §12–§12.4 12. Thread-level parallelism
11-14 T 13. Catching up
11-16 R (midterm 2, in lecture)
11-21 T Smashing Lab §12.5–12.8 13. Synchronization
11-28 T HW #5 §10 14. I/O
11-30 R §9 15. Virtual memory
12-05 T §7 16. Linking
12-07 R OpenMP Lab §8, Appendix A 17. Exceptions and errors
12-08 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.


© 2015–2017 Paul Eggert. See copying rules.
$Id: syllabus.html,v 1.18 2017/11/18 03:05:31 eggert Exp $