Multiple choice

Consider the following schedule: $R_1(A,B), R_2(B,C), R_3(B,C), V_1, V_2, V_3, W_1(A), W_3(C)$, where R stands for reads, W stands for write and V for validation. What will happen if above schedule is checked and is tested under optimistic concurrency control protocol?

  1. $T_1$ roll will be backed.

  2. $T_2$ roll will be blocked.

  3. $T_3$ roll will b<font size="2">e </font>backed.

  4. <font size="2">S</font>uccessful completion will be there<font size="2">.</font>
Reveal answer Fill a bubble to check yourself
D Correct answer
Explanation

First find out read and write set of each transaction and then apply validation algorithm.

Keep practicing — related questions