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

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

Every conflict serializable schedule is also ___________ serializable.

Every conflict serializable schedule is also ___________ serializable.TransactionConceptualViewConflictExplanation for answer

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

consider the schedule S given below.S: R1 (X), W2 (X), W1 (X),Which of the following statement is correct?S is neither view nor conflict serializable.S is view-serializable but not conflict-serializable.S is conflict serializable but not view serializable.S is both view and conflict serializable.