Question

Consider schedules S3, S4, and S5 below. Determine whether each schedule is

strict, cascadeless, recoverable, or nonrecoverable. (Determine the strictest
recoverability condition that each schedule satisfies.)
S3: r1 (X); r2 (Z); r1 (Z); r3 (X); r3 (Y); w1 (X); c1; w3 (Y); c3; r2 (Y); w2 (Z);
w2 (Y); c2;
S4: r1 (X); r2 (Z); r1 (Z); r3 (X); r3 (Y); w1 (X); w3 (Y); r2 (Y); w2 (Z); w2 (Y); c1;
c2; c3;
S5: r1 (X); r2 (Z); r3 (X); r1 (Z); r2 (Y); r3 (Y); w1 (X); c1; w2 (Z); w3 (Y); w2 (Y);
c3; c2;

Answer 1

A schedule is strict if it satisfies the following conditions:

Tj reads a data item X after Ti has written to X and Ti is terminated means aborted or committed.

Tj writes a data item X after Ti has written to X and Ti is terminated means aborted or committed.

Step-by-step explanation:

See attached image