Assignments:
Assignment 1: pg 44, #17, 22, 25 - Due 9/9/09
Assignment 2: pg 142 #6, 7, 12 - Due 9/16/09
Assignment 3: pg 175 #11, 12, 14 - Due 9/23/09
Assignment 4: pg 220 # 5.12, 5.13, and 5.17 - Due 9/30/09
Assignment 5: pg 274 #6.39 - Sleeping Barber Problem - Use semaphores - Due 10/26/09
Assignment 6: pg 271 #6.23 - Bounded Buffer Monitor - Due 11/5/09
Assignment 7: pg 691 #7.20 - Banker’s Algorithm - Due Monday 11/9/09
Assignment 8: Fork/Join-Parbegin/Parend - Due Monday 11/16/09
Assignment 9: Memory Management - pg 353 8.18, 19, 20, 21, 23. - Due Thursday 12/3/09
Assignment 10: Virtual Memory - pg 412 9.20, 9.21, and: the following problem:
For the page reference string on pg 415, 9.31b, how many page faults occur under FIFO, LRU, and OPTimal page replacement strategies given that four frames are available.
Exams:
Exam 1:
Wednesday, October 14, 2009
* One page of handwritten notes
Topics:
- Chapters 1-6
- Concentrate on concepts, algorithms, - not specific examples of OS implementations.
Exam 2:
Monday November 23, 2009
Topics:
- Chapters 6 - 7
- One page of notes
- Synchronization, Transactions, Serializability, Timestamps, Deadlock characterization, prevention, avoidance, detection,
recovery, Bankers algorithm,
Final Exam:
Monday, December 14, 9:00 to 11:00 AM
One page of notes
Topics:
- Chapter 8
- Chapter 9
- Fork/Join and Parbegin/Parend
Project:
