1. Durability can be ensured in ______ ways.
(A) 3 ways
(B) 2 ways
(C) 4 ways
(D) 5 ways
2. Performing concurrent execution of transactions reduces
(A) Queue time
(B) Buffer time
(C) Waiting Time
(D) Evaluation time
3. When a transaction is rolled back and entered at the aborted stage, the available system's options are of
(A) 4 types
(B) 3 types
(C) 2 Types
(D) 5 types
4. The usage of concurrent execution of transactions improves
(A) BOTH A & C
(B) Response time
(C) Throughput
(D) Utilization
5. Atomicity is ensured by a component of the database called the
(A) Recovery manager
(B) Control manager
(C) Evaluation manager
(D) Quality manager
6. A transaction is said to be a unit of program's
(A) Evaluation
(B) Execution
(C) Computation
(D) Controlling
7. A single transaction failure may result into a set of transaction rollbacks, is known to be
(A) Cascading Rollback
(B) Cascade less rollback
(C) Iterated rollback
(D) Serial rollback
8. Transactions access data using operations of
(A) 2 types
(B) 3 types
(C) 4 types
(D) 5 types
9. Serializability of schedules can be ensured through a mechanism called
(A) Cascading control policy
(B) Evaluation control policy
(C) Execution control policy
(D) Concurrency Control Policy
10. Schedules should preferably be
(A) Non-modifying
(B) Cascade
(C) Dependent
(D) Cascade less
11. Ensuring durability is the responsibility of
(A) Quality manager
(B) Control manager
(C) Evaluation manager
(D) Recovery manager
12. The effects of a committed transaction can be undo by executing a
(A) Compound transaction
(B) Compensating Transaction
(C) Composite transaction
(D) Common transaction
13. Examples of nonvolatile storage are magnetic disks and
(A) Flash Memory
(B) Main memory
(C) Cache memory
(D) Primary memory
14. A schedule can be tested against the conflict serializability by constructing
(A) Histogram
(B) Gantt chart
(C) Precedency Graph
(D) Bar-graph
15. When the changes made by the aborted transaction has been undone, the transaction is said to be
(A) Committed
(B) Derived
(C) Rolled Back
(D) Depicted
16. The term stating either all operations of the transaction to be displayed at the database, or none at all is known to be
(A) Inconsistency
(B) Atomicity
(C) Isolation
(D) Durability
17. Stable storage that can be accessed online is approximated with
(A) Drives
(B) Flashes
(C) Floppies
(D) Mirrored disks
18. A transaction must be in one of the states from
(A) 5 states
(B) 4 states
(C) 3 states
(D) 6 states
19. By finding a linear order consistent with the partial order in the precedence graph, we can obtain the
(A) Topological order
(B) Precedence order
(C) Serializability order
(D) Conflict serializability order