Saved Bookmarks
| 1. |
Which search is implemented with an empty first-in-first-out queue?(a) Depth-first search(b) Breadth-first search(c) Bidirectional search(d) None of the mentioned |
|
Answer» Right option is (b) Breadth-first search The best I can explain: Because of FIFO queue, it will assure that the nodes that are visited first will be expanded first. |
|