ACtE06 · Chapter 6Basic Electrical & Electronics🏛️ Past Licensure QuestionID: 5f76e629
In database transaction management, which deadlock prevention scheme allows an older transaction to wait for a younger one, but kills the younger if it requests an item held by an older one?
In database transaction management, which deadlock prevention scheme allows an older transaction to wait for a younger one, but kills the younger if it requests an item held by an older one?
Multiple Choice Options
- A
Wait-wound
- B✓ Correct Option
Wait-die
- C
Wound-wait
- D
wait
Detailed Technical Solution & Explanation
The Wait-Die scheme is a non-preemptive deadlock prevention algorithm based on transaction timestamps: if an older transaction requests a lock held by a younger transaction , is allowed to wait. If a younger transaction requests a lock held by an older transaction , dies (aborts and restarts).
Option Analysis:
•
Option A (Wait-wound): Incorrect. Non-standard naming.
•
Option B (Wait-die): Correct. Older transactions wait; younger requesting transactions die.
•
Option C (Wound-wait): Incorrect. In Wound-Wait, older preempts (wounds) younger, younger waits.
•
Option D (wait): Incorrect. Unconditional waiting leads to deadlocks.
Reference: Mock Test 05NEC Licensure Syllabus