Q17

$2 \mathrm{PL}$ permits only serializable schedules

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

With $2 \mathrm{PL}$, 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

A deadlock is possible with $2 \mathrm{PL}$