We can say that a schedule is conflict serializable?
A schedule is conflict serializable if it is conflict-equivalent to some serial schedule.
Two schedules are conflict-equivalent when one can be turned into the other by repeatedly swapping adjacent non-conflicting operations. Operations conflict when they are from different transactions, touch the same data item, and at least one is a write. Conflicting operations can never be swapped, because that would change the result.
Answer: (B)
Reinforce your conceptual grasp with related questions from CUET-MCA 2024:
Take timed full-length mock tests with authentic question distributions, negative marking (+12/-3 in Math), and instant All India Rank calculation.
Start Free Mock Test Series →