Graph Theory Quiz

What is another term for a graph node?

• Arc

• Edge

• Payload

• Vertex

What connects two vertices in a graph to indicate a relationship?

• Key

• Payload

• Edge

• Weight

When edges in a graph are all one-way, it is called:

• Weighted graph

• Undirected graph

• Directed graph

• Bipartite graph

What is used to show there is a cost to go from one vertex to another in a graph?

• Key

• Payload

• Weight

• Edge

Which data structure is not efficient for storing sparse data in a graph?

• Array

• Queue

• List

• Matrix

How is a graph represented as an adjacency list?

• Using a 2-dimensional matrix

• Maintaining a list of all vertices

• Connecting vertices with weighted edges

• Keeping track of balance factors

What problem involves transforming one word into another by changing one letter at a time?

• Word Scramble

• Anagram

• Word Ladder

• Scrabble

Which algorithm is suitable for finding the shortest path in a word ladder problem?

• Depth First Search (DFS)

• Dijkstra's Algorithm

• Breadth First Search (BFS)

• Topological Sorting

What does DFS use to keep track of which node to visit next?

• Queue

• Stack

• List

• Priority Queue

What is the goal of DFS in a graph?

• To explore all neighbor nodes

• To search one level at a time

• To find the shortest path

• To search as deeply as possible