207 views
0 votes
0 votes
Consider the schedule given below

R1(A), R2(A) , R3(A), W1(B) , W2(A), R3 (B),W2 (B)

Total number of Conflict Serializable Schedule possible are?

Please log in or register to answer this question.

Related questions

0 votes
0 votes
1 answer
2
2 votes
2 votes
1 answer
3
Sandip Shaw asked Nov 12, 2015
2,416 views
I always get confused between internal and external fragmentation.Is there any relation between them?pls explain in detail
0 votes
0 votes
0 answers
4
RahulRoy31 asked Dec 28, 2018
407 views
(a^n)^m b^n for m,n>=1 is1)DCFL 2)CFL or 3)CSL