The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
53 views
Let there are 10 resources in the system and every process can demand maximum 4 and minimum 2 resources of the same type then what is the minimum and the maximum number of processes in a system such that system is deadlock-free in which all resources are busy.

A. 2 & 5

B. 3 & 9

C. 4 & 9

D. 3 & 5
asked in Operating System by Junior (895 points) | 53 views
0
B should be answer??

1 Answer

+1 vote

Answer is B

If each required at max 4 resources then by giving 3-3-3 resources each to 3 process and 1 remaining to anyone will simply make this system deadlock free.

If each process required min 2 resources than by giving 1 resource to each 9 processes and remaining 1 resource to any process will satisfy its need and system will be deadlock free.

Hence minimum processes = 3, maximum processes  = 9

If you need formula then

MD = max demand -1  = 4-1 = 3

MN = min demand -1 = 2-1 =1

for min number of processes = ceil(Resources/MD) -1 = ceil (10/3) - 1 = 4-1 =3

for max number of processes = ceil (Resources/MN) -1 = ceil(10/1) -1 = 10-1 =9

answered by Boss (17.9k points)

Related questions



Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

39,715 questions
46,750 answers
140,560 comments
58,403 users