CMSC621

Homework 1

Due: by Midnight on Sep 07, 2000

 

1. What is a deadlock? How can it be detected using a resource graph? (10 points)


2. Explain the difference between a binary semaphore and a counting semaphore. What is the difference between their capabilities? (5 points)


3. Describe the Elevator(SCAN) algorithm for disk access scheduling. (5 points)


4. What is the "dirty" bit in a page table? (5 points)


5. What is the i-node structure in Unix file system? Explain how it is used for indirect block allocation. (10 points)