PART - C
16. Consider the following schedules. The actions are listed in the order they are
scheduled, and prefixed with the transaction name. (15)
S1: T2:R(Z), T2:R(Y), T2:W(Y), T3:R(Y), T3:R(Z), T1:R(X),T1:W(X), T3:W(Y), T3:W(Z),
T2:R(X), T1:R(Y) , T1:W(Y), T2:W(X)
S2: T3:R(Y), T3:R(Z), T1:R(X), T1:W(X), T3:W(Y), T3:W(Z), T2:R(Z), T1:R(Y),T1:W(Y),
T2:R(Y), T2:W(Y), T2:R(X), T2:W(X)
For each of the schedules, answer the following questions:
(i) What is the precedence graph for the schedule?
(ii) Is the schedule conflict-serializable? If so, what are all the conflict
equivalent serial schedules?
(iii) Is the schedule view-serializable? If so, what are all the view
equivalent serial schedules?\
tharun_extinct
tharun_extinct
tharun_extinct
17. Consider the following schedules. The actions are listed in the order they are
Scheduled (15)
S1: R1(X), R3(X), W1(X), R2(X), W3(X)
S2: R3(X), R2(X), W3(X), R1(X), W1(X)
For each of the schedules, answer the following questions:
What is the precedence graph for the schedule?
(ii) Which of the following are conflict serializable schedule , Find the
equivalent serial schedule
tharun_extinct
tharun_extinct
18. Which of the following schedules is conflict serializable? For each serializable
schedule determine the equivalent serial schedules. (15)
(a) R1(X) , R3(X), W1(X), R2(X), W3(X)
(b) R1(X), R3(X), W3(X), W1(X), R2(X)
(c) R3(X), R2(X), W3(X), R1(X), W1(X)
(d) R3(X), R2(X), R1(X), W3(X), W1(X)