Back to the 2025 paper
Similar questions
Artificial intelligenceWhich of these search strategies is *not* complete in infinite-depth spaces? (i) Breadth-First Search (ii) Depth-First Search (iii) DFID (iv) A^* Search20242mArtificial intelligenceWhich algorithm is optimal and complete? (i) Depth First Search (ii) Hill Climbing (iii) A* Search (iv) Simulated Annealing20252mArtificial intelligenceBreadth First Search is an example of (i) Informed Search (ii) Uninformed Search (iii) Heuristic Search (iv) Local Search20252mDesign and Analysis of Algorithms In an unweighted graph, which algorithm is guaranteed to find the shortest path between two nodes? (i) Depth First Search (ii) Kruskal's Algorithm (iii) Breadth First Search (iv) Prim's Algorithm20252m
PreviousConstraint Satisfaction Problems are usually solved using (i) Backtracking (ii) Breadth First Search (iii) A* Search (iv) Alpha-Beta PruningNextBayesian Networks are used to handle (i) Certain knowledge (ii) Uncertain knowledge (iii) Deterministic knowledge (iv) Syntax only
AI LearningWeb Platform
Coursify — Personal AI Course Generator
Struggling with a difficult subject or concept? Turn any engineering topic into a structured course with interactive lessons, quizzes, and research-backed explanations.