1.

Assume that the following sequence of events occurs: T1 = access data items X and Y T2 = access data items
Y and X This is called a(n) ____.
a. inconsistent state
b. failed transaction
c. deadly embrace
d. rollback

2. If any of the SQL statements in a transaction fail, the entire transaction is ____ to the original database state
that existed before the transaction started.
a. diverted
b. abandoned
c. rolled back
d. completed

3. The scheduler facilitates data ____ to ensure that two transactions do not update the same data element at the
same time.
a. parsing
b. isolation
c. integrity
d. uniqueness

4. When a program is abnormally terminated, the equivalent of a ____ command occurs.

a. COMMIT
b. ROLLBACK
c. QUIT
d. EXIT

5. If several concurrent transactions are executed over the same data set and the second transaction updates the
database before the first transaction is finished, the ____ property is violated and the database is no longer
consistent.
a. atomicity
b. consistency
c. isolation
d. durability

6. In a ____ lock, the DBMS will lock an entire disk page.

a. database-level
b. table-level
c. page-level
d. row-level

7. A(n)____ guarantees exclusive use of a data item to a current transaction.

a. timestamp
b. lock
c. rowid
d. index

8. Two-phase locking guarantees serializability, but it does not prevent ____.

a. deadlocks
b. inconsistency
c. lost updates
d. uncommitted data
9. The ____ approach does not require locking or time stamping techniques.
a. die/wait
b. page-level locking
c. optimistic
d. negative

10. All transactions are controlled and executed by the DBMS (subject to some limitations) to guarantee
database ____.
a. integrity
b. uniqueness
c. consistency
d. design

11. Deadlocks are possible only when one of the transactions wants to obtain a(n) ____ lock on a data item.
a. binary
b. exclusive
c. shared
d. complete

12. The transaction log is a ____.

a. database
b. table
c. file
d. segment

13. Lock ____ indicates the level of lock use.

a. level
b. type
c. granularity
d. integrity

14. A database ____ is caused when two transactions wait for each other to unlock data.
a. exclusive lock
b. shared lock
c. deadlock
d. binary lock

15. In database terms, a(n) ____ is any action that reads from and/or writes to a database.
a. session
b. transaction
c. lock
d. interaction

16. In a ____ lock, the entire database is locked, thus preventing the use of any tables in the database by
transaction T2 while transaction Tl is being executed.
a. database-level
b. table-level
c. page-level
d. row-level
17. According to the ANSI SQL standard, when does a transaction begin?
a. with use of the START command
b. when the first SQL statement is encountered
c. with the BEGIN command
d. with the BEGIN TRANSACTION command

18. Recovery techniques are based on the ____ transaction property.

a. complete
b. time stamped
c. locked
d. atomic

19. When a(n) ____ statement is reached, all changes are permanently recorded within the database.
a. COMMIT
b. ROLLBACK
c. DONE
d. EXIT

20. Although the ____ locking approach improves the availability of data, its management requires high
overhead.
a. database-level
b. table-level
c. page-level
d. row-level

21. In a(n) ____ backup of the database, only the last modifications to the database are copied.
a. full
b. incomplete
c. differential
d. transaction log

22. The Oracle RDBMS uses the ____ statement to declare a new transaction start and its properties.
a. BEGIN
b. SET TRANSACTION
c. BEGIN TRANSACTION
d. COMMIT

3. The objective of ____ control is to ensure the serializability of transactions in a multiuser database
environment.
a. concurrency
b. transaction
c. isolation
d. integrity

24. All lock information is managed by a ____, which is responsible for assigning and policing the locks used
by the transactions.
a. scheduler
b. DBMS
c. lock manager
d. locking agent
25. ____ occur when a transaction calculates some summary (aggregate) functions over a set of data while other
transactions are updating the data.
a. Lost updates
b. Uncommitted data changes
c. Inconsistent retrievals
d. Incomplete retrievals

26. In the ____ scheme for time stamping concurrency control, the older transaction rolls back the younger
transaction and reschedules it.
a. wound/wait
b. die/wait
c. wait/die
d. older/younger

27. If several concurrent transactions are executed over the same data set and the second transaction updates the
database before the first transaction is finished, the ____ property is violated and the database is no longer
consistent.
a. atomicity
b. consistency
c. isolation
d. durability

28. When a program is abnormally terminated, the equivalent of a ____ command occurs.
a. COMMIT
b. ROLLBACK
c. QUIT
d. EXIT

29. What is a database request?

a. A transaction.
b. A series of SQL statements that implement all of the business rules in an application.
c. One or more SQL statements that implement one business rule.
d. A single SQL statement in an application program or transaction.

30. The three basic techniques to control deadlocks are: deadlock ____, deadlock detection, and deadlock
avoidance.
a. prevention
b. prohibition
c. rollback
d. commits

31. Which DBMS does not support transaction management by default?

a. Oracle
b. DB2
c. SQL Server
d. MS Access

32. A(n) ____ lock exists when concurrent transactions are granted Read access on the basis of a common lock.
a. binary
b. field-level
c. shared
d. exclusive
33. A database ____ is caused when two transactions wait for each other to unlock data.
a. exclusive lock
b. shared lock
c. deadlock
d. binary lock

34. With a ____ lock, the DBMS allows concurrent transactions to access different rows of the same table even
when the rows are located on the same page.
a. database-level
b. table-level
c. page-level
d. row-level

35. Deadlocks are possible only when one of the transactions wants to obtain a(n) ____ lock on a data item.
a. binary
b. exclusive
c. shared
d. complete

36. A ____ database state is one in which all data integrity constraints are satisfied.
a. fixed
b. complete
c. consistent
d. secure

37. The ____ is a special DBMS program that establishes the order in which the operations within concurrent
transactions are executed.
a. executor
b. parser
c. locker
d. scheduler