Saved Bookmarks
| 1. |
Best-First search can be implemented using the following data structure.(a) Queue(b) Stack(c) Priority Queue(d) Circular Queue |
|
Answer» The correct option is (c) Priority Queue The best 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. |
|