[amp_mcq option1=”Offline search” option2=”Online search” option3=”Breadth-first search” option4=”Depth-first search” correct=”option2″]
The correct answer is: B. Online search.
Online search is a type of search that operates by interleaving computation and action. This means that the search agent starts by making a guess about the location of the target, and then it continues to search the environment by making more guesses and taking actions based on the results of those guesses. This process continues until the target is found or until the search agent runs out of time or resources.
Offline search, on the other hand, is a type of search that does not interleave computation and action. Instead, the search agent first computes a complete search tree, and then it traverses that tree to find the target. This approach is more efficient than online search, but it can be more difficult to implement.
Breadth-first search and depth-first search are two different algorithms for online search. Breadth-first search starts by expanding the node at the root of the search tree, and then it continues to expand the nodes that are connected to the root node. Depth-first search, on the other hand, starts by expanding the node at the root of the search tree, and then it continues to expand the nodes that are connected to the root node in a depth-first manner.
In conclusion, the correct answer is: B. Online search.