Question 7: Serializability . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . [12 points] Check True or False for each of the following statements. (a) [1 point] 2 T 2 F The definition of serializability allows many different correct schedules for any set of more than one concurrently executing transactions. (b) [1 point] 2 T 2 F If each of the transactions in a schedule preserve the databases consistency, then every serializable schedule of those transactions also preserves consis- tency. (c) [2 points] 2 T 2 F A schedule with exactly one transaction is always conflict- equivalent to a serial schedule. (d) [2 points] 2 T 2 F All schedules that avoid cascading aborts are view-serializable. (e) [2 points] 2 T 2 F All view-serializable schedules are conflict-serializable. (f) [1 point] 2 T 2 F Every conflict-serializable schedule is always conflict-equivalent to at least one view-serializable schedule. (g) [1 point] 2 T 2 F A schedule is conflict serializable if and only if its dependency graph is acyclic. (h) [1 point] 2 T 2 F All schedules that avoid cascading aborts are recoverable. (i) [1 point] 2 T 2 F All schedules that avoid cascading aborts are conflict-serializable

Question 7: Serializability [12 points ] Check 'T'rue or 'F'alse for each of the following statements. (a) [1 point] TF The definition of serializability allows many different correct schedules for any set of more than one concurrently executing transactions. (b) [1 point] TF If each of the transactions in a schedule preserve the database's consistency, then every serializable schedule of those transactions also preserves consistency. (c) [2 points] TF A schedule with exactly one transaction is always conflictequivalent to a serial schedule. (d) [2 points] TF All schedules that avoid cascading aborts are view-serializable. (e) [2 points] TF All view-serializable schedules are conflict-serializable. (f) [1 point] TF Every conflict-serializable schedule is always conflict-equivalent to at least one view-serializable schedule. (g) [1 point] TF A schedule is conflict serializable if and only if its dependency graph is acyclic. (h) [1 point] TF All schedules that avoid cascading aborts are recoverable. (i) [1 point] TF All schedules that avoid cascading aborts are conflict-serializable