Which of the following schemes allows an older transaction to wait for a younger transaction? A) Wound-Wait B) Wait-Die C) Both D) None | Card: 1 / 20 |
Fill in the blank: The property that ensures a transaction's changes are permanent even in the event of a system failure is called ______. | Card: 3 / 20 |
True or False: Starvation in a database occurs when a transaction can proceed without any waiting. | Card: 5 / 20 |
False. Starvation occurs when a transaction cannot proceed for an indefinite time because of resource allocation issues. | Card: 6 / 20 |
Riddle: I am a protocol that guarantees that transactions can execute without interference, and I come in four levels. What am I? | Card: 9 / 20 |
![]() Unlock all Flashcards with EduRev Infinity Plan Starting from @ ₹99 only |
Which protocol ensures that all exclusive locks must be released after a transaction commits? | Card: 11 / 20 |
Fill in the blank: The algorithm used to check for cycles in a set of transactions is called ______. | Card: 13 / 20 |
True or False: Deadlock detection requires a system to actively monitor transactions for potential deadlocks. | Card: 15 / 20 |
A recoverable schedule ensures that transactions only commit after all transactions whose changes they read have committed. | Card: 20 / 20 |






