Machine Learning Exam Paper

Total Marks: 100

Section A: Multiple Choice Questions (10 x 1 = 10 Marks)

1. Which of the following is not a type of linear regression?

a) Lasso Regression
b) Ridge Regression
c) Polynomial Regression
d) Decision Tree Regression

2. In Lasso Regression, the regularization term is:

a) L1 norm
b) L2 norm
c) L1 and L2 norm
d) No regularization

3. Which algorithm is used for classification and regression and is based on the concept of
decision trees?
a) K-means
b) SVM
c) Random Forest
d) PCA

4. What does the ‘k’ represent in the k-nearest neighbors algorithm?

a) Number of features
b) Number of nearest points
c) Number of clusters
d) Number of trees

5. Which of the following is true about Support Vector Machines?

a) It is only used for regression tasks.
b) It finds the hyperplane that maximizes the margin.
c) It is not effective for high-dimensional spaces.
d) It can only be used with linear kernels.

6. What is the purpose of cross-validation?

a) To train the model
b) To tune hyperparameters
c) To reduce overfitting
d) To measure model performance

7. The elbow method is used to determine:

 a) The number of clusters in K-means
b) The number of components in PCA
c) The depth of a decision tree
d) The value of 'k' in KNN

8. In ensemble learning, which method combines the predictions of multiple models by

averaging them?
a) Bagging
b) Boosting
c) Stacking
d) Blending

9. Which of the following statements is true about the bias-variance tradeoff?

a) High bias always results in overfitting.
b) High variance always results in underfitting.
c) Reducing bias increases variance and vice versa.
d) Bias and variance are independent.

10. Which technique is used to transform correlated features into a set of uncorrelated
components?
a) Clustering
b) PCA
c) Decision Trees
d) SVM

Section B: True or False (10 x 1 = 10 Marks)

1. Lasso regression includes an L2 penalty.

2. Decision trees are prone to overfitting.
3. K-means clustering can only handle numerical data.
4. Random forests can be used for both classification and regression.
5. SVM is sensitive to the choice of the kernel.
6. Bias and variance are inversely related.
7. Principal Component Analysis is used for dimensionality reduction.
8. Ensemble learning always improves model performance.
9. Polynomial regression is a type of linear regression.
10. Hyperparameter tuning is a part of the model training process.

Section C: Short Notes (5 x 4 = 20 Marks)

1. Explain the concept of Ridge Regression.

2. Describe the bias-variance tradeoff with an example.
3. Discuss the advantages and disadvantages of using decision trees.
4. Explain the elbow method in the context of K-means clustering.
 Section D: Compulsory Questions (20 Marks)

1. **Manual Decision Tree Classification**

Given the dataset below, manually construct a decision tree to classify the target column.

utlook Temperature Humidity Wind Day Time Season Weather Targ

Hot High Weak Monday Morning Summer Clear Yes
Hot High Strong Tuesday Noon Summer Clear No
ast Hot High Weak Wednesday Evening Summer Clear Yes
Mild High Weak Thursday Night Summer Cloudy Yes
Cool Normal Weak Friday Morning Autumn Cloudy Yes
Cool Normal Strong Saturday Noon Autumn Rainy No
ast Cool Normal Strong Sunday Evening Autumn Cloudy Yes
Mild High Weak Monday Night Winter Clear No
Cool Normal Weak Tuesday Morning Winter Clear Yes
Mild Normal Weak Wednesday Noon Winter Rainy Yes
Mild Normal Strong Thursday Evening Winter Clear Yes
ast Mild High Strong Friday Night Spring Clear Yes
ast Hot Normal Weak Saturday Morning Spring Clear Yes
Mild High Strong Sunday Noon Spring Rainy No
Hot Normal Weak Monday Evening Spring Clear No
ast Cool Normal Weak Tuesday Night Spring Cloudy Yes
Cool High Weak Wednesday Morning Summer Clear No
Hot Normal Weak Thursday Noon Summer Rainy Yes
Mild High Strong Friday Evening Summer Clear No
ast Mild High Weak Saturday Night Autumn Cloudy Yes
Cool High Weak Sunday Morning Autumn Cloudy Yes
Mild Normal Weak Monday Noon Autumn Rainy Yes
ast Mild High Strong Tuesday Evening Autumn Cloudy Yes
Hot High Weak Wednesday Night Winter Clear No
Hot High Strong Thursday Morning Winter Clear No
ast Hot High Weak Friday Noon Winter Clear Yes
Mild Normal Weak Saturday Evening Winter Rainy Yes
Cool High Weak Sunday Night Spring Cloudy Yes
Mild High Strong Monday Morning Spring Clear No
ast Cool Normal Weak Tuesday Noon Spring Cloudy Yes

Section E: Descriptive Questions (4 x 5 = 20 Marks)

1. **Linear Regression**

Discuss the assumptions of linear regression. What are the consequences if these
assumptions are violated? Provide examples to illustrate your points.

2. **Support Vector Machine (SVM)**

Explain how the kernel trick works in SVM. Discuss different types of kernels and their
applications with examples.

3. **Random Forest Classification**

Describe the random forest algorithm in detail. Explain how it reduces overfitting and improves
accuracy. Discuss its advantages and disadvantages.

4. **Principal Component Analysis (PCA)**

Explain the steps involved in Principal Component Analysis. How is it used for dimensionality
reduction? Provide a practical example with code snippets.

Section F: Assignment Question (1 x20 = 20 Marks)

1. **Model Tuning and Performance Evaluation**

Choose a machine learning model of your choice and describe the process of tuning its
hyperparameters using cross-validation.
https://www.kaggle.com/datasets/sahirmaharajj/driver-application-status