GATE | CS 2022 | Question 39

Let R_i(z) and W_i(z) denote read and write operations on a data element z by a transaction T_i, respectively. Consider the schedule S with four transactions. 

S: R₄(x)R₂(x)R₃(x)R₁(y)W₁(y)W₂(x)W₃(y)R₄(y) 

Which one of the following serial schedules is conflict equivalent to S?

(A)

(B)

(C)

(D)

Answer:(A)
Explanation:

The precedence graph of the given schedule will be:

The serial schedule possible for the given graph will be:

Quiz of this Question
Please comment below if you find anything wrong in the above post