Minimum number of processes that ensures deadlock = 25.Process P25 holds 4 units of resource R.Process P3 holds 4 units of resource R and so on.If there are 100 units of resource R in the system and each process in the system requires 5 units of resource R, then how many processes can be present at maximum so that no deadlock will occur?
Maximum number of processes that ensures no deadlock = 34 – 1 = 33.Minimum number of processes that ensures deadlock = 34.Process P33 holds 3 units of resource R.Process P3 holds 3 units of resource R and so on.If there are 100 units of resource R in the system and each process in the system requires 4 units of resource R, then how many processes can be present at maximum so that no deadlock will occur? Maximum number of processes that ensures no deadlock = 100 – 1 = 99.Minimum number of processes that ensures deadlock = 100.Process P100 holds 1 unit of resource R.Process P3 holds 1 unit of resource R and so on.If there are 100 units of resource R in the system and each process in the system requires 2 units of resource R, then how many processes can be present at maximum so that no deadlock will occur? Maximum number of processes that ensures no deadlock = 3 – 1 = 2.Minimum number of processes that ensures deadlock = 3.If there are 6 units of resource R in the system and each process in the system requires 3 units of resource R, then how many processes can be present at maximum so that no deadlock will occur? Maximum number of processes that ensures no deadlock = 6 – 1 = 5.Minimum number of processes that ensures deadlock = 6.If there are 6 units of resource R in the system and each process in the system requires 2 units of resource R, then how many processes can be present at maximum so that no deadlock will occur? Minimum number of units of resource R that ensures no deadlock = 90 + 1 = 91.Maximum number of units of resource R that ensures deadlock = 20 + 30 + 40 = 90.Process P3 holds 40 units of resource R.Process P2 holds 30 units of resource R.Process P1 holds 20 units of resource R.The minimum number of units of R that ensures no deadlock is _? Minimum number of units of resource R that ensures no deadlock = 6 + 1 = 7Ī system is having 3 user processes P1, P2 and P3 where P1 requires 21 units of resource R, P2 requires 31 units of resource R, P3 requires 41 units of resource R.Maximum number of units of resource R that ensures deadlock = 1 + 2 + 3 = 6.Minimum number of units of resource R that ensures no deadlock = 20 + 1 = 21Ī system is having 3 user processes P1, P2 and P3 where P1 requires 2 units of resource R, P2 requires 3 units of resource R, P3 requires 4 units of resource R.Maximum number of units of resource R that ensures deadlock = 10 x 2 = 20.Process P10 holds 2 units of resource R.Process P3 holds 2 units of resource R and so on.The minimum number of units of R such that no deadlock will occur _? Minimum number of units of resource R that ensures no deadlock = 3 + 1 = 4Ī system is having 10 user processes each requiring 3 units of resource R.Maximum number of units of resource R that ensures deadlock = 1 + 1 + 1 = 3.The number of units that each process holds = One less than its maximum demand The minimum number of units of R such that no deadlock will occur. PRACTICE PROBLEMS BASED ON DEADLOCK IN OS-Ī system is having 3 user processes each requiring 2 units of resource R. = One more than maximum number of units of resource R that ensures deadlock Minimum number of units of resource R that ensures no deadlock Minimum Number Of Units That Ensures No Deadlock. = Sum of max needs of all n processes – n
0 kommentar(er)
