Instructor: Dr. James Glenn
Office: DS 125d
Work Phone: (410)617-5394
FAX: (410)617-2157
Office Hours: M 1pm-2:30pm, W 9am-9:55am, Th 10:45am-1:30pm, F 11am-11:55am, or by appointment
e-mail:[first initial][last name]@cs.loyola.edu

Course Home Page: http://gunpowder.cs.loyola.edu/~jglenn/466/S2008/index.html

Class Meeting: MWF 12:00n-12:50pm in KH006

Prerequisites: CS302 (Data Structures and Algorithms II) and CS371 (Computer Engineering)

Required Text: Modern Operating Systems (3rd ed.) by A. Tanenbaum

Other Resources:

• Matt Chapman's A Beginners Guide to UNIX may be helpful for those who have no experience with Unix (or google "unix tutorial").
• Cygwin (Unix environment for windows)
• SGI's C++ STL Guide

Course Description:
Considers processes, process synchronization and mutual exclusion, and techniques for memory allocation, scheduling, and disk management. Surveys current computer operating systems and discusses research in distributed operating systems.

Specific Educational Objectives of the Course:
At the completion of the course, the student will be able to:

• write programs that use multiple processes and threads;
• use synchronization primitives in those programs;
• write code to manage those processes and threads at the kernel level;
• describe strategies for managing CPUs, file systems, and memory; and
• apply algorithms for detecting deadlocks and implement solutions that prevent deadlocks.

Conduct of the Course:
Lectures will be used to introduce, explain, and analyze new concepts. Readings from the required textbook will enhance students' understanding of those lectures. Weekly homework assignments (not necessarily done at a computer) will reinforce the concepts discussed in lecture. Those concepts will be put into use in programming projects. One midterm exam and a final exam will also be used to evaluate students' progress.

Academic Integrity:
Loyola College Honor Code Statement:

"The Honor Code states that all students of the Loyola Community have been equally entrusted by their peers to conduct themselves honestly on all academic assignments.

The students of this College understand that having collective and individual responsibility for the ethical welfare of their peers exemplifies a commitment to the community. Students who submit materials that are the products of their own minds demonstrate respect for themselves and the community in which they study.

All outside resources or information should be clearly acknowledged. If there is any doubt or question regarding the use and documentation of outside sources for academic assignments, your instructor should be consulted. Any violations of the Honor Code will be handled by the Honor Council"

The Honor Code as is pertains to this class:All designs and code used for programming projects should be the work of only the student submitting the project. Work on exams should be solely the work of the student whose name appears at the top of the exam.

Grading:

• Homework: 20%
• Programming Projects: 30%
• Midterm Exams: 15% each (Wed, Feb 27 and Fri, Apr 11)
• Final Exam: 20% (Wed, May 7 at 9am)

Final Grade Distribution:
Final letter grades will be no worse than those in the following table.

A	A-	B+	B	B-	C+	C
93%	90%	87%	83%	80%	77%	70%

Topics:

• Processes and Threads
• Interprocess communication
• Synchronization
• Scheduling
• Deadlocks
• Memory Management
• Low level I/O
• File Systems

Midterm Exam: Wednesday, February 27th and Friday, April 11th

FINAL EXAM: Wednesday, May 7th at 9am