Consider the schedule
S= T1 : R(x), T1: W(x), T2: R(Y): T2: W(Y), T1:R(Z), T1: W(Z), T2: R(X), T2: W(X)
If the schedule is to be cascadeless and recoverable the commit operation of T1 should appear
A
at any place in the schedule
No worries! We‘ve got your back. Try BYJU‘S free classes today!
B
before T2:R(X)
Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses
C
after T2: Commit
No worries! We‘ve got your back. Try BYJU‘S free classes today!
D
after T1: W(x)
No worries! We‘ve got your back. Try BYJU‘S free classes today!
Open in App
Solution
The correct option is B before T2:R(X) (C)
A schedule is said to be cascadeless and recoverable if Tj reads a data item that was previously written by Ti then Ti should come before T2 read operation.