||UNIVERSITY OF WISCONSIN
Computer Sciences Department
||CS 537: Introduction to Operating Systems
Office: 7363 CS
The course is organized around my lecture notes.
are available on the class Web page.
We will use the free and online textbook
Systems: Three Easy Pieces
by our very own Remzi and Andrea Arpaci-Dusseau.
Other books, such as Silberschatz, Galvin, and Gagne's
Operating Systems Concepts
or Andrew Tannenbaum's Modern Operating Systems, are also useful though
For the programming
assignments this semester, we will use the C programming language.
I am not requiring a specific book for C.
If you have a book already and are happy with it, you probably do not
need to buy a new book.
If you do not have a book, I would recommend the
C Programming Language
by Kernighan and Ritchie.
My lecture notes are available now.
You should read the first section before coming to class.
||Shebin Roy Yesudas
The sections will be used mainly to
discuss important details of the programming assignments.
It is also a good place to ask questions about the challenge problems, in preparation for
Make sure that you leave room in your schedule to attend your scheduled section.
For the first two weeks of class,
you must attend
the discussion section for which you registered;
you cannot attend one of the other discussion sections.
If we have sufficient space in the rooms, we'll allow you to shift around.
The testing in the class will be based on weekley quizzes that will occur most weeks.
The class schedule has the list of quizzes (though that will be updated as the semester
In general, quizzes will happen in class on Thursdays and last 10-20 minutes.
There will be no midterm and the final is optional.
If you choose to take the final, it will be averaged into your semester's grade, as
You will need to sign up for the final during the last week of classes, if you
wish to take it.
Below are the past quizzes with answers.
You can also see the
statistics for each quiz.
Quiz 9 (version 1),
Quiz 4 (version 2),
Quiz 4 (version 1),
Quiz 3 (version 2),
Quiz 3 (version 1),
Quiz 2 (version 2),
Quiz 2 (version 1),
There will be five (possibly six) programming assignments during the semester.
Details on these assignments will appear linked to the class home page and you'll get
an announcement via email and Canvas when they are available.
These assignments will be written in C and done on workstations running
It is unlikely that you will be able to do all these assignments on your
personal computer unless you have loaded a recent version of Linux.
Assignments will be done in teams of two (2).
You do not need to keep the same teammate for each assignment.
You can see the
statistics for each program.
Safe Malloc/Free Library:
The goal of this assignment is to think more about memory safety and how you
might insure that a program behaves well.
You will also get a bit of insight into how tools like valgrind work.
Due Monday, December 4th at 5pm.
The goal of this assignment is to get (more) experience with a tool that
helps check for problems using dynamic memory allocation and pointers.
Due Wednesday, November 13th at 5pm.
The goals of this assignment is to learn about about how to start new programs
running on UNIX-type operating systems, and learn about how make works.
Due Wednesday, November 7th at 5pm.
Synchronizing with Threads and Shared Memory:
The goal of this assignment is to practice what we learned about in lecture
and quizzes using threads and synchronization.
Due Friday, October 19th at 5pm.
Clang Static Analyzer:
The goal of this assignment is to learn to use code scanning tools to help find
problems in your program.
Due Wednesday, October 3rd at 5pm.
The goal of this assignment is to practice using C, learn about system
and try to write a program that implements an interesting and important
Linux utility, ps.
Due Wednesday, September 26th, 5pm.
Most weeks, I will post one or two challenge problems,
based on the lectures.
These problem are for your use and do not need to be turned in.
However, you will find that you will do poorly on the weekly quizzes,
don't do the problems
Solution for the problems will be discussed in section before the quiz.
And the TA's and I will be happy to answer your questions about these problems and
look over your solutions.
Challenge Problem #10
This is a collection of questions to better understand file systems.
Challenge Problem #9
This is a collection of questions to better understand page replacement algorithms and
Challenge Problem #8
This is an exercise on designing the TLB from Challenge Problem 7.
Challenge Problem #7-1
Here is another exercise on multi-level paging.
Challenge Problem #7
Here is an exercise on multi-level paging.
Challenge Problem #6-1
Here is a second segmentation challenge problem.
Challenge Problem #6
This problem is an exercise on figuring out the design of the segment table structure for
Challenge Problem #5
These problems will give you a chance to think about issues related to scheduling and deadlock.
Challenge Problem #4
This problem will give you practice solving a synchronization problem with monitors.
Challenge Problem #3
This problem will give you more practice solving a synchronization problem with semaphores.
Challenge Problem #2
This problem will give you practice solving a synchronization problem with semaphores,
and teach you about another synchronization mechanism called barriers.
Challenge Problem #1
These two problems focus on what can happen when multiple processes share (and modify) variables.
Assignments are due at the date and time listed on the handout.
Over the entire semester,
three late days
You can use these late days on different assignments (e.g., one day on each
of three assignments) or all three days on one assignment.
Other than these three days (or serious personal emergencies),
no late work will be accepted.
Late days are 24-hour days.
Late days cannot be used on any assignment
that is due during the last week
Make sure to read the
the class page on
Academic Misconduct Policy.
This is critical to your success in the class.
You must complete the online form on the class Canvas page,
acknowledging that you accept this policy.
Until you hand this in, no assignments will be accepted.
Please make sure to turn off your cell phone during class time.
If your cell phone or beeper rings audibly during class,
you will be asked to leave
and not return until you meet with me in my office.
Please see the Academic Misconduct Policy for information relating to
phones (and similar devices) during quizzes and exams.
We will be using the Linux workstations for this course.
All students who have registered for this class should have an account.
If your personal computer has the proper compilers and libraries, you are welcome
to use it for the programming assignments.
|If you don't take the final:
||If you take the final:
Your lowest quiz grade will be dropped from the average; there will be
no quizzes during the first two weeks.
If you take the final exam, it will be counted as above.
In the past, when I've taught this class, the class GPA has been
The following schedule is tentative and could (and probably will) change.
If you are planning on being out of town, make sure to talk with Bart before
you make your plans.
Note that quizzes are on Thursdays.
||Introduction and overview, processes
|| No section
||September 11 & 13
||Dispatching, process creation
||Intro to C
||Program 1: 537ps: writing the "ps" command.
Assigned: Sep 11
Due: Sep 27 @ 5pm
||September 18 & 20
||Cooperating processes, semaphores.
Quiz 1: Processes
|Intro to gdb, Makefiles
||September 25 & 27
||Semaphores and Monitors
Quiz 2: Synchronizaton with semaphores
|Discuss Challenge Problem 2
||October 2 & 4
||Message passing, implementing synchronization
Quiz 3: Once again with Semaphores
|Discuss Program 1-1 and Challenge Problem 3
||Program 1-1: Using the Clang Staic Analyzer
Assigned: Sep 27
Due: Oct 3 @ 5pm
||October 9 & 11
||CPU scheduling, deadlock
Quiz 4: Synchronization with Monitors
|Discuss Program 2 and Challenge Problem 4
||Program 2: Synchronizing the threads and shared memory
Assigned: Oct 8
Due: Oct 19 @ 5pm
||October 16 & 18
||Relocation, Dynamic Address Translation and Segmentation
Quiz 5: Scheduling and Deadlock
|Discuss Challenge Problem 5
||October 23 & 25
||More segmentation, paging, Multi-level paging
Quiz 6: Segmentation
|Discuss Program 3 and Challenge Problem 6
||Program 3: 537make: writing the "make" command
Assigned: Oct 22
Due: Nov 7 @ 5pm
||October 30 & November 1
No class Thurs
||November 6 & 8
||TLBs, Virtual memory, page replacement, thrashing.
Quiz 7: Multi-Level Paging
|Discuss Challenge Problem 7
||Program 3-1: Using valgrind
Assigned: Nov 7
Due: Nov 14 @ 5pm
||November 13 & 15
||Page replace algorithms, Clock.
Quiz 8: TLB's
Tues: Review discussion on C, dynamic memory allocation,
and debugging with GDB (Adi)
|Discuss Challenge Problem 8
||November 20 & 22
No class Thursday: Thanksgiving
No section: Thanksgiving
||Program 4: Safe Malloc
Assigned: Nov 15
Due: Dec 4 @ 5pm
||November 27 & 29
||Disk allocation and scheduling, directories, protection, file systems
Quiz 9: Page Replacement
|Discuss Challenge Problem 9 and Program 4
||December 4 & 6
Quiz 10: File systems
|Discuss Challenge Problem 10
||December 11 & 13
||Advanced topics (Tuesday).
No class Thursday
|Review for optional final
||Optional Final Exam: 12:25pm-2:25p
Note: If you want to take the final, you need to email Bart and get a confirmation
back. Only those students confirmed will be able to take the exam.
This course conforms to the standard Carnegie unit of instruction.
It is for 4 credits.
There are two 75 minute lectures and one 50 minute discussion section per week.
In addition, there will be approximately 8 hours of out-of-class (homework) per week.
Instruction covers a period of 15 weeks.
Our class is a safe, supportive and accepting environment.
The instructors and students are expected to demonstrate respect for
others in class regardless of age, race, gender, religion, nationality
The University of Wisconsin-Madison supports the right of all enrolled students
to a full and equal educational opportunity. The Americans with Disabilities Act
(ADA), Wisconsin State Statute (36.12), and UW-Madison policy
(Faculty Document 1071) require that students with disabilities be reasonably
accommodated in instruction and campus life.
Reasonable accommodations for students with disabilities is a shared faculty
and student responsibility. Students are expected to inform me of their
need for instructional accommodations by the end of the third week of the
semester, or as soon as possible after a disability has been incurred or recognized.
I will work either directly with the you or in coordination with the McBurney
Center to identify and provide reasonable instructional accommodations.
Disability information, including instructional accommodations as part
of a student's educational record, is confidential and protected under FERPA.
Students will learn about the three fundamental categories of operating system abstraction and
(1) processes, synchronization, and scheduling,
(2) virtual memory and memory management,
(3) file systems and persistent data storage.
Through programming assignments, students will learning about system libraries
and kernel calls, which are mechanisms provided to user to access operating system
Students will learn to reason about system functionality, viewing a complex system as a layering of
interacting abstractions with concrete implementations
Students will learn to reason about system performance, applying the lessons of
algorithms and data structures to the complex operation of an operating system.
In addition to completing an electronic Faculty Notification Letter request
through McBurney Connect, it is important for students to contact the
me directly by the end of the third week of the semester to set up a meeting
to discuss implementation of any necessary accommodations.
This early communication helps ensure that accommodations can be
implemented in a timely manner.
For example, if an alternative exam room is needed, arrangements must be
made well in advance of an exam date to ensure room availability and to
secure a room booking.
Wed Dec 12 17:36:54 CST 2018