Computer Science · Operating Systems - Deadlocks

With reference to the Wait-for Graph (WFG) used in deadlock detection, consider the following statements: A. The Wait-for Graph is the standard mechanism used for deadlock detection in systems where resource types have multiple instances available. B. A Wait-for Graph is a simplified version of the Resource Allocation Graph (RAG) that contains only processes as nodes. C. A directed edge from process Pi to process Pj in a Wait-for Graph indicates that Pi is waiting for a resource held by Pj. D. The occurrence of a cycle within a Wait-for Graph is a definitive indicator that a deadlock has occurred in the system. Choose the most appropriate answer from the options given below: