ans 16?

The Gateway to Computer Science Excellence

0 votes

Suppose $10$ processes $P_1$ to $P_{10}$ share $7$ identical resource units which can be reserved and release $1$ at a time the maximum resource requirement of a processs $P_i$ is $S_P$ where $S_P$ is greater then $0$. The maximum value of

$S_i\left(\displaystyle{\sum_{i=1}^{10}S_P}\right)$ that ensures deadlock does not occurs is ________ .

$S_i\left(\displaystyle{\sum_{i=1}^{10}S_P}\right)$ that ensures deadlock does not occurs is ________ .

+1 vote

Best answer

**See the logic is suppose there are N process with each max demand D$_{di}$ ,then to avoid deadlock give all process D$_{di}$ -1 resource +1( resource to avoid deadlock) got it? not then think why it will not lead to deadlock.**

**So,$\sum_{i=0}^{i=n}di$ - n +1= 7**

**Solving it will give total demand as 16.**

- All categories
- General Aptitude 1.8k
- Engineering Mathematics 7.4k
- Digital Logic 2.9k
- Programming and DS 4.9k
- Algorithms 4.4k
- Theory of Computation 6.2k
- Compiler Design 2.1k
- Databases 4.1k
- CO and Architecture 3.4k
- Computer Networks 4.1k
- Non GATE 1.4k
- Others 1.7k
- Admissions 595
- Exam Queries 576
- Tier 1 Placement Questions 23
- Job Queries 72
- Projects 17

50,666 questions

56,157 answers

193,767 comments

93,740 users