MODULE-I

1. Define AI with rational agent approach and laws of thought approach.

2. What are the contributions of mathematics and psychology in the evolution of AI?

3. What is agent? Explain agent function with a simple example.

4. Explain the following i) Simple reflex agents. ii) Model based reflex agents.

5. a) Give a brief description on Turing Test approach for AI b) Discuss briefly the foundations of
Artificial Intelligence

6. a) How do agents interact with the environment? Explain briefly Utility-based agents. 6

7. Explain the types of problems an AI system can solve or What are AI problem areas

8. Write the characteristics of an AI problem with examples

9. Explain a) Define problem space b) Define production system c) Define state space search

MODULE-II

1. a) Define problem solving agents. Why the problem formulation must follow goal formulation?

b) How searching is performed with partial information?

2. a) Describe recursive best first search with an example.

3. a) Explain depth first search algorithm b) What are the problem characteristics to be analyzed
before trying for a solution? Explain

4. Explain i) Simulated annealing search. ii) Local beam search.

5. Describe the working of A* search algorithm 12

6. Explain in detail the genetic algorithm

7. Explain the knowledge level, logical level and implementation level in a knowledge-based agent

8. Explain Hill climbing Heuristic search.

9. Explain how to search maximally fit Hypothesis in Genetic Algorithms and Explain about the
evolution of population overtime by using Genetic Algorithms

10. Explain about Genetic Programming with suitable example b)Explain importance of the terms
Genetic Operators and Space Search in Genetic Algorithms

MODULE-III

1. Write about knowledge based agents and write about different inference rules.
2. Write about qualifiers? How to express complex sentences by multiple quantifiers?

3. Explain the symbols and interpretations of first order logic.

4. Explain the syntax and semantics of Propositional logic.

5. Explain Kinship domain with reference first order logic.

6. State the syntax and semantics of first order logic.

7. a)Differentiate forward and backward reasoning b) Explain computable functions and predicates

8. Consider the following sentences:

Marcus was a man

Marcus was a Pompeian
All Pompeian’s were Romans
Caesar was a Ruler
All Romans were either loyal to Caesar or hated him.
Everyone is loyal to someone.
People only try to assassinate Rulers they are not loyal to.
Marcus tried to assassinate Caesar
.
Represent the above statements to well-formed.
Formulas and finally answer “was Marcus loyal to Caesar”?
[Hint: Produce a formal proof reasoning backward from the desired goal]

9. Differentiate between procedural and Declarative Knowledge Representations.

10. Consider the following facts:

X married to Y
P is Q’s brother
The spouse of every married person in the club is also a member of the club
X,P,Y,Q are all members of the club

Prove by resolution that Elder is not married.

MODULE-IV

1. Describe forward chaining algorithm.

2. Compare STRIPS language with ADL language. Illustrate the comparison with an example. 3.
Write about backward state space search for planning.

4. Discuss propositional Vs first order inference

5. Explain efficient forward chaining Vs incremental forward chaining

6. Explain the forward state space search with an example

7.What is Blocks wall problem and explain its operators?

8. Given the following information for a database:

A1: if x is on top of y. y supports x

A2: if x is above y and they are touching each other, x is on top of y

A3: a cup is above a book

A4: a cup is touching a book

i) Translate statements A1 through A4 to clausal form

ii) Show that (‘supports j book. cup)’ is true using Resolution

9. What ontological and epistemological commitments are made by propositional logic?

10. Explain the Forward and Backward Reasoning with suitable example.

11. Explain the representation of knowledge using rules.

12. What is planning? Explain various components of a planning system.

13. Explain Goal stack and Hierarchical Planning

MODULE-V

1. Explain the following i) Prior (unconditional) probability ii) Conditional probability.

2. What are the axioms of probability? Why the axioms of probability are reasonable?

3. Describe different forms of learning.

4. Explain decision tree learning algorithm with a simple example.

5. a) Discuss the issues to be addressed in order to extend decision tree induction to a wide variety
of platforms b) What is meant by over fitting? How to deal with over fitting?

6. How independence assertions can help in reducing the complexity of the inference problem?
7. State and Explain the Baye’s rule

8. Explain Bayesian learning with suitable example.

9. Explain Inductive Learning.

10. Explain the importance of Hypothesis Space Search in Decision Tree