Scribd
Upload
91 views2 pages

5 6314199625653819253

Uploaded by

2023-2-60-284
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
91 views2 pages

5 6314199625653819253

Uploaded by

2023-2-60-284
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

ID: December 14, 2021

EAST WEST UNIVERSITY


Department of Computer Science and Engineering
B.Sc. in Computer Science and Engineering
Mid Term II Examination, Summer 2021 Semester
Course: CSE 366, Artificial Intelligence, Section 2
Instructor: Md Al-Imran, Lecturer, Department of CSE
Full Marks: 20 (20 will be counted for final grading)
Time: 1 Hour and 20 Minutes

Note: There are Four questions, answer ALL of them. Mark of each question are mentioned at the
right margin.

1. In a railway construction field, slacks do not fit accurately. In real case the
slack fits with a rotation of 7 degrees to either side of the proper alignment.
Now consider the problem function as: 𝑓 (𝑥 ) = 210 + 6𝑥12 − 1.5𝑥1 −
2𝑥2 − 6.15𝑥1 𝑥2 + 2.3𝑥22
{Describe/Perception/Apply}

a) What would happen when you are give 𝑇 = ∞ and 𝑇 = 0 in terms [CO2, C2
of SA, and population size of 1 for GA? Marks: 2.5]
b) Find the minimum of the objective function for two iterations [CO2, C3
assuming five sample points. Marks: 2.5]

2. The population of binary strings in a maximization problem is given as


{001100010101101011110001000100100100010100} with fitness
values 7, 11, 14, 5, 12, 15, 10. {Knowledge/Apply}

a) Suppose there is a number of convex and non-convex objects along [CO2, C2


the path of robot motion. Do you think it will get stuck in any either Marks: 2.5]
objects using SA and GA? [CO2, C3
b) Determine the expected number of copies of the best string in the Marks: 2.5]
above population in the mating pool using the roulette-wheel
selection process. Also, find the level of contributions of the various
strings to the mating pool with the following 12 random numbers
0.41, 0.65, 0.42, 0.80, 0.67, 0.39, 0.63, 0.53, 0.86, 0.88, 0.75, 0.55.

3. Consider the problem of placing 𝑘 Knights on an 𝑛 × 𝑛 chessboard such


that no two Knights are attacking each other, where 𝑘 is given and 𝑘 ≤ 𝑛2 .
{Perception/Explain}
[CO2, C2
a) Give a CSP formulation according to the formal definition. In your Marks: 2.5]
formulation, what are the variables and constraints? [CO2, C3
b) Explain how to solve the problem of putting as 𝑘 = 8 Knights on Marks: 2.5]
the board without any attacks with the help of appropriate CSP
method.

Page
This study source was downloaded by 100000862961490 from CourseHero.com 1 of 2 06:44:19 GMT -05:00
on 03-27-2025

https://www.coursehero.com/file/156923234/366-MID-2-2-1pdf/
ID: December 14, 2021

4.

{Describe/Knowledge/Proof}

a) What are the problems you may face while searching the given tree with [CO2, C2
MinMax Algorithm? Mark:2.5]
b) Prove by solving the game tree of Figure 2 that alpha-beta pruning [CO2, C3
performs more significantly than the min-max algorithm in terms of time Mark: 2.5]
space complexity.

Page
This study source was downloaded by 100000862961490 from CourseHero.com 2 of 2 06:44:19 GMT -05:00
on 03-27-2025

https://www.coursehero.com/file/156923234/366-MID-2-2-1pdf/
Powered by TCPDF (www.tcpdf.org)

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy