Register

Deadlock

1,667 views
1 1 vote
A computer has six tape drivers, with n processes competing for them. Each process may need two drivers. What is the maximum value of n for the system to be deadlock free?

a] 6

b] 5

c] 4

d] 3

3 Answers

1 1 vote
Without any deadlock we can have 5 processes bcz we can allocate resources(2,1,1,1,1) for processes so that one process gets finished followed by other
0 0 votes

No. of user * No. of resource req.  < No. of user + available resource

N * 2 < N+6

N<6  so, N=5,

Voting & Accepting an answer helps improve the community
← Previous · process-scheduleNext → · In how many ways 5 b...
← Previous in category · process-scheduleNext in category → · MadeEasy Test Series...
Position:
Show:

Related questions

3 3 votes
1 1 answer
157
157 views
GO Classes asked Aug 26
157 views
GO Classes DPP | GATE CS | Operating System | Deadlock Resource Graph
Consider the resource allocation graph below consisting of four tasks $(\text{T1}$, $\text{T2}$, $\text{T3}$, and $\text{T4})$ and three resources $(\text{R1}$, $\text{R2...
3 3 votes
1 1 answer
123
123 views
GO Classes asked Aug 21
123 views
GO Classes DPP | GATE CS | Operating System | Preemptible Resource Deadlock
In a multiprocessor system with preemptive scheduling, three processes $P_1,P_2,P_3$ share resources $R_1,R_2,R_3$.$P_1$ and $P_2$ compete for $R_1$. $P_2$ and $P_3$ comp...
2 2 votes
1 1 answer
154
154 views
GO Classes asked Aug 21
154 views
GO Classes DPP | GATE CS | Operating System | Deadlock Detection Trace
Four processes have the following state:$$\begin{array}{c@{\qquad\qquad}c}\textit{Current Allocation} & \textit{Current Request} \\ \begin{array}{|c|cc|}\hline\text{Proce...
2 2 votes
1 1 answer
139
139 views
GO Classes asked Aug 21
139 views
GO Classes DPP | GATE CS | Operating System | Deadlock Avoidance vs Detection
Suppose system $S_1$ uses a deadlock avoidance method, whereas system $S_2$ uses a deadlock detection method.Consider the following statements:$S_1$ restricts the order i...