To prevent deadlock by eliminating the 'Circular Wait' condition, which scheme is implemented?
Option B is correct. Assigning a global integer index F(R) to each resource type and enforcing that resources are requested in strictly ascending order invalidates the Circular Wait condition.
In deadlock recovery via process termination, which strategy minimizes system execution cost loss?
Option D is correct. Aborting one process at a time and re-running the deadlock detection algorithm minimizes unnecessary process loss compared to aborting all processes.
What is a 'Safe State' in deadlock avoidance?
Option C is correct. A state is safe if the system can allocate resources to each process (up to its maximum) in some order and still avoid a deadlock (i.e., a safe sequence exists).
Which graph reduction method is used to detect deadlocks in systems where resources have single instances?
Option A is correct. For single-instance resource systems, the Resource Allocation Graph is collapsed into a Wait-For Graph (WFG) where nodes are processes. A cycle in WFG indicates deadlock.
What major issue can arise when selecting a process victim for resource preemption during deadlock recovery?
Option B is correct. If victim selection is based purely on cost, the same process may always be picked as a victim, leading to Starvation. Rollback counts must be factored in to prevent starvation.