Computer Sciences > GATE 2024 SET-1 > Transaction Schedules
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 the following transaction schedules is/are conflict equivalent to S?
A
T1 T2 T3
B
T1 T3 T2
C
T3T2 T1
D
T3T1 T2

Explanation

Correct : a,b,c,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