Q$\mathrm{.}1$Set. $($A$)$

$($i$)$ Consider the following classes of schedules: serializable, conflict$-$serializable, view$-$serializable, recoverable, avoids$-$cascading$-$aborts, and strict. For each of the following schedules, state which of the preceding classes it belongs to$.$ If you cannot decide whether a schedule belongs in a certain class based on the listed actions, explain briefly. Draw the precedence graph.

a$)$ T$1$:R$($X$),$ T$2$:R$($X$),$ T$1$:W$($X$),$ T$2$:W$($X$)(1$ mark$)$

b$)$ T$1$:W$($X$),$ T$2$:R$($Y$),$ T$1$:R$($Y$),$ T$2$:R$($X$)(1$ mark$)$

c$)$ T$1$:R$($X$),$ T$1$:R$($Y$),$ T$1$:W$($X$),$ T$2$:R$($Y$),$ T$3$:W$($Y$),$ T$1$:W$($X$),$ T$2$:R$($Y$)(2$ marks$)$

d$)$ T$1$:W$($X$),$ T$2$:R$($X$),$ T$1$:W$($X$),$ T$2$:Abort, T$1$:Commit $(1$ mark$)$

$($marks: $5)$

$($ii$)$ Is the following Schedule conflict serializable? Draw Precedence graph.

S: R$3($y$)$ R$3($z$)$ R$1($x$)$ W$1($x$)$ W$3($y$)$ W$3($z$)$ R$2($z$)$ R$1($y$)$ W$1($y$)$ R$2($y$)$ W$2($y$)$ R$2($x$)$ W$2($x$)$

$($marks: $5)$

Total marks: $10$