Given the following schedule of transaction T1, T2 and T3: Which of the followin

Question

Given the following schedule of transaction T1, T2 and T3: Which of the following is true? A. The schedule is not conflict serializable but it is schedulable using timestamp ordering. B. The schedule is conflict serializable but not schedulable using timestamp ordering. C. The schedule is neither conflict serializable nor schedulable using timestamp ordering. D. The schedule is both conflict serializable and schedulable using timestamp ordering. E. The schedule is not legal because all of the transactions are accessing the same data items.

Explanation / Answer

D option is correct.

It is conflict serializable, because T2 -> T1, T2-> T3, T1->T3 and no cycle has been formed.

and it can be serialized using time stamp t2 - t1 - t3.

Related Questions

Navigate

• Browse (All)
• Browse G
• Subjects

---