Consider the following schedule S, consisting of three transactions in a…
Consider the following schedule S, consisting of three transactions in a database system:
S: r1(X), w1(Y), r2(Y), w2(Z), c1, w3(X), c2, c3.
How many edges are there in the precedence graph of the given schedule?
Attempted by 89 students.
Sign up free to check your answer
Sign up freeLoading lesson…

