Match List I with List II
| List I | List II |
|---|---|
| (a) Greedy best-first search | (I) Space complexity is linear in the depth d of the deepest optimal solution |
| (b) A* | (II) Incomplete even if the search space is finite |
| (c) Recursive best-first search | (III) Optimal if the optimal solution is reachable; otherwise returns the best reachable solution |
| (d) SMA* | (IV) Computation and space complexity are too high |
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: A. (a)-(II), (b)-(IV), (c)-(I), (d)-(III)
Explanation
Greedy best-first (tree) search can be incomplete even in finite spaces (II). A*'s time and space cost is very high (IV). RBFS uses linear space, O(bd) (I). SMA* is optimal if the optimal solution is reachable, otherwise it returns the best reachable one (III).More Artificial Intelligence (AI) questions
- Match List I with List II (space complexity)List I List II (a) Hill climbing (I) O(bd) (b) Best first search (II) O(bd) (c) A* search (III)…
- Arrange the following encoding strategies used in Genetic Algorithms (GAs) in the correct sequence, starting from the initial step and endi…
- Arrange the following steps in the correct sequence for applying K-means clustering to a data set: (a) Randomly initialise cluster centroid…
- Statement I: The fuzzifier is a part of a fuzzy system. Statement II: The inference engine is a part of a fuzzy system.
- Which of the following is NOT a property of a good system for the representation of knowledge in a particular domain?
- Which of the following is NOT a mutation operator in a genetic algorithm?