Computer Science · Database Management Systems
Consider the following chronological schedule of operations executed by three concurrent transactions T1, T2, and T3 on data items A and B: 1. R1(A)2. R2(A)3. W1(A)4. W2(B)5. R3(B)6. W3(A) By analyzing the conflicts to construct a Precedence Graph (Serialization Graph), determine the total number of unique directed edges in the graph and whether the schedule is conflict serializable.
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 12 unique edges; Graph is acyclic; Conflict Serializable
- 23 unique edges; Graph has a cycle; Not Conflict Serializable
- 35 unique edges; Graph has a cycle; Not Conflict Serializable
- 43 unique edges; Graph is acyclic; Conflict Serializable✓
Correct answer
3 unique edges; Graph is acyclic; 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!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Database Management Systems MCQs →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