Bissoy.com
Doctors Medicines MCQs Q&A

Given a priori information about the ________ number of resources of each type that maybe requested for each process, it is possible to construct an algorithm that ensures that the system will never enter a deadlock state.

Given a priori information about the ________ number of resources of each type that maybe requested for each process, it is possible to construct an algorithm that ensures that the system will never enter a deadlock state. Correct Answer maximum

Related Questions

Consider the following policies for preventing deadlock in a system with mutually exclusive resources. I. Processes should acquire all their resources at the beginning of execution. If any resource is not available, all resources acquired so far are released II. The resources are numbered uniquely, and processes are allowed to request for resources only in increasing resource numbers III. The resources are numbered uniquely, and processes are allowed to request for resources only in decreasing resource numbers IV. The resources are numbered uniquely. A process is allowed to request only for a resource with resource number larger than its currently held resources Which of the above policies can be used for preventing deadlock?
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?
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?
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
What is the minimum number of resources required to ensure that deadlock will never occur, if there are currently three processes P1, P2, and P3 running in a system whose maximum demand for the resources of the same type are 3, 4, and 5 respectively?
Which of the following is the correct matching of different resources and their characteristics? A. Non-renewable Resources (i)  get renewed or replenished quickly B.  Actual Resources (ii)  whose quantity is known C.  Renewable Resources (iii)  whose entity quantity may not be known. D.  Potential Resources (iv)  have limited stock
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?
In a database system, unique timestamps are assigned to each transaction using Lamport’s logical clock. Let TS(T1) and TS(T2) be the timestamps of transactions T1 and T2 respectively. Besides, T1 holds a lock on the resource R, and T2 has requested a conflicting lock on the same resource R. The following algorithm is used to prevent deadlocks in the database system assuming that a killed transaction is restarted with the same timestamp. If TS(T2) < TS(T1) then T1 is killed else T2 waits. Assume any transaction that is not killed terminates eventually. Which of the following is TRUE about the database system that uses the above algorithm to prevent deadlocks?
Each question presents a situation and asks you to make a judgement regarding that particular circumstance. Choose an answer based on given information. Divya and Sham are two employees of XYZ bank. Each of them has to count the number of notes which are collected, at the end of the day. Both of them count the number of notes and then enter them in the system of the bank. Due to some error the numbering was not matching. Each of them knows that the number of notes is in 5-digit number. 1. Divya and Sham agrees that all the digits were prime number. 2. Both agree that 1st and last digit was same. 3. Both agrees that the 3rd digit was 5. 4. Both agrees that 4th digit from left was 7. Which of the following would be most likely the number of notes?
There are two rows, each containing 3 numbers. Below are some rules to be used to get the resultant number for each row separately. Use the rule from left to right for each row and find the answer to the question. Rule: 1. If an even number is followed by an even number, then the first number will be subtracted from the second. 2. If an odd number is followed by an odd number, then both will be added. 3. If an odd number is followed by an even number, then the even number will be subtracted from the square of the odd number. 4. If an even number is followed by an odd number, then the odd number will be subtracted from the even number. Row I: 9,11, 34 Row II: 16, 9, 8 What is the difference between the resultant numbers in the first row and the second row