B.E/B.TECH DEGREE EXAMINATION, MAY/JUNE 2010
Sixth semester
(Regulation 2004)
Computer science and engineering
CS 1351 – ARTIFICIAL INTELLIGENCE
(Common to B.E (part –time) fifth semester regulation 2005)
Time: three hours maximum: 100 marks
Answer ALL questions
PART A- (10 x 2 = 20 marks)
1. Define ideal rational agent.
2. How will you measure the problem-solving performance?
3. State the reasons when the hill climbing often gets stuck.
4. What is constraint Satisfaction problem?
5. Differentiate between prepositional versus first-order logic.
6. Define ontological engineering.
7. What is explanation-based engineering?
8. State the advantages of inductive logic programming.
9. Give the component steps of communication.
10.What are machine translation system?
PART B – (5 x 16 = 80 marks)
11 (a) Explain the structure of agents with suitable diagram. [Marks 16]
or
(b) Explain the following uninformed search strategies.
(i) Iterative deepening depth-first search.[Marks 8]
(ii)Bidirectional search. [Marks 8]
12 (a) Explain the A* search and give the proof of optimality of A*. [Marks 16].
or
(b) Describe Min-Max Algorithm and Alpha-Beta pruning. [Marks 16]
13 (a) (i) Describe the general process of knowledge engineering. [Marks 8]
(ii)Discuss the syntax and semantics of first-order-logic. [Marks 8]
or
(b) Describe the forward chaining and backward chaining algorithm with suitable example. [Marks 16]
14 (a) (i) Describe the decision tree learning algorithm. [Marks 8]
(ii)Explain the relevance-based learning. [Marks 8]
or
(b) Discuss active and passive reinforcement learning with suitable examples. [Marks 16]
15 (a) (i) Describe the semantic interpretation. [Marks 8]
(ii)Illustrate the grammar induction with suitable example. [Marks 8]
or
(b) Discuss on information retrieval systems and information extraction systems. [Marks 8+8]
KEYWORDS:2010 ANNA UNIVERSITY CHENNAI B.E COMPUTER SCIENCE B.E/B.TECH DEGREE EXAMINATION, APRIL/MAY 2010 SIXTH SEMESTER (REGULATION 2004) COMPUTER SCIENCE,ANNA UNIVERSITY QUESTION PAPER,ANNA UNIVERSITY,ANNA UNIVERSITY CHENNAI,ANNA UNIVERSITY COIMBATORE,ANNA UNIVERSITY TRICHY,ANNA UNIVERSITY TIRUNELVELI,ANNA UNIVERSITY MADURAI,ANNA UNIVERSITY SYLLABUS,ANNA-UNIVERSITY RESULTS,ANNA UNIVERSITY DISTANCE EDUCATION,ANNA UNIVERSITY MBA-CENTRE FOR DISTANCE EDUCATION,ANNA UNIVERSITY SCHEDULE OF EXAMINATIONS,ANNA UNIVERSITY ADMISSION,ANNA UNIVERSITY COURSES,ANNA UNIVERSITY ACADEMIC,ANNA UNIVERSITY DEPARTMENTS,ANNA UNIVERSITY RESEARCH,ANNA UNIVERSITY MAIL,ANNA UNIVERSITY QUESTION PAPERS,ANNA UNIVERSITY COUNSELLING DATES,ANNA UNIVERSITY RE-EVALUATION RESULTS
Sixth semester
(Regulation 2004)
Computer science and engineering
CS 1351 – ARTIFICIAL INTELLIGENCE
(Common to B.E (part –time) fifth semester regulation 2005)
Time: three hours maximum: 100 marks
Answer ALL questions
PART A- (10 x 2 = 20 marks)
1. Define ideal rational agent.
2. How will you measure the problem-solving performance?
3. State the reasons when the hill climbing often gets stuck.
4. What is constraint Satisfaction problem?
5. Differentiate between prepositional versus first-order logic.
6. Define ontological engineering.
7. What is explanation-based engineering?
8. State the advantages of inductive logic programming.
9. Give the component steps of communication.
10.What are machine translation system?
PART B – (5 x 16 = 80 marks)
11 (a) Explain the structure of agents with suitable diagram. [Marks 16]
or
(b) Explain the following uninformed search strategies.
(i) Iterative deepening depth-first search.[Marks 8]
(ii)Bidirectional search. [Marks 8]
12 (a) Explain the A* search and give the proof of optimality of A*. [Marks 16].
or
(b) Describe Min-Max Algorithm and Alpha-Beta pruning. [Marks 16]
13 (a) (i) Describe the general process of knowledge engineering. [Marks 8]
(ii)Discuss the syntax and semantics of first-order-logic. [Marks 8]
or
(b) Describe the forward chaining and backward chaining algorithm with suitable example. [Marks 16]
14 (a) (i) Describe the decision tree learning algorithm. [Marks 8]
(ii)Explain the relevance-based learning. [Marks 8]
or
(b) Discuss active and passive reinforcement learning with suitable examples. [Marks 16]
15 (a) (i) Describe the semantic interpretation. [Marks 8]
(ii)Illustrate the grammar induction with suitable example. [Marks 8]
or
(b) Discuss on information retrieval systems and information extraction systems. [Marks 8+8]
KEYWORDS:2010 ANNA UNIVERSITY CHENNAI B.E COMPUTER SCIENCE B.E/B.TECH DEGREE EXAMINATION, APRIL/MAY 2010 SIXTH SEMESTER (REGULATION 2004) COMPUTER SCIENCE,ANNA UNIVERSITY QUESTION PAPER,ANNA UNIVERSITY,ANNA UNIVERSITY CHENNAI,ANNA UNIVERSITY COIMBATORE,ANNA UNIVERSITY TRICHY,ANNA UNIVERSITY TIRUNELVELI,ANNA UNIVERSITY MADURAI,ANNA UNIVERSITY SYLLABUS,ANNA-UNIVERSITY RESULTS,ANNA UNIVERSITY DISTANCE EDUCATION,ANNA UNIVERSITY MBA-CENTRE FOR DISTANCE EDUCATION,ANNA UNIVERSITY SCHEDULE OF EXAMINATIONS,ANNA UNIVERSITY ADMISSION,ANNA UNIVERSITY COURSES,ANNA UNIVERSITY ACADEMIC,ANNA UNIVERSITY DEPARTMENTS,ANNA UNIVERSITY RESEARCH,ANNA UNIVERSITY MAIL,ANNA UNIVERSITY QUESTION PAPERS,ANNA UNIVERSITY COUNSELLING DATES,ANNA UNIVERSITY RE-EVALUATION RESULTS