Question 29

• Option (A) is FALSE: Banker's algorithm is a deadlock avoidance algorithm (which dynamically checks for safe states using maximum resource claims), whereas deadlock prevention statically invalidates one of the four necessary Coffman conditions.
• Option (B) is TRUE: Disallowing the hold-and-wait condition prevents deadlocks.
• Option (C) is FALSE: In a Resource Allocation Graph, an assignment (allocation) edge is directed from a resource to a process ($R_j \rightarrow P_i$), whereas a request edge is directed from a process to a resource ($P_i \rightarrow R_j$).
• Option (D) is TRUE: By definition, a safe state has a safe sequence in which all processes can run to completion without deadlocking.

Since the question asks which statements are FALSE, (A) and (C) are correct.