Back to the 2025 paper
Similar questions
Artificial intelligenceWhich of the following is a stochastic search method? (i) Breadth First Search (ii) Particle Swarm Optimization (iii) Depth First Search (iv) A* Search20252mArtificial 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 is the best way to go for game playing problem? (i) Linear approach (ii) Heuristic approach (some knowledge is stored) (iii) Random approach (iv) An optimal approach20222mDesign 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
PreviousBreadth First Search is an example of (i) Informed Search (ii) Uninformed Search (iii) Heuristic Search (iv) Local SearchNextHeuristic function h(n) is used in (i) Random Search (ii) Brute Force Search (iii) Uninformed Search (iv) Informed Search
Free AppAndroid App
Coursify Android App
Generate AI courses, take quick quizzes between classes, and master complex engineering concepts on the go.