Artificial Intelligence Algorithms Question: Download Artificial Intelligence Algorithms PDF
How many states are present in parsing?
a) 1
b) 2
c) 3
d) 4
Answer:
c) 3
Explanation:
The three state available in parsing are initial state, successor function and goal test.
Explanation:
The three state available in parsing are initial state, successor function and goal test.
| Previous Question | Next Question |
| Flexible CSPs relax on: a) Constraints b) Current State c) Initial State d) Goal State | How many objects are available in closed classes? a) 1 b) 2 c) 3 d) 4 |