Operating Syste...

Consider a system having 'N' resources of the same type. X, Y and Z are the three processes that shared the resource. The peak demand of X, Y and Z are 5, 11, and 9 respectively. What is the maximum value of 'N' to ensures the system is in deadlock?

The total number of instances of a resource is 11. Four processes A, B, C, and D are present in the system. The allocation table of the resources is given below. 

Which of the following orders of process execution forms a deadlock-free sequence?

Which of the below-given statement is/are true?

1. Deadlock is waiting for a resource from a process that will never release it resource.
2. Banker’s Algorithm is used to avoid deadlock in a system.

Consider a system in which there are P processes. A₁, A₂, … A_P is the processes that share K identical resource units, which can be reserved and release at a time. The peak requirement per process is X_i. Which of the following condition is necessary to say that the system is in deadlock state?(Assume X_i > 0)

An operating system uses the Banker’s algorithm for deadlock avoidance when managing the allocation of three resource types A, B, and C to four processes P0, P1, P2, and P3.

Which of the following statements are True?

I. All unsafe states are deadlocks.

II. A deadlock-avoidance algorithm dynamically examines the resource-allocation state to ensure that a circular-wait condition can never exist.

III. To eliminate deadlock if a process and resources are selected for preemption on the basis of cost leads to starvation.

In a computer system, 28 processes are present and they share R resources of the same type. Each process can request a maximum of 5 resources. What is the minimum value of R such that no deadlock occurs?

An operating system uses the banker's algorithm for deadlock avoidance to manage the allocation of four resources A, B, C, and D. The table given below represents the current system state.

There are 3 units of type B, 2 units of type D still available. Which of the following sequence is a safe sequence?

Which of the following is/are not true about the deadlock scheme?

I.  In deadlock avoidance, number the resource uniquely and never requests a lower-numbered resource

II. In deadlock avoidance, the request for the resources is always granted if the resulting state is safe.

III. In deadlock prevention, never request a resource after releasing any resource.