We are here with you hands in hands to facilitate your learning & don't appreciate the idea of copying or replicating solutions. Read More>>
+ Link For Assignments, GDBs & Online Quizzes Solution
+ Link For Past Papers, Solved MCQs, Short Notes & More
Dear Students! Share your Assignments / GDBs / Quizzes files as you receive in your LMS, So it can be discussed/solved timely. Add Discussion
How to Add New Discussion in Study Group ? Step By Step Guide Click Here.
Question: (5 marks each).
In below graphs (a) and (b), find out that in which of them deadlock get occur. Also elaborate that how many processes and resources are being included in part (a) and part (b), also tell that which resources are currently hold (own) and which one are currently being waited.
Showthe sequences of resources that are currently in Hold or in Wait state
NOTE:Do not put any query on MDB about this assignment, if you have any query then firstname.lastname@example.org
See Attach File
.+ http://bit.ly/vucodes (Link for Assignments, GDBs & Online Quizzes Solution)
+ http://bit.ly/papersvu (Link for Past Papers, Solved MCQs, Short Notes & More)+ Click Here to Search (Looking For something at vustudents.ning.com?) + Click Here To Join (Our facebook study Group)
please tell me about where we start i did not understand
any one tell me complete procedure
abeera if you understand this assignment then tell me
Agr itni easy hai to solution post kr do?
Zeshan Anwar sahi kaha !
A process have a resource and waiting for that resource which is hold by some other process which is also waiting for some other
resource is called deadlock
it is very easy assi absolute solution is done by M Tariq the solution is absolutely accurate
graph (a) me bhi deadlock hai na. D-->T-->E-->V-->G-->U-->D
no graph A ma deadlock ni because it does not fullfill 4 condition
There is a cycle in graph A...
which shows the dead
Saira is right, there is also a deadlock in Graph (a). The right side of Graph (a) has a Cycle and all four conditions are true for that Cycle. Left side of Graph (a) does not have a cycle.