Computer Sciences > GATE 2014 SET-1 > Transaction Serializability
Consider the following four schedules due to three transactions (indicated by the subscript) using read and write on a data item x, denoted by r(x) and w(x) respectively. Which one of them is conflict serializable?
(A) r1(x); r2(x); w1(x); r3(x); w2(x)
(B) r2(x); r1(x); w2(x); r3(x); w1(x)
(C) r3(x); r2(x); r1(x); w2(x); w1(x)
(D) r2(x); w2(x); r3(x); r1(x); w1(x)
(A) r1(x); r2(x); w1(x); r3(x); w2(x)
(B) r2(x); r1(x); w2(x); r3(x); w1(x)
(C) r3(x); r2(x); r1(x); w2(x); w1(x)
(D) r2(x); w2(x); r3(x); r1(x); w1(x)
Correct : d
Similar Questions
A palindrome is a word that reads the same forwards and backwards. In a game
of words, a player has the following two plates painted with letters.
From...
Which number does not belong in the series below?
2, 5, 10, 17, 26, 37, 50, 64
Choose the word that is opposite in meaning to the word “coherent”.
Total Unique Visitors
Loading......