What is a "conflict" in the context of conflict serializability?Any interaction between transactionsA situation where two transactions have the same timestampA situation where two transactions access the same data item, and at least one of them performs a writeA situation where transactions have a common starting point

A schedule is called __________ if it is conflict equivalent to a serial schedule.Conflict serializableConflictingNon serializableNone of the mentioned

Let Ri(z) and Wi(z) denote read and write operations on a data element z by a transaction Tjr respectively. Consider the schedule S with four transactions. S: R4(x) * R2(x) * R3(x) * R1(y) * W1(y) * W2(x) * W3(y) * R4(y) Which one of the following serial schedules is conflict equivalent to S?

A schedule S is conflict serializable if it is conflict equivalent to a _________ schedulea)serialb)recoverablec)strictd)non seriale)cascadeless

Consider the following transactions with data items P and Q initialized to zero:T1: read (P) ;read (Q) ;if P = 0 then Q : = Q + 1 ;write (Q) ;T2: read (Q) ;read (P) ;if Q = 0 then P : = P + 1 ;write (P) ;Any non-serial interleaving of T1 and T2 for concurrent execution leads toA serializable scheduleA schedule that is not conflict serializableA conflict serializable scheduleA schedule for which a precedence graph cannot be drawn

Every conflict serializable schedule is also ___________ serializable.