Question

Consider the schedule S: R1(

  • A ; W2(
  • A ; R1(
  • A , involving transactions T1 and T2. Is this schedule conflict serializable?
  • B ; W2(
  • B ; W1(
A No, the precedence graph contains a cycle between T1 and T2
B Yes, equivalent to the serial order T1 followed by T2
C Yes, equivalent to the serial order T2 followed by T1
D Cannot be determined without knowing the lock table
E Yes, both serial orders T1-T2 and T2-T1 are valid
Practice Next

Hey! Ask a query

🎓
Think You're Ready for RBI Grade B?
RBI Grade B 2026 Phase 1 Memory Based Paper
  • 200 Questions with Detailed Solutions
  • Section-wise Coverage (GA, English, Quant & Reasoning)