CS 1351 - ARTIFICIAL INTELLIGENCE

[Kalyan]

CS 1351 - ARTIFICIAL INTELLIGENCE

2008 Anna University B.E Computer Science Question paper

PART -A ( 2x10=20)

1]What is the use of heuristic functions?

2]Define artificial intelligence.

3)How to improve the effectiveness of a search based problem solving technique?

4]What is a constraint satisfication problem?

5]What is a unification algorithm?

6]How can you represent the resolution in predicate logic?

7]List out the advantages of nonmonotonic reasoning.

8]Differentiate between JTMS and LTMS

9]List out the important components of a scipt.

10]What are framesets and instances?

PART - B (16X5=80)

11. (a)(i) Give an example of a problem for which breath first search would work better than depth first search.

(ii). Explain the algorithm for steepest hill climbing.

OR

(b). Explain the following search strategies.

(i) .Best first search

(ii) .A* search.

12 .(a) Explain Min Max search procedure

OR

(b) .Describe alpha-beta pruning and give the other modifications to the minmax procedure to improve its performance.

13.. (a) Illustrate the use of predicate logic to represent the knowledge with suitable example.

OR

(b) Consider the following sentences:

John likes all kinds of food.

Apples are food.

Chicken is food

Anything anyone eats and isn't killed alive.

sue eats everything bill eats

(i) .Translate these sentences into formulas in predicate logic.

(ii) .Prove that john likes peanuts using backward chaining

(iii). Covert the formulas of a part into clause form

(iv) .Prove tha tjohn likes peanuts using resolution.

14..(a) With an example explain the logics for nonmonotonic reasoning

OR

(b) Explain how Beyesian statistics provides reasoning under various kinds of uncertainty

15..(a) (i) Construct semantic net representations for th folowing:

pomepeian (Marcus), Blacksmith ( marcus)

Mary gave the green flowered vase to her favorite cousin.

(ii) Construct partitioned semantic net represtations for the following:

Every batter hit a ball

All the batters like the pitcher.

OR

(b) (i) .Illustrate the learning fromexamples by induction with suitable examples.

[ganeshbala]

2006 Andhra University M.C.A ARTIFICIAL INTELLIGENCE Question paper

M.C.A DEGREE EXAMINATION
Second Year-Second Semester
ARTIFICIAL INTELLIGENCE
(Effective from the admitted batch of 2004-2005)

Time:Three hours Maximum:100marks

First Question is Compulsory

Answer any FOUR from the remaining

Answer ALL parts of any Question at one place.


1 Explain the following in brief:
a)Expert System.
b)Production System
c)Annealing
d)Frame Problem
e)Predicates
f)Forward reasoning
g)Default Logic
h)Fuzzy Logic
i)Conceptual dependency
j)Horn Clause


2.a)Show that the "Tower of Hanoi" problem can be classified under the area of
AI.Give a state space representation of the problem.

b) Discuss about ignorable, recoverable and irrecoverable problems.

3. Trace the constraint satisfication procedure solving the cryptarithmetic
Problem.

CROSS
+ ROADS
---------------
DANGER

4.a)Explain AO* algorithm.
b)Explain Resolution.


5.Explain Justification-Based Truth Maintenance System.

6 a)Explain Conflict resolution.
b)Explain the features of many-many match algorithm RETE.
c)Explain Bayes theorem.

7a)Explain Semantic nets.Suggest a semantic net to describe the main organs of
the human body.

b) Explain Syntactic-Semantic Spectrum of representation.


8.Write short notes on:
a)Problem Reduction
b)Procedural Vs Declarative Knowledge
c)CYC
d)Dempster-Shafer theory

[ganeshbala]

Anna University B.E Computer Science Artificial Intelligence Question paper

1. (a)(i) Give an example of a problem for which breath first search would work better than depth first search.

(ii). Explain the algorithm for steepest hill climbing.

OR

(b). Explain the following search strategies.

(i) .Best first search

(ii) .A* search.

12 .(a) Explain Min Max search procedure

OR

(b) .Describe alpha-beta pruning and give the other modifications to the minmax procedure to improve its performance.

13.. (a) Illustrate the use of predicate logic to represent the knowledge with suitable example.

OR

(b) Consider the following sentences:

John likes all kinds of food.

Apples are food.

Chicken is food

Anything anyone eats and isn't killed alive.

sue eats everything bill eats

(i) .Translate these sentences into formulas in predicate logic.

(ii) .Prove that john likes peanuts using backward chaining

(iii). Covert the formulas of a part into clause form

(iv) .Prove that john likes peanuts using resolution.

14..(a) With an example explain the logics for nonmonotonic reasoning

OR

(b) Explain how Beyesian statistics provides reasoning under various kinds of uncertainty

[robert senyonjo]

2006 Andhra University M.C.A ARTIFICIAL INTELLIGENCE Question paper

M.C.A DEGREE EXAMINATION
Second Year-Second Semester
ARTIFICIAL INTELLIGENCE
(Effective from the admitted batch of 2004-2005)

Time:Three hours Maximum:100marks

First Question is Compulsory

Answer any FOUR from the remaining

Answer ALL parts of any Question at one place.


1 Explain the following in brief:
a)Expert System.
b)Production System
c)Annealing
d)Frame Problem
e)Predicates
f)Forward reasoning
g)Default Logic
h)Fuzzy Logic
i)Conceptual dependency
j)Horn Clause


2.a)Show that the "Tower of Hanoi" problem can be classified under the area of
AI.Give a state space representation of the problem.

b) Discuss about ignorable, recoverable and irrecoverable problems.

3. Trace the constraint satisfication procedure solving the cryptarithmetic
Problem.

CROSS
+ ROADS
---------------
DANGER

4.a)Explain AO* algorithm.
b)Explain Resolution.


5.Explain Justification-Based Truth Maintenance System.

6 a)Explain Conflict resolution.
b)Explain the features of many-many match algorithm RETE.
c)Explain Bayes theorem.

7a)Explain Semantic nets.Suggest a semantic net to describe the main organs of
the human body.

b) Explain Syntactic-Semantic Spectrum of representation.


8.Write short notes on:
a)Problem Reduction
b)Procedural Vs Declarative Knowledge
c)CYC
d)Dempster-Shafer theory