1,743 views
1 votes
1 votes

The schedule is given below. Find out the category of the schedule

S: R1(X),R2(Z)R1(Z),R3(X) W1(X) W3(Y) R2(Y) W2(Z) W2(Y) C1 C2 C3

  • Recoverable schedule

  • Conflict Serializable

  • Strict schedule

  • None of these

1 Answer

Best answer
3 votes
3 votes

It's not strict schedule because W3(Y) is followed by R2(Y). it's a dirty read

It's not recover schedule because W3(Y) is followed by R2(Y). and T2 committed before T3

It's Conflict serializable, because no cycle in the precedence graph.

(B) is correct option!

selected by

Related questions

6 votes
6 votes
3 answers
1
Vikrant Singh asked Jan 29, 2015
18,272 views
Consider $3$ transactions $T_1, T_2$ and $T_3$ having $2, 3$ and $4$ operations respectively. Find the number of concurrent schedules?
2 votes
2 votes
1 answer
2
techbrk3 asked Nov 9, 2017
1,705 views
The time stamp of two transactions T1 and T2 are 10 and 15 respectively. Consider the following schedule with T1 and T2 operations.S1:r1(x),w1(x),r2(x),w2(x),r1(y),w1(y),...
1 votes
1 votes
1 answer
3