Computer Science · Artificial Intelligence
Consider the following steps in the A* Search Algorithm: A. Expand the selected node and compute f(n) for successors. B. Select the node with the lowest f(n) = g(n) + h(n) C. Initialize the open and closed lists D. Stop when the goal node is selected from the open list. Choose the correct sequence of execution:
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1A → C → B → D
- 2A → B → C → D
- 3B → A → C → D
- 4C → B → A → D✓
Correct answer
C → B → A → D
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Artificial Intelligence MCQs →Want more practice questions on Artificial Intelligence?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Artificial Intelligence