Register

Tricky question: How a deadlock is detected from wait for graph?

894 views
1 votes
1 votes
There are multiple copies of resources are available in a system. A process can request for more than one copy of a resource. Suppose a process will be blocked till at least one copy of resource is granted, what is the sufficient condition to detect a deadlock from wait for graph of the system?

a) A cycle is present in WFG.

b) A knot is present in WFG.

c) Both a and b can be the conditions and equally powerful.

d) Both a and b can be failed in given conditions in problem
User Avatar

1 Answer

Best answer
2 votes
2 votes

This is a OR request model , according to the conditions given .

Even if cycle is present , it does not suffices for a deadlock, hence , knot(strongly connected subgraph ) is a sufficient condition for deadlock.

option B) is correct.

• selected by
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

2 votes
2 votes
0 answers
1
dragonball asked Jan 10, 2018
727 views
Wait For Graph
Is WFG in Syllabus. If Yes, How to convert RAG into WFG .Or How WFG is used for deadlock detection only . Plz explain in detail.
Is WFG in Syllabus. If Yes, How to convert RAG into WFG .Or How WFG is used for deadlock detection only . Plz explain in detail.
User Avatar
1 votes
1 votes
4 answers
3
Purple asked Jan 29, 2016
7,809 views
Which of the following is not a necessary condition for a deadlock among processes?
Which of the following is not a necessary condition for a deadlock among processes? (a) Shared Resources (b) No Preemption (c) Acyclic condition among processes (d) None of the above
Which of the following is not a necessary condition for a deadlock among processes?(a) Shared Resources(b) No Preemption(c) Acyclic condition among processes(d) None of t...
User Avatar
3 votes
3 votes
4 answers
4
agoh asked Dec 11, 2016
1,138 views
If there is deadlock possible, is it correct to conclude that progress and bounded wait will be violated?
My doubt is as follows: If deadlock is there, processes will be busy waiting in wait loop. So, decision on which process enters C.S. is not made in finite time. Hence, is...
User Avatar
Link Copied!