• AI MCQ Topics

• AI Reference

• Other Reference

# 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

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

A. b
B. b^2
C. b^b
D. 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

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

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

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

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)

18. A* algorithm is based on __________

B. Depth-First-Search
C. Uniform Cost Search
D. Best-First-Search

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

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

A. Yes, Yes
B. No, Yes
C. Yes, No
D. No, No