3 votes 3 votes Find number of conflict serializable schedule for the following transaction T1: R1(a)w1(a)R1(b)w1(b) T2: R2(a)w2(a)R2(b)w2(b) Plzz help me ...how to solve these questions... Surya Dhanraj asked Aug 30, 2017 Surya Dhanraj 719 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply Shubhanshu commented Aug 31, 2017 reply Follow Share is it 12?? 0 votes 0 votes Surya Dhanraj commented Aug 31, 2017 reply Follow Share Yes , please help me out ...how to these type of questions.... 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes https://www.youtube.com/watch?v=3iK2vmOe0j4 Abhisek Das answered Aug 31, 2017 Abhisek Das comment Share Follow See all 2 Comments See all 2 2 Comments reply Surya Dhanraj commented Aug 31, 2017 reply Follow Share Video is very confusing...and questions is also incorrect... 0 votes 0 votes Surya Dhanraj commented Aug 31, 2017 reply Follow Share Do you know any other better method.... 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes correct me if i done wrong Prateek Raghuvanshi answered Dec 20, 2017 Prateek Raghuvanshi comment Share Follow See all 0 reply Please log in or register to add a comment.