closed by
616 views
0 votes
0 votes

Consider the following schedule involving two transactions:

S1: r1(A); w1(A); w2(B); w3(C); r1(D); w2(D).

S2:r3(A); w4(B); r1(C); r3(D); w3(B); w2(D); r3(A); w1(D); r3(B); r2(C); r1(A).

A) only S1 is followed under 2PL.

B) only s2 is followed under 2PL.

C) both s1 and s2 are allowed under 2PL.

D) neither s1 nor s2 are allowed under 2PL.

closed by

Related questions

170
views
1 answers
0 votes
Mrityudoot asked Jan 12
170 views
Isn’t F$^{+}$ minimal cover? If C $\rightarrow$ A is already there, then why does augmented CD $\rightarrow$ A needs to be?
208
views
1 answers
0 votes
tulsidas.bhu asked Jan 8
208 views
Can anyone explain how the answer is 10?
426
views
1 answers
1 votes
Sajal Mallick asked Nov 5, 2023
426 views
Unique not null is equivalent to primary key.Relational Algebra and SQL has same expressive power.Which of the above statements are False?
507
views
1 answers
2 votes
kaustubh7 asked Sep 20, 2023
507 views
Consider a relation R having seven attributes ABCDEFG. Fields of R contain only atomic values.FDs = {CD → G, A → BC, B → CF, E → A, F → EG, G → D} is set of f...