ACtE07 · Chapter 7Data Structures, DBMS & Operating Systems🏛️ Past Licensure QuestionID: 50b1739a
What are the key components of search problem in AI?
What are the key components of search problem in AI?
Multiple Choice Options
- A✓ Correct Option
Initial state, goal state, operators
- B
Nodes, edges, weights
- C
Input, output, processing
- D
Data, algorithm, solution
Detailed Technical Solution & Explanation
In Artificial Intelligence problem-solving (Russell & Norvig), a formal search problem is defined by its state space formulation, which fundamentally comprises: the initial state, the set of permissible operators (actions/successor functions), the goal state (or goal test), and the path cost function.
Option Analysis:
•
Option A (Initial state, goal state, operators): Correct. These constitute the canonical definition of a state space search problem in AI.
•
Option B (Nodes, edges, weights): Incorrect. These represent graph data structure elements rather than the formal semantic components of an AI problem.
•
Option C (Input, output, processing): Incorrect. This describes a generic computer processing model (IPO cycle).
•
Option D (Data, algorithm, solution): Incorrect. This describes general programming/computational paradigms, not AI search formulation.
Reference: Demo2 · Set 1NEC Licensure Syllabus