IV B.Tech I Semester Supplementary Examinations, March 2010
ARTIFICIAL INTELLIGENCE
( Common to Computer Science & Engineering and Electronics &
Computer Engineering)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
? ? ? ? ?
1. Define agent, percept sequence with vacuum-cleaner world example. [16]
2. What is a simulated annealing search? Explain with algorithm and example. [16]
3. Explain each of the following with an example:
(a) Constraint graph
(b) Constraint satisfaction problem
(c) Cryptarithmetic puzzle. [4+6+6]
4. Why Alpha-Beta cutoffs are added to minimax procedure? Explain clearly with
example and diagram. [16]
5. (a) What do you mean by monotonicity? Are propositional and first-order logic
monotonic?
(b) Is the sentence ”Either 2+2=4 and it is raining, or 2+2=4 and it is not raining”
making a claim about arithmetic, weather, or neither? Explain.
(c) Look at the following sentences and decide for each if it is valid, unsatisfiable,
or neither using equivalence rules.
i. ((smoke ^ heat) ! fire) , ((smoke
ii. (big V dumb) V (big ! dumb). [6+6+4]
6. (a) Comment on propositional Vs first-order inference
(b) How can resolution be used to show that a sentence is
i. valid
ii. unsatisfiable
For each of the following pairs of atomic sentences, give the most general uni-
fier if it exists
i. P(A,B,B), P(X,Y,Z)
ii. Q(Y, G(A,B)), Q(G(X,X),Y) [6+6+4]
7. Define the operator schemata for the problem of putting on shoes and socks and
a hat and coat; assuming that there are no pre-conditions for putting on the hat
and coat. Give a partial-order plan that is a solution, and show that there are 180
different linearizations of this solution. [16]
Please purchase PDF Split-Merge on www.verypdf.com1 toof r2emove this watermark.
Code No: N0503/R05 Set No. 3
8. Explain with an example decision tree learning algorithm [16]
? ? ? ? ?
Please purchase
ARTIFICIAL INTELLIGENCE
( Common to Computer Science & Engineering and Electronics &
Computer Engineering)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
? ? ? ? ?
1. Define agent, percept sequence with vacuum-cleaner world example. [16]
2. What is a simulated annealing search? Explain with algorithm and example. [16]
3. Explain each of the following with an example:
(a) Constraint graph
(b) Constraint satisfaction problem
(c) Cryptarithmetic puzzle. [4+6+6]
4. Why Alpha-Beta cutoffs are added to minimax procedure? Explain clearly with
example and diagram. [16]
5. (a) What do you mean by monotonicity? Are propositional and first-order logic
monotonic?
(b) Is the sentence ”Either 2+2=4 and it is raining, or 2+2=4 and it is not raining”
making a claim about arithmetic, weather, or neither? Explain.
(c) Look at the following sentences and decide for each if it is valid, unsatisfiable,
or neither using equivalence rules.
i. ((smoke ^ heat) ! fire) , ((smoke
ii. (big V dumb) V (big ! dumb). [6+6+4]
6. (a) Comment on propositional Vs first-order inference
(b) How can resolution be used to show that a sentence is
i. valid
ii. unsatisfiable
For each of the following pairs of atomic sentences, give the most general uni-
fier if it exists
i. P(A,B,B), P(X,Y,Z)
ii. Q(Y, G(A,B)), Q(G(X,X),Y) [6+6+4]
7. Define the operator schemata for the problem of putting on shoes and socks and
a hat and coat; assuming that there are no pre-conditions for putting on the hat
and coat. Give a partial-order plan that is a solution, and show that there are 180
different linearizations of this solution. [16]
Please purchase PDF Split-Merge on www.verypdf.com1 toof r2emove this watermark.
Code No: N0503/R05 Set No. 3
8. Explain with an example decision tree learning algorithm [16]
? ? ? ? ?
Please purchase
No comments:
Post a Comment