Artificial Intelligence- search

Among the given options, which search algorithm requires less memory?

• Binary Search

• Breath First Search

• Depth First Search

Which algorithm is used in the Game tree to make decisions of Win/Lose?

• Heuristic Search Algorithm

• DFS/BFS algorithm

• Greedy Search Algorithm

• Min/Max algorithm

Which search strategy is also called as blind search?

• Uninformed Search

• Informed Search

• Simple Reflex Search

• All of Above

Which search is implemented with an empty first-in-first-out queue?

• Depth First

• Breadth First

• Bidirectional

• None of Above

What is the space complexity of Depth-first search? b = branching factor, m = depth, l = leaf nodes

• O(b)

• O(bl)

• O(m)

• O(bm)

What is the heuristic function of greedy best-first search?

• f(n) != h(n)

• f(n) >= h(n)

• f(n) <= h(n)

• f(n) = h(n)

A* algorithm is based on ___________

• Breadth-First-Search

• Depth-First-Search

• Best-First-Search

• Hill Climbing

Heuristic function h(n) is ________.

• Lowest path cost

• Cheapest path from root to goal node

• Estimated cost of cheapest path from node to goal node

• Average path cost

What is the other name of informed search strategy?

• Simple search

• Heuristic search

• Online search

• None of the mentioned

What are the types of Blind Search?

• Heuristic search

• Informed search

• Breadth search

• Depth Search