# #Gateapplied

15 views
Consider the following schedule S:

S: R1(X); R2(Z); R1(Z); R3(X); R3(Y); W1(X); W3(Y); R2(Y); W2(Z); W2(Y);

Here Ri(D) denotes that transaction i is reading the data item D while Wi(D) denotes that transaction i is writing the value of data item D. The commit operation of the transaction can be added in the end of schedule S in an appropriate order such that S is recoverable. The number of such orders possible are ______

@eleven11

633 points