The set of ________ in a precedence graph consists of all the transactions participating in the schedule

(a) Vertices

(b) Edges

(c) Directions

(d) None of the mentioned

(a) Vertices

(b) Edges

(c) Directions

(d) None of the mentioned

Correct choice is (a) Vertices

Explanation: The set of vertices in a precedence graph consists of all the transactions participating in the schedule. Precedence graph is a simple and efficient way of determining conflict serializability of the schedule.