Graph Quiz - DAY 12 - BATCH 1

What is a graph in computer science?

• A) A data structure consisting of nodes and edges

• B) A hierarchical structure

• C) A linear data structure

• D) A sorting algorithm

In an undirected graph, an edge between two nodes means:

• A) A one-way relationship between the nodes

• B) A two-way relationship between the nodes

• C) No relationship between the nodes

• D) A hierarchical relationship

What is a connected graph?

• A) A graph where all nodes are reachable from each other

• B) A graph with no edges

• C) A graph with cycles

• D) A graph with self-loops

How is an adjacency matrix represented for a graph with n vertices?

• A) An n x n matrix

• B) A list of pairs

• C) An n x 2 matrix

• D) A dictionary of lists

What is an adjacency list?

• A) A list of edges

• B) A matrix representation of a graph

• C) A list where each node has a list of adjacent nodes

• D) A hierarchical list of nodes

Which graph traversal algorithm uses a queue?

• A) Depth-First Search (DFS)

• B) Breadth-First Search (BFS)

• C) Dijkstra's Algorithm

• D) Prim's Algorithm

In Depth-First Search (DFS), nodes are visited:

• A) Level by level

• B) Starting from the root node

• C) In the order they appear

• D) By exploring as far as possible along each branch before backtracking

What is a weighted graph?

• A) A graph with weights assigned to its nodes

• B) A graph with weights assigned to its edges

• C) A graph with weights assigned to both nodes and edges

• D) A graph with no weights

What is a complete graph?

• A) A graph in which each node is connected to exactly one other node

• B) A graph in which each node is connected to all other nodes

• C) A graph with no cycles

• D) A graph with an Eulerian path

In a graph, the degree of a vertex is:

• A) The number of edges connected to the vertex

• B) The number of vertices in the graph

• C) The number of connected components

• D) The number of cycles in the graph