Gate CS-2019 Question Paper With Solutions

Q. 18 Consider the following two statements about database transaction schedules:

  • I. Strict two-phase locking protocol generates conflict serializable schedules that are also recoverable.
  • II. Timestamp-ordering concurrency control protocol with Thomas’ Write Rule can generate view serializable schedules that are not conflict serializable.

Which of the above statements is/are TRUE?

(A) I only

(B) II only

(C) Both I and II

(D) Neither I nor II

Answer: (C)

Explanation:

Learn More:   Gate CS-2005 Question Paper With Solutions

LEAVE A REPLY

Please enter your comment!
Please enter your name here