adplus-dvertising
frame-decoration

Question

Which of the following is not a property of a transaction?

a.

Atomicity

b.

Simplicity

c.

Isolation

d.

Durability

Posted under DBMS

Answer: (b).Simplicity

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. Which of the following is not a property of a transaction?

Similar Questions

Discover Related MCQs

Q. Which of the following systems is responsible for ensuring durability?

Q. Which of the following systems is responsible for ensuring isolation?

Q. State true or false: Information residing in the volatile storage does not usually survive system crashes

Q. A transaction that has not been completed successfully is called as _______

Q. Which of the following is not a transaction state?

Q. The execution sequences in concurrency control are termed as ________

Q. The scheme that controls the interaction between executing transactions is called as _____

Q. 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.

Q. 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

Q. A schedule is __________ if it is conflict equivalent to a serial schedule.

Q. The set of ________ in a precedence graph consists of all the transactions participating in the schedule

Q. A ___________of the transactions can be obtained by finding a linear order consistent with the partial order of the precedence graph.

Q. State true or false: If I = read(Q) and J = read(Q) then the order of I and J does not matter.

Q. State true or false: If I = read(Q) and J = write(Q) then the order of I and J does not matter.

Q. Which of the following is the most expensive method?

Q. A transaction that performs only one operation is called as a _________

Q. The phenomenon in which one failure leads to a series of transaction rollbacks is called as ________

Q. State true or false: Every cascadeless schedule is also recoverable

Q. A ___________ is one where, for each pair of transactions Ti and Tj such that Tj reads a data item previously written by Ti , the commit operation of Ti appears before the commit operation of Tj

Q. State true or false: Transactions can only run serially