0 votes 0 votes Consider following transactions T1: R1(a) W1(a) R1(b) W1(b) T2: W2(b) W2(a) The number of non-serial schedules between T1 and T2 which are serializable __________ . Please explain the method of solving such kind of problems. User007 asked Jan 17, 2017 User007 194 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.