QUESTION 2 Assume that there are : • 3 processes P1, P2, & P3 o 3 Resources R1( two instances), R2 (one instance), & R3 (two instances) And the processes make the requests for resources in the...


QUESTION 2<br>Assume that there are :<br>• 3 processes P1, P2, & P3<br>o 3 Resources R1( two instances), R2 (one instance), & R3 (two instances)<br>And the processes make the requests for resources in the following order:<br>o Pl requests R1<br>o P2 requests R2<br>o Pl requests R2<br>o P3 request R3<br>• P3 Request R2<br>o P2 request R3<br>Draw the resource allocation graph and find whether deadlock exists? Justify your answer.<br>

Extracted text: QUESTION 2 Assume that there are : • 3 processes P1, P2, & P3 o 3 Resources R1( two instances), R2 (one instance), & R3 (two instances) And the processes make the requests for resources in the following order: o Pl requests R1 o P2 requests R2 o Pl requests R2 o P3 request R3 • P3 Request R2 o P2 request R3 Draw the resource allocation graph and find whether deadlock exists? Justify your answer.

Jun 09, 2022
SOLUTION.PDF
SOLUTION.PDF

Get Answer To This Question

Related Questions & Answers

More Questions »

Submit New Assignment

Copy and Paste Your Assignment Here
Have files?