Consider the following schedule S = r1(x); r1(y); w1(y); r2(y); r2(x); w2(y);…

Consider the following schedule S = r1(x); r1(y); w1(y); r2(y); r2(x); w2(y); w2(x); r2(z). How many conflicting pairs are there in the schedule S? _______

Attempted by 18 students.

Sign up free to check your answer

Sign up free

Explore the full course: Gate Guidance By Sanchit Sir

Loading lesson…