Nama : Sultan Chairul
NIM : 2581484737
- Explain the primary difference between an uninformed and an informed search algorithm.
- In what scenario would Depth-First Search be more efficient than Breadth-First Search?
- What is a heuristic function, and what role does it play in the A* algorithm?
- Describe a real-world problem (e.g., GPS navigation) that can be solved using a search algorithm.
Answer :
- Uninformed vs. Informed Search
Uninformed search algorithms explore possible solutions without any additional knowledge about the goal. Informed search algorithms use additional information, called a heuristic, to guide the search toward the goal more efficiently. - When is DFS more efficient than BFS?
Depth-First Search (DFS) can be more efficient when the solution is likely to be deep in the search tree and there are many possible paths. DFS also uses less memory than BFS because it does not need to store all nodes at the same level. - Heuristic Function and A*
A heuristic function estimates the cost or distance from the current state to the goal. In the A* algorithm, it helps determine which path should be explored first. A* uses both the cost already traveled and the estimated remaining cost to find an efficient path. - Real-World Example: GPS Navigation
GPS navigation can use search algorithms to find the best route from one location to another. The system considers roads as possible paths and uses factors such as distance, travel time, and traffic conditions to select the most suitable route.
Keterangan : 100%
Bukti : Sudah mengerjakan tugas dengan baik dan benar.