CS111: nail every assessment, not just read the notes
Your complete guide to University of California, Los Angeles's operating systems principles course. See where the marks are, work real practice questions, and study with an AI tutor that knows CS111.
Sia generates CS111 practice questions, walks through abstractions and processes step by step, and quizzes you on the material the heaviest assessments weight most heavily.
Worked example
Three CPU-bound jobs arrive at time 0 with run times 8, 4 and 2 ms. Under shortest-job-first scheduling, what is the average turnaround time?
SJF runs the 2 ms job first (finishes at 2), then the 4 ms job (finishes at 6), then the 8 ms job (finishes at 14).
First-come first-served in the order 8, 4, 2 gives (8 + 12 + 14) / 3 = 11.33 ms; SJF minimises average turnaround when all jobs arrive together.
Option D is the average run time, not turnaround; option C is the makespan.
The trap: Confusing turnaround (arrival to completion) with run time or with the total time to finish every job. classic slip!
One exam decides 35% of your grade. No written make-ups. This whole page is built around that.
Overview
What CS111 is, and where it sits
CS 111 Operating Systems Principles is UCLA's upper-division operating systems course. The offering documented here is Spring 2026, taught by Paul Eggert with three lab-section teaching assistants and a team of learning assistants, from a public course site that publishes the lecture schedule, readings and grading.
Eighteen lectures run from abstractions and bootstrapping, modularity and virtualisation and OS organisation, through processes, races, signals, scheduling and threads, consistency, synchronisation and deadlock, then file-system performance, design, implementation and robustness, virtual memory, distributed systems, robustness and NFS, and finally security, authentication and authorisation. Readings come from Operating Systems: Three Easy Pieces, Saltzer and Kaashoek's Principles of Computer System Design and Mark Kampe's notes.
The grade is 3% Lab 0, 32% Labs 1-4, 3% a short report, 1% class participation, 0.5% feedback surveys, 0.5% course evaluations, 25% an in-class midterm in week 5 and 35% a three-hour final. Exams are open book and notes with no automated devices.
Always treat your own course outline and the exam timetable as authoritative.
Difficulty & time commitment
Is CS111 hard, and how much time does it take?
CS111 is manageable if you keep a weekly rhythm and treat the back half as the main event. The pattern is consistent: it starts gently and steepens, and the heaviest assessment is the part that separates grades.
The difficulty curve and the assessment weighting point the same way: the back half is harder and worth more. Front-loading effort there is the highest-return decision in the course.
Is this course for you
Who tends to do well, and who tends to struggle
You will likely do well if
- You are comfortable in C and on the command line from CS 33 and 35L.
- You do the assigned readings before lecture; the exams draw on them.
- You start labs the week they are released; the penalty compounds.
- You like reasoning about why a system design fails under load or faults.
You may struggle if
- You expect memorisation to work; the exams are open book.
- You leave labs to the last day; three days late costs 27%.
- You skip the readings and rely on lecture alone.
- You cannot attend the week-5 midterm; no written make-ups are given.
- For each lecture, write one paragraph on the trade-off it introduced and what would break if you chose otherwise.
- Build a personal index of your notes for the open-book exams; searching a pile of paper wastes exam time.
- For each lab, keep a log of what you tried and why; the report and the exams reward that reasoning.
- Answer questions on the class Q&A site; endorsed answers are the only route to the participation percent.
Syllabus
The 9 topics, lecture block by lecture block
The exam-weight marker on each topic shows where the marks concentrate. The amber topics carry the highest exam weight.
T1 · Abstractions, bootstrapping and OS organisation
Lectures 1-4Interface standards, modularity, virtualisation, kernel structure.
T2 · Processes, races and threads
Lectures 5-6Orthogonality, IPC, signals, user-mode threads.
T3 · Scheduling
Lecture 7Scheduling algorithms and real-time scheduling.
T4 · Synchronisation and deadlock
Lectures 8-9Consistency, critical sections, locks, deadlock avoidance.
T5 · File-system performance and design
Lectures 10-11Caching, layout, the design space.
T6 · File-system implementation and robustness
Lectures 12-13FAT, inodes, journaling, failure models, atomicity.
T7 · Virtual memory and processes
Lectures 14-15Paging, page replacement, VM and process creation.
T8 · Distributed systems, robustness and NFS
Lectures 15-16RPC, health monitoring, parallelism, network file systems.
T9 · Security
Lectures 17-18Authentication, confidentiality, authorisation, protocols.
How it's assessed
Assessment structure
| Component | Weight | Format & timing |
|---|---|---|
| Lab 0 | 3% | Introductory lab on the course tools. Week 2. 3^N% penalty for N full days late. |
| Labs 1-4 (evenly weighted) | 32% | Four substantial labs on processes, scheduling, file systems and virtual memory, published on Bruin Learn. Weeks 4, 5, 8 and 10. Same late rule; nothing after last day of instruction. |
| Report on current OS topics | 3% | Short written report on a current operating-systems topic set late in the quarter. Week 10. Same late rule. |
| Participation, feedback surveys and course evaluations | 2% | Instructor-endorsed answers on the class Q&A site (0.1% each, capped at 1%), two learning-assistant feedback surveys (0.5%) and course evaluations (0.5%). Through the quarter. Completion and endorsement credit. |
| Midterm (in class, week 5) | 25% | In-class, open book and open notes, no automated devices. Wednesday of week 5. No written make-ups. |
| Final exam (3 hours, registrar time) | 35% | Three hours, open book and open notes, no automated devices. Registrar's finals slot. No written make-ups. |
- The seven components sum to 100 and there is no separate hurdle. Assignments lose 3^N% for N full days late and are not accepted after the last day of instruction. Class participation is earned only through instructor-endorsed answers, 0.1% each up to 1%.
- An in-class midterm on Wednesday of week 5 (25%) covering lectures 1-9, and a three-hour final (35%) at the registrar's slot covering the whole course. Both are open book and open notes but no laptops or devices; no written make-ups are given.
This is a coursework course. Coursework carries 65% of the grade and the final exam (3 hours, registrar time) is the single heaviest piece at 35%, so steady work across the semester decides your result more than any one sitting. No written make-ups.
Final exam timing: During the examination period. Confirm the exact date and venue on your exam timetable.
How to actually pass it
A weekly rhythm, two checklists, and the traps to avoid
The course rewards consistency over cramming, and practice over re-reading. Here is the loop that works, then what to have nailed before each exam.
The weekly loop
Before the mid-semester checklist
- Explain modularity, virtualisation and why kernels are organised as they are.
- Describe process creation, signals, threads and race conditions.
- Compare scheduling algorithms and compute turnaround and wait times.
- Reason about critical sections, locks and deadlock avoidance.
Before the final heaviest topics
- Compare file-system layouts and explain journaling and atomicity.
- Compute page-table sizes and explain page replacement.
- Explain RPC semantics and NFS consistency.
- Describe authentication, authorisation and a protocol failure.
The mistakes that cost marks
Treating open-book as easy. Questions ask why, not what; unprepared notes do not help under time pressure.
Lab submitted a day late. Even one day costs 1%, and the penalty then triples each day.
Ignoring Saltzer and Kaashoek. Atomicity and protection chapters are assigned and examined.
Teaching team
Who teaches CS111
The bios below are factual. We do not rate lecturers; any star ratings are submitted by students who have taken CS111.
Teaching team as listed in the course materials reviewed. AskSia does not rate lecturers; star ratings are submitted by students who have taken CS111.
Formula & concept sheet
The vocabulary and formulas you must own
- Abstraction
- An interface that hides implementation detail.
- Process
- A running program with its own address space.
- Thread
- A schedulable flow of control within a process.
- Race condition
- Behaviour that depends on the timing of concurrent operations.
- Critical section
- Code that must not be executed concurrently.
- Deadlock
- A cycle of processes each waiting for another's resource.
- Inode
- The on-disk structure describing a file.
- Journaling
- Logging changes before applying them for crash recovery.
- Page table
- The mapping from virtual pages to physical frames.
- RPC
- Remote procedure call: invoking a procedure on another machine.
Set texts
The prescribed reading
The syllabus references map straight onto these.
Operating Systems: Three Easy Pieces
.
Where it fits
Prerequisites, related courses & why it matters
Prerequisites: CS 32, 33 and 35L. 4 units; lecture 4 hours, laboratory 2 hours, outside study 9 hours per week.
Your CS111 study toolkit
Study the course with Sia, not just read about it
Each tool already knows CS111: your syllabus, your texts, and where the marks are. Grouped by how you study, from first contact to exam week.
FAQ
Frequently asked questions
Is CS 111 hard?
Moderately hard on the six-factor rubric: dense reading, four real-system labs, nine outside-study hours a week, and 60% in two open-book exams that test reasoning.
What is the assessment breakdown?
Lab 0 3%, Labs 1-4 32%, report 3%, participation 1%, feedback surveys 0.5%, course evaluations 0.5%, midterm 25%, final 35%, per the Spring 2026 grading page; this guide shows the three small items as one 2% row.
Who teaches it?
Paul Eggert in Spring 2026, with lab teaching assistants Jui-Nan Yen, Ramnath Kumar and Zeckria Kamrany.
Are the exams open book?
Yes, open book and open notes, but no automated devices such as laptops.
What are the texts?
Operating Systems: Three Easy Pieces (free PDF), Saltzer and Kaashoek's Principles of Computer System Design (free e-book on campus), and Mark Kampe's readings.
How does the late penalty work?
3 to the power N percent for N full days late: 1% up to a day, 3% for one to two days, 9% for two to three days, and so on.
Study CS111 with Sia
Work through abstractions, processes, scheduling and the rest of the course with a tutor that knows it and quizzes you on the topics the assessments weight most heavily.
Start studying with Sia
