db test 10

Is this your test? Login to manage it. If not, you can generate an assessment just like it.

This is a non-interactive preview of the quiz content.

1.
1 point
All transactions must display ____.
2.
1 point
During the ____ phase, a transaction scans the database, executes the needed computations, and makes the updates to a private copy of the database values.
3.
1 point
ANSI defines four events that signal the end of a transaction. Of the following events, ____ is defined by ANSI as being equivalent to a COMMIT.
4.
1 point
To ensure consistency of the database, every transaction must begin with the database in an unstable state.
5.
1 point
The optimistic approach is based on the assumption that the majority of the database operations do not conflict.
6.
1 point
As long as two transactions, T1 and T2, access ____ data, there is no conflict, and the order of execution is irrelevant to the final outcome.
7.
1 point
One of the three most common data integrity and consistency problems is ____.
8.
1 point
A single-user database system automatically ensures ____ of the database, because only one transaction is executed at a time.
9.
1 point
The transaction recovery write-ahead-log protocol ensures that transaction logs are always written before any database data are actually updated.
10.
1 point
The information stored in the ____ is used by the DBMS for a recovery requirement triggered by a ROLLBACK statement, a program’s abnormal termination, or a system failure such as a network discrepancy or a disk crash.
11.
1 point
____ requires that all operations of a transaction be completed
12.
1 point
A ____ lock locks the entire table preventing access to any row by a transaction while another transaction is using the table.
13.
1 point
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.
14.
1 point
A(n) ____ condition occurs when two or more transactions wait for each other to unlock data
15.
1 point
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.
16.
1 point
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.
17.
1 point
The ____ manager is responsible for assigning and policing the locks used by the transactions.
18.
1 point
Serializability means that data used during the execution of a transaction cannot be used by a second transaction until the first one is completed.
19.
1 point
____ are rules that applies to the two-phase locking protocol.
20.
1 point
The implicit beginning of a transaction is ____.
21.
1 point
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.
22.
1 point
A diskpage, or page, is the equivalent of a ____.
23.
1 point
A(n) ____ specifically reserves access to the transaction that locked the object.
24.
1 point
A(n) ____ lock has only two stages (0 and 1).
25.
1 point
The DBMS guarantees that the semantic meaning of a transaction truly represents the real-world event.
26.
1 point
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.
27.
1 point
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.
28.
1 point
A(n) ____ phase in a two-phase lock is when a transaction releases all locks and cannot obtain any new lock.
29.
1 point
A consistent database is ____.
30.
1 point
The scheduler establishes the order in which the operations within concurrent transactions are executed.
31.
1 point
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.
32.
1 point
A ____ lock allows concurrent transactions to access different rows of the same table.
33.
1 point
____ means that data used during the execution of a transaction cannot be used by a second transaction until the first one is completed.
34.
1 point
In a page-level lock, the DBMS will lock an entire diskpage
35.
1 point
A ____ lock locks the entire diskpage.
36.
1 point
Atomicity indicates the permanence of the database's consistent state.
37.
1 point
During the ____ phase, changes are permanently applied to the database.
38.
1 point
A transaction is a ____ unit of work that must be either entirely completed or aborted.
39.
1 point
____ are required to prevent another transaction from reading inconsistent data.
40.
1 point
A ____ lock prevents the use of any tables in the database from one transaction while another transaction is being processed.
41.
1 point
Incomplete or improper transactions can have a devastating effect on database integrity.
42.
1 point
The ____ approach to scheduling concurrent transactions assigns a global unique stamp to each transaction.
43.
1 point
ANSI defines four events that signal the end of a transaction. Of the following events ____ is defined by ANSI as being equivalent to a ROLLBACK.
44.
1 point
When you When you read from or update a database, you create a transaction.
45.
1 point
A shared lock produces no conflict as long as all the concurrent transactions are read-write only.
46.
1 point
Lock ____ indicates the level of lock use.
47.
1 point
A growing phase in a two-phase lock is when a transaction acquires all the required locks without locking any data.
48.
1 point
The ANSI has defined standards that govern SQL database transactions. Transaction support is provided by two SQL statements: ____ and ROLLBACK.
49.
1 point
Most real-world database transactions are formed by only one database request.
50.
1 point
A(n) ____ lock exists when concurrent transactions are granted read access on the basis of a common lock.