Model Question Bank AIML (21CS54)

Module1
1. Define the following:
a. Artificial Intelligence
b. Agent
2. Explain Artificial Intelligence by considering the following
Characteristics:
a. Human like (Thinking/Acting)
b. Rationally (Thinking/Acting)
3. Explain how Turing test can be used for checking the Intelligence of
Machines. /Discuss the significance of Turing Test in evaluating AI
capabilities.
4. Illustrate the Foundations and History of AI through a timeline.
5. Mention and describe the different types of agents
6. Discuss the steps followed by Problem Solving agents.
7. Formulate the following Toy problems using five components of well-
defined problems:
a. Vacuum world Problem
b. Eight Puzzle Game
c. Eight Queens Problem
d. Math’s Sequences
8. Formulate the Realtime Route Finding problem using five
components of well-defined problem.
9. Define a function for the following
a. TREE Search
b. GRAPH Search
10.Discuss how to measure performance of problem-solving agents.
11.Compare Uniformed and informed search strategies.
12.Design and explain the Breadth First Search Algorithm with example.
13.Apply Breadth First search for the following using FIFO Queue:
 14.Design and explain the Depth First Search Algorithm with example.
15.Apply Depth First search for the following using LIFO Queue (Stack):

16.Write a pseudo code for the following:

a. Breadth First Search
b. Depth First Search
Compare Time and Space Complexity of BFS and DFS for Graph and Binary
Tree.

Module2
17.Design and explain the Greedy Best First Search Algorithm to find the
best path from ARAD to BUCHAREST in the map given below:
Make use of the heuristic value given below:

18.Design and explain the A* Best First Search Algorithm to find the
best path from ARAD to BUCHAREST. Consider the map and heuristic
value of question no 18.
19.Apply Greedy Best First Search for the following with S as a Start
node and G as goal. Find the Optimal path by applying Greedy Best
First Search Algorithm using Closed list and Open list.
20.Apply A* Best First Search for the following with S as a Start node and
G as goal. Find the Optimal path by applying Greedy Best First Search
Algorithm using Closed list and Open list

21. Discuss how heuristic functions can be selected making use of the
following four approaches for 8 puzzles:
• The effect of heuristic accuracy on performance
• Generating admissible heuristics from relaxed problems:
• Generating admissible heuristics from subproblems: Pattern
databases
• Learning heuristics from experience
22.What is Machine Learning? Discuss Why Machine Learning is needed
and give the reasons for its popularity.
23.Differentiate between Labelled Data and Unlabeled Data. Discuss the
different types of Machine Learning with examples.
24.Define Model and Discuss different types of Models with examples.
25.Compare Supervised Learning with Unsupervised Learning.
26.With a neat diagram discuss the different steps in Machine Learning
Process. List the Applications of Machine Learning
27.Discuss different types of Data with examples. Compare Dirty data
and good data with examples.
28.Discuss the following 4 steps of Big data Processing Life Cycle:
a. Data Collection
b. Data Preprocessing
c. Applications of Machine Learning Algorithms
d. Interpretation of results and visualization of machine learning
algorithm
29.Discuss different types of Data with examples. Compare Dirty data
and good data with examples. List the Characteristics of Big Data.
30.Discuss the following 4 steps of Big data Processing Life Cycle:
a. Data Collection
b. Data Preprocessing
c. Applications of Machine Learning Algorithms
d. Interpretation of results and visualization of machine learning
algorithm
31.Describe the following
a. Descriptive Statisitics
b. Data Visualization and different types of graphs
c. Data Sets and Data types
d. Central Tendency
e. Dispersion
f. Skewness and Kurtosis
g. Mean absolute Deviation (MAD)
h. Coefficient of Variation (CV)
i. Special Univariate Plots
32.Compare Bivariate Data and Multivariate Data
33.Explain Covariance and Correlation with examples
34.Describe Heatmap and Pairplot and their applications
35.Explain LU Decomposition With examples
36.Explain Matrix Decomposition With Examples.
37.Explain Eigen Values and Eigen Vectors with examples
 38.Discuss Density Estimation With example
39. Explain the following:
a. t test
b. Paired t test
c. Chi Squared Test
d. Stepwise Forward Selection
e. Stepwise Backward Elimination
f. Principal Component Analysis
40.Discuss Feature Engineering and dimensionality reduction with
example
41.Discuss the following examples:
a. Linear Discriminant Analysis
b. Singular Value Decomposition

Module 3
1. With a neat diagram explain the learning environment and learning
model. Discuss different types of Learning.
2. Discuss the design and different components of Learning System.
3. Consider the following sample training data set and explain the
following:

• Concept Learning and concept Learning task of Elephant

• Representation of Hypothesis
• Most General and Specific Hypothesis
• Hypothesis Space
• Generalization – Specific to General learning
• Specialization – General to specific Learning
4. Design Find S Algorithm and apply it to the following data sample to find
the final hypothesis. What are the limitations of Find S Algorithm.
5. Design Candidate Elimination Algorithm and apply it to the following
data sample to find the final version space of hypothesis.

6. Design a K nearest neighbor algorithm. For the following training data

apply KNN and classify the data point (6.1,40,5) to which class it belongs
assuming k=3.

7. Design a Weighted K nearest neighbor algorithm. For the following

training data apply KNN and classify the data point (7.6,60,8) to which
class it belongs assuming k=3.
8. Design a Nearest centroid classifier algorithm. For the following training
data apply the algorithm and predict the test instance (6,5) to which
class it belongs A or B.
X Y Class
3 1 A
5 2 A
4 3 A
7 6 B
6 7 B
8 5 B

9. Consider a simple example with four instances shown in table below

and apply locally weighted regression.

Sl.No Salary in Lakhs Expenditure ( in thousands)

1 5 25
2 1 5
3 2 6
4 1 8

10.For the following sample data, apply linear regression technique to

predict the 7th and 9th month sales.

Xi Yi
(Week) (Sales in thousands)
5 25
1 5
2 6
1 8
Module 4
1. Explain the following:
a. Decision tree
b. Entropy
c. Information Gain
d. Advantages and Disadvantages of Decision tree
2. Design (Write) a ID3 Algorithm to construct decision tree. Construct a
decision tree to assess students’ performance and predict whether a
student will get a job offer or not in his final year of the course.
Sl.No CGPA Instructiveness Practical Communication Job
Knowledge skills Offer
1 ≥9 Yes Very Good Good Yes
2 ≥8 No Good Moderate Yes
3 ≥9 No Average Poor No
4 <8 No Average Good No
5 ≥8 Yes Good Moderate Yes
6 ≥9 Yes Good Moderate Yes
7 <8 Yes Good Poor No
8 ≥9 No Very Good Good Yes
9 ≥8 Yes Good Good Yes
10 ≥8 Yes Average Good YEs

3. Design/Write algorithm to construct a Decision Tree using C4.5. Construct a decision

tree using C4.5 for the following Data set.

S.No CGPA Interactiveness Practical Knowledge Communication Skills Job Offer

1 ≥9 Yes Very Good Good Yes
2 ≥8 No Good Moderate Yes
3 ≥9 No Average Poor No
4 <8 No Average Good No
5 ≥8 Yes Good Moderate Yes
6 ≥9 Yes Good Moderate Yes
7 <8 Yes Good Poor No
8 ≥9 No Very Good Good Yes
9 ≥8 Yes Good Good Yes
10 ≥8 Yes Average Good Yes

4. With example illustrate how to deal with Continuous Attributes in C4.5.

5. Design/Write algorithm to construct a Decision Tree using CART. Construct a
decision tree using CART for the Data set given in Table of question number1.
 6. Design/Write algorithm for constructing Regression Trees. Construct regression tree
for the Table given below:
S.No Assessment Assignment Project Result(%)
1 Good Yes Yes 95
2 Average Yes No 70
3 Good No Yes 75
4 Poor No No 45
5 Good Yes Yes 98
6 Average No Yes 80
7 Good No No 75
8 Poor Yes Yes 65
9 Average No No 58
10 Good Yes Yes 89

7. Describe Validating and Pruning of Decision Trees.

8. Design/Write Naïve Bayes Algorithm. Assess a student’s performance using Naïve
Bayes algorithm with data provided in Table. Predict whether a student gets a job
offer or not in his final year of the course.

S.No CGPA Interactiveness Practical Knowledge Communication Skills Job Offer

1 ≥9 Yes Very Good Good Yes
2 ≥8 No Good Moderate Yes
3 ≥9 No Average Poor No
4 <8 No Average Good No
5 ≥8 Yes Good Moderate Yes
6 ≥9 Yes Good Moderate Yes
7 <8 Yes Good Poor No
8 ≥9 No Very Good Good Yes
9 ≥8 Yes Good Good Yes
10 ≥8 Yes Average Good Yes

9. Describe/ Explain/Discuss Zero Probability Error with example.

10. Write a note on the following
a. Brute Force Bayes Algorithm
b. Bayes Optimal Classifier
c. Gibbs Algorithm
d. Bernoulli’s Naïve Bayes Classifier
e. Multinomial Naïve Bayes Classifier
f. Multi-class Naïve Bayes Classifier
11. Discuss Naïve Bayes Algorithm for continuous attributes. (Apply Gaussian Formula
for Continuous attributes). Assess a student’s performance using Naïve Bayes
algorithm for the continuous attribute. Predict whether a student gets a job offer or
not in his final year of the course. The training dataset T consists of 10 data instances
 with attributes such as “CGPA” and “Interactiveness” as shown in Table. The target
variable is Job Offer which is classified as Yes or No for a candidate student.
Table: Training Dataset with Continuous Attribute

S.No CGPA Interactiveness Job Offer

1 9.5 Yes Yes
2 8.2 No Yes
3 9.3 No No
4 7.6 No No
5 8.4 Yes Yes
6 9.1 Yes Yes
7 7.5 Yes No
8 9.6 No Yes
9 8.6 Yes Yes
10 8.3 Yes YEs

Module 5
1. With a neat diagram Compare Biological Neuron with Artificial Neuron.
2. Draw and Explain the following: 1) Simple Model of Artificial Neuron and 2) ANN
Structure
3. What are Activation Functions? Write the formula for the following Activation
functions: 1) Linear/Identity Function 2) Binary Step Function 3) Sigmoidal Function
or Logistic Function 4) Bipolar Sigmoid Function 5) Ramp Functions 6) Tanh functions
7 ) Relu Functions and 8)Softmax Function.
4. With a neat diagram Describe Perceptron Model.
5. Design/Write Perceptron Algorithm. Design a perceptron that performs the Boolean
Function AND and update the weights until the Boolean function gives the desired
output. Consider a perceptron to represent the Boolean function AND with the initial
weights w1= 0.3 , w2 = -0.2 ,learning rate ∝ = 𝟎. 𝟐 and bias 𝜽 = 𝟎. 𝟒 as shown in the
figure below. The activation function used here is the step function f(x) which gives
the output value as binary i.e 0 or 1. If value of f(x) is greater than or equal to 𝜽, its
outputs 1 or else it ouputs 0.
6. Describe the following:
a. Delta Learning Rule
b. Gradient Descent
7. With a neat diagram describe the different types of ANN
8. Design/Write Algorithm for Learning in an Multi-Layer Perceptron. Consider learning
in a Multi Layer Perceptron. The given MLP consists of an input Layer, one Hidden
Layer and an Output Layer. The input layer has 4 neurons, the hidden layer has 2
neurons and the output layer has a single neuron. Train the MLP by updating the
weights and biases in the network.
9. With a neat diagram discuss the architecture of a Radial Basis Function Neural
Network.
10. Design/Write Algorithm for Radial Basis Function Neural Network.
11. Consider the XOR Boolean function that has 4 patterns (0,0) (0,1) (1,0) and (1,1) in a 2
–dimensional input space.

Construct a RBFNN as shown in above Figure that classifies the input pattern:
(0,0)-> 0
(0,1)-> 1
(1,0)-> 1
(1,1)-> 0
12. Write a note on the following:
a. Self-Organizing Feature Map
13. Design/Write Algorithm for Self Organizing Feature Map. Consider the example shown
in Figure below which considers four training samples each vector of length 4 and two
output units. Train the SOFM network by determining the class memberships of the
input data.

14. List the Popular Applications of Artificial Neural Networks. Give the Advantages and
Disadvantages of ANN. What are the challenges of Artificial Neural Networks?
15. Define Clustering. Differentiate between Classification and Clustering. List the
Applications of Clustering. What are Challenges, Advantages and Disadvantages of
Clustering Algorithms.
16. What are Proximity Measures? List the properties of distance measures that is
required to call distance measure as metric.
17. Suppose if the coordinates of the object are (0,3) and (5,8) then what is the Euclidean
distance, Manhattan distance, Minkowski distance and Chebyshev distance.
18. If the given vectors are x =(1,0,0) and (y=(1,1,1) then find the SMC and Jaccard
coefficient?
19. If the given vectors are A= {1,1,0} and B={0,1,1} then what is the cosine similarity?
20. Design / Write the Algorithms and provide the Advantages and Disadvantages of the
following:
a. Agglomerative Clustering
b. Single Linkage or MIN Algorithm
c. Complete Linkage or MAX or Clique Algorithm
d. Mean Shift Clustering Algorithm,
e. K – Means Algorithm,
f. DBSCAN,
g. Dense Cells
h. CLIQUE
i. Fuzzy C Means
j. Expectation Maximization
21. Discuss the following
a. Hierarchical Clustering
b. Complete Linkage or MAX or CLIQUE
c. Average Linkage
d. Density based Methods
e. Grid based Clustering approach
f. Fuzzy Clustering Techniques
g. Cluster Evaluation Methods
i. Cohesion and Separation
ii. Sihoutee Coefficient
 Model Question Bank for 3rd IA
1. Design/Write algorithm to construct a Decision Tree using C4.5. Construct a
decision tree using C4.5 for the following Data set.

S.No CGPA Interactiveness Practical Knowledge Communication Skills Job Offer

1 ≥9 Yes Very Good Good Yes
2 ≥8 No Good Moderate Yes
3 ≥9 No Average Poor No
4 <8 No Average Good No
5 ≥8 Yes Good Moderate Yes
6 ≥9 Yes Good Moderate Yes
7 <8 Yes Good Poor No
8 ≥9 No Very Good Good Yes
9 ≥8 Yes Good Good Yes
10 ≥8 Yes Average Good Yes

2. With example illustrate how to deal with Continuous Attributes in C4.5.

3. Design/Write algorithm to construct a Decision Tree using CART. Construct a
decision tree using CART for the Data set given in Table of question number1.
4. Design/Write algorithm for constructing Regression Trees. Construct regression
tree for the Table given below:
S.No Assessment Assignment Project Result(%)
1 Good Yes Yes 95
2 Average Yes No 70
3 Good No Yes 75
4 Poor No No 45
5 Good Yes Yes 98
6 Average No Yes 80
7 Good No No 75
8 Poor Yes Yes 65
9 Average No No 58
10 Good Yes Yes 89

5. Describe Validating and Pruning of Decision Trees.

6. Design/Write Naïve Bayes Algorithm. Assess a student’s performance using Naïve
Bayes algorithm with data provided in Table. Predict whether a student gets a job
offer or not in his final year of the course.

S.No CGPA Interactiveness Practical Knowledge Communication Skills Job Offer

1 ≥9 Yes Very Good Good Yes
2 ≥8 No Good Moderate Yes
3 ≥9 No Average Poor No
4 <8 No Average Good No
5 ≥8 Yes Good Moderate Yes
6 ≥9 Yes Good Moderate Yes
7 <8 Yes Good Poor No
8 ≥9 No Very Good Good Yes
9 ≥8 Yes Good Good Yes
10 ≥8 Yes Average Good Yes

7. Describe/ Explain/Discuss Zero Probability Error with example.

8. Discuss Naïve Bayes Algorithm for continuous attributes. (Apply Gaussian
Formula for Continuous attributes). Assess a student’s performance using Naïve
Bayes algorithm for the continuous attribute. Predict whether a student gets a
job offer or not in his final year of the course. The training dataset T consists of
10 data instances with attributes such as “CGPA” and “Interactiveness” as shown
in Table. The target variable is Job Offer which is classified as Yes or No for a
candidate student.
Table: Training Dataset with Continuous Attribute

S.No CGPA Interactiveness Job Offer

1 9.5 Yes Yes
2 8.2 No Yes
3 9.3 No No
4 7.6 No No
5 8.4 Yes Yes
6 9.1 Yes Yes
7 7.5 Yes No
8 9.6 No Yes
9 8.6 Yes Yes
10 8.3 Yes YEs
9. With a neat diagram Describe Perceptron Model. Design/Write Perceptron
Algorithm. Design a perceptron that performs the Boolean Function AND and
update the weights until the Boolean function gives the desired output. Consider
a perceptron to represent the Boolean function AND with the initial weights w1=
0.3 , w2 = -0.2 ,learning rate ∝ = 𝟎. 𝟐 and bias 𝜽 = 𝟎. 𝟒 as shown in the figure
below. The activation function used here is the step function f(x) which gives the
output value as binary i.e 0 or 1. If value of f(x) is greater than or equal to 𝜽, its
outputs 1 or else it ouputs 0.
10. Describe the following:
a. Delta Learning Rule
b. Gradient Descent
11. With a neat diagram describe the different types of ANN
12. Design/Write Algorithm for Learning in an Multi-Layer Perceptron. Consider
learning in a Multi Layer Perceptron. The given MLP consists of an input Layer, one
Hidden Layer and an Output Layer. The input layer has 4 neurons, the hidden layer
has 2 neurons and the output layer has a single neuron. Train the MLP by updating
the weights and biases in the network.
13. With a neat diagram discuss the architecture of a Radial Basis Function Neural
Network.
14. Design/Write Algorithm for Radial Basis Function Neural Network.Consider the
XOR Boolean function that has 4 patterns (0,0) (0,1) (1,0) and (1,1) in a 2 –
dimensional input space.

Construct a RBFNN as shown in above Figure that classifies the input pattern:
(0,0)-> 0
(0,1)-> 1
(1,0)-> 1
(1,1)-> 0
15. Design/Write Algorithm for Self Organizing Feature Map. Consider the example
shown in Figure below which considers four training samples each vector of length
4 and two output units. Train the SOFM network by determining the class
memberships of the input data.

16. Define Clustering. Differentiate between Classification and Clustering. List the
Applications of Clustering. What are Challenges, Advantages and Disadvantages of
Clustering Algorithms.
17. Design / Write the Algorithms and provide the Advantages and Disadvantages of
the following:
a. Agglomerative Clustering
b. Single Linkage or MIN Algorithm
c. Complete Linkage or MAX or Clique Algorithm
d. Mean Shift Clustering Algorithm,
 e. K – Means Algorithm,
18. Discuss the following
a. Hierarchical Clustering
b. Complete Linkage or MAX or CLIQUE
c. Grid based Clustering approach
d. Fuzzy Clustering Techniques
e. Cluster Evaluation Methods
i. Cohesion and Separation
ii. Sihoutee Coefficient

End