Acharya Nagarjuna University (ANU) 2005 B.Tech Computer Science and Engineering CS 326 Artificial Intelligence - Question Paper

III/IV B.Tech Degree exam
October 2005
Artificial Intelligence
CS 326

IH/TV B.Teeh. DEGREE EXAMINATION, OCTOBER 2005.

Second Semester

ARTIFICIAL INTELLIGENCE

TimeThree hours    Maximum : 70 marks

All questions carry equal marks.

Answer Question No. 1 compulsorily.

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

(4 x 14 = 56)

L. Briefly explain the following r

(a)    What do you mean by state space search?

Ja

(b)    What does a production system consists of?

(c)    What is a heuristic function?

(d)    What is hill climbing?

(e} What is the difference between forward and backward reasoning?    ~

(fl What is a compactable functions?

(g) Give an example for control knowledge.

(h)    Represent the following statement using semantic net. "A man is an human being and all human beings have two legs.

(i)    What are rules?

(j) What is. the art?

(k) Tail' predicate in_FROLOG.

(1) Define adscript,

(m) List the basic prolog I/O predicates.

(n) What are the approaches to knowledge representation?    '

UNIT I

2 (a) Briefly discuss the representation of tho problem in a state space,

i

(bj Enumerate the advantages of DFS and BFS algorithms.

Or

Describe the A* algorithm with suitable

example.

J

(d) Trace the constraint satisfaction procedure solving the following crypt arithmetic problem :

CROSS + ROADS    "

DANGER

3.    (a) Discuss about representation of simple facts in logic.

tb) Discuss briefly different approaches to knowledge representation.

Or

(?) What is resolution? Explain with tha help of an example.

(d) What is the need for natural deduction? Explain.

UNIT III

4.    (a) Compare and contrast forward versus backward reasoning,

(b) Discuss about matching and indexing.

Or

(t) Briefly explain about semantic nets.

(d) Construct a script for going to u restaurant.

5, (a) Explain rules in PROLOG with suitable examples.

Cb) Write a PROLOG program to find

? member (C_t (a, b, cJX Trace the search

eequenoe*

Or

(c)    Explain the concept of recursion in PROLOG with example.

(d)    Explain how objects and relationships are represented by using trees and lists.

Attachment: acharya-nagarjuna-university--anu--2005-b-tech-computer-science-and-engineering-7565-1.pdf

Earning:   Approval pending.