Question

Consider the schedule S: R1(

  • A , R2(
  • A , W1(
  • A , W2(
  • A , where Ri and Wi denote read and write by transaction Ti. Which statement about S is correct?
A It is conflict serializable and equivalent to the serial order T1 → T2
B It is not conflict serializable, because the precedence graph has a cycle between T1 and T2
C It is conflict serializable and equivalent to the serial order T2 → T1
D It is conflict serializable because both transactions access only one data item
E It is not conflict serializable because the schedule has no write–write conflict
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)