Register

Recent questions tagged deadlock-prevention-avoidance-detection

1 votes
2 answers
91
Andrew S. Tanenbaum (OS) Edition 4 Exercise 6 Question 26 (Page No. 467)
A system has four processes and five allocatable resources. The current allocation and maximum needs are as follows: What is the smallest value of x for which this is a safe state?
A system has four processes and five allocatable resources. The current allocation and maximum needs are as follows:What is the smallest value of x for which this is a sa...
User Avatar
0 votes
1 answer
96
Andrew S. Tanenbaum (OS) Edition 4 Exercise 6 Question 21 (Page No. 467)
Take a careful look at Fig. 6-11(b). If $D$ asks for one more unit, does this lead to a safe state or an unsafe one? What if the request came from $C$ instead of $D?$
Take a careful look at Fig. 6-11(b). If $D$ asks for one more unit, does this lead to a safe state or an unsafe one? What if the request came from $C$ instead of $D?$
User Avatar
0 votes
1 answer
102
Andrew S. Tanenbaum (OS) Edition 4 Exercise 6 Question 15 (Page No. 467)
Explain how the system can recover from the deadlock in previous problem using recovery through preemption. recovery through rollback. recovery through killing processes.
Explain how the system can recover from the deadlock in previous problem usingrecovery through preemption.recovery through rollback.recovery through killing processes.
User Avatar
0 votes
0 answers
107
Andrew S. Tanenbaum (OS) Edition 4 Exercise 6 Question 10 (Page No. 466)
Consider Fig. 6-4. Suppose that in step $(o)\: C$ requested $S$ instead of requesting $R.$ Would this lead to deadlock? Suppose that it requested both $S$ and $R.$
Consider Fig. 6-4. Suppose that in step $(o)\: C$ requested $S$ instead of requesting $R.$ Would this lead to deadlock? Suppose that it requested both $S$ and $R.$
User Avatar
1 votes
3 answers
118
UGC NET CSE | June 2019 | Part 2 | Question: 48
A computer has six tape drives with $n$ processes competing for them. Each process may need two drives. What is the maximum value of $n$ for the system to be deadlock free? $5$ $4$ $3$ $6$
A computer has six tape drives with $n$ processes competing for them. Each process may need two drives. What is the maximum value of $n$ for the system to be deadlock fre...
User Avatar
Page: