Register

UGC NET CSE | December 2018 | Part 2 | Question: 70

• recategorized by
2,441 views
0 votes
0 votes

​​​​​​​Suppose a system has $12$ instances of some resource with $n$ processes competing for that resource. Each process may require $4$ instances of the resources. The maximum value of $n$ for which the system never enters into deadlock is

  1. $3$
  2. $4$
  3. $5$
  4. $6$
• recategorized by
User Avatar

1 Answer

0 votes
0 votes
Let every process acquired 3 resources now we need 1 more resource to complete one of them so that system will not face deadlock

3n+1<=12

3n<=11

n<=3.66

n=3

option (A)
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
6 answers
1
Arjun asked Jan 2, 2019
3,040 views
UGC NET CSE | December 2018 | Part 2 | Question: 18
Consider a disk pack with $32$ surfaces, $64$ tracks and $512$ sectors per pack. $256$ bytes of data are stored in a bit serial manner in a sector. The number of bits required to specify a particular sector in the disk is $18$ $19$ $20$ $22$
Consider a disk pack with $32$ surfaces, $64$ tracks and $512$ sectors per pack. $256$ bytes of data are stored in a bit serial manner in a sector. The number of bits req...
User Avatar
1 votes
1 votes
2 answers
4
Arjun asked Jan 2, 2019
3,118 views
UGC NET CSE | December 2018 | Part 2 | Question: 73
Consider the following set of processes and the length of CPU burst time given in milliseconds : ... -Robin Scheduling Algorithm with time quantum $4$ ms. Then the waiting time for $P_4$ is ______ ms $0$ $4$ $12$ $6$
​​​​​​​Consider the following set of processes and the length of CPU burst time given in milliseconds :$\begin{array}{|c|c|} \hline \text{Process} & \text{...
User Avatar
Link Copied!