4,045 views
8 votes
8 votes
Q.1 find total number of conflict serializable

T1=R(A)W(A)R(B)W(B)

T2=R(B)W(B)R(C)W(C)

Q.2 find total number of conflict serializable for

T1=R1(A)W1(A)R1(B)W1(B)R1(C)W1(C)

T2=R2(A)W2(A)R2(B)W2(B)R2(C)W2(C).

explanation??.

1 Answer

Best answer
17 votes
17 votes

NEW APPROACH :-

For question 1 :-

see my answer at https://gateoverflow.in/118640/gate2017-2-44?show=289691#a289691

For question 2:-

Before coming to question 2, please understand the procedure which is used in the Q1, due to it is same concept

For clarity images :- https://drive.google.com/open?id=1dka-cqVm6ZppPI81Mm9WztqV_pG5iMMh

Recommended to see the same type of question  https://gateoverflow.in/272638/total-conflict-serializable-schedules

 

OLD APPROACH :-

For Question 1 :-

For clarity images https://drive.google.com/open?id=1o12YFKd8JLhlXWLB1D3tuph91ENJ0OCd



For Question 2 :-

For Case 3 and Case 4 :-

Note that R2(B) should be after W1(B)

selected by

Related questions

0 votes
0 votes
0 answers
1
2 votes
2 votes
0 answers
2
susgir2 asked Dec 31, 2018
535 views
My question, does abort in T2 makes this schedule conflict serializable? as the effect of T2 will be null. T1: Rx T2: Wx T1: Wx T2: ABORT T1: COMMITRx – read item x.Wx...
2 votes
2 votes
2 answers
3
ankit_thawal asked Jan 26, 2018
351 views
If some schedule is not conflict serializable then it can never be view serializable is it true?Or vice versa.
0 votes
0 votes
1 answer
4
pC asked Sep 18, 2016
784 views
Account on the following statements IF Conflict Serial schedule then it is ALWAYS possible under 2PL