CameraIcon

SearchIcon

MyQuestionIcon

1

You visited us 1 times! Enjoying our articles? Unlock Full Access!

System Model

There are res...

Question

There are resources in system, n processes & k is the requirement of each process. Which of the following condition must be satisfied so that deadlock free operation is guaranteed with minimum number of resources?

A

n k - n + 1 \leq r

Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses

B

n k - n + 1 \geq r

No worries! We‘ve got your back. Try BYJU‘S free classes today!

C

n k + 1 \leq r

No worries! We‘ve got your back. Try BYJU‘S free classes today!

D

n k + 1 \geq r

No worries! We‘ve got your back. Try BYJU‘S free classes today!

Open in App

Solution

The correct option is A $n k - n + 1 \leq r$
In worst case deadlock happens if every process is short of 1 resource & we have no extra resource left to fulfill anyone's requirement i.e. $n (k - 1) = r$ may cause the deadlock.
To guarantee deadlock free operation we should have 1 extra
resource.
$∴$ The condition should be: $n (k - 1) + 1 \leq r$ i.e. $n k - n + 1 \leq r$ .

Suggest Corrections

thumbs-up

0

Similar questions

Q. Consider three processes having maximum requirement of resource type R is 5, 4 and 6. The minimum instance of R in the system so that system must be deadlock free is _____

Q. Consider 3 concurrent processes X, Y & Z which request resources in the order given in options. There are total 5 resources

R_{1}

R_{5}

. If process do not get resource, it waits till it becomes available. Once process completes, it release all resources it has. Which of the following guarantees deadlock free operation?

Q. An operating system contains 3 user processes each requiring 2 units of resource R. The minimum number of units of r such that no deadlocks will ever arise is

Q. Suppose n processes,

P_{1}, . . . . P_{n}

share m identical resource units, which can be reserved and released one at a time. The maximum resource requirement of process

P_{i} i s s_{p}

s_{i} > 0

. Which one of the following is a sufficient condition for ensuring that deadlock does not occur?

Q. Consider a system with 29 resources. There are n processes whose demand for resources increases by 1 after every 5 seconds. All processes arrive at same time & starts with demand as 1, 2, 3 etc. For example,

P_{1}

puts demand as 1,

P_{2}

puts as 2, & so on. Processes releases the resources only at termination. How many maximum number of processes we can have to ensure no deadlock, if every process requires 2 2 seconds for execution is ____

View More

Join BYJU'S Learning Program

similar_icon

Related Videos

lock

System Model

OTHER

Watch in App

explore_more_icon

Explore more

Join BYJU'S Learning Program

CrossIcon