Computer Science · Database Management Systems
Consider four transactions with their respective start times: T1 (started at 10:00 AM), T2 (started at 10:15 AM), T3 (started at 10:30 AM), and T4 (started at 10:45 AM). The following independent lock requests occur: Scenario 1: T3 requests a lock on a data item currently held by T1. Scenario 2: T2 requests a lock on a data item currently held by T4. Based on the Wait-Die and Wound-Wait deadlock prevention schemes, determine the exact outcomes for both scenarios.
- 1Wait-Die: T3 waits in Scenario 1, and T4 dies in Scenario 2. Wound-Wait: T1 wounds T3 in Scenario 1, and T2 waits in Scenario 2.
- 2Wait-Die: T1 dies in Scenario 1, and T2 waits in Scenario 2. Wound-Wait: T3 wounds T1 in Scenario 1, and T4 waits in Scenario 2.
- 3Wait-Die: T3 dies in Scenario 1, and T2 wounds T4 in Scenario 2. Wound-Wait: T3 waits in Scenario 1, and T2 waits in Scenario 2.
- 4Wait-Die: T3 dies in Scenario 1, and T2 waits in Scenario 2. Wound-Wait: T3 waits in Scenario 1, and T2 wounds T4 in Scenario 2.✓
Correct answer
Wait-Die: T3 dies in Scenario 1, and T2 waits in Scenario 2. Wound-Wait: T3 waits in Scenario 1, and T2 wounds T4 in Scenario 2.
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Want more practice questions on Database Management Systems?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Database Management Systems