I and J are _________ if they are operations by different transactions – McqOptions

MCQOPTIONS

1.	I and J are _________ if they are operations by different transactions on the same data item, and at least one of them is a write operation.
A.	Conflicting
B.	Overwriting
C.	Isolated
D.	Durable
Answer» B. Overwriting

Discussion

No Comment Found

Related MCQs

If a schedule S can be transformed into a schedule S’ by a series of swaps of non-conflicting instructions, then S and S’ are
Which of the following is the most expensive method?
State true or false: If I = read(Q) and J = write(Q) then the order of I and J does not matter.
State true or false: If I = read(Q) and J = read(Q) then the order of I and J does not matter.
A ___________of the transactions can be obtained by finding a linear order consistent with the partial order of the precedence graph.
The set of ________ in a precedence graph consists of all the transactions participating in the schedule
A schedule is __________ if it is conflict equivalent to a serial schedule.
If a schedule S can be transformed into a schedule S‚Äö√Ñ√∂‚àö√ë‚àö¬• by a series of swaps of non-conflicting instructions, then S and S‚Äö√Ñ√∂‚àö√ë‚àö¬• are$
I and J are _________ if they are operations by different transactions on the same data item, and at least one of them is a write operation.