Teaching Haryana (HPSC) Assistant Professor Mock Test 2025 DBMS Transaction Serializability of Schedules
Consider the following schedule for transactions T1, T2 and T3:
| T1 | T2 | T3 |
| Read(X) | ||
| Read (Y) | ||
| Read (Y) | ||
| Write (Y) | ||
| Write (X) | ||
| Write (X) | ||
| Read (X) | ||
| Write (X) |
Which one of the schedules below is the correct serialization of the above?
1
T1 → T3 → T2
2
T2 → T1 → T3
3
T2 → T3 → T1
4
T3 → T1 → T2
5
Question Not Attempted