Computer Sciences > GATE 2014 SET-3 > Transaction Schedules
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?
Correct : d
Similar Questions
Consider the following read-write schedule S over three transactions T1 T2, and T3 where the subscripts in the schedule indicate transaction IDs:
Which of t...
Consider the transactions T₁, T₂, and T₃ and the schedules S₁ and S₂ given below.T₁: r₁(X); r₁(Z); w₁(X); w₁(Z)T₂: r₂(Y); r₂(Z); w₂(Z)T₃: r₃(Y); r₃(X); w₃(Y)S₁:...
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...
Total Unique Visitors
Loading......