GATE DA 2025 Set 1 — Question 44
Go beyond PYQs with Success TrackerAI-powered personalised practice and doubt support. Unlimited practice on eligible plans; AI usage limits apply.MCQ+2 / -0.67MediumA* SearchInformed SearchArtificial Intelligence
Artificial Intelligence → Informed Search → A* Search
Last updated
Question
The state graph shows the action cost along the edges and the heuristic function associated with each state.
Suppose algorithm is applied on this state graph using priority queue to store the frontier. In what sequence are the nodes expanded?
Correct answer
(C) S,A,E,B,C,D,G
Solution
The algorithm expands nodes based on the evaluation function .
1.Expand S: Frontier = {(A, ), (E, )}.
2.Expand A (): Neighbor B is added to frontier. Path S-A-B has . Frontier = {(E, ), (B, )}.
3.Expand E (): Neighbor B is reached via a better path S-E-B with . Update B in frontier. Frontier = {(B, )}.
4.Expand B (): Neighbor C is added. Path S-E-B-C has . Frontier = {(C, )}.
5.Expand C (): Neighbor D is added. Path S-E-B-C-D has . Frontier = {(D, )}.
6.Expand D (): Neighbor G is added. Path S-E-B-C-D-G has . Frontier = {(G, )}.
7.Expand G (): Goal reached.
The expansion sequence is S, A, E, B, C, D, G, which corresponds to option (C).Continue learning with Success Tracker
A step still unclear? Work through it with support
Use Success Tracker to ask about the reasoning, then try another GATE DA question to check your understanding.
AI-powered practice· Unlimited practice on eligible plans
- PYQs with solutions
- Attempt available previous-year questions, then compare your reasoning with the worked solution. Coverage varies by stream.
- Practice that adapts
- Choose a topic, work on weaker areas and bookmark questions to revisit. Your attempts feed your progress tracking.
- AI doubt support
- Ask follow-up questions about a step or concept while practising, instead of stopping at the final answer.
Unlimited practice is available on eligible plans. Free practice and AI usage have limits; check the current plan allowances before choosing.
This page stays readable without an account. AI responses can be wrong; check them against the solution and source material.
More questions on Informed Search
2026 Set 1 Q13Which of the following algorithms is NOT an example of uninformed search?2026 Set 1 Q14Which of the following statements is NOT true? (The names of the predicates are intuitive.)2026 Set 1 Q23In the following table, the
Task column lists a few tasks related to machine learning. The…2026 Set 1 Q24Sentence is said to entail Sentence if whenever is TRUE, also must hold TRUE. Which…2026 Set 1 Q30Consider the game tree for a two-player turn-taking minimax game as shown in the figure. The value…