Register

GO Classes DPP | OS | DEADLOCK

395 views
3 3 votes

A computer system contains $\mathbf{10}$ IDENTICAL MAGNETIC TAPE DRIVES. There are $N$ processes currently running in the system, and each process has a MAXIMUM NEED of $\mathbf{3}$ DRIVES to complete its execution.

What is the SMALLEST VALUE of $N$ such that the system could potentially enter a DEADLOCK state?

  1. $4$
     
  2. $5$
     
  3. $6$
     
  4. $11$

3 Answers

0 0 votes

So what we got here 

system containing 10 identical magnetic tape drivers +N processes running in the system+maximum need for each process is 3 drivers 
question: smallest value of  n that can cause deadlock

Solution

we can use the hold and wait concept to imagine a procees will complete if it has 3 resources so lets hold with 3-1=2

so 5*2=10 and we have no more resources this lead to deadlock 
so the Answer is 5

Voting & Accepting an answer helps improve the community
Answer:
← Previous · GO Classes DPP | PYT...Next → · GO Classes DPP | OS ...
← Previous in category · GO Classes DPP | OS ...Next in category → · GO Classes DPP | OS ...
Position:
Show:

Related questions

5 5 votes
3 3 answers
386
386 views
GO Classes asked Jan 2
386 views
GO Classes DPP | OS | PAGING
Consider a computer system with $\mathbf{2 5 6 ~ M B}$ of PHYSICAL MEMORY and a $\mathbf{40-}$bit VIRTUAL ADDRESS SPACE. The system utilizes a paging scheme where the PAG...
3 3 votes
2 2 answers
341
341 views
GO Classes asked Jan 2
341 views
GO Classes DPP | OS | SEMAPHORE
Consider a NON-NEGATIVE COUNTING SEMAPHORE $S$. The operation $P(S)$ (wait) attempts to decrement $S$, and the operation $V(S)$ (signal) increments $S$. A process executi...
1 1 vote
2 2 answers
347
347 views
GO Classes asked Jan 2
347 views
GO Classes DPP | OS | RAG
A system consists of four active processes $P=\left\{P_1, P_2, P_3, P_4\right\}$ and four distinct singleinstance resource types $R=\left\{R_1, R_2, R_3, R_4\right\}$. Th...
3 3 votes
2 2 answers
285
285 views
GO Classes asked Jan 2
285 views
GO Classes DPP | OS | BANKER’S ALGO
A system manages $\mathbf{12}$ IDENTICAL PRINTING UNITS. There are three processes $(P_1, P_2, P_3)$ currently utilizing these units. The current state of the system is d...