in Operating System edited by
547 views
0 votes
0 votes

in Operating System edited by
547 views

4 Comments

C) p3?
0
0
0
0
p1->p2->p3
0
0
how it is possible ????p1->p2>p3>  ....we can't allocate to anyone a/c to me and is d) ......please explain how it possible
0
0

2 Answers

0 votes
0 votes
(d)none of these
0 votes
0 votes

 

          Request     Allocated    Needed

   R1    R2   R3  R1     R2   R3  R1    R2    R3
P1  2      1      0  1        0     0    1       1     0
P2  1      3      2   0        1     1   1       2     1 
P3   0      0      2   0        0     1   0       0     1

 

After Above allocations, system has R1,R2 and R3 has 2,3 and 2 instances available Respectively.

So all available resources can be used......

 Using FCFS : First complete process P1 then P2 and in last  P3.

 

 

Related questions