DBMS-Transaction Processing and Concurrency Control Questions and Answers
Practice ModeShowing 10 of 66 questions
Q21
Cascading rollbacks are not desirable.
Answer: Option A
Q22
Cascading rollbacks are not desirable.
Answer: Option A
Q23
Locking and timestamp ordering are optimistic techniques, as they are designed based on the assumption that conflict is rare.
Answer: Option A
Q24
Two types of locks are Read and Write locks.
Answer: Option A
Q25
In the two-phase locking, every transaction is divided into (a0 growing phase and (b) shrinking phase.
Answer: Option A
Q26
A dirty read problem occurs when one transaction updates a database item and then the transaction fails for some reason.
Answer: Option A
Q27
The size of the locked item determines the granularity of the lock.
Answer: Option A
Q28
There is no deadlock in the timestamp method of concurrency control.
Answer: Option A
Q29
A transaction that changes the contents of the database must alter the database from one consistent state to another
Answer: Option A
Q30
A transaction is said to be in committed state if it has partially committed, and it can be ensured that it will never be aborted.
Answer: Option A