Graph Representations and Traversals Quiz

Question 1: What is the process of visiting all the vertices of a graph in a systematic way called?

• Graph rotation

• Graph traversal

• Vertex exploration

• Edge traversal

Question 2: How does depth-first search algorithm traverse a graph?

• Explores as far as possible along each branch before backtracking

• Starts from the end of the graph and works backwards

• Explores only the immediate neighbors before backtracking

• Traverses the graph in a random order

Question 3: What is the main difference between depth-first search and breadth-first search?

• Using a priority queue

• Counting the number of edges

• Order of visiting nodes

• Coloring nodes

Question 4: How does breadth-first search algorithm traverse a graph?

• Traverses nodes randomly

• Explores all neighbor nodes at the present depth before moving on to nodes at the next depth level

• Only explores nodes with the highest value

• Explores all nodes at the deepest level first

Question 5: What are the different types of graph traversal algorithms?

• DFS, BFS, Dijkstra's algorithm

• Breadth-First Search, Depth-First Search, Kruskal's algorithm

• Kruskal's algorithm, Floyd-Warshall, Depth-First Search

• A*, Bellman-Ford, Prim's algorithm

Question 6: What is an adjacency matrix used for in graph representation?

• It is used to calculate the shortest path between vertices in a graph.

• It is used to represent the colors of vertices in a graph.

• It is used to represent the connections between vertices in a graph.

• It is used to store the names of vertices in a graph.

Question 7: What are the advantages of using an adjacency matrix to represent a graph?

• Adjacency matrix is difficult to implement

• Constant time access to check for edges

• Linear time access to check for edges

• Adjacency list is more memory efficient

Question 8: What is an adjacency list used for in graph representation?

• To store the names of the vertices in a graph

• To represent the colors of the vertices in a graph

• To represent the connections between vertices in a graph

• To calculate the shortest path between vertices in a graph