Gate CS-2014-2 Question Paper With Solutions

Q. 39 Consider the following schedule S of transactions T1, T2, T3, T4:
Gate CS-2014-2 Question Paper With Solutions
Which one of the following statements is CORRECT?

(A) S is conflict-serializable but not recoverable

(B) S is not conflict-serializable but is recoverable

(C) S is both conflict-serializable and recoverable

(D) S is neither conflict-serializable nor is it recoverable

Answer: (C)

Explanation:

Gate CS-2014-2 Question Paper With Solutions

Learn More:   Gate CS-2012 Question Paper With Solutions

LEAVE A REPLY

Please enter your comment!
Please enter your name here