Question 8416 – Transactions
January 4, 2024Transactions
January 4, 2024Transactions
| Question 19 |
Consider the following four schedules due to three transactions (indicated by the subscript) using read and write on a data item x, denoted by r(x) and w(x) respectively. Which one of them is conflict serializable?
| r1 (x); r2 (x); w1 (x); r3 (x); w2 (x) | |
| r2 (x);r1 (x);w2 (x);r3 (x);w1 (x) | |
| r3 (x);r2 (x);r1 (x);w2 (x);w1 (x) | |
| r2 (x);w2 (x);r3 (x);r1 (x);w1 (x) |
Question 19 Explanation:
Option: A
– Polygraph contains cycle. So, not a conflict serializable.
Option: B
-Cyclic
Option: C
– Cyclic
Option: D
– Acyclic, so conflict serializable.
– Polygraph contains cycle. So, not a conflict serializable.
Option: B
-Cyclic
Option: C
– Cyclic
Option: D
– Acyclic, so conflict serializable.
Correct Answer: D
Question 19 Explanation:
Option: A
– Polygraph contains cycle. So, not a conflict serializable.
Option: B
-Cyclic
Option: C
– Cyclic
Option: D
– Acyclic, so conflict serializable.
– Polygraph contains cycle. So, not a conflict serializable.
Option: B
-Cyclic
Option: C
– Cyclic
Option: D
– Acyclic, so conflict serializable.
Subscribe
Login
0 Comments