Back to the 2024 paper
Similar questions
Artificial intelligenceAO* algorithm is used for solving (i) AND-OR graphs (ii) Game trees (iii) Decision trees (iv) Neural networks20252mDesign & Analysis of AlgorithmsDijkstra's algorithm is used to solve ______ problems? - (i) Single source shortest path - (ii) All pair shortest path - (iii) Sorting - (iv) Searching20242mOPERATING SYSTEMIf the wait for graph contains a cycle, then (i) a deadlock does not exist (ii) a deadlock exists (iii) the system is in a safe state (iv) either deadlock exists or system is in a safe state20222mDiscrete MathematicsA simple graph can have (i) multiple edges (ii) self-loops (iii) parallel edges (iv) no multiple edges, self-loops and parallel edges20222m
PreviousWhich of these search strategies is *not* complete in infinite-depth spaces? (i) Breadth-First Search (ii) Depth-First Search (iii) DFID (iv) A^* SearchNextMinimax is used in game playing to: (i) Maximize randomness (ii) Minimize evaluation time (iii) Make optimal moves assuming the opponent plays optimally (iv) Store all possible states
Free AppAndroid App
Coursify Android App
Generate AI courses, take quick quizzes between classes, and master complex engineering concepts on the go.