Principles of Operating Systems

I will also be available on Wed, May 2 from about 11am-6pm (except 1-2pm). Send me email if you want to meet me in my office then so I can be sure to be there (323 Smith).

Graded quizzes will be on the door of my office, 323 Smith, by noon on Wed, May 2.

The final exam will be held on Mon, May 7, 3-6pm, in our usual room Conklin 446. The exam will cover the material for the whole course, with some extra emphasis on the material after Test 3 (Chapters 11-12).

Parts of Chapter 11 and 12 covered: 11.1-11.8, 12.1-12.4

M 2:30-3:50, W 1:00-2:20, 446 Conklin Hall

Programs discussed in class

Course Schedule (including syllabus)

To access pegasus from home, you'll need a version of SSH. You can get one from http://ftp.ssh.com/pub/ssh/, by clicking on SSHSecureShellClient-3.2.9.exe and thereby running the installation wizard on your computer.
Instructor Prof. John Loftin, 323 Smith Hall, Phone: (973)353-5156, ext. 23.
Email loftin AT andromeda DOT rutgers DOT edu
Email is the best way to get in touch with me.
Website http://www.andromeda.rutgers.edu/~loftin (this syllabus is attached to the website)
Department Website http://math.newark.rutgers.edu/
Prerequisite Computer Science 102
Course Material
(more details
are on the 
Course Schedule)
  • Introduction
  • Operating System Structures
  • Processes
  • Threads
  • CPU Scheduling
  • Process Synchronization
  • Deadlocks
  • Main Memory
  • Virtual Memory
  • File Systems
  • Mass-Storage Structure
  • I/O Systems (if time permits)
Text Silberschatz, Galvin & Gagne, Operating Systems Concepts, 7th ed., Wiley, ISBN 0-471-69466-5
Homework Homework will be assigned about once a week. It will not be collected or graded; however, your quizzes will often consist of a homework problem verbatim. See the Course Schedule. Students are encouraged to work together on the homework.
Quizzes Quizzes will be given about once a week, and will be based on the homework or lecture material. In fact the quizzes will often consist of a homework problem verbatim. See the Course Schedule. The lowest two quiz grades, including absences for any reasons, will be dropped.
Programming project There will be one programming project for the course, which should be written in C++ using the g++ compiler on pegasus. Due date is March 5.
You are encouraged to discuss the programs with each other, but YOU MAY NOT COPY ANYONE ELSE'S PROGRAM CODE.
The grades for programming assignments will be based mainly on the correctness of the code, but partially on the elegance and proper use of encapsulation in the code. Programs which do not compile will receive no credit.
Exams There will be three exams during the term and a final exam. The first three exams will be held in class, and will test your knowledge of the material covered in the past few weeks' classes. Exam 1 will be held in class on Wednesday, February 14. Exam 2 will be held on Monday, March 19 (this is the day after spring break: BE HERE). Exam 3 will be held in class Wednesday, April 18. The final exam will be held on Monday, May 7, 3-6pm. The room of the final exam is our usual room Conklin 446. The final exam will be comprehensive. (See the Course Schedule.)
Grades Your grade will be determined by your quizzes (15%), your project (5%), Exam 1 (15%), Exam 2 (15%), Exam 3 (15%), and the Final Exam (35%).
Office Hours M 1:00-2:00, W 11:30-12:30, in 323 Smith Hall. You may see me any time during office hours without an appointment. You may also make an appointment to see me other times.
Course Schedule


The programming project is due Monday, March 5, at midnight. Here are instructions.

Test 2 is on Monday, March 19 (this is the first day after spring break). The material covered will be chapters 5 and 6 in Silberschatz, et al, as well as sections 7.1, 7.2.1, 7.3, 7.4. Also, there are a few algorithms discussed in class that are not in the book:

If you missed any of these presentations in class, you must get notes from one of your classmates. Also, you should know how to do the homework problems assigned, and any vocabulary from the sections of the book which are to be covered on the test.

Test 3 is Wed, 4/18, in class. Material covered: Ch 7-10 basically, but in particular 7.2,7.5,7.6,7.7 (algorithms from ch. 7), ch.8, ch.9 (and some details not in the book, e.g. the enhanced second-chance algorithm), ch.10

John Loftin
2007-01-10