Exploring Graphs and Their Properties

Which of the following is a common way to represent a graph in computer memory?

• Binary Search Tree

• Adjacency Matrix

• Linked List

• Stack

In a breadth-first search (BFS) of a graph, which data structure is typically used to keep track of the nodes to be explored?

• Stack

• Queue

• Priority Queue

• Hash Table

Which of the following statements is true about undirected graphs?

• Edges have a direction from one vertex to another

• Edges do not have a direction

• Each edge is associated with a weight

• They cannot contain cycles

What is the main difference between a directed and an undirected graph?

• Directed graphs have weighted edges, undirected do not

• Directed graphs have edges with a specific direction, undirected do not

• Undirected graphs cannot have cycles

• Directed graphs cannot be represented using adjacency lists

Which of the following algorithms is commonly used to detect cycles in a graph?

• Dijkstra’s Algorithm

• Depth-First Search (DFS)

• Breadth-First Search (BFS)

• Bubble Sort

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

• The number of vertices in the graph

• The cost or distance between two vertices

• The degree of the vertex

• The number of cycles in the graph

Which of the following best describes an adjacency list representation of a graph?

• A table where each cell indicates if an edge exists between two vertices

• A list where each vertex has a list of its adjacent vertices

• A matrix where each row and column represent a vertex

• A sorted array of all edge weights

Which traversal algorithm is guaranteed to find the shortest path (in terms of number of edges) from a starting node to all other nodes in an unweighted graph?

• Depth-First Search (DFS)

• Breadth-First Search (BFS)

• Dijkstra’s Algorithm

• Prim’s Algorithm

Which of the following statements about cycles in graphs is correct?

• Only undirected graphs can have cycles

• Both directed and undirected graphs can have cycles

• Cycles can only occur in weighted graphs

• Cycles are not possible in any graph