GATEverse
← GATE CSE 2018

Q39

MCQ2 marks, −0.67

In a system, there are three types of resources: E,FE, F and GG. Four processes P0P_0, P1P_1, P2P_2 and P3P_3 execute concurrently. At the outset, the processes have declared their maximum resource requirements using a matrix named Max as given below. For example, Max[P2,FP_2, F] is the maximum number of instances of FF that P2P_2 would require. The number of instances of the resources allocated to the various processes at any given state is given by a matrix named Allocation. Consider a state of the system with the Allocation matrix as shown below, and in which 33 instances of EE and 33 instances of FF are only resources available.

AllocationEFGP0101P1112P2103P3200MaxEFGP0431P1214P2133P3541\begin{array}{|l|}\hline \textbf{Allocation} \\\hline & \text{E} & \text{F} & \text{G} \\\hline \text{$P_0$} & \text{1} & \text{0} & \text{1} \\\hline \text{$P_1$} & \text{1} & \text{1} & \text{2}\\\hline \text{$P_2$} & \text{1} & \text{0} & \text{3}\\\hline \text{$P_3$} & \text{2} & \text{0} & \text{0}\\\hline \end{array} \begin{array}{|l|}\hline \textbf{Max} \\\hline & \text{E} & \text{F} & \text{G} \\\hline \text{$P_0$} & \text{4} & \text{3} & \text{1} \\\hline \text{$P_1$} & \text{2} & \text{1} & \text{4}\\\hline \text{$P_2$} & \text{1} & \text{3} & \text{3}\\\hline \text{$P_3$} & \text{5} & \text{4} & \text{1}\\\hline \end{array}

From the perspective of deadlock avoidance, which one of the following is true?

Sign in to save attempts.

Loading…