Bissoy.com
Doctors Medicines MCQs Q&A

A system shares 9 tape drives. The current allocation and maximum requirement of tape drives for three processes are shown below: Process Current Allocation Maximum Requirement P1 3 7 P2 1 6 P3 3 5   Which of the following best describes current state of the system?

A system shares 9 tape drives. The current allocation and maximum requirement of tape drives for three processes are shown below: Process Current Allocation Maximum Requirement P1 3 7 P2 1 6 P3 3 5   Which of the following best describes current state of the system? Correct Answer Safe, Not Deadlocked

Resource allocation table:

Process

Current Allocation

Maximum Requirement

Need
(Maximum-current)

P1

3

7

4

P2

1

6

5

P3

3

5

2


Available = 9 – ∑ (current allocation to process) = 9 – 7 = 2

Now, 2 resource will satisfy the need of P3.

After this available = 2 + 3 = 5

5 resource can satisfy need of P2 or P1

CASE 1:

If P2 is executed before P1, 

Available = 5 + 1 =6

6 resource can satisfy the need of P1 easily.

CASE 2:

If P1 is executed before P2

Available = 5 + 3 = 8

8 resource can satisfy the need of P1 easily.

Safe sequence will be P3, P1, P2 and P3, P2, P1

System is safe and there is no deadlock in the system.

Related Questions

In a system, there are three types of resources and four processes that execute concurrently. At the outset, the processes have declared their maximum resource requirements using a matrix named Max as given below. For example, Max[ ] is the maximum number of instances of that would require. The number of instances of the resources allocated to the various processes at any given state is given by a matrix named Allocation. Consider a state of the system with the Allocation matrix as shown below, and in which 3 instances of E and 3 instances of F are the only resources available. Allocation   E F G P0 1 0 1 P1 1 1 2 P2 1 0 3 P3 2 0 0   Max   E F G P0 4 3 1 P1 2 1 4 P2 1 3 3 P3 5 4 1   From the perspective of deadlock avoidance, which one of the following is true?
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.   Allocation Max   X Y Z X Y Z P0 0 0 1 8 4 3 P1 3 2 0 6 2 0 P2 2 1 1 3 3 3   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 Z REQ2: P1 requests 2 units of X, 0 units of Y and 0 units of Z Which one of the following is TRUE?
Kripal starts driving from his home and drives 37 km towards south. From there he turns left and drives 31 km. Then he turns right and drives 27 km. Then he turns left and drives a certain distance of Y km. After than, he turns left and drives 57 km. Now he finally turn left and drives 58 km to reach a bank, which is exactly 7 km south of his home. Find the value of Y in Km.
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?
If there are a total of T = 100 shares to be divided among three processes, A, B and C. A is assigned 50 shares, B is assigned 15 shares and C is assigned 20 shares. If a new process D requested 30 shares, the admission controller would __________
A bank employee drives 10 km towards South from her house and turns to her left and drives another 20 km. She again turns left and drives 40 km, then she turns to her right and drives for another 5 km. She again turns to her right and drives another 30 km to reach her bank where she works. What is the shortest distance between her bank and her house ?
Which of the following are true? (i) A programming language option does not permit global variables of any king and has no nesting of procedures/functions, but permits recursion can be implemented with static storage allocation (ii) Multi-level access link (or display) arrangement is needed to arrange activation records-only if the programming language being implemented has nesting of procedures/function (iii) Recursion in programming languages cannot be implemented with dynamic storage allocation (iv) Nesting of procedures/functions and recursion require a dynamic heap allocation scheme and cannot be implemented with a stack-based allocation scheme for activation records (v) Languages which permit a function to return a function as its result cannot be implemented with a stack-based storage allocation scheme for activation records.
In the question below, a passage is given followed by three courses of actions numbered I, II and III. On the basis of the information given, you have to assume everything in the statement to be true, and then decide which of the following suggested courses of actions logically follow(s) for pursuing. Passage: The board of Vedanta Ltd Limited on Monday approved a proposal for delisting of the company and will seek shareholders approval for the process through e-Voting, the company informed the exchanges. The company has proposed to buy 48.9% shares at Rs 87.5 apiece whereas the book value of the company is around Rs. 141 per share. Retail investors hold 7% of the total shares whereas Institutional Investors hold 41.9% of the total shares. Minimum 90% of shareholders should approve the de-listing for it to happen. The scrip closed today at Rs.110, down 4% from the previous close. Courses of action: I. Vedanta must cajole Institutional shareholders to approve the de-listing. II. Institutional Investors must seek a better deal from the company and vote out this proposal as it is below both the market price and book value. III. Retail investors must come together and complain to the exchanges regarding the company’s attempt to force them out of their shares.
A certain computation generates two arrays a and b such that a[i]=f(i) for 0 ≤ i < n and b[i] = g (a[i] ) for 0 ≤ i < n. Suppose this computation is decomposed into two concurrent processes X and Y such that X computes the array a and Y computes the array b. The processes employ two binary semaphores R and S, both initialized to zero. The array a is shared by the two processes. The structures of the processes are shown below. Process X: private i; for (i=0; i
If there are a total of T = 100 shares to be divided among three processes, A, B and C. A is assigned 50 shares, B is assigned 15 shares and C is assigned 20 shares. A will have ______ percent of the total processor time.