0 ratings 0% found this document useful (0 votes) 92 views 8 pages Aiml QP
The document is an examination paper for the B.E/B.Tech degree in Computer Science and Engineering, focusing on Artificial Intelligence and Machine Learning for the Fourth Semester. It includes various sections with questions on AI characteristics, algorithms, Bayesian networks, and machine learning techniques. The paper is structured into three parts: Part A with short questions, Part B with detailed explanations, and Part C with practical applications.
AI-enhanced title and description
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content,
claim it here .
Available Formats
Download as PDF or read online on Scribd
Go to previous items Go to next items
‘Time : Three hours
10.
Reg. No.: |
Question Paper Code : 20871
[Link]. DEGREE EXAMINATIONS, NOVEMBER/DECEMBER 2023.
Fourth Semester
Computer Science and Engineering
CS 3491 - ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING
(Common to : Computer and Communication Engineering and
Information Technology)
(Regulations 2021)
Mi
Answer ALL questions. Q
PART A— (10x 25 py
List the characteristics of AI.
What are agents for AT an ng?
Differentiate lo; sae assertions.
Why a hybri - network is called as such?
What is the'ifche of machine learning?
State the logic behind Gaussian processes.
When does an algorithm become unstable?
Why is the smoothing parameter h need to be optimal?
Differentiate computer and human brain.
Show the perceptron that calculates parity of it’s three inputs.iL
12,
13.
14,
15.
16.
@)
()
(a)
©
(a)
)
(b)
(a)
)
(a)
(b)
PART B — (5 x 13 = 65 marks)
Explain iterative deepening search algorithm with an example.
Or
Discuss in detail about hill climbing algorithm by using 8-queens
problem.
Demonstrate the use of Bayes’ rule with an example in a doctor finding
the probability P (disease / symptoms) before and after the decease
becomes epidemic.
Or
Briefly explain about how the sustainability of enumeration algorithm
can be improved.
Describe the general procedure of random forest algorithm.
Or
With a suitable example explain knowledge extractis ail.
Assume an image has pixel size 240 x 180, El rate how K means
clustering can be used to achieve lossy data ion of that image.
titiple classifiers by voting.
@ hidden layers by ReLU in deep
Explain in detail about combi
Elaborate the process of
networks.
Briefly expléin hints apd the different ways it can be used.
ART C — (1 x 15 = 15 marks)
Cons e statement “Stocks rallied on Monday, with major indexes
gaining 1% as optimism persisted over the first quarter earnings season”.
Taken from a news article. Design a naive Bayes model to classify the
statement into appropriate category.
Or
Construct a training dataset. By using it, demonstrate the AdaBoost
algorithm that makes an ensemble classifier.
2 20871Reg. No. :
Question Paper Code : 30124
B.E/[Link]. DEGREE EXAMINATIONS, APRIL/MAY 2028.
Fourth Semester
Computer Science and Engineering
CS 3491 — ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING
(Common to: Computer and Communication Engineering/Information Technology)
(Regulations 2021)
‘Time : Three hours Maximum : 100 marks
Answer ALL questions.
PART A— (10 x 2= 20 marks)
1. _ Define artificial intelligence. Q
2, What is adversarial search? Q
3. Define uncertainty. oa
4, State Bayes’ a)
5. Outline\the differénce between supervised learning and unsupervised learning.
oom forest?
8. What is the significance of Gaussian mixture model?
°
rhs
Define ensemble learning.
9. Draw the architecture of multilayer perceptron.
10. Name any two activation functions.ll. @
@)
12. (a)
)
13. (a)
}
14. @)
(b)
15. (a)
(b)
PART B — (6 x 13 = 65 marks)
Outline the uniformed search strategies like breadth-first search and
depth-first search with examples. (a3)
Or
State the constraint satisfaction problem. Outline local search for
constraint satisfaction problem with an example. aay
(@ Elaborate on unconditional probability and conditional probability
with an example. ©
(i) What is a Bayesian network? Explain the steps followed to
construct a Bayesian network with an example, 0)
Or
‘What do you mean by inference in Bayesian networks? Outline inference
by enumeration with an example. (13)
Elaborate on logistics regression with an example. Explain the process of
computing coefficients. (as)
What is a classific e? Explain the steps to construct a
Glassification tree, List and éXplain about the different procedures used.
(a3)
hope and boosting? Give example. @)
tline the steps in the AdaBoost algorithm with an example. (10)
Or
Elaborate on the steps in expectation-maximization algorithm. (a3)
Explain the steps in the back propagation learning algorithm. What is
the importance of it in designing neural networks? (13)
Or
Explain a deep feedforward network with a neat sketch. (13)
2) 3012416. (a)
()
S
PART C— (1x 16 = 15 marks)
‘The values of x and their corresponding values of y are shown in the
table below.
e128 4667
434556 8 10
@ Find the least square regression line y =ax+b (a2)
(i) Estimate the value of y when x=10 @)
Or
Consider five points {1,,,,5,%,,%} with the following coordinates as a
two-dimensional sample for clustering:
x, = (0.5, 1.75), = (1,2),2%5 = (1-75, 0.25), = (4, 5 = (6, 3)
Mlustrate 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: C, = {2.2.24} and Cz = {5,5} (15)
R
at
cO
3 30124Reg. No.: | LI |
Question Paper Code : 50904
B.E/[Link]. DEGREE EXAMINATIONS, APRIL/MAY 2024.
Fourth/Sixth Semester
Computer Science and Engineering
CS 3491 — ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING
(Common to : Biomedical Engineering/Computer Science and Design/Computer
Science and Engineering (Cyber Security)/Computer and Communication
Engineering/Blectronics and Communication Engineering/ Electronics and
‘Telecommunication Engineering/Medical Hlectronics/Information Tec! )
(Regulations 2021)
‘Time : Three hours imufa : 100 marks
10.
Answer ALL questions.
PART A— (10x 2= GX
‘What are the various applications of AI?
How will you measure the performance )plication?
‘Mention the needs of probabilisti ing in Al.
Given that P(A)=0.8; P(A |B nd P(B)=0.5, Compute P(B| A).
How can over! avoided?
Assume a disea: ‘are that it is seen in only one person out of every million.
‘Also assume that we have a test that is effective in that if a person has the
disease, there is a 99 percent chince that the test result will be positive;
however, the test is not perfect, and there is a one in a thousand chance that
the test result will be positive on a healthy person. Assume that a new patient
arrives and the test result is positive. What is the probability that the patient
has the disease?
Write the three types of ensemble learning.
How expectation maximization is used in Gaussian mixture models?
What is stochastic gradient descent and why is it used in the training of neural
networks?
Why is ReLU better than Softmax? Give the equation for both.1. @)
)
12. (a)
(b)
13. (a)
(b)
i. @)
)
PART B — (5 x 13 = 65 marks)
Differentiate Blind Search and Heuristic Search.
Or
Explain characteristics of intelligent agents.
Consider the following set of propositions:
+ Patient has spots
+ Patient has measles
+ Patient has high fever
+ Patient has Rocky mountain spotted fever.
+ Patient has previously been inoculated against measles.
+ Patient was recently bitten by a tick
+ Patient has an allergy.
() Create a network that defines the casual conne
mong these
nodes, 6)
(i) Make it a Bayesian network by con: he necessary
conditional probability matrix. @)
Or
Construct a Bayesian Network ai ne the necessary CPTs for the
biased coins a, b and c with
, 60% and 80% respectively. One
coin is drawn random| ig (with equal likelihood of drawing
each of the three c: the coin is flipped three times to
generate the outcomes X1, X2jand X3.
given scenario. We have a
probabilities of coming up
@)
coin is most likely to have been drawn if the flips
6)
Or
Explain the principle of the gradient descent algorithm. Accompany your
explanation with a diagram.
Explain various learning techniques involved in unsupervised learning.
Or
List the applications of clustering and identify advantages and
disadvantages of clustering algorithms.
2 5090416.
(@)
)
(a)
)
Draw the architecture of a single layer perceptron (SLP) and explain its
operation. Mention its advantages and disadvantages.
Or
How do you tune hyperparameters for better neural network
performance? Explain in detail.
PART C— (1x 15 = 15 marks)
Discuss constraint satisfaction problems with an algorithm for solving
crypt arithmetic. Trace the algorithm for the following:
CROSS
+ ROADS
DANGER
Or
Construct the decision tree for the below dataset
Day| Outlook {Temperature|Humidity| Wind | Play Golf
D1| Sunny | Hot High |Weak| No
D2| Sunny | Hot High |Strong|
D3 [Overcast] Hot High a
D4| Rain | Mild Hi Yes
D5| Rain Cool al | Weal Yes
D6 Rain | Cook, || Normal [Strong] No
D7 [Overcast] L .al [Strong] Yes
D8] Sum Mi High |Weak| No
D9 ey ool | Normal |Weak] Yes
[D10|_ Rs Mild | Normal | Weak Yes
ID11| Sunny | Mild | Normal |Strong| _Yes
ID12\Overcast] Mild High Strong] Yes
[D13|Overcast| Hot Normal | Weak Yes
[D14) Rain Mild High |Strong) No
3 50904