Machine-translated by Google. Questions are authored in English.
Top

Discussion

Why is memory rather than time usually the limit for breadth first search?

  • A.Every generated node must be kept in the frontier or explored set
  • B.Memory access is slower than the arithmetic the algorithm performs
  • C.The algorithm must store the whole state space before it begins
  • D.Nodes cannot be discarded until the search has finished entirely

Answer: A

The frontier grows as the number of nodes at the current depth, which is the same exponential as the time, but a modern machine generates nodes far faster than it can store them, so memory is exhausted first. A million nodes a second fills a gigabyte in minutes. The state space is never enumerated in advance, and nodes are discarded as they are expanded. Identifying which resource binds first decides which algorithm is actually usable. Naming the cost of a choice alongside its benefit is what turns a fact into a design decision.

No comment is present. Be the first to comment.
Loading…

Post your comment

Please log in or register to post a comment.