DEPARTMENT OF COMUTER SCIENCE & ENGINEERING

SEM:VII
SUB: Artificial Intelligence & Machine Learning
CODE:18CS71

MODULE-1

1) What is an Artificial Intelligence? Explain some of the task domains of Artificial Intelligence.
2) What is an AI technique? Explain the following two different problems.
a. Tic-Tac-Toe
b. Question answering.
3) Explain in detail the Level of the AI Model.
4) Discuss the problem as a state space search. explain Water Jug Problem.
5) Write the algorithm for Breadth-first search and Depth –first search. With its advantages.
REFER ALL REAMINING FIRST ASSIGNEMENT QUESTIONS.

MODULE-2
6) Define Knowledge Representation . Illustrate Mapping between Facts and Representations.

7) Discuss the four properties to represent the Knowledge for a particular domain.

8) Discuss Inheritable Knowledge in detail with a diagram.

9) Distinguish between Inferential Knowledge and Procedural knowledge.

10) Briefly discuss several issues that are occurs in Knowledge representation.

11) Consider the following sentences.

i. Marcus was a man

ii. Marcus was a Pompeian.
iii. All Pompeians were Romans
iv. Caesar was a ruler.
v. All Romans were either loyal to Caesar or hated him.
vi. Everyone is loyal to someone.
vii. People only try to assassinate rulers they are not loyal to.
viii. Marcus tried to assassinate Caesar
a) Translate these sentences into formulas in predicate logic
b) Prove was Marcus loyal to Caesar?
12) Consider the following sentences.
i. Marcus was a man.
ii. Marcus was a Pompeian.
iii. Marcus was born in 40 A.D
iv. All men are mortal.
v. All Pompeians died when the volcano erupted in 79 A.D
vi. No mortal lives longer than 150 years.
vii. It is now 1991.
viii. Alive means not dead.
ix. If someone dies, then he is dead at all later times.
a) Translate these sentences into formulas in predicate logic.
 b) Answer the question “Is Mascus alive?”
13) What is Resolution? Convert the following sentence into a Clause Form
All Romans who knows Marcus either hate Caesar or think that anyone who hates anyone is
crazy.
14) Write an Algorithm for Resolution in Propositional logic. Use the same algorithm to prove R for the
following axioms.

P
(P Ʌ Q)→R (S
V T) →Q
¬T VQ
T

15) Write an Algorithm for Resolution in Predicate logic. consider the following sentences.
i. Marcus was a man
ii. Marcus was a Pompeian.
iii. All Pompeians were Romans
iv. Caesar was a ruler.
v. All Romans were either loyal to Caesar or hated him.
vi. Everyone is loyal to someone.
vii. People only try to assassinate rulers they are not loyal to.
viii. Marcus tried to assassinate Caesar.
a) Did Marcus hate Caesar? (Use resolution Predicate logic to prove)
16) Define Concept learning . Explain the task of Concept learning.

17) How the Concept learning can be viewed as the task of searching? Explain.

18) Discuss Find-S algorithm to find Maximally specific Hypothesis for the training example given
below.(Table –1)

Example Sky AirTemp Humidity Wind Water Forecast Enjoysport

1 Sunny Warm Normal Strong Warm Same Yes
2 Sunny Warm High Strong Warm Same Yes
3 Rainy Cold High Strong Warm Change No
4 Sunny Warm High Strong Cool Change Yes
Table-1

Example Shape Size Color Surface Thickness Target

1 Circular Large Light Smooth Thick Malignant
2 Circular Large Light Irregular Thick Malignant
3 Oval Large Dark Smooth Thin Benign
4 Oval Large Light Irregular Thick Malignant
5 Circular Small Light Smooth Thick Benign
(Note: Malignant is +ve, Benign is -ve) Table-2

19) Discuss Candidate-elimination algorithm to find Maximally specific Hypothesis and

Maximally General Hypothesis for the Table-1 and Tabe-2.(REFER CLASS NOTES)
20) Explain the concept of Inductive Bias.
 MODULE -3
1. Define Artificial Neural network. Explain biological learning system and representation of neural network.
2. Define Perceptron. Explain representational power of Perceptrons.
3. Describe the derivation of Back Propagation rule.
4. Discuss the Perceptron trainin rule, Gradient Descent and Delta rule.
5. Explain Back Propagation algorithm and remarks of Back propagation algorithm.
6. Explain the concept of decision tree. Discuss appropriate problem for decision tree learning.
7. Write an ID3 algorithm for decision tree.
8. What do you mean by gain entropy? How it is used to build the decision tree?
9. Apply ID3 algorithm for constructing decision tree for the following training example.(Refer class notes)

Day Outlook Temperature Humidity Wind Paly Tennis

D1 Sunny Hot High Weak No
D2 Sunny Hot High Strong No
D3 Overcast Hot High Weak Yes
D4 Rain Mid High Weak Yes
D5 Rain Cool Normal Weak Yes
D6 Rain Cool Normal Strong No
D7 Overcast Cool Normal Strong Yes
D8 Sunny Mid High Weak No
D9 Sunny Cool Normal Weak Yes
D10 Rain Mid Normal Weak Yes
D11 Sunny Mild Normal Strong Yes
D12 Overcast Mid High Strong Yes
D13 Overcast Hot Normal Weak Yes
D14 Rain Mild High Strong No

MODULE -4
1. Explain Navie Bayes Classifier and Bayseian Belied Networks.
2. List and explain features of Bayesian learning methods.
3. Explain Brute force MAP learning algorithm.
4. Explain maximum likelihood and least squared error hypothesis.
5. Discuss minimum description length principal and Gibbs algorithm in brief.
6. Estimatmate conditional probabilities of each attribute {color, legs, height, smelly} for the species
class:{M, H} using the data given in the table. Using those probabilities estimate the probability values for
new instances {color= green , legs = 2, height = tall and smelly =NO}

No Color Legs Height Smelly Species

1 White 3 Short Yes M
2 Green 2 Tall No M
3 Green 3 Short Yes M
4 White 3 Short Yes M
5 Green 2 Short No H
6 White 2 Tall No H
7 White 2 Tall No H
8 White 2 Short Yes H

(Practice with different data problems. Refer class notes)

 MODULE-5
1. What is instance based learning? Explain K-nearest neighbor algorithm.
2. Explain case based reasoning with example.
3. What is Reinforcement? How reinforcement learning problem differ from other function approximation
tasks.

4. Explain the following in detail.

a. Q-learning.
b. Radial basis function
c. Locally weighted regression
d. Reinforcement learning
e. Q-function.
f. Algorithm for Q- learning.