Register

ACE TEST SERIES:-Transaction 2pl and Time stamp based protocol

• edited by
1,150 views
2 2 votes

State which of the protocols allows the schedule
\[
\begin{array}{l}
T_{1}: R(x), T_{2}: W(x), T_{1}: W(x), T_{3}: R(x), \\
T_{1}: \text { commit, } T_{2}: \text { commit, } T_{3}: \text { commit }
\end{array}
\]

  1. Both 2 PL and time stamp ordering protocol allow it.
  2. Time stamp ordering protocol allows it but not 2 PL
  3. Allowed in 2 PL but not in Time stamp ordering protocol
  4. Not allowed both in 2 PL and time stamp ordering protocol

1 Answer

Voting & Accepting an answer helps improve the community
← Previous · Generating functionNext → · Time Complexity And ...
← Previous in category · ACE-MockTest-Seriali...Next in category → · Test series
Position:
Show:

Related questions

2 2 votes
4 4 answers
6.9k
6.9k views
KISHALAY DAS asked Dec 21, 2016
6,949 views
ME-FST6:Transaction,Recoverability and 2PL
0 0 votes
2 2 answers
1.1k
1.1k views
ashunimbz asked Mar 30, 2019
1,051 views
Self doubt on 2PL protocol
How can 2PL protocol ( simple one ) ensure conflict serializability even though it cannot ensure freedom from deadlock ?I mean ,if a schedule is conflict serializable it...
0 0 votes
0 0 answers
647
647 views
Parimal Paritosh asked Sep 2, 2018
647 views
2pl protocol
Can someone explain how transactions can be serialized in order of their lock points (the point where the transactions acquire their final lock)?
2 2 votes
1 1 answer
854
854 views
Abhijeet_Kumar asked Dec 8, 2017
854 views
Transaction
Consider two transactions $T_{1}$ and $T_{2}$ are given as follows$\mathrm{T}_{1}: \mathrm{R}(\mathrm{A}) \mathrm{W}(\mathrm{A}) \mathrm{R}(\mathrm{B}) \mathrm{W}(\mathrm...