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 are required to convert S into conflict serializable schedule?

Attempted by 59 students.

Sign up free to check your answer

Sign up free

Explore the full course: Gate Guidance By Sanchit Sir

Loading lesson…