Scribd
Upload
159 views

CSE422 Midterm Fall 2022

This document provides information for a midterm exam in an Artificial Intelligence course, including 5 questions covering topics like agent design, search algorithms, and game theory. Students are instructed to answer 4 out of the 5 questions, which involve tasks like analyzing agent properties, solving problems using genetic algorithms, discussing hill climbing and simulated annealing, and applying minimax and alpha-beta pruning to game trees. Marks are allocated for each part of each question.

Uploaded by

Ali Hossain
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
159 views

CSE422 Midterm Fall 2022

This document provides information for a midterm exam in an Artificial Intelligence course, including 5 questions covering topics like agent design, search algorithms, and game theory. Students are instructed to answer 4 out of the 5 questions, which involve tasks like analyzing agent properties, solving problems using genetic algorithms, discussing hill climbing and simulated annealing, and applying minimax and alpha-beta pruning to game trees. Marks are allocated for each part of each question.

Uploaded by

Ali Hossain
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
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: Semester Midterm Semester: Fall 2022


Duration: 1 Hour 10 Minutes Full Marks: 40
CSE 422: Artificial Intelligence
Answer 4 out of 5 from the following questions
Figures in the right margin indicate marks

Name: ID: Section:

1. CO1 a. Assume you have tried to design an AI agent. Now suppose, when making a 2
decision, your agent doesn't utilize the continuous percepts that it receives
from the environment and only relies on the domain knowledge that you had
provided to it initially. Identify the property of an Intelligent agent your agent
lacks.
b. Identify which of the following statements are true or false. Provide reasons 6
behind your answers: (i) An AI based Chess game is an example of a Dynamic
Environment; (ii) A simple reflex agent relies on its percept sequence; (iii)
For an agent to be rational, it first needs to be Intelligent.
c. Bullet Point two advantages that a Utility based agent can have over a Goal 2
based agent.

2. CO2 In the following graph, A is the


source and I is the destination.
Each edge has a cost associated
with it.

a. For each of the nodes from A to I in the graph above, define a random heuristic 10
value that is consistent.

3. CO2 Assume [X1, X2, X3, X4, X5, X6, X7, X8] represents a set of 8 numbers
where each number can be anything from 1 to 100. Now your task is to find
such a set with a combination of numbers where the difference between sum
of the even numbers and sum of the odd numbers is 30. And you have to solve
this problem using Genetic Algorithm. So, for e.g., if D1 represents sum of the
odd numbers and D2 represents sum of the even numbers then (D1 - D2) or
(D2 - D1) will be equal to 30 for the solution.
a. Encode the problem and deduce two parent chromosomes, PC1 and PC2. But 2
for PC1, the value of X1 should be 100, and for PC2 the value of X1 should
be 1.
b. Define a suitable fitness function for the problem and calculate the fitness of 5
PC1 and PC2.
c. Illustrate single point crossover after X4 between PC1 and PC2, and then 3
perform mutation. You can mutate a number of your choosing. Finally,
calculate fitness of the two newly formed child chromosomes and comment
on which child is fitter.

4. CO2

a. What kind of problem a hill climb search might face if it starts at point A? 3
Explain.
b. Apart from the problem given in question a, can you suggest any other 4
problems that might occur? Discuss in details.
c. Explain the main advantage of simulated annealing algorithm over regular hill 3
climb algorithm.

5. CO4

a. If you run minimax algorithm on this adversarial search tree, what would be 3
the values at nodes A, B, and C? Show your entire process.
b. Define the values of α and β at nodes A, B, and C if you ran alpha-beta pruning 3
here?
c. Analyze the game tree and sort the leaf nodes in a way so that the edge from 4
A to C is pruned if you ran alpha-beta pruning. Give the values of α and β at
nodes A, B, and C.

You might also like