a) Queue
b) Stack
c) Priority Queue
d) Circular Queue
Answer: c
Explanation: Best-first search can be implemented within our general search framework via a priority queue, a data structure that will maintain the fringe in ascending order of f-values.
Related Posts
Which approach is to pretend that a pure divide and conquer algorithm will work?
What is the other name of the backward state-space search?
What is the other name for forward state-space search?
How many ways are available to solve the state-space search?
Which is the most straightforward approach for planning algorithm?
Which function is used to calculate the feasibility of whole game tree?
Which is identical to the closed list in Graph search?
Join The Discussion