Zusammenfassung der Ressource
Frage 1
Frage
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?
Frage 2
Frage
Match the phrase with the term it describes.
Phrase: "First visited, first explored."
Antworten
-
A) Depth-first search
-
B) Post-order traversal
-
C) In order traversal
-
D) Breadth-first search
Frage 3
Frage
What is the difference between a depth-first and breadth-first search?
Frage 4
Frage
How do you start a depth first search?
Antworten
-
A. You take the highest number
-
B.You take the lowest number
-
C.You follow the shortest path
-
D.none of the above.
Frage 5
Frage
Graph traversals only visit all the vertices if it's connected.
Frage 6
Frage
when traversing a graph what can you do to avoid going through
infinte loops because of cycles?
Antworten
-
mark vertices as queued
-
none of the above
Frage 7
Frage
When doing a recursive depth first search on a given vertex,
adjacent nodes are visited:
Frage 8
Frage
Which type of search proceeds along a path from a vertex v as deeply into
the graph as possible before backing up?
Antworten
-
A) Breadth-First Search
-
B) Inorder Traversal
-
C) Depth-First Search
-
D) None of the above
Frage 9
Frage
The two different ways to traverse a graph is?
Frage 10
Frage
A depth-first search traversal on a tree is the same as a:
Antworten
-
A. Pre order traversal
-
B. In order traversal
-
C. Post order traversal
-
D. linear traversal
Frage 11
Frage
Depth First Search uses a ______ while Breadth First Search uses a ______:
Antworten
-
A. stack/recursion, queue
-
B. queue, stack/recursion
-
C. iteration, recursion
-
D. recursion, stack
Frage 12
Frage
What does a DFS (depth-first search) do?
Antworten
-
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
Frage 13
Frage
What kind(s) of strategy does a Depth-First search use?
Frage 14
Frage
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.
Frage 15
Frage
What is the only difference in the BFS and DFS implementations?