The resource allocation graph is not applicable to a resource allocation system

Related MCQs

• If no cycle exists in the resource allocation graph                          
• The wait-for graph is a deadlock detection algorithm that is applicable when
• By operating system, the resource management can be done via
• Every time a request for allocation cannot be granted immediately, the detection algorithm is invoked. This will help identify
• In contiguous memory allocation
• An edge from process Pi to Pj in a wait for graph indicates that                          
• If the wait for graph contains a cycle
• If the wait for graph contains a cycle :
• What is a reusable resource?
• If we preempt a resource from a process, the process cannot continue with its normal execution and it must be