CS3491- AIML - QBANK (2)
CS3491- AIML - QBANK (2)
Format No.
07a
Nadar Saraswathi College of Engineering and Technology,
Rev. No.
Vadapudupatti, Theni - 625 531
Date
(Approved by AICTE, New Delhi and Affiliated to Anna University, Chennai)
Total Pages 08
UNIT – I
1.4 What are various applications of AI? or What can AI do BTL2 Understanding 2
today?
2.2 What is the power of heuristic search? (or) Why does one BTL1 Remembering
2
go for heuristics search?
2.3 How can we avoid ridge and plateau in hill climbing? BTL1 Remembering 2
2.5 State the reason when hill climbing often gets stuck? BTL2 Understanding 2
UNIT-II
3.2 What is the need for probability theory in uncertainty? BTL2 Understanding 2
3.4 What is the need for utility theory in uncertainty? BTL2 Understanding 2
3.5 Define principle of maximum expected utility (MEU)? BTL1 Remembering 2
4.2 What does the full joint probability distribution specify? BTL2 Understanding 2
UNIT III
5.3 What are the different Algorithm techniques in Machine BTL2 Understanding
2
Learning?
5.4 What is Training data set and test set? BTL2 Understanding 2
5.5 What is the main key difference between supervised and BTL1 Remembering
2
unsupervised machine learning?
6.2 What is the difference between least squares regression BTL2 Understanding
2
and multiple regression?
6.5 You’ve built a random forest model with 10000 trees. BTL1 Remembering
You got delighted after getting training error as 0.00.
2
But, the validation error is 34.23. What is going on?
Haven’t you trained your model perfectly?
UNIT IV
7.2 Which are the three types of ensemble learning? BTL2 Understanding 2
7.4 What are Gaussian mixture models How is expectation BTL2 Understanding
2
maximization used in it?
8.1 What is the difference between K-means and KNN? BTL1 Remembering 2
8.2 How do you implement expectation maximization BTL1 Remembering
2
algorithm?
8.4 What type of classifiers are used in weighted voting BTL1 Remembering
2
method?
UNIT V
9.4 What is the difference between a perceptron and a MLP? BTL2 Understanding 2
10.3 What are the disadvantages of stochastic gradient descent? BTL2 Understanding 2
10.4 What is stochastic gradient descent and why is it used in BTL1 Remembering
2
the training of neural networks?
UNIT- I
11.a-2 Discuss all the Uninformed search methods with examples. BTL2 Understanding (13)
11.a-3 Differentiate Blind search & Heuristic search. BTL1 Remembering (13)
11.a-4 Discuss different types of informed search strategies BTL2 Understanding (13)
11.b-1 Explain the A* search and give the proof of optimality of A* BTL2 Understanding (13)
11.b-2 Explain AO* algorithm with a suitable example. State the BTL4 Analyzing (13)
limitations in the algorithm?
11.b-3 State the constraints satisfaction problem. Outline local search BTL2 Evaluating (13)
for constraint satisfaction problem with an example.
11.b-4 Explain alpha-beta pruning algorithm and the Min max game BTL6 Creating (13)
playing algorithm with example?
UNIT- II
12.b-3 How to get the exact inference form Bayesian network? (13)
BTL1 Remembering
UNIT- III
13.a-4 Explain the principle of the gradient descent algorithm. BTL2 Understanding
(13)
Accompany your explanation with a diagram. Explain the
use of all the terms and constants that you introduce and
comment on the range of values that they can take.
13.b-5 State when and why you would use random forests vs (13)
BTL2 Evaluating
SVM?
UNIT IV
14.a-1 Explainbrieflyaboutunsupervisedlearningstructure?
(13)
BTL1 Remembering
14 a-2 List the classification of clustering & identify advantages & (13)
BTL1 Remembering
disadvantages of clustering algorithms.
14 a-3 (13)
Listnon-parametrictechniquesandExplainK- BTL2 Understanding
nearestneighbourestimation.
Unit – V
15.a-1 Drawthearchitectureofasinglelayerperceptron(SLP)andexp
lainits operation. Mention its advantages and (13)
BTL1 Remembering
disadvantages.
15 b-2 How do you tune hyperparameters for better neural BTL1 Remembering
(13)
network performance? Explain in detail.
Bloom’s
COs Outcomes
Taxonomy