You will be expected to read about one chapter of the text per week. Reading assignments are shown in the course schedule, and should be completed before the class in which the material is discussed, since the class session will assume this background. Time will be allowed at the beginning of each session for questions on the text material.
The attendance policy is as follows: Each student is allowed six (6) absences during the semester for whatever reason. For each absence after the sixth there is a five (5) point reduction in the final average. Exceptions to this policy will be made only in extreme cases, due to circumstances beyond your control and which were unforeseen at the beginning of the semester. If you are aware of classes you will need to miss because of field trips, athletic events, or for personal reasons, plan to include those among your allowed absences. If you arrive late, you may be marked absent for that class.
Nine problem sets will be distributed during the semester, and will be due as shown in the course schedule, with value in the final grade computation as shown below. Note that these will be fairly substantial assignments; you would do well to work on the problems as the material is covered in class, rather than waiting until just before the set is due to tackle the whole assignment. Solutions to each problem set will be posted outside the professor's office door after the set is turned in.
Set # Material covered Value
1 OS History, Functions, and Structure; Unix system usage 3%
2 CPU Scheduling 3%
3 Concurrent Processes and Programming - I 3%
4 Concurrent Processes and Programming - II 3%
5 Deadlock 3%
6 Memory Management 3%
7 Virtual Memory 3%
8 Secondary Storage Management; File Systems 3%
9 Protection; Multiprocessor, Distributed and Network Systems 5%
You are permitted to work together on the homework assignments. However, the work you turn in should be your own. These problems should be considered tools to help you better understand the theory and to become more proficient with the techniques of this course. It is essential that you understand the solution to each problem in order to derive the greatest benefit from this course.
Four programming projects will give you opportunity to work with selected aspects of operating system implementation and concurrent programming, with emphasis and value in the final grade computation as indicated below. These projects are to be written in C, using the department's Unix system.
Project Emphasis Value
------- ------------------------------------------ -----
1 CPU Scheduling 8%
2 Concurrent Programming w/Shared Memory 8%
3 Concurrent Programming w/Messages 8%
4 (To be announced) 8%
---
Total 32%
At your option, you may do any two of these projects as part of a team of 2-3 students. The other two must be done individually. (All four may be done individually if you wish.)
There will be three examinations given as shown in the Course Schedule. The first two will be take-home, and the third will be given during the final exam hour. Each will account for 13% of the final course grade (39% total for the three exams). The third exam will include some cumulative material focusing on synthesizing what you have learned in the course. Exams will be open book, open notes.
Students with disabilities who may need academic accommodations should speak with the professor within the first two weeks of class. Students are also responsible for making sure documentation of the disability is on file in the Academic Support Center. See Ann Seavey, Jenks 412 x4746. Failure to register in time with the professor and the ASC may compromise our ability to provide the accommodation.