While reading this solved quiz on concurrency control, I got stuck on exercise 2, which reads as follows:
2) Consider the following schedule:
S: r1(X), w2(X), r3(X), r1(Y), w2(Z), r3(Y), w3(Z), w1(Y)
(a) (2 points) Draw the precedence graph.
(b) (1 point) Is S conflict serializable?
After reading that S is not conflict-serializable, my question is: can we say that S is serializable? Any suggestions?
Thanks to anyone who help me.