Description
file
Unformatted Attachment Preview
Purchase answer to see full attachment
Explanation & Answer
Hi bro. Here is it.
CMP626 Assign 3:
Questions 5.1, 5.2 and 5.3 from text book
5.1 Check the serializability of each one of the following schedules:
S1 = R1(X), R2(X), R3(X), W1(X), W3(X)
S2 = R2(X), R1(Y), W3(X), W2(X)
S3 = W1(X), R2(X), W3(X), W2(X)
S4 = R1(X), R3(X), R2(X), W2(Y), W3(X)
S5 = R3(X), W1(X), R1(X), W2(X)
Indicate all RW, WR, and WW conflicts and show all partial commitment orders forced by
these conflicts. Indicate if the schedule is serializable. If it is, what is the total commitment
order? If it is not, indicate the first operation that causes the problem.
Answer
S1 = R1(X), R2(X), R3(X), W1(X), W3(X)
This has to be not serializable because it has cycles.
There is a schedule for it and has (WW) conflict.
S2 = R2(X), R1(Y), W3(X), W2(X)
This has to be not serializable because it has cycles.
There is...