Computer Science · Database Management Systems
Let ri(D) and Wi(D) denote read and write operations respectively on data D by transaction Ti. Consider the following schedules: S1 = r2(A), r3(B), W2(A), r3(A), r1(C), r1(A), r2(C), W3(B), W1(C) S2 = W2(B), r3(A), r1(B), r3(B), r2(C), r1(C), W2(C), r3(C), W1(C) Which of the following is correct?
- 1S1 is conflict serializable✓
- 2For schedule S1, T2 → T3 → T1 is the only possible serial schedule conflict equivalent to S1
- 3S2 is view serializable
- 4Serial schedule T2 → T3 → T1 is view equivalent to S2
Correct answer
S1 is conflict serializable
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Want more practice questions on Database Management Systems?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Database Management Systems