UNIT-I
1.List and explain the issues in the design of Search Programs.
2 List and explain the different types of AI techniques.
3 Discuss the Characteristic of the AI problem. Can Towers of Hanoi
Problem be considered as AI Problem? Justify your answer with
suitable discussions.
4a List and Explain Characteristics of a problem.
4b What is production system explain in detail.
5a Explain control strategies for productions systems.
5b Describe Physical symbol hypothesis.
6a State and Explain various AI Problems.
6b Explain a simple approach to play Tic-Tac-Toe Problem.
7 What is the importance of Heuristics? Describe with example.
8 Explain the state space representation of water-Jug Problem.
9 Discuss the implementation of depth first search.
10 Write the implementation of Breadth First Search.
UNIT - 2
1a Write the step-by-step procedure for Best-First search.
1b What is a heuristic search and explain A* algorithm?
2 Discuss scripts with example.
3 Elaborate different heuristic search techniques. Give examples for
each.
4 What are the issues in Knowledge Representation? Explain in
detail.
5 Explain Frames with example.
6 Explain AO* Algorithm with example
7 How can we avoid local maxima, ridge and plateau in Hill
climbing.
8 Evaluate constraint satisfaction problem with an algorithm for
solving a cryptarithmetic problem.
9a Explain about conceptual dependency.
9b Explain CYC with example.
10 Explain Briefly about Means-End-Analysis
UNIT - 3
1a) Compare and contrast the forward Vs. Backward reasoning.
b) Explain the computable functions and Predicates.
2 Discuss the syntax and semantics of first-order logic in detail.
3 With examples explain how to represent simple facts in predicate
logic?
4 Consider the following sentences:
1. John likes all kinds of food.
2. Apples are food.
3. Chicken is food.
4. Anything anyone eats and isn’t killed by is food.
5. Bill eats peanuts and is still alive.
6. Sue eats everything Bill eats.
Translate above sentences into predicate logic formulae.
5a) Compare and Contrast Procedural Vs Declarative Knowledge
b) What is matching? Discuss matching proposals with examples.
6 Describe the Representing Instance and ISA Relations.
7 Discuss SOAR AI system.
8 Explain PRODIGY problem solving system.
9 What is Resolution? Explain resolution in propositional logic with
illustration.
10 Explain Briefly about Natural Deduction.
UNIT - 4
1 Explain components of a planning system.
2a) Describe MiniMax search procedure with example.
b) Define Statistical reasoning .Explain Bayes theorem with an
example.
3 Discuss Goal Stack planning with the help of an example.
4 Explain Planning and how it is important for artificial intelligence.
5 Explain Rule based System.
6 Explain Bayesian networks in detail.
7a) What do you mean by probabilistic reasoning? Explain with an
example.
b) Differentiate between statistical reasoning and probabilistic
reasoning.8a) What is STRIPS? Describe STRIPS with example.
b) Why does the search in game-playing programs always proceed
forward from the current position rather than backward from goal
state?
9 a) What is game playing? Explain Alpha – Beta cut off with example.
b) Describe blocks world problems with examples.
10 Demonstrate the game playing strategies
UNIT - 5
1 Write about different components of Artificial Neural Networks.
2 Discuss different activation functions used in ANN.
3 Explain Perceptron with the help of diagram.
4 Describe Perceptron for OR function.
5 Paraphrase Multi-Layer Feed-Forward Networks.
6 Explain neural network architecture.
7 Write the learning algorithm for perceptron.
8 Discuss Back-propagation algorithm.
9.Write short notes on:
i. Weight Updation rule ii. stopping criteria
10 Write the limitations of perceptron.
