Data Structures & Algorithms Multiple Choice Questions on “Best First Search”.
1. Is Best First Search a searching algorithm used in graphs. Answer: a 2. Who described this Best First Search algorithm using heuristic evaluation rule? Answer: a 3. Which type of best first search algorithm was used to predict the closeness of the end of path and its solution? 4. What is the other name of the greedy best first search? Answer: b 5. Which algorithm is used in graph traversal and path finding? Answer: a 6. Which algorithm is used to find the least cost path from source node to destination node? Answer: d 7. Which of the following is an example of Best First Search algorithm? Answer: d 8. Which of the following is the greedy best first search? Answer: a 9. Which of the following scientists didn’t publish A* algorithm? Answer: d 10. Who published the B* search algorithm? Answer: d
a) True
b) False
Clarification: Best First Search is a searching algorithm used in graphs. It explores it by choosing a node by heuristic evaluation rule. It is used in solving searching for related problems.
a) Judea Pearl
b) Max Bezzel
c) Franz Nauck
d) Alan Turing
Clarification: The best first search algorithm using heuristic evaluation rule or function was proposed by an Israeli – American computer scientist and philosopher Judea Pearl.
a) Greedy BFS
b) Divide and Conquer
c) Heuristic BFS
d) Combinatorial
Answer: a
Clarification: The greedy best first search algorithm was used to predict the closeness of the end of the path and its solution by some of the computer scientists.
a) Heuristic Search
b) Pure Heuristic Search
c) Combinatorial Search
d) Divide and Conquer Search
Clarification: The greedy best first search algorithm was used to predict the closeness of the end of the path and its solution by some of the computer scientists. It is also known as Pure Heuristic Search.
a) A*
b) C*
c) D*
d) E*
Clarification: In computer science A* algorithm is used in graph traversal and path finding. It is a process of node finding in between a path. It is an example of the best first search.
a) A* BFS
b) C* BFS
c) D* BFS
d) B* BFS
Clarification: In computer science, B* algorithm is used to find the least cost path between the source node and the destination node. It is an example of the best first search.
a) A*
b) B*
c) C*
d) Both A* and B*
Clarification: In computer science, A* algorithm is used in graph traversal and path finding. It is a process of node finding in between a path. B* algorithm is used to find the least cost path between the source node and the destination node.
a) Pure Heuristic Search
b) A*
c) B*
d) Both A* and B*
Clarification: Pure Heuristic Search is also called greedy best first search while A* and B* search algorithms are not greedy best first search.
a) Peter Hart
b) Nils Nilsson
c) Bertram Raphael
d) Hans Berliner
Clarification: Peter Hart Nils Nilsson Bertram Raphael are the three scientists of SRI International who first published the A* search algorithm which uses heuristics for better performance. Hans Berliner published B* algorithm.
a) Peter Hart
b) Nils Nilsson
c) Bertram Raphael
d) Hans Berliner
Clarification: Hans Berliner was a Computer Science professor who first published the B* search algorithm in 1979. While Peter Hart Nils Nilsson Bertram Raphael are the three scientists of SRI International who first published the A* search algorithm which uses heuristics for better performance.