CSCI 215
Operating Systems

Welcome to CSCI 215.  For this course, we will centralize the distribution of information on this course web page. This page can be found on the Clark web server at http://babbage.clarku.edu/~jbreecher/os/os.html.

Basic Information

Course Description

Textbook

Your Evaluation

Lectures

Daily Events

Class Example Code

The Projects

Basic Information

Course Description

This is what the catalog says:

Operating Systems/ Lecture, Laboratory

Studies the structure, performance, and design of operating systems. Topics include concurrency, deadlocks, scheduling, and memory management. Various operating systems may be examined and compared. Students will design and implement parts of operating systems. Prerequisite: CSci 160.

Textbook

Operating System Concepts, Eighth Edition, Abraham Silberschatz, Peter Baer Galvin, Greg Gagne. John Wiley & Sons, Inc. The hardcover edition is ISBN: 978-0-470-12872-5 . . Also, the text doesn't change that much from edition to edition; you can probably get away with a 7th edition just fine; find a used copy on-line.

Your Evaluation

Your evaluation in this course is determined by:

Lectures

In the Table below are pointers to the notes for the course.  The formats available can be read by Microsoft Powerpoint (.ppt), read by Apache (.pdf) or downloaded to a postscript printer (.ps).  Lectures generally will be from these notes. Feel free to print them out and use them during class to avoid extensive notetaking. You can simply annotate these notes rather than writing everything. But warning, don't be lulled into a false sense of security. What's talked about in the class will be in MUCH MORE DETAIL than is present on these slides.

An added advantage of written out notes is that you know what to read in the text. In general, I follow the book fairly closely so you should have no trouble figuring out where to find material to amplify these course notes.

The following Notes are arranged in book order, not necessarily in the order we'll lecture on them.

WEEKLY LABS: This is a chance for you to practice what will be done in the projects. Attendance is expected in these labs, but the main purpose is that you will see what is to happen in the projects. Small demonstrations will happen every week for your amusement and edification.

PROJECTS: These are programming assignments that you are expected to turn in. There's a schedule for these that's given later in this syllabus.

Daily Events

Here's how the material and deliverables break down for the semester.

Class Example Code

Projects

A significant component of the CS 215 course is the project, in which you will design and implement a basic operating system for a Z215 processor (this is a hypothetical processor architecture and a simulator is provided). The overall project is divided into two project phases.  The first phase builds necessary data structures and implements multiprogram scheduling.  The second phase adds virtual memory management and Disk IO to the core implemented in phase 1. 

The project requires substantial programming in C, (3 to 4 thousand lines of code is not atypical, depending on commenting style), thus students should already have a sound programming foundation. It is not expected that you know C when you start the class, but you certainly will by the time you finish. If your programming skills are a bit weak, expect to spend more time picking up those skills.

For more information, including project phase assignments and Z215 documentation, see the

There are weekly labs. If you miss lab, you are insane. This is where you will gain some clue as to what is going on with the project. There is no "grade" as such for attending lab - but miss it at your own peril.

Below is a calendar for how the project work will be conducted. Use this in conjunction with the Project Web Page and the project documentation.