Register

GO Classes DPP | Databases | Transaction control | ISRO

564 views

3 Answers

1 1 vote
A) TIme stamp ordering protocol ensures conflict serializability and is deadlock free
B) 2PL is conflict serializable but not all are deadlock free instead only conservative 2PL is deadlock free
Thus answer is A)
0 0 votes

Answer: Option A 
              Timestamp Protocol ensures conflict serializability and deadlocks both.
              While 2PL only ensures conflict serializability.

Voting & Accepting an answer helps improve the community
← Previous · GO Classes | ISRO CS...Next → · GO Classes DPP | Dat...
← Previous in category · GO Classes DPP | Dat...Next in category → · GO Classes DPP | Dat...
Position:
Show:

Related questions

7 7 votes
3 3 answers
991
991 views
GO Classes asked Jul 24, 2025
991 views
GO Classes DPP | Databases | Transaction control | UGC NET
Which one of the following is NOT a part of ACID properties of a database transaction?AtomicityConsistencyIsolationDeadlock-freedom
3 3 votes
4 4 answers
768
768 views
GO Classes asked Jul 24, 2025
768 views
GO Classes DPP | Databases | ER Model | UGC NET
Match the following:$a-iii, b-iv, c-ii, d-i$ $a-iv, b-iii, c-ii, d-i$ $a-ii, b-iii, c-iv, d-i$ $a-iii, b-iv, c-i, d-ii$
4 4 votes
5 answers 5 answers
1.2k
1.2k views
GO Classes asked Jul 24, 2025
1,191 views
GO Classes DPP | Databases | Normalization
Consider the following two statements:Statement I: A relation in Second Normal Form (2NF) has no partial dependencies.Statement II: A relation in Third Normal Form (3NF) ...
2 2 votes
3 3 answers
718
718 views
GO Classes asked Jul 24, 2025
718 views
GO Classes DPP | Databases | B tree | UGC NET
The upper bound and lower bound for the number of leaves in a B-tree of degree $K$ with height $h$ is given by :$K^h$ and $2\left\lceil\frac{k}{2}\right\rceil^{h-1}$ $K *...