a) Heuristic function b) Path cost from start node to current node c) Path cost from start node ...
View QuestionGreedy search strategy chooses the node for expansion in ___________
a) Shallowest b) Deepest c) The one closest to the goal node d) Minimum ...
View QuestionHeuristic function h(n) is ________
a) Lowest path cost b) Cheapest path from root to goal node c) Estimated cost of cheapest path from ...
View QuestionThe name “best-first search” is a venerable but inaccurate one. After all, if we could really expand the best node first, it would not be a search at all; it would be a straight march to the goal. All we can do is choose the node that appears to be best according to the evaluation function.
a) true b) false Answer: a Explanation: If the evaluation function is exactly accurate, ...
View QuestionBest-First search can be implemented using the following data structure.
a) Queue b) Stack c) Priority Queue d) Circular Queue Answer: c Explanation: Best-first ...
View QuestionBest-First search is a type of informed search, which uses ________________ to choose the best next node for expansion.
a) Evaluation function returning lowest evaluation b) Evaluation function returning highest evaluation c) Evaluation function returning lowest & highest ...
View QuestionUninformed search strategies are better than informed search strategies.
a) true b) false Answer: b Explanation: Informed search strategies uses some ...
View QuestionThe search strategy the uses a problem specific knowledge is known as ___________
a) Informed Search b) Best First Search c) Heuristic Search d) All of the mentioned Answer: d
View QuestionA* algorithm is based on ___________
a) Breadth-First-Search b) Depth-First –Search c) Best-First-Search d) Hill climbing Answer: c Explanation: Best-first-search is giving the ...
View QuestionA heuristic is a way of trying ___________
a) To discover something or an idea embedded in a program b) To search and measure how far ...
View Question