Register

How many conflict serializable schedules are possible ?

2,956 views
5 votes
5 votes

The transactions $T1$ and $T2$ are given as follows:

$T1$: $R1(A)$ $W1(A)$ $R1(B)$ $W1(B)$

$T2$ : $R2(B)$ $W2(B)$ $R2(C)$ $W2(C)$

The total number of conflicts serializable that can be formed by $T1$ and $T2$ are

Answer :20 (incorrect)

The correct answer is 14

User Avatar

1 Answer

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

5 votes
5 votes
3 answers
1
daksh asked Jan 15, 2016
8,440 views
how many view equivalent serial schedules are possible
how many view equivalent serial schedules are possible for the given schedule s: w1(a) r2(a) w3(a) r4(a) w5(a) r6(a) a) 2 b) 3 c) 6 d) 8
how many view equivalent serial schedules are possible for the given schedule s: w1(a) r2(a) w3(a) r4(a) w5(a) r6(a)a) 2b) 3c) 6d) 8
User Avatar
17 votes
17 votes
1 answer
2
nilamd asked Dec 21, 2015
4,592 views
How many recoverable schedules are possible from T1 and T2?
Consider the following Two Transactions. A) How many recoverable schedules can be formed over $T_{1}$ & $T_{2}$ ? $51$ $52$ $55$ $56$ B) How many cascadeless recoverable schedules can be formed over $T_{1}$ & $T_{2}$ ? $41$ $42$ $45$ $50$
Consider the following Two Transactions.A) How many recoverable schedules can be formed over $T_{1}$ & $T_{2}$ ?$51$$52$$55$$56$ B) How many cascadeless recoverable s...
User Avatar
0 votes
0 votes
1 answer
3
Harsh Saini_1 asked Dec 27, 2023
394 views
Number of Conflict Serializable Schedules
How many total $Conflict$ $Serializable$ $Schedules$ are possible that can be formed by $T1$ and $T2?$ $T1:$ $r_1(A)$ $r_1(B)$ $w_1(B)$ $T2:$ $r_2(B)$ $r_2(A)$ $w_2(B)$
How many total $Conflict$ $Serializable$ $Schedules$ are possible that can be formed by $T1$ and $T2?$$T1:$ $r_1(A)$ $r_1(B)$ $w_1(B)$$T2:$ $r_2(B)$ $r_2(A)$ $w_2(B)$
User Avatar
0 votes
0 votes
2 answers
4
ajit asked Sep 17, 2015
1,709 views
how many possible different schedules are there?
A CPU scheduling algorithm determines an order for the execution of its scheduled processes.Given n processes to be scheduled on one processor , how many possible different schedules are there? a)n b)n2 c)n! d)2n 
A CPU scheduling algorithm determines an order for the execution of its scheduled processes.Given n processes to be scheduled on one processor , how many possible differe...
User Avatar
Link Copied!