Computer Science · Database Management Systems
Consider a database system using the Basic Timestamp Ordering (BTO) Protocol. The initial timestamps for data items X and Y are given as follows: R-TS(X) = 25, W-TS(X) = 30 R-TS(Y) = 15, W-TS(Y) = 20 The following sequence of read operations is requested by concurrent transactions: 1. Transaction T1 with TS(T1) = 28 requests read(X)2. Transaction T2 with TS(T2) = 35 requests read(X)3. Transaction T3 with TS(T3) = 22 requests read(Y)4. Transaction T4 with TS(T4) = 18 requests read(Y) Calculate the final values of the Read-Timestamps R-TS(X) and R-TS(Y) after all four requests are processed sequentially.
- 1R-TS(X) = 25, R-TS(Y) = 18
- 2R-TS(X) = 28, R-TS(Y) = 22
- 3R-TS(X) = 30, R-TS(Y) = 20
- 4R-TS(X) = 35, R-TS(Y) = 22✓
Correct answer
R-TS(X) = 35, R-TS(Y) = 22
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