CameraIcon
CameraIcon
SearchIcon
MyQuestionIcon
MyQuestionIcon
1
You visited us 1 times! Enjoying our articles? Unlock Full Access!
Question

Consider the following schedule:
S:r1(x),r2(x),ω2(x),ω3(x),r1(z),ω1(x)
Which of the following is true about the above schedule?

Open in App
Solution

(d)
Precedence graph of S contain cycle. Hence not conflict serializable.
S has write- read conflict i.e., ((T2,T3)T1
Hence not view serializable.

flag
Suggest Corrections
thumbs-up
0
Join BYJU'S Learning Program
similar_icon
Related Videos
thumbnail
lock
Nutrition
Watch in App
Join BYJU'S Learning Program
CrossIcon