|
|
Spring/Summer 2000 |
CSC 4420: Computer Operating Systems Class information Term: Spring/Summer 2000 Instructor information Instructor: Miloslav Besta TA: Huaicai Mo Textbook A. Silberschatz, P.B. Galvin: Operating System Concepts (5th Edition), Addison-Wesley 1998. Course content Overview: what is an operating system; brief history; classification of operating systems. Computer-System Structures: computer system operation; I/O structure; storage structure and hierarchy. Operating-System Structures: system components; operating system services; system calls. Processes: concepts; scheduling; cooperation; threads; inter-process communication. CPU Scheduling: scheduling criteria; scheduling algorithms; multiple-processor and real-time scheduling. Process synchronization: background; critical sections, synchronization, semaphores, critical regions. Deadlocks: system model; deadlock characterization; deadlock handling; deadlock prevention. Memory management: logical & physical spaces; swapping; contiguous allocation; paging; segmentation. Virtual memory: background; demand paging; page replacement; thrashing. File System Interface: concepts, access methods, directory structure, protection. File System Implementation: file system structure; allocation methods; space management; directories. Secondary Storage Structure: disk structure; disk scheduling; disk management; swap space management. The topics above correspond to chapters 1-11 and 13 in the textbook. The instructor reserves the right to vary the level and depth of the material covered in order to adapt the course to the background and level of the students. Furthermore, some topics may be added if time permits. Class policies Attendance: Attending all lectures and lab sessions is essential; the assignments, exams, and quizzes will be based primarily (though not exclusively) on the materials presented in these lectures. Also, assignment due dates, explanation and clarification of assignments and material outside the textbooks will be presented during the lecture sessions. If you miss a lecture, it is your responsibility to obtain the information covered in the session. Computer lab: To enhance your learning and for preparation of your homework, the computer lab, equipped with PC's and Unix workstations is available to you during the time posted on the lab's door. Important dates: Midterm exam: Wednesday, June 21 Grading procedures There will be several assignments, due at the beginning of the lecture period of the due date. These assignments will involve solving problems, answering questions and/or implementing algorithms in C/C++/Java in a Unix environment. Working knowledge of one of these programming languages and of the Unix environment is necessary. 10% of your score will be deducted for every day (including holidays and weekends) your assignment is late. No assignments will be accepted after 10 calendar days past its due date. There will be several unannounced quizzes during the regular lecture hours. The final examination will be based on all the material covered in the class. The examinations will be closed books, closed notes and closed neighbors. If you suspect that you will be unable to attend an exam because of a valid and verifiable excuse, you must give the instructor prior notice at least one full day before the exam. There will be no make-up examinations or quizzes. The final grade will be calculated as follows: Grading Scale
A grade of incomplete (I) will not be given unless in very exceptional circumstances. Student Responsibilities As a college student who is committed to seek a higher education, we expect you be a very responsible person. At the least, please:
In fairness to all, if we find two or more assignments which appear to be copied from each other, we will split the points evenly among all those involved (no matter who copied from whom). Repeated incidents will be dealt with severe disciplinary actions. Back to Top |
|
