Home » MCQs » DBMS MCQs » DBMS Schedule MCQs

It is shown that the precedence graph has a pair G = (V, E), where V and E are the ___, respectively

12. It is shown that the precedence graph has a pair G = (V, E), where V and E are the ___, respectively.

1. Edges
2. Vertices
3. Edges and Vertices
4. Vertices and Edges

Answer: D) Vertices and Edges

Explanation:

It is shown that the precedence graph has a pair G = (V, E), where V and E are the vertices and edges, respectively.