0% found this document useful (0 votes)
257 views23 pages

Artificial Intelligenec All PYQP

This document is a question paper for an Artificial Intelligence exam containing 8 questions. It provides instructions for candidates taking the exam and asks questions about topics like game trees, unification, conceptual graphs, non-monotonic reasoning, and more.

Uploaded by

54Mahak Bansal
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)
257 views23 pages

Artificial Intelligenec All PYQP

This document is a question paper for an Artificial Intelligence exam containing 8 questions. It provides instructions for candidates taking the exam and asks questions about topics like game trees, unification, conceptual graphs, non-monotonic reasoning, and more.

Uploaded by

54Mahak Bansal
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/ 23

[This question paper contains 7 printed pages.

]
1108
Your Roll No.03357000t

( In the following two-ply game tree, the terminal


Sr. No. of Question Paper: 1108 A
nodes show the utility values computed by the
Unique Paper Code 32341601
utility function. Use the Minimax algorithm to
Name of the :BHCS13: Artificial Intelligence compute the utility values for other nodes in the
Paper
given game tree. (2)
Name of the Course B.Sc. (H) Computer Science

Semesteer VI MAX

Duration: 3 Hours Maximum Marks : 75


MIN

Instructions for Candidates


1. Write your Roll No. on the top immediately on receipt
5) (2) (-1) (3 (T (-3) (1
of this question paper.

2. Question 1 is compulsory.

3. Attempt any four questions


from Question 2 to Find whetherthe following set is unifiable or not.

Question 8.
If unifiable, find the most general unifier(m.g.u.).

Parts of question must be answered together.


4. a
w {PARENTS(x, FATHER(x), MOTHER(bill)),
PARENTS(bill, FATHER(bill), y)} (2)
following terms (4)
1. (a) Describe the o ( Express the following sentence as conceptual
DIG) Heuristic Function dependency structure:

Q i ) Software Agent "Sohan gave Tina a box of chocolate" (2)


a context free grammar that can accept the
Write
sentence: "Ram hit the ball". (3) Write the conceptual graph and FOPL
P.T.O representation for the following sentence
1108 3 1108
11
Every motorbike has a handle" (4) (3)
O3 What is non-monotonic reasoning? Give
(ph) an

(g) Consider that append(L1,L2,L3) is function in


No a
example. (3)
Prolog, in which list LI is contacted with L2 and
the result is stored in L3. What would bé the (n) Rrove that if A and B are independent events,
output of the following statement in Prolog? FAB) =
P(A). (Note that A and B are

independent if and only if P(A & B) = P(A)P(B).


- append([2,3,4],L,[2,3,4,a,b] (2)
(3)
) 1Find the mcaning of the statement
a ) Differentiate between partially observable and fully
(-PVQ) & R > SV (-R & Q) observable task environment of an agent. Give an

example of each.
R is
(5)
for the interpretation: P is true, Q is false,
true, S is true. (2) (b) Create a frame network for terrestrial
motor
vehicles (cars, trucks,
motorcycles) and given onee
Og) fransform the following sentence into disjunctive complete frame in detail for cars which includes
normal form: the slots for the main
component parts, their
attributes, and relations between
(P V *Q) & (R>S) (3) parts. (5)

Determine whether the following sentence is (a) What is closed world


Qk) assumption? Give an

satisfiable, contradictory or valid: example.


(3)
sP o) P) (2) B)befine Modus ponens rule.
Elaborate using an
example.
should the heuristic function of A* algorithm (3)
(1) Why
always underestimate? Give reason, example.
110

1108
1108 Recursive T r a n s i t i o n
Network (RTN)?
What is a
(b) (4)
formula Give an example.
8 c) diven S, and S, below, show that Qa) is
a logical consequence of the two.
Give two limitations of propositional
logic. (2)
(c)
S: (Vx(P(x) -> Q(x)) and S,: P(a) (4)
axioms
a ) Consider the following
a ) Crcnte n script for shopping in a supermarket. January
(5)
Clouds

(6) Joint

aproduct
probability P(xj, Xqy..
of chain conditional
, Xx,) by inspecction
probabilitics is
:as Cold & Preciptation >

January > Cold


Snow
(
x,) P(x,|x,). P(x,lx,). P(x, |
=
x2 Clouds Precipitation
P(x, X2
x). P(x4 Ix, xz) P(x,) . P(x2 1x,) P(x,
.
.

Convert them into clausal form and prove the truth


of "Snow" using resolution. (5)
Draw the Bayesian belief nctwork for the samc.

(5)
Q (b) Develop a parse tree for the sentence "The cruel
of man locked the dog in the house"
Writc a program in Prolog to compute the sum
using the
(a) following rules.
clements of a list. (5)
/s NP VP
beta cutoffs? How alpha-beta NP N
Q23
(b) What are alpha and
of
to improve the efliciency
pruning is used NP DET N
(5)
Minimax procedure? VP V NP

VP V PP
2 Best-first search and Hill
(a) Compare and contrast
VP V NP PP
scarch. You can use cxample. (4)
Climbing PP PREP NP
P.T.O.
1
1108

DET ART ADJ


RTN)?
(4) DET ART

house
(2) N man
| dog |
Vlocked
ARTthe | a

ADJ cruel

PREP in (5)

following crypt arithmetic problem using


(a) Solve the
constraint satisfaction.

ODD
truth
+ODD
(5)

ruel EVEN
the (4)

Climbing Methods.
Q(b) Describe the limitations of Hill
(3)

0 3 1 D e f i n e the PEAS for vacuum cleaner agent.


(c) Define
(3)
h i s question paper contains 6 printcd pages.) 2211 2
Your Roll No... .

(cHow FOPL is better than Propositional logicC


Sr. No. of 1C (2)
Question Paper: 2211
Unique Paper Code :32341601
ta) Describe the following terms:
Name of the Paper Artificial Intelligence ) Rationality
B.Sc. (H) Computer Science
Name of the Course (ii) Software Agent (4)
Semester : VI
t e ) Give the architecture of a problem solver with a

Duration : 3 Hours Maximum Marks: 75 Truth Maintenance System. (3)

Instructions for Candidates () Write a Prolog program to calculate the length of

1. Write your Roll No. on the top immediately on receipt


a given list, L. (4)
of this question paper.

2. Section A is compulsory.
Sg) Describe the limitations of Hill climbing search.
(3)
3 Attempt any 4 of questions from Section B.
h) Define the PEAS for taxi Driver Agent. (3)
4 Parts of a question must be answered together.
) Define Heuristic Search technique. What is the
role of a heuristic function? (4)
SECTION A
oul ) Find whether the following set is unifiable or not?
If unifiable, find general unifier (m.g.u.).
most
(a) What is a Horn clause? Give an example. (2)
S(x, Ram), S(y, Sita)} (2)
b ) In the following expression, add parenthesis at
appropriate places (as per operators precedence). QU k) Give the conceptual dependency representation for
the following:
P &QV- R & S » T VX >Y (2)
Ram gave Sita for a pencil.
P.T.O. (2)

Scanned with C'amScanner Scanned with CamScanner


2211 3 2211
Develop for the sentence "Raja slept
Q a parse tree
on the sofa" using the following rules: (4) 3(a) Write a script for watching a movie in a cincma
hall (5)
S NP VP

NP N | DET N A) Find the probability of the event A when it is


B occurred. From
VP V I PP known that some event

PP PREP NP experiments, it has been determined that P(B]A)


= 0.84, P(A) = 0.2, and P(B) = 0.34. (3)
N R a j a | sofa

V slept ) Determine if the


contradictory or valid.
following sentence S is satisfiable,

DET the

PREP on S: P Q P (2)

SECTION B (a) Solve the crypt arithmetic problem:

TWO
and list their
utility based agents
Define
2 (a) (5) +TWO
benefits.

of an
FOUR (4)
Elaborate on the additional capabilities
b) (ATN as compared
Transition Network the following sentence into CNF:
Augmented
Network (RTN). (2) b) Transform
to a Recursive Transition

(-A & B) V (A & ~B) & C (3)


associative network
for the following
cc) Draw an
with
Consider the following game
tree ply depth
sentence
ASc)
the indicated scores are from the MAX
and tai. 2, in which
Yellow bird that has wings of vicw. What should MAX
Tweety is a
(3) player's point
move

choose, and why? (3)


P.T.O.

Scanned with CamScanner Scanned with CamScanner


2211 2211 6

(a) Write the joint distribution of x,, X2 Xg, Xg. Xg, and

MAX Ply a product ofthe chain conditional probabilities


xas
for the following causal network (3)
MIN Ply

2 4

(4) (7) (6) (5) (3) (8) (-2) (5)


Q
(b) What do you understand by alpha-beta cutoffs.
(a) What do you understand by default reasoning in Describe the method of alpha-beta pruning using
these cuto ffs with the help of an example. (4)
knowledge representation? (2)
should the heuristic function of A*
S ) How a problem is solved using Mean-Ends SO (c) Explain, why
underestimate? (3)
Analysis. Explain in your own words. (2)

c ) Given the following information for a database: Qla) What is the use
of "cut" utility in Prolog? (2)
Describe Water-Jug problem and give its suitable
Al. If x is on top of y, y supports x. Ob)
state space representation. (4)
A2. If x is above y and they are touching each
(I (c) Based on the context free grammar represented
other, x is on top of y.
by the following parse tree, draw the corresponding
A3. A cup is above a book. Recursive Transition Network (RTN). (4)
A4. A cup is touching a book.

NP VP
i) Translate the statements Al through A4
into clausal form. DET ADI
NP PP
the sly robot moved DET ADJ N PREP NP
(ii) Show that the predicate supports (book,
dhe red DOX to DET AOJ N
cup) is true using resolution. (6)
the red table
P.T.O.
(1400)

Scanned with CamScanner


Scanned with CamScann
2) 1491
This question paper contains 4 printed pages]
g) Explain utility function measure for an agent.
Roll Na. |1N Discuss special cases of hill climbing: Local Maximum, Plateau and Ridge.
S. No. of Question Paper 1491
Express the following sentences as conceptual dependency structures 6
Unique Paper Code : 2341701 F-7
86
( Bill is a programmer
Name of the Paper :ArtificialIntelligence (i) Joe gave Sue a flower.
Name of the Course B.Tech. Computer Science 3
What are the main differences between scripts and frame structure ?
SenesterT VII room, where some bananas are suspended from 8-feet
Q A
A3»
3-feet tall monkey is in a

Duration:3 Hours Maximum Marks: 75 high ceiling. The room contains two stackable, movable and climbable 3-feet high
crates. Give the initial state, goal state, successor function and cost function for getting
(Write your Roll No. on the top immediately on receipt of this question poper)
the bananas.
Question No: 1 is compulsory.
Let h denote the estimate of h (the actual cost of traversing from the current node to
Attempt any four from Question Nos., 2 to 7. afinal state node). Explain in what way the efficiency of A* algorithm and reaching of

Parts of a question must be answered together. a goal state is affected if

2 (a) Define an Agent, Agent Function and an Agent Program.


() h' always underestimates h.

(6) Differentiate between knowledge-based systems and expert systems. ( always overestimates h.
Consider a state space where the start space is number 1, and the successor function
Why is state space representation important ? 2
for a state n retums two states numbered 2n and 2n +1: 4

nl ls minimax procedure Depth-first or Breadth-first ? Justify your answer.

() Draw the portion of state space for states 1 to 15.

Te) Is the following set unifiable ? If yes, obtain a most general unifier for it
06 () Suppose the goal state is 1. List the order in which nodes will be visited for
W {P(A, B, B), Px, y, z)}
breadth- first search.

&66 Obtain Skolem standard form for the following: a) Explain Cut, Fail and Cut-fail statements in PROLOG. 6

E-3x(p&) of./®) 6Write a PROLOG program to find GCD oftwo numbers.


P.T.O. 0
3 1491 4) 1491
Explain Turing Test approach to Al. How is Turing Test Consider the following block world problem and solve it using goal stack planning:,5
approach different from Rational
Agent approach ?
Goal:
Develop PEAS description of the task environment for- Internet book-shopping
Start:
A
B
agent

eUsing constraint satisfaction algorithm, solve the following crypt arthmetic problem : 6
ON(C, A) ON(B, C) and ON(A, B)
OD1D
et Consider the following piece of knowledge: 6
+O DD Some patients like all doctors.

E VEN No patient like any quack.


A game tree is as follows
A ( Represent this knowledge as predicate statements.
(i) Prove the query "no doctor is a quack" is corect, using resolution method.

Derive a parse tree for the sentence "Mary slept on the chair" using the following
rules

S NP VP

NP N

(3 (5) (4)
NP DET N
VP V PP
M
PP PERT NP
(6) (7) (8)
N Mary/Chair
L
V Slept
() (7
DET> the
which nodes would not be examined using alpha-beta pruning procedure ? Write a
PERP on
sepwise explanation.

Q)Discus the differences and similarities between problem solving and planning 5

P.T.O. 1491
2,500
This question paper contains 5printed pages.] 2. (a) Find the errors in the following LIS7 statements
and give the
1807 Your Roll No. .**************
outpyt in case there is o eror.
6)>(listp fa)
B.Sc. (H) Computer Science/VI Sem. A
i)->(lesh 67293)
Gii) -(a6pend 'a (e e))
Paper -605 (i): ARTIFICIAL INTELLIGENCE
(Admissions of 2001 and onwards) ()Write an itcrativy/sunction in LI name SUM-
Time: 3 Hours Maximum Marks: 75
ALL using 'd statement thaytakes an integer
N as
argumpnt and retums the sum of the integers
(Write your Roll No. on the top immediately from I toAN. 4
on
receipt of this question paper) Prove that if A and B are two independent events
Attempt all questions.
086
then P(A) (B) =
P(A). 3
All parts ofa question must be answered iogether
3. Detemine whether each of the following sentence
a) What do you understand by heuristic search? How is 4
heuristics search is used in Al problem solving.
)Satisfiable
3
i) Contradictory
) Give an example where Best First search is better
(iii) Valid
than Breadth search. 4

c)Why is it importag that an expes system be able S1:P>Q>-P


to explain the yhy and how qyésions rclated to a s2: (p&q)V-(P&)

problem solhg session? $3:(PVa (P&Q)


What is unsupewised learnihg? Describe how S4: pVg&pV-Q&P
supervised ledrning can be used for pattern
recognition 4

(P.T.O 1807
) Comment on the following statements giving Given the joint distribution of x, X2 Xg,
Xg Xs
justifications for your answers: 3+3 and x as a product of the chain conditional
) A always guarantee an optimal solution for probabilities as:
a minimization problem.

i) AO° algorithm ensures that it does not get P&)pC«z|x) plx,)plx,)


stuck into an infinite loop while generating Provide the causal network to represent the above
successors in a graph. joint distribution.

Q 8 1 (a) Solve the given crypt-arithmetic problem using8


04 Transform the following sentences
into eonceptual
constraint satisfaction. graph: 2+2

TWO i) Sam gave Mary a box of candy.


+TWO (ii) Charlie drove the pickup fast.
FOUR Create a movie script using the script syntax. The
Qs script must be named and specify the track, roles,
Vo) Explain any two situations where a Hill climbing
entry conditions, props, different scenes and the
algorithm may fail to find a solution. How can we

5 results. The script should describe the scenes for


deal with these situations?
movie ticket purchase and entry of the buyer in the
(a) following formula to clausal form:
Transform the movie halI.
91 vvy(a z P(%, 2) &PÖ%, 2)) 3 uQ(x, y, u)
3 (a) Consider the followihg assertions written in Modal
(b) Translate the following sentences into clausal form logic for the givenknowledge base 4
Q 2
and use resolution technique to draw the required S1:(Samisa mpn)
inference. $2: M(Samisachild)
Si: Some paticnts like all doctors.
s2: No patient likes any quack.
$3:LISam/s a child)-L- (Samisachild))
$4:L(Sayh is a man) (Sam is a child))
Conclusion: Therefore, no doctor is a quack.

[P.T.O. 1807 4
1807
Use Modal logic axioms and provethat:(Sam is
a child).
Given the following parse tree, write down the
. 0 9 6

corresponding context free grammar. 2+4

NP
DET ADJ N
the silly robot moved
DET AbJ PREP

the red pyramid DET ADJ N

to the big table

Also draw an Augmented Transition Network to

implement the grammar for the parse tree.

1807 700
2 1959
This quston paper coniains 4-2 printed pages)

Fpress the seniences given beiow inte conceptua


'ur Roll No. ..
**

Jenendenc slruclure
1959

Sushil ate soup with a


spou
B.Sc. (Hons.) Computer Scicnce/Vi Sem. C

Rita gave Sita a bunch of Nowers.


Paper 605 (i-ARTIFICIAL INTELLIGENCE

Admissions of 2001 1o 2010) (u) W'rle the outpui of the 6llow ing LISP statements

Time: 3 Hours Marimum Murks: 75s cadadr (a tb y d)

l rne your Rall Vo on the top immedately on receipt of this question paper.)
( reverse (afb c (d)) e 1)

All questions in Section A are compulsory.


(ii) membyt 'c '(a (b (e))d e)

Attempt any Jour questions in Section B.

(i) (lesp 22 44 179 20)

Section A

Transfonn the following into CNF:


(a) When do you call a machine inielligent ? Name the

criteria used for determining whether a machine is inte ( Pv(- P & Q & R)

igenisr not ? I+2 i)(P & Q) v (P & - 0) & S

(b) Explain the physical mbol system hypothesis ? 3


Draw a pictorial definition for the linguistic variable AGE
Q160

first search and Best first search with


Diferentiate Depth giving your own subjective values for AGE variables and

the help of an example.


their values. 3
P.T.O.
3 1959 1959

e a reeursive 1.IsP e i i o n to ind the mh ierm of


Write a script for yoing lo a movie.

honacel is to be passed
erjs. where te number »

Describe the admissibility condition for the A° alyorithm.


as arr riunent to a luncton.
QO6

optimal solution?
In what situations A will give an
(6 Ciive the cons-cell representyton of the sollowing

Ciive appropriate exan1ples. 212-2


Ist 6

4+3
a (b Ic) 1ge) N g h) i g)) Consider the follow ing axioms

Section B
() Every boy or girl is a cliild.

910
Describe the various problems associated with Hill
child geis doll train or a lump of
(ii) Every a or a

climbing method and explain them. 6


CUal

(b Write a sbor note on Neuraetwork Architecture. 4

(iii) No body gets any doll.


How many types of norn-deductive inference are there ?
Q10
Explain (/) No child who is yood gets any lump of coal.

Give an example of non-monotonic reasoning and describe


8 1 0 3
M Conclusion) 1f no child gets a train, then no boy

it also. 3
good.

9104
Develop a parse tree
for the sentence"Raja slept on the
Prove that given conclusion using resolution
sofa". 3

P.T.O techniquc.
6 1959
5 1959

A rile shorn notes on the lollowing


9
Deline the sentences Si. $2 and S3. SI -
P. $2 =Q and
ol ninfomed Search
$3 P 0 . Determine the probabilistic truh values of

leuristic Search

SI. S2 and S3 when in is known that probabilities of the


Mean End Analy sis

possible words are given by


Resolution Principle.

PW) 1:4. P(W2) - 18.

P(W3) 18 and P(W4) = 12.

Define a production system. What type of production


Q r 0

system is appropriate for designing a chemical synthesis

problem and why ? 2+3

Transfomm the following into dausal fonn

2x Vy(Vz P(f{x). y, z))> Bu QMx, u) & 3v R(y, v)).

P.T.O. 195
6515

SECTION A

IThis qucstion paper contains 8 printed pagcs| 1. (a) Describe the following
Your Rol No. Q Agent Function

Si. No. of Q. Paper : 6515 HC Ole closed World Assumption


rules
Code :32341601 Q
InIn what type of reasoning existing
Unique Paper whether a rule
can be retracted ? Explain,
B.Sc.(Hons.) Computer can be retracted in FOPL. 2
Namc of the Course :

actual
Science
Q Let h'
Let denote the estimate of h (the
Artificial Intelligence
cost getting from the current node to a
of
Name of the Paper
final state node). Explain in what way the

Semester : V1 efficiency of A* algorithm and reaching


of a goal state is affected if h' always
Maximum Marks : 75
Time: 3 Hours overestimates h. 2

Instructions for Candidates: Differentiate between breadth first search


O T l Difer
and best first search. 3
Write your Roll No. on the top immediately
(a)
of Cut and Fail predicates in
on receipt of this question paper.
12
20) Explain uses

PROLOG. 3
Section A is compulsory.
(b)
four of questions from Section
9 Find the meaning of the statement
(c) Attempt any Q120
B. (PVQ) & R»SV(RVQ) 2
must be answerd for the following interpretation : P is true,
Parts of a question
(d)
together. Q is true, R is false, S is true.

P.T.O. 2

Scanned by CamScanner
Scanned by CamScanner
6515
6515

Transform 9 lk)
2 Differentiate between a fully observable and
Q12 the
following senlence into
partially observable environmcnt.
disjunctive normal form: 2
4
(PV Q) && (R S) G i v e an example of each of the four types
/)
1 2 3
Consider the following
game tree with
depth 2, in which the indicated scores ply
are 0, 1,2 and 3 for Chomsky's hierarchy of
4
from the MIN player's grammers.
point of view. What
move should MIN
choose, and why ?
3 SECTION B

Write a PROLOG program to reverse a list.


MIN Ply.

of Learning Agent.
I21) Describe the working
a
MAX Ply. 3

Prove that if events A and B are


12oc)
130 independent, P (B|A) = P(B). 3
(-2) (3) (4) (3) (5) (-1) (3
13 (a)
4 Using constraint satisfaction algorithm,
solve the following crypt arithmetic
Express
0124
the following sentences as
problem.
conceptual dependency structures 4

(i) Bill is a programmer


ODD
(ii) Joe gave Sue a flower.
Determine whether set is unifiable ? If ycs,
012 ODD
obtain a most general unilier. 2
EVEN
W-(PA,B,B), Px,y,z}}
3 P.T.O.
4

Scanned by CamScanner Scanned by CamScanner


6515 6515

value of a MAX
2 Discuss, bascd on the alpha 135 Ic)What should be the features of a good
1 3 3

player and beta valuc of a MIN playcr,


when the search is discontinucd in
the performance for a rational agent ?
MINIMAX procedure using alpha-bcta 3

pruning. Explain, using a n example. Based on the following statements


5 o 3 .

parse tree for the


sentence
Derive a
3 i. Whoever can read is literate
133
"Mary slept on the chair" ii. Dolphins are not literate
rules
Using the following ii. Some dolphins are intelligent also.
SNP VP
NP N iv. Donald is a dolphin.
NP DET N "somc
VP VPP Using resolution to prove that
PP PREP NP intelligent beings cannot read".
N Mary / Chair Evaluate truth value of expression
V Slept E =3X(P(S(x))AQ(x,f(a))
DET the With given domain D =
(1,2); assignment for
PREP on a-1; assignment for fare: f (1) =2,
Joint probability P(x,,X2., x by
f (2) 1.
Q3 inspection as a product of chain conditional
probabilities is:
Write the conceptual graph and FOPL
( P(x, ]xg.X P(x, Ix,x)
&13
a)
Px,X2.., X
=

P{x, |x,) P(x, lx,) Px,))


representation for the following
Px,1x) Plx, I x,) the sentence: 4
Draw the causal network for
same.

4 "Every cycle has pedals".

P.T.O.

Scanned by CamScanner
Scanned by CamScanner
6515
6515

b)Express the following concepls as an


Yc) You are given two
jugs of capacity 4-gallon
associative network structure wilh
and 3-gallon respectively. Neither has any
interconnected nodcs and labeled arcs.
measuring marker on it. There is a pump
Company ABC is a softwarc development that can be used to ill the jugs with water
company. Three departments within the How can you get exactly 2 gallons of water
company are Sales, Administration and into the
4-gallon jug? Write down solution
Programming. Joe is the manager of by showing all intermediate states.
Programming. Bill and Sue arc
3
programmers. Sue is marricd to Sam. Sam
is editor for Prentice Hall.
They have threc
children, and they live on Dlm street. Suc
wears glasses and is fivc feet four inches .

tall 6

M7da)
Y OWhat are the similarities and differences
between Conceptual Graph (CG) and
Conceptual Dependency (CD)
representation structures? 4

XA) Explain the difference bctween a Recursive


Transition Network and Augmented
Transition Network. 3

7 P.T.O. 1300

Scanned by CamScanner Scanned by CamScanner


[This question paper contains 4 printed pages.) G09 2

(e) Define a rational agent. What do you understand


by agent autonomy
Sr. No. of Question Paper : 6094 D Your Roll No...
(4)
Unique Paper Code : 234607 )Transform the sentence (PQ)-> R into conjunctive normal form.

Name of the Coursc :B.Sc. (H) Computer Science GDitlerentiatc between monotonic reasoning and non-monotonic reasong
(4)
Name of the Paper :Artificial Intelligence (CSHT-616) (ii)
Kepresent the sentence "Ram gave a book to Sohan" using Conceptua
SemeslcT VI Dependency structure. (3)

Duration :3 Hours Maximum Marks: 75 Develop a parse tree for the sentence: Jack slept on the table: using the
following rules.
Instructions for Candidates
S NP VP
W r i t e your RolI No. on the 1op immediately on receipt ofthis question paper.
NP N | DET N
Question No. 1 is compulsory.

Altempt any 4 of Question Nos. 2 to 1. VP VI PP

4. Parts of a question must be answercd together. PP PREP NP

jack | Lable
Q143Detcrmine the ncxt node which will be expanded next in Figure below using
Best First Search. (3) slcpt

DET the

A (0+20)
PREP (4)

c(1+12) B (1+15) Describe how alpha-beta pruning improves the searching procedure in a

MIN-MAX game. (4)


D[2415) (E(2+17)
a) What do you understand by underestimation and overestimation of a heuristic
function ? Under what condition A' gives optimal solution. (6)
Discuss the scope and limitations of knowledge representation using
Propositional Logic. (4) What are the limitations of Hill Climbing search.

Prove that i f e v e n t s A and B are independent, P(A|B) = P(A).


(3)
Oscar clephants. We know the following facts about
) Sam, Clyde and are

if the following sentence S is satisfiable, contradictory or valid.


ODetermine them
S: (P &Q) > RV (3)

P.T.O Scanned by CamScanner


Scanned by CamScanner
6094 6094, 4

Al: Sam Transform the sentence: (P & Q) & (P VQ) into disjunctive normal
is pink.
Jom. (3)
A2:Clydc is gray and likes Oscar.
A3: Oscar is cither pink or gray (hut not hoth)..end thes be Which one among Best First Scarch or A* is better to search an optimal
path to a node, and why? (4)
) Translate statcments Al to A3 into clausal form. (3)
() Use resolution to prove that "A gray clephant likes a pink Describe, how a sentence is represented using Case Grammar. (3)
clephant". (4)

Describe the properties of Chomsky's type 2 grammat (3)


QIS

Write the Conceptual Graph and FOPL represcntation for the following
Q I S 4

sentcnce

Every bank has a locker" (4)

Given formulas S, and S, below, show that Q(a) is al logical conscquence


of the two.
S1: (Vx((P(x) > (Q(x)) $2: P(a) (4)

Define a well formed formula (wf). (2)

( Differentiate between Dcterministic and Stochastic task environments. Give


Q16 cxample. (5)

Joint probability P(x, X,.. X,) by inspection as a product of chain conditional


probabilities is

P(x,x )
=
P(x,lx, x,) P(x,/a, x,) Pxx, x,. x,) P(s,) P(x,s,) POs,Js,) P(»,k,) P(s,)

Draw the causal inetwork lor the


satne. 5)

for lerrestrial motor vehicles (cars, trucks,


Creale a frame network
which include
notorcycles) and give one complete frane in details lor cars

und relatios betweem


the slots for the main compoIent parts, their aributes,
(5)
parls.
? Explaiu, wilh an cxample. (5)
Q163, What is a Recursive Transition Network

(1 200)
Scanned by CamScanner Scanned by CamScanner
859
IThis question paper contains 4 printed pugCK.
Define in your words
Sr. No. of Question Paper : 859 Your Roll No....9!.S2.700 2o O14

Unique Paper Code :234607 Artificial Intelligence


Name of the Coursc :B.Se. ( ) (i) Agent
Computer Scicuce
Name of the Paper :Arnificial Intclligcnce (CSHT-616) i) qi) Rationality (3)
Semester VI What are the similarities and differences between Conceptual Graph (CG)
and Conceptual Dependency (CD) representation structures ? (5)
Duration :3 Hours Maximum Marks: 75
Write a context free grammar that can accept the sentence: "Ram hit the

Instructions for Candidates bal. (3)


1. Write your Roll No. the top
on
immedialcly on rcccipt of this question papcr. Which searching technique among Breadth First Search and Hill Climbing
2. Question No. I (onc) is compulsory. search is more intelligent, and why ? (3)
3. Attempt any 4 of questions Nos. 2 1o 7.
Elaborate on the additional capabilities of an Augmented Transition Network
4. Parts of a question must be answercd logcther. (ATN) as compared to a Recursive Transition Network (RTN). (4)

Compare and contrast propositional and predicate logic. (4)

Consider the
a) following
game tree with ply depth 2, in which the indicated
Find the probability of the event A when it is known that some event
scores are from the MAX player's point of view. What move should MAX
B occurred. From experiments it has been determined that P(BIA) = 0.84,
choose, and why? (3)
P(A) = 0 . 2 , a n d P(B) - 0.34.
(4)
MAX Ply
6) Create a script for going to a movie. (6)
MIN Ply

Define utility based agents and list their benefits. (5)

Define alpha and beta cutoffs. Explain how these are used in minimizing
(7) (6) (5) (5) (8) (2) (5) search space in MINIMAX procedure? (5)
(4
Define Heuristic Search technique. What is the role of a hcuristic
Consider the following Prolog Program and answer (a) & (b):
function (4) 13

Transform the sentence: (P V(P & Q & S )) into conjunctive normal invented(edison,lightbulb).
Q 1 6 4 form. (3) inveated(colmeraurer,prolog).

(1+2)
iq(einstein,210).
Q 1 4
What is non-monotonic reasoning ? Explain with a
suitable example. iq(edison,l60).
P.T.O.

Scanned by CamScanner Scanned by CamScanner


859
q(waldorf,90). into disjunctive normal form
Transform the following sentcnce

genius(Person):-
(P V 9 ) & (R S) (3)
iq(Person,I1).
should the heuristic function in A* should always underestimatce?
1Q> 150. Explain, why
(4)
genius(Person):
invented(Person,_). Aner a coin is tossed, consider the following statements and their equivalent
For the query ?-genius(A), what is the first answer that Prolog will symbolic fom in propositional calculus

return? (2)
Statement Symbolic Form
-

Define a predicate "smart_invention'" (given as under) which retuns inventions


It comes either Head or Tail HVT
that are invented by people with an 1Q of 160 or more.
If it is Heads, I win H> IW
Smart_invention(Invention):-
(3) TY L
If it is Tails, you lose
61 What do you understand by Closed Word Asumption in knowledge
representation ? (2)
If you lose, I win YL IWW

Based on the above information

0185Represent the sentence "John went from Delhi to Shimla" using Conceptual 0 Conver these statements into clausal form, and 2)
Dependency structure (3)
(i) Using resolution prove that I win. (4)

Give one example for each of 0, 1, 2 and 3 type of Grammars by Based on the context free grammar represented by the following parse tree,
Chomsky. 4) 1 draw the coresponding Recursive Transition Network (RTN). (4)

Write a short note on the following:

Default Reasoning (3)


NP
P
) Abductive Inference (3)
DET AD NP

Find the meaning of the statement the SHy robot moved DET AD PREP NP
(PV) & R SVCR V Q)
box ADJ
is true, Q is true, R is false, S is
for the following interpretation: P the red table
(3)
true.

PTO.
(300)

Scanned by CamScanner Scanned by CamScanner

You might also like