What is the equivalent serial schedule for the following transactions? T1 T2…
2011
What is the equivalent serial schedule for the following transactions?
T1 T2 T3
R(Y)
R(Z)
R(X)
W(X)
W(Y)
W(Z)
W(Z)
R(Y)
W(Y)
R(Y)
W(Y)
R(X)
W(X) - A.
T1 − T2 − T3
- B.
T3 − T1 − T2
- C.
T2 − T1 − T3
- D.
T1 − T3 − T2
Attempted by 182 students.
Show answer & explanation
Correct answer: B
To determine the equivalent serial schedule, we analyze the precedence graph based on conflicting operations between transactions.
1. Identify Operations: T1 performs R(X), W(X). T2 performs R(Y), R(Z), W(Y), W(Z). T3 performs W(Z), R(Y), W(Y), R(X), W(X).
2. Analyze Conflicts: T1 writes X before T3 reads/writes X, creating edge T1 → T3. T2 writes Z and Y before T3 accesses them, creating edge T2 → T3.
3. Graph Analysis: There are no conflicts between T1 and T2. The graph has edges T1 → T3 and T2 → T3 with no cycles.
4. Serial Order: A valid topological sort is T1 → T2 → T3.
A video solution is available for this question — log in and enroll to watch it.