- 1 (25.7 KiB) Viewed 23 times
- 2 (26.7 KiB) Viewed 23 times
- 3 (26.7 KiB) Viewed 23 times
- 4 (26.7 KiB) Viewed 23 times
T: Answer the following questions about transactions T1 and T2 below. Ti: W(A) R(B) R(B) R(A) W(B) W(A) R(A) с с 1. Is the round-robin schedule for TI and T2 (where you alternate operations, starting with Tl) serializable or not? Justify your answer. 2. Convert T1 and T2 into Strict 2PL (independently). 3. Does the round-robin schedule for TI and T2 in Strict 2PL deadlock? If so, draw the waits-for graph; otherwise, draw the serializability graph. 4. Convert Ti and T2 into 2PL with downgrading (independently). 5. Does the round-robin schedule for T1 and T2 in 2PL with downgrading deadlock? If so, draw the waits-for graph; otherwise, draw the serializ- ability graph
T: Answer the following questions about transactions T1 and T2 below. Ti: W(A) R(B) R(B) R(A) W(B) W(A) R(A) с с 1. Is the round-robin schedule for TI and T2 (where you alternate operations, starting with Tl) serializable or not? Justify your answer. 2. Convert T1 and T2 into Strict 2PL (independently). 3. Does the round-robin schedule for TI and T2 in Strict 2PL deadlock? If so, draw the waits-for graph; otherwise, draw the serializability graph. 4. Convert Ti and T2 into 2PL with downgrading (independently). 5. Does the round-robin schedule for T1 and T2 in 2PL with downgrading deadlock? If so, draw the waits-for graph; otherwise, draw the serializ- ability graph