Directed and Undirected Graph Quiz Online Practice Test

1. How many distinct undirected graphs with n vertices can be formed if self-loops are allowed but multiple edges between the same pair of vertices are not?

2((n*(n-1))/2)

2((n*(n+1))/2)

2((n-1)*(n-1))/2)

2((n*n)/2)

2. In a plane graph \( G \) with 6 vertices, 7 edges, 4 regions, and 2 connected components, how many connected components does the graph have?

3. In a graph with an Eulerian walk, how many vertices will have odd degrees?

Cannot be determined

Either 0 or 2

4. How many of the following statements are true?

i) Every cyclic graph is a complete graph.
ii) Every complete graph is a cyclic graph.
iii) Every path is bipartite.
iv) Every cyclic graph is bipartite.
v) Some cyclic graphs are complete.

5. Are all paths and cyclic graphs bipartite graphs?

True

False

True for paths but not for cyclic graphs

True for cyclic graphs but not for paths

6. In a path graph with n vertices, where n > 2, how many vertices have a degree of 2?

n - 2

7. Do all trees with n vertices have n - 1 edges?

True

False

True for connected trees only

False for complete trees only

8. What is the time complexity of determining if an undirected graph with V vertices and E edges is bipartite, given its adjacency matrix?

O(E*E)

O(V*V)

O(E)

O(V)

9. Dijkstra’s Algorithm works for both negative and positive weights?

True

False

True only if negative weights are small

False unless all weights are positive

10. A graph in which every vertex is connected to every other vertex by a single edge is known as a ___________.

Tightly Connected

Strongly Connected

Weakly Connected

Loosely Connected

11. How many distinct unlabeled simple directed graphs can be formed with either 1 or 2 vertices?

12. What is the time complexity of the Floyd-Warshall Algorithm for solving the shortest path problem?

O(V*V)

O(V*V*V)

O(E*V)

O(E*E)

13. Do all graphs have a unique representation on paper?

True

False

True if the graph is simple

False if the graph is directed

14. If every weight in a directed weighted graph is greater than 10, under which of the following scenarios will the shortest path between two vertices u and v remain unchanged?

Adding 10 to all weights

Subtracting 10 from all weights

Multiplying all weights by 10

Both adding 10 and multiplying by 10

15. In a directed graph with 8 vertices and no self-loops, what is the maximum number of possible edges?

256

Test Name:	Directed and Undirected Graph Quiz
Subject Category:	Computer Science
Test Type:	Multiple Choice Questions
Total Score / Questions:	15 / 15
Time Allowed:	10 Min
Who Should Practice this Test:	Students, job seekers, or professionals preparing for competitive exams and interviews.

Directed and Undirected Graph MCQ Quiz Online Practice Test