c) state whether the schedule is conflict serializable
no
d) Can the schedule arise if the transactions follow two-phase locking (without conversions)
If so, show the points in the schedule at which lock-S, lock-X, and unlock are granted. (Insert the locking instructions without changing the relative order of any of the instructions that are shown. For lock acquisitions, put the instruction at the latest point when the can be granted, while following all rules of 2PL and holding necessary locks to read/write data.)
If not, explain why not.
no
T1 would have X-locked A before T2 begins, but T2 starts by requesting S-lock on A. Even though T1 is finished with A it is still in the growing phase so it will not release.
e) Is the schedule recoverable? If so, show where commit statements can be placed.
If not,
explain why it is not.
3. Repeat Problem 2 for the following schedule: