Artificial Intelligence
SWE · Quiz · Summer 26
Paper 2 of 3By MEHEDI HASAN TUHIN (1)Switch
Paper 2 of 3
Read the questions as text
Read off the PDF by AI, so it may have mistakes. The PDF is the original.
Daffodil International University
Faculty of Science & Information Technology
Department of Software Engineering
Quiz-1, Summer-2026
Course Code: SE 333; Course: Artificial Intelligence
Teacher: NAJ
Time: 30 minutes
Marks: 15
Set-B
Consider the directed graph below showing the road network between districts of Bangladesh. Each edge shows the distance between two locations and each node has a heuristic, h(n), estimating the remaining distance to the goal. Using the A* Search Algorithm, find the shortest path from Dhaka to Sylhet. Show the open list and the calculation of f = g + h at each step, then state the final path and its total cost.
[Figure: A directed graph showing road distances between districts: Dhaka to Narayanganj (weight 5), Dhaka to Comilla (weight 13), Narayanganj to Brahmanbaria (weight 6), Comilla to Brahmanbaria (weight 4), Brahmanbaria to Habiganj (weight 7), Habiganj to Sylhet (weight 11), Habiganj to Maulvibazar (weight 5), Maulvibazar to Sylhet (weight 4).]
h(n) values:
Node | Dhaka | Narayangan | Comilla | Brahmanbari | Habiganj | Maulvibazar | Sylhet (Goal)
h(n) | 25 | 20 | 18 | a | 8 | 3 | 0