Register

#transaction

283 views
0 0 votes
Consider the following schedule:

T1: LOCK-X(A)
T1: READ(A)
T1: A = A + 3
T1: WRITE(A)

T2: LOCK-S(B)
T2: READ(B)
T2: LOCK-S(A)

T1: LOCK-X(B)

The above schedule is (select the most suitable answer where X and S represent exclusive
and shared locks respectively) :
(A) Allowed under basic 2 phase locking protocol
(B) Not allowed under basic 2 phase locking protocol
(C) Allowed under basic 2 phase locking protocol but there is no deadlock
(D) Allowed under basic 2 phase locking protocol and there is no dead lock

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · MA Maths 2013 Q. 42Next → · UGC NET CSE | Decemb...
← Previous in category · DatabaseNext in category → · UGC NET CSE | Decemb...
Position:
Show:

Related questions

0 0 votes
0 0 answers
638
638 views
gatecrack asked Sep 5, 2018
638 views
transaction and concurrency control protocol
Consider th following scheduler1(A)r2(B)r3(C)w1(B)w2(C)w3(D)Find the schedule which are possible to execute by strict 2PL protocol? consider commit operation as immediate...
1 1 vote
2 2 answers
1.1k
1.1k views
Tuhin Dutta asked Aug 12, 2017
1,144 views
#Transaction-Schedules
How to order these schedules in terms of flexibility of concurrency?1. View serializable2. Conflict Serializable3.Recoverable4.Strict5.Cascadeless
4 4 votes
2 answers 2 answers
3.6k
3.6k views
shefali1 asked Dec 10, 2016
3,617 views
#dbms #transaction
Consider the 2 transactions T1 and T2 and four schedules S1, S2, S3 and S4 of T1 and T2 aregiven below:T1: R1[X] W1[X] W1[Y]T2: R2[X] R2[Y] W2[Y]S1: R1[X] R2[X] R2[Y] W1[...