M
Q. Deadlocks are possible only when one of the transactions wants to obtain a(n) ____ lock on a data item.
Be the first to start discuss.
Related MCQs
Q. If an itemset is not a frequent set and no superset of this is a frequent set, then it is
Q. Which of the following is not an option to achieve reliable cost and effort estimate?
Q. If a relation is in BCNF, then it is also in
Q. What represent a correspondence between the various data elements?
Discusssion
Login to discuss.