333 views
0 votes
0 votes
Consider the transactions T1, T2, T3 with the following schedule S:

S : T1: Read (x); T2: Read (z); T1:Read(z);

    T3:Read(x);T3:Read(y); T1:Write(x);

    T3:Write (y);T2:Read(y);

     T2:Write(z); T2:Write(y)

If the schedule S is serializable, the equivalent serial schedule is ____.

iam getting T3-T1-T2 after  drawing precendence graph  but answer given T3-T2-T1

Please log in or register to answer this question.

Related questions

0 votes
0 votes
1 answer
1
Harsh Saini_1 asked Dec 27, 2023
334 views
How many total $Conflict$ $Serializable$ $Schedules$ are possible that can be formed by $T1$ and $T2?$$T1:$ $r_1(A)$ $r_1(B)$ $w_1(B)$$T2:$ $r_2(B)$ $r_2(A)$ $w_2(B)$
0 votes
0 votes
1 answer
3
abhinowKatore asked Sep 8, 2022
257 views
If a schedule is not conflict-serializable. Is it serializable?
0 votes
0 votes
1 answer
4
sambey4 asked Oct 16, 2021
304 views
Find Total no of conflict serializable and view serializableT1: R1(A) W1(A) R1(B) W1(B)T2: R2(A) W2(A) R2(B) W2(B)