Recoverability
A recoverable schedule is one where, for each pair of Transaction Ti and Tj such that Tj reads data item previously written by Ti the commit operation of Ti appears before the commit operation Tj .
Cascadeless Schedule
Formally, a cascadeless schedule is one where for each pair of transaction Ti and Tj such that Tj reads data item, previously written by Ti the commit operation of Ti appears before the read operation of Tj .
Strict
A schedule is strict - has the strictness property - if for any two transactions T1, T2, if a write operation of T1 precedes a conflicting operation of T2 (either read or write), then the commit event of T1 also precedes that conflicting operation of T2.
here w(y) of T3 happens before r(y) of T2
and commit operation c3 is before the read operation of T2.
So, it is cascadeless schedule
And we know Every Cascadeless schedule is also recoverable schedule.
it is also irrecoverable and no chance for cascadeless
it is cascadeless and recoverable. Because it is not violating any rule of cascadeless or recoverable
S1- cascadeless recoverable and strict
S2- cascading irrecoverable
S3- cascadeless recoverable