0 votes 0 votes A schedule $S: T_1 Read(x);$ $T_2: Write(x); T_2:Write(y); T_3: Write(y);T_1$ $Write(y); T_1: commit; T_2:commit; T_3:commit$ The above schedule is_________. View serializable conflict serializable recoverable not serializable `JEET asked Dec 27, 2018 `JEET 458 views answer comment Share Follow See all 7 Comments See all 7 7 Comments reply Show 4 previous comments `JEET commented Dec 27, 2018 reply Follow Share Yes, (D) is the answer. 0 votes 0 votes Swapnil Naik commented Dec 27, 2018 reply Follow Share It is not conflict serializable as there is a cycle, if T2 failed to commit then we can't rollback changes as T1 has already committed. So it is not recoverable. How to determine if schedule is not serializable? Also as there is blind write in T2 schedule may or may not be view serializable, how to determine view serializibility? 0 votes 0 votes Nilabja Sarkar commented Dec 27, 2018 reply Follow Share yes see there is blind write there and the final write is in T1 so it finish last which make a cycle 0 votes 0 votes Please log in or register to add a comment.