adplus-dvertising
frame-decoration

Question

The resource allocation graph is not applicable to a resource allocation system :

a.

with multiple instances of each resource type

b.

with a single instance of each resource type

c.

single & multiple instance of each resource type

d.

none of the mentioned

Answer: (a).with multiple instances of each resource type

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. The resource allocation graph is not applicable to a resource allocation system :

Similar Questions

Discover Related MCQs

Q. The Banker’s algorithm is _____________ than the resource allocation graph algorithm.

Q. The data structures available in the Banker’s algorithm are :

Q. The content of the matrix Need is :

Q. The wait-for graph is a deadlock detection algorithm that is applicable when :

Q. An edge from process Pi to Pj in a wait for graph indicates that :

Q. If the wait for graph contains a cycle :

Q. If deadlocks occur frequently, the detection algorithm must be invoked ________

Q. The disadvantage of invoking the detection algorithm for every request is :

Q. A deadlock eventually cripples system throughput and will cause the CPU utilization to ______

Q. Every time a request for allocation cannot be granted immediately, the detection algorithm is invoked. This will help identify :

Q. A computer system has 6 tape drives, with ‘n’ processes competing for them. Each process may need 3 tape drives. The maximum value of ‘n’ for which the system is guaranteed to be deadlock free is :

Q. A system has 3 processes sharing 4 resources. If each process needs a maximum of 2 units then, deadlock :

Q. ‘m’ processes share ‘n’ resources of the same type. The maximum need of each process doesn’t exceed ‘n’ and the sum of all their maximum needs is always less than m+n. In this setup, deadlock :

Q. A deadlock can be broken by :

Q. The two ways of aborting processes and eliminating deadlocks are :

Q. Those processes should be aborted on occurrence of a deadlock, the termination of which :

Q. The process to be aborted is chosen on the basis of the following factors :

Q. Cost factors of process termination include :

Q. If we preempt a resource from a process, the process cannot continue with its normal execution and it must be :

Q. To _______ to a safe state, the system needs to keep more information about the states of processes.