Chapter 9 Transaction Management MCQs 19 min Score: 0 Attempted: 0/19 Subscribe 1. Durability can be ensured in ______ ways. (A) 3 ways (B) 2 ways (C) 4 ways (D) 5 waysShow All Answers 2. Performing concurrent execution of transactions reduces (A) Queue time (B) Buffer time (C) Waiting Time (D) Evaluation timeShow All Answers 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 typesShow All Answers 4. The usage of concurrent execution of transactions improves (A) BOTH A & C (B) Response time (C) Throughput (D) UtilizationShow All Answers 5. Atomicity is ensured by a component of the database called the (A) Recovery manager (B) Control manager (C) Evaluation manager (D) Quality managerShow All Answers 6. A transaction is said to be a unit of program's (A) Evaluation (B) Execution (C) Computation (D) ControllingShow All Answers 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 rollbackShow All Answers 8. Transactions access data using operations of (A) 2 types (B) 3 types (C) 4 types (D) 5 typesShow All Answers 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 PolicyShow All Answers 10. Schedules should preferably be (A) Non-modifying (B) Cascade (C) Dependent (D) Cascade lessShow All Answers 11. Ensuring durability is the responsibility of (A) Quality manager (B) Control manager (C) Evaluation manager (D) Recovery managerShow All Answers 12. The effects of a committed transaction can be undo by executing a (A) Compound transaction (B) Compensating Transaction (C) Composite transaction (D) Common transactionShow All Answers 13. Examples of nonvolatile storage are magnetic disks and (A) Flash Memory (B) Main memory (C) Cache memory (D) Primary memoryShow All Answers 14. A schedule can be tested against the conflict serializability by constructing (A) Histogram (B) Gantt chart (C) Precedency Graph (D) Bar-graphShow All Answers 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) DepictedShow All Answers 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) DurabilityShow All Answers 17. Stable storage that can be accessed online is approximated with (A) Drives (B) Flashes (C) Floppies (D) Mirrored disksShow All Answers 18. A transaction must be in one of the states from (A) 5 states (B) 4 states (C) 3 states (D) 6 statesShow All Answers 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 orderShow All Answers