7517 AQA Graphs

1. What is a graph in the context of data structures?

• A) A set of nodes connected by edges.
• B) A type of chart used to represent statistical data.
• C) A list of items.
• D) An array of integers.
• Pluto

2. What is a weighted graph?

• A) A graph where edges have no direction.
• B) A graph where edges have a weight or cost associated with them.
• C) A graph with self-loops.
• D) A graph with multiple edges between the same pair of vertices.

3. Define a vertex/node in a graph.

• A) A connection between two edges.
• B) A point where edges meet.
• C) A type of data structure.
• D) A subgraph of the main graph.

4. What is an edge/arc in a graph?

• A) A point where two lines intersect.
• B) A connection between two nodes/vertices.
• C) A type of tree structure.
• D) A list of vertices.

5. Describe an undirected graph.

• A) A graph where edges have directions.
• B) A graph where edges do not have directions.
• C) A graph with weighted edges.
• D) A graph with a single node.

6. What is a directed graph?

• A) A graph where each edge has a direction.
• B) A graph with no edges.
• C) A graph with undirected edges.
• D) A graph with multiple edges between nodes.

7. What is an adjacency matrix?

• A) A 2D array used to represent a graph, where the cell value indicates the presence or absence of an edge.
• B) A list of all the nodes in a graph.
• C) A 1D array representing the nodes.
• D) A hierarchical representation of a graph.

8. What is an adjacency list?

• A) A list where each node has a list of nodes to which it is connected.
• B) A matrix of zeros and ones representing edges.
• C) A sequence of graphs.
• D) A tree structure representing the hierarchy of nodes.

9. How does an adjacency matrix represent a graph?

• A) Each row represents a vertex and each column represents its connections to other vertices.
• B) Each cell contains a subgraph.
• C) Each node is listed with its edges.
• D) Each column represents a path in the graph.

10. How does an adjacency list represent a graph?

• A) It uses a 2D array where rows and columns indicate edges.
• B) Each node has a list of its neighboring nodes.
• C) It lists nodes in sequential order.
• D) It represents nodes in a hierarchical tree structure.