1. : How many kinds of informed search methods are present in artificial intelligence?
(A) 1
(B) 2
(C) 3
(D) 4
2. : Which of the following search method is helpful to find better by learning?
(A) Best-first search
(B) Depth-first search
(C) Metalevel state space
(D) None of the mentioned
3. : Which of the following search method will expand the node that is nearest to the goal?
(A) Best-first search
(B) Greedy best-first search
(C) A* search
(D) None of the mentioned
4. : Which of the following search algorithm is optimal and complete when h(n) is consistent?
(A) Best-first search
(B) Depth-first search
(C) Both A and B
(D) A* search
5. : Which of the following search uses the problem-specific knowledge outside the definition of the problem?
(A) Informed search
(B) Depth-first search
(C) Breadth-first search
(D) Uninformed search
6. : Which of the following is helpful to increase the performance of the heuristic search?
(A) Quality of nodes
(B) Quality of heuristic function
(C) A simple form of nodes
(D) None of the mentioned
7. : Which of the following search algorithms practices only the linear space for searching purposes?
(A) Best-first search
(B) Recursive best-first search
(C) Depth-first search
(D) None of the mentioned
8. : The informed search strategy is also called?
(A) Simple search
(B) Heuristic search
(C) Online search
(D) None of the mentioned
9. : Which of the following function will select the lowest expansion node at first for evaluation?
(A) Greedy best-first search
(B) Best-first search
(C) Depth-first search
(D) None of the mentioned