Back to the 2024 paper
Similar questions
Artificial intelligenceExplain Breadth First Search and Depth First Search with examples.20257mArtificial intelligenceWhich algorithm is optimal and complete? (i) Depth First Search (ii) Hill Climbing (iii) A* Search (iv) Simulated Annealing20252mArtificial intelligenceWhich of the following is a stochastic search method? (i) Breadth First Search (ii) Particle Swarm Optimization (iii) Depth First Search (iv) A* Search20252mArtificial intelligenceBreadth First Search is an example of (i) Informed Search (ii) Uninformed Search (iii) Heuristic Search (iv) Local Search20252m
PreviousThe A^* algorithm guarantees optimality if the heuristic used is: (i) Arbitrary (ii) Inconsistent (iii) Admissible and consistent (iv) RandomNextIn an AND/OR graph, solving an AND node means: (i) Solving one child node is enough (ii) All child nodes must be solved (iii) The node is ignored (iv) Any node can be skipped