lOMoARcPSD|35498024

AIML Qn Bank 1

Artificial Intelligence and Machine Learning (Anna University)

Scan to open on Studocu

Studocu is not sponsored or endorsed by any college or university

Downloaded by Jayasri S (sjayasri.cse@gmail.com)
 lOMoARcPSD|35498024

GOJAN SCHOOL OF BUSINESS AND TECHNOLOGY

DEPARTMENT OF INFORMATION TECHNOLOGY
CS3491 – ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING
UNITWISE IMPORTANT QUESTIONS

UNIT I PROBLEM SOLVING

Introduction to AI - AI Applications - Problem solving agents – search algorithms –
uninformed search strategies – Heuristic search strategies – Local search and optimization
problems – adversarial search – constraint satisfaction problems (CSP)

1.Define Artificial Intelligence? What are the four approaches of AI? List and explain
the various Applications of Artificial Intelligence.
Acting humanly, Thinking humanly, Thinking rationally, Acting rationally.
2. What is an agent? Explain in detail, the different intelligent agents.
Simple reflex agents, Model-based reflex agents, Goal-based agents, Utility-based agents,
Learning agents.
3. i. Explain in detail about problem solving agent with example in detail.
ii.. How to define a problem as state space search? Discuss it with an example
8 puzzle problem
4. What are uninformed search (Blind search) strategies? Explain in details with
example.
5. Explain the different types of informed (Heuristic search) strategies with example.
6. i. Explain the different types of local search techniques
1.Hill-climbing Search, 2.Simulated Annealing, 3.Local Beam Search
ii. Explain the various types of hill climbing search techniques?
Simple hill climbing, Steepest-ascent hill climbing, Stochastic hill climbing, Random-
restart hill climbing
7. i. Explain in detail about Adversarial Search and its types
1.Minimax Algorithm 2.Alpha – Beta Pruning
ii. Explain alpha-beta pruning algorithm and the Minmax game playing algorithm
with example?
8. i..Explain in detail about constraint satisfaction problems (CSP) with an Suitable
example
CryptArithmetic problems, n-Queen, Map Coloring, Crossword, Latin Square Problem
ii.Solve the following Crypt arithmetic problem using constraints satisfaction search
procedure.
CROSS
+ROADS
------------
DANGER
-------------

Downloaded by Jayasri S (sjayasri.cse@gmail.com)

 lOMoARcPSD|35498024

PART C - PROBLEMS

1. Consider a Water Jug Problem : You are given two jugs, a 4-gallon one and a 3-gallon one.
Neither has any measuring markers 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 the 4-gallon jug ? Explicit
Assumptions: A jug can be filled from the pump, water can be poured out of a jug onto the
ground, water can be poured from one jug to another and that there are no other measuring
devices available.

2.Vaccum Cleaner Problem, 8 queen problem

2. Solve the following Crypt arithmetic problem using constraints satisfaction search
procedure.
EAT
+ THAT
=A P P L E

SEND
+ MORE
= MONEY

3. The missionaries and cannibals problem is usually stated as follows. Three missionaries and
three cannibals are on one side of a river, along with a boat that can hold one or two people.
Find a way to get everyone to the other side without ever leaving a group of missionaries in
one place outnumbered by the cannibals in that place. This problem is famous in AI because
it was the subject of the first paper that approached problem formulation from an analytical
viewpoint (Amarel, 1968).
a. Formulate the problem precisely, making only those distinctions necessary to ensure a valid
solution. Draw a diagram of the complete state space.
b. Implement and solve the problem optimally using an appropriate search algorithm. Is it a
good idea to check for repeated states?
c. Why do you think people have a hard time solving this puzzle, given that the state space is
so simple?

4. The traveling salesperson problem (TSP) can be solved with the minimum-spanningtree
(MST) heuristic, which estimates the cost of completing a tour, given that a partial tour has
already been constructed. The MST cost of a set of cities is the smallest sum of the link costs
of any tree that connects all the cities.
a. Show how this heuristic can be derived from a relaxed version of the TSP.
b. Show that the MST heuristic dominates straight-line distance.
c. Write a problem generator for instances of the TSP where cities are represented by random
points in the unit square.
d. Find an efficient algorithm in the literature for constructing the MST, and use it with A∗
graph search to solve instances of the TSP.

UNIT II PROBABILISTIC REASONING

Acting under uncertainty – Bayesian inference – naïve bayes models. Probabilistic reasoning
– Bayesian networks – exact inference in BN – approximate inference in BN – causal networks

1. Explain the concept of uncertainty and acting under uncertainty with suitable example
2. Explain in detail about Bayesian inference and Naive Bayes Model or Naive Bayes
Theorem or Bayes Rule
3. i. How to get the exact inference form Bayesian network?
1.Inference by enumeration 2.Variable Elimination Algorithm 3.Time and Space
Complexity 4.Clustering
Downloaded by Jayasri S (sjayasri.cse@gmail.com)
 lOMoARcPSD|35498024

ii. Explain variable elimination algorithm for answering queries on Bayesian networks?

4. How to get the approximate inference from Bayesian network.

1. Direct sampling methods 2. Rejection sampling in Bayesian networks 3. Inference by
Markov chain simulation 4. The MCMC algorithm
5. Explain Causal Network or Causal Bayesian Network in Machine
6. Discuss about Bayesian Theory and Bayesian network.

PART C – PROBLEMS
1. Construct a Bayesian Network and define the necessary CPTs for the given scenario. We
have a bag of three biased coins a,b and c with probabilities of coming up heads of 20%, 60%
and 80% respectively. One coin is drawn randomly from the bag (with equal likelihood of
drawing each of the three coins) and then the coin is flipped three times to generate the
outcomes X1, X2 and X3.

a.Draw a Bayesian network corresponding to this setup and define the relevant CPTs.
b.Calculate which coin is most likely to have been drawn if the flips come up HHT

2.Burglary problem
P(Burglary | JohnCalls =true,MaryCalls =true) . Perform the calculations indicated and check
that the answer is correct.

UNIT III SUPERVISED LEARNING

Introduction to machine learning – Linear Regression Models: Least squares, single &
multiple variables, Bayesian linear regression, gradient descent, Linear Classification
Models: Discriminant function – Probabilistic discriminative model - Logistic regression,
Probabilistic generative model – Naive Bayes, Maximum margin classifier – Support vector
machine, Decision Tree, Random forests.

1. Define Machine Learning. Explain the Classification of Machine Learning.

2. Explain in detail about Linear Regression Models.
1.Least squares, single & multiple variables, 2.Bayesian linear regression, 3.Gradient
descent.
3. Explain the principle of the gradient descent algorithm. Accompany your explanation
with a diagram. Explain the use of all the terms and constants that you introduce and
comment on the range of values that they can take.
4. Elaborate about logistic regression in detail.
5. Explain Naïve Bayes Classifier with an Example.
6. Explain Support vector machine Algorithm in Detail.
7. Elaborate in detail about Decision Tree in Supervised Learning
8. Elaborate in detail about Random Forest Algorithm.

Downloaded by Jayasri S (sjayasri.cse@gmail.com)

 lOMoARcPSD|35498024

UNIT IV ENSEMBLE TECHNIQUES AND UNSUPERVISED LEARNING

Combining multiple learners: Model combination schemes, Voting, Ensemble Learning -
bagging, boosting, stacking, Unsupervised learning: K-means, Instance Based Learning:
KNN, Gaussian mixture models and Expectation maximization

1.Explain the process of Combining multiple learners in detail?

1. Model combination schemes 2.Voting
2.Explain the three types of Ensemble Learning?
1.Bagging, 2.Boosting, 3.Stacking
3.Explain the process of K-means with an example?
4.Explain the concept of KNN with an example?
5. Explain the concepts of clustering approaches. How it differ from classification.
6.Explain in detail about Gaussian mixture models and Expectation maximization?

UNIT V NEURAL NETWORKS

Perceptron - Multilayer perceptron, activation functions, network training – gradient
descent optimization – stochastic gradient descent, error backpropagation, from shallow
networks to deep networks –Unit saturation (aka the vanishing gradient problem) –
ReLU, hyperparameter tuning, batch normalization, regularization, dropout.

1.Draw the architecture of a single layer perceptron (SLP) and Multilayer

perceptron (MLP) explain its operation. Mention its advantages and disadvantages.
2.Explain the Gradient decent and stochastic optimization methods for weight
determination.
3.Describe Error back propagation and features of back propagation.
4.Write the flowchart of error back-propagation training algorithm.
5.List the factors that affect the performance of multilayer feed-forward neural
network.
6.Difference between a Shallow Net & Deep Learning Net.
7.How do you tune hyperparameters for better neural network performance?Explain
in detail.
8.Discuss vanishing gradient problem?
9.Discuss about activation function?
10.Discuss normalization, regularization and dropout

Downloaded by Jayasri S (sjayasri.cse@gmail.com)