Aspire's Library

A Place for Latest Exam wise Questions, Videos, Previous Year Papers,
Study Stuff for MCA Examinations - NIMCET

Previous Year Question (PYQs)

A computer has six tape drives with $n$ processes competing for them. Each process may need two drives. What is the maximum value of $n$ for the system to be deadlock free?




Solution

Total tape drives are

$6$

Each process may need maximum $2$ tape drives.

For deadlock free condition:

$R \ge n(m-1)+1$

Here,

$R=6$ and $m=2$

So,

$6 \ge n(2-1)+1$

$6 \ge n+1$

$n \le 5$

Therefore, maximum value of $n$ is

$5$


Online Test Series,
Information About Examination,
Syllabus, Notification
and More.

Click Here to
View More

Online Test Series,
Information About Examination,
Syllabus, Notification
and More.

Click Here to
View More
Ask Your Question or Put Your Review.

loading...