may not terminate and go on infinitely on one pathĮxplanation: The disadvantage of Greedy Best First Search is that it can get stuck in loops. There can be multiple long paths with the cost ≤ C*ĭ. This algorithm is neither complete, nor optimal.ī. What is disadvantage of Greedy Best First Search?Ī. It depends upon the application on which the algorithm is applied.ĩ. Greedy search strategy chooses the node for expansion in _Įxplanation: Sometimes minimum heuristics can be used, sometimes maximum heuristics function can be used. How many types of informed search method are in artificial intelligence?Įxplanation: The four types of informed search method are best-first search, Greedy best-first search, A* search and memory bounded heuristic search.Ĩ. Which data structure conveniently used to implement BFS?Įxplanation: Queue is the most convenient data structure, but memory used to store nodes can be reduced by using circular queues.ħ. Start your Machine learning & Data Science journey with Complete Hands-on Learning & doubt solving SupportĦ. How many types are available in uninformed search method?Įxplanation: The five types of uninformed search method are Breadth-first, Uniform-cost, Depth-first, Depth-limited and Bidirectional search. Depth-First Search is implemented in recursion with _ data structure.Įxplanation: Depth-First Search implemented in recursion with LIFO stack data structure.ĥ. What is Time Complexity of Breadth First search algorithm?Įxplanation: Time Complexity of Breadth First search algorithm is b^d.Ĥ. What is Initial state + Goal state in Search Terminology?Įxplanation: Problem Instance : It is Initial state + Goal state.ģ. To find out which sequence of action will get it to the goal stateĮxplanation: The problem-solving agents are one of the goal-based agentsĢ. Solve the given problem and reach to goalī. What is the main task of a problem-solving agent?Ī.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |