Graph Theory Quiz

What is a vertex in a graph?

• A connection between two edges

• A point representing an object

• A sequence of edges between two vertices

• An ordered pair of vertices

Which of the following represents an edge in a graph?

• A path between two vertices

• A vertex connected to itself

• A node without connections

• A connection between three vertices

What is a complete graph?

• A graph where all vertices have equal edges

• A graph with the maximum number of edges between vertices

• A graph with no edges

• A graph with only one vertex

What is an undirected graph?

• A graph where the edges have directions

• A graph with no edges

• A graph where edges are unordered

• A graph where all vertices are adjacent

Which algorithm uses a queue to traverse a graph?

• Depth First Search

• Breadth First Search

• Dijkstra's Algorithm

• Kruskal's Algorithm

Which of the following is true about Depth First Search (DFS)?

• It always finds the shortest path in an unweighted graph

• It uses a queue to explore nodes

• It backtracks when it hits a dead end

• It cannot be used for directed graphs

Which statement best describes adjacency in a graph?

• Two vertices are adjacent if they have the same degree

• Two vertices are adjacent if there is a path of any length between them

• Two vertices are adjacent if they are connected by an edge

• Two vertices are adjacent if they belong to different components of the graph

Which characteristic distinguishes a directed graph from an undirected graph?

• Only undirected graphs can be weighted

• Directed graphs have ordered pairs of vertices for edges

• Directed graphs must be complete

• Undirected graphs cannot have paths between vertices

What would happen in BFS if you mistakenly used a stack instead of a queue?

• It would function like DFS

• It would find the shortest path

• The algorithm would be more efficient

• It would not visit all vertices

In a weighted graph, what is the significance of the edge weights?

• They indicate the number of vertices connected

• They represent the degree of a vertex

• They measure the cost or distance between two vertices

• They count the number of edges in the graph