GATE Databases: Transactions and Concurrency Control – Previous Year Questions
15 GATE previous year questions on Transactions and Concurrency Control (Databases, Computer Science) with answers and explanations, from every paper.
- GATE 2017 CS Q52 – In a database system, unique timestamps are assigned to each transaction using Lamport's logical clock. Let TS(T 1) and TS(T 2) be the timestamps of…
- GATE 2016 CS Q32 – Which one of the following is NOT a part of the ACID properties of database transactions?
- GATE 2016 CS Q61 – Consider the following two phase locking protocol. Suppose a transaction T accesses (for read or write operations), a certain set of objects \O 1, , O…
- GATE 2019 CS Q21 – Consider the following two statements about database transaction schedules: I. Strict two-phase locking protocol generates conflict serializable…
- GATE 2026 CS (CS2) Q20 – Consider concurrent execution of two transactions T 1 and T 2 in a DBMS, both of which access a data object A. For these two transactions to not…
- GATE 2025 CS (CS2) Q27 – An audit of a banking transactions system has found that on an earlier occasion, two joint holders of account A attempted simultaneous transfers of…
- GATE 2025 CS (CS2) Q53 – Consider the database transactions T1 and T2, and data items X and Y. Which of the schedule(s) is/are conflict serializable? Transaction T1: R1(X),…
- GATE 2025 CS (CS1) Q15 – A 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 transaction T i, i =…
- GATE 2024 CS (CS2) Q19 – Once the DBMS informs the user that a transaction has been successfully completed, its effect should persist even if the system crashes before all its…
- GATE 2024 CS (CS2) Q27 – Which of the following statements about the Two Phase Locking (2PL) protocol is/are TRUE?
- GATE 2024 CS (CS1) Q46 – Consider the read-write schedule S over three transactions T 1,T 2,T 3: S: r 1(z); w 1(z); r 2(x); r 3(y); w 3(y); r 2(y); w 2(x); w 2(y);. Which of…
- GATE 2022 CS Q39 – Let R i(z) and W i(z) denote read and write operations on a data element z by a transaction T i, respectively. Consider the schedule S with four…
- GATE 2021 CS Q23 – Suppose a database system crashes again while recovering from a previous crash. Assume checkpointing is not done by the database either during the…
- GATE 2021 CS Q42 – Let r i(z) and w i(z) denote read and write operations respectively on a data item z by a transaction T i. Consider the following two schedules. S 1:…
- GATE 2020 CS Q47 – Consider a schedule of transactions T 1 and T 2. In time order (RX = Read(X), WX = Write(X)): T1:RA, T2:RB, T2:WB, T1:RC, T2:RD, T1:WD, T2:WC, T1:WB,…