Deadlock: Conditions and Graphs
Deadlock defined and separated from starvation and livelock; the four necessary conditions; the resource-allocation graph and the wait-for graph, and why a cycle means deadlock only with single-instance resources, with a figure of a cycle that is not a deadlock; prevention by breaking each condition, including resource ordering; the four handling strategies; and the minimum number of resource units that makes deadlock impossible, checked by brute force, with the solved GATE CS 2026 Set 1 Q.35.
