Recent questions tagged deadlock-prevention-avoidance-detection

Consider the resource allocation graph below consisting of four tasks $(\text{T1}$, $\text{T2}$, $\text{T3}$, and $\text{T4})$ and three resources $(\text{R1}$, $\text{R2...

A system contains three distinct critical resources: $R_1,R_2,R_3$ shared by four processes.Their resource requirements are:$P_1$ requires $R_1$ and $R_2$.$P_2$ requires ...

In a multiprocessor system with preemptive scheduling, three processes $P_1,P_2,P_3$ share resources $R_1,R_2,R_3$.$P_1$ and $P_2$ compete for $R_1$. $P_2$ and $P_3$ comp...

In the wait-for graph for transactions $A$ through $G$ shown below, which option lists all transactions that are in a permanent waiting state?Here, an edge $X \to Y$ in t...

Four processes have the following state:$$\begin{array}{c@{\qquad\qquad}c}\textit{Current Allocation} & \textit{Current Request} \\ \begin{array}{|c|cc|}\hline\text{Proce...

Suppose system $S_1$ uses a deadlock avoidance method, whereas system $S_2$ uses a deadlock detection method.Consider the following statements:$S_1$ restricts the order i...

Consider the following statements concerning deadlocks:Deadlock prevention is based on identifying a sufficient condition for deadlock and designing resource-allocation a...

Consider the following statements about deadlock:A deadlock can be resolved by taking resources away from one or more processes. Deadlock-prevention techniques can guaran...

There are four processes $A,B,C,D$ that perform their processing by exclusively acquiring three resources $X,Y,Z$.As execution proceeds, each process acquires the three r...

A banking system has one exclusive lock $L_i$ for every account $i$. A transfer from account $x$ to account $y$ requires both $L_x$ and $L_y$ to be held simultaneously.Tr...

Consider the following deadlock-prevention policies:Impose a global ordering on resource types and permit a process to request resources only in increasing order. If a pr...

A system has four processes $P_1,P_2,P_3,P_4$ and three resource types:$R_1: 3$ instances$R_2: 2$ instances$R_3: 2$ instancesThe current allocation and outstanding reques...

A system contains exactly four identical instances of a resource.Consider the following two independent configurations.Configuration IThere are two processes, and each pr...

A system contains three processes $P_1,P_2,P_3$ and two resources $R_1,R_2$. Each resource has exactly one instance.The current state is:$P_1$ holds $R_1$ and is waiting ...

Two processes $P_0$ and $P_1$ share two binary locks $L_1$ and $L_2$. Consider the following three independent programs.$\begin{array}{|c|c|c|}\hline\text{Program I} & \t...

With respect to deadlocks in an operating system, which of the following statements is/are FALSE?Banker's algorithm is used to prevent deadlocksDeadlock formation can be ...

Consider a system consisting of $k$ instances of a resource $R$, being shared by $5$ processes. Assume that each process requires a maximum of two instances of resource $...

A system has $5$ processes and $k$ instances of a resource $R$. Assume each process requires a maximum of $2$ instances of $R$. A process can request or release only one...

With respect to deadlocks in an operating system, which of the following statements is/are false?An assignment edge in a resource allocation graph is marked from a proces...