Labs 3 - Schedule types and properties. ======================================= Solve the following exercises. (1) Is the following schedule conflict serializable? Draw a precedence graph to verify. T1: T2: T3: write(X) write(Y) read(Y) write(Z) read(Z) COMMIT COMMIT COMMIT (2) Is the following schedule conflict serializable? Draw a precedence graph to verify. T1: T2: T3: write(X) read(X) write(X) write(X) COMMIT read(X) COMMIT COMMIT (3) Show the commit order for the following schedule such that the schedule is recoverable. Is it possible to insert commits into the schedule such that the schedule avoids cascading aborts? T1: T2: T3: T4: write(X) read(X) read(X) write(X) read(X) read(X) (4) Consider the following schedule. Add all granted locks and lock requests according to two-phase locking. Is there a deadlock? If yes, how can it be resolved? T1: T2: T3: read(X) write(X) read(X) write(X) write(X)