When you have a cycle in a graph and you are trying to implement a traversal, what is the most common method to avoid an infinite loop?
Each time you visit a vertex, mark it as queued (visited)
none of the above
Match the phrase with the term it describes. Phrase: "First visited, first explored."
A) Depth-first search
B) Post-order traversal
C) In order traversal
D) Breadth-first search
What is the difference between a depth-first and breadth-first search?
Depth-first uses "first in last out", while Breadth-first uses "first in first out".
How do you start a depth first search?
A. You take the highest number
B.You take the lowest number
C.You follow the shortest path
D.none of the above.
Graph traversals only visit all the vertices if it's connected.
when traversing a graph what can you do to avoid going through infinte loops because of cycles?
mark vertices as queued
When doing a recursive depth first search on a given vertex, adjacent nodes are visited:
a. in reverse alphanumerical order
b. in alphanumerical order
c. from left to right
d. from right to left
Which type of search proceeds along a path from a vertex v as deeply into the graph as possible before backing up?
A) Breadth-First Search
B) Inorder Traversal
C) Depth-First Search
D) None of the above
The two different ways to traverse a graph is?
Depth First Search, and Breadth First Search
A depth-first search traversal on a tree is the same as a:
A. Pre order traversal
B. In order traversal
C. Post order traversal
D. linear traversal
Depth First Search uses a ______ while Breadth First Search uses a ______:
A. stack/recursion, queue
B. queue, stack/recursion
C. iteration, recursion
D. recursion, stack
What does a DFS (depth-first search) do?
A. it proceeds along a path to a vertex v as deeply into the graph as possible before backing up
B. it proceeds along a path from a queue q as deeply into the graph as possible before backing up
C. it proceeds along a path from a vertex v as deeply into the graph as possible before backing up
D. it proceeds along a path to a queue q as deeply into the graph as possible before backing up
What kind(s) of strategy does a Depth-First search use?
A. divide n conquer
B. last visited, first explored
C. both A and B
D. none of the above.
Is the definition of depth-first search true or false?
Proceeds along a path from a vertex v as deeply into the graph as possible before backing up. Using "last visited, first explored" strategy.
What is the only difference in the BFS and DFS implementations?
BFS uses a queue to store the searched nodes, while DFS uses a stack.
