Syllabus for UCLA Computer Science 111, Winter 2008.
Operating Systems Principles

Text

Lectures

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

You may also be interested in the Spring 2007 syllabus, which has old copies of scribe notes.

date due textbook readings lecture topics
01-07 M Introduction
01-09 W §1, §2–§2.C Abstractions and bootstrapping
01-14 M §4–§4.A.2, §5–§5.A, §5.C Modularity and virtualization
01-15 T Lab 1a
01-16 W §5.E OS organization
01-23 W WeensyOS 1 Orthogonality, processes, and races
01-25 F Lab 1b
01-28 M §5.B (except §5.B.5) Signals, scheduling, and threads
01-30 W §6.C–§6.C.3 Scheduling algorithms
02-04 M §9.A.3–§9.A.5 Consistency; critical sections
02-06 W §5.B.5, §5.F Synchronization primitives; deadlock
02-11 M Lab 2 midterm
02-13 W §6.A File system performance
02-20 W Appendix 2-A File system design
02-25 M §6.C.4 File system implementation
02-27 W Lab 3 §8.A.1, §8.B.1, §8.D.1, §9–§9.A.3, §9.B File system robustness
03-03 M §5.D, §6.B intro, §6.B.3–§6.B.9 Virtual memory
03-05 W §4.B, §4.C VM and processes; distributed systems
03-07 F WeensyOS 2
03-10 M Appendix 4-B Robustness, parallelism, and NFS
03-12 W §11–§11.H Security
03-13 R Lab 4
03-14 F 1-page report

All assignments are due at 23:59:59 on the date specified. Design problem due dates are one week after the normal lab due dates, except for the Lab 4 which are due on 03-14, the last day of instruction.

Final exam

The final exam is Monday, 2008-03-17, 15:00–18:00.


$Id: syllabus.html,v 1.26 2008/03/16 07:45:19 eggert Exp $