1. : Select the space complexity of Greedy search?
(A) O((B)
(B) O(bl)
(C) O(m)
(D) O(bm)
2. : Which of the following is the evaluation function in A method?*
(A) Heuristic function
(B) Path cost from starting node to the present node
(C) Path cost from starting node to the present node and Heuristic cost
(D) Average of Path cost from starting node to the present node and Heuristic cost
3. : Best-First search can be coded with the help of which of the following data structure?
(A) Queue
(B) Stack
(C) Priority Queue
(D) Circular Queue
4. : A algorithm is based on which of the following?*
(A) Breadth-First-Search
(B) Depth-First-Search
(C) Best-First-Search
(D) Hill climbing
5. : Which of the following is the search strategy that uses a problem-specific knowledge?
(A) Informed Search
(B) Best First Search
(C) Heuristic Search
(D) All of these
6. : Greedy search strategy chooses the node for expansion in which of the following?
(A) Shallowest
(B) Deepest
(C) The one closest to the goal node
(D) Minimum heuristic cost
7. : Best-First search is a type of informed search, which uses evaluation function ………. to choose the best next node for expansion.
(A) returning lowest evaluation
(B) returning highest evaluation
(C) returning lowest and highest evaluation
(D) None of these
8. : The heuristic function h(n) is which of the following?
(A) Lowest path cost
(B) The cheapest path from the root to the goal node
(C) The estimated cost of the cheapest path from the root node to the goal node
(D) Average path cost
9. : A heuristic is a method of trying to discover/search or compare?
(A) To discover something or an idea embedded in a program
(B) To search and measure how far a node in a search tree seems to be from a goal
(C) To compare two nodes in a search tree to see if one is better than another
(D) All of these
10. : Which of the following is the evaluation function in the greedy technique?
(A) Heuristic function
(B) Path cost from starting node to the current node
(C) Path cost from starting to current node and Heuristic cost
(D) Average of Path cost from starting node to the current node and Heuristic cost