DEPARTMENT OF INFORMATION TECHNOLOGY

Madras lnstitute ofTechnology, Chromepet,Chennai 600 044

ITS701 -Artificial Intelligence
Regulation 2019
Course Outcomes
On Comppletion of the course, the students should be able to:
CO1: Understand the search teclhniques.
cO2: Apply the search techniques to real-time problems.
CO3: Apply the reasoning techniques to real-world problems.
CO4: Understand the representation of knowledge.
COS: Understand the learning techniques.
CO6: Apply Al techniques in devcloping real-world applications.
Assessment Test I Maximum Marks:50
7/8B.Tech -IT (Full time)
Date: 12/09/2023 Time : 12 hours
Part-A (5X2=10)

Marks CO Blooms
Q.No Questions Level

Define i)Artificial Intelligence 2 CO1 1

i)Agent
2
How state space representation is related to the problem solving? 2 CO1 2

List the criteria to measure the performance of search strategies. 2 CO1 1

3
2 CO1. 2
4 Give the initial state, goal test, successor function and the cost function for
missionary and cannibals problem.
Analyze and list the capabilities required for a computer to act humanly. CO1
5

Part-B (2X12-24)

Questions Marks CO Blooms

lQ.No Level
CO1 2
5
6 a.i. What are PEAS descriptors? Give PEAS descriptors for an automated taxi driver?
COi
a.ii. Define hill climbing search. What are the problems that occur in hill climbing
techniques? How can we avoid such problems? Illustrate with blocks world problem.

OR
CO1
6 b.í. Compareand Contrast goal-based agent and Utility-based agent
COi
b.ii. Consider the given instance of 8-puzzle.
2 3
4 6
75
Initial state
1 |2 3
4 |5 6
7 8
Goal state
Compare and contrast uninformed scarch strategies with respect to solving 8-puzzle
 problem.
one small
Consider the following path-finding problem (Fig 1) One can move from However, the 12 COI
triangle to another ifthey share avertex (e.g A can go to B and C).
the letter is the heuristic
goal Gcan only be accessed fromF. The number after follows:
function value for tlistate. The actualcost of cach move is as
Agan move down one level (c.g A->Cor B->E) costs l. costs 2
Afnove sideways on the same level (e.g C->B or E->F)
Amove up one level (e.g B->Aor C->A) costs 3. states,
Perform DFS starting from A, using path-checking to avoid repeatedExpand
if they occur on the path back to the root in the search tree.
successors in alphabetical order. Slhow your search tree and circle states
that are expanded. What is the cost of your solution path?
ii) Perforn A* search starting from A. Break ties alphabetically. Show the
expanded states and the priority queue contents at each step. What is the
7
cost of your solution path?

A2

B2 G0
D3 F1
E2

H3
Fig 1
OR
b.i. Explain the çonstraänt,satisfaction procedure to solve the crypt arithmetic problem. CO1 3

GADIS C3)
DANGERr) 2zl
b.ii. Discuss how aB prunihg technique helps to overcome the drawbacks of the Coi 2

Minimax search method

Part-C (1X16=16)

Q. CO
Blooms
Questions Level
No
COI
Solve the gíven problem. Describe the operators involved in it. Considera water jug problem:
8
You have given two jugs, a 4-gallon one and a 3-gallon one. Neither have any measuring
markers on it. There is a pump that can be used to fill the jugs with water. How can you get
exactly 2 gallons of water in to the 4-gallon jug? Explicit Assumptions: A jug can be filled
from apump, water can be poured out of a jug on to the ground, water can be poured from one
jug to another and that there are no other measuring devices available.

2
s9)s 3)
l6)2 o
 Anna University : MIT Campus : Department of Information Technology
ITS701 Artificial Intelligence
Assessment-1
Date: 26/09/2022 Duration: 90minutes
Class: 7th Sem. B.Tech. Maximum Marks: 50

PART A(5 X2 =10)

1. State the definitions for artificial inteclligence based on "'systems that act
2. Give the problem formulation for Tic-tac-toe'.
rationally".
3. What will happen if repcated states are not detected in search techniques?
4. Outline the requirements for good knowledge
5. State the issues of knowledge representation. representation.
PART B (2 X 13 =26)
6.a) Develop a PEAS description of the task environment and characterize the
environnment for the Part-picking robot. Also select a suitable agent structure to design.
OR
b) Reduce the problem using AO* algorithm for the following graph.

Start

(4)

(0) (0) (0
(6) (8) (2)

7.a) Consider the following semantic net. Derive the answer for the following using the
property inheritance algorithm.
Tom is a Mammal.
Owner (Tom) Roshan
Alsorepresent the given semantic net as frame.

Fur
has

Met
Mammal
Sat on isa

ike Dog Animal

Bono
instance
nstance

Caugnt
Tom
Cai
iS Coloured
is _owTod by
Brow Rashan

OR
b) Implement Alpha-Beta pruning with the following search trec.

B Mne

B 10 12 11

PART C (1 X 14 = 14)
8. Solve the following cryptarithmetic problem using constraint satisfaction problem.
Give the detailed procedure.
CROSS
ROADS

DANGER

***ALL THE BEST***

 DEPARTMENT OF INFORMATION TECHNOLOGY
Madras Institute of Technology, Chromepet, Chennai -600 044.
IT5701-Artificial Intelligence
Regulation 2019
Course Outcomes
On Completion ofthe course, the students should be able to:
COl: Understand the search techniques.
CO2: Apply the search techniques to real-time problems.
CO3: Apply the reasoning techniques to real-world problems.
CO4: Understand the representation of knowledge.
COS:Understand the learning techniques.
CO6: Apply Altechniques in developing real-world applications.
7/8 B.Tech -IT (Full time) Assessment Test II Maximum Marks:50
Date: 08/11/2023 Time: 112 hours
Part-A (7X2=14)

Marks CO Blooms
Q.No Questions
Level

1 Which of the following FOL statementstranslate to Everyone who studies at Anna 2 CO2 3
University is smart"? Give reason.
Vx(StudiesAt(x;Anna University))=>Smart(x))
Vx:(StudiesAt(x;Anna University)) ^Smart(x)
State the use of unification. 2 CO2 1
2
What is the significance in using the unification algorithm?

3
Differentiate between forward and backward chaining in reasoning process. 2 CO2 2

2 CO4 2
4 How planning is different from problem solving?
Ivese documet reguenoy
2 CO4 2
5 What does TF*IDF stand for? Explain its significance.
2 CO3 1
6 List the approaches for the representation of knowledge.
2 CO3 3
7 Represent the following information using Semantic Net
Ford is a type of car. Bob owns one car. Bob parks his car at home. His house is in
California, which is a state. Sacramento is the state capital of California. Cars drive
on the freeway, such as Route 10land Highway 81.
Part-B (2X12-24)

Marks CO Blooms
Q.No Questions
Level
CO4
DDerive aplan for the following instance. Initially, an agent is at home without book, 6
3

l6(a) without tea and without biscuits. Finally, it should have book, tea and biscuits. Use the
following predicates: At(), Have(y) and Sells(x,y) and actions as: Go(y) -Agent goes to
ty, causing At(y) to be true., Buy(z) - Agent buys 'z', causing Have(z) to be true.
UseSTRIPs to define actions andstates appropriately first with Preconditions and effects.
Then derive a step by step plan.
2
i) How is planning achieved through Graph plan? What are the advantages and6 CO4

disadvantages? Explain with an example.

 CO4 2
examplcs. What are the6
Natural Languape Processing with
6(b) i) Explain the phases of
applications?
CO4 33

i) Givenaq°ery athd three documents (osine imilurity

Query: ant dog
Dl:ant ant bee
D2:dog bee dog hog dog ant dog
D3:cat gnudog eel fox
Calculate the similarity of query to documents.
DConsider Wumpus World example with There (4,4) Grid. Using Resolution algorithm in 8 CO2
7(a) Propositional logic, Infer the following fact: is a pit in (3,1]".
44
14
23
24

3.3 4.3
V’ ' otor
L3

OK
2 3,2 42 A ’
3.1 4,1 CO3
1 21
A
B
P B’Beze
OK
OK

i)Discuss the issues in knowledge representation.

R
CO3 2
i)Explain Ontology as a knowledge representation technique. 6
76)
CO3 2
ii) Explain how knowledge can be represented using frames with an example. 6

Part-C (1X12=12)
Blooms
Q.
No
Ques
Mark
S
COLevel
tions
8 CO2
)Convert the following clauses to predicate logic and prove by resolution.
Every child loves Santa.
Everyone who loves Santa loves any reindeer.
Rudolph is a reindeer, and Rudolph has a red nose.
Anything which has a red nose is weird or is a clown.
No reindeer is a clown.
Scrooge does not love anything which is weird.
(Conclusion) Scrooge is not a child.
i) Write the argument below in symbolicform. If the argument is valid, prove it. If the A CO2 3
argument is not valid, give a counterexample:
IfIwatch football, then I don't do mathematics
IfIdo mathematics, then Iwatch hockey
-IfIdon'twatch hockey, thenIwatch football
 ONTROLLEN
CXAMI
AU 02
b os
CHENNAI
Roll No.
TVNO
600 025
(UNIVERSITY DEPARTMENTS)
9NO
ANNA UNIVERSITY
EXAMINATIONS, NOV/ DEC 2023
END SEMESTER
B.E. /B. Tech / B. Arch (Full Time) -
B.TECH IT
VIlSemester
IT5701 Artificial Intelligence
(Regulation 2019)
Max.Marks: 100
Time: 3hrs

behind intelligence mathematically

CO 1 To know the underlyingstructure
computational intelligence.
CO 2 To knowthe logical implications in
CO 3 To know the automated learning techniques representation.
To study the techniques of knowledge
intelligence techniques in real-time scenarios.
CO 4
CO5 To explore the adaption of artificial
BL - Bloom's Taxonomy Levels Analysing, L5 - Evaluating, L6 - Creating)
Applying, L4 -
(L1 - Remembering, L2 - Understanding, L3 -

PART- A(10 x 2 E 20 Marks)

(Answer all Questions)
Marks CO BL
Questions
Q. No 2 1
1 What is a rational agent?
partially observable 2 1 2
2 Give an example for fully observable and
environment with justifications.
2 2 2
Explain Horn clause with an example. 2 2 2
ol Give an example for tautology.
TT 5 Ontology is sophisticated knowledge representation
than taxonomy. Justify this statement.
technique 2

2
4

3
3

2
6 What is ensemble learning?
7 How is partial order planning different from total order planning.
2 3 3
4
Consider the english statement "went school Tom". Howwill the
2
sentence?
present day NLP algorithms detect the mistake in this
2
9 Differentiate learning by induction with that of deduction. 2 3
4
it? 5
In the recent times, deep fake is prevalent. How do we prevent
2
10

PART- B(5x 13 65 Marks)

(Restrict to a maximum of 2 subdivisions)

Questions Marks CO BL
Q. No
11 (a) () What are the different types of agent? Explain with an example. 6 3
(i) Consider the search problem represented in Figure below where 7 3
'a' is the start node and f is the goal node. Would you prefer DFS
or BFS for this problem? Why?
 6 3
OR
activities, give a PEAS description of
11(b) () For eachof the following
the task environment. Internet
Al books on the
a) Shopping for usedmatch
b)Playing a tennis 1 3
c) Stitching clothes
Romania.
(i) Consider the above map on
in km
Romaniawith step costs

366
Oradea Neaml
71/
60
87
247
Zerind 151 las 161
75
9
178
LER CF
red 140 77
Sibiu 99 Fagaras 151
b Vaslul 226 AU
CHENNÁI
118 80
Rimnicu Vilcoa
142
244
241
234
MINA
11tn LUg) g7 PiBestl
211

98 Hirsova
380

193
OS
70 B5
146 107 Urziconi 253
Mehadia 86
32
75 A38 Buchardest 80
120 199
Dobrela t
Cralova
/90 Eforle
374
Glurglu

Bucharest and give the

Apply A* algorithm from Lugoj to terms of time and space
performance of this algorithm in
conditions.
complexity, completeness and optimal A,B,C,D. How many 6 2 3
four propositions
12 (a) () Consider a vocabulary with
following semantics.
models are there for the
a) BA C
b) ¬A v ¬BV ¬C v ¬D Prove 7 2 3
(i) Consider the followingset of sentences in logical form.
¬AA Bby resolution.
Sl: Ae(BVE)
S2: E+D
S3: CAF¬B
S4: E’B
S5: BF
S6: B+C
OR
3
12(b) (i) Explain the unification algorithm with an example. 6 2
(i) With an example, explain the forward and backward chaining of 7 2
inference process in First Order Logic.
3 2
13 (a) (0) How is knowledge represented through Semantic networks and
Frames. Explain with an example.
()|Inthe recent technological breakthroughs, there are possibilities 5 5 4
that Al techniques can be misused, How do we prevent that?
Comment on how ethics in Al can be incorporated.
OR
2
13 (b)() How is inference carrled out through Ontology? Give an example
and explain.
(1) What is Generative Al. Have youused any application that is 4
5 5
developed with Generative Al, What are the advantages and
disadvantages.

|2)
 3 3
14(a) ()) Consider the problem of using a robotic arm with gripper to move
state shown below on the left
two blocks, A and B, from the initial
to the final one shown on the right:

13 A

Represent the problem using STRIPS and solve it using any

planning
algorithm. 5 3 3
(0)Mention any six applications of NLP in the recent times
OR
8 3 3
14 (b) ()) With an example explain the plan generated using graph-plan
algorithm. What are the advantages?
3 3
With an application of your choice, explain how Statistics help in
5
(
NLP. 3
6 5
15 (a) () For an example of your choice, explain how a hypothesis can be
generated using a decision tree.
(i) Mention the different types of chatbots with an example.
7 5 3
OR
5 3
15 (b) () With an example, explain correct hypothesis, false positive and 6

false negative terminologies. How are these useful in learning? 7 5 3

(i) How willyou build a chatbot for a specific application?

(Pro)
ONAL
TNI
AU
CHENNAI
CO0 025
SNO