Question Bank

Programme B.E MECHANICAL ENGINEERING

Course ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING FUNDAMENTALS
Course Code OCS351 Semester 7 Regulation AU R21

Unit I – INTELLIGENT AGENT AND UNINFORMED SEARCH

Part – A

Sl. Blooms
Question
No. Level

1 What is Artificial Intelligence? L1

2 What is an agent? L1

3 Define characteristics of Rational Agent. L1

4 List down the characteristics of intelligent agent L1

What is the significance of the diameter in a state-space graph when setting a depth limit in depth-
5 L1
limited search?

6 Recall the terms goal formulation and problem formulation L1

7 List the steps involved in simple problem solving agent L1

8 State on which basis search algorithms are chosen? L1

9 List some of the uninformed search techniques. L1

10 Differentiate Artificial Intelligence with Humans. L2

Part – B

Sl. Blooms
Question
No. Level
Compare Breadth First Search and Depth First Search algorithms in the following graph
with initial node S and Goal node G and also write their applications.

1 L2

2 Explain in detail the properties of Environment in Agent. L2

Page 1 of 5
Course Code & Name OCS351- ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING FUNDAMENTALS

Sl. Blooms
Question
No. Level
Enumerate the kinds of agent programs that embody the principles underlying in almost all
3 L2
intelligent systems.

4 Outline the problem solving approach in detail with a traveler map example. L2

5 Interpret Breadth-first search strategy with an example. L2

6 Explain Dijkstra’s algorithm with a suitable example. L2

Unit II – PROBLEM SOLVING WITH SEARCH TECHNIQUES

Part – A

Sl. Blooms
Question
No. Level

1 What is Heuristic function? L1

2 Define Minimum Remaining Values (MRV) heuristic. L1

3 L2

Interpret your inference from the above Game Tree

4 Differentiate Blind Search and Heuristic Search L2

5 Define Components of Constraint Satisfaction Problem (CSP). L1

6 What is adversarial search? L1

7 State the techniques of CSP. L1

8 What is pruning? L1

9 What is learning real time A*? L1

10 When is the class of problem said to be intractable? L1

Part – B

Sl. Blooms
Question
No. Level
Explain the A* search with a map of cities to find a particular city and analyze the key properties of
1 L2
A* search such as admissibility, triangle inequality, and consistency.

2 Discuss about a map coloring problem with an example and generate its constraint graph. L2

3 Outline the Game Theory with the help of Two-player zero-sum games. L2
Summarize A* search algorithm using the table and diagram given below to determine the optimal
route from A to Z and also explain the search algorithm.
4 L2

Value of h(n)

Page 2 of 5
Course Code & Name OCS351- ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING FUNDAMENTALS

Sl. Blooms
Question
No. Level
Node h(n)
A 14

B 12

C 11

D 6

E 4

F 11

Z 0

5 Explain the real time example using alpha-beta pruning algorithm. L2

Show the working of alpha beta pruning technique using the given diagram and also explain the
algorithm.

6 L2

Unit III – LEARNING

Part – A

Sl. Blooms
Question
No. Level

1 What is meant by classification? L1

2 Compare ‘Overfitting’ and ‘Underfitting’ in Machine learning? L2

3 Define Logistic regression. L1

4 Differentiate between artificial learning and machine learning. L2

5 Define concepts of Bias and Variance. L1

6 How can you avoid overfitting? L1

7 Name the standard approach to supervised learning? L1

8 Recall about ‘Training set’ and ‘Test set’? L1

9 Quote the five popular algorithms of Machine Learning? L1

10 List the three stages to build the hypotheses or model in machine learning? L1

Page 3 of 5
Course Code & Name OCS351- ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING FUNDAMENTALS

Part – B

Sl. Blooms
Question
No. Level

1 Explain in detail about the Logistic Regression with an example. L2

2 Illustrate the concepts of hypothesis, hypothesis space, inductive bias and variance. L2

3 Discuss about the Regression and its types L2

4 Explain evaluation techniques for the Classification algorithms. L2

5 What is Probability? Explain Propositions and Conditional Probabilities with an example. L1

Unit IV – SUPERVISED LEARNING

Part – A

Sl. Blooms
Question
No. Level

1 What is Supervised Learning? L1

2 How to calculate the information gain? L1

3 Define Activation function. L1

4 When can a perceptron network be called as simple perceptron network? L1

5 Define Gini Impurity with a formula L1

6 Why to use Backpropagation technique? L1

7 Quote about Entropy. L1

8 Recall Information gain with formula. L1

9 What are Decision Trees? L1

10 Compare Entropy and Gini index. L2

Part – B

Sl. Blooms
Question
No. Level
Explain architecture of a Multilayer perceptron (MLP) and its operation and state its advantages
1 L2
and disadvantages

2 Describe Adaptive Linear Neuron Network Model and examine its training process. L2
Consider the training data in the following table where Play is a class attribute. In the table, the
Humidity attribute has values “L” (for low) or “H” (for high), Sunny has values “Y” (for yes) or “N” (for
no), Wind has values “S” (for strong) or “W” (for weak), and Play has values “Y” (for yes) or “N” (for
no).

3 Humidity Sunny Wind Play L2

L N S N

H N W Y

Page 4 of 5
Course Code & Name OCS351- ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING FUNDAMENTALS

Sl. Blooms
Question
No. Level

H Y S Y

H N W Y

L Y S N
Infer the class label for the day with the properties Humidity=L, Sunny=N and Wind=W, according
to naïve Bayesian classification?
4 Illustrate Naïve Bayesian Classification model for a classification problem. L2

5 Explain Support Vector Machine Algorithm for image classification. L2

Unit V – UNSUPERVISED LEARNING

Part – A

Sl. Blooms
Question
No. Level
L1
1 What is Unsupervised Learning?
L1
2 List the advantages of Kohonen Self-Organizing Feature Maps.
L1
3 Define PCA.
L1
4 What is Clustering?
L1
5 Define Maxnet.
L1
6 What is Fixed Weight Competitive Nets?
L1
7 How the Agglomerative Hierarchical Clustering will work.
L1
8 Draw the architecture of Multilayer Perceptron.
L2
9 Differentiate between supervised and unsupervised ML algorithm.
L1
10 State the types of clustering algorithm

Part – B

Sl. Blooms
Question
No. Level

1 Explain the concepts of k-means clustering algorithm with an example L2

2 Discuss about Kohonen Self-Organizing Feature Maps in detail with an example. L2

3 Summarize Fixed Weight Competitive Nets with an example. L2

4 Outline the detailed steps for solving a problem using SOM with suitable example. L2
Utilize K-means Clustering Algorithm to find the Clusters for the following data

5 X 1 2 2 3 4 5 L2

Y 1 1 3 2 3 5

Page 5 of 5