Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) DBMS Transaction Serializability of Schedules

Consider the following schedules involving two transactions.

S1 : r1(X) ; r1(Y) ; r2(X) ; r2(Y) ; w2(Y) ; w1(X)

S2 : r1(X) ; r2(X) ; r2(Y) ; w2(Y) ; r1(Y) ; w1(X)

Which one of the following statements is correct with respect to above?

1
Both S1 and S2 are conflict serializable
2
Both S1 and S2 are not conflict serializable
3
S1 is conflict serializable and S2 is not conflict serializable
4
S1 is not conflict serializable and S2 is conflict serializable
Share: WhatsApp Telegram X

Sponsored

hivanix.in

Visit

This quiz is brought to you by hivanix.in

🌐 Web App Development

Other Tools: chatwiz.hivanix.in mmspace.hivanix.in unogame.hivanix.in

Quick Navigation

Home

Subjects

Chapters