engineering recuitment NIC NIELIT Scientist B 2023 Mock Test DBMS Transaction Serializability of Schedules

Consider the following transactions with data items X and Y initialized to zero:

T1: read (x);

Read (y);

if x = 0 then y: = y + 1;

Write (y);

T2: read (y);

write (x);

If y = 0 then x: x + 1

Write (x);

The concurrent execution of T1­ and T­2 lead to

1
Serializable schedule
2
A schedule that is not conflict serializable
3
A conflict serializable schedule
4
A schedule for which a precedence graph cannot be drawn
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