YOU CAN DOWNLOAD 200+ SUBJECTS PDF BOOK FOR COMPETITIVE EXAMINATIONS
Best First Search Multiple choice Questions and Answers (MCQs)
Question 6 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |
Which algorithm is used to find the least cost path from source node to destination node?
A* BFS | |
C* BFS | |
D* BFS | |
B* BFS |
Question 6 Explanation:
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.
Question 7 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |
Which of the following is an example of Best First Search algorithm?
A* | |
B* | |
C* | |
Both A* and B* |
Question 7 Explanation:
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.
Question 8 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |
Which of the following is the greedy best first search?
Pure Heuristic Search | |
A* | |
B* | |
Both A* and B* |
Question 8 Explanation:
Pure Heuristic Search is also called greedy best first search while A* and B* search algorithms are not greedy best first search.
Question 9 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |
Who published the first A* search algorithm?
Peter Hart | |
Nils Nilsson | |
Bertram Raphael | |
Hans Berliner |
Question 9 Explanation:
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.
Question 10 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |
Who published the B* search algorithm?
Peter Hart | |
Nils Nilsson | |
Bertram Raphael | |
Hans Berliner |
Question 10 Explanation:
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.
There are 10 questions to complete.