A transaction is a unit of work on the database that could be completed in its entirety or done partially. True or False?

A COMMIT operation signals a successful end of transaction, while ROLLBACK signals an unsuccessful operation.

A schedule with interleaved operations must be a non-serializable schedule. True or False

If a transaction has a shared lock on a database record R, another transaction can issue a shared lock on R. True or False?

If a transaction has a shared lock on a database record R, another transaction can issue an exclusive lock on R. True or False?

If a transaction has an exclusive lock on a database item, it can update it but not read it. True or False?

If a transaction has an exclusive lock on a database item, it can both read and update it. True or False?

If transaction A holds an exclusive lock on a record R, another transaction B will have to wait until A releases the lock, if B wants to issue either a shared lock or an exclusive lock on R. True or False?

Basic 2PL, conservative 2PL, and strict 2PL can all guarantee serializability of a schedule as well as preventing deadlock. True or False?

Conservative 2-PL guarantees serializability of a schedule and it is deadlock free, but it limits concurrency. True or False?