Graphs MCQ question and answer with solution | Data Structure MCQs

A. A directed graph has nodes with unique identifiers, while an undirected graph does not.

B. A directed graph has edges with direction, while an undirected graph does not.

C. There is no difference between them.

D. A directed graph has nodes with unique identifiers, while an undirected graph does not.

A. O(V log V)

B. O(E)

C. O(V²)

D. O(V + E)

A. It contains a cycle of odd length.

B. It can be represented using only one adjacency list.

C. It has no edges.

D. It can be colored using two colors such that no two adjacent vertices share the same color.

A. A path that starts and ends at the same vertex with no other repetitions.

B. A path that includes all vertices exactly once.

C. A path with no edges.

D. A complete traversal of all vertices.

A. To store the depth-first search order.

B. To list the neighbors of each vertex.

C. To store only the vertices of the graph.

D. To store the edges and their weights between all pairs of vertices.

A. Depth-First Search (DFS)

B. Dijkstra's Algorithm

C. Breadth-First Search (BFS)

D. Floyd-Warshall Algorithm

A. When the graph is unweighted.

B. When there are negative weight edges.

C. When the graph is sparse.

D. When the graph is unweighted.

A. It has exactly one path between any pair of vertices.

B. It is a bipartite graph.

C. Every pair of vertices is connected by a unique edge.

D. It contains no cycles.

A. A subgraph that includes only leaf nodes.

B. A subset of edges that forms a cycle.

C. A tree where all nodes are leaves.

D. A subgraph that includes all vertices and is connected without any cycles.

A. By checking if there is a back edge during traversal.

B. By counting the number of vertices.

C. By counting the number of edges.

D. By checking if the graph is disconnected.