¾¾¾¾¾¾¾¾¾¾¾¾¾¾¾¾¾¾¾¾¾¾¾¾¾¾¾¾¾¾¾
Points: 100 points
Due: Week 12, Thursday, November 13, 2003
1. (10 pnts) Problem 6 in the textbook on page 411. Here we assume the maximum claim for both processes is 2.
2. (20 pnts) Problem 7 in the textbook on page 411.
3. (10 pnts) Problem 8 in the textbook on page 412.
4. (10 pnts) Problem 9 in the textbook on pages 412. Here we need to change Figure 8.10 to Figure 8.11. (Note that deadlock is not possible in Figure 8.10 as there is no hold and wait).
5. (20 pnts) Problem 11 in the textbook on page 412.
6. (10 pnts) Problem 6 in the textbook on page 559.
7. (10 pnts) Problem 10 in the textbook on page 559.
8. (10 pnts) Problem 11 in the textbook on page 559. Here we assume the block size is 4KB even though it is not enough to hold 2048 disk addresses.