## AI Problem Solving Agents MCQ

11. What is Branching Factor?

A. Length of the shortest path from initial state to goal state.

B. The average number of child nodes in the problem space graph.

C. A property of an algorithm to always find an optimal solution.

D. None of the Above

View Answer

Ans : B

Explanation: Branching Factor : The average number of child nodes in the problem space graph.

12. What is Space Complexity of Depth First search algorithm?

A. b

B. b^2

C. b^b

D. b^m

View Answer

Ans : D

Explanation: Space Complexity of Depth First search algorithm is b^m

13. The process of removing detail from a given state representation is called ______

A. Extraction

B. Abstraction

C. Information Retrieval

D. Mining of data

View Answer

Ans : B

Explanation: The process of removing detail from a representation is called abstraction.

14. Which of the following search algorithm searches forward from initial state and backward from goal state till both meet to identify a common state?

A. Uniform Cost Search

B. Iterative Deepening Depth-First Search

C. Bidirectional Search

D. None of the Above

View Answer

Ans : C

Explanation: Bidirectional Search searches forward from initial state and backward from goal state till both meet to identify a common state.

15. When is breadth-first search is optimal?

A. When there is less number of nodes

B. When all step costs are equal

C. When all step costs are unequal

D. All of the above

View Answer

Ans : B

Explanation: Because it always expands the shallowest unexpanded node.

16. uniform-cost search expands the node n with the __________

A. Lowest path cost

B. Heuristic cost

C. Highest path cost

D. Average path cost

View Answer

Ans : A

Explanation: Uniform-cost search expands the node n with the lowest path cost. Note that if all step costs are equal, this is identical to breadth-first search.

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

A. f(n) != h(n)

B. f(n) < h(n)

C. f(n) = h(n)

D. f(n) > h(n)

View Answer

Ans : C

Explanation: f(n) = h(n) is the heuristic function of greedy best-first searc

18. A* algorithm is based on __________

A. Breadth-First-Search

B. Depth-First-Search

C. Uniform Cost Search

D. Best-First-Search

View Answer

Ans : D

Explanation: Best-first-search is giving the idea of optimization and quick choose of path, and all these characteristic lies in A* algorithm.

19. When will Hill-Climbing algorithm terminate?

A. Stopping criterion met

B. Global Min/Max is achieved

C. No neighbor has higher value

D. All of the above

View Answer

Ans : C

Explanation: When no neighbor is having higher value, algorithm terminates fetching local min/max.

20. Is optimality and completeness exist in bidirectional search algorithm?

A. Yes, Yes

B. No, Yes

C. Yes, No

D. No, No

View Answer

Ans : A

Explanation: Yes, optimality and completeness both exist in bidirectional search algorithm.

Discussion