IV B.Tech I Semester Regular Examinations, November 2009
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. Explain 8-Puzzle problem and 8-queens problems. [8+8]
2. (a) Compare depth first search and depth limited search.
(b) Compare breadth first search and depth first search. [8+8]
3. Explain each of the following with an example:
(a) Constraint graph
(b) Constraint satisfaction problem
(c) Cryptarithmetic puzzle. [4+6+6]
4. (a) Explain why games are useful to explore machine intelligence?
(b) Explain why exhaustive search of the game-tree is impossible. [8+8]
5. (a) How can a knowledge-based agent be described at three levels?
(b) Given the following, can you prove that the unicorn is mythical? How about
magical? Horned?
If the unicorn is mythical, then it is immortal, but if it is not mythical, then
it is a mortal mammal. If the unicorn is either immortal or a mammal, then
it is horned. The unicorn is magical if it is horned.
(c) Give ontological and epistemological commitments of a propositional logic.
[6+6+4]
6. Consider the following facts:
• Marcus was a man
• Marcus was a Pompeian
• Marcus was born in 40 A.D.
• All men are mortal
• All Pompeians died when volcano erupted in 79 A.D.
• No mortal lives longer than 150 years
• It is now 1991
• Alive means not dead
• If someone dies, then he is dead at all later times
Prove using resolution that Marcus is dead. [16]
7. (a) What are the limitations of the problem solving approach and what is the
motivation behind the design of planning systems
Please purchase PDF Split-Merge on www.verypdf.com1 toof r2emove this watermark.
Code No: N0503/R05 Set No. 3
(b) What do you mean by state space search?
(c) What do you mean by regression planning? [6+6+4]
8. What are decision trees? Draw a decision tree for the problem of deciding whether
or not to move forward at a road intersection given that the light has just turned
green.
[16]
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. Explain 8-Puzzle problem and 8-queens problems. [8+8]
2. (a) Compare depth first search and depth limited search.
(b) Compare breadth first search and depth first search. [8+8]
3. Explain each of the following with an example:
(a) Constraint graph
(b) Constraint satisfaction problem
(c) Cryptarithmetic puzzle. [4+6+6]
4. (a) Explain why games are useful to explore machine intelligence?
(b) Explain why exhaustive search of the game-tree is impossible. [8+8]
5. (a) How can a knowledge-based agent be described at three levels?
(b) Given the following, can you prove that the unicorn is mythical? How about
magical? Horned?
If the unicorn is mythical, then it is immortal, but if it is not mythical, then
it is a mortal mammal. If the unicorn is either immortal or a mammal, then
it is horned. The unicorn is magical if it is horned.
(c) Give ontological and epistemological commitments of a propositional logic.
[6+6+4]
6. Consider the following facts:
• Marcus was a man
• Marcus was a Pompeian
• Marcus was born in 40 A.D.
• All men are mortal
• All Pompeians died when volcano erupted in 79 A.D.
• No mortal lives longer than 150 years
• It is now 1991
• Alive means not dead
• If someone dies, then he is dead at all later times
Prove using resolution that Marcus is dead. [16]
7. (a) What are the limitations of the problem solving approach and what is the
motivation behind the design of planning systems
Please purchase PDF Split-Merge on www.verypdf.com1 toof r2emove this watermark.
Code No: N0503/R05 Set No. 3
(b) What do you mean by state space search?
(c) What do you mean by regression planning? [6+6+4]
8. What are decision trees? Draw a decision tree for the problem of deciding whether
or not to move forward at a road intersection given that the light has just turned
green.
[16]
No comments:
Post a Comment