Scribd
Upload
100 views

CSE422 Midterm Spring 2022

This document contains a midterm exam for an Artificial Intelligence course. The exam contains 5 questions with multiple parts each. Question topics include intelligent agents, search techniques like A* search, hill climbing search, and constraint satisfaction problems. Students are instructed to answer 4 out of the 5 questions. Each question part is assigned a number of marks.

Uploaded by

Ali Hossain
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
100 views

CSE422 Midterm Spring 2022

This document contains a midterm exam for an Artificial Intelligence course. The exam contains 5 questions with multiple parts each. Question topics include intelligent agents, search techniques like A* search, hill climbing search, and constraint satisfaction problems. Students are instructed to answer 4 out of the 5 questions. Each question part is assigned a number of marks.

Uploaded by

Ali Hossain
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

BRAC UNIVERSITY

Department of Computer Science and Engineering


Examination: Midterm Semester: Spring 2022
Duration: 1 Hour Full Marks: 40
CSE 422: Artificial Intelligence
Answer any 4 out of 5 from the following questions.
Figures in the right margin indicate marks.
Name: ID: Section:

1. CO1 a) What is an intelligent agent and environment? 2


b) Describe the sensors and actuators, and Identify the elements of the 5
environment in case of an intelligent agent in a self-driving car.
c) Identify differences between table-driven and goal oriented agents. Write them 3
down.

2. CO2 a) Introduce/define the four criteria that we use to compare search techniques. 2
b) Analyze the complexity, completeness and optimality for the following search 6
techniques. Write the space and time complexity, whether the search technique is
complete or not, and whether it is optimal or not. Give reasoning for your answer.
i) Depth-First Search
ii) Iterative Deepening Depth-First Search
c) Introduce a scenario where breadth-first search may be suboptimal. 2

3. CO3

a) Predict whether A* search algorithm will be able to provide an optimal path 2


from the start node A to the goal node G for the above graph. Why or why not?
b) Considering A as the start node and G as the goal node, Apply A* search 8
algorithm for the given graph. Make sure to show each step.
4. CO4 a) Analyze the drawbacks of Hill Climbing Search along with the possible 7
solutions. Now, Select one solution which can guarantee to find the global maxima
and justify the reason.
b) Compare the greedy approaches of Greedy Best First Search and Hill Climbing 3
Search.

5. CO5 a) Explain the concept of forward checking with an example. 5


b) Suppose, the following graph represents a map coloring CSP problem. You are
trying to color the following graph with 3 colors: Red, Green and Blue such that no
two adjacent node has the same color. Node A is already colored as Red (R) and
node G is colored as Green (G).

Assess which node will be visited in the following map coloring example if
i) Degree heuristic is used. Explain your answer. 2.5
ii) According to Least constraining value heuristic, which color will be 2.5
chosen for node B in the given graph? Explain your answer.

You might also like