Quiz
Chapter 10 (T/F)
Create a free account to finish this quiz
Save your progress and see your final score.
Already have an account? Sign in
Questions in this quiz (20)
11. Most real-world database transactions are formed by only one database request.
- ATrue
- BFalse
22. To ensure consistency of the database, every transaction must begin with the database in an
Unstable state.- ATrue
- BFalse
33. Although the DBMS is designed to recover a database to a previous consistent state when an interruption
prevents the completion of a required set of transactions, the transactions themselves are defined by the end user
or programmer and must be semantically correct.- ATrue
- BFalse
44. The DBMS guarantees that the semantic meaning of a transaction truly represents the real-world event.
- ATrue
- BFalse
55. Atomicity indicates the permanence of the database's consistent state.
- ATrue
- BFalse
66. Serializability means that data used during the execution of a transaction cannot be used by a second
transaction until the first one is completed.- ATrue
- BFalse
77. Incomplete or improper transactions can have a devastating effect on database integrity.
- ATrue
- BFalse
88. The multiuser DBMS must implement controls to ensure serializability and isolation of transactions, in addition
to atomicity and durability, in order to guard the database's consistency and integrity.- ATrue
- BFalse
99. Durability requires that all portions of the transaction must be treated as a single, logical unit of work in which all operations are applied and completed to produce a consistent database.
- ATrue
- BFalse
1010. The phenomenon of uncommitted data occurs when two transactions are executed concurrently and the first transaction is rolled back after the second transaction has already accessed the uncommitted data—thus violating the isolation property of transactions.
- ATrue
- BFalse
1111. The scheduler establishes the order in which the operations within concurrent transactions are executed
- ATrue
- BFalse
1212. In a page-level lock, the DBMS will lock an entire disk page
- ATrue
- BFalse
1313. A shared lock produces no conflict as long as all the concurrent transactions are read-write only.
- ATrue
- BFalse
1414. A field-level lock allows concurrent transactions to access the same row, as long as they require the use of different fields within that row
- ATrue
- BFalse
1515. A growing phase in a two-phase lock is when a transaction acquires all the required locks without locking any data.
- ATrue
- BFalse
1616. When using an optimistic approach, a transaction reads the database, executes the needed computations, and makes the updates to a private copy of the database values.
- ATrue
- BFalse
1717. An optimistic approach is based on the assumption that the majority of the database operations do not conflict.
- ATrue
- BFalse
1818. When using an optimistic approach, during the write phase, the transaction is validated to ensure that the changes made will not affect the integrity and consistency of the database.
- ATrue
- BFalse
1919. The transaction recovery write-ahead-log protocol ensures that transaction logs are always written before any database data are actually updated.
- ATrue
- BFalse
2020. The last step in the write-through technique recovery procedure is to identify the last checkpoint in the transaction log.
- ATrue
- BFalse
Information
- Description
- asdf Quiz on Chapter 10 (T/F), created by . . on 07/12/2016.
- Author
- . .
- Language
- English
- Views
- 47
- Tags
- Rating
- No ratings yet Rate this quiz