Computer Sciences > Gate 2022 > Transaction
Let Ri(z) and Wi(z) denote read and write operations on a data element z by a transaction Ti, respectively. Consider the schedule S with four transactions.

S: R4(x)R2(x)R3(x)R1(y)W1(y)W2(x)W3(y)R4(y)

Which one of the following serial schedules is conflict equivalent to S?
A
T1→T3→T4→T2
B
T1→T4→T3→T2
C
T4→T1→T3→T2
D
T3→T1→T4→T2

Correct : a

Related Topics

No tags found

Unique Visitor Count

Total Unique Visitors

Loading......