1 votes 1 votes Consider the following schedule S : r1(A) w2(A) r3(A) w4(A) r5(A) w6(A) The number of schedules equal to given schedule(s) which not conflict equal to schedule(s) are _______. Databases made-easy-test-series databases transaction-and-concurrency + – Çșȇ ʛấẗẻ asked Jan 23, 2017 edited Mar 5, 2019 by adeebafatima1 Çșȇ ʛấẗẻ 279 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes This is just similar to one of the ques previously asked. I have take d solution from there. Also for more information kindly refer d link after d answer. Please check the solution: Draw the precedence graph: 1 -- 2 -- 3--4--5--6 comes out to be order of dependency. So, only one conflict equivalent schedule possible. Total schedules possible with 6 transactions = 6! So 6! -1 are not conflict equivalent with given graph. https://gateoverflow.in/103501/madeeasy-test-series Devshree Dubey answered Jan 23, 2017 Devshree Dubey comment Share Follow See all 0 reply Please log in or register to add a comment.