1,026 views
1 votes
1 votes
T1T2
R(A) 
 R(A)
 R(B)
  
  
R(B) 
 W(A)
 COMMIT
  
R(A) 
W(A) 
COMMIT 

in the above problem identify the concurrency in the following Schedule involving 2 Transaction T1 AND T2 (r: read and w : write )

a) Dirty Read problem 

b) Unrepeatable Read problem 

c) Lost update Problem 

d) Both a and b 

2 Answers

3 votes
3 votes
  • Dirty read ( uncommitted W-R ) : does not exist here.
  • Unrepeatable read ( R-W ) : exists. As R(A) is read in T1 and W(A) is done in T2.
  • Lost update ( W-W ) : does not exist here'
 
So , Unrepeatable read exists here.
0 votes
0 votes
every write commit before next operation..

no Write Write conflict so no Lost update problem.
no Dirty read also..

Related questions

0 votes
0 votes
0 answers
1
jayadev asked Jul 2, 2022
368 views
question about concurrency control methods
2 votes
2 votes
0 answers
3
1 votes
1 votes
0 answers
4