Sonali Asked a Question
September 29, 2020 3:42 pmpts 10 pts
dllows Consider two transactions T, and T, which form schedules S S, S, and S, as fll Q. T, R.A], W,[A], W.[B] T RA. RB]. W [B S,: R.A), RA], R,[B]. W,A), W,[B], W,B] S: R.[AJ, R[A], R[B], W,[A]. W.B], W.[B] S,: RA]. R,[A], R[B]. W,[A]. w.B], W.[B] R,AI WLAI RA] w.[B] R[B] W.B] Which of the above is conflict serializable? Sol. (B) Only S,, S S S (A) Only S, (C) S, & S (D) Sol. (C) T T T T S S, r(A) R(A) r(A) R(A) r(B) Q R(B) WA) WA) WB) WB) W(B)
  • 1 Answer(s)
  • Shares
  • Komal bhati Best Answer
    detailed explanation.. hope you got it..
    • cropped1366354635017658025.jpg
    • cropped1605869455258342469.jpg
    Likes(0) Reply(0)
Head Office :
MPA 44, 2nd floor, Rangbari Main Road,
Mahaveer Nagar II, Kota (Raj.) – 324005

Corporate Office:
212, F-1, 2nd Floor, Evershine Tower,
Amrapali Marg,
Vaishali Nagar, Jaipur (Raj.) – 302021

All Rights Reserved ©