engineering recuitment GATE CSE 2023-24 Test Series DBMS Transaction Serializability of Schedules

Two transactions T1 and T2 are given as

T1: R1(A)W1(A)

T2:R2(A)W2(A)

where Ri(A)denotes a read operation by transaction Ti on a variable A and Wi(A)denotes a write operation by transaction Ti on a variable A. The total number schedules which are not conflict serializable that can be formed by T1 and T2 is ______.

Enter numerical value using the virtual keypad. Round off where necessary.

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