Register

NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 15

• edited by
1,047 views
2 votes
2 votes

Consider a system having $’m’$ resources of the same type. These resources are shared by $3$ processes $A,B,C;$ which have peak time demands of $3,4,6$ respectively. The minimum value of $’m’$ that ensures that deadlock will never occur is

  1. $11$
  2. $12$
  3. $13$
  4. $14$
• edited by
User Avatar

2 Answers

2 votes
2 votes

SO ANS IS: A

DEADLOCK WILL NOT HAPPEN AFTER 11 AND HIGHER THAN 11 VALUE. 

SO ANS IS 11 

User Avatar
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1.0k
views
2 answers
1 votes
admin asked Apr 1, 2020
1,003 views
NIELIT 2017 OCT Scientific Assistant A (IT) - Section C: 5
Assume transaction $A$ holds a shared lock $R.$ If transaction $B$ also requests for a shared lock on $R.$ It willresult in deadlock situationimmediately be grantedimmediately be rejectedbe granted as soon as it is released by $A$
User Avatar
3.5k
views
2 answers
3 votes
admin asked Apr 1, 2020
3,548 views
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 9
Which of the following scheduling algorithms could result in starvation?PriorityRound RobinFCFSNone of the above
User Avatar
978
views
2 answers
0 votes
admin asked Apr 1, 2020
978 views
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 23
Which two are valid constructions for Thread?Thread(Runnable r, String name)Thread()Thread(int priority)Thread(Runnable r, ThreadGroup g)Thread(Runnable r, int priority) $1$ and $3$2$ and $4$1$ and $2$2$ and $5$
User Avatar
1.8k
views
2 answers
2 votes
admin asked Apr 1, 2020
1,802 views
NIELIT 2017 OCT Scientific Assistant A (IT) - Section C: 10
The address sequence generated by tracing a particular program executing in a pure demand paging system with $100$ records per page, with $1$ free main memory frame is recorded as ... $6,4$7,2$4,6$
User Avatar
Link Copied!