Database-Management-System
August 13, 2024Routing
August 15, 2024GATE 2010
|
Question 42
|
Consider the following schedule for transactions T1, T2 and T3:
Which one of the schedules below is the correct serialization of the above?
|
T1 → T3 → T2
|
|
|
T2 → T1 → T3
|
|
|
T2 → T3 → T1
|
|
|
T3 → T1 → T2
|
Question 42 Explanation:
The given schedule is
― Precedence graph for the above schedule is,
― From the precedence graph the correct serialization is,
― Precedence graph for the above schedule is,
― From the precedence graph the correct serialization is,
Correct Answer: A
Question 42 Explanation:
The given schedule is
― Precedence graph for the above schedule is,
― From the precedence graph the correct serialization is,
― Precedence graph for the above schedule is,
― From the precedence graph the correct serialization is,
Subscribe
Login
0 Comments