7517: 12 Graph Traversal and Implementation

In the context of graph traversal, what is a breadth-first search primarily used for?

• Finding the shortest path

• Finding the longest path

• Finding a specific node

• Finding all nodes

Fill in the blank: A binary tree is a special type of graph, so there is an algorithm for adding an item to a ________ tree.

• A) binary

• B) linear

• C) circular

• D) rectangular

Which of the following is NOT a method to traverse a graph?

• A) Breadth-first search

• B) Depth-first search

• C) Linear search

• D) Binary search

What is essential for the process of finding a specific node in a graph?

• Graph traversal algorithms

• Sorting algorithms

• Searching algorithms

• Graph coloring algorithms

What is the main challenge in adding an item to a graph as mentioned in the text?

• Lack of algorithmic steps

• Complexity of graphs

• Number of nodes

• Type of graph

What is the role of the queue in the breadth-first search algorithm?

• To store deleted nodes

• To keep track of nodes to be visited

• To mark nodes as visited

• To ignore nodes.

What is the purpose of marking nodes in the breadth-first search?

• To delete them

• To ignore them

• To keep track of visited nodes

• To duplicate them.

Fill in the blank: The algorithm uses a _______ to ensure nodes are visited in the correct order.

• A) Stack

• B) Queue

• C) Array

• D) Graph

During a depth-first search, what happens after popping a node from the stack?

• It is added to the visited list

• It is ignored

• It becomes the current node

• It is pushed back onto the stack.

In the depth-first search algorithm, what is the purpose of the stack?

• To store visited nodes

• To keep track of nodes to visit

• To ignore nodes

• To remove nodes