Scribd
Upload
1 views1 page

Artificial Intelligence (April/May-2013, Set-1) JNTU-Anantapur

This document is an examination paper for a course on Artificial Intelligence from JNTU-Anantapur, dated April/May 2013. It contains a set of questions covering various AI concepts such as AI techniques, problem formulation, backtracking algorithms, first-order logic, inferential frame problems, maximal probability, and inductive learning. Students are required to answer any five questions, with each question carrying equal marks.

Uploaded by

DEVIKA G
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
1 views1 page

Artificial Intelligence (April/May-2013, Set-1) JNTU-Anantapur

This document is an examination paper for a course on Artificial Intelligence from JNTU-Anantapur, dated April/May 2013. It contains a set of questions covering various AI concepts such as AI techniques, problem formulation, backtracking algorithms, first-order logic, inferential frame problems, maximal probability, and inductive learning. Students are required to answer any five questions, with each question carrying equal marks.

Uploaded by

DEVIKA G
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Artificial Intelligence (April/May-2013, Set-1) JNTU-Anantapur

Code No.: 9A05605/R09


III B.Tech. II Semester Regular and Supplementary Examinations
April/May - 2013
Set-1
ARTIFICIAL INTELLIGENCE
( Computer Science and Engineering )
Time: 3 Hours Max. Marks: 70
Answer any FIVE Questions
All Questions carry Equal Marks
---
1. What is an AI technique? Discuss the problem of an Al technique with help of examples.

2. (a) Define the terms: State space, search tree, search node, branching factor.
(b) Explain why problem formulation must follow goal formulation.

3. (a) Explain Davis-Putnam algorithm for backtracking.


(b) Discuss completeness of resolution in detail.

4. Briefly illustrate the use of first order logic for simple representations.

5. Explain the solution for inferential frame problem.

6. Explain maximal probability using examples.


7. (a) Explain with examples how the background knowledge is useful for faster learning then from a pure inductive
program.
(b) Explain knowledge base inductive learning.

8. Explain sectional view of a fuzzy room cooler.

B.Tech. III-Year II-Sem. ( JNTU-Anantapur )

You might also like