563 views
0 votes
0 votes
For the given schedule which of the following statement is true?

S: R4(A), R2(A), R3(A), W1(B), W2(C), R4(B), W2(B)

(a) The schedule cannot be serialized

(b) The schedule is equivalent to T3, T4, T1, T2

(c) The schedule is equivalent to T1, T4, T3, T2

(d) The schedule is equivalent to T2, T3, T1, T4

Please log in or register to answer this question.

Related questions

5 votes
5 votes
1 answer
1
Hardik Maheshwari asked Oct 10, 2018
1,010 views
How many conflict equivalent schedules are possible for the given schedule ?$R_1(A), R_2(A), R_3(A), R_4(A), W_1(B), W_2(B), W_3(B), W_4(B)$
0 votes
0 votes
1 answer
2
Harsh Saini_1 asked Dec 27, 2023
398 views
How many total $Conflict$ $Serializable$ $Schedules$ are possible that can be formed by $T1$ and $T2?$$T1:$ $r_1(A)$ $r_1(B)$ $w_1(B)$$T2:$ $r_2(B)$ $r_2(A)$ $w_2(B)$
1 votes
1 votes
2 answers
4
Chaitanya Kale asked Oct 7, 2022
721 views
If two schedules are conflict equivalent then can we definitely say that they are also view equivalent?