Database-Management-System
August 29, 2024Functional-Dependency
August 29, 2024Database-Management-System
|
Question 334
|
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 T2 leads to
|
Serializable schedule
|
|
|
A schedule that is not conflict serializable
|
|
|
A conflict serializable schedule
|
|
|
A schedule for which a precedence graph cannot be drawn
|
Question 334 Explanation:
One of the schedule that is possible is,
Let’s check for conflict serializability,
Let’s check for conflict serializability,
Correct Answer: B
Question 334 Explanation:
One of the schedule that is possible is,
Let’s check for conflict serializability,
Let’s check for conflict serializability,
Subscribe
Login
0 Comments