22 votes
1 answer
4
What is the recurrence relation for the ternary strings of length $n$ which can be constructed using 0,1 or 2 only such that the number of 0’s and number of 1's is od...
0 votes
1 answer
5
5 votes
1 answer
10
How many conflict equivalent schedules are possible for the given schedule ?$R_1(A), R_2(A), R_3(A), R_4(A), W_1(B), W_2(B), W_3(B), W_4(B)$
11 votes
2 answers
18