Syllabus →

Screenshot 2024-04-01 at 10.53.48 AM.png

Screenshot 2024-04-01 at 10.54.04 AM.png

Screenshot 2024-04-01 at 10.54.17 AM.png

Imp topics →

Uninformed BFS, DFS ,Depth limited search, time space complexity, uniform cost search , Informed Search, best first search , A* , Local search algorithm , Min-Max algorithm , Alpha beta pruning IMP! , Genetic Algorithms

Endsem PYQ →

Screenshot 2024-04-01 at 10.56.29 AM.png

Screenshot 2024-04-01 at 10.56.47 AM.png

Screenshot 2024-04-01 at 12.02.36 PM.png

Screenshot 2024-04-01 at 12.04.16 PM.png

Screenshot 2024-04-01 at 12.07.53 PM.png

Let's go through the questions in the provided image and provide detailed answers.

29. a.i. State A* algorithm and explain it with an appropriate example.

Answer: The A* (A-star) algorithm is a popular search algorithm used to find the shortest path from an initial state to a goal state in a graph. It uses both the actual cost to reach the node (g) and a heuristic estimate of the cost to get from the node to the goal (h) to determine the path.

A* Algorithm Steps:

  1. Initialize: Create two lists, an open list and a closed list. The open list contains the initial node, and the closed list is empty.