It introduces the basic scheduling algorithms. Scheduling Algorithms UNIX Chapter 10 extends the scheduling discussion to multiple processes and to real-time systems. Regular attendance is expected. Students are responsible for all material covered in class. The last day to withdraw from this course without penalty is prior to the start of class on Tuesday, October 31.
Assignments are due on the date announced at the time assignments are made.
It is assumed that all material submitted for grading represents the efforts of the student submitting the work. Failure to comply with this policy will result in a grade of zero for the assignment. A second violation of this policy will result in failure of the course. These pages were last updated on 27 June 2000 by R. Meeker .