Computer Science · Database Management Systems
Consider a database system applying the Basic Timestamp Ordering (BTO) Protocol incorporating Thomas's Write Rule. For a data item Z, the initial timestamps are R-TS(Z) = 50 and W-TS(Z) = 45. A sequence of write requests is made by concurrent transactions in the following chronological order: 1. Transaction T1 with TS(T1) = 48 requests write(Z)2. Transaction T2 with TS(T2) = 65 requests write(Z)3. Transaction T3 with TS(T3) = 55 requests write(Z)4. Transaction T4 with TS(T4) = 60 requests write(Z)5. Transaction T5 with TS(T5) = 70 requests write(Z) Calculate the final value of W-TS(Z) after all requests are processed sequentially, and determine the exact number of transactions whose write requests were SKIPPED (ignored) without being aborted.
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1Final W-TS(Z) = 70, Skipped writes = 1
- 2Final W-TS(Z) = 70, Skipped writes = 2✓
- 3Final W-TS(Z) = 65, Skipped writes = 2
- 4Final W-TS(Z) = 70, Skipped writes = 3
Correct answer
Final W-TS(Z) = 70, Skipped writes = 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!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Database Management Systems MCQs →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