AL 9618 Graph and Recursion Quiz

What is a graph in the context of data structures?

• A collection of nodes and edges

• A linear list of elements

• A collection of sorted data

• A type of stack used in data structures

Which of the following best describes a directed graph?

• A graph where all nodes are connected to each other

• A graph where each edge has a direction from one node to another

• A graph with weighted edges

• A graph that contains cycles

In Python, which data structure is most commonly used to represent a graph?

• List

• Dictionary

• Set

• Tuple

What would be the best way to represent a weighted graph in Python?

• Using a list of tuples

• Using a dictionary with node pairs as keys and weights as values

• Using a set of edges

• Using an array of nodes

Which algorithm is most commonly used to find the shortest path between two nodes in a graph?

• Depth-First Search (DFS)

• Breadth-First Search (BFS)

• Dijkstra's Algorithm

• Kruskal's Algorithm

How can you check if a graph is directed or undirected in Python?

• By checking the number of nodes

• By checking if each edge has a corresponding reverse edge

• By using the type() function

• By using a stack

What is a cycle in a graph?

• A path that visits each node exactly once

• A sequence of nodes that starts and ends at the same node

• A path that contains all edges

• A sequence of unconnected nodes

Which of the following is NOT a real-life application of graphs?

• Representing social media networks

• Organizing hierarchical file structures

• Modeling web page links

• Representing daily temperature readings

In a graph, what does the weight of an edge typically represent?

• The distance between two nodes

• The number of edges connected to a node

• The number of nodes in the graph

• The direction of the edge

What is recursion in programming?

• A process where a function or procedure is defined in terms of itself and calls itself

• A method of sorting arrays

• A type of loop that iterates a fixed number of times

• A technique for managing memory allocation