ML Gtu Questions
ML Gtu Questions
ML Gtu Questions
ML GTU Questions
Chapter-1
1. Explain the concept of penalty and reward in reinforcement learning. 04 (4)
2. Distinguish between supervised , semi-supervised , and unsupervised learning. 03 (2)
3. Define Machine learning? Briefly explain the types of learning and key tasks of ML. 03
4. Explain Key elements of Machine Learning & various function approximation methods. 04
5. Draw and explain the flow diagram of machine learning procedure. 07
6. List and explain the types of machine learning in brief. 07
7. What is difference between Machine Learning and Deep Learning. 03
8. Define issues in machine Learning. 03
9. Define: a. Supervised Learning b. Classification c. Regression 03
Chapter-2
1. What do you mean by a well-posed learning problem? Explain important features that are
required to well-define a learning problem. 07 (2)
2. How can we take care of outliers in data? 03 (2)
3. What are the Techniques Provided in Data Pre-processing? Explain in brief. 07
Chapter-3
1. Consider the following confusion matrix of the win/loss prediction of cricket match.
Calculate model accuracy and error rate for the same 04
Chapter-4
1. Explain SVD as a feature extraction technique with suitable example. 07
2. Explain the need of feature engineering in ML. 03
3. Differentiate PCA and LDA. 04
Chapter-5
1. Explain Monte Carlo Approximation. 07 (2)
2. What is data sampling? Explain data sampling methods? 04
3. Explain Binomial Distribution with an example. 04
4. Discrete Distribution Vs Continuous Distribution 03
5. If 3% of electronic units manufactured by a company are defective. Find the probability that
in a sample of 200 units, less than 2 bulbs are defective. 03
6. In a communication system each data packet consists of 1000 bits. Due to the noise, each bit
may be received in error with probability 0.1. It is assumed bit errors occur independently.
Find the probability that there are more than 120 errors in a certain data packet. 03
7. For preparation of the exam, a student knows that one question is to be solved in the exam
which is either of types A, B, or C. The probabilities of A, B, or C appearing in the exam are
30%, 20%, and 50% respectively. During the preparation, the student solved 9 of 10
problems of type A, 2 of 10 problems of type B, and 6 of 10 problems of type C. (i) What is
the probability that the student will solve the problem of the exam? (ii) Given that the
student solved the problem, what is the probability that it was of type A? 07 (2)
8. An antibiotic resistance test (random variable T) has 1% false positives (i.e. 1% of those not
resistance to an antibiotic show positive result in the test) and 5% false negatives (i.e. 5% of
those actually resistant to an antibiotic test negative). Let us assume that 2% of those tested
are resistant to antibiotics. Determine the probability that somebody who tests positive is
actually resistant (random variable D) 07
9. In an exam, there were 20 multiple-choice questions. Each question had 44 possible options.
A student knew the answer to 10 questions, but the other 10 questions were unknown to
him and he chose answers randomly. If the score of the student X is equal to the total
number of correct answers, then find out the probability mass function (PMF) of X. What is
PMF(X>15)? 07
Chapter-6
1. State the merits and demerits of Bayes classifier. 03 (2)
2. What is prior, posterior, and likelihood probability? Give an example. 04 (2)
3. Explain Bayes’ theorem in details. 07
4. Explain how Naïve Bayes classifier is used for Spam Filtering. 04
5. Is it possible to use Naïve Bayes classifier for continuous numeric data? If so, how? 04
6. Explain Bayesian belief network with suitable example. 04
Chapter-7
1. Explain dependent and independent variable in a linear equation with example. (2)
2. Discuss the error rate and validation error in the KNN algorithm. 07 (2)
3. What are the factors determining the effectiveness of SVM? 03 (2)
Chapter-8
1. What is Clustering? Explain K-mean clustering algorithm. 07 (2)
2. Explain how the Market Basket Analysis uses the concepts of association analysis. 07
3. Describe the concept of single & complete link in the context of hierarchical clustering. 04
4. Describe the main difference in the approach of k-means and k-medoids algorithms with a
neat diagram. 04
5. Explain the Apriori algorithm for association rule learning with an example. 07
Chapter-9
1. Explain, with example, the challenge in assigning synaptic weights for the interconnection
between neurons? How can this challenge be addressed? 07 (3)
2. What are the steps in the back-propagation algorithm? Why multilayer neural network is
required? 03 (2)
3. Explain Rosenblatt’s perceptron model. 04 (2)
4. Explain, in details, Rosenblatt’s perceptron model. How can a set of data be classified using a
simple perceptron? Using a simple perceptron with weights w0, w1 , and w2 as −1, 2, and 1,
respectively, classify data points (3, 4); (5, 2); (1, −3); (−8, −3); (−3, 0). 07 (2)
5. Describe the structure of an artificial neuron. How is it similar to a biological neuron? What
are its main components? 04
6. Describe, in details, the process of adjusting the interconnection weights in a multi-layer
neural network. 07
7. Draw a flow chart which represents backpropagation algorithm. 04
8. Write a short note on feed forward neural network. 04