Total No. of Questions : 8] SEAT No.

8
23
P-7547 [Total No. of Pages : 3

ic-
tat
[6180]-55

0s
5:0
T.E. (Computer Engineering)

02 91
9:4
ARTIFICIAL INTELLIGENCE

0
30
4/1 13
(2019 Pattern) (Semester - II) (310253)
0
2/2
Time : 2½ Hours] [Max. Marks : 70
.23 GP

Instructions to the candidates :

E
81

1) Answer four questions Q.1 or Q.2, Q.3 or Q.4, Q.5 or Q.6. Q.7 or Q.8.

8
C

23
2) Neat diagrams must be drawn wherever necessary.

ic-
3) Assume suitable data if necessary.
16

tat
8.2

0s
Q1) a) List All problem solving strategies. What is backtracking, explain with n
.24

5:0
queen problem. [8]
91
49

9:4
b) Write Minimax Search Algorithm for two players. How use of alpha and
30
30

beta cut-offs will improve performance? [9]

01
02

OR
2/2
GP

Q2) a) Define Game theory, Differentiate between stochastic and partial games
4/1

with examples. [9]

CE
81

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

23
.23

Solve the followiig Crypt Arithmetic Problem.

ic-
[8]
16

tat
B A S E
8.2

0s

+ B A L L
.24

5:0
91

G A M E S
49

9:4
30
30

Q3) a) What is an Agent. Name any 5 agents around you Explain Knowledge
01
02

based agent with Wumpus World. List and explain in short the various
2/2

steps of knowledge engineering process [9]

GP
4/1

Consider the following axioms:If a triangle is equilateral then it is isosceles.

CE

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

81

and AC are equal, then angle B and C are equal.ABC is an equilateral

.23

triangle. Represent these facts in predicate logic. [9]

16

OR
8.2

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

8
23
i) All birds fly

ic-
tat
ii) Some boys play cricket

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

5:0
02 91
iv) You can fool all the people some of the time and some of the

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

30
4/1 13
b) What is Knowledge Representation using propositional Logic? Compare
0
2/2
propositional and predicate Logic. [9]
.23 GP
E
81

8
C

23
Q5) a) Explain Forward Chaining and Backward Chaining. With its Properties,

ic-
advantages and Disadvantages. [9]
16

tat
8.2

Explain :

0s
.24

5:0
b) i) Unification in FOL [8]
91
49

9:4
ii) Reasoning with Default information
30
30

OR
01
02
2/2

Q6) a) Explain FOL inference for following Quantifiers

GP

[8]
4/1

• Universal Generalization
CE
81

8
23
• Universal Instantiation
.23

ic-
16

• Existential Instantiation
tat
8.2

0s

• Existential introduction
.24

5:0
91

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

49

9:4

Model.
30

[9]
30
01
02
2/2
GP

Q7) a) Explain with an example Goal Stack Planning (STRIPS algorithm). [5]
4/1

b) Explain with example, how planning is diffeent from problem solving.[5]

CE
81
.23

c) Explain AI components and AI architecture. [8]

16

OR
8.2
.24

[6180]-55 2
49
Q8) a) Explain Planning in non deterministic domain. [5]

8
23
b) Explain [5]

ic-
tat
i) Importance of planning.

0s
ii) Algorithm for classical planning .

5:0
02 91
c) What is AI Explain. Scope of AI in all walks of Life also explain Future

9:4
0
opportunities with AI. [8]

30
4/1 13
0
2/2

.23 GP
E
81

8
C

23
ic-
16

tat
8.2

0s
.24

5:0
91
49

9:4
30
30
01
02
2/2
GP
4/1
CE
81

8
23
.23

ic-
16

tat
8.2

0s
.24

5:0
91
49

9:4
30
30
01
02
2/2
GP
4/1
CE
81
.23
16
8.2
.24

[6180]-55 3
49