Question 1: What do you mean by the term deadlock? What are the obligatory conditions for the deadlock?
Question 2: What do you mean by the word resource allocation graph (RAG)? Describe by using appropriate illustrations, how can you use it to notice the deadlock?
Question 3: Illustrate the meaning of pre-emption and non-preemption and explain it with an example?
Question 4: Compare and contrast the given policies of the resource allocation:
a) All resources requests altogether.
b) Allocation by using resource ranking.
c) Allocation by using Banker’s algorithm
On the basis of (a) resource idling and (b) overhead of the resource allocation algorithm.
Question 5: How can pre-emption are used to resolve the deadlock?
Question 6: Illustrate the reason why Banker’s algorithm is called so?
Question 7: Under what situations or conditions a wait state becomes a deadlock?
Question 8: Describe how mutual exclusion prevents the deadlock.
Question 9: Describe the advantages and drawbacks of each approach dealing with the dilemma of deadlock.
Question 10: Distinguish between the terms deadlock avoidance and deadlock prevention.
Question 11: A system comprises 6 units of a resource, and 3 processes which require using this resource. If the maximum resource need of each process is 3 units, will the system be free of deadlocks for all the time? Describe clearly. If the system had 7 units of the resource, would the system be free of deadlock?