Questions -
Q1. Describe the necessary conditions for a deadlock to occur. Why must all four conditions hold?
Q2. What are the primary differences between deadlock avoidance and prevention?
Q3. What are the pitfalls with preventing or avoiding deadlocks?
Q4. Given the following table of process current and max needs. Does there exist a safe sequence according to deadlock avoidance? If so what is it? If not then why? Assume we have 12 resources available.
|
Max Needs
|
Current Needs
|
|
P0
|
10
|
5
|
|
P1
|
4
|
2
|
|
P2
|
9
|
3
|
Q5. Describe at least two of the methods for deadlock prevention.
Q6. What do most operating systems do not attempt to deal with deadlocks?
Q7. Describe a Resource Allocation Graph. When do we know there are no deadlocks?
TEXTBOOK - OPERATING SYSTEM WITH JAVA CONCEPTS, 8TH EDITION BY SILBERSCHATZ, GALVIN, GAGNE.
Kindly use the book that I attached to answer these questions (Chapter 6 deadlock) short answers.