AI Problem Solving Agents MCQ
Problem Solving Agents MCQs : This section focuses on "Problem Solving Agents" in Artificial Intelligence. These Multiple Choice Questions (mcq) should be practiced to improve the AI skills required for various interviews (campus interviews, walk-in interviews, company interviews), placements, entrance exams and other competitive examinations.
1. What is the main task of a problem-solving agent?
A. Solve the given problem and reach to goal
B. To find out which sequence of action will get it to the goal state
C. Both A and B
D. None of the Above
View Answer
Ans : C
Explanation: The problem-solving agents are one of the goal-based agents.
2. What is Initial state + Goal state in Search Terminology?
A. Problem Space
B. Problem Instance
C. Problem Space Graph
D. Admissibility
View Answer
Ans : B
Explanation: Problem Instance : It is Initial state + Goal state.
3. What is Time Complexity of Breadth First search algorithm?
A. b
B. b^d
C. b^2
D. b^b
View Answer
Ans : B
Explanation: Time Complexity of Breadth First search algorithm is b^d.
4. Depth-First Search is implemented in recursion with _______ data structure.
A. LIFO
B. LILO
C. FIFO
D. FILO
View Answer
Ans : A
Explanation: Depth-First Search implemented in recursion with LIFO stack data structure.
5. How many types are available in uninformed search method?
A. 2
B. 3
C. 4
D. 5
View Answer
Ans : D
Explanation: The five types of uninformed search method are Breadth-first, Uniform-cost, Depth-first, Depth-limited and Bidirectional search.
6. Which data structure conveniently used to implement BFS?
A. Stacks
B. Queues
C. Priority Queues
D. None of the Above
View Answer
Ans : B
Explanation: Queue is the most convenient data structure, but memory used to store nodes can be reduced by using circular queues.
7. How many types of informed search method are in artificial intelligence?
A. 2
B. 3
C. 4
D. 5
View Answer
Ans : C
Explanation: The four types of informed search method are best-first search, Greedy best-first search, A* search and memory bounded heuristic search.
8. Greedy search strategy chooses the node for expansion in ___________
A. Shallowest
B. Deepest
C. The one closest to the goal node
D. Minimum heuristic cost
View Answer
Ans : C
Explanation: Sometimes minimum heuristics can be used, sometimes maximum heuristics function can be used. It depends upon the application on which the algorithm is applied.
9. What is disadvantage of Greedy Best First Search?
A. This algorithm is neither complete, nor optimal.
B. It can get stuck in loops. It is not optimal.
C. There can be multiple long paths with the cost ≤ C*
D. may not terminate and go on infinitely on one path
View Answer
Ans : B
Explanation: The disadvantage of Greedy Best First Search is that it can get stuck in loops. It is not optimal.
10. Searching using query on Internet is, use of ___________ type of agent.
A. Offline agent
B. Online Agent
C. Goal Based
D. Both B and C
View Answer
Ans : D
Explanation: Refer to the definitions of both the type of agent.
Discussion