Deadlocks are possible only when one of the transactions wants to obtain a(n) ____ lock on a data item.

M

Mr. Dubey • 52.26K Points
Coach

Q. Deadlocks are possible only when one of the transactions wants to obtain a(n) ____ lock on a data item.

(A) binary

(B) exclusive

(C) shared

(D) Complete

Correct : Option (B)

Share

Discusssion

Login to discuss.

Related MCQs

Q. Which of the following is suitable after you install new drivers?

Q. If an attribute of a composite key is dependent on an attribute of the other composite key, normalization called ................ is needed.

Q. The use of spooler programs or _______ Hardware allows PC operators to do the processing work at the same time a printing operation is in progress.

Q. What is the mounting of file system?

Q. Which one of the following can not be scheduled by the kernel?

Q. Personal computers used a number of chips mounted on a main circuit board. What is the common name for such boards?

Q. Data communication system spanning states, countries, or the whole world is

Q. Which of the following is not a Storage Manager Component?

Q. identification algorithm which scores collocations using log-likelihood ratio.

Q. k = foo() print(k)