583 views
3 votes
3 votes

1 Answer

0 votes
0 votes

Answer is – 60

let’s fix the W2(A) now to preserve the read write conflict R4,R2,R3(A) should come before it does not matter in which order so total total number of combination will be 3! but we have also W1(B) here which can come before or after W2(A) it does not matter.

so number of cases W1(B) can be put before or after are

lets put W1(B) AND R3(B) before W2(A)  along with R4,R2,R3(A) combinations will be 30

lets put W1(B) along with R4,R2,R3(A) before W2(A) AND R3(B)  after it combinations will be 4! = 24

now put W1(B) AND R3(B) after W2(A) then combination will be W2(A) ,W1(B),R3(B),W2(B) and R4,R2,R3(A) should come before W2(A) does not matter in which order so total total number of combination will be 3! = 6

HENCE number of schedule possible till now is 60

edited by

Related questions

2 votes
2 votes
1 answer
1
4 votes
4 votes
0 answers
2
1 votes
1 votes
2 answers
4
gatecrack asked Dec 10, 2018
724 views
T1T2R(A) W(A)W(A) IS THIS IS VIEW SERIALIZABLE?PLZ EXPLAIN