ACtE07 · Chapter 7Data Structures, DBMS & Operating Systems🏛️ Past Licensure QuestionID: 5df35f21
Greedy best-first search selects the next node based on:
Greedy best-first search selects the next node based on:
Multiple Choice Options
- A
f(n) = g(n) + h(n)
- B
g(n) only
- C✓ Correct Option
h(n) only
- D
Depth of node
Detailed Technical Solution & Explanation
According to standard engineering principles, for Greedy best-first search selects the next node based on:, the correct choice is h(n) only.
Option Analysis:
•
Option A (f(n) = g(n) + h(n)): Incorrect. Does not satisfy the technical condition or specifies an alternate/invalid property.
•
Option B (g(n) only): Incorrect. Does not satisfy the technical condition or specifies an alternate/invalid property.
•
Option C (h(n) only): Correct. Valid technical statement directly addressing the question requirement.
•
Option D (Depth of node): Incorrect. Does not satisfy the technical condition or specifies an alternate/invalid property.
Reference: Demo2 · Set 1NEC Licensure Syllabus