Description
The Part 2 will be out on coming Thursday..
Q1[10 points]. Create the precedence graph for the schedule: w1(X), r1(X), w2(Y), r3(X), w1(Y),
w(X). Based on the graph, determine whether the schedule is conflict-serializable.
1
Q2[10 points]. What is the difference between serializable and conflict-serializable schedule. What is the relation between the two (is one of them a subset of the other)?
Q3[10 points]. Consider the following schedule:
r1(A);r2(B);???;w1(C);w2(A);
What value for ??? will make the schedule not conflict-serializable. Give one such possible value.
Q4[20 points]. Consider the transactions T and T.
1 2
T: r(A); w(A); r(B); w(B);
1 1 1 1 1
T : r(B); w(B); r(A); w(A);
2 2 2 2 2
Give an example of a conflict-serializable schedule and non conflict-serializable schedule for the eight actions.
Q5[20 points]. Are the following schedules conflict-serializable?
|
|
|
|
|
|
|
a) r1(A); w1(B); r2(B); w2(C); r3(C); w3(A); |
||||
|
|
|
|
|
|
b) w3(A); r1(A); w1(B); r2(B); w2(C); r3(C);
Submission
Please submit your work as a PDF file to polylearn OR hand in your work to me in person (you can do so on the final exam’s day).
