open navigation menu
AiFolder
Tools for a smarter you
Discover
Tools
AI
Games
Interviews
Blog
More
Search AiFolder
Toggle theme
Toggle theme
Sign in
Exit
00:00
Submit test
Graph Theory · Advanced
8 questions · Question 1 of 8
13%
Multiple Choice
Senior
Why does a Breadth First Search (BFS) use more memory than Depth First Search (DFS)?
A
The most prominent and extreme example that illustrates the difference in peak memory consumption between DFS and BFS (as well as pseudo DFS) is a star graph: a single central vertex surrounded by a large number (say,...
B
Graph: Consists of a set of vertices (or nodes) and a set of edges connecting some or all of them Any edge can connect any two vertices that aren't already connected by an identical edge (in the same direction, in the...
C
In general it may or may not depending on the particular graph.
D
A Search relies on a knowledge and heuristic cost function for the given node as a way to decide which node it should visit next.
Previous
Next