Consider the following four schedules due to three transactions (indicated by the subscript) using read and write on a data ite x, denoted by r(x) and $ω$ (x) respectively. Which of them is/are conflict serializable.

$r_{1} (x); r_{2} (x); ω_{1} (x); r_{3} (x); ω_{2} (x)$

No worries! We‘ve got your back. Try BYJU‘S free classes today!

$r_{2} (x); r_{1} (x); ω_{2} (x); r_{3} (x); ω_{1} (x)$

No worries! We‘ve got your back. Try BYJU‘S free classes today!

$r_{2} (x); ω_{2} (x); r_{3} (x); r_{1} (x); ω_{1} (x)$

Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses

$r_{3} (x); r_{2} (x); r_{1} (x); ω_{2} (x); ω_{1} (x)$

No worries! We‘ve got your back. Try BYJU‘S free classes today!

Open in App

Solution

The correct option is C
$r_{2} (x); ω_{2} (x); r_{3} (x); r_{1} (x); ω_{1} (x)$

option (d) has first all operations of transaction 2, then 3 and finally 1.
There can not be any conflict as it is a serial schedule with sequence 2 $\to$ 3 $\to$ 1.

Suggest Corrections

Similar questions

S_{1} : r_{1} (x), r_{2} (z), r_{1} (z), r_{3} (x), r_{3} (y), w_{1} (x), w_{3} (y), r_{2} (y), w_{2} (z), w_{2} (y)

S_{2} : r_{1} (x), r_{2} (z), r_{3} (x), r_{1} (z), r_{2} (y), r_{3} (y), w_{1} (x), w_{2} (z), w_{3} (y), w_{2} (y)

S_{1} : W_{2} (x), W_{1} (x), R_{3} (x), W_{2} (y), R_{3} (y), R_{3} (z), R_{2} (x), R_{1} (y)

S_{2} : R_{3} (z), W_{2} (x), W_{2} (y), R_{1} (x), R_{3} (x), R_{2} (z), R_{3} (y), W_{1} (x)

T_{1 a n d T_{2}}

T_{1} a n d T_{2}

Join BYJU'S Learning Program