Skip to content

Artificial Intelligence

SWE · Quiz · Summer 26

Paper 1 of 3Section 41Switch

Section 41

Paper 1 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 Department of Software Engineering Faculty of Science & Information Technology Quiz 2, Summer 2026 (Set C) Course Code: SE333, Course Title: Artificial Intelligence Section: 41__ Instructor: TBH Marks: 15 Duration: 35 Minutes 1. Apply A* search and Greedy Best First Search on the given graph to find the optimal path and the cost of the optimal path. The values around the nodes represent the heuristic values for each node. [Figure: Graph containing nodes S1, S2, S3, S4, S5, S6, W1, W2, W3, W4, W5, E1, E2, E3, E4, E5, E6 with weighted edges and heuristic values in brackets] "There are some sights you only see when you take a detour."