a) Depth-First Search
b) Breadth-First search
c) Linear Search
d) Optimal search
Answer: a
Explanation: Depth-First Search takes less memory since only the nodes on the current path are stored, but in Breadth First Search, all of the tree that has generated must be stored.
Related Posts
How many successors are generated in backtracking search?
When is breadth-first search is optimal?
How many types are available in uninformed search method?
Which search is implemented with an empty first-in-first-out queue?
Which search strategy is also called as blind search?
Which is the best way to go for Game playing problem?
A production rule consists of ____________
Join The Discussion