Register

Transaction

• edited by
795 views
0 votes
0 votes

Consider the following schedule: 

Which of the following is correct about above schedule?

  1. $Schedule(S)$ is not conflict serializable schedule.
  2. $Schedule(S)$ is allowed by $2PL$.
  3. $Schedule(S)$ is strict recoverable schedule.
  4. $Schedule(S)$ is allowed by strict $2PL$.

Reason Please

• edited by
User Avatar

1 Answer

Best answer
1 votes
1 votes

Option b is right.

• selected by
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
2 answers
1
gatecrack asked Dec 10, 2018
723 views
Transaction dbms self doubt
T1 T2 R(A) W(A) W(A) IS THIS IS VIEW SERIALIZABLE?PLZ EXPLAIN
T1T2R(A) W(A)W(A) IS THIS IS VIEW SERIALIZABLE?PLZ EXPLAIN
User Avatar
1 votes
1 votes
1 answer
2
Ravi prakash pandey asked Apr 10, 2018
312 views
Transaction
how view serializability ensures serial schedule?? i mean in view we leave many conflict like RW,WW,......we only talks about WR conflict and intial read and final write. then how it ensurs serailizability??
how view serializability ensures serial schedule??i mean in view we leave many conflict like RW,WW,......we only talks about WR conflict and intial read and final write.t...
User Avatar
2 votes
2 votes
0 answers
3
ashish pal asked Jan 26, 2018
463 views
Ace Test Series: DBMS - Transaction And Serializablity
Answer given is 24 which is the no. of serial schedules possible, but my doubt is since no two transactions share same variables then all the schedules possible will be conflict serializable then why only serial schedules are considered ?
Answer given is 24 which is the no. of serial schedules possible, but my doubt is since no two transactions share same variables then all the schedules possible will be c...
User Avatar
2 votes
2 votes
1 answer
4
Abhijeet_Kumar asked Dec 8, 2017
379 views
Transaction
User Avatar
Link Copied!