0 votes 0 votes i think answer is b but given is d. arch asked Nov 7, 2017 reopened Nov 7, 2017 by arch arch 390 views answer comment Share Follow See all 4 Comments See all 4 4 Comments reply Ashwani Kumar 2 commented Nov 7, 2017 reply Follow Share Why according to you it is not strict? 0 votes 0 votes akshat sharma commented Nov 7, 2017 reply Follow Share after commit Transaction should Read(x),Write(x) so therefore it is not strict check This Out https://www.youtube.com/watch?v=xr3uVgKdmj4 0 votes 0 votes arch commented Nov 7, 2017 reply Follow Share Strict Schedule A Schedule, in which a transaction neither read or write a data item X until the last transaction that has written X is committed or aborted. t1 is writing the data item written by t2 and t2 comit after t1 write the data. 1 votes 1 votes Habibkhan commented Nov 7, 2017 reply Follow Share It is not strict schedule..If this were the schedule : R1(X) , R2(X) , W2(X) , Commit(T2) , W1(X) , Commit(T1)..It would have been strict schedule.. 2 votes 2 votes Please log in or register to add a comment.
0 votes 0 votes 1) Given schedule is not serializable because of CYCLE : R1(X)------->W2(X) W1(X)<--------W2(X) 2) A schedule is strict if: W1(A) COMMIT W2(A)/R2(A) COMMIT hence, given schedule is strict. Akash Mittal answered Nov 7, 2017 Akash Mittal comment Share Follow See all 0 reply Please log in or register to add a comment.