Eliminating which condition guarantees that a deadlock can NEVER occur?
Option C is correct. Deadlock requires ALL four Coffman conditions to hold simultaneously. Breaking even ONE condition ensures deadlock cannot occur.
What distinguishes Deadlock Avoidance from Deadlock Prevention?
Option D is correct. Deadlock Prevention imposes structural constraints (static rules), while Deadlock Avoidance dynamically assesses system state (safe/unsafe) using advance claim information.
If a system is in an 'Unsafe State', which of the following statements is TRUE?
Option C is correct. An unsafe state is NOT a deadlock state; rather, an unsafe state may lead to a deadlock depending on future process requests.
In a system with 3 processes (P1, P2, P3) each needing maximum 2 units of Resource R. What is the MINIMUM total number of units of R required to guarantee deadlock freedom?
Option C is correct. Formula: Total Resources >= N*(Max_Need - 1) + 1. Here $N=3$, Max_Need=2. Minimum $R = 3 \cdot (2-1) + 1 = 4$ units.
Which hardware/software mechanism is responsible for converting logical (virtual) addresses generated by the CPU into physical RAM addresses?
Option B is correct. The MMU (Memory Management Unit) is the hardware component responsible for mapping virtual addresses generated by the CPU to physical addresses in memory.