Question

Best-First search can be implemented using the following data structure.

(a) Queue

(b) Stack

(c) Priority Queue

(d) Circular Queue

I had been asked this question by my school teacher while I was bunking the class.

This intriguing question comes from Informed Search and Exploration in section Problem Solving of Artificial Intelligence

Select the correct answer from above options

Interview Questions and Answers, Database Interview Questions and Answers for Freshers and Experience

Answer 1

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.