🎙 Free live masterclass · Sun, 29 Nov, 7:00 pm IST · Java Full Stack roadmap Register free →
Skills101
← Quiz: Concurrency Control: all 10 questions

Quiz: Concurrency Control · Question 4 of 10

A precedence graph has edges T2 → T1 and T1 → T3, and no others. Which serial order is equivalent?

A precedence graph has edges T2 → T1 and T1 → T3, and no others. Which serial order is equivalent?

  1. A.T1, T2, T3
  2. B.T2, T1, T3
  3. C.T3, T1, T2
  4. D.T1, T3, T2
Answer & explanation

Correct answer: T2, T1, T3

A topological order follows the edges: T2 before T1, and T1 before T3.

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 →