Transaction

Question

'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)

Comments

how serializable schedule is proper subset of 2PL

is a correct option?

---

yeah option B is also false

---

@Magma could you please give your explanation for the answer.

According to me both option $B$ and $C$ are wrong as $2PL$ schedules are small schedules under all serializable schedules. Similarly option $A$ and $D$ are true bcz either set of all $2PL$ schedules produce correct result or some of them.

Then how option $A$ is answer?