489 views
0 votes
0 votes

'A' is set of all possible schedules
'C' is set of all possible schedules that are guaranteed to produce a correct final result
'S' is the set of all serializable schedules
'P' is the set of all schedules possible under 2-phase locking protocol

Which is FALSE?

(A) P⊆C
(B) S⊂P
(C) S⊆P
(D) P⊂C

Please provide reason for the answer. (Given answer is A)

Please log in or register to answer this question.

Related questions

1 votes
1 votes
2 answers
1
Na462 asked May 12, 2018
518 views
How many concurrent schedules are conflict serializable of given transactions T1 and T2:
1 votes
1 votes
0 answers
2
2 votes
2 votes
1 answer
3
3 votes
3 votes
1 answer
4