Back to the 2024 paper
Similar questions
Artificial intelligenceConstraint Satisfaction Problems are usually solved using (i) Backtracking (ii) Breadth First Search (iii) A* Search (iv) Alpha-Beta Pruning20252mArtificial intelligenceDescribe constraint satisfaction problem in detail.20197mDesign & Analysis of AlgorithmsExplain back-tracking, DFS and BFS with help of small example. Differentiate in between backtracking and dynamic programming. Apply the backtracking algorithm to solve the three-colouring problem for the following graph using state space tree. Assume three colours red, green and blue. 201914mDesign and Analysis of Algorithms Differentiate between backtracking and branch & bound.20234m
PreviousHeuristics 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.NextDescribe how Particle Swarm Optimization (PSO) works with a simple analogy (e.g., birds flocking). Show how particles update their positions and velocities.
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.