Module Question 2-BD107-Amelia Nurul Mupty-2581499006

Module Question 2

1. Explain the primary difference between an uninformed and an informed search algorithm.
2. In what scenario would Depth-First Search be more efficient than Breadth-First Search?
3. What is a heuristic function, and what role does it play in the A* algorithm?
4. Describe a real-world problem (e.g., GPS navigation) that can be solved using a search algorithm.
   the answer

   The answer

   1. Uninformed vs. Informed Search:
      Uninformed search has no extra knowledge about the goal, while informed search uses additional information or a heuristic to find the goal faster.
   2. Depth-First Search (DFS):
      DFS can be more efficient when the solution is deep in the search tree and there are many possible paths, because it explores one path deeply before trying others.
   3. Heuristic Function in A*:
      A heuristic function estimates the cost from the current state to the goal. In A*, it helps choose the most promising path and find a solution efficiently.
   4. Real-World Example:
      GPS navigation uses search algorithms to find the best route from one location to another. It considers factors such as distance, travel time, and traffic conditions.