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 :$

A computer system has 6 tape drives, with ‚Äö√Ñ√∂‚àö√

1.	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 :$
A.	2
B.	3
C.	4
D.	1
Answer» B. 3

Discussion

No Comment Found

Related MCQs

An operating system contains 3 user processes each requiring 2 units of resource R. The minimum number of units of such that no deadlock will ever occur is:
A system has 6 identical resources and N processes competing for them. Each process can request at most 2 resources. Which one of the following values of N could lead to a deadlock?
Consider the following two-process synchronization solution.Process 0- - - - - - - -Entry: loop while (turn == 1); (critical section)Exit: turn = 1;Process 1- - - - - - - -Entry: loop while (turn == 0); (critical section)Exit: turn = 0; The shared variable turn is initialized to zero. Which one of the following is TRUE?
Consider the procedure below for the Producer-Consumer problem which uses semaphores:semaphore n = 0;semaphore s = 1; void producer(){while(true){produce();semWait(s);addToBuffer();semSignal(s);semSignal(n);}} void consumer(){ while(true) { semWait(s); semWait(n); removeFromBuffer(); semSignal(s); consume(); }} Which one of the following is TRUE?
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
An aid to determine the deadlock occurrence is
A multithreaded program P executes with x number of threads used y number of locks for ensuring mutual exclusion while operating on shared memory locations. All locks in the program are non-re-entrant. i.e. if a thread holds a lock l, then it cannot re-acquire lock l without releasing it. If a thread is unable to acquire a lock, it blocks until the lock becomes available. The minimum value of x and the minimum value of y together for which execution of p can result in a deadlock are:
Consider the following snapshot of a system running n concurrent processes. Process i is holding Xi instances of a resource R, 1 ≤ i ≤ n. Assume that all instances of R are currently in use. Further, for all i, process i can place a request for at most Yi additional instances of R while holding the Xi instances it already has. Of the n processes, there are exactly two processes p and q such that Yp = Yq = 0. Which one of the following conditions guarantees that no other process apart from p and q can complete execution?
Given a set of four, two resources with two units, each. The following resources allocation graph exits at a point in time:The graph indicates:
An operating system uses the Banker’s algorithm for deadlock avoidance when managing the allocation of three resource types X, Y, and Z to three processes P0, P1, and P2. The table given below presents the current system state. Here, the Allocation matrix shows the current number of resources of each type allocated to each process and the Max matrix shows the maximum number of resources of each type required by each process during its execution. AllocationMax XYZXYZP0001843P1320620P2211333 There are 3 units of type X, 2 units of type Y and 2 units of type Z still available. The system is currently in a safe state. Consider the following independent requests for additional resources in the current state:REQ1: P0 requests 0 units of X, 0 units of Y and 2 units of ZREQ2: P1 requests 2 units of X, 0 units of Y and 0 units of ZWhich one of the following is TRUE?

Discussion

No Comment Found

Related MCQs

Reply to Comment