Consider the following schedule S: w2 (A), r1 (B), r2 (A) w2 (B), r3 (A), w1…
Consider the following schedule S: w2 (A), r1 (B), r2 (A) w2 (B), r3 (A), w1 (B), w3 (A), r2 (B) How many minimum number of moves (where a move consists of changing the position of one of the operations) are required to convert S into a conflict serializable schedule?
Attempted by 14 students.
Sign up free to check your answer
Sign up freeLoading lesson…

