Computer Sciences > GATE 2024 Set-2 > DBMS

Contributed by: Dr. Sarah Chen

Report Correct Copyright Claim

Which of the following statements about the Two Phase Locking (2PL) protocol is/are TRUE?

A

2PL permits only serializable schedules

B

With 2PL, a transaction always locks the data item being read or written just before every operation and always releases the lock just after the operation

C

With 2PL, once a lock is released on any data item inside a transaction, no more locks on any data item can be obtained inside that transaction

D

A deadlock is possible with 2PL

Check Answer

Explanation

Correct : c,d

Similar Questions

What is the worst-case time complexity of insertion in an AVL tree?

Question #23 Medium

Which operations on a binary search tree have O(h) complexity?

Question #31 Easy

Compare search complexities of sorted array vs balanced BST.

Question #47 Hard

Related Topics

Data Structures Binary Search Tree Time Complexity Algorithm Analysis Tree Algorithms Computer Science