← Quiz: Concurrency Control: all 10 questions
Quiz: Concurrency Control · Question 3 of 10
In schedule R1(A), R2(A), W1(A), W2(A), which edges does the precedence graph have?
In schedule R1(A), R2(A), W1(A), W2(A), which edges does the precedence graph have?
- A.Only T1 → T2
- B.Only T2 → T1
- C.No edges
- D.T1 → T2 and T2 → T1
Answer & explanation
Correct answer: T1 → T2 and T2 → T1
R1(A) before W2(A) gives T1 → T2; R2(A) before W1(A) gives T2 → T1. The cycle means it is not conflict serializable.
Can you get the rest right without peeking?
Take the timed Quiz: Concurrency Control quiz free. Pass it to earn XP and count towards your certificate.
Start the quiz →