Register

GATE CSE 2010 | Question: 20

• edited by
22,760 views
51 votes
51 votes

Which of the following concurrency control protocols ensure both conflict serializability and freedom from deadlock?

  1. $2$-phase locking
  2. Time-stamp ordering
    1. I only
    2. II only
    3. Both I and II
    4. Neither I nor II
• edited by
User Avatar

6 Answers

2 votes
2 votes

2 Phase Locking (2PL) is a concurrency control method that guarantees serializability. The protocol utilizes locks, applied by a transaction to data, which may block (interpreted as signals to stop) other transactions from accessing the same data during the transaction’s life. 2PL may be lead to deadlocks that result from the mutual blocking of two or more transactions. See the following situation, neither T3 nor T4 can make progress.

Timestamp-based concurrency control algorithm is a non-lock concurrency control method. In Timestamp based method, deadlock cannot occur as no transaction ever waits.

User Avatar
0 votes
0 votes
Consider about the case of Strict 2PHASE locking protocol,

it is not deadlock free

Also

Time stamp ordering is no guarantee to have conflict serialisabilty

 

HENCE D is answer
User Avatar
Page:
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

31 votes
31 votes
4 answers
1
go_editor asked Sep 30, 2014
10,577 views
GATE CSE 2010 | Question: 42
Consider the following schedule for transactions $T1, T2$ and $T3:$ ... correct serialization of the above? $T1 \to T3 \to T2$ $T2 \to T1 \to T3$ $T2 \to T3 \to T1$ $T3 \to T1 \to T2$
Consider the following schedule for transactions $T1, T2$ and $T3:$$$\begin{array}{|c|c|c|}\hline \textbf{T1} & \textbf{T2} & \textbf{T3} \\\hline \text{Read(X)} & \text...
User Avatar
42 votes
42 votes
8 answers
2
go_editor asked Sep 30, 2014
13,154 views
GATE CSE 2010 | Question: 43
The following functional dependencies hold for relations $R(A, B, C)$ and $S(B, D, E).$ $ B \to A$ $A \to C$ The relation $R$ contains $200$ tuples and the relation $S$ contains $100$ tuples. What is the maximum number of tuples possible in the natural join $R \bowtie S$? $100$ $200$ $300$ $2000$
The following functional dependencies hold for relations $R(A, B, C)$ and $S(B, D, E).$ $ B \to A$$A \to C$The relation $R$ contains $200$ tuples and the relation $S$ con...
User Avatar
29 votes
29 votes
2 answers
3
go_editor asked Sep 29, 2014
8,359 views
GATE CSE 2010 | Question: 19
A relational schema for a train reservation database is given below. passenger(pid, pname, age) reservation(pid, class, tid) ... (SELECT * FROM Passenger WHERE age>65 AND Passenger.pid=Reservation.pid) $1, 0$ $1, 2$ $1, 3$ $1, 5$
A relational schema for a train reservation database is given below.passenger(pid, pname, age)reservation(pid, class, tid)$$\overset{\text{Passenger}}{\begin{array}{|c|c|...
User Avatar
56 votes
56 votes
8 answers
4
go_editor asked Sep 29, 2014
32,930 views
GATE CSE 2010 | Question: 18
Consider a $B^+$-tree in which the maximum number of keys in a node is $5$. What is the minimum number of keys in any non-root node? $1$ $2$ $3$ $4$
Consider a $B^+$-tree in which the maximum number of keys in a node is $5$. What is the minimum number of keys in any non-root node?$1$$2$$3$$4$
User Avatar
Link Copied!