retagged by
414 views

1 Answer

0 votes
0 votes

there is cycle in graph so definetly not conflict. there is blind write on Y so we have to check for view serializibility .

it also not view serializable because initial read it done b by T1 so it should be at first place but also T1 also does final write on Y so it should also come at last place . due to contadiction scheduling is not possible here

option D

Related questions

0 votes
0 votes
1 answer
1
atulcse asked Nov 2, 2021
459 views
Can a schedule be serializable if it is not view serializable? Are conflict equivalence and view equivalence the only two ways to decide if a schedule is serializable?
1 votes
1 votes
1 answer
2
2 votes
2 votes
1 answer
3