retagged by
1,126 views
0 votes
0 votes

A system has $3$ processes sharing $4$ resources. If each process needs a maximum of $2$ units then, deadlock

  1. Can never occur
  2. Has to occur
  3. May occur
  4. None of the options 
retagged by

3 Answers

0 votes
0 votes
Min requirement of all processes is 3x1 + 1=4 which is not exceeding the available number of resources, which is 4 in the system, and therefore satisfies the necessary & condition for deadlock-free execution, hence option A is right
0 votes
0 votes

 

If the system is deadlocked, it implies that each process is holding one resource and is waiting for one more. Since there are 3 processes and 4 resources, one process must be able to obtain two resources. This process requires no more resources and therefore it will return its resources when done.

Hence,Option(A)deadlock can never occur.

Answer:

Related questions

0 votes
0 votes
4 answers
1
admin asked Mar 30, 2020
2,457 views
Consider the following four processes with their corresponding arrival time and burst time:$$\begin{array} \text{Process}&\text{Arrival time}&\text{Burst time(in ms)}\\ \...
1 votes
1 votes
2 answers
2
admin asked Mar 30, 2020
3,198 views
Which of the following is added to the page table in order to track whether a page of cache has been modified since it was read from the memory?Reference bitDirty bitTag ...
0 votes
0 votes
2 answers
3
0 votes
0 votes
2 answers
4
admin asked Mar 30, 2020
1,919 views
The total number of page faults for the reference string $1,2,3,4,5,6,7,8,9,10$ using FIFO page replacement policy for a process, if $3$ frames are allocated to it are$9$...