And I was like “What’s the scariest thing I could do?” And then I started learning about the Linux kernel and about operating systems and I wrote a little small operating system.
This an introductory course in operating systems concepts. The course is divided into seven two-week sections. See the schedule for details.
You should be a proficient programmer and have a working knowledge of basic algorithms and data structures. The prerequisites for this class are
Class meets in Howard Hall 209 on Mondays and Wednesdays from 7:25 to 9:15 p.m. First day of class is Wednesday, 21 January; last day of class is Wednesday, 29 April. Midterm grades (CS 438 only) are due Tuesday, 10 March. Monday, 30 March, is the last day to withdraw from class with a W. There are no classes on Monday and Wednesday, 16 and 18 March (Spring Break).
• indicates an assignment due day.
There are three programming assignments; see the schedule for details.
Apart from possible pop quizes, there are no tests in this course.
The grade ranges for this class are nonstandard:
CS 438 & 505:
40 < A ≤ 45 35 < A- ≤ 40 30 < B+ ≤ 35 25 < B ≤ 30 20 < B- ≤ 25 15 < C+ ≤ 20 10 < C ≤ 15 5 < C- ≤ 10 0 < F ≤ 5
The final grade is a straight, unweighted average of the two highest assignment grades — the lowest assignment grade is dropped. The final grade comprises two grades total; each constituent grade constitutes one-half (50%) of your final grade.
All grades are kept with one digit of precision to the right of the decimal point and 0.05 rounded up. No grades are adjusted to a curve; that means that 35 is always B+, never an A-.
The textbook for this course is Operating System Concepts by Abraham Silberschatz, Greg Gagne, and Peter Galvin from Wiley. Lectures and readings use the eighth edition, but any relatively new edition should do.'
There are lots of operating systems textbooks around. If you don't like Silberschatz, Gagne, and Glavin, you might want to look at some other ones. See the annotated bibliography for details.
This is a programming course, and you’ll be programming in Java. You should have at hand at least one Java programming language book to help you recover the old details persue futher the new details. The book from CS 175 and 176 should be fine. Also recommended are Core Java 2, Vol. 1 — Fundamentals by Cay Horstmann and Gary Cornell, Sun Microsystems Press, 2008. and Java in a Nutshell by David Flanagan, O’Reilly Media, 2005.
Mail relevant to the class will be stored in a
hyper-mail archive (
tinyurl.com/mucsoss15m
). If your message is of general interest to the class, I’ll store it, suitably stripped of identification and along with my answer, in
the archive.
www.monmouth.edu/~rclayton/web-pages/s15-os/index.html
( tinyurl.com/mucsoss15h
). I’ll make the class notes, assignments, and other material available
on the schedule at
www.monmouth.edu/~rclayton/web-pages/s15-os/schedule.html
(
tinyurl.com/mucsoss15s
); you should get in the habit of checking the schedule regularly.
twitter.com/mucsos
).
My attendance policy applies only to lecture attendance; it does not apply to other kinds of attendance which may be required for the course. Repeated failures to meet the attendance expectations set for tests, meetings, projects, labs or other forms of course work will have a bad influence on your grade.
Monmouth University does have a class attendance policy, which you can find in the Academic Information chapter of the Student Handbook. To the extent that I need to keep the record straight, I will take attendance. Attendance lists, however, are entirely for the University’s benefit; I will make no use of them in grading.
First, the only complaint that matters is that something got marked wrong when it was actually right. When you come to complain, be prepared to present, in explicit detail, what it is you did and why you think it’s right.
Second, complaints about a particular test or assignment are only valid until the next test or assignment is due; after that point the book is permanently closed on all previous test or assignment grades.
Assignments should be turned in by their due date; assignments turned in after their due date are late. You should contact me as soon as possible if you need to negotiate a due-date extension. The longer you wait to negotiate, the less likely it is you’ll be successful; in particular, you have almost no chance of getting an extension if you try for one the day before the due date, and you have no chance of getting an extention on the due date.
A late assignment is penalized ten points a day for each day it’s late. I use a 24-hour clock running from midnight to midnight to measure days; note this means that an assignment handed in the day after it’s due is penalized ten points: five for the day it was due and five for the next day.
Learn about operating systems from the comfort of your home, courtesy of Berkeley or Notre Dame (via iTunes, unfortunately).
OS News, a web site with os news and opinions.
The ER and KeyK OSs from U. Penn.
And let us not forget the dearly departed: OS/2, multics.
And let us welcome the newcomers: V2, the Gemini nucleus, the NewOS, and AtheOS.
An operating system for a calculator.
The 24th ACM Symposium on Operating Systems Principles (SOSP '13).