Acharya Nagarjuna University (ANU) 2005 B.Tech Information Technology IT 415 A Artificial Intelligence - Question Paper

IV/IV B.Tech Degree exam
April 2005
Artificial Intelligence
IT 415 A

JVfJV B.Tech, DEGREE EXAMINATION, APRIL 2005. First Semester tnfbrmstion Technology ARTIFICIAL INTELLIGENCE Time t Three hours    Maximum ; 70 marks

All questions carry equal marks.

Answer Question No. I compulsorily,

(1 x 14 = 14) Answer ONE question from each Unit.

(4 x 14 = 56)

1. Briefly explain the following:

(a) Heuristic function,

tb) Give ajiy two advantages of BFS.

(c) Write any two differences between BFS and

DFS,

id) Wfiat is Hill climbing?    **

Procedural knowledge

{f}    Give two uses of cut in prolog,

(g)    Semantic net.

(h)    Script.

(i)    Back tracking,

(j)    What is prapositional resolution?

(k>. Represent the fact described % the*following sentence as a set of wfFs iii predicate logic?

marcue tried to assasinate Caesar'.

OJ Write any two differences between forward versus backward reasoning,

(m) List throe factors that provide efficiency of RETS matching algorithm.

(n) Name any two issues in knowledge representation,

2.    (a) Briefly explain production system characteristics,

_t(b) What is a water jug problem? Write down the production rulefe fbr the water jug problem,

Or

tc) Explain    algorithm with suitable

example.

(d} What ia means-ends" analysis? Illustrate with an example.

UNIT II

3.    (a) Wtiat are the approaches to knowledge representation? And what are the isauea involved in it?

(b)    Describe the method of resolution in predicate logic with an example.

Or

(c)    Describe about representation of instance and Isa relationship,    *

(d)    Briefly explain about computable functions and predicates,

3    (IT 415 (A))

4, (a) Differentiate between procedural versus declarative knowledge,

(b)    Explain forward-chaining rule end backward chaining rule systems with examples.

Or    -

(c)    Write short notes on conceptual dependajr*.

(d)    Discuss about matching and indexing. . .

UNIT IV

ii, (a) Define the thrte.basic .Constructs facte, rules

   r-P-    7

and queries in prolog. Give the form with an example.

i(b) fWrite a prolog program to implement multiplication as repeated addition.    "

.    Or

(c) Explain how iteration ,and recursion is implemented in PROLOG,

fd) Write a PROLOG program to read a list of words from the input stream.

Attachment: acharya-nagarjuna-university--anu--2005-b-tech-information-technology-7378-1.pdf

Earning:   Approval pending.