Artificial Intelligence - Searching

How many kinds of informed search methods are present in artificial intelligence?

• 1

• 2

• 3

• 4

Which of the following search method is helpful to find better by learning?

• Best-first search

• Depth-first search

• Metalevel state space

• None of the mentioned

Which of the following search method will expand the node that is nearest to the goal?

• Best-first search

• Greedy best-first search

• A* search

• None of the mentioned

Which of the following search algorithm is optimal and complete when h(n) is consistent?

• Best-first search

• Depth-first search

• Both A and B

• A* search

Which of the following 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)

Which of the following search uses the problem-specific knowledge outside the definition of the problem?

• Informed search

• Depth-first search

• Breadth-first search

• Uninformed search

Which of the following is helpful to increase the performance of the heuristic search?

• Quality of nodes

• Quality of heuristic function

• A simple form of nodes

• None of the mentioned

Which of the following search algorithms practices only the linear space for searching purposes?

• Best-first search

• Recursive best-first search

• Depth-first search

• None of the mentioned

The informed search strategy is also called?

• Simple search

• Heuristic search

• Online search

• None of the mentioned

Which of the following function will select the lowest expansion node at first for evaluation?

• Greedy best-first search

• Best-first search

• Depth-first search

• None of the mentioned