Transaction: Transaction concepts, properties of transactions, serializability of transactions,

testing for serializability, System recovery, Two- Phase Commit protocol, Recovery and
Atomicity, Log-based recovery, concurrent executions of transactions and related problems,
Locking mechanism, solution to concurrency related problems, deadlock, , two-phase locking
protocol, Isolation.

Sr. Question Options Answer

No.
1. An operation is part of a A. Logically A) Logically
transaction if it is ___ related. B. Analytically
C. Reasonably
D. None

2. To access the contents of the A. Single A) Single

database, ___ user performs B. Two
transactions. C. Three
D. Multiple

3. Which of the following is an A. Read D) All of the above

operation of transactions? B. Write
C. Commit
D. All of the above

4. X is read from a database and A. Read A) Read

stored in a buffer in main memory B. Write
with the ___ operation. C. Commit
D. Rollback

5. __ is used to permanently save the A. Read C) Commit

work. B. Write
C. Commit
D. Rollback

6. An undo operation is called a ___. A. Rollback A. Rollback

B. Commit
C. Write
D. Read
7. In a database, prior to and after a A. Consistency A) Consistency
transaction, properties are used to B. Redundancy
ensure ___. C. Latency
D. Anonymity

8. Which of the following is a A. Atomicity D. All of the above

property of transaction? B. Consistency
C. Durability
D. All of the above

9. ___ states that all operations of a A. Atomicity A. Atomicity

transaction must occur B. Consistency
simultaneously; otherwise, the C. Isolation
transaction will be aborted. D. Durability

10. With regards to transaction a. Ensuring that d. All of the

processing, any DBMS should be transactions are free above.
capable of: from interference
from other users.
b. Parts of a transaction
are not lost due to a
failure.
c. Transactions do not
make the database
inconsistent.
d. All of the above.

11. What is ACID properties of A. Atomicity, B. Atomicity,

Transactions? Consistency, Consistency,
Isolation, Database Isolation,
B. Atomicity, Durability
Consistency,
Isolation, Durability
C. Atomicity,
Consistency,
Inconsistent,
Durability
D. Automatically,
Concurrency,
Isolation, Durability
12. Database locking concept is used A. Lost Update D. All of the
to solve the problem of B. Uncommitted above
Dependency
C. Inconsistent Data
 D. All of the above

13. A system is in a ______ state if A. Idle C. Deadlock

there exists a set of transactions B. Waiting
such that every transaction in the C. Deadlock
set is waiting for another D. Ready
transaction in the set.
14. The deadlock state can be A. Commit B. Rollback
changed back to stable state by B. Rollback
using _____________ statement. C. Savepoint
D. Deadlock
15. _________ rollback requires the A. Total B. Partial
system to maintain additional B. Partial
information about the state of all C. Time
the running transactions. D. Commit
16. A transaction for which all A. Atomic D. durable
committed changes are permanent B. Consistent
is called: C. Isolated
D. durable

17. A transaction may not always A. Aborted A. Aborted

complete its execution B. Terminated
successfully. Such a transaction is C. Closed
termed D. All of the mentioned
18. Transaction management ensures A. Atomicity and B. Atomicity
____________ and __________ Intigrity and
properties. B. Atomicity and Durability
Durability
C. Atomicity and
Abstraction
D. None of these
19. Which of the following is the A. Rollback C. Switch to
preferred way to recover a B. Rollforward duplicate
database after a system failure? C. Switch to duplicate database
database
D. Reprocess
transactions
20. A shared lock allows which of the A. Delete C. READ
following types of transactions to B. INSERT
occur? C. READ
D. UPDATE

21. Locking may cause which of the A. Erroneous updates B. Deadlock

following problems? B. Deadlock
C. Versioning
 D. All of the above.

22. The transaction log includes a. The before-image of d. The essential data
which of the following? a record of the record
b. The after-image of a
record
c. The before and after-
image of a record
d. The essential data of
the record

23. The “all-or-none” property is a. Isolation c. Atomicity

commonly referred to as b. Durability
_________ c. Atomicity
d. None of the
mentioned

24. Which of the following is not a a. Atomicity b. Simplicity

property of a transaction? b. Simplicity
c. Isolation
d. Durability

25. A transaction that has not been a. Compensating b. Aborted

completed successfully is called transaction transaction
as _______ b. Aborted transaction
c. Active transaction
d. Partially committed
transaction

26. Which of the following is not a a. Active d. Compensated

transaction state? b. Partially committed
c. Failed
d. Compensated

27. The execution sequences in a. Serials b. Schedules

concurrency control are termed as b. Schedules
________ c. Organizations
d. Time tables

28. I and J are _________ if they are A. Conflicting A. Conflicting

operations by different B. Overwriting
transactions on the same data C. Isolated
item, and at least one of them is a D. Durable
write operation.
29. If a schedule S can be transformed A. Non conflict C. Conflict
into a schedule S’ by a series of equivalent equivalent
swaps of non-conflicting B. Equal
instructions, then S and S’ are C. Conflict equivalent
D. Isolation equivalent

30. A schedule is __________ if it is A. Conflict serializable A. Conflict

conflict equivalent to a serial B. Conflicting serializable
schedule. C. Non serializable
D. None of the
mentioned