Consider a system consisting of four resources of the same type (i.e., four instances of one type of resource) that are shared by three processes, each of which needs at most two resources. Show that the system is deadlock free.
Expert Answer
Yes, undoubtedly this system is deadlock-free.
the Proof by contradiction. Suppose the system is deadlocked. This implies that each process is holding one resource and is waiting for one more. Since there are three processes and four resources, one process must be able to obtain two resources. This process requires no more resources and, therefore it will return its resources when done.