Find number of conflict serializable schedule for the following transaction.

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...

3Comments
shivani @shivani1234
2 Sep 2017 02:48 pm

hope it helps: http://www.techtud.com/video-illustration/what-will-be-total-number-conf...
in case of any doubt u can ask here

Surya Dhanraj @suryadhanraj
3 Sep 2017 08:27 am

Mam is there any particular method to solve these types of questions...What all steps are needed to solve...I really get confused...mam....Plzzz help me...

shivani @shivani1234
4 Sep 2017 08:44 am

there is no specified shortcut here , you have to analyse every step.