Scribd
Upload
116 views4 pages

Model Question Paper - AIML

Uploaded by

kushagra Aatree
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
116 views4 pages

Model Question Paper - AIML

Uploaded by

kushagra Aatree
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

UG

®
RV College of Engineering , Bengaluru-560 059
Autonomous Institution affiliated to Visvesvaraya Technological University
Manuscript of Question Paper

COURSE CODE:21AI52 SEM: V


COURSE TITLE : Artificial Intelligence and Machine Learning

Duration of Paper: 03 Hrs

Instructions to Candidates:
1. Answer all questions from Part A
2. Any 5 Full questions from Part B choosing one from each side. (Question No.2 is
compulsory)

Question PART A Marks


No
1.1 State two advantages of DFS? 02
1.2 How 8 queens problem can be viewed as a Constraint Satisfaction Problem? 02
1.3 Define Hill Climbing problem? 02
1.4 Define two parameters in Alpha Beta Pruning? 02
1.5 State any two advantages of Decision Tree? 02
1.6 State two reasons for model over fitting? 02
1.7 State two methods of estimating the probability of data when it has continuous 02
attributes?
1.8 State two necessary condition for an ensemble classifier? 02
1.9 State any two data characteristics that affect the proximity in unsupervised 02
learning?
1.10 State two limitations of K-means algorithm? 02
PART B
2(a) Differentiate between model based reflex agents and Goal based reflex agents with 6
an example?
2(b) Apply BFS method for the following graph? Give its advantages and 10
disadvantages?

3(a) Consider the following graph shown in figure 3.a: 6

1|6
Find the most cost-effective path to reach from start state A to final state J using A*
Algorithm.

3(b) For the following two-ply game tree shown in figure 3b., the terminal nodes show 10
the utility values computed by the utility function. Use the Min-Max algorithm to
compute the utility values for other nodes in the given game tree.

OR
4(a) Discuss how gaming can be considered as a search strategy? 06
4(b) Apply min-max algorithm for the given graph?

10

5(a) Consider the given dataset given below. Write a pseudo code and Illustrate the
Decision Tree algorithm to build a model using Information gain as a metric to split
the attributes?

10

5(b) Summarize the splitting of attributes based on continuous Attributes? 06


OR
6(a) Consider the given dataset given below. Write a pseudo code and Illustrate the 06

2|6
Decision Tree algorithm to build a model using Gini as a metric to split the
attributes?
Age City Income Group Car
Medium Rural Normal Yes
Medium Rural Normal No
Eleder Metro High Yes
Medium Urban High Yes
Young Metro High No
Eleder Metro Normal Yes
Young Urban High No
Young Rural Normal Yes
6(b) Discuss the characteristics of decision tree? 06

7(a) Given a dataset, train a K-nearest neighbors (KNN) model using the KNN
algorithm with K=3 and Euclidean distance. Additionally, provide a pseudo code
for the training process. After training the model, predict its response for a specific
test example?
Test Example: User ID - 15621045, Gender – Female, Age – 20, Purchased-?

10

7(b) Discuss different methods to improve KNN efficiency? 6

OR
8(a) Consider the data set shown below: 10

(a) Estimate the conditional probabilities for P(A = 1|+), P(B = 1|+), P(C = 1|+),
P(A = 1|−), P(B = 1|−), and P(C = 1|−)
(b) Use the conditional probabilities in part (a) to predict the class label for a test
sample (A = 1, B = 1, C = 1) using the naive Bayes approach.

3|6
(c) Compare P(A = 1), P(B = 1), and P(A=1, B = 1). State the relationships
between A and B.

8(b) Discuss the different ways to constructing the Ensemble Classifiers? 06

9(a) Discuss the role of clustering in Machine Learning? Discuss the different types of 10
clusters in Machine Learning

9(b) Demonstrate the K-Means algorithm for the following data considering K =3
Point Coordinates
A1 (2,10)
A2 (2,6)
A3 (11,11)
A4 (6,9)
A5 (6,4)
A6 (1,2)
A7 (5,10)
A8 (4,9)
A9 (10,12)
A10 (7,5)
A11 (9,11)
A12 (4,6)
A13 (3,10)
A14 (3,8) 6
A15 (6,11)
OR
10(a) Discuss the need for Bisecting K –means and write the pseudo code for the same? 10
10(b) Discuss the different measures used in Measuring the clustering validity? 6

4|6

You might also like