Ai

www.andhracolleges.
com The Complete Information About Colleges in Andhra Pradesh
Code No: N0503/R05 Set No. 1

IV B.Tech I Semester Regular Examinations, November 2009
ARTIFICIAL INTELLIGENCE
( Common to Computer Science & Engineering and Electronics &
Computer Engineering)
www.andhracolleges.com
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
?????
1. How do human brains process information? Explain with diagram and also compare
computer and human brain. [10+6]
2. How can the performance of a problem solving algorithm can be measured. Com-
pare and contrast Breadth First search with Depth-First search. [4+12]
3. (a) What is a constraint satisfaction problem?
(b) Solve the following cryptarithmetic problem: [4+12]
SEND
MORE
MONEY
4. (a) What is a game tree?
(b) Explain one ply, two ply, search and depth of a game tree with diagram.[8+8]
5. (a) Explain, the knowledge level, logical level, and implementation level in a
knowledge-based agent.
(b) What is a horn sentence. Does a polynomial time inference procedure exist
for Horn sentence?
(c) What ontological and epistemological commitments are made by propositional
logic. [6+6+4]
6. Consider the following sentences:
• John likes all kinds of food
• Apples are food
• Chicken is food
• Anything anyone eats and isn’t killed by is food
• Bill eats peanuts and is still alive
• Sue eats everything Bill eats
(a) Translate these sentences into formulas in predicate logic

(b) Convert the formulas into clause form
(c) Use resolution to answer the question, ”What food does Sue. [6+4+6]
7. Let us consider a version of the milk/banana/drill shopping problem
Seminar Topics - Scholarships - Admission/Entrance Exam Notifications

USA-UK-Australia-Germany-France-NewZealand Universities List
1 of 2
www.andhracolleges.com Engineering-MBA-MCA-Medical-Pharmacy-B.Ed-Law Colleges Information
www.andhracolleges.com The Complete Information About Colleges in Andhra Pradesh

(a) Let CC denote a credit card that the agent can use to buy any object. Write
the description of Buy so that the agent has to have its credit card in order
to buy any thing.
(b) Write a Pick-Up operator that enables the agent to have an object if it is
portable and at the same location as the agent.
(c) Assume that the credit card is at home, but Have(CC) is initially false. Con-
struct a partially ordered plan that achieves the goal, showing both ordering
constraints and causal links
(d) Explain in detail what happens during the planning process when the agent
explores a partial plan in which it leaves home without the card. [4+4+4+4]
8. (a) Explain the major issues that affect the design of the learning element.
(b) Explain various forms of learning [8+8]
?????
2 of 2

?????
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]
?????
1 of 1

?????
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]
1 of 2

green.
[16]
?????
2 of 2

?????
1. What is an agent? Explain the vacuum cleaner world example? [16]

2. Define a heuristic function and explain how to compute heuristic function for a
chess game with an example. [16]
3. What are the various problem that occur during hill climbing? How to solve them.
[16]
4. Explain the following:
(a) Waiting for quiescence
(b) Secondary search. [8+8]
5. What is a Wumpus world? Explain with an example acting and reasoning in the
Wumpus world. [16]
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]
green.
[16]
?????
1 of 1

Ai

Enviado por

Dados do documento

Descrição original:

Título original

Direitos autorais

Formatos disponíveis

Compartilhar este documento

Compartilhar ou incorporar documento

Opções de compartilhamento

Você considera este documento útil?

Este conteúdo é inapropriado?

Direitos autorais:

Formatos disponíveis

Ai

Enviado por

Direitos autorais:

Formatos disponíveis

www.andhracolleges.

com The Complete Information About Colleges in Andhra Pradesh

Code No: N0503/R05 Set No. 1

(a) Translate these sentences into formulas in predicate logic

Seminar Topics - Scholarships - Admission/Entrance Exam Notifications

Code No: N0503/R05 Set No. 1

Code No: N0503/R05 Set No. 2

1. (a) Explain how a problem can be defined.

3. Explain the following:

(a) Minimum Remaining Value heuristic (MRV)

5. (a) Explain in detail a knowledge-based agent.

6. (a) What do you mean by semidecidability? What is semidecidable in first-order

Code No: N0503/R05 Set No. 3

1. Explain 8-Puzzle problem and 8-queens problems. [8+8]

2. (a) Compare depth first search and depth limited search.

3. Explain each of the following with an example:

(a) Constraint graph

4. (a) Explain why games are useful to explore machine intelligence?

5. (a) How can a knowledge-based agent be described at three levels?

6. Consider the following facts:

Code No: N0503/R05 Set No. 3

Code No: N0503/R05 Set No. 4

1. What is an agent? Explain the vacuum cleaner world example? [16]

Você também pode gostar