MyQuestionIcon

2

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

System Model

Consider thre...

Question

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 _____

A

17

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

B

15

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

C

11

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

D

13

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

Open in App

Solution

The correct option is D 13
Minimum instance of R = (5-1)+(4-1)+(6-1)+1
= 13

Suggest Corrections

thumbs-up

0

Similar questions

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. Consider a system having 'm' resource of the same type. The resources are shared by 3 processes P, Q, R which have peak time demands 5, 6, 8 respectively. The minimum value of 'm' that ensures the deadlock will never occur is

Q. In a system, there are three types of resources: E, F and G. Four processes

P_{0}, P_{1}, P_{2} a n d P_{3}

execute concurrently. At the outset, the processes have declared their maximum resource requirements using a matrix named Max as given below. For example Max

[P_{2} . F]

is the maximum number of instances of F that

P_{2}

would require. The number of instances of the resources allocated to the various processes at any given state is given by a matri named Allocation.
Consider a state of the system with the Allocation matrix as shown below and in which 3 instances of E and 3 of F are the only resources available.

Allocation
	E	F	G
$P_{0}$	1	0	1
$P_{1}$	1	1	2
$P_{2}$	1	0	3
$P_{3}$	2	0	0

Max
	E	F	G
$P_{0}$	4	3	1
$P_{1}$	2	1	4
$P_{2}$	1	3	3
$P_{3}$	5	4	1

From the perspecitve of deadlock avoidance, which one of the following is true?

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. Consider the following snapshot of a system running n processes. Process i is holding

x_{i}

instances of a resource R, for 1

\leq i \leq

n. Courrently, all instances of R are occupied. Further, for all i, process i has placed a request for an additional

y_{i}

instances while holding the

x_{i}

instances it already has. There are exactly two processes p and q such that

y_{p} = y_{q} = 0

. Which one of the following can serve as a necessary condition to guarantee that the system is not approaching a deadlock?

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