Q22

A computer system uses the Banker’s Algorithm to deal with deadlocks. Its current state is shown in the table below, where $P0$, $P1$, $P2$ are processes, and $R0$, $R1$, $R2$ are resources types.

$$\overset{\Large{\text{Maximum Need}}}{\begin{array}{|l|ll|} \hline & R{0} & R{1} & R{2} \\\hline P{0} & 4 & 1 & 2 \\ P{1} & 1 & 5 & 1 \\ P{2} & 1 & 2 & 3 \\\hline \end{array}}\quad \qquad \overset{\Large{\text{Current Allocation}}}{\begin{array}{|l|lll|} \hline & R{0} & R{1} & R{2} \\\hline P{0} & 1 & 0 & 2 \\ P{1} & 0 & 3 & 1 \\ P{2} & 1 & 0 & 2 \\\hline \end{array}} \qquad \quad \overset{\Large{\text{Available}}}{\begin{array}{|lll|} \hline R{0} & R{1} & R{2} \\\hline 2 & 2 & 0 \\\hline \end{array}}$$