Artificial Intelligence (2180703) MCQs
MCQs of Problems, State Space Search & Heuristic Search Techniques
| 21. |
Breadth-first search is not optimal when all step costs are equal, because it always expands the shallowest unexpanded node.
|
||||
|
Answer:
Option (b) |
| 22. |
DFS is ______ efficient and BFS is __________ efficient.
|
||||||||
|
Answer:
Option (a) |
| 23. |
The main idea of Bidirectional search is to reduce the time complexity by searching two way simultaneously from start node and another from goal node.
|
||||
|
Answer:
Option (a) |
| 24. |
What is the other name of informed search strategy?
|
||||||||
|
Answer:
Option (b) |
| 25. |
Which search uses the problem specific knowledge beyond the definition of the problem?
|
||||||||
|
Answer:
Option (a) |
| 26. |
Which function will select the lowest expansion node at first for evaluation?
|
||||||||
|
Answer:
Option (b) |
| 27. |
What is the heuristic function of greedy best-first search?
|
||||||||
|
Answer:
Option (c) |
| 28. |
Which search is complete and optimal when h(n) is consistent?
|
||||||||
|
Answer:
Option (d) |
| 29. |
Which is used to improve the performance of heuristic search?
|
||||||||
|
Answer:
Option (b) |
| 30. |
Which search method will expand the node that is closest to the goal?
|
||||||||
|
Answer:
Option (b) |
Developed by
