Scribd
Upload
10 views3 pages

AIML Question Bank

The document is a comprehensive question bank divided into two parts, covering various topics in Artificial Intelligence and Machine Learning. Part A includes definitions, types, limitations, and key concepts, while Part B focuses on calculations, comparisons, and detailed explanations of algorithms and techniques. It addresses various aspects such as search algorithms, Bayesian networks, clustering, and neural networks.

Uploaded by

sahasafi26
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
10 views3 pages

AIML Question Bank

The document is a comprehensive question bank divided into two parts, covering various topics in Artificial Intelligence and Machine Learning. Part A includes definitions, types, limitations, and key concepts, while Part B focuses on calculations, comparisons, and detailed explanations of algorithms and techniques. It addresses various aspects such as search algorithms, Bayesian networks, clustering, and neural networks.

Uploaded by

sahasafi26
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/ 3

Question Bank

Part - A
1. Define Artificial Intelligence?
2. How Artificial Intelligence is defined? List the types of approaches for Artificial
Intelligence?
3. Define an Agent and list its types?
4. List the limitations of Artificial Intelligence.
5. Why does uncertainty arise?
6. Define the principle of maximum expected utility (MEU).
7. State Bayes’ Theorem in Artificial Intelligence.
8. Given that P(A) = 0.3, P(A|B) = 0.4, and P(B) = 0.5, compute P(B|A).
9. What is Machine Learning?
10. State the difference between Data Mining and Machine Learning?
11. List down the characteristics of intelligent agent?
12. List steps involved in the problem solving agents?
13. How will measure the problem solving performance?
14. What is Bayesian belief Network?
15. What are the five popular algorithms of Machine Learning?
16. What are the different algorithm techniques in Machine Learning?
Part - B

1. Calculate the path to reach from S to G using A* search.

2. Differentiate between DFS and BFS search.


3. Discuss in detail about four possible goals to pursue in artificial intelligence.
4. Explain the various types of hill climbing search techniques.
5. Calculate the probability that an alarm has sounded, but there is neither a burglary nor
an earthquake, and John Calls and Marry Calls.
6. Calculate the probability that an alarm has sounded, but there is neither a burglary nor
an earthquake, and David and Sophia both called Harry.

7. Explain the concept of uncertainty and acting under uncertainty with suitable
examples.
8. How to get the exact inference form Bayesian network?
9. Explain the method of handling approximate inference in Bayesian networks.
10. Define Machine Learning. Give an introduction to Machine Learning.

Question Bank
Part - A
17. What is a kernel trick in SVM?
18. Mention any two differences between Sigmoid and Tanh.
19. Differentiate between K means and Gaussian mixture?
20. What are the three types of ensemble learning?
21. What is the principle of maximum likelihood?
22. What is expectation maximization algorithm used for?
23. Why is ReLu better than softmax? Give the equation for both.
24. What are the types of activation function?
25. What are the disadvantages of stochastic gradient descent?
26. What is perceptron and its types?
27. What is Pruning in Decision Trees, and How is it done?
28. What is SVM?
29. List two applications of clustering.
30. What is backpropagation?
31. List two advantages of deep neural networks.

Part - B

11. 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 dataset. The required number of
clusters is two (K=2) and initially the clusters are formed from random distribution of
samples:
C1 = {x1, x2, x4} and C2 = {x3, x5}.
12. Explain boosting, bagging Technique in Ensemble learning.
13. Assume an image has pixel size 240 x 180. Derive how k-Means clustering can be
used to achieve lossy data compression of that image.
14. Explain the steps in back propagation network (BPN) learning algorithm. What is the
importance of it in designing neural network?
15. Explain in detail about Multi Layer Perceptron.

16. Draw the architecture of single layer perceptron (SLP) and explain its operation.
Mention its merits and de-merits.
17. State the difference between Random forest and decision tree algorithm.

You might also like