1. Discuss the two resource allocations methods (static and dynamic). Give the advantages of one over the other.
2. Classify the following resources as either sharable or non-sharable: CPU, memory, line printer, card reader, magnetic tape, magnetic disk, file, database record.
3. Give an example of a system in a deadlock situation. The example should be a system with at least three different types of resources.
4. Explain the four conditions for a deadlock to occur. Is it necessary for all four conditions to hold for a deadlock to occur.
5. Why does the Bahala Na policy work? Why is this policy not often used?
6. How can the circularity condition be prevented from holding? Illustrate how deadlock can be avoided by preventing this condition.
7. How can hold and wait be prevented from holding? Illustrate how deadlock can be avoided by preventing this condition.
8. One way of detecting a deadlock is to detect if circularity wait already holds in the system.
Outline a method of detecting a deadlock.
9. Outline the cheapest method of recovering from a deadlock. Support your answer by arguing for it.
10. Aborting a process during deadlock recovery is not that simple. Explain.
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment