Let S be the following schedule of operations of three transactions T₁, T₂ and T₃ in a relational database system:

R₂(Y), R₁(X), R₃(Z), R₁(Y), W₁(X), R₂(Z), W₂(Y), R₃(X), W₃(Z)

Consider the statements P and Q below:

P: S is conflict-serializable.

Q: If T₃ commits before T₁ finishes, then S is recoverable.

Which one of the following choices is correct?

Let r_i(z) and w_i(z) denote read and write operations respectively on a data item z by a transaction T_i. Consider the following two schedules.

S₁ : r₁(x) r₁(y) r₂(x) r₂(y) w₂(y) w₁(x)

S₂ : r1(x) r₂(x) r2(y) w2(y) r₁(y) w1(x)

Which one of the following options is correct?

Consider a schedule of transactions T₁ and T₂ :
Here, RX stands for “Read(X)” and WX stands for “Write(X)”. Which one of the following schedules is conflict equivalent to the above schedule?

Consider the following two phase locking protocol. Suppose a transaction $$T$$ accesses (for read or write operations), a certain set of objects $$\left\{ {{O_1},...,{O_k}} \right\}.$$ This is done in the following manner:

Step 1. T acquires exclusive locks to $${{O_1},...,{O_k}}$$ in increasing order of their
addresses.
Step 2. The required operations are performed.
Step 3. All locks are released.

This protocol will