Skip to content

Artificial Intelligence

CSE · Quiz · Fall 25

Paper 1 of 4By MINHAJUL ISLAMSwitch

Paper 1 of 4

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.

Quiz-1 Course Code: CSE316 Course Title: Artificial Intelligence Time: 30 minutes 1 A logistics company is planning to deploy autonomous drones for package delivery across an urban area. The drones must handle weather conditions, avoid obstacles, and maintain delivery efficiency. Describe each PEAS component based on this scenario. [3] 2 [Figure: A weighted graph with nodes A, B, C, D, E. Edge A-B has cost 5, A-C has cost 2, B-D has cost 4, C-D has cost 1, C-E has cost 4, D-E has cost 2, and node E is labeled Goal.] Apply the Uniform-Cost Search (UCS) algorithm to determine the least-cost route in the weighted graph. Demonstrate how UCS expands nodes step-by-step. Conclude by stating the cheapest path from A to E with its total cost. [5] 3 Referring to the graph and search context in Question 2, design and justify a condition where Iterative Deepening Search (IDS) would be more efficient than Breadth-First Search (BFS). [3] 4 Based on the same search environment as Question 2, examine how the branching factor (b) and goal depth (d) affect the time and space complexity of BFS, DFS, and Iterative Deepening Search (IDS) algorithms. [4]