Match the search algorithms to the properties below. Assume finite branching, positive step costs, and admissible heuristics for the A* variants.
List I:
(A) Greedy best-first tree search without cycle checking
(B) Standard A* retaining its search frontier
(C) Recursive best-first search (RBFS)
(D) Simplified memory-bounded A* (SMA*)
List II:
(I) Uses \(O(bd)\) memory, where \(b\) is the branching factor and \(d\) is the maximum retained path depth.
(II) Can be incomplete on a finite state graph because it may repeatedly traverse a cycle.
(III) Finds an optimal solution if sufficient memory can retain an optimal path; otherwise finds the best solution reachable within the memory bound.
(IV) May require exponential time and memory in the worst case.
Choose the correct answer from the options given below.
A - II, B - IV, C - I, D - III
Greedy tree search without cycle checking can loop, giving A–II. Standard A* can store exponentially many nodes, giving B–IV. RBFS stores a path and its alternatives in \(O(bd)\) space, giving C–I. SMA* searches under a fixed memory bound and is optimal when an optimal solution path fits in memory, giving D–III.
Important Questions from Artificial Intelligence - Teaching
- Which of the following best describes Generative AI?
- Which one of the following is not matching the broad functionality?
Which of the following languages is suitable for artificial intelligence?
- Which organization developed ChatGPT?
Which of the following statements are true?
(A) Minimax search is breadth-first: it processes all the nodes at a level before moving to a node in next level.
(B) The effectiveness of the alpha-beta pruning is highly dependent on the order in which the states are examined.
(C) The alpha-beta search algorithm computes the same optimal moves as minimax algorithm.
(D) Optimal play in games of imperfact information does not require reasoning about the current and future belief states of each player.
Choose the correct answer from the options given below:
