Typ GUJARAT TECHNOLOGICAL UNIVERSITY Bachelor of Computer Engineering Subject Code: 3170716 Semester ~ VII Subject Name: Artificial Intelligence eof course: Regular Prerequisite: Data Structures, Mathematics Rationale: With the usage of Internet and World Wide Web increasing day by day, the field of AT and its techniques are being used in many areas which directly affect human life. Various techniques for encoding knowledge in computer systems such as Predicate Logic, Production rules, Semantic networks find application in real world problems. The fields of AI such as Game Playing, Natural Language Processing, and Connectionist Models are also important. Student should know some programming language for AL ‘Teaching and Examination Scheme: Teaching Scheme | Credits Examination Marks Total cy] Tt P c Theory Marks Practical Marks Marks ESEE) PAM) ESE(V) [| PA@ 3 oO 2 4 70 30 30 20 150 Contents: Sr. Content Total No. Hrs 1, | Introduction : The AI Problems, The Underlying Assumption, AT techniques, The Level | 2 oof The Model, Criteria For Success Problems, State Space Search & Heuristic Search Techniques: Defining The Problems | 6 As A State Space Search, Production Systems, Production Characteristics, Production 2_ | System Characteristics and Issues in the Design of Search Programs, Generate-And-Test, Hill Climbing, Best-First Search, Problem Reduction, Constraint Satisfaction, Means-Ends Analysis, ‘Knowledge Representation: Representations And Mappings, Approaches To Knowledge | 7 4 | Representation, Representation Simple Facts In Logic, Representing Instance And Isa Relationships, Computable Functions and Predicates, Resolution, Procedural versus Declarative Knowledge, Logic Programming, Forward versus Backward Reasoning. ‘Symbolic Reasoning Under Uncertainty: Introduction To Nonmonotonic Reasoning, | 2 4 “ Logies For Non-monotonic Reasoning. = | Probabilistic Reasoning: Probability And Bays’ Theorem, Certainty Factors And Rule- | 3 > | Base Systems, Bayesian Networks, Dempster-Shafer Theory, Fuzzy Logic ¢ | Game Playing: Overview, MiniMax Search Procedure, Alpha-Beta_ Cut-ofls, [2 Refinements, lerative deepening. 7 | Planning: The Blocks World, Components OF a Planning System, Goal Stack Planning, | 3 Nonlinear Planning Using Constraint Posting, Hierarchical Planning, Reactive Systems 8 | Natural Language Processing: Introduction, Syntactic Processing, Semantic Analysis, | 3 Discourse And Pragmatic Processing, Spell Checking Page 1 of 3 wef. AY 2018-19GUJARAT TECHNOLOGICAL UNIVERSITY Bachelor of Computer Engineering Subject Code: 3170716 9 | Connectionist Models: Introduction: Hopfield Network, Learning In Neural Network, | 4 Application Of Neural Networks, Recurrent Networks, Distributed Representations, Connectionist AI And Symbolic AL 10 | Expert Systems: Representing and Using Domain Knowledge, Expert System Shells, | 2 Explanation, Knowledge Acquisition. I1 | Genetic Algorithms: A Peek into the Biological World, Genetic Algorithms (GAs). [4 Significance of the Genetic Operators, Termination Parameters. 12 | Introduction to Prolog: Introduction, Converting English to Prolog Facts and Rules, [4 Goals, Prolog Terminology, Variables, Control Structures, Arithmetic Operators, Matching in Prolog, Backtracking, Cuts, Recursion, Lists, Suggested Specification table with Marks (Theory): Distribution of Theory Marks R Level ULevel ALevel NLevel_ | ELevel_ | CLevel 10 20 20 10 05 05 Legends: R: Remembrance; U: Understanding; A: Application, N: Analyze and E: Evaluate C: Create and above Levels (Revised Bloom’s Taxonomy) Note: This specification table shall be treated as a general guideline for students and teachers. The actual distribution of marks in the question paper may vary slightly from above table. Reference Books: 1. “Artificial Intelligence” 2. “Antficial Intelligence: A Modem Approach” -By Stuart Russel, Peter Norvig, PHI 3. “Introduction to Prolog Programming” -By Carl Townsend. 4. “PROLOG Programming For Artificial Intelligence” -By Ivan Bratko( Addison-Wesley) 5. “Programming with PROLOG” -By Klocksin and Mellish. Course Outcomes: ‘By Elaine Rich And Kevin Knight 2nd Edition) Tata Megraw-Hill Sr. | CO statement ‘Marks % No. weightage (CO-1_| Understand the search technique procedures applied to real world problems 25 (CO-2__| Understand and use various types of logic and knowledge representation schemes. 30 CO-3_| Understand various Game Playing techniques and apply them in programs. 15 ‘CO-4_| Gain knowledge in Al Applications and advances in Artificial Intelligence 20 (CO-5__[ Use Prolog Programming language using predicate logic 10 ents: Sample List of Exper 1. Write a program to implement Tic-Tac-Toe game problem. 2. Write a program to implement BFS (for 8 puzzle problem or Water Jug problem or any AI search problem) Page? of 3 wef. AY 2018-19GUJARAT TECHNOLOGICAL UNIVERSITY Bachelor of Computer Engineering Subject Code: 3170716 Write a program to implement DFS (for 8 puzzle problem or Water Jug problem or any AI search problem) Write a program to implement Single Player Game (Using any Heuristic Function) Write a program to Implement A Algorithm, we Write a program to implement mini-max algorithm for any game development. Assume given a set of facts of the form father(name name2) (name! is the father of name2). 8. Define a predicate brother(X,Y) which holds iff X and Y are brothers. Define a predicate cousin(X,Y) which holds iff X and Y are cousins. Define a predicate grandson(X,Y) which holds iff X is a grandson of Y. Define a predicate descendent(X,Y) which holds iff X is a descendent of Y. Consider the following genealogical tree: father(a,b). father(a.c). father(b.d) father(b.). father(c.t). Say which answers, and in which order, are generated by your definitions for the following queries in Prolog: 2- brother(X,Y), cousin(X,¥), ?- grandson(X,Y). 2 descendent(X.Y). 9, Write a program to solve Tower of Hanoi problem using Prolog. 10, Write a program to solve N-Queens problem using Prolog. 11, Write a program to solve 8 puzzle problem using Prolog. 12, Write a program to solve travelling salesman problem using Prolog, List of Open Source Software/learning website: |https://nptel.ac.in/courses/106/105/106105077/ http://www.journals.elsevier.com/artificial-intelligence/ Page 3 of 3 wef. AY 2018-19Seat N Enrolment No., GUJARAT TECHNOLOGICAL UNIVERSITY BE - SEMESTER-VII (NEW) EXAMINATION ~ WINTER 2021 Subject Code:3170716 Date:13/12/2021 Subject Name: Artificial Intelligence Time:10:30 AM TO 01:00 PM Total Marks: 70 1. Attempt all questions. 2. Make suitable assumptions wherever necessary. 3. Figures to the right indicate full marks. 4. Simple and non-programmable scientific caleulators are allowed. Q.1 (a) Whatis a “control strategy” and what are its characteristics? 03 (b) Describe in brief how Min-Max search procedure works. 04 (©) Enlist and discuss major task domains of Artificial Intelligence. 07 Q.2 (a) Discuss briefly backward reasoning with example. 03 (b) Explain with example how recursive predicate is defined in Prolog? 04 (©) State Water Jug problem. Give its state space representation 07 OR © A‘ algorithm. What happens if h’ underestimates h and 07 overestimates h? Q3 ain local maxima, plateau and ridge in brief 03 scuss the approaches to knowledge representation 4 (©) Demonstrate briefly the steps to convert given wff into clause form 07 OR Q3- (a) Differentiate Informed & Uninformed search. Give examples. 03 (b) Explain best first search algorithm, 04 (©) Consider the following facts: 07 ® Hemant only likes easy courses. * Science courses are hard. * All the courses in basketweaving department are easy. * BK301 is a basketweaving course. Use resolution to answer the question,” What course would Hemant like?” Q4 (a) Whats certainty factor? 03 (b) Discuss Bayesian network and its application. 04 (c) Explain connectionist models. What is perceptron? What is the concept. 07 of back propagation for ANNs? OR Q4 (a) Whatdo you mean by Expert Systems? List out its fourapplications. 03 (b) Discuss Goal Stack planning 4 (©) Write about various defuzzification methods 07 Q.5. (a) Discuss cut and fail predicate in prolog 03 (b) Describe working principle of Genetic Algorithm 04 (©) What is nonmonotonic reasoning? Explain logics for nonmonotonic 07 reasoning. OR QS (a) Write a prolog program to append two given lists into third 03 (b) List out the genetic operators. Describe them briefly 04 (©) Write a note on Natural Language Processing 07Seat N Enrolment No., GUJARAT TECHNOLOGICAL UNIVERSITY BE - SEMESTER-VII (NEW) EXAMINATION — WINTER 2022 Subject Code:3170716 Date:05-01-2023 Subject Name: Artificial Intelligence Time: 10:30 AM TO 01:00 PM Total Marks:70 Instructions: 1. Attempt all questions. 2. Make suitable assumptions wherever necessary. 3. Figures to the right indicate full marks. 4. Simple and non-programmable scientific calculators are allowed. Marks QA (a) Explain Turing test. 03 (b) What is production system? Discuss the component of production system. 04 (c) What is artificial intelligence? Explain application of AL 07 Q2 (a) Write an algorithm for the breadth first search. 03 (b) Why hill climbing is better than generate and test? Write algorithm for 04 simple hill climbing. (©) Explain the state space search with the use of 8 Puzzle Problem 07 OR (©) Explain AI Problem characteristics in detail. 07 Q.3. (a) What is heuristic search? Discuss with an example. 03 (b) Explain Problem Reduction using “AND-OR" graph. 04 (©) What do you mean by constraint satisfaction problems? Explain constraint 07 propagation algorithm using suitable example. OR Q.3. (a) Differentiate procedural and declarative knowledge. 03 (b) Write a short note on non monotonic reasoning. 04 (©) Write and explain algorithm for resolution in propositional logic with 07 suitable example. Q4 (a) Explain forward and backward reasoning, 03 (b) Demonstrate the use of Repeat Predicate in Prolog with example. 04 (c) Explain the various method of knowledge representation with suitable 07 example. OR Q4 (a) Briefly explain perceptron. 03 (b) Explain morphological and syntax analysis phases of NLP. 04 (©) Explain the architecture of expert system with suitable sketch, 07 Q.5 (a) Explain Probability and Bay’s Theorem, 03 (b) Explain the components of planning system. 04 (©) Explain the MiniMax search procedure for Game Playing. Also explain 07 alpha and Beta cut-offs to improve the performance of MinMax procedure. OR Q.5 (a) Explain supervised and unsupervised learning. 03 (b) Explain about the basic operators in genetic algorithms. 04 (©) Write following prolog programs: 07 1) To find factorial of a given number. 2) To find the n'” element of a givenSeat N Enrolment No., GUJARAT TECHNOLOGICAL UNIVERSITY BE - SEMESTER-VII (NEW) EXAMINATION - SUMMER 2022 Subject Code:3170716 Date:03/06/2022 Subject Name: Artificial Intelligence Time:02:30 PM TO 05:00 PM Total Marks: 70 Instruction 1. Attempt all questions. 2. Make suitable assumptions wherever necessary. 3. Figures to the right indicate full marks. 4. Simple and non-programmable scientific caleulators are allowed. QL (a) Define Al, What are the task domains of AI? 03 (b) Explain Water Jug problem with Sate Space Search method. 04 (©) Explain Best First Search with suitable example. 07 Q.2 (a) Define the following. 03 1, Modus Ponens 2. Horn Clause 3. Existential Quantifier (b) Explain Semantic Net with example. 04 (c) Consider the following sentene: 07 «Rita likes all kinds of food. * Apples are food. * Anything anyone eats and isn’t killed by is food. # Rahi eats peanuts and is still alive. # Tanvi eats everything Rahi eats. i, Translate these sentences into formulas in predicate logic. ii, Use resolution to answer the question, “What food does Tanvi eat?” OR (©) Explain Forward Reasoning and Backward Reasoning with example. 07 Q.3 (a) Explain Expert System Shell with example. 03 (b) Explain MiniMax search procedure. 04 (©) Explain Artificial Neural Network. 07 oR Q.3° (a) Draw and explain architecture of Expert System. 03 (b) Show the use of Alpha-Beta pruning. 04 (©) Explain Backpropagation algorithm in Neural Network. 07 Q4 (a) Briefly explain any one application of Natural Language Processing. 03 (b) A bag I contains 4 white and 6 black balls while another Bag II contains 4 04 white and 3 black balls. One ball is drawn at random from one of the bags, and it is found to be black. Find the probability that it was drawn from Bag 1 (©) Explain Roulette-Wheel selection method of genetic algorithm. 07 OR Q.4 (a) Enlist and describe different phases involved in Natural Language 03 Processing. (b) The task is to recognize English alphabetical characters. (F_E,X, ¥,1,.7) 04 in an image processing system. Define two fuzzy the identification of characters I and F. T=(F, 04), (E, 0.3), (X, 0.1), (¥, 0.1), (2, 0.9), (T, 0.8)} 0.8), (X, 0.1), (¥, 0.2), (I, 0.5), (T, 0.5)} s 7 and F to representQs Qs © (a) (b) (© (a) (b) © Find the following. 1 TuF 2.1-F Describe the phases of genetic algorithm, Explain planning problem Explain limitations of Hill Climbing algorithm. Explain Cut and Fail predicates in Prolog. OR Explain how planning is different from search procedure? Compare DFS and BFS. Write a Prolog program to merge two sequentially ordered (ascending) lists into one ordered list. gS SEs SEE