0% found this document useful (0 votes)
7 views3 pages

Nov Dec 2024

This document is an examination paper for a course on Artificial Intelligence and Data Science, consisting of 8 questions to be answered in 2.5 hours for a maximum of 70 marks. Candidates must choose four questions from specified pairs and are instructed to include diagrams and assume suitable data when necessary. Topics covered include game theory, constraint satisfaction problems, knowledge-based agents, inference in logic, and planning in AI.

Uploaded by

sumitdorle91
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
0% found this document useful (0 votes)
7 views3 pages

Nov Dec 2024

This document is an examination paper for a course on Artificial Intelligence and Data Science, consisting of 8 questions to be answered in 2.5 hours for a maximum of 70 marks. Candidates must choose four questions from specified pairs and are instructed to include diagrams and assume suitable data when necessary. Topics covered include game theory, constraint satisfaction problems, knowledge-based agents, inference in logic, and planning in AI.

Uploaded by

sumitdorle91
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/ 3

Total No. of Questions : 8] SEAT No.

7
23
PC-1735 [Total No. of Pages : 3

ic-
tat
[6353]-52

5s
3:3
T.E. (Artificial Intelligence and Data Science)

02 91
9:4
ARTIFICIAL INTELLIGENCE

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

Instructions to the candidates :


E
71

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

7
C

23
2) Figures to the right indicate full marks.

ic-
3) Neat diagrams must be drawn wherever necessary.
16

tat
4) Assume suitable data, if necessary.
8.2

5s
.24

3:3
91
49

9:4
Q1) a) Define Game theory,, Differentiate between stochastic and partial games
30
40

with examples. [8]


01
02

b) What is Constraint satisfaction problem, State Types of consistencies Solve


2/2

the following coloring problem using constraints satisfaction problem.


GP
7/1
CE
71

7
23
.23

ic-
16

tat
8.2

5s
.24

3:3
91
49

9:4
30
40
01
02
2/2
GP
7/1

Variables WA, NT, Q, NSW, V,SA, T [9]


CE
71

Domains Di = {red, green, blue}


.23

Constraints: adjacent regions must have different colors


16

e.g., WA  NT
8.2

P.T.O.
.24
49
OR

7
23
Q2) a) List All the strategies of problem solving. What is backtracking, explain

ic-
with n queen problem with Branch and Bound or Backtracking strategy.

tat
[9]

5s
b) How to make Optimal decision in Games, Explain Monte Carlo Tree

3:3
search algorithm with all steps and one example. [8]

02 91
9:4
0
40
Q3) a) Explain Knowledge based agent with Wumpus World. [9]
7/1 13
b) What is Knowledge Engineering, Explain in short semantic Network with
0
2/2
example? And Draw Semantic Network for below example [9]
.23 GP

Tom is Cat
E
71

Tom is Grey in Color

7
C

23
Tom is Mammal

ic-
Tom is owned by Sam
16

tat
8.2

OR

5s
.24

Q4) a) Explain inference in Propositional Logic Write the following sentences in


3:3
91
FOL (using types of quantifiers) (any 2) : [9]
49

9:4
30

i) No one has climbed every mountain in the Himalayas


40

ii) Someone has visited every country in the world except Libya
01
02

iii) Not all cars have carburetors


2/2
GP

iv) Some numbers are not real


7/1

b) i) Differentiate between Propositional logic and First Order Logic. Any


CE
71

7
23
4 points
.23

ic-
ii) Explain Syntax and Semantics of FOL
16

tat
[9]
8.2

5s
.24

3:3

Q5) a) Explain Forward Chaining and Backward Chaining.


91
49

9:4

“The law says that it is crime for an American to sell weapons to hostile
30
40

nations. The country Nono, an enemy of America, has some missiles,


01
02

and all of its missiles were sold to it by colonel West, who is American”
2/2

Now prove that West is a Criminal. With forward Chaining OR Backward


GP
7/1

Chaining. [9]
CE

b) Explain: Unification Algorithm in FOL


71

Solve stepwise with proper comments if p(x,g(x)) is equal to or not equal


.23

to p(z,y). [8]
16

OR
8.2
.24

[6353]-52 2
49
Q6) a) Explain FOL inference for following Quantifiers : [8]

7
23
• Universal Generalization

ic-
• Uhiversal Instantiation

tat
• Existential Instantiation

5s
3:3
• Existential introduction

02 91
9:4
b) Define and Explain Ontological Engineering indetails, with Definition

0
Categories and Objects Models. [9]

40
7/1 13
0
2/2
Q7) a) Explain : [5]
.23 GP

i) Classical planning
E
71

ii) Hierarchal planning

7
C

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

ic-
[5]
16

tat
8.2

5s
c) Explain AI components and AI architecture. [8]
.24

3:3
OR
91
49

9:4
Q8) a) Explain Planning in non-deterministic domain. [5]
30
40

b) Explain [8]
01
02

i) Importance of planning
2/2
GP

ii) Algorithm for classical planning


7/1

c) What is AI Explain Scope of AI in all walks of Life also explain Future


CE
71

7
opportunities with AI. [5]

23
.23

 ic-
16

tat
8.2

5s
.24

3:3
91
49

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

[6353]-52 3
49

You might also like