Discussion
Home ‣ Database ‣ Managing Multiuser Databases Comments
- Question
Which of the following refers to a cursor type where changes of any type and from any source are visible?
Options- A. Forward only
- B. Static
- C. Keyset
- D. Dynamic
- Correct Answer
- Dynamic
- 1. Locks placed by the DBMS are called ________ .
Options- A. implicit locks
- B. explicit locks
- C. exclusive locks
- D. shared locks Discuss
- 2. The size of a lock is called:
Options- A. implicit lock.
- B. lock granularity.
- C. exclusive lock.
- D. shared lock. Discuss
- 3. Dirty read, nonrepeatable, and phantom reads are not possible in this instance.
Options- A. Read committed
- B. Read uncommitted
- C. Repeatable read
- D. Serializable Discuss
- 4. A transaction in which either all of the database actions occur or none of them do is called:
Options- A. atomic.
- B. consistent.
- C. isolated.
- D. durable. Discuss
- 5. Which of the following disallows both dirty reads and nonrepeatable reads, but allows phantom reads?
Options- A. Read committed
- B. Read uncommitted
- C. Repeatable read
- D. Serializable Discuss
- 6. Which of the following occurs when one transaction reads a changed record that has not been committed to the database?
Options- A. Nonrepeatable read
- B. Phantom read
- C. Dirty read
- D. Consistent read Discuss
- 7. Which of the following occurs when a transaction rereads data and finds new rows that were inserted by a command transaction since the prior read?
Options- A. Nonrepeatable read
- B. Phantom read
- C. Dirty read
- D. Consistent read Discuss
- 8. In this instance, dirty reads are disallowed, while nonrepeatable reads and phantom reads are allowed.
Options- A. Read committed
- B. Read uncommitted
- C. Repeatable read
- D. Serializable Discuss
- 9. The advantage of optimistic locking is that:
Options- A. the lock is obtained only after the transaction has processed.
- B. the lock is obtained before the transaction has processed.
- C. the lock never needs to be obtained.
- D. transactions that are best suited are those with a lot of activity. Discuss
- 10. A transaction for which all committed changes are permanent is called:
Options- A. atomic.
- B. consistent.
- C. isolated.
- D. durable. Discuss
Managing Multiuser Databases problems
Search Results
Correct Answer: implicit locks
Correct Answer: lock granularity.
Correct Answer: Serializable
Correct Answer: atomic.
Correct Answer: Repeatable read
Correct Answer: Dirty read
Correct Answer: Phantom read
Correct Answer: Read committed
Correct Answer: the lock is obtained only after the transaction has processed.
Correct Answer: durable.
Comments
There are no comments.More in Database:
Programming
Copyright ©CuriousTab. All rights reserved.