An operating system uses bankers algorithm for deadlock avoidance when managing...
✅ The verified answer to this question is available below. Our community-reviewed solutions help you understand the material better.
An operating system uses bankers algorithm for deadlock avoidance when managing the allocation of three resource types x,y,z to three processes p0,p1,p2 .
The allocation matrix show the number of allocated resourses and max shows the maximum resources needed by processes during its execution.
|
Allocation
|
Max
| ||||
|
X
|
Y
|
Z
|
X
|
Y
|
Z
|
P0
|
0
|
0
|
1
|
8
|
4
|
3
|
P1
|
3
|
2
|
0
|
6
|
2
|
0
|
P2
|
2
|
1
|
1
|
3
|
3
|
3
|
There are 3 units of type X, 2 units of type Y and 2 units of type Z resourses still available.
Consider the following independent request for additional resources in the current state .
REQ1: p0 request 0 units of x, 1 units of y and 1 units of z
REQ2: p1 request 2 units of x, 0 units of y and 0 units of z
Which one of the following is true?
Want instant access to all verified answers on moodle.spit.ac.in?
Get Unlimited Answers To Exam Questions - Install Crowdly Extension Now!