Depth first search (DFS) Quiz

What data structure does the depth-first traversal algorithm use to keep track of the last node visited?

• Queue

• Stack

• Array

• Tree

In a depth-first traversal, what action is taken when backtracking?

• Push the current node onto the stack

• Pop the previous node off the stack

• Skip the current node

• Add a new node to the stack

What is the purpose of the stack in depth-first traversal?

• To store visited nodes

• To store unvisited nodes

• To store the path

• To store the graph

Which of the following is a characteristic of depth-first traversal?

• It is guaranteed to find the shortest path

• It explores all neighbors before moving to the next level

• It uses a stack to remember the path visited

• It uses a queue to remember the path

What happens when a node with no unvisited neighbors is encountered in depth-first traversal?

• The node is added to the stack

• The node is revisited

• The traversal ends

• The node is removed from the stack

When will the process of depth-first traversals end?

• The shortest path of the nodes is found

• All nodes are visited

• All data in stack are popped out

• All data in queue are read out

From the tree, which of the followings is a possible output of depth first traversal?

• ABFEKDIHCFLMJ

• ADIJHBEKFCGML

• ADHIJCGLMBEFK

• ABCDEFGHIJKLM

What is the depth first traversal output of the graph?

• ABEFCGD

• CABDGFE

• ACGDBFE

• BEFACGD