Scribd
Upload
52 views2 pages

AIML MODEL Q-Set

This document is an examination question paper for the B.E./B.Tech. degree in Artificial Intelligence and Machine Learning at Renganayagi Varatharaj College of Engineering, dated April/May 2023. It includes various questions divided into three parts: Part A consists of short answer questions, Part B contains detailed questions on topics like search strategies, Bayesian networks, and machine learning algorithms, and Part C involves practical problems related to regression and clustering. The total marks for the exam are 100, with a duration of 3 hours.

Uploaded by

Pandi Selvi
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
52 views2 pages

AIML MODEL Q-Set

This document is an examination question paper for the B.E./B.Tech. degree in Artificial Intelligence and Machine Learning at Renganayagi Varatharaj College of Engineering, dated April/May 2023. It includes various questions divided into three parts: Part A consists of short answer questions, Part B contains detailed questions on topics like search strategies, Bayesian networks, and machine learning algorithms, and Part C involves practical problems related to regression and clustering. The total marks for the exam are 100, with a duration of 3 hours.

Uploaded by

Pandi Selvi
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/ 2

Reg No / Roll No

RENGANAYAGI VARATHARAJ COLLEGE OF ENGINEERING


SALVARPATTI, SIVAKASI – 626 128

QUESTIONPAPERCODE: 30124

B.E./B.Tech. DEGREE EXAMINATIONS, APRIL/MAY 2023.


MODEL EXAM
CS3491– AIRTIFICIAL INTELLIGENCE AND MACHINE LEARNING
(R-2021)
Year & Sem: III/VI Date: 09.05.24/AN
Branch: ECE Total Marks / Time: – 100 Marks / 3 Hour
_____________________________________________________________________________________________
Answer All Questions
PART A -- (10×2=20 Marks)
1. Define Artificial Intelligence.
2. What is Adversarial Search?
3. Define Uncertainty.
4. State Bayes' rule.
5. Outline the difference between supervised learning and unsupervised learning.
6. What is a Random Forest?
7. Define ensemble learning.
8. What is the significance of Guassian mixture model?
9. Draw the architecture of multilayer perceptron?
10. Name any two activation functions.
PART B -- (5×13=65 Marks)
11. (a) Outline the uniformed search strategies like breadth-first search and
depth-first search with examples. (13)
Or
(b) State the constraint satisfaction problem. Outline local search for
constraint satisfaction problem with an example. (13)
12. (a) (i) Elaborate on unconditional probability and conditional probability
with an example. (6)
(ii) What is a Bayesian network? Explain the steps followed to
construct a Bayesian network with an example. (7)
Or
(b) What do you mean by inference in Bayesian networks? Outline inference
by enumeration with an example. (13)
13. (a) Elaborate on logistics regression with an example. Explain the process of
computing coefficients. (13)
Or
(b) What is a classification tree? Explain the steps to construct a classification tree.
List and explain about the different procedure used. (13)
14. (a) (i) What is bagging and boosting? Give example. (3)
(ii) Outline the steps in the AdaBoosting algorithm with an example. (10)
Or
(b) Elaborate on the steps in expectation - maximization algorithm. (13)
15. (a) Explain the steps in the back propagation learning algorithm.
What is the importance of it in designing neural networks? (13)
Or
(b) Explain a deep feedforward network with a neat sketch.(13)
PART C -- (1×15=15 Marks)
16. (a) The values of x and their corresponding values of y are shown in the table below.

X 1 2 3 4 5 6 7
Y 3 4 5 5 6 8 10

(i) Find the least square regression line y=ax+b (12)


(ii) Estimate the value of y when x=10 (3)
Or
(b) Consider five points {x1,x2,x3,x4,x5} with the following coordinates as a
two-dimensional sample for clustering.
x1=(0.5,1.75), x2=(1,2),x3(1.75,0.25),x4(4,1),x5(6,3)
Illustrate the K-means algorithm on the above data set. The required number of
clusters is two, and initially, clusters are formed from random distribution of samples:
C1={x1,x2,x4} and C2={x3,x5} (15) (15)

Prepared By Verified by Approved By

You might also like