Paper / Subject Code: 89284 / Artificial Intelligence

(3 Hours) [Total Marks: 80]

Note: i) Question no. 1 is compulsory

ii) Attempt any three from remaining
iii) Assume necessary data

1 (a) Explain the Learning Agent with suitable block diagram. 5

(b) Give difference between Informed Search and Uninformed search 5

Algorithms.

(c) Give PEAS and state space description for “Automobile Driver Agent” 5

(d) Explain different quantifiers with example. 5

2 (a) Explain various properties of task environment with suitable examples 10

(b) - What is Game Playing Algorithm? Draw a game tree for Tic-Tac-Toe 10
problem.

3 (a) Illustrate forward-chaining and backward-chaining algorithm with suitable 10

example.

(b) Explain Hill Climbing Algorithm and problems that occurs in hill climbing 10
algorithm?
4 (a) What do youmean by Resolution? Also discuss the steps in Resolution. 10

(b) Consider problem of changing a flat tire. The goal is to have a good spare 10
tire properly mounted on to the car’s axle, where the initial state has a flat
tire on the axle and a good spare tire in the trunk: Give the ADL
description for the problem and also discuss the solution

5 (a)~ Explain Partial-order planning with suitable example. 10

(b) Define Belief Network. Describe the steps of constructing belief network 10
with an example.

6 ‘Write short notes on any Two of following:

(a) Explain different applications of Al in Healthcare, Retail and Banking. 10

(b) Alpha Beta Pruning 10

(c). - Wumpus world Environment 10

54516 Page1of1

X237Y64F3DFX237Y64F3DFX237Y64F3DFX237Y64F3DF
 J——
T B R . SRR
Pnfier / Subject Code: 89284 / Artificial Intelligence
. T&(GW%PI&N\—V,_E/"?'U/'g'%d\uho/&sbx»ar/%.u@aq
Oatoy ~ 12 |L]a.¢u?
Time: 3Hrs. QR eadesy- \00€%192_Marks: 80

NOTE: - Q1 is compulsory
Solve any three from remaining.

Q1. Solve any four from following. [20]

Explain the concept of Conditional order planning.
Explain the working of reinforcement learning.
OO

Describe four categorize of Artificial Intelligence.

Illustrate the application areas of Al in the Robotics.
Generate the parse tree for a sentence “The cat ate the fish”’.
g

Q2. a. All people who are graduating are happy. All happy people smile. Someone is [10]
graduating. Convert to FOL and CNF, Also Prove that “Is someone smiling?”
Solve using resolution.
b. Design a planning problem using STRIP for Air cargo transport. It involves [10]
A~
loading and unloading cargo onto and offof planes and flying it from place. Initial
State: At SFO airport, Cargol, Planel and at JFK airport, Cargo2, Plane2 is
present. Goal State: At SFO airport Cargo2 and at JFK airport Cargol is present.

Q3. a. Apply greedy best-first search. At each iteration, each node is expanded using [10]
evaluation function f (n) = h(n). h (S) = 10, h (A) = 10, h(D) = 8, h(B) = 6, h(E) =
6.5,h (C)=4,h (F) =3, h(G) = 0.8 is start state and G is goal state.

/
3
-
| '+ e
& = P

' 4 =

b. Explain the Depth Limit search and Depth first iterative deepening search. [10]

Q4. a. Formulate the problem, Choose the formulation that is precise enough to be [10]
implemented. Also identify the initial state, goal test, successor function, and cost
function for the following.
Problem statement: Autonomous Taxi driver
b. . Explain the concept of PAC learning [10]

Q5. a. Task of cleaning house has been assigned to a vacuum cleaner robot. Initial
location of robot is not known. Robot has to execute appropriate actions in order
to clean house. Identify the appropriate type of an agent and applicable task
environment, also identify the PEAS parameters.

b. Apply alpha beta pruning on following graph

65192 Page 1 of 2

VI2TVAORY 17¥I2TVAARI 12¥I2TVAORI 12VI2TVAOLI 12

 Paper / Subject Code: 89284 / Artificial Intelligence

\
5

—~

. [20] 4
Q6. Write detailed note on following. (Any two)
a. Wumpus World Environment
b. Differentiation of Forward and Backward Chaining
c. Language models of Natural Language Processing*

e sk sk ok ok ok ok kOkOkOK

65192 Page 2 of 2

VI2TVAORY 11VI2TVAORT 12¥I21TVAORI 12YI2TVAORI 12

 Paper / Subject Code: 89284 / Artificial Intelligence

Time: 3 Hours Marks: 80

1) Q.1 is compulsory
2) Attempt any three from remaining five questions

Q1) Solve any four of the following:

a) Describe different categories of Al [5]

b) Describe the characteristics of a medical diagnosis system using the PEAS properties = [5]
c) Explain Goal based Agent with a block diagram [5]
d) Compare and contrast propositional logic and first order logic [5]
e) What do you mean by hill climbing. Explain. [5]

Q2)
a) Perform o - B pruning on the following graph, clearly indicating the
o and B cuts and the final value of root node. [10]

i 0 \
c
MIN .

D E F g H \ !
MAX \ /‘

) K L M N o0 P @ R S T UVW
Xx Y Z a

b) What do you understand by informed and uninformed search methods? Explain in detail

with example. [10]

Q3)
a) Consider the following statements: [10]
a) All people who are earning are happy
b) All happy people smile
¢) Someone is earning
Perform the following tasks:
i) Represent above statements in FOL
ii) Convert each to CNF
iii) Prove that someone is smiling using resolution technique. Draw the resolution tree

b) What do you understand by forward chaining and backward chaining. Explainin detail

[10]

26341 Page 1of 3

75D8E3CF77ED0252F6C15C1FD6F31AA4
 Paper / Subject Code: 89284 / Artificial Intelligence

Q4

a) For the given graph, the table below indicates the path costs and the heuristic values. S is the
start node and G1, G2 and G3 are the goal nodes. Perform A* search to find the shortest distance

path from S to any of the goal nodes. [10]

Edge Cost Edge Cost Edge Cost

SA 5 BA 2 DS 1
SB 9 BC 1 DC 2
SD 6 cs 6 DE 2
AB 3 CG2 5 EG3 7
AG1 9 CF 7 FD 2
FG3 8

Node | Heuristic | Node | Heuristic | Node | Heuristic

S 5 D 6 Gl 0
A 7 E 5 G2 0
B 3 F 6 G3 0
C 4

b) What is planning in AI? Discuss partial order planning and hierarchical planning in detail [10]

26341 Page 2of 3

75D8E3CF77ED0252F6C15C1FD6F31AA4
 Paper / Subject Code: 89284 / Artificial Intelligence

Q53)
a) Explain the concept of genetic programming [10]
b) What is formulation of a problem. Formulate the Wumpus world problem in terms of following
components: initial state, actions, successor function, goal test, path cost. [10]

Q.6 Write short notes on : [20]

a) Applications of AT
b) Simulated annealing

e 3k 3k e ek ofk dkokokolkeokok

26341 Page 30of 3

75D8E3CF77ED0252F6C15C1FD6F31AA4
 Paper / Subject Code: 89284 / Artificial Intelligence

T.E./VI/COMP /C SCHEME / DEC 2023/ 18.12.2023

(3 Hours) otal Marks: 80

1) Q.1 is compulsory
2) Attempt any three from remaining five questions

Q1) Solve any four of the following:

a) Describe different types of environment of Al agents 151

b) What do you mean by Total Turing test. Explain. 5]
¢) Explain Utility based Agent with a block diagram 151
d) Formulate the 8 puzzle problem 15]
e) Describe the characteristics of a part picking robot using the PEAS properties 151

Q2) a) What do you understand by Min Max Search and alpha beta search? Explain in detail
with example. 110]
b) What do you understand by A* search? Is it informed or uninformed search — Justify.
110}

Q3) a) Explain steps involved in converting propesitional logic statement into CNF with
suitable example [10]
b) What do you understand by forward chaining and backward chaining. Explain in
detail [10]

Q4) a) Explain various methods of knowledge representation. [10]

b) What are local search algorithms? Explain any one in detail [10]

Q5) a) What is planning in Al? Discuss partial order planning and hierarchical planning
in detail [10]
b) What do you understand by Reinforcement learning. Explain i1 detail |10}

Q6) Write short notes on any two of the following: [20]

a) Wumpus World Environment

b) Applications of Al
¢) Natural Language Processing

38793 Page 1 of 1

SOFIFAFD7FF249C2BI9FAT2030EE2D394
T.E.(Computer Engineering)(SEM-VI)(Choice Base Credit Grading System ) (R-2020-21) (C Scheme) / 89284 - Artificial
Intelligence / 27.05.2022
R W . NGy
University of Mumbai /19\““/-344« 660
Examinations Summer 2022 e
Time: 2hour 30 minutes Max. Marks: 80

Q1 Choose the correct option for following questions. All the Questions are
: compulsory and carry equal marks
1. The computer program that simulates the thought process of humans is known as:

Option A: | Expert reason

Option B: | Personal information

Option C: | Expert system

Option D: | Human logic

2. is the heuristic function of greedy best-first search and

is heuristic function of A* Algorithmic search.

Option A: | F(n)!=h(n) and f(n)= h(n) + g(n)

Option B: | F(n)=h(n) and f(n) = h(n) + g(n)

Option C: | F(n)>h(n) and f(n) = h(n) g(n)

Option D: | F(n)<h(n) and f(n) = h(n) + g(n)

3. The search strategy that uses a problem specific knowledge is known as

Option A: | Heuristic Search

Option B: | Informed Search

Option C: | Best-first Search

Option D: | All of the above Search

4. In which agent does the problem generator is present?

Option A: | Learning agent

Option B: | Simple-reflex agent

Option C: | Goal based agent

Option D: | Utility based agent

1|Page

F398EFCIF13F4B2A267CB6C11EOFCS887
 93660

5. is the fiel’d that investigates the mechanics of human intelligence.

Option A: | Sociology

Option B: | Nurology

Option C: | Cognitive science

Option D: | Psychology

6. ‘What is present in empty plan?

Option A: | Start

Option B: | Finish

Option C: | Modest

Option D: | Both Start and Finish

7. Which is the most straightforward approach for planning?

Option A: | Best first search

Option B: | Hill climbing search

Option C: | Depth first search

Option D: | State space search

8. What are you predicating by the logic Vx :3y : loyal_to(x,y)?

Option A: | Everyone to Joyal to all

Option B: | Everyone is loyal to someone

Option C: | Everyone is not loyal to someone

Option D: | Everyone is loyal

9. Which of the following is not a stage of knowledge engineering?

Option A: | Assemble the relevant knowledge

Option B: | Encode general knowledge about the domain.
Option C: | Identify the task.
Option D: | Fixing a problem.

10. The father of Al is

Option A: | Alan Turing

2|Page

F398EFCIF13F4B2A267CB6C11EOFC887
 93660

Option B: | John McCarthy

Option C: | Russel Stuart
Option D: | Andrew Ng

Q2. Solve any Four out of Six 5 marks each

(20 Marks)
A Explain WUMPUS world environment giving its PEAS description.
Explain how percept sequence is generated.
B Werite a short note on conditional probability and its role in Al
c ‘What are the limitations of Hill Climbing Search and how that can be
overcome?
D Explain the concept of Supervised Learning.
Convert the following statements into predicate logic
1. All kings are persons.
E 2. Every city in Maharashtra has temple.
3. An Apple a day keeps doctor away.
4. Anything anyone eats and is not killed by is food.
5. Square of 3is 9.
F Explain the steps involved in Natural Language Processing.

Q3. Solve any Two Questions out of Three 10 marks each

(20 Marks)
Consider the foliowing facts:
1. Steve only likes easy courses.
A 2. Science courses are hard.
3. All the courses in the basket_weaving department are easy.
4. BK301 is a basket_weaving course.
Find by resolution that “What course would steve like?”
B List down all agent types. Explain each with block diagram.
Apply A* algorithm on the following graph. Heuristic values are h(S) =
15, h(A) = 14, h(D) = 12, h(B) = 10, h(E) = 10, h(C) = 8 , h(F) = 10
,h(‘G) =0.S is the start node and G is the goal node.

.
C

Q4.
(20 Marks)
A Solve any Two 5 marks each
i Give types of parsing and generate the parse tree for a sentence “The
cat ate the fish”.
ii. Explain Simulated Annealing with suitable example.
iii, Differentiate between Informed search and uninformed search
Algorithms.
B Solve any One 10 marks each

3|Page

F398EFCIF13F4B2A267CB6C11EQFC887
 93660

i What is plannifig? List types of planning and describe in detail Partial

order planning.

ii. Apply the alpha beta pruning on following example by considering the
root node a max.

4|Page

F398EFCIF13F4B2A267CB6C11E0FC887
TE-
Co wp [ s E M - T L / R 4 / s H » Z O z L / f5 -12 - 2022
TE - Paper / Subject Code: 89284 / Arg@ial Inte]ll?ence
g

&
A MaxMark.s S(L(f

NOTE: - Q1 is compulsory S
N &S
Q‘ 3
Solve any three from remall@mg

QI. Solve any four from followin; 3 X AQYZO]

a. Compare the importance of Partial orfier planning over Total‘kirder plannftig.
b. What data is used to evaluar.e flwarcPand p\ml&kfihem of mb}}‘t nav1gatj0?fl

2N
c. Explain the categorization of Int&jhgent Syslém
d. How Al will help: e Robuti}s appllcansh
e. Generate the parse’tree for a“?éntence “fiie cat ate dié fuh P,
f. What do you, m?an by state;pace rep(e?entanon‘lfiiplam wi
of it ’

Q2. a. Wha;fi:t;fions ‘would you take:

prg%%slxtlonal logic
oeverxpn read is
Dolphxns“%re not llk te.
Som&dolphmsareintelligent;
> & AN <
= )«‘ 7N \\,
X Solve the Au’\ cargo transpon melem usii anning. ‘Pl’mvolves,\}f)admg Qik‘f
it from place. Initial ?a!e is M
Zandp@nehsatDlhl c
Tg cargo 2 hould be Wumbal al(p‘ort and cqr?o 1 should

3 QiL a. Apply A* algomhm on the followmg graph Heunshg. alues are«‘:"

h(S)15, h(A: al4 h(D) £12, h(B 0, h(C)*‘X h(F) = 10,
7 hG)=0. - e Q [10]
“\\S is the s(ag‘l 'node an&/{@ isthe go ‘node. ‘b\:\;\
£ ped

[10]

Page 10f2

22CD8DE2EA92ED2C2EE63485B4DD1406
 o ~
Sre Y
Paper / Subject Code: 89284 / Art ial Intelligence
o

Q4. a. Apply the alpha beta pruning on fo,lg‘w

max.

fij‘éxplamPEAS descrlm.ms alsos;@ie PEAS dgsmptmu fm; online Enghsh tutor.

> w %=
Q5. a. E)gplam Prob.k“ formul
e?kn also gi & the 1mt1al§téte, goa[,@sfsuccess&\functlon{
<and cost fufi:fion for ollowin & \v k
& Choose tl;e fonnulat{&ih that is precise enou)sfio be im Lfli’]ented 33
\(f Probler statemerit: A 3 foog\&/all monkle ina room:where sonie bananas,arg
37 suspet nded from.thé 8 foot tall ceiling. He'would 111{:‘{0 get bananas The rgom
kable, mfiyable, clnm&ble 3 foothigh crates:”

Q6 Write detaled note on foll

a. Hxlfi:lxmbmg@l@mhm
. ar@%acmawgflmnmg

Page 2 of 2

22CD8DE2EA92ED2C2EE63485B4DD1406