INSTITUTE OF SCIENCE AND TECHNOLOGY BHOPAL
DEPARTMENT OF MCA
COURSE FILE Session Jan – June 2010
PROGRAME : Master Of Computer Application
SEMESTER : Fourth
COURSE CODE : MCA-401
SUBJECT NAME : Artificial Intelligence
PREPARED BY: APPROVED BY:
CONTENT
1. SYLLABUS
2. LIST OF BOOKS
3. TIME TABLE
4. LECTURE PLAN
5. TUTORIAL SHEETS
6. UNIT TEST PAPER
7. MID SEM PAPER
8. PUT PAPER
9. GRADING SHEET
10. UNIVERSITY PAPER
11. ATTENDENCE SHEET
12. CLASS NOTES
13. TACTICAL PLAN Syllabus
Course No. Course Name L T P Theory Sessional Practical Total (Hrs) (Hrs) (Hrs) Marks Marks Marks Marks Max Min Max Min Max Min MCA-401 Artificial Intelligence & 3 1 - 100 40 50 30 - - 150 Applications
UNIT-I General Issues and Overview of AI The AI problems, what is an AI technique, Characteristics of AI applications. Introduction to LISP programming: Syntax and numeric functions, Basic list manipulation functions, predicates and conditionals, input output and local variables, iteration and recursion, property lists and arrays.
UNIT-II Problem Solving, Search and Control Strategies General problem solving, production systems, control strategies forward and backward chaining, exhaustive searches depth first breadth first search. Heuristic Search Techniques Hill climbing, branch and bound technique, best first search & A* algorithm, AND / OR graphs, problem reduction & AO* algorithm, constraint satisfaction problems.
UNIT-III Knowledge Representations First order predicate calculus, skolemization, resolution principle & unification, interface mechanisms, horn's clauses, semantic networks, frame systems and value inheritance, scripts, conceptual dependency.
UNIT-IV Natural Language processing Parsing techniques, context free grammer, recursive transitions nets (RNT), augmented transition nets (ATN), case and logic grammers, symantic analysis. Game playing Minimax search procedure, alpha-beta cutoffs, additional refinments. Planning Overview an example domain the block word, component of planning systems, goal stack planning, non linear planning.
UNIT-V Probabilistic Reasoning and Uncertainty Probability theory, bayes theorem and bayesian networks, certainty factor. Expert Systems Introduction to expert system and application of expert systems, various expert system shells, vidwan frame work, knowledge acquisition, case studies, MYCIN. Learning Rote learning, learning by induction, explanation based learning. REFERENCE BOOKS
1. Elaine Rich and Kevin Knight “Artifical Intelligence” - Tata McGraw Hill.
2. “Artifical Intelligence” 4 ed. Pearson.
3. Dan W. Patterson “Introduction to Artifical Intelligence and Expert
Systems”, Prentice India.
4. Nils J. Nilson “Principles of Artifical Intelligence”, Narosa Publishing
House.
5. Clocksin & C.S.Melish “Programming in PROLOG”, Narosa Publishing House
6. M.Sasikumar,S.Ramani etc. “Rule based Expert System”, Narosa
Publishing House.
Institute of Science And Technology Session Jan –June- UNIT TEST -1 MCA-401
Subject: Artificial Intelligence Time :1 Hour Subject code: MCA401 Maximum Marks :20
Q-1 What is Artificial Intelligence in your term? Explain in detail with example. 10
Q-2 Write BFS and DFS algorithm.Write down its pros and corns. 10 Which is more efficient?
Institute of Science & Technology Department Of MCA Session: Jan-June Unit Test-II MCA-IV SEM
Subject Code: MCA-401 Subject: Artificial Intelligence
Time:1 Hour Max Marks:20
Q-1 Write the Algorithm of A*. 10
Q-2 What is Predicate Logic. Convert Following in Predicate Logic and Clause form. 5
(i) If X is on top of Y, Y supports X. (ii) If X is above Y and they are touching each other, X is on top of Y. (iii) A cup is above a book. (iv) A cup is touching a book.
Q-3. What is Semantic net and frames. How they are different from each other 5 Institute of Science & Technology Department Of MCA Session: Jan-June 2010 MID SEM EXAMS-I Artificial Intelligence (MCA-401) MCA-IV SEM
Note: Attempt any five questions. Max Marks: 40 All questions carry equal marks Time: 2 hrs
Q-1 What do you mean by Artificial Intelligence in your terms? Write down the characteristic of AI Problem.
Q-2 (a) What is Production System? What are the types of Production system?
(b) Explain the Forward and backward chaining.
Q-3 Explain problem state space representation of tower of honni
Q-4 (a) Write an algorithm of Hill climbing? Write its problem with its Solution.
(b) Write an algorithm of BEST FRIST Search with an example. What is the difference between Hill climbing and best firs search.
Q-5 Solve the following constraint satisfaction problem.
S E N D + M O R E M O N E Y
Q-6 What do you mean by prenix normal form and skolem function. INSTITUTE OF SCIENCE & TECHNOLOGY, BHOPAL
SESSION JAN-JUNE, 2010
Department of MCA
Tutorial-1
Name Of Faculty: Anshu Shrivastava Sem : IV Subject: Artificial Intelligence Sub Code: MCA-401
Q1. Define artificial intelligence. Write characteristics of AI Applications.
Q2. Differentiate between LISP and other conventional programming languages.
Q 3. Write a recursive function in LISP to generate the factorial of Given Number.
Q 4. Describe all list manipulation functions. With the help of suitable Example.
Q 5. Describe the characteristic of A.I problem.
INSTITUTE OF SCIENCE & TECHNOLOGY, BHOPAL
SESSION JAN-JUNE, 2010
Department of MCA
Tutorial-2
Name Of Faculty: Anshu Shrivastava Sem : IV Subject: Artificial Intelligence Sub Code: MCA-401
Q 1. Write A* Algorithm.
Q 2. Explain Best first search Algorithm.
Q 3. Solve following problem using constraint satisfaction.
C R O S S + R O A D S D A N G E R
Q 4. Compare Forward and Back ward chaining.
Q 5. Write algorithm of constraint satisfaction problem.
Q 6. Explain Branch and Bound search technique with any suitable Example.
Q 7. Compare Hill climbing, steepest hill climbing and Best First Search. INSTITUTE OF SCIENCE & TECHNOLOGY, BHOPAL
SESSION JAN-JUNE, 2010
Department of MCA
Tutorial-3
Name Of Faculty: Anshu Shrivastava Sem : IV Subject: Artificial Intelligence Sub Code: MCA-401
Q1. Consider the following sentences: (i) John likes all kinds of food. (ii) Apples are food. (iii) Chicken is food. (iv) Anything anyone eats and isn’t killed by is food. (i) Bill eats peanuts and is still alive. (ii) Sue eats everything Bill eats.
(a)Translate these sentences into predicate logic. (b) Prove that John likes peanuts using backward chaining. (c) Convert into clause form. (d) Prove John likes peanuts using resolution.
Q 2. What is Solemnization, Explain with Example?
Q 3. Define horn clause with example.
Q 4. Write down the script of movie going.
Q 5. Write down the similarity and difference between semantic net and Frames?
INSTITUTE OF SCIENCE & TECHNOLOGY, BHOPAL
SESSION JAN-JUNE, 2010
Department of MCA
Tutorial-4
Name Of Faculty: Anshu Shrivastava Sem : IV Subject: Artificial Intelligence Sub Code: MCA-401
Q1. Describe all types of parsing techniques.
Q2. What is planning? Write its components.
Q3. Write algorithm of MINIMAX search.
Q4. What are the ATN and RNT?
Q5. What are the steps follows in natural language processing.
INSTITUTE OF SCIENCE & TECHNOLOGY, BHOPAL
SESSION JAN-JUNE, 2010 Department of MCA
Tutorial-5
Name Of Faculty: Anshu Shrivastava Sem : IV Subject: Artificial Intelligence Sub Code: MCA-401
Q1. Explain MYSIN Expert system.
Q2. Explain the life cycle of Expert System.
Q3. What are the different types of learning, explain in detail with example.
Q4. Explain Baye’s theorem with example.
Q5.