GATE Exam  >  GATE Questions  >  In a database system, unique time stamps are ... Start Learning for Free
In a database system, unique time stamps are assigned to each transaction using Lamport’s logical clock. Let TS(T1) and TS(T2) be the time stamps 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 assuming that a killed transaction is restarted with the same timestamp.
 
Q. Assume any transactions that is not killed terminates eventually. Which of the following is TRUE about the database system that uses the above algorithm to prevent deadlocks?
  • a)
    The database system is both deadlock-free and starvation- free.
  • b)
    The database system is deadlock- free, but not starvation-free.
  • c)
    The database system is starvation-free but not deadlock- free.
  • d)
    The database system is neither deadlock- free nor starvation-free
Correct answer is option 'A'. Can you explain this answer?
Verified Answer
In a database system, unique time stamps are assigned to each transact...
Given, if TS(T2) <TS(T1) then T1 is killed else T2 waits.
  • T1 holds a lock on the resource R
  • T2 has requested a conflicting lock on the same resource R
According to algo, TS(T2) <TS(T1) then T1 is killed else T2 will wait. So in both cases neither deadlock will happen nor starvation. Therefore, option A is correct
View all questions of this test
Explore Courses for GATE exam
In a database system, unique time stamps are assigned to each transaction using Lamport’s logical clock. Let TS(T1) and TS(T2) be the time stamps 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 assuming that a killed transaction is restarted with the same timestamp.Q.Assume any transactions that is not killed terminates eventually. Which of the following is TRUE about the database system that uses the above algorithm to prevent deadlocks?a)The database system is both deadlock-free and starvation- free.b)The database system is deadlock- free, but not starvation-free.c)The database system is starvation-free but not deadlock- free.d)The database system is neither deadlock- free nor starvation-freeCorrect answer is option 'A'. Can you explain this answer?
Question Description
In a database system, unique time stamps are assigned to each transaction using Lamport’s logical clock. Let TS(T1) and TS(T2) be the time stamps 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 assuming that a killed transaction is restarted with the same timestamp.Q.Assume any transactions that is not killed terminates eventually. Which of the following is TRUE about the database system that uses the above algorithm to prevent deadlocks?a)The database system is both deadlock-free and starvation- free.b)The database system is deadlock- free, but not starvation-free.c)The database system is starvation-free but not deadlock- free.d)The database system is neither deadlock- free nor starvation-freeCorrect answer is option 'A'. Can you explain this answer? for GATE 2024 is part of GATE preparation. The Question and answers have been prepared according to the GATE exam syllabus. Information about In a database system, unique time stamps are assigned to each transaction using Lamport’s logical clock. Let TS(T1) and TS(T2) be the time stamps 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 assuming that a killed transaction is restarted with the same timestamp.Q.Assume any transactions that is not killed terminates eventually. Which of the following is TRUE about the database system that uses the above algorithm to prevent deadlocks?a)The database system is both deadlock-free and starvation- free.b)The database system is deadlock- free, but not starvation-free.c)The database system is starvation-free but not deadlock- free.d)The database system is neither deadlock- free nor starvation-freeCorrect answer is option 'A'. Can you explain this answer? covers all topics & solutions for GATE 2024 Exam. Find important definitions, questions, meanings, examples, exercises and tests below for In a database system, unique time stamps are assigned to each transaction using Lamport’s logical clock. Let TS(T1) and TS(T2) be the time stamps 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 assuming that a killed transaction is restarted with the same timestamp.Q.Assume any transactions that is not killed terminates eventually. Which of the following is TRUE about the database system that uses the above algorithm to prevent deadlocks?a)The database system is both deadlock-free and starvation- free.b)The database system is deadlock- free, but not starvation-free.c)The database system is starvation-free but not deadlock- free.d)The database system is neither deadlock- free nor starvation-freeCorrect answer is option 'A'. Can you explain this answer?.
Solutions for In a database system, unique time stamps are assigned to each transaction using Lamport’s logical clock. Let TS(T1) and TS(T2) be the time stamps 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 assuming that a killed transaction is restarted with the same timestamp.Q.Assume any transactions that is not killed terminates eventually. Which of the following is TRUE about the database system that uses the above algorithm to prevent deadlocks?a)The database system is both deadlock-free and starvation- free.b)The database system is deadlock- free, but not starvation-free.c)The database system is starvation-free but not deadlock- free.d)The database system is neither deadlock- free nor starvation-freeCorrect answer is option 'A'. Can you explain this answer? in English & in Hindi are available as part of our courses for GATE. Download more important topics, notes, lectures and mock test series for GATE Exam by signing up for free.
Here you can find the meaning of In a database system, unique time stamps are assigned to each transaction using Lamport’s logical clock. Let TS(T1) and TS(T2) be the time stamps 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 assuming that a killed transaction is restarted with the same timestamp.Q.Assume any transactions that is not killed terminates eventually. Which of the following is TRUE about the database system that uses the above algorithm to prevent deadlocks?a)The database system is both deadlock-free and starvation- free.b)The database system is deadlock- free, but not starvation-free.c)The database system is starvation-free but not deadlock- free.d)The database system is neither deadlock- free nor starvation-freeCorrect answer is option 'A'. Can you explain this answer? defined & explained in the simplest way possible. Besides giving the explanation of In a database system, unique time stamps are assigned to each transaction using Lamport’s logical clock. Let TS(T1) and TS(T2) be the time stamps 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 assuming that a killed transaction is restarted with the same timestamp.Q.Assume any transactions that is not killed terminates eventually. Which of the following is TRUE about the database system that uses the above algorithm to prevent deadlocks?a)The database system is both deadlock-free and starvation- free.b)The database system is deadlock- free, but not starvation-free.c)The database system is starvation-free but not deadlock- free.d)The database system is neither deadlock- free nor starvation-freeCorrect answer is option 'A'. Can you explain this answer?, a detailed solution for In a database system, unique time stamps are assigned to each transaction using Lamport’s logical clock. Let TS(T1) and TS(T2) be the time stamps 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 assuming that a killed transaction is restarted with the same timestamp.Q.Assume any transactions that is not killed terminates eventually. Which of the following is TRUE about the database system that uses the above algorithm to prevent deadlocks?a)The database system is both deadlock-free and starvation- free.b)The database system is deadlock- free, but not starvation-free.c)The database system is starvation-free but not deadlock- free.d)The database system is neither deadlock- free nor starvation-freeCorrect answer is option 'A'. Can you explain this answer? has been provided alongside types of In a database system, unique time stamps are assigned to each transaction using Lamport’s logical clock. Let TS(T1) and TS(T2) be the time stamps 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 assuming that a killed transaction is restarted with the same timestamp.Q.Assume any transactions that is not killed terminates eventually. Which of the following is TRUE about the database system that uses the above algorithm to prevent deadlocks?a)The database system is both deadlock-free and starvation- free.b)The database system is deadlock- free, but not starvation-free.c)The database system is starvation-free but not deadlock- free.d)The database system is neither deadlock- free nor starvation-freeCorrect answer is option 'A'. Can you explain this answer? theory, EduRev gives you an ample number of questions to practice In a database system, unique time stamps are assigned to each transaction using Lamport’s logical clock. Let TS(T1) and TS(T2) be the time stamps 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 assuming that a killed transaction is restarted with the same timestamp.Q.Assume any transactions that is not killed terminates eventually. Which of the following is TRUE about the database system that uses the above algorithm to prevent deadlocks?a)The database system is both deadlock-free and starvation- free.b)The database system is deadlock- free, but not starvation-free.c)The database system is starvation-free but not deadlock- free.d)The database system is neither deadlock- free nor starvation-freeCorrect answer is option 'A'. Can you explain this answer? tests, examples and also practice GATE tests.
Explore Courses for GATE exam
Signup for Free!
Signup to see your scores go up within 7 days! Learn & Practice with 1000+ FREE Notes, Videos & Tests.
10M+ students study on EduRev