Skip to content

Artificial Intelligence

SWE · Quiz · Summer 26

Paper 3 of 3By MEHEDI HASAN TUHIN (2)Switch

Paper 3 of 3

This browser can’t show the PDF here

Open it, and your phone’s PDF viewer takes it, or download it.

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-A Consider the directed graph below showing the city delivery network in Dhaka. 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 Uttara to Malibagh; show the open list and f = g + h at each step, then state the final path and its total cost. [Figure: A directed graph showing a city delivery network with nodes Uttara, Banani, Gulshan, Badda, Rampura, Malibagh, and Motijheel, with edge weights and heuristic values.] Node | Uttara | Banani | Gulshan | Badda | Rampura | Malibagh | Motijheel h(n) | 20 | 16 | 13 | 11 | 7 | 4 | 0