DBMS | Time Stamp | CS GATE PYQs | GATE 2017 Set-1 Solutions | Solutions Adda | Q14 | GATE 2022

GATE CS 2017 SET-1 Q: In a database system, unique timestamps are assigned to each transaction using Lamport’s logical clock. Let TS(T1) and TS(T2) be the timestamps of transactions T1 and T2 respectively. Besides, T1 holds a lock on the resource R and T2 has requested a conflicting lock on the same resource R. The following algorithm is used to prevent deadlocks in the database system assuming that a killed transaction is restarted with the same timestamp.
if TS(T2) LESS THAN TS(T1) then
T1 is killed
else T2 waits.
Assume any transaction that is not killed terminates eventually. Which of the following is TRUE about the database system that uses the above algorithm to prevent deadlocks?

GATE Previous Year Questions with detailed explanation question by question
Website: https://solutionsadda.in/
ISRO / DRDO PYQs: https://solutionsadda.in/isro/
GATE PYQs : https://solutionsadda.in/gate1/
NIC - NIELIT PYQs: https://solutionsadda.in/nielit/

ISRO Complete Analysis: https://solutionsadda.in/isro-complet...
NIC-NIELIT Complete Analysis: https://solutionsadda.in/nielit/
GATE Complete Analysis: https://solutionsadda.in/gate-complet...

For GATE, BARC, ISRO, CIL, AAI, HAL, UGC NET JRF, NIC NIELIT, STQC NIELIT, NVS, KVS, DSSSB PGT/TGT
Test series : https://solutionsadda.in/test-series/ && http://new.solutionsadda.in/index.php...

If you have any queries write a mail: [email protected]
Face Book Page:   / solutionsaddain-111628724482494  
Telegram: https://t.me/solutionsaddaforcse