A schedule is having two transactions $T_{1 a n d T_{2}}$ executing concurrently and the schedules are given below. Which of these schedules results in "write-read conflict" with the actions of transaction $T_{1} a n d T_{2}$ on object x and y.

T_{2} : R (X); T_{2} : R (y); T_{1} : R (X); T_{1} : R (Y); T_{1} : W (X);

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

None of the above

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

T_{2} : R (x); T_{2} : R (y); T_{2} : W (x); T_{1} : R (x);

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

T_{2} : R (x); T_{2} : W (x); T_{1} : R (y); T_{1} : W (y); T_{2} : R (z); T_{1} : R (z);

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

Open in App

Solution

The correct option is C $T_{2} : R (x); T_{2} : R (y); T_{2} : W (x); T_{1} : R (x);$
Option (B) is having "Write-Read" conflict from $T_{2} : W (X) a n d T_{1} : R (X)$

Suggest Corrections

Similar questions

ω

S : R_{1} (A), R_{4} (B), W_{3} (A), W_{2} (B), W_{4} (C), c o m m i t_{4}, W_{3} (C), W_{1} (A), c o m m i t 1, R_{2} (D), W_{3} (D),

Join BYJU'S Learning Program