Question

A system has m resources: $R_0,R_1.....R_{m-1}$ & n concurrent processes $P_0,P_1...P_{n-1}$. The implementation of resource request logic of each process $P_i$, is as follows
$\{{\text{Request R}}_{\left[\right(tmodm\left)\right]}$
${\text{Request R}}_{\left[\right(t-2\left)modm\right]}$
$\}$
If first resource is not available, process waits till it becomes available & then only request next.
Which of the following statement is TRUE?

Answer 1

Deadlock is possible when m = 4 & n > 2
$P_0$ : Requests $R_0$ & $R_2$
$P_1$ : Requests $R_1$ & $R_3$
$P_2$ :Requests $R_2$ & $R_0$
If $R_0$ is granted to $P_0$ & $R_2$ is granted to $P_2$, $P_0$ waits for $R_2$ & $P_2$waits for $R_0$