No. Of serial schedules view equal to S
S: R1(A), R3(D), W1(B), R2(B), W3(B), R4(B), W2(C), R5(C), W4(E), R5(E), W5(B) .
If possible please provide detailed solutions.
Thank you in advance
https://gateoverflow.in/169297/serial-schedule
let me explain :
dependecies :
FOR FINAL WRITE
FOR INITIAL READ
FOR WRITE READ
NOW CONDITIONS :
T5 MUST BE LAST
T1-> T2 AND T3-> T4 COME ADJACENT ONLY
SO T1-> T2-> T3-> T4-> T5 AND T3-> T4->T1->T2-> T5
@Anu007
hi! please check for T3..T1..T2..T4..T5
view eqiv rules are maintained as far as i see this...
LET ME EXPLAIN :
LOOK AT DEPENDENCIES :
NO RESTRICTION
NOT MATTER SINCE NO WRITE ON A
NOT MATTER SINCE NO WRITE ON D
( NO WRITE COME IN BETWEEN I.E. T3 AND T5)
( NO WRITE COME IN BETWEEN I.E. T1 AND T5)
BEFORE T2 READ WE WRITE IT BY T2 SEE T1->T2
SO EFFECT OF T3 IS LOST
Which of following is the Problem for data item B
IN VIEW SERIAL ONLY LAST WRITE MATTER SO T3 -> T5 NO ISSUE. SAME T3->T1 NO ISSUE
YOU ARE CHECKING CONFLICT SERIALIZABLE.
Is is true or not?
(RW , WR conflict pair is same precedence for two schedule S and S') iff (intial read and updated read same for S and S')
But only implication for
(WW conflict pair) --> (final write)
@ Anu007 If No. Of serial schedules conflict equal to S was asked then just this one right, T1-> T2-> T3-> T4-> T5