It is a 1-unit class that is a part of ACE (Additional Courses for Engineers), a supplementary instruction program that includes weekly sections, office hours, and ACE-specific review sessions. It is done in addition to all the normal requirements for CS111, and is scheduled this quarter for Mon. 8:30-10:20AM in 320-109.

Explores operating system concepts including concurrency, synchronization, scheduling, processes, virtual memory, I/O, file systems, and protection. Available as a substitute for CS110 that fulfills any requirement satisfied by CS110. Prerequisite: CS107. Course Repeatable for Degree Credit? Enrollment Optional?

CS111 Practice Midterm Exam This is a closed book, closed note, closed electronic device exam, except for one double-sided US-Letter-sized (8.5"x11") page of your own prepared notes which you may refer to during the exam. You have 120 minutes to complete all …

Starting with a 48-bit virtual addresses, x86-64 uses 4 levels of page table to translate the address to a 52-bit physical address. Each page table entry is 8 bytes long. If the page size is increased, the number of levels of page table can be reduced.

What is CS111? In CS111 we are going to explore both “sides” of operating systems: •We’ll learn what functionality is exported by operating systems to make the programs that we write more powerful. •We’ll learn how the operating system provides that functionality and how it acts as an interface to the computer hardware. Operating System

Projects and notes from Computer Science 111: "Operating Systems Principles" with Dr. Paul Eggert in fall of 2019 - henrygenus/CS111

The archive for Jon Eyolfson's course content for 2021 Fall CS111.

Please visit our midterm grading and solutions page here for information about the exam solutions, statistics, how to see your score, and information about regrade requests.

See here for David's latest version of the assignment descriptions. Permission hereby granted for anyone to copy, modify, and redistribute any lecture note material from this class that belongs to the instructor (s) or Stanford.

Topics in this section include processes and threads, context switching, synchronization, scheduling, and deadlock. The second part of the course addresses the problem of memory management; it will cover topics such as linking, dynamic memory allocation, dynamic address translation, virtual memory, and demand paging.