(True/False) A serial schedule of two transactions is conflict equivalent to every other serial schedule of two transactions.

If two transaction schedules are conflict equivalent then they a) have the same final database state if they have the same initial state, b) have the same conflicts, c) are conflict serializable.

Which of the following pairs of operations are conflicting? a) read(B), read(B) b) write(A), read(B) c) write(A), read(A) d) write(A), write(B)

(True/False) If two transaction schedules are conflict equivalent, then one is a serial schedule.

(True/False) It is possible to achieve isolation by simply running one transaction at a time.

(True/False) If one transaction schedule can be reached from another transaction schedule through a sequence of swaps of non-conflicting operations, then the two schedules are conflict-equivalent.

(Yes/No) Suppose we have two schedules involving two transactions. Also, running the schedules always has the same effect (in other words, they will end at the same database state if they are run from the same database state). Are the two schedules necessarily conflict equivalent?