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?
A
r₁(x); r₂(x); w₁(x); r₃(x); w₂(x)
B
r₂(x); r₁(x); w₂(x); r₃(x); w₁(x)
C
r₃(x); r₁(x); r₂(x); w₂(x); w₁(x)
D
r₁(x); w₁(x); r₃(x); r₂(x); w₂(x)

Explanation

Correct : d

Similar Questions

What is the worst-case time complexity of insertion in an AVL tree?
Question #23 Medium
Which operations on a binary search tree have O(h) complexity?
Question #31 Easy
Compare search complexities of sorted array vs balanced BST.
Question #47 Hard

Related Topics

Data Structures Binary Search Tree Time Complexity Algorithm Analysis Tree Algorithms Computer Science