Prof. Quynh Dinh
Thursdays 6:15-8:45pm, Pierce 116.
Office Hours: Thursdays 4pm-5pm, Lieb Building rm.302. All other times by
appointment.
TA: Alam Bakr (abakr@cs.stevens.edu)
Office Hours: Wednesdays 5pm-6pm, Lieb 101. All other times by appointment.
All assignments are due at 11:59pm (midnight) on the due date. Assignments are to be submitted using the submit Unix command. You will be allowed to submit the assignment up to 4 times until the due date/time. Directions on how to submit assignments can be found at the submission procedure.
10 points (out of 100) will be taken off for each day that an assignment is turned in late. In other words, 10 points will be taken off if the assignment is turned in before midnight the day after the due date, and so on. Assignments may be turned in late up to 5 days after the due date/time.
Please see policy on
collaboration.
Warning: The links below are to MS Powerpoint slides which can augment your notes. These slides do not completely cover topics discussed in class or in reading assignments. Solutions to exam questions and programming assignments may not appear in the slides.
The following is a tentative schedule and is subject to change.
|
|
|
|
|
| Introduction, System Calls, Processes, Threads, Interprocess Communication, Critical Section, Mutual Exclusion, Producer-Consumer, Hardware-enabled Locking, Semaphores | Ch.1, Ch.2.1-2.4, p.864-866 | ||
| Mutexes, Monitors, Message Passing, Remote Procedure Call (RPC), Scheduling, Deadlocks | Ch.8.2.3-8.2.4, Ch.2.5, Ch.3, Assignment 1 | ||
| Scheduling, Deadlocks | Ch.3 | ||
| student presentations (process communication and scheduling) | |||
| Memory Management, Swapping, Variable Partitions, Virtual Memory, Paging | Ch.4.1-4.32 | ||
| Page Replacement Strategies, Page Allocation, Page Size, Page Faults, Backing Store, Memory Segmentation | Ch.4.4-4.8, Assignment 1 due | ||
| student presentations (memory management) | Assignment 2 | ||
| Midterm (sample midterm questions) | |||
| NO CLASS (Spring Break) | |||
| File Systems, File System Implementation | Ch.6.1-Ch.6.2, Ch.6.3.1, 6.3.2, 6.3.5, 6.3.6 (file system consistency), 6.3.7, Assignment 2 due | ||
| I/O, Devices, Device Drivers, Plug-n-Play, Streams | Ch.5.1-5.4, 5.6, 5.8, Ch.10.5.3-10.5.4, Ch.11.6.4, Assignment 3 | ||
| student presentations (file systems) | |||
| Disks, Network Terminals | Ch.5.8, Assignment 3 due | ||
| OS Security Issues | Ch.6.4.2-6.4.5, Ch.10.6.3, Ch.11.7 (up to 11.7.3 File Compression), Assignment 4 | ||
| student presentations (device I/O and security) | |||
| Final Exam | Assignment 4 due |
You will be using C or C++ under Unix (netBSD machines or guinness). Burchard
127 has Unix terminals availabel for CS students. You may develop and debug all
your code on any machine you like, but before you submit your homework
make sure it compiles and runs on NetBSD. If you don't already have
a computer account, make sure you get one, by contacting the
CS system administrator.