Artificial Intelligence MCQs with Answers
Practice important Artificial Intelligence MCQs with answers and explanations.
Multiple Choice Questions
Q191: What happens if the queue Q becomes empty in the Simple Search Algorithm?
- A: Return goal state
- B: Re-initialize Q
- C: Fail the search
- D: Call recursion
View Answer
C
Q192: Which data structure is primarily used in the Simple Search Algorithm?
- A: Array
- B: Hash table
- C: Stack
- D: Priority Queue
View Answer
D
Q193: In DFS using Simple Search Algorithm, what is the priority function P(n) based on?
- A: Distance from goal
- B: Node ID
- C: 1/height(n)
- D: Depth of tree
View Answer
C
Q194: Which type of search explores tree nodes level-by-level?
- A: DFS
- B: BFS
- C: Greedy
- D: A*
View Answer
B
Q195: The goal of using P(n) in the search algorithm is to
- A: Increase time complexity
- B: Select node with max height
- C: Reduce the value of P(n)
- D: Ignore visited nodes
View Answer
C
Q196: The Simple Search Algorithm is used to implement ________.
- A: Only DFS
- B: Only BFS
- C: Both DFS and BFS
- D: Binary Search
View Answer
C
Q197: In BFS using Simple Search Algorithm, what is the priority function P(n) based on?
- A: Node cost
- B: 1/height(n)
- C: Depth(Node)
- D: Height(n)
View Answer
D
Q198: What is the output when the goal node is found?
- A: Return root node
- B: Return node X
- C: Return Visited list
- D: Reinitialize Q
View Answer
B
Q199: Visited list in Simple Search Algorithm is used to
- A: Track repeated nodes
- B: Track path cost
- C: Store children of nodes
- D: Sort the queue
View Answer
A
Q200: DFS tends to go ______ in the tree to find the goal.
- A: Breadth first
- B: Level by level
- C: Deeper and deeper
- D: Shortest path
View Answer
C