M

Mr. Dubey • 52.26K Points
Coach 

Q. The deadlock in a set of a transaction can be determined by

(A) read-only graph
(B) wait graph
(C) wait-for graph
(D) all of the mentioned
Correct : Option (A)

Share

Previous

Next

Discusssion

Login to discuss.

Be the first to start discuss.

Related MCQs

Q. Which statement is true about the relation shown at the right?

Q. ”Everyone wants to learn cosmology.” This argument may be true for which domains?

Q. Nodes in the network analysis graph represent the and the edges represent the relationships between nodes.

Q. In case of failure, a new transaction coordinator can be elected by ____________

Q. The term hierarchy implies.........

Q. Below are the two ensemble models: 1. E1(M1, M2, M3) and 2. E2(M4, M5, M6) Above, Mx is the individual base models. Which of the following are more li

Q. Which of the following conditions checks available free space in avail list?

Q. Boundary value analysis is the technique comes under……

Q. In ----------- analyst examines information that has been recorded about system and about the users.

Q. In HDFS the files cannot be