GATE CS 2016 Set 1 — Question 61
Go beyond PYQs with Success TrackerAI-powered personalised practice and doubt support. Unlimited practice on eligible plans; AI usage limits apply.MCQ+2 / -0.67MediumLock-Based ProtocolsTransactions & ConcurrencyDatabasesTwo-Phase LockingDeadlock PreventionDeadlocksOperating System
Databases → Deadlocks → Deadlock Prevention
Last updated
Question
Consider the following two phase locking protocol. Suppose a transaction accesses (for read or write operations), a certain set of objects . This is done in the following manner:Step 1. acquires exclusive locks to in increasing order of their addresses.
Step 2. The required operations are performed.
Step 3. All locks are released.This protocol will
Step 2. The required operations are performed.
Step 3. All locks are released.This protocol will
Correct answer
(A) guarantee serializability and deadlock-freedom
Solution
1.Deadlock-freedom: The protocol requires acquiring locks in a specific global order (increasing order of addresses). This prevents the "circular wait" condition necessary for deadlock. Thus, the system is deadlock-free.
2.Serializability: The protocol follows the Two-Phase Locking (2PL) rule (all locks acquired in growing phase, released in shrinking phase). In fact, this is a strict form called Conservative or Static 2PL where all locks are pre-claimed. 2PL ensures conflict serializability.
Continue learning with Success Tracker
A step still unclear? Work through it with support
Use Success Tracker to ask about the reasoning, then try another GATE CS question to check your understanding.
AI-powered practice· Unlimited practice on eligible plans
- PYQs with solutions
- Attempt available previous-year questions, then compare your reasoning with the worked solution. Coverage varies by stream.
- Practice that adapts
- Choose a topic, work on weaker areas and bookmark questions to revisit. Your attempts feed your progress tracking.
- AI doubt support
- Ask follow-up questions about a step or concept while practising, instead of stopping at the final answer.
Unlimited practice is available on eligible plans. Free practice and AI usage have limits; check the current plan allowances before choosing.
This page stays readable without an account. AI responses can be wrong; check them against the solution and source material.
More questions on Deadlocks
2026 Set 2 Q15In the context of DBMS, consider the two sets T and S given below. | T | S | |---|---| | I:…2026 Set 2 Q20Consider concurrent execution of two transactions and in a DBMS, both of which access a…2026 Set 2 Q23Which one of the following CPU scheduling algorithms cannot be preemptive?2026 Set 1 Q29With respect to deadlocks in an operating system, which of the following statements is/are FALSE?2026 Set 1 Q30Let and be the attributes of a relation in a relational schema. Let…