Code No: 37140 Set No.

1
IV B.Tech I Semester Supplimentary Examinations, May/Jun 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. Write several iterations of iterative deepening and also explain with algorithm and
diagrams. [16]

3. Explain each of the following with an example:

(a) Constraint graph

(b) Constraint satisfaction problem
(c) Cryptarithmetic puzzle. [4+6+6]

4. (a) Is exhaustive search for games such as chess is possible? Explain with your
own measures.
(b) Explain secondary research. [8+8]

5. Jones, Smith, and Clark hold the jobs of programmer, knowledge engineer, and
manager. Jones owes the programmer $10. The manager’s spouse prohibits bor-
rowing money. Smith is not married. Your task is to figure out which person has
which job. Solve the problem using propositional logic. [16]

6. (a) Explain forward-chaining algorithm

(b) Here are two sentences in the language of first-order logic:
i. –Vx ∋ y (x>=y)
ii. ∋y –Vx (x>=y)
Assume that the variable range over all natural numbers 0, 1, 2, .... , and
that the ”>=” predicate means “greater than or equal to”. Try to prove
that (i) follows from (ii) using resolution; continue until the proof breaks
down and you cannot proceed. Show the unifying substitution for each
resolution step. If the proof fails, explain exactly where, how, and why it
breaks down. [8+8]

7. Let us consider a version of the milk/banana/drill shopping problem

(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.

1 of 2
Code No: 37140 Set No. 1
(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
Code No: 37140 Set No. 2
IV B.Tech I Semester Supplimentary Examinations, May/Jun 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. What are four basic kinds of agent program that embody the principles underlying
almost all intelligent system? Explain any two of them with diagram. [4+6+6]

2. (a) Explain why A* algorithm is admissible and computationally optimal.

(b) What is uniform cost search? [8+8]

3. (a) What is steepest descent? What are the drawbacks of it?

(b) Explain the map coloring as a constraint satisfaction problem. [8+8]

4. “Minimax procedure is a depth first, depth limited Recursive Procedure” Explain

this fact by using your own example and diagram. [16]

5. (a) Describe generic knowledge based agent.

(b) What are the problems with propositional logic?
(c) How can a knowledge-based agent be made fully autonomous? [6+6+4]

6. (a) Give the steps for conversion to implicative normal form

(b) For each of the following pairs of atomic sentences, give the most general
unifier if it exists
i. older(father(y),y), older(father(x),john)
ii. knows(father(y),y), knows(x,x)
iii. f(Marcus,g(x,y)) and f(x,g(Caeser,Marcus)) [10+6]

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. Explain with an example decision tree learning algorithm [16]

⋆⋆⋆⋆⋆

1 of 1
Code No: 37140 Set No. 3
IV B.Tech I Semester Supplimentary Examinations, May/Jun 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. What is a heuristic search? Explain various types of heuristic searches. [16]

3. Explain Arc consistency and path consistency of CSPs. [16]

4. (a) Is exhaustive search for games such as chess is possible? Explain with your
own measures.
(b) Explain secondary research. [8+8]

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) What do you mean by semidecidability? What is semidecidable in first-order

logic?
(b) Comment on 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. (a) Explain about inducing decision trees with an example.

(b) Explain EM algorithm. [8+8]

⋆⋆⋆⋆⋆

1 of 1
Code No: 37140 Set No. 4
IV B.Tech I Semester Supplimentary Examinations, May/Jun 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) Define rational agent, and explain it.

(b) What are the four things that “What is rational at any given time depends
on”?
(c) Compare rationality and omniscience with an example. [6+4+6]

2. Explain depth first search and breadth first search with neat diagrams. [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. For a chess game, assume the average branching factor in 35 and the number of
moves made by each player to win or loss is 50 is exhausted search is possible?[16]

5. (a) Explain forward and backward chaining in propositional logic

(b) Consider the following axioms.
P
(P ∧ Q) → R
(SVT) → Q
T
Prove R using resolution in propositional logic. [10+6]

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
(c) 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. Let us consider a version of the milk/banana/drill shopping problem

1 of 2
Code No: 37140 Set No. 4
(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 supervised learning, reinforcement learning, and unsupervised learn-

ing
(b) Comment on the expressiveness of decision trees
(c) What do you mean by incremental learning? [6+6+4]

⋆⋆⋆⋆⋆

2 of 2