Computer Science · Database Management Systems
Consider the following schedule S consisting of transactions T1, T2, and T3: T1: Read(A) T2: Write(A) T3: Write(A) T1: Write(A) Which of the following statements is true regarding schedule S?
- 1Neither conflict nor view serializable
- 2Both view and conflict serializable
- 3Conflict serializable but not view serializable
- 4View serializable but not conflict serializable✓
Correct answer
View serializable but not 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