Question

Deadlocks are possible only when one of the transactions wants to obtain an ____ lock on a data item. *

complete

shared

exclusive

binary​

Answer 1

Answer:

exclusive may be the answer

Explanation:

hope it helps

Answer 2

Answer:

c) exclusive

Explanation:

Deadlocks are possible only one of the transactions wants to obtain an exclusive lock on a data item. It is Known that a deadlock is a situation in which two or more transactions are waiting for one another to give up locks.

A deadlock may be a situation in which two computer programs sharing the same resource are effectively preventing each other from accessing the resource, leading to both programs ceasing to function. The earliest computer operating systems ran just one program at a time.

#spj3