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 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 following read-write schedule S over three transactions T1 T2, and T3 where the subscripts in the schedule indicate transaction IDs:
Which of t...
Total Unique Visitors
Loading......