Academic Year 2024-2025

IFETCE R – 2019A

DEPARMENT OF ECE
Sub Name/Sub code: ECH001-MACHINE LEARNING ALGORITHMS
Year/ Sem: III/V Type: 100% Theory
MINI QB
Part-A (2 Mark)
UNIT I – INTRODUCTION TO MACHINE LEARNING
1. Point out few examples of machine learning applications. K1

2. Define Reinforcement learning. K1

3. Distinguish between supervised and unsupervised learning K2

4. Consider the following data regarding patients entering a clinic. The data consists of K3
the gender and age of the patients and each patient is labeled as “healthy” or
“sick”.Identify the type of learning?
gender age label
M 48 sick
M 67 sick
F 53 healthy
M 49 sick
F 32 healthy
M 34 healthy
M 21 healthy
5. Write short notes on histogram and scatter plot. K2

6. What are the different techniques for data pre-processing? K1

7. Explain How a System Can Play a Game of Chess Using Reinforcement Learning. K3

8. Explain the process of abstraction with an example. K1

9. What is classification? Explain the key differences between classification and K1

regression
10. Pick some learning task not mentioned in classroom. Describe it informally in a K3
paragraph in English. Now describe it by stating as precisely as possible the task,
performance measure, and training experience. Finally, propose a target function to
be learned and a target representation. Discuss the main tradeoffs you considered in
formulating this learning task.
UNIT II – MODELLING, EVALUATION AND FEATURE ENGINEERING
11. Interpret model training . K2

12. Differentiate between Predictive vs. descriptive models K2

13. Define the bootstrap sampling. Why is it needed? K1

14. Examine the overfitting in machine learning and how can it be avoided K3

15. Write a short note on Silhouette width. K1

Academic Year 2024-2025
IFETCE R – 2019A

16. Present the general principle of an ensemble method and what is bagging and K3
boosting in the ensemble method.
17. Differentiate feature transformation with feature selection. K1

18. Explain the different distance measures that can be used to determine the similarity K3
of features.
19. Construct a feature with an example. K4

20. What is bias and variance in machine learning? K2

UNIT III – SUPERVISED LEARNING

21. Define Linear Regression and give its mathematical equation.
K1
22.
Mention the advantages and disadvantages of supervised Learning K1
23.
Give some popular applications of Linear regression. K2
24. When should you use linear regression and when should you use logistic regression?
K3
Give an example.
Let as consider a scenario
A credit card company wants to know whether transaction amount and credit score
25.
impact the probability of a given transaction being fraudulent. K3
What are the predictor variables used to find the relationship?
Which regression is better to solve this company problem?
26.
Specify the types of ML Classification Algorithms. K2
27. Write in brief about decision tree classification algorithm and draw its structure.
K2
Imagine you want to distinguish between the following four animals: bears, hawks,
penguins, and dolphins.
Your goal is to get to the right answer by asking as few if/else questions as possible.
You might start off by asking whether the animal has feathers, a question that
28. narrows down your possible animals to just two. If the answer is “yes,” you can ask
K3
another question that could help you distinguish between hawks and penguins. For
example, you could ask whether the animal can fly. If the animal doesn’t have
feathers, your possible animal choices are dolphins and bears, and you will need to
ask a question to distinguish between these two animals—for example, asking
whether the animal has fins.
29. With a neat diagram explain the working of the Random Forest algorithm.
K1
30. Suppose you are using RBF kernel in SVM with high Gamma value. What does this
K3
signify?
UNIT IV – UNSUPERVISED LEARNING
31. What is meant by Clustering?
K1
32. For two runs of K-Mean clustering, is it expected to get same clustering results?
K2
Explain.
33. Illustrate how Dendrogram of Hierarchical clustering will be represented with an
K3
example.
Academic Year 2024-2025
IFETCE R – 2019A

34. What is a dendrogram? Explain its use.

K1
35. What is AGNES?
K1
36. Develop the procedure for agglomerative algorithm.
K4
37. Write down the algorithm of K-Means Clustering.
K4
38. Describe the main difference in the approach of k-means and k-medoids algorithms K2

39. Describe how the quality of clustering is measured in the k-means algorithm?
K2
A graph is said to be k-connected if there does not exist a set of k-1 vertices whose
40. removal disconnects the graph. If we dene clusters as comprising of k-connected
K3
components of the thresholded graphs, does this result in a well-dened clustering
algorithm?
UNIT V –REPRESENTATION LEARNING

41. Outline the main objective of Representation Learning. K2

42. Categorize the benefits of Representational Learning. K4

43. Define the multilayer perceptron in neural network K1

44. Relate whether the Multilayer Perceptron a deep learning model. K2

45. Explain, Why we need hidden layers in multilayer perceptron. K3

46. Define PAC Learning K1

47. Summarize a few logics for determining which data points should be labeled in K2
Active learning query strategies.
48. Define Linear Discriminant Analysis (LDA). K1

49. Highlight the assumptions of independent component analysis. K1

50. Outline Autoencoders Function K3

PART-B (16 Mark)

UNIT I – INTRODUCTION TO MACHINE LEARNING

1. What are the different types of supervised learning? Explain them with a sample K1
application in each area.(16)

2. What are the different types of unsupervised learning.Compare supervised K1

learning, unsupervised learning and reinforcement learning with one example(16)
3. Explain, with proper example, different ways of exploring categorical data. K2

4. What are the different techniques for data pre-processing? Explain, in brief, K2
dimensionality reduction and feature selection.(16)
Academic Year 2024-2025
IFETCE R – 2019A

UNIT II – MODELLING, EVALUATION AND FEATURE ENGINEERING

5. Explain target function. Express target function in the context of a real-life K2,K3
example. How is the fitness of a target function?
6. Examine the cosine similarity a suitable measure in the context of a text K3
categorization. Two rows in a document-term matrix have values - (2, 4, 0, 0, 2, 1,
3, 0, 0) and (2, 1, 0, 0, 3, 2, 1, 0, 1). Find the cosine similarity.
7. Explain in detail the process of evaluating the performance of a classification K2
model. Explain the different parameters of measurement.
8. Relate what is feature selection. Why is it needed? What are the different K2
approaches of feature selection?
UNIT III – SUPERVISED LEARNING
9. Explain Decision tree classification algorithm with an Example.
K2
Apply KNN classification on the following dataset and predict the quality of
paper_5 having Acid Durability = 3 and Strength = 7 for K= 3 (Nearest
Neighbor).The data from a survey and objective testing with two attributes (Acid
durability and Strength) can be used to classify whether the quality of the sample
paper is good or bad.
The below table shows four training samples:
Sample Paper Acid Durability Strength Quality
10. Paper_1 7 7 Bad K4
Paper_2 7 4 Bad

Paper_3 3 4 Good

Paper_4 1 4 Good

Now consider a new sample paper called Paper_5 that passes laboratory tests with
Acid Durability = 3 and Strength = 7. Without any expensive survey find out the
quality of this new paper by using the KNN classifier.
11. (i) Explain SVM classifier with suitable example and the key terminologies of SVM
K2
and its types
12. Use the ID3 algorithm for the following question. Build a decision tree from the K4
given tennis dataset.
1.Build a tree to predict Playtennis, based on the other attributes. What is the
classification accuracy?
2. Is it possible to produce some set of correct training examples that will get the
algorithm to include the attribute Temperature in the learned tree, even though the
true target concept is independent of Temperature? if no, explain. If yes, give such
a set.
3. Now, build a tree using only examples D1–D7. What is the classification
accuracy for the training set? What is the accuracy for the test set (examples D8–
D14)?
Academic Year 2024-2025
IFETCE R – 2019A

UNIT IV – UNSUPERVISED LEARNING

13.
Discuss in detail about AGNES (AGglomerative NESting) with example. K2
14. Apply agglomerative hierarchical clustering with the Single Linkage Method on
following data.
a b
P1 0.07 0.83
P2 0.85 0.14 K3
P3 0.66 0.89
P4 0.49 0.64
P5 0.80 0.46

15.
Explain K-Mode Clustering in detail with an example. K2
16. Cluster the following eight points (with (x, y) representing locations) into three
clusters:
K3
A1(2, 10), A2(2, 5), A3(8, 4), A4(5, 8), A5(7, 5), A6(6, 4), A7(1, 2), A8(4, 9).Use
K-Means Algorithm to find the three cluster centres after the second iteration.
UNIT V – REPRESENTATION LEARNING

17. Explain the Principal Component Analysis, assumptions, and equations. K2

18. Summarize the Autoencoders in detail with a diagram K2

19. Derive primary representational working system to detect the type of triangle. K4

20. Infer in detail about types of clustering techniques and Various forms of clustering K2
methods in detail.