Computer-Organization
November 18, 2023Artificial-Intelligence
November 18, 2023Artificial-Intelligence
|
Question 46
|
|
(a)-(i), (b)-(iv), (c)-(iii), (d)-(ii)
|
|
|
(a)-(iv), (b)-(i), (c)-(ii), (d)-(iii)
|
|
|
(a)-(i), (b)-(iv), (c)-(ii), (d)-(iii)
|
|
|
(a)-(iv), (b)-(ii), (c)-(i), (d)-(iii)
|
Question 46 Explanation:
Steepest – accent Hill Climbing→ Considers all moves from current state and selects best move.
Branch – and – bound → Keeps track of all partial paths which can be a candidate for further exploration
Constraint satisfaction → Discover problem state(s) that satisfy a set of constraints
Means – end – analysis → Detects difference between current state and goal state
Branch – and – bound → Keeps track of all partial paths which can be a candidate for further exploration
Constraint satisfaction → Discover problem state(s) that satisfy a set of constraints
Means – end – analysis → Detects difference between current state and goal state
Correct Answer: B
Question 46 Explanation:
Steepest – accent Hill Climbing→ Considers all moves from current state and selects best move.
Branch – and – bound → Keeps track of all partial paths which can be a candidate for further exploration
Constraint satisfaction → Discover problem state(s) that satisfy a set of constraints
Means – end – analysis → Detects difference between current state and goal state
Branch – and – bound → Keeps track of all partial paths which can be a candidate for further exploration
Constraint satisfaction → Discover problem state(s) that satisfy a set of constraints
Means – end – analysis → Detects difference between current state and goal state