Gate CS-2003 Question Paper With Solutions

Q. 38 Consider three data items D1,D2 and D3 and the following execution schedule of
transactions T1,T2 and T3. In the diagram, R(D) and W(D) denote the actions
reading and writing the data item D respectively

Gate CS-2003 Question Paper With Solutions

(A) The schedule is serializable as T2; T3;T1;

(B) The schedule is serializable as T2; T1;T3;

(C) The schedule is serializable as T3; T2; T1;

(D) The schedule is not serializable

Answer:(D)

Explanation: Gate CS-2003 Question Paper With Solutions

Learn More:   Gate ME-2007 Question Paper With Solutions

LEAVE A REPLY

Please enter your comment!
Please enter your name here