(a) Apply the basic timestamp ordering (BTO) algorithm to schedules S1 and S2. Determine whether or not the algorithm
allows the execution of the schedules, and discuss cascading rollback (if any).
Hints: each operation takes one time unit, and timestamp of each transaction is the time associated to its first operation.
For example, timestamps of transactions T1, T2, and T3 in schedule S1 are 3, 6, and 1 (respectively).
[20 marks]
(b) Testing the serializability of S1 and S2 by serialization graph technique to prove that the successful execution of a
schedule under BTO will ensure the serializability of the schedule.
[15 marks]
(c) Examine the recoverable characteristic of S1 and S2. What schedule (S1 or S2) can be executed under the strict
timestamp ordering (STO) algorithm and write an equivalent strict schedule for it?

Attachments:

CP5520-SP23-1….pdf