Question 6734 – UGC NET CS 2016 July- paper-3
April 2, 2024Question 7060 – Data-Interpretation
April 2, 2024Question 10687 – Transactions
Consider the following three schedules of transactions T1, T2 and T3. [Notation: In the following NYO represents the action Y (R for read, W for write) performed by transaction N on object O.]
(S1) 2RA 2WA 3RC 2WB 3WA 3WC 1RA 1RB 1WA 1WB (S2) 3RC 2RA 2WA 2WB 3WA 1RA 1RB 1WA 1WB 3WC (S3) 2RA 3RC 3WA 2WA 2WB 3WC 1RA 1RB 1WA 1WB
Which of the following statements is TRUE?
Correct Answer: D
Question 9 Explanation:
Two schedules are conflict equivalent when the precedence graph are isomorphic.
For S1:
For S2:
For S3:
Hence, S1 is conflict equivalent to S2, but not to S3.
For S1:
For S2:
For S3:
Hence, S1 is conflict equivalent to S2, but not to S3.
S1, S2 and S3 are all conflict equivalent to each other
No two of S1, S2 and S3 are conflict equivalent to each other
S2 is conflict equivalent to S3, but not to S1
S1 is conflict equivalent to S2, but not to S3
Subscribe
Login
0 Comments