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. (a) Explain how a problem can be defined.
(b) Explain rational agents? [8+8]
2. What is a greedy best first search? Explain with example and diagram. [16]
3. Explain the following:
(a) Minimum Remaining Value heuristic (MRV)
(b) Dependency directed back tracking
(c) Chronological back tracking. [6+5+5]
4. In a chess game assume the average branching factor is 35, and the number of
moves made by each player to win or failure is 50. Estimate size of game tree, with
diagram. What is your conclusion from above game? [16]
5. (a) Explain in detail a knowledge-based agent.
(b) Discuss on complexity of propositional inference. [8+8]
6. (a) What do you mean by semidecidability? What is semidecidable in first-order
logic?
(b) Comment of completeness of first-order logic
(c) What do you mean by conjunctive normal form and implicative normal form.
[6+6+4]
7. (a) What are the limitations of the problem solving approach and what is the
motivation behind the design of planning systems
(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. (a) Explain how a problem can be defined.
(b) Explain rational agents? [8+8]
2. What is a greedy best first search? Explain with example and diagram. [16]
3. Explain the following:
(a) Minimum Remaining Value heuristic (MRV)
(b) Dependency directed back tracking
(c) Chronological back tracking. [6+5+5]
4. In a chess game assume the average branching factor is 35, and the number of
moves made by each player to win or failure is 50. Estimate size of game tree, with
diagram. What is your conclusion from above game? [16]
5. (a) Explain in detail a knowledge-based agent.
(b) Discuss on complexity of propositional inference. [8+8]
6. (a) What do you mean by semidecidability? What is semidecidable in first-order
logic?
(b) Comment of completeness of first-order logic
(c) What do you mean by conjunctive normal form and implicative normal form.
[6+6+4]
7. (a) What are the limitations of the problem solving approach and what is the
motivation behind the design of planning systems
(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