In a deadlock, processes never finish implementing and system resources are tied up, preventing other jobs from starting. Deadlocks can be typified by set of situations.
problem 1: Illustrate out the four (4) indispensable situations which should hold simultaneously in system for the deadlock situation to start.
problem 2: One way of handling deadlock conditions is by using the deadlock-avoidance algorithm: suppose that the system always need additional information about how resources are being requested for each process before making the decision on whether to grant request or not to grant the request. One possible reason for not granting the request is since it can put the system in the unsafe state.
What is the differentiation between the safe state and the unsafe state in the deadlock-avoidance system?