CameraIcon

SearchIcon

MyQuestionIcon

1

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

Deadlock Characterization

An operating ...

Question

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

A

6

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

B

4

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

C

5

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

D

3

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

Open in App

Solution

The correct option is B 4
There are 3 processes, and demands '2' resources. If any one gets equal resources as it's demand, deadlock won't occur, and according to this question 4 resources are enough.

Suggest Corrections

thumbs-up

0

Similar questions

Q. A system contains three programs and each requires three tape units for its operation. The minimum number of tape units which the system must have such that deadlocks never arise is_________.

Q. 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?

Q. An operating system uses the Banker's alogrithm, 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 P1 P2	0 0 1 3 2 0 2 1 1	8 4 3 6 2 0 3 3 3

There are 3 units of type X, 2 units of type Y and 2 uits 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 :
REQ 1: P0 requests 0 units of X, 0 units of Y and 2 units of Z
REQ 2: P1 requests 2 units of X, 0 units of Y and 0 units of Z

Which one of the following is TRUE?

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. 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?

View More

Join BYJU'S Learning Program

similar_icon

Related Videos

lock

Deadlock Characterization

OTHER

Watch in App

explore_more_icon

Explore more

Deadlock Characterization

Join BYJU'S Learning Program

CrossIcon