Question 1:

Consider a system with four processes and four resources as follows:

P is a set of processes as P= {P1, P2, P3, P4}

R is a set of resources as R= {R1, R2}

R1 and R2 have two instances.

The Snapshot at time T0 has the following situation:

P1 allocates an instance of R1 while requesting an instance of R2.

P2 allocates an instance of R1 while requesting an instance of R2.

P3 allocates an instance of R2 while requesting an instance of R1.

P4 allocates an instance of R2 while requesting an instance of R2.

1- Draw the resource allocation graph.

2- Is there a cycle in the graph? If yes, determine it.

3- Is the system in deadlock? Show your work and explain your answer.

Question 2:

Consider a system with three processes and four resources as follows:

P is a set of processes as P= {P1, P2, P3}

R is a set of resources as R= {R1, R2, R3}

All resources in the system have one instances.

The Snapshot at time T0 has the following situation:

P1 allocates an instance of R1 and requests an instance of R2, and R3.

P2 allocates an instance of R2, and requests an instance of R1 and R3.

P3 allocates an instance of R3, and requests an instance of R2 and R3.

1- Draw the resource allocation graph and corresponding wait-for graph?

2- Detect if the system in the deadlock state? If yes, explain why.