1. Consider the following schedule:
SCHEDULE: r1(P), w2(P), r3(P), r1(Q), r4(R), w2(Q), r1(S), w3(S), r4(S), w4(Q), w5(Q), w5(R)
Is this given schedule conflict serializable? If yes, prepare a precedence graph and write the order of execution for transactions.
Answers
Answered by
0
Answer:
make a graph bro
Explanation:
mark as brainlist
Similar questions