IMP Differences & Definition: 1) 2) 3) 4) 5) 6) 7) 8) Compare: Un-informed Vs Informed Searching Techniques. (M- 4) Compare: BFS Vs DFS. (M- 4) Compare: PL Vs FOL. (M- 4) Compare: Forward Vs Backward Reasoning. (M- 4) Compare: Expert System Vs Traditional System. (M- 4) Compare: Procedural Vs Declarative Knowledge. (M- 3) Compare: Supervised Vs Unsupervised Learning. (M- 3) Compare: Fuzzy Ws Crisp Logic. (M- 3)| 1) Introduction: 1) What is AI? Define different task domain of AI? (M- 4) 2) What is Artificial Intelligence? Explain application of AI. (M- 7) 3) Explain Turing test. (M- 3) 4) Define: Modus Ponens, Horn Clause, Existential Quantifier. (M- 3)2) Problems, State Space Search & Heuristic Search Technique: 1) What is production system? Discuss the component of it. (M- 4) 2) Write an algorithm for the BFS (Breadth First Search). (M- 3) 3) Why hill climbing is better than generate & test? Write algorithm for simple hill climbing. (M- 4) 4) Explain the state space search with the use of 8 Puzzle Problem. (M- 7) 5) Explain Al Problem characteristics in details. (M- 7) 6) What is Heuristic Search? Discuss with an example. (M- 3) 7) Explain Problem Reduction using “AND-OR" graph. (M- 4) 8) Define Constraint Satisfaction Problems? Explain constraint propagation algorithm using example. (M- 7) 9) Explain Limitations of Hill Climbing: 1) Local Maximum 2) Plateau 3) Ridge. (M- 3) 10) Explain Water Jug Problem With Example. (M- 7) 11) Discuss and Analyze Tower of Hanoi problem with respect to the seven problem characteristics. (M- 7) 12) What is State Space of a Problem? (M- 3)3) Knowledge Representation: 1) Write & explain algorithm for resolution in propositional logic with suitable example. (M- 7) 2) Explain various method of knowledge representation with example. (M- 7) 3) Explain the different issues in Knowledge representation. (M- 4) 4) Explain Semantic Net & Frame with suitable example. (M- 7) 5) Explain the steps of unification in predicate logic. (M- 4) 6) What are the limitations of Propositional Logic? (M- 4) 7) Explain Forward Reasoning and Backward Reasoning with example. (M- 7)4) Symbolic Reasoning Under Uncertainty: 1) Write a short note on Non monotonic Reasoning. (M- 4) 2) List out the property of Non monotonic reasoning. (M- 3) 3) What is Non monotonic Reasoning? Explain logics for it. (M- 7)5) Probabilistic Reasoning: 1) Explain Probability & Bay's Theorem. (M- 3) 2) State the Bayes theorem. Illustrate how a Bayesian Network can be used to represent causality relationship among attributes. Enlist Bayesian Application. (M- 7) 3) A bag I contains 4 white and 6 black balls while another Bag II contains 4 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. (M- 4) 4) The task is to recognize English alphabetical characters (F, E, X, Y, I, T) in an image processing system. Define two fuzzy sets [ and F to represent the identification of characters I and F. [={(F, 0.4), (E, 0.3), (X, 0.1), (¥, 0.1), (, 0.9), (T, 0.8)} F={(F, 0.99), (E, 0.8), (X, 0.1), CY, 0.2), (1, 0.5), (T, 0.5)} 04 2 Find the following. 1) UF 2)f ~P. (M-7) 5) What is Certainty factor? (M- 4) 6) Write about various defuzzification methods. (M- 4)7) Planning: 1) Explain the components of Planning System. (M- 4) 2) Explain planning problem. (M- 3) 3) Explain how planning is different from search procedure? (M- 3)8) Natural Language Processing: 1) Explain Morphological & Syntax Analysis phases of NLP. (M- 4) 2) Explain Steps / Phases of Natural Language Processing (NLP). (M- 4) 3) Briefly explain any one application of Natural Language Processing. (M- 3) 4) Write short note: NLP. (M- 7)9) Connectionist Models: 1) Briefly explain Perceptron. (M- 3) 2) Explain Hopfield Network. (M- 3) 3) Explain Artificial Neural Network (ANN). (M- 7) 4) Explain Backpropagation algorithm in Neural Network. (M- 7)10) Expert System: 1) Explain the architecture of Expert System with appropriate diagram. (M- 7) 2) Explain Expert System Shells. (M- 3) 3) Define Expert Systems. List it's 4 Applications. (M- 3)11) Genetic Algorithm: 1) Explain about the basic operators in Genetic Algorithms. (M- 4) 2) Explain Various Types of Cross Over Operators in Genetic Algorithm. (M- 7) 3) Describe the phases of genetic algorithm (GA). (M- 7) 4) Explain Roulette-Wheel selection method of genetic algorithm (GA). (M- 7) 5) Working principle of GA. (M- 4) 6) List out Genetic Operators. Describe briefly. (M- 4)12) Introduction to Prolog: 1) Demonstrate the use of Repeat Predicate in Prolog with example. (M- 4) 2) Write Prolog program: (1) To find Factorial of a given number, (2) To find the n‘® element of given list. (M- ” 3) Write a prolog program to find minimum number from the given input list. (M- 7) 4) Explain Cut and Fail Predicate (in Prolog) With Example. (M- 4) 5) Write a Prolog program to merge two sequentially ordered (ascending) lists into one ordered list. (M- 7) 6) Write Prolog program to append two given lists into third. (M- 3)6) Game Playing: 1) Explain the Minimax Search procedure for Game Playing. Explain a & i cut offs to improve the performance ‘of Minimax procedure. (M- 7) 2) Simulate the working of Tic-tac-toe problem with Minimax technique. (M- 7) 3) Explain Minimax search procedure. (M- 4) 4) Show the use of Alpha-Beta pruning. (M- 4) 5) How Minimax Search Procedure work. (M- 4)