NEW
Font size
WorksheetsADBMS_Chapter 2_Quiz_2025
Total questions: 25
Worksheet time: 13mins
1. A transaction is a ____
a) Logical unit of data
b) Logical unit of work
c) Physical unit of work
d) Physical record
2. Which of the following is NOT an ACID property?
a) Atomicity
b) Consistency
c) Integration
d) Durability
3. A transaction that has started but not yet completed is in which state?
a) Committed
b) Failed
c) Active
d) Aborted
4. When a transaction successfully completes all its operations, it is in ____ state.
a) Aborted
b) Committed
c) Failed
d) Partial
5. Concurrency control is required to ensure ____
a) No redundant data
b) Correct execution of concurrent transactions
c) Fast execution
d) Backup and recovery
6. Lost update problem occurs when ____
a) Two transactions wait for each other
b) Two transactions update the same data simultaneously
c) A transaction fails after commit
d) None
7. Dirty read occurs when a transaction reads data written by another transaction that is ____
a) Committed
b) Rolled back
c) Aborted
d) Uncommitted
8. Which of the following is NOT a concurrency problem?
a) Lost update
b) Dirty read
c) Phantom read
d) Data entry error
9. A schedule in which each transaction is executed one after another is called ____
a) Serial schedule
b) Parallel schedule
c) Cascaded schedule
d) Strict schedule
10. A schedule is serializable if it produces the same results as a ____ schedule.
a) Cascaded
b) Serial
c) Non-serial
d) Precedence
11. Which type of serializability is based on conflict operations?
a) View serializability
b) Conflict serializability
c) Context serializability
d) Structural serializability
12. Precedence graph is used to test ____
a) View serializability
b) Conflict serializability
c) Cascadelessness
d) Deadlock
13. In lock-based protocols, which lock allows a transaction only to read a data item?
a) Exclusive lock
b) Shared lock
c) Binary lock
d) Time-stamp lock
14. Exclusive lock allows ____
a) Only reading
b) Only writing
c) Reading and writing both
d) Neither read nor write
15. Two-Phase Locking (2PL) ensures ____
a) Serializability
b) No deadlock
c) Faster execution
d) No concurrency
16. In 2PL, once a transaction releases its lock, it cannot ____
a) Read
b) Write
c) Acquire new locks
d) Commit
17. Timestamp-based protocol orders transactions based on ____
a) Lock type
b) System time
c) Transaction ID
d) Execution speed
18. In timestamp ordering, if a transaction tries to read outdated data, it is ____
a) Allowed
b) Ignored
c) Rolled back
d) Locked
19. A state where two or more transactions are waiting for each other indefinitely is called ____
a) Starvation
b) Deadlock
c) Concurrency
d) Schedule
20. Deadlock detection is done using ____
a) Lock table
b) Precedence graph
c) Wait-for graph
d) Schedules
21. Deadlock prevention ensures that ____
a) Deadlock never occurs
b) Deadlock is resolved after occurrence
c) Deadlock is ignored
d) Deadlock is allowed
22. In wait–die and wound–wait, decisions are based on ____
a) Size of lock
b) Timestamp of transactions
c) CPU usage
d) Lock duration
23. Which deadlock handling method ignores deadlocks completely?
a) Prevention
b) Detection
c) Avoidance
d) Ignorance (Ostrich method)
24. A schedule that does not allow cascading rollbacks is called ____
a) Cascadeless
b) Serial
c) Conflict-serial
d) Strict
25. Strict schedules ensure that data written by a transaction is not read until ____
a) It starts
b) It commits
c) It requests
d) It aborts
