| 1. | With regards to transaction processing, any DBMS should be capable of: |
|
Answer: (d).All of the above.
|
| 2. | What is ACID properties of Transactions? |
|
Answer: (b).Atomicity, Consistency, Isolation, Durability
|
| 3. | Database locking concept is used to solve the problem of |
|
Answer: (d).All of the above
|
| 4. | A lock that allows concurrent transactions to access different rows of the same table is known as a |
|
Answer: (a).Field-level lock
|
| 5. | A transaction completes its execution is said to be |
|
Answer: (d).Committed
|
| 6. | A system is in a ______ state if there exists a set of transactions such that every transaction in the set is waiting for another transaction in the set. |
|
Answer: (c).Deadlock
|
| 7. | The deadlock state can be changed back to stable state by using _____________ statement. |
|
Answer: (b).Rollback
|
| 8. | What are the ways of dealing with deadlock ? |
|
Answer: (d).All of the mentioned
|
| 9. | When transaction Ti requests a data item currently held by Tj , Ti is allowed to wait only if it has a timestamp smaller than that of Tj (that is, Ti is older than Tj ). Otherwise, Ti is rolled back (dies). This is |
|
Answer: (a).Wait-die
|
| 10. | When transaction Ti requests a data item currently held by Tj , Ti is allowed to wait only if it has a timestamp larger than that of Tj (that is, Ti is younger than Tj ). Otherwise, Tj is rolled back (Tj is wounded by Ti ). This is |
|
Answer: (c).Wound-wait
|
