DEADLOCKS

1. What is a deadlock? Explain giving examples.

2. Explain how a deadlock can be represented graphically for two processes and two
resources.
3. What are Coffmans prerequisites for a deadlock?
4. Name different strategies that operating system designers can adopt for the problem of a
deadlock.
5. Give a possible algorithm for deadlock detection for single instance of each resource and
multiple instances of the resources both.
6. Discuss the merits/demerits of the ways in which the operating system can recover from a
deadlock.
7. Why can a deadlock not be prevented easily? Discuss this with respect to Coffmans
prerequisites considering each of them one by one.
8. Explain the difference between deadlock and starvation.