Gate CS-2007 Question Paper With Solutions

Q. 43 Consider the following schedules involving two transactions. Which one of the

following statements is TRUE?

Gate CS-2007 Question Paper With Solutions

(A) Both S1 and S2 are conflict serializable

(B) S1 is conflict serializable and S2 is not conflict serializable

(C) S1 is not conflict serializable and S2 is conflict serializable

(D) Both S1 and S2 are not conflict serializable

Answer: (C)

Explanation:

Gate CS-2007 Question Paper With Solutions

Learn More:   Gate CS-2015-2 Question Paper With Solutions

LEAVE A REPLY

Please enter your comment!
Please enter your name here