We have the best collection of Directed Graph MCQs and answer with FREE PDF. These Directed Graph MCQs will help you to prepare for any competitive exams like: BCA, MCA, GATE, GRE, IES, PSC, UGC NET, DOEACC Exams at all levels – you just have to practice regularly.

## Directed Graph MCQs

**1. Floyd Warshall Algorithm used to solve the shortest path problem has a time complexity of**

a) O(V*V)

b) O(V*V*V)

c) O(E*V)

d) O(E*E)

**Answer: **O(V*V*V)

**2. All Graphs have unique representation on paper.**

a) True

b) False

**Answer: **False

**3. Assuming value of every weight to be greater than 10, in which of the following cases the shortest path of a directed weighted graph from 2 vertices u and v will never change?**

a) add all values by 10

b) subtract 10 from all the values

c) multiply all values by 10

d) in both the cases of multiplying and adding by 10

**Answer: **multiply all values by 10

**4. What is the maximum possible number of edges in a directed graph with no self loops having 8 vertices?**

a) 28

b) 64

c) 256

d) 56

**Answer: **56

**5. What is the maximum number of edges present in a simple directed graph with 7 vertices if there exists no cycles in the graph?**

a) 21

b) 7

c) 6

d) 49

**Answer: **6

**6. Dijkstra’s Algorithm will work for both negative and positive weights?**

a) True

b) False

**Answer: **False

**7. A graph having an edge from each vertex to every other vertex is called a ___________**

a) Tightly Connected

b) Strongly Connected

c) Weakly Connected

d) Loosely Connected

**Answer: **Tightly Connected

**8. What is the number of unlabeled simple directed graph that can be made with 1 or 2 vertices?**

a) 2

b) 4

c) 5

d) 9

**Answer: **4