adplus-dvertising
frame-decoration

Question

With a single resource, deadlock occurs

a.

if there are more than two processes competing for that resource

b.

if there are only two processes competing for that resource

c.

if there is a single process competing for that resource

d.

none of these

Answer: (d).none of these

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. With a single resource, deadlock occurs

Similar Questions

Discover Related MCQs

Q. A state is safe if the system can allocate resources to each process (up to its maximum) in some order and still avoid deadlock. Then

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. 'm' processes share 'n' resources of the same type. The maximum need of each process doesn't exceed 'n' and the sum all the their maximum needs is always less than m + n. In this set up

Q. Consider a system having 'm' resources of the same type. These resources are shared by 3 processes A, B, C, which have peak time demands of 3, 4, 6 respectively. The minimum value of 'm' that ensures that deadlock will never occur is

Q. The methods for dealing with the deadlock problem is

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

Q. A process said to be in ___________ state if it was waiting for an event that will never occur.

Q. In one of the deadlock prevention methods, impose a total ordering of all resource types, and require that each process requests resources in an increasing order of enumeration. This violates the _______________ condition of deadlock.

Q. Resource locking ________.

Q. A set of resources' allocations such that the system can allocate resources to each process in some order, and still avoid a deadlock is called ________.

Q. Situations where two or more processes are reading or writing some shared data and the final results depends on the order of usage of the shared data, are called ________.

Q. When two or more processes attempt to access the same resource a _________ occurs.

Q. A process is starved

Q. Let S and Q be two semaphores initialized to 1, where P0 and P1 processes the following statements wait(S);wait(Q); ---; signal(S);signal(Q) and wait(Q); wait(S);---;signal(Q);signal(S); respectively. The above situation depicts a _________ .

Q. The state of a process after it encounters an I/O instruction is __________.

Q. The Banker's algorithm is used

Q. ______ is a high level abstraction over Semaphore.

Q. In one of the deadlock prevention methods, impose a total ordering of all resource types, and require that each process requests resources in an increasing order of enumeration. This voilates the _______________ condition of deadlock.

Q. Banker's algorithm for resource allocation deals with ?

Q. What is the maximum number of processes that may enter simultaneously inside the critical section to avoid race condition ?