Question

What can you say about a schedule whose precedence graph contains no cycles?

A. The schedule is view serializable.
B. The schedule is conflict serializable.
C. The schedule is recoverable.
D. The schedule avoids cascading rollbacks.

Answer 1

A schedule with a precedence graph containing no cycles is conflict serializable, implying that it can be rearranged into a serial order without violating transaction precedence constraints.

Step-by-step explanation:

If a schedule's precedence graph contains no cycles, it indicates that the schedule is conflict serializable. This quality means that the schedule's operations can be rearranged into some serial order that does not violate the precedence constraints of the transactions involved, ensuring that the schedule's outcome is equivalent to some serial execution of the transactions. The absence of cycles in the precedence graph is a clear indication of conflict serializability because it implies that there is a way to order the transactions without conflicts.