Deadlock - Graphs,Algorithms

Q.  Choose the correct option regarding deadlock.
- Published on 23 Jun 15

a. If a resource-allocation graph contains no cycles, then no process in the system is deadlocked.
b. If the graph does contain a cycle, then a deadlock may exist.
c. Only A
d. Option A and B are correct.

ANSWER: Option A and B are correct.

Related Content

 

    Discussion

  • Nirja Shah   -Posted on 25 Nov 15
    - Following are a few statements which are true regarding a deadlock:

    - If a resource-allocation graph contains no cycles, then the system is not deadlocked. ( When looking for cycles, remember that these are directed graphs. )

    - A deadlock exists if a resource-allocation graph does contain cycles AND each resource category contains only a single instance.

    - If a resource category contains more than one instance, then the presence of a cycle in the resource-allocation graph indicates the possibility of a deadlock, but does not guarantee one.

➨ Post your comment / Share knowledge


Enter the code shown above:

(Note: If you cannot read the numbers in the above image, reload the page to generate a new one.)
▲