Teaching Haryana (HPSC) Assistant Professor Mock Test 2025 DBMS Transaction Serializability of Schedules
Consider the following schedules for transactions T1, T2 and T3
|
T1 |
T2 |
T3 |
|
Read (X) |
|
|
|
|
Read (Y) |
|
|
|
|
Ready (Y) |
|
|
Write (Y) |
|
|
Write (X) |
|
|
|
|
|
Write (X) |
|
|
Read (X) |
|
|
|
Write (X) |
|
The correct schedule of serialization will be
1
T1 → T2 → T3
2
T2 → T3 → T1
3
T3 → T1 → T2
4
T1 → T3 → T2
5
Question Not Attempted