2.3.1 Graph Traversal & Path Finding Algorithms

What supporting data structure is used for traversing a graph based on the depth-first traversal technique?

• Stack

• Queue

• Circular Queue

• 2D Array

What supporting data structure is used for traversing a graph based on the breadth-first traversal technique?

• Stack

• Queue

• Circular Queue

• 2D Array

Depth-first traversal is equivalent to which of the following traversal of trees?

• Pre-order

• Post-order

• In-order

An approach to problem-solving in which different sequences are considered until the best suitable solution is found is called

• Traversal

• Heuristics

• Backtracking

• Data Mining

If visitedNodes = [A], what is the value of visitedNodes in the next step?

• visitedNodes = [B]

• visitedNodes = [B, C]

• visitedNodes = [B, C, D]

• visitedNodes = [A, B]

If node C has been visited in the current step, what is the value of visitedNodes?

Select All That Apply.

• visitedNodes = [A, B, E, I, C]

• visitedNodes = [A, B, E, I, F, C]

• visitedNodes = [A, B, E, I, F, J, G, C]

• visitedNodes = [A, B, E, I, F, J, D, C]

If node D is visited in the current step, what is the value of the supporting data structure?

• [A]

• [A, B, C]

• [A, B, C, D]

• [D, B, C, A]

Node A is visited in the current step and nodelist = [A]. What is the value of supporting data structure in the next step?

• [B, D]

• [B]

• [D]

• [B, C, D]

Node D is added to the list of nodelist in the current step. Assuming that D’s neighbours are also added, what is the value of supporting data structure?

• [B, C]

• [E, F, G]

• [G, F, E]

• [A, B, C, D]

What is the order of nodes visited for depth-first traversal of this tree?

• ABCDEFG

• ABECFDG

• ABCEFDG

• ABECFGC