SOLVE THIS ONE

Question

Consider the following schedule S1:

S1: R1(C) R2(C) W1(A) W2(A) W1(C) R1(B) R2(B) W1(B) W1(D) W2(B) W2(D) R1(F) W3(E) R3(F)

let 'X' be the number of bilnd writes and 'Z' be the number  of conflict equivalent serial schedules to S1. the value of X*Z is=______

I think here no of blind writes =5 and no of conflict equivalent serial schedules=0 . because there is a loop betwwen T1 and T2. so 5*0=0 

Answer 1

YA.even i feel it is not conflict serializable. it is view serializable .

if the question was number of conflict equivalent schedules then it would have been 3 conflict euivalent schedules

 i am sure sirs gonna help you

Answer 2

yes 5 blind writes

schedule is not serializable

so final ans should be zero

Comments

what are the blind writes could u pls tellme? and

how view serializiblity performed on blind writes?

Answer 3

number of blind write is equal to 5 , means value of X=5.

and transactions in given schedule forming a circle so the given schedule is not conflict serializable.

so the numer of conflict equivalent serial schedules=0;

means value of z=0;

so X*Y=5*0=0;

so final answer is 0;

 

Comments

what are the blind writes could u pls tellme? and 

how view serializiblity performed on blind writes?