PRIST UNIVERSITY

(Estd. u/s 3 of UGC Act, 1956)

Vallam, Thanjavur -613403

________________________________________________________________________

B.Tech. ARTIFICIAL INTELLIGENCE

QUESTION BANK
Course Details
Course Code & Title Regulations : 12150H33P- ARTIFICIAL INTELLIGENCE : 2012 Regulation
(For Students admitted from June 2012 onwards)

Nature of the Course Semester

: CORE : III

H.O.D.

Staff-In-Charge& prepared by
R.BHARATH KUMAR

CSE/Sem III

12150H33P - ARTIFICIAL INTELLIGENCE & EXPERT SYSTEMS

AIM: To create general understanding of major concepts and approaches in knowledge representation, planning, learning, robotics and other AI areas.
OBJECTIVES:

To study various complex problem solving AI tools like Search and optimization To facilitate of logic, Probabilistic methods for uncertain reasoning, Classifiers and statistical learning methods, Neural networks, Control theory & Languages. To develop programming skills for AI applications. To provide exposure to logic programming with practical topics. UNIT I INTRODUCTION 8+3

Intelligent Agents Agents and environments - Good behavior The nature of environments structure of agents - Problem Solving - problem solving agents example problems searching for solutions uniformed search strategies - avoiding repeated states searching with partial information. UNIT II SEARCHING TECHNIQUES 10+3

Informed search and exploration Informed search strategies heuristic function local search algorithms and optimistic problems local search in continuous spaces online search agents and unknown environments Structure of problems - Adversarial Search . UNIT III KNOWLEDGE REPRESENTATION 10+3

First order logic representation revisited Syntax and semantics for first order logic Using first order logic Knowledge engineering in first order logic - Inference in First order logic prepositional versus first order logic unification and lifting forward chaining backward chaining - Resolution - Knowledge representation - Ontological Engineering - Categories and objects Actions - Simulation and events - Mental events and mental objects UNIT IV LEARNING 9+3

Learning from observations - forms of learning - Inductive learning - Learning decision trees Ensemble learning - Knowledge in learning Logical formulation of learning Explanation based learning Learning using relevant information Inductive logic programming - Statistical learning methods - Learning with complete data - Learning with hidden variable . UNIT V APPLICATIONS 8+3 Communication Communication as action Formal grammar for a fragment of English Syntactic analysis Augmented grammars Semantic interpretation Ambiguity and disambiguation Discourse understanding Grammar induction . TOTAL : 60

TEXT BOOK:

1.

Stuart Russell, Peter Norvig, Artificial Intelligence A Modern Approach, 2nd Edition, Pearson Education / Prentice Hall of India, 2004.

RE`FERENCES: 1. 2. Nils J. Nilsson, Artificial Intelligence: A new Synthesis, Harcourt Asia Pvt. Ltd., 2000. Elaine Rich and Kevin Knight, Artificial Intelligence, 2nd Edition, Tata McGraw-Hill, 2003.

UNIT I

INTRODUCTION
PART A

1. Define intelligent agent? 2. Write the two parts in VLSI layout. 3. List any four components of problem definition. 4. What do you mean by DFS? 5. Define Artificial Intelligence. 6. Mention the four kinds of agents. 7. Give any two examples for toy problems. 8. What is an agent? 9. Give any four examples for real world problems. 10. Give the expansion of PEAS 11. What is the use of Heuristic Functions? 12. Write short notes on Search Tree PART-B 1. Discuss on Toy problems 2. Explain any two kinds of agent Program. 3. Describe the properties of task environment with suitable example 4. Explain Breadth First Search and Depth First Search with algorithm. 5. Explain the following uninformed search strategies with examples. a) Uniform Cost Search b) Depth Limited Search c) Bidirectional Search 6. Define the Vacuum World Problem and draw the corresponding state set space Representations

(16) (16) (16) (16) (16)

(16)

UNIT II SEARCHING TECHNIQUES

PART A 1. Define A* Search. 2. Write the variants of Hill Climbing. 3. What is a local minima problem? 4. What is the use of online search agents in unknown environments? 5. List the problems with Hill Climbing 6. What is Genetic Algorithm? 7. Mention any four applications of Local search algorithms. 8. Give the advantages of Local search algorithm. 9. What is CSP? 10. List the different types and applications of local search algorithm. 11. What is the need of memory bounded heuristic search? 12. What is a constraint satisfaction problem? PART-B 1. Explain informed heuristic search strategies. 2. Explain the concept of Hill Climbing Search with suitable example.

(16) (16)

3. Illustrate Genetic algorithm with example. 4. Describe Local search algorithms. 5. Explain the behavior of A* search algorithm with example

(16) (16) (16)

UNIT III

KNOWLEDGE REPRESENTATION

PART A 1. Write the two functions of KB agent. 2. Define conjunction 3. Define Atomic sentences. 4. Write the BNF grammer representation for FOL. 5. Define predicate symbol with an example. 6. Define WFF with an example. 7. Differentiate function and relation in FOL with an example 8. Mention two types of Quantifiers. 9. Write the steps involved in backward chaining. 10. Define ground term. 11. Write short notes on uniqueness quantifier. 12. Define frame problem. 13. Define verification PART-B 1 Explain knowledge engineering process with suitable example. (16) 2. Illustrate first order inference rule with suitable example. (16) 3. Discuss on forward chaining in detail. (16) 4. Describe backward chaining with example. (16) 5. Solve the given KB problem using resolution with refutation Technique in INF & CNF (16) 6. Explain unification algorithm with an example (16)

UNIT IV LEARNING
PART A 1. What is neural network? 2. What do you mean by Bayesian learning? 3. List three forms of Learning. 4. What do you mean by classification and regression? 5. Define decision tree. 6. What is meant by cumulative learning? 7. List some of the applications of learning. 8. Define learning. 9. List the different types of learning methods. 10. Define computational learning theory 11. What is meant by Artificial Neural Network (ANN)? 12. Differentiate feed forward with recurrent network. 13. What do you mean by over fitting? 14. Write short notes on Q-functions.

PART B 1. Explain Explanation based learning with suitable example. 2. Discuss on least-commitment search. 3. Illustrate current-best-hypothesis search with suitable example. 4. Explain Inductive learning in detail 5. Write short notes on knowledge in learning. 6. Discuss on least-commitment search.

(16) (16) (16) (16) (16) (16)

UNIT V

APPLICATIONS

PART A 1. What is a formal language? 2. What do you mean by bottom-up parsing? 3. Define Grammar Induction. 4. What is meant by Metaphor? 5. What is Rough Translation? 6. Write the steps for K means clustering. 7. Differentiate information retrieval and information extraction. 8. Define machine translation. 9. List the types of grammar with its rules. 10. Differentiate bottom up parsing with top-down parsing. 11. What do you mean by chart parsers? Give Examples 12. What is called Top down parsing? 13. Define Communication. 14. Define utterance. PART-B 1. Explain communication as action. 2. Discuss formal grammar for a fragment of English. . 3. Describe syntactic analysis with example 4. Explain information retrieval in detail 5. Write short notes on: (a) Discourse understanding. (b) Grammar induction

(16) (16) (16) (16) (16) (8) (8)