1. Which of the following occurs when a transaction rereads data it has previously read and finds modification or deletions caused by a committed transaction?
2. The advantage of optimistic locking is that:
3. Which of the following refers to a cursor type that when the cursor is opened, a primary key value is saved for each row in the recordset; when the application accesses a row, the key is used to fetch the current values of the row?
4. Which of the following refers to a cursor type where changes of any type and from any source are visible?
5. Which of the following disallows both dirty reads and nonrepeatable reads, but allows phantom reads?
6. Dirty read, nonrepeatable, and phantom reads are not possible in this instance.
7. A transaction in which either all of the database actions occur or none of them do is called:
8. A cursor type in which the application can only move forward through the recordset is called:
9. Which of the following occurs when one transaction reads a changed record that has not been committed to the database?
10. Which of the following allows dirty reads, nonrepeatable reads and phantom reads to occur?
11. Which of the following locks the item from access of any type?
12. The size of a lock is called:
13. A cursor type in which the application sees the data as they were at the time the cursor was opened is called:
14. What is the overall responsibility of the DBA?
15. Locks placed by the DBMS are called ________ .
16. Resource locking is a process to prevent multiple applications from obtaining copies of the same record when the record is about to be changed.
17. The overall responsibility of the DBA is to facilitate the development and use of the database.
18. The size of the lock is referred to as the lock granularity.
19. A durable transaction is one in which all committed changes are permanent.
20. An ACID transaction is one that is atomic, consistent isolated, and durable.
21. When one transaction reads a changed record that has not been committed to the database a filthy read occurs.
22. The size of a lock is referred to as lock sizing.
23. When two transactions are being processed against the database at the same time they are termed concurrent transactions.
24. Locks placed by the DBMS are explicit locks.
25. In optimistic locking, the assumption is made that conflict will occur.