Transaction Management Questions and Answers

Multiple Choice Questions and Answers

Question 1 : A set of changes that must be all made together is called as a 

(a) Atom
(b) Transaction
(c) Concurrency
(d) None of the above

Answer : (b)

Question 2 : A transaction must be

(a) Atomic
(b) Small
(c) Large
(d) None of the above

Answer : (a)

Question 3 : ACID stands for

(a) Again, Common, Internal, Data
(b) Atomic, Common, Internal, Data
(c) Atomic, Consistent, Isolation, Durability
(d) None of the above

Answer : (c)

Question 4 : The initial state of a transaction is known as

(a) Active state
(b) Partially committed state
(c) Failed state
(d) Aborted state

Answer : (a)

Question 5 : A list of actions from a set of transactions is known as

(a) Statement
(b) Schedule
(c) Transaction Set
(d) None of the above

Answer : (b)

Question 6 : A schedule in which the operations form a set of concurrent transactions are interleaved is called as a 

(a) Non-serial schedule
(b) Serial schedule
(c) Complete schedule
(d) None of the above

Answer : (a)

Question 7 : A  schedule that will always produce identical results

(a) Equivalent schedule
(b) Complete schedule
(c) Serial schedule
(d) Non-serial schedule

Answer : (a)

Question 8 : Two actions on the same data object conflict if at least one of them is a  

(a) Write
(b) Read
(c) Read/Write
(d) None of the above

Answer : (a)

Question 9 : A schedule (S) can be transformed to a schedule (S’), by a series of swaps of non-conflicting instructions, then we say that S and S’ are

(a) Equivalent
(b) Serial
(c) Conflict equivalent
(d) None of the above

Answer : (c)

Question 10 : If the precedence graph has no cycles, then the schedule , S, is

(a) Conflict Serializable
(b) Serial
(c) Conflict equivalent
(d) None of the above

Answer : (a)

DBMS Questions and Answers