0 ratings0% found this document useful (0 votes) 507 views4 pagesAI Past Years DU
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content,
claim it here.
Available Formats
Download as PDF or read online on Scribd
This question paper contains 4 printed pages]
Roll No. LI
S.No. of Question Paper : 1491
Unique Paper Code : 2341701 ET
‘Name of the Paper : Artificial Intelligence
Name of the Course : B.Tech. Computer Science
Semester : Vil
Duration :3 Hours Maximum Marks : 75
(Write your Roll No. on the top immediately on receipt of this question paper.)
Question No. 1 is compulsory.
Attempt any four from Question Nos..2 to 7.
Parts of a question must be answered together.
1. @_ Define an Agent, Agent Function and an Agent Program. 3
(6) Differentiate between knowledge-based systems and expert systems. 4
(©) Why is state space representation important ? 2
(@ Is minimax procedure Depth-first or Breadth-first ? Justify your answer. 2
(&) Is the following set unifable ? If yes, obtain a most general unifier for it : 3
W = (P(A, B, B), P(x, y, z)}
“(f) Obtain Skolem standard form for the following : 3
E=3x(P(/(x)) Q(x, F(a)
PTO. @)
“a
0
o
&
()
(@)
®
(2) 1491
Explain utility function measure for an agent. 2
Discuss special cases of hill climbing : Local Maximum, Plateau and Ridge. 3
Express the following sentences as conceptual dependency structures : 6
() _ Billis.a programmer
(i) Joe gave Sue a flower.
What are the main differences between scripts and frame structure ? 3
A 3-feet tall monkey is in a room, where some bananas are suspended from 8-feet
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
‘the bananas. 4
Let h’ denote the estimate of h (the actual cost of traversing from the current node to
a final state node). Explain in what way the efficiency of A* algorithm and reaching of
a goal state is affected if : 6
() bY always underestimates h.
(i) _W always overestimates h.
Consider a state space where the start space is number 1, and the successor function
for a state n returns two states numbered 2n and 2n +1 : 4
() Draw the portion of state space for states 1 to 15.
(i Suppose the goal state is 11. List the order in which nodes will be visited for
breadth — first search.
Explain Cut, Fail and Cut-fail statements in PROLOG. 6
Write a PROLOG program to find GCD of two numbers. 4 (6)
(6)
6. (a)
C3) 1491
Explain Turing Test approach to Al. How is Turing Test approach different from Rational
“Agent approach ? 6
Develop PEAS description of the task environment for — Internet book-shopping
agent. 4
Using constraint satisfaction algorithm, solve the following crypt arithmetic problem: 6
opD
+ODD
EVEN
A game tree is as follows : : : 4
A
aa
an ao
AN
K L
© ™
Which nodes would not be examined using alpha-beta pruning procedure ? Write a
stepwise explanation.
Discuss the differences and similarities between problem solving and planning. 5
P.T.O. (4) 1491
(®) Consider the following block world problem and solve it using goal stack plannit
Start: Goal :| A
c B
A B Cc
ON(C,A) ON(B, C) and ON(A, B)
7. (@) Consider the following piece of knowledge : 6
Some patients like all doctors.
No patient like any quack.
(Represent this knowledge as predicate statements.
(i) Prove the query “no doctor is a quack” is correct, using resolution method.
(6) Derive a parse tree for the sentence “Mary slept on the chait* using the following
rules : : 4
S — NP VP
NP +N
NP — DET N
VP -> V PP
PP — PERT NP
N > Mary/Chair
V > Slept
DET the
PERP > on
1491 4 2,500
