00:01
Hello everyone.
00:02
So in this question we have to consider the schedule s3 which is a combination of t1, t2 and t3 and we have to tell that which of the following given statements are true.
00:16
So in the given schedule transactions t1, t2 and t3 here t1, t1, t3 are transactions.
00:35
So in the given schedule transactions t1, t2 and t3 are interleaved in an arbitrary order.
00:41
So to determine whether the schedule is recoverable and conflict serializable, we can draw the precedence graph for the schedule.
00:51
This is our precedence graph.
00:59
Now, in precedence graph, we see that there is a cycle which indicates that the schedule is not conflict.
01:09
We see that there is a cycle.
01:15
So this proves that schedule is not.
01:28
Not conflict serializable...