325 views

1 Answer

1 votes
1 votes
if bankers algorithm cannot lead to a safe sequence, then the state of syestem is surely deadlocked ,no matter how many instances of a single resource exist

Related questions

3.0k
views
3 answers
0 votes
mobashshir asked Aug 15, 2018
3,021 views
Assume a system with four resource types, C=(6,4,4,2), andthe maximum claim table below. The resource allocator isconsidering allocating resources according to the ... 1 FIND WHETHER STATE IS SAFE OR NOTa-safeb-unsafec-deadlock
1.4k
views
2 answers
1 votes
Pankaj Joshi asked Nov 29, 2016
1,403 views
Consider the following system snapshotWhich of the following is a safe sequence?P1, P3, P0, P4, P2P3, P1, P4, P0, P2P3, P4, P1, P0, P2All of theseMy question is how can the need of p3 can be satisfied first when C available is 0
1.8k
views
3 answers
3 votes
Rakesh K asked Oct 30, 2016
1,800 views
Which of the following is true?S1: If there is a cycle in RAG then there will be a deadlockS2: If there is a cycle in RAG where all the resources are havinng single instance then ... only(B) S2 & S4 only(C) S1 & S4 only(D) S1, S3 & S4 only
1.1k
views
1 answers
2 votes
aambazinga asked Dec 24, 2018
1,118 views
is there deadlock in the concurrent execution of two thread given below?void laurel() { lock_acquire(mutex); /* do something */ ... not getting any deadlock. please comment below if you find any.*Idon't have answer.