Two transactions and are given as
where denotes a read operation by transaction on a variable V and denotes a write operation by transaction on a variable V. The total number of conflict serializable schedules that can be formed by and is ________.
GATE CS 2017 (Afternoon) — Question 44
Database Management Systems (DBMS)Transactions, Concurrency Control, Conflict SerializabilityNAT2 marksHard
A GATE question every morning
One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.
More on Transactions, Concurrency Control, Conflict Serializability
- GATE CS 2026 (Afternoon) · Q20Consider concurrent execution of two transactions T1 and T2 in a DBMS, both of which access a data object A . For these two transactions to…
- GATE CS 2025 (Forenoon) · Q15A schedule of three database transactions T 1 , T 2 , and T 3 is shown. R i(A) and W i(A) denote read and write of data item A by transacti…
- GATE CS 2025 (Afternoon) · Q27An audit of a banking transactions system has found that on an earlier occasion, two joint holders of account A attempted simultaneous tran…
- GATE CS 2025 (Afternoon) · Q53Consider the database transactions T1 and T2, and data items X and Y. Which of the schedule(s) is/are conflict serializable?
- GATE CS 2024 (Forenoon) · Q46Consider the following read-write schedule S over three transactions T 1 , T 2 and T 3 , where the subscripts in the schedule indicate tran…
- GATE CS 2024 (Afternoon) · Q19Once the DBMS informs the user that a transaction has been successfully completed, its effect should persist even if the system crashes bef…

