[amp_mcq option1=”Greedy best-first search” option2=”Best-first search” option3=”Depth-first search” option4=”None of the mentioned” correct=”option1″]
The correct answer is A. Greedy best-first search.
Greedy best-first search is an algorithm for finding the shortest path between two nodes in a graph. It works by expanding the node with the lowest estimated cost first. This is in contrast to best-first search, which expands the node with the lowest actual cost first.
Greedy best-first search is often used in problems where the goal is to find the shortest path between two nodes, but it can also be used in other problems. For example, it can be used to find the maximum clique in a graph.
The following is a brief explanation of each option:
- A. Greedy best-first search: This algorithm expands the node with the lowest estimated cost first.
- B. Best-first search: This algorithm expands the node with the lowest actual cost first.
- C. Depth-first search: This algorithm expands the node with the lowest depth first.
- D. None of the mentioned: This is not a valid option.