Question

A computer science student assigned to work on deadlocks thinks of the following brilliant way to climinate deadlocks when a process. When a process requests a resource, it specifies a time limit. If the process blocks because the time limit is exceeded the process is released and allowed to run again if you were the professor, what grade would give this proposal and why?​

Answer 1

Answer:

The strategy of deadlock prevention is to design the system in such a way that the possibility of deadlock is excluded. Indirect method prevent the occurrence of one of three necessary condition of deadlock i.e., mutual exclusion, no pre-emption and hold and wait. Direct method prevent the occurrence of circular wait.