Consider the following two phase locking protocol. Suppose a transaction \(T\)…

PYQ GATE 2016

Consider the following two phase locking protocol. Suppose a transaction TT accesses (for read or write operations), a certain set of objects {O1,...,Ok}\{O_1,...,O_k\}. This is done in the following manner:

Step 1. T acquires exclusive locks to O1,...,OkO_1, . . . , O_k in increasing order of their addresses.

Step 2. The required operations are performed.

Step 3. All locks are released.

This protocol will

  1. A.

    guarantee serializability and deadlock-freedom

  2. B.

    guarantee neither serializability nor deadlock-freedom

  3. C.

    guarantee serializability but not deadlock-freedom

  4. D.

    guarantee deadlock-freedom but not serializability

Attempted by 341 students.

Sign up free to check your answer

Sign up free

Explore the full course: Zero To Hero

Loading lesson…