Anna University Chennai 2009-6th Sem B.E Computer Science and Engineering /B.TECH , /E (Regulation 2004) CS 1351 – ARTIFICIAL INTELLIGENCE (Common to (part –time) fifth semester regulat

B.E/B.TECH DEGREE EXAMINATION, MAY/JUNE 2009

Sixth semester

(Regulation 2004)

Computer science and engineering

CS 1351 – ARTIFICIAL INTELLIGENCE

(Common to B.E (part –time) 5th semester regulation 2005)

Time: 3 hours maximum: 100 marks

ans ALL ques.

PART A- (10 x two = 20 marks)

1. describe ideal rational agent

2. describe a data kind to represent issues and nodes.

3. How does 1 characterize the quality of heuristic?

4. Formally describe game as a type of search issues.

5. Joe, tom and Sam are brothers-represent using 1st order logic symbols.

6. List the canonical forms of resolution.

7. What is Q-learning?

8. List the problems that affect the design of a learning element.

9. provide the semantic representation of “john loves Mary”.

10. describe DCG.

PART B – (5 x 16 = 80 marks)

11. (a) discuss uninformed search strategies.(16)

(Or)

(b) How searching is used to give solutions and also define a few real world problems? (16)
12. (a) define alpha-beta pruning and its effectiveness.(16)

(Or)

(b) Write in detail about any 2 informed search strategies. (16)

13. (a) what are forward and backward chaining.(16)

(Or)

(b) explain the general purpose ontology with the subsequent elements:

(i) Categories (4)

(ii) Measures (4)

(iii) Composite objects (4)

(iv) Mental events and mental objects.(4)

14. (a) discuss with an example learning in decision trees.(16)

(Or)

(b) define multilayer feed-forward networks. (16)

15.(a) (i) list the component steps of communication.(8)

(ii) Write short notes about ambiguity and disambiguation.(8)

(Or)

(b) explain in detail the syntactic analysis (PARSING). (16)

Earning:   Approval pending.