Answer Happy

Question 2. (32 points, 16 points each schedule) Consider schedules S1 and S2. For each schedule answer these questions and complete the following table. (8 points) Is the schedule conflict-serializable? Why? b. (2 points) What is the equivalent serial schedule? (2 points) Could the schedule be produced using 2PL protocol? d (2 points) Could the schedule be produced using strict 2PL protocol? a. c. S1: ΤΙ T2 13 write(C) write(B) read(B) read(C) write(C) read(C) S2: ΤΙ T2 T3 read(C) write(C) write(C) read(B) write(C) Schedule Conflict- serializable Equivalent serial schedule Produced by 2PL Produced by strict 2PL S1 S2 Q2. 15 points for each schedule Wrong graph: -5 Wrong equivalent serial schedule: -2 points Wrong decision of Conflict-serializability: -2 Wrong decision of 2PL/S-2PL: -2