Back to the 2025 paper
Similar questions
Artificial intelligenceBreadth First Search is an example of (i) Informed Search (ii) Uninformed Search (iii) Heuristic Search (iv) Local Search20252mArtificial intelligenceHeuristics are designed to guide search algorithms efficiently, but they can sometimes mislead the search. Describe a situation in which A* search performs worse than an uninformed search due to a poorly chosen heuristic.20247mArtificial 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 The 0/1 Knapsack problem is traditionally solved using which approach to ensure an optimal solution? (i) Greedy Method (ii) Dynamic Programming (iii) Brute-Force only (iv) Linear Search20252m
PreviousWhich algorithm is optimal and complete? (i) Depth First Search (ii) Hill Climbing (iii) A* Search (iv) Simulated AnnealingNextAO* algorithm is used for solving (i) AND-OR graphs (ii) Game trees (iii) Decision trees (iv) Neural networks
Budget AppAndroid App
Pocketly on Android
Log daily food, travel, and hostel expenses instantly. Set monthly spending limits and see where your money goes without complex spreadsheets.