Question

Consider the schedule S: r1(

  • A , r2(
  • A , w1(
  • A , w2(
  • A of transactions T1 and T2. Which statement about S is correct?
A S is conflict serializable and equivalent to the serial order T1 -> T2
B S is not conflict serializable because its precedence graph contains a cycle
C S is conflict serializable and equivalent to the serial order T2 -> T1
D S is a serial schedule
E S is conflict serializable because there are no conflicting operations
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)