Computer Science, asked by anjali1stmay, 2 months ago

Consider the schedule S: r1(x),r3(y),r3(x),w1(x),c1,w2(y),r2(x),w3(y),c2,c3
Check whether the given schedule is conflict-serializable or not. Explain how.

Answers

Answered by vishalydv1161
0

Answer:

Explanation: Schedule is not recoverable, not cascadeless and not conflict serializable

Similar questions