Total No. of Questions : 8] SEAT No.

8
23
PB3786 [6262]-45 [Total No. of Pages :2

ic-
tat
T.E. (Computer Engineering)

3s
ARTIFICIAL INTELLIGENCE

4:0
02 91
(2019 Pattern) (Semester- II) (310253)

9:4
0
40
Time : 2½ Hours ] 1/0 13 [Max. Marks : 70
0
Instructions to the candidates:
5/2
.23 GP

1) Answer four questions Q.1 or Q.2, Q.3 or Q.4, Q.5 or Q.6, Q.7 or Q.8.
2) Neat diagrams must be drawn wherever necessary.
E
82

8
3) Assume Suitable data if necessary.
C

23
ic-
16

tat
Q1) a) List all problem solving strategies. What is backtracking, explain with n
8.2

3s
queen problem. [8]
.24

4:0
b) Write Minimax Search Algorithm for two players. How use of alpha and
91
49

beta cut-offs will improve performance? [9]

9:4
30
40

OR
01
02

Q2) a) Define Game theory, Differentiate between stochastic and partial games
5/2
GP

with examples. [9]

1/0

b) Define is Constraint satisfaction problem, state the types of consistencies

CE

solve the following Crypt Arithmetic Problem. [8]

82

8
23
BASE
.23

+ BALL ic-
16

tat
GAMES
8.2

3s
.24

4:0

Q3) a) What is an Agent? Name any 5 agents around you explain knowledge
91
49

9:4

based agent with Wumpus World.

30
40

List and explain in short the various steps of knowledge engineering

01
02

process
5/2

Consider the following axioms:

GP

If a triangle is equilateral then it is isosceles. [9]

1/0
CE

b) If a triangle is isosceles, then its two sides AB and AC are equal.

82

If AB and AC are equal, then angle B and C are equal.

.23

ABC is an equilateral triangle.

16

Represent these facts in predicate logic. [9]

8.2

OR
.24
49

P.T.O.
Q4) a) Write the following sentences in FOL(using types of quantifiers) [9]

8
23
i) All birds fly

ic-
ii) Some boys play cricket

tat
iii) A first cousin is a child of a parent’s sibling

3s
iv) You can fool all the people some of the time, and some of the

4:0
people all the time, but you cannot fool all the people all the time.

02 91
9:4
b) What is Knowledge Representation using propositional logic?

0
40
Compare propositional and predicate Logic. [9]
1/0 13
0
5/2
Q5) a) Explain Forward Chaining and Backward Chaining. With its properties,
.23 GP

advantages and disadvantages. [9]

E

b) Explain: [8]
82

8
C

23
i) Unification in FOL

ic-
ii) Reasoning with Default information
16

tat
OR
8.2

3s
.24

4:0
Q6) a) Explain FOL inference for following Quantifiers. [8]
91
49

i) Universal Generalization
9:4
30

ii) Universal Instantiation

40

iii) Existential Instantiation

01
02

iv) Existential introduction

5/2
GP

b) What is Ontological Engineering, in details with its categories object and

1/0

Model. [9]
CE
82

8
23
.23

Q7) a) Explain with an example Goal Stack Planning (STRIPS algorithm). [5]
ic-
16

b) Explain with example, how planning is different from problem solving.

tat
8.2

[5]
3s
.24

c) Explain AI components and AI architecture [8]

4:0
91
49

9:4

OR
30
40

Q8) a) Explain Planning in non deterministic domain. [5]

01
02

b) Explain. [5]
5/2
GP

i) Importance of planning
1/0

ii) Algorithm for classical planning

CE
82

c) What is AI explain scope of AI in all walks of Life also explain future

opprotunities with AI. [8]
.23
16
8.2


.24
49

[6262]-45 2