Quiz
CHAPTER 10: TRANSACTION MANAGEMENT AND CONCURRENCY CONTROL
Perguntas do quiz (55)
11. Most real-world database transactions are formed by only one database request.
- AVerdadeiro
- BFalso
22. 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.
- AVerdadeiro
- BFalso
33. The DBMS guarantees that the semantic meaning of a transaction truly represents the real-world event.
- AVerdadeiro
- BFalso
44. Atomicity indicates the permanence of the database's consistent state.
- AVerdadeiro
- BFalso
55. Serializability means that data used during the execution of a transaction cannot be used by a second transaction until the first one is completed.
- AVerdadeiro
- BFalso
66. Incomplete or improper transactions can have a devastating effect on database integrity.
- AVerdadeiro
- BFalso
77. 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.
- AVerdadeiro
- BFalso
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.
- AVerdadeiro
- BFalso
99. 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.
- AVerdadeiro
- BFalso
1010. The scheduler establishes the order in which the operations within concurrent transactions are executed.
- AVerdadeiro
- BFalso
1111. A scheduler facilitates data isolation to ensure that two transactions do not update the same data element at the same time.
- AVerdadeiro
- BFalso
1212. A lock guarantees the open use of a data item to multiple transactions.
- AVerdadeiro
- BFalso
1313. In a page-level lock, the DBMS will lock an entire diskpage.
- AVerdadeiro
- BFalso
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.
- AVerdadeiro
- BFalso
1515. A shared lock produces no conflict as long as all the concurrent transactions are read-write only.
- AVerdadeiro
- BFalso
1616. A growing phase in a two-phase lock is when a transaction acquires all the required locks without locking any data.
- AVerdadeiro
- BFalso
1717. Timestamps must only have the single property of uniqueness.
- AVerdadeiro
- BFalso
1818. Time stamping demands a lot of system resources because many transactions might have to be stopped, rescheduled, and stamped.
- AVerdadeiro
- BFalso
1919. An optimistic approach is based on the assumption that the majority of the database operations do not conflict.
- AVerdadeiro
- BFalso
2020. When using an optimistic approach, during the read phase, a transaction reads the database, executes the needed computations, and makes the updates to a private copy of the database values.
- AVerdadeiro
- BFalso
2121. The serializable isolation level is the least restrictive level defined by the ANSI SQL standard.
- AVerdadeiro
- BFalso
2222. The reason for the different levels of isolation is to increase transaction concurrency.
- AVerdadeiro
- BFalso
2323. The transaction recovery write-ahead-log protocol ensures that transaction logs are always written before any database data are actually updated.
- AVerdadeiro
- BFalso
2424. The last step in the write-through technique recovery procedure is to identify the last checkpoint in the transaction log.
- AVerdadeiro
- BFalso
2525. A transaction is a unit of work that must be either entirely completed or aborted.
- Aa. timed
- Bb. practical
- Cc. logical
- Dd. physical
2626. A consistent database state is .
- Aa. one in which all tables have foreign keys
- Bb. one in which all data integrity constraints are satisfied
- Cc. one in which all tables are normalized
- Dd. one in which all SQL statements only update one table at a time
2727. requires that all operations of a transaction be completed.
- Aa. Specificity
- Bb. Atomicity
- Cc. Durability
- Dd. Time stamping
2828. means that data used during the execution of a transaction cannot be used by a second transaction until the first one is completed.
- Aa. Serializability
- Bb. Atomicity
- Cc. Isolation
- Dd. Time stamping
2929. A single-user database system automatically ensures of the database, because only one transaction is executed at a time.
- Aa. serializability and durability
- Bb. atomicity and isolation
- Cc. serializability and isolation
- Dd. atomicity and serializability
3030. The ANSI has defined standards that govern SQL database transactions. Transaction support is provided by two SQL statements: and ROLLBACK
- Aa. RETRIEVE
- Bb. ASSIGN
- Cc. UPDATE
- Dd. COMMIT
3131. ANSI defines four events that signal the end of a transaction. Of the following events, which is defined by ANSI as being equivalent to a COMMIT?
- Aa. Five SQL statements are executed.
- Bb. The end of a program is successfully reached.
- Cc. The program is abnormally terminated.
- Dd. The database is shut down for maintenance.
3232. ANSI defines four events that signal the end of a transaction. Of the following events, which is defined by ANSI as being equivalent to a ROLLBACK?
- Aa. Five SQL statements are executed.
- Bb. The end of a program is successfully reached.
- Cc. The program is abnormally terminated.
- Dd. The database is shut down for maintenance.
3333. The implicit beginning of a transaction is .
- Aa. when the database is started
- Bb. when a table is accessed for the first time
- Cc. when the first SQL statement is encountered
- Dd. when the COMMIT command is issued
3434. 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.
- Aa. data dictionary
- Bb. metadata
- Cc. rollback manager
- Dd. transaction log
3535. One of the three most common data integrity and consistency problems is .
- Aa. lost updates
- Bb. disk failures
- Cc. user errors
- Dd. deadlocks
3636. occurs when a transaction accesses data before and after one or more other transactions finish working with such data.
- Aa. Inconsistent retrievals
- Bb. The phenomena of uncommitted data
- Cc. Lost update problems
- Dd. Dirty read problems
3737. 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.
- Aa. shared
- Bb. common
- Cc. unrelated
- Dd. locked
3838. are required to prevent another transaction from reading inconsistent data.
- Aa. Locks
- Bb. Schedules
- Cc. Stamps
- Dd. Logs
3939. The______ manager is responsible for assigning and policing the locks used by the transactions.
- Aa. transaction
- Bb. database
- Cc. lock
- Dd. schedule
4040. Lock indicates the level of lock use.
- Aa. granularity
- Bb. shrinking
- Cc. growing
- Dd. serializability
4141. A lock locks the entire table preventing access to any row by a transaction while another transaction is using the table.
- Aa. database-level
- Bb. table-level
- Cc. page-level
- Dd. row-level
4242. A lock locks the entire diskpage.
- Aa. transaction-level
- Bb. table-level
- Cc. page-level
- Dd. row-level
4343. A diskpage, or page, is the equivalent of a .
- Aa. database table
- Bb. disk sector
- Cc. database schema
- Dd. diskblock
4444. A lock allows concurrent transactions to access different rows of the same table.
- Aa. database-level
- Bb. table-level
- Cc. page-level
- Dd. row-level
4545. A(n) specifically reserves access to the transaction that locked the object.
- Aa. shared lock
- Bb. exclusive lock
- Cc. binary lock
- Dd. deadlock
4646. A(n) lock exists when concurrent transactions are granted read access on the basis of a common lock
- Aa. shared
- Bb. exclusive
- Cc. binary
- Dd. two-phase
4747. What is a rule that applies to the two-phase locking protocol?
- Aa. Two transactions cannot have conflicting locks.
- Bb. No unlock operation can precede a lock operation in a different transaction
- Cc. No data is affected until all locks are released.
- Dd. No data is affected until the transaction is in its locked position
4848. A(n) phase in a two-phase lock is when a transaction releases all locks and cannot obtain any new lock.
- Aa. growing
- Bb. shrinking
- Cc. locking
- Dd. unlocking
4949. A(n) condition occurs when two or more transactions wait for each other to unlock data.
- Aa. deadlock
- Bb. exclusive lock
- Cc. binary lock
- Dd. two-phase lock
5050. The approach to scheduling concurrent transactions assigns a global unique stamp to each transaction.
- Aa. scheduled
- Bb. table-locking
- Cc. unique
- Dd. timestamping
5151. In the wait/die scheme,:
- Aa. the older transaction rolls back the younger transaction and reschedules it.
- Bb. the younger, preempted transaction is rescheduled using the same time stamp.
- Cc. the older transaction waits for the younger one to complete and release its locks.
- Dd. both the younger and older transactions wait indefinitely to be released.
5252. In the optimistic approach, during the phase, a transaction scans the database, executes the needed computations, and makes the updates to a private copy of the database values.
- Aa. read
- Bb. validation
- Cc. write
- Dd. shared
53
53. In the optimistic approach, during the phase, changes are permanently applied to the database.- Aa. read
- Bb. validation
- Cc. write
- Dd. shared
5454. The isolation level ensures that queries return consistent results.
- Aa. Read Uncommitted
- Bb. Read Committed
- Cc. Serializable
- Dd. Repeatable Read
5555. A(n) occurs when a transaction executes a query at time t1, and then it runs the same query at time t2, yielding additional rows that satisfy the query.
- Aa. phantom read
- Bb. dirty read
- Cc. uncommitted dependency
- Dd. nonrepeatable read
Informações
- Descrição
- CIS 3365 Quiz sobre CHAPTER 10: TRANSACTION MANAGEMENT AND CONCURRENCY CONTROL, criado por Miguel Lucero em 05-04-2017.
- Autor
- Miguel Lucero
- Idioma
- English
- Visualizações
- 485
- Etiquetas
- Avaliação
- Ainda sem avaliações Avalie este quiz