Question Bank

Subject Name: Artificial Intelligence & Machine Learning

Subject Code: 18CS71
Sem: VII

Module -1 Questions.

1. What is Artificial Intelligence? List the fields that form the basis for AI.
2. List the task domains of AI.
3. What are the 3 different ways of solving Tic-Tac-Toe Problem applying AI. Show the
improvements obtained from one over the other using better knowledge
representation.
4. How will we know if AI model developed is successful? Justify the criteria for
success.
5. How do you define a problem as a state-space search
6. Solve the Water Jug problem: you are given 2 jugs, a 4-gallon one and 3-gallon one.
Neither has any measuring maker on it. There is a pump that can be used to fill the
jugs with water. How can you get exactly 2 gallons of water into 4-gallon jug?
Provide Initial state, goal state, production rules and solution by applying the rules.
7. Solve the Water Jug problem: Given a full 5-gallon jug and an empty 2-gallon jug, the
goal is to fill the 2-gallon jug with exactly one gallon of water. Provide the initial and
goal state for the problem, production rules and solution by applying the rules.
8. Differentiate Informed & Uninformed search. Give examples.
9. Explain the following uninformed search strategies with examples. List their
advantages and disadvantages.
a) Breadth First Search. b) Depth First Search
10. What are Heuristic Search Techniques? List it’s advantages and disadvantages.
11. What is a Production System? Explain the categories of Production system.
12. List and explain briefly the various problem characteristics?
13. Provide algorithms for Simple Hill Climbing and Steepest Ascent Hill Climbing.
Differentiate simple hill Climbing and Steepest Hill climbing.
14. What are the problems encountered during hill climbing and what are the ways
available to deal with these problems? Explain with an example of Blocks Word
problem.

1|Page
 15. Explain the process of simulated annealing with algorithm. Differentiate simple hill
Climbing and Simulated Annealing.
16. Explain A* algorithm and find the shortest path from ‘a’ to ‘z’ using the following
graph using A*

17. Explain Problem reduction techniques with a suitable example.

18. Discuss AO* algorithm in detail with a suitable example.
19. Explain constraint satisfaction and solve the following Cryptarithmetic Problem
a) SEND b) CROSS
+ MORE +ROADS
= MONEY = DANGER
20. Discuss Means-End-Analysis search technique.

Module -2 Questions. (Concept Learning)

1. What do you understand by Concept Learning?

2. Define the following terms:
a. Version Space
b. Consistent Hypothesis
c. General Boundary

2|Page
 d. Specific Boundary
e. Concept
3. Write Find –S algorithm. List its applications and disadvantages.
4. Find maximally specific hypothesis for the following datasets using Find-S

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

Example Restaurant Meal Day Cost Target

Function
1 Sam’s Breakfast Friday Cheap Yes
2 Hilton Lunch Friday Expensive No
3 Sam’s Lunch Saturday Cheap Yes
4 Dennis Breakfast Sunday Cheap No
5 Sam’s Breakfast Sunday Expensive No

5. Write Candidate Elimination Algorithm. List its limitations.

6. Differentiate between Find-S and Candidate Elimination Algorithm

7. Trace the Candidate Elimination Algorithm for the hypothesis space H’ given
the sequence of training examples from following datasets.

a)

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

3|Page
 b)
Origin Make Color Decade Type Result
1 Japan Honda Blue 1980 Economy Yes
2 Japan Toyota Green 1970 Sports No
3 Japan Toyota Blue 1990 Economy Yes
4 USA Chrysler Red 1980 Economy No
5 Japan Honda White 1980 Economy Yes
6 Japan Toyota Green 1980 Economy Yes

8. Explain List-Then-Eliminate Algorithm

9. Explain the inductive biased hypothesis space and unbiased learner

10. With a neat diagram, explain how you can model inductive systems by equivalent
deductive systems

Module -3 Questions.

1. Construct decision tree for the following binary class dataset

4|Page
 2. Give decision trees to represent the following boolean functions:
(a) A ˄˜B
(b) A V [B ˄ C]
(c) A XOR B

3. Consider the following set of training examples:

Instance Classification a1 a2
1 + T T
2 + T T
3 - T F
4 + F F
5 - F T
6 - F T

(a) What is the entropy of this collection of training examples with respect to the
target function classification?

(b) What is the information gain of a2 relative to these training examples?

4. NASA wants to be able to discriminate between Martians (M) and Humans (H)
based on the following characteristics: Green {N, Y} , Legs {2,3} , Height {S,
T}, Smelly {N, Y}

Our available training data is as follows:

Species Green Legs Height Smelly

1 M N 3 S Y

2 M Y 2 T N

3 M Y 3 T N

4 M N 2 S Y

5 M Y 3 T N

5|Page
 6 H N 2 T Y

7 H N 2 S N

8 H N 2 T N

9 H Y 2 S N

10 H N 2 T Y

a) Greedily learn a decision tree using the ID3 algorithm and draw the tree.

b) (i) Write the learned concept for Martian as a set of conjunctive rules (e.g., if

(green=Y and legs=2 and height=T and smelly=N), then Martian; else if ... then
Martian;...; else Human).

4. Discuss Entropy in ID3 algorithm with an example

5. Compare Entropy and Information Gain in ID3 with an example.
6. Compare ID3 with Candidate-Elimination algorithm.

7. What type of problems are best suited for decision tree learning

8. Write the steps of ID3Algorithm

9. What are the capabilities and limitations of ID3
10. What are Artificial Neural Networks? What are the type of problems in which
Artificial Neural Network can be applied.
11. Demonstrate application of ANN in learning to steer an autonomous vehicle.
12. Explain the concept of a Perceptron with a neat diagram.
13. Discuss the Perceptron training rule. Under what conditions the perceptron rule
fails and it becomes necessary to apply the delta rule
14. What do you mean by Gradient Descent? Derive the Gradient Descent Rule with
explanations in each step.
15. What are the conditions in which Gradient Descent is applied. What are the
difficulties in applying Gradient Descent.
16. Differentiate between Gradient Descent and Stochastic Gradient Descent
17. Discuss Delta Rule.

6|Page
 18. Why are Multi-Layer Networks preferred over single layer networks?
19. Write the algorithm for Back propagation.
20. Derive the Backpropagation rule considering the training rule for Output Unit
weights and Training Rule for Hidden Unit weights
21. What is Differential threshold unit? Write the Sigmoid or Squashing Function.

Module -4 Questions.

1. Explain the concept of Bayes theorem with an assumed example.

2. Explain Posterior Probability, Conditional Probability and Prior Probability
3. Explain MAP hypothesis HMAP and Maximum Likelihood HML Hypothesis learning
in Bayesian Classifier
4. What are the various features of Bayesian Learning
5. What is conditional Independence or Naïve Bayes Assumption?
6. Explain Naïve Bayes Classifier with an Example.
7. Classify the following using Naïve Bayesian classifier

Chills Runn Head Fever Flu?

Y N
y nose Mild
ache Y No
Y Y No N Yes
Y N Strong Y Yes
N Y Mild Y Yes
N N No N No
N Y Strong Y Yes
N Y Strong N No
Y Y Mild Y Yes

Given the data for symptoms and whether patient have flu or not, classify following:
x = (chills = Y, runny nose = N, headache = mild, fever = Yes)

8. Compute Posterior Probabilities of the classes using Naïve Bayes for the following
dataset

7|Page
8|Page