a) Given the following schedule for the transactions T1, T2 and T3 representing read operation and...

Transcribed Image Text:

a) Given the following schedule for the transactions T1, T2 and T3â representing read operation and W() representing write operation. Draw the Conflict Precedence Graph and verify if it is conflict serializable or not. Justify your answer. (4 marks) T1 X=1080 R(X) X=X-450 W(X) T1 R(X) X=1080 W(X) Failure Commit T2 b) Consider the following schedules S1 and S2 with read, write, and commit operations in transactions T1 and T2 on data X. Identify if the schedule is recoverable, irrecoverable, or recoverable with cascading rollback. Justify your answer. Comment on the rollback operation required for the two schedules. (4 marks) T1 R(X) X=1080 X=X-450 W(X) W(X) Commit Schedule S2 T3 X=X-100 W(X) Schedule $1 T2 R(X) X=X+1000 W(X) Commit T2 R(X) X=X+1000 W(X) Commit a) Given the following schedule for the transactions T1, T2 and T3â representing read operation and W() representing write operation. Draw the Conflict Precedence Graph and verify if it is conflict serializable or not. Justify your answer. (4 marks) T1 X=1080 R(X) X=X-450 W(X) T1 R(X) X=1080 W(X) Failure Commit T2 b) Consider the following schedules S1 and S2 with read, write, and commit operations in transactions T1 and T2 on data X. Identify if the schedule is recoverable, irrecoverable, or recoverable with cascading rollback. Justify your answer. Comment on the rollback operation required for the two schedules. (4 marks) T1 R(X) X=1080 X=X-450 W(X) W(X) Commit Schedule S2 T3 X=X-100 W(X) Schedule $1 T2 R(X) X=X+1000 W(X) Commit T2 R(X) X=X+1000 W(X) Commit

Answer rating: 100% (QA)

Heres how to do it Part 1 Draw the conflict precedence graph Each transaction is represented by a node in the graph There is a directed edge from Ti to Tj if there is a conflict between an operation i... View the full answer