GATE Artificial Intelligence: Search: informed, uninformed and adversarial – Previous Year Questions
7 GATE previous year questions on Search: informed, uninformed and adversarial (Artificial Intelligence, Data Science and Artificial Intelligence) with answers and explanations, from every paper.
- GATE 2024 DA Q23 – Let h 1 and h 2 be two admissible heuristics used in A* search. Which ONE of the following expressions is always an admissible heuristic?
- GATE 2024 DA Q25 – Consider the following statement: In adversarial search, – pruning can be applied to game trees of any depth where is the (m) value choice we have…
- GATE 2024 DA Q44 – Consider a state space where the start state is number 1. The successor function for the state numbered n returns two states numbered n+1 and n+2.…
- GATE 2025 DA Q43 – Consider game trees Tree-1 and Tree-2 as shown. The first level is a MAX agent and the second level is a MIN agent. The value in the square node is…
- GATE 2025 DA Q44 – The state graph shows the action cost along the edges and the heuristic function h associated with each state. [Figure: A directed state graph. S goes…
- GATE 2026 DA Q13 – Which of the following algorithms is NOT an example of uninformed search?
- GATE 2026 DA Q30 – Consider the game tree for a two-player turn-taking minimax game as shown in the figure. The value of a terminal node represents the utility of the…