CMC701 · Machine Learning · End-sem 25 Nov 2026

Previous-year questions, by module

Every question from the six Mumbai University papers (May 2023 to May 2026), sorted by syllabus topic. Repeats are merged into one entry; other wordings sit under “Also asked as”.

How the paper works

  • 3 hours, 80 marks. Same format in all six papers.
  • Q1 is compulsory: answer any 4 of 5 short questions.
  • Q2 to Q6: answer any 3. Each has two parts (a, b).
  • Q6 is usually “detailed note on any two” of three topics.
  • Each paper has one or two numericals with a table.

Times asked, by module

M116
M232
M314
M410
M515
M611
52 unique questions from 98 asks

Asked in 4 or more of the 6 papers

  • 6×M5 · 5.4Explain the DBSCAN clustering algorithm along with an example.
  • 5×M2 · 2.3Explain logistic regression.
  • 5×M3 · 3.7Explain the Random Forest algorithm in detail.
  • 5×M6 · 6.3Explain Linear Discriminant Analysis (LDA) for dimension reduction, with an example.
  • 4×M1 · 1.4Explain any five applications of Machine Learning.
  • 4×M2 · 2.1Explain regression line, scatter plot, error in prediction and best fitting line.
4× times asked (blue at 4+) May 25 asked that sitting Dec 24 not asked Numerical has data to solve
Module I

Introduction to Machine Learning

9 unique questions · asked 16 times across 6 papers

1.2Types of Machine Learning

  1. 1×
    Differentiate between supervised and unsupervised learning.
    May 23May 24Dec 24May 25Dec 25May 26
  2. 1×
    Differentiate between regression and classification, with examples.
    May 23May 24Dec 24May 25Dec 25May 26

1.3Issues in Machine Learning

  1. 3×
    Explain the issues in Machine Learning.
    Also asked as
    • Write a short note on issues in Machine Learning. May 24
    • What are the issues in Machine Learning? May 25
    May 23May 24Dec 24May 25Dec 25May 26

1.4Applications of Machine Learning

  1. 4×
    Explain any five applications of Machine Learning.
    Also asked as
    • Explain any five business applications of Machine Learning. May 24
    May 23May 24Dec 24May 25Dec 25May 26

1.5Steps in developing a Machine Learning application

  1. 3×
    Explain the steps involved in developing a Machine Learning application.
    Also asked as
    • Demonstrate steps to design a Machine Learning application. Dec 24
    • Explain the stages involved in developing a Machine Learning system. May 26
    May 23May 24Dec 24May 25Dec 25May 26
  2. 1×
    How do you choose the right ML algorithm?
    May 23May 24Dec 24May 25Dec 25May 26

1.6Training error, generalization error

  1. 1×
    Explain training error and generalization error.
    May 23May 24Dec 24May 25Dec 25May 26

1.7 · 1.8Overfitting, underfitting, bias-variance trade-off

  1. 1×
    What is overfitting, underfitting and the bias-variance trade-off in Machine Learning?
    May 23May 24Dec 24May 25Dec 25May 26
  2. 1×
    Explain the bias-variance trade-off with a suitable example.
    May 23May 24Dec 24May 25Dec 25May 26

1.1 basics was never asked on its own.

Module II

Learning with Regression and Trees

20 unique questions · asked 32 times across 6 papers

2.1Linear regression

  1. 4×
    Explain regression line, scatter plot, error in prediction and best fitting line.
    May 23May 24Dec 24May 25Dec 25May 26
  2. 1×
    Write a detailed note on linear regression.
    May 23May 24Dec 24May 25Dec 25May 26
  3. 2×
    List and explain the performance evaluation measures used in regression problems.
    Also asked as
    • List and explain any four performance metrics used in regression problems. May 26
    • Asked as the second half of the mass vs time numerical below. May 24
    May 23May 24Dec 24May 25Dec 25May 26
  4. 1×
    The mass y (grams) of a chemical is related to the time x (seconds) for which the reaction has been taking place, as in the table. Find the equation of the regression line. Also explain performance evaluation measures for regression.
    Time, x (seconds)57121620
    Mass, y (grams)40120180210240
    NumericalMay 23May 24Dec 24May 25Dec 25May 26
  5. 1×
    The table shows midterm and final exam grades of students in a database course. Using linear regression, predict the final exam grade of a student who got 86 in the midterm.
    Midterm exam (X)725081749486598386338881*
    Final exam (Y)845377789075497977527490

    * The last midterm value is faint in the scan. It reads as 81, which matches the textbook version of this dataset (Han & Kamber, Data Mining). Check against your copy.

    NumericalMay 23May 24Dec 24May 25Dec 25May 26
  6. 1×
    Explain simple linear regression. Find the regression line Y = aX + C using the least squares method and estimate the expenditure of the company in the 6th month. Monthly expenditure (in thousands):
    X (Month)12345
    Y (Expenditure)1219293745
    NumericalMay 23May 24Dec 24May 25Dec 25May 26

2.2Multivariate linear regression

  1. 1×
    Explain the multivariate linear regression method.
    May 23May 24Dec 24May 25Dec 25May 26

2.3Logistic regression

  1. 5×
    Explain logistic regression.
    Also asked as
    • Explain the concept of logistic regression. May 23
    • Explain logistic regression and performance evaluation metrics. Dec 24
    • Write a detailed note on logistic regression. Dec 25, May 26
    May 23May 24Dec 24May 25Dec 25May 26
  2. 1×
    Differentiate between linear regression and logistic regression.
    May 23May 24Dec 24May 25Dec 25May 26
  3. 2×
    Consider the use case of email spam detection. Identify and explain the suitable machine learning technique for this task.

    No single syllabus topic. Spam vs not-spam is binary classification, so logistic regression (2.3) is the most direct fit; SVM (4.5) also works.

    May 23May 24Dec 24May 25Dec 25May 26

2.4 · 2.5Decision trees and the Gini index

  1. 2×
    Describe decision trees. Explain how trees are constructed using the Gini index, with an example.
    Also asked as
    • Explain the Gini index along with an example. May 24
    May 23May 24Dec 24May 25Dec 25May 26
  2. 1×
    Explain the concepts of entropy and Gini.
    May 23May 24Dec 24May 25Dec 25May 26
  3. 1×
    Create a decision tree using the Gini index to classify the following dataset for profit.
    AgeCompetitionTypeProfit
    oldYessoftwareDown
    oldNosoftwareDown
    oldNohardwareDown
    midYessoftwareDown
    midYeshardwareDown
    midNohardwareUp
    midNosoftwareUp
    newYessoftwareUp
    newNohardwareUp
    newNosoftwareUp
    NumericalMay 23May 24Dec 24May 25Dec 25May 26
  4. 1×
    The dataset below has 3 features (Color, Wig, Num. Ears) and one output variable, Emotion.
    1. Find the root node of the decision tree using the Gini index.
    2. Explain techniques that can be used to handle overfitting in decision trees.
    ColorGGGBBRRRR
    WigYNNNNNNNY
    Num. Ears222222223
    EmotionSSSSHHHHH
    NumericalMay 23May 24Dec 24May 25Dec 25May 26
  5. 1×
    Use the Gini index to decide whether a car will be stolen. The target is “car is stolen?” (Yes or No). Create a decision tree for the data below.
    Car noColourTypeOriginStolen?
    1RedSportsDomesticYes
    2RedSportsDomesticNo
    3RedSportsDomesticYes
    4YellowSportsDomesticNo
    5YellowSportsImportedYes
    6YellowSUVImportedNo
    7YellowSUVImportedYes
    8YellowSUVDomesticNo
    9RedSUVImportedNo
    10RedSportsImportedYes
    NumericalMay 23May 24Dec 24May 25Dec 25May 26

2.6CART

  1. 1×
    Demonstrate the CART method along with an example.
    May 23May 24Dec 24May 25Dec 25May 26

2.7 – 2.11Performance metrics

  1. 3×
    Explain performance evaluation metrics for classification, with a suitable example.
    Also asked as
    • Explain performance evaluation metrics for binary classification with a suitable example. May 24
    • Write a detailed note on performance metrics for classification. May 25
    May 23May 24Dec 24May 25Dec 25May 26
  2. 1×
    Explain the following performance metrics with an example: accuracy, precision, recall and F1 score.
    May 23May 24Dec 24May 25Dec 25May 26
  3. 1×
    You are analysing data on 50 people applying for a grant. Each proposal was read by two readers, and each said “Yes” or “No”. Calculate precision, recall and accuracy.
    Reader B (Predicted)
    YesNo
    Reader A (Actual)Yes205
    No1015
    NumericalMay 23May 24Dec 24May 25Dec 25May 26
  4. 1×
    Explain the confusion matrix. Calculate accuracy, precision, recall and F1 score for the following:
    Predicted +Predicted −
    Actual +408
    Actual −1230
    NumericalMay 23May 24Dec 24May 25Dec 25May 26

2.8 Kappa statistics and 2.11 ROC curve were never asked by name.

Module III

Ensemble Learning

6 unique questions · asked 14 times across 6 papers

3.2K-fold cross validation

  1. 2×
    Explain the concept of k-fold cross validation.
    Also asked as
    • Asked together with XGBoost: “Write a short note on XGBoost and explain k-fold cross validation.” May 26
    May 23May 24Dec 24May 25Dec 25May 26

3.3 · 3.6 · 3.8Bagging and boosting

  1. 2×
    Explain the concept of bagging and boosting.
    May 23May 24Dec 24May 25Dec 25May 26
  2. 1×
    Compare bagging and boosting with reference to ensemble learning. Explain how these methods help improve the performance of a machine learning model.
    May 23May 24Dec 24May 25Dec 25May 26

3.5XGBoost

  1. 3×
    Write a short note on the XGBoost ensemble method.
    May 23May 24Dec 24May 25Dec 25May 26

3.7Random forest

  1. 5×
    Explain the Random Forest algorithm in detail.
    Also asked as
    • Demonstrate the ensemble-learning-based Random Forest algorithm in detail. Dec 24
    • Explain the ensemble learning algorithm Random Forest and its use cases in real-world applications. May 24
    May 23May 24Dec 24May 25Dec 25May 26

3.9Ways to combine classifiers

  1. 1×
    Explain the different ways to combine classifiers.
    May 23May 24Dec 24May 25Dec 25May 26

3.1 ensembles (alone), 3.4 stumping and subagging were never asked.

Module IV

Learning with Classification

6 unique questions · asked 10 times across 6 papers

4.2Optimal decision boundary, margins and support vectors

  1. 1×
    Define the following terms with reference to SVM: hyperplane, support vectors, hard margin, soft margin, kernel.
    May 23May 24Dec 24May 25Dec 25May 26
  2. 1×
    Explain the concept of margin and support vector.
    May 23May 24Dec 24May 25Dec 25May 26
  3. 1×
    What is the significance of the optimal separating hyperplane in SVM?
    May 23May 24Dec 24May 25Dec 25May 26

4.1 · 4.3SVM as a constrained optimization problem

  1. 1×
    Explain the support vector machine as a constrained optimization problem.
    May 23May 24Dec 24May 25Dec 25May 26

4.6Kernel trick

  1. 3×
    Explain the SVM kernel trick.
    Also asked as
    • Explain kernel functions of SVM along with an example. Dec 25
    • Write a short note on support vector machine and the SVM kernel trick. May 26
    May 23May 24Dec 24May 25Dec 25May 26

4.8Multiclass classification

  1. 3×
    Describe multiclass classification.
    May 23May 24Dec 24May 25Dec 25May 26

4.4 quadratic programming, 4.5 linear vs nonlinear SVM and 4.7 support vector regression were never asked.

Module V

Learning with Clustering

6 unique questions · asked 15 times across 6 papers

5.1Introduction to clustering: distance metrics, major approaches

  1. 1×
    Explain the distance metrics used in clustering.
    May 23May 24Dec 24May 25Dec 25May 26
  2. 1×
    Explain the K-means algorithm.

    K-means is not named in the syllabus. It fits under 5.1 as the standard partitioning approach.

    May 23May 24Dec 24May 25Dec 25May 26

5.2Graph-based clustering: minimal spanning tree

  1. 3×
    Explain clustering with a minimal spanning tree (MST), with an example.
    Also asked as
    • Demonstrate the MST algorithm along with an example. Dec 24, May 25
    May 23May 24Dec 24May 25Dec 25May 26

5.3Model-based clustering: Expectation Maximization

  1. 3×
    Explain the concept of the Expectation Maximization algorithm.
    May 23May 24Dec 24May 25Dec 25May 26

5.4Density-based clustering: DBSCAN

  1. 6×
    Explain the DBSCAN clustering algorithm along with an example.
    Also asked as
    • What is density-based clustering? Explain the steps used for clustering with DBSCAN. May 24
    • Write a detailed note on DBSCAN. May 23, May 25
    May 23May 24Dec 24May 25Dec 25May 26
  2. 1×
    Describe the DBSCAN algorithm. Apply DBSCAN on the dataset {1, 2, 3.5, 4, 5, 11} with ε = 2 and MinPts = 4.
    NumericalMay 23May 24Dec 24May 25Dec 25May 26
Module VI

Dimensionality Reduction

5 unique questions · asked 11 times across 6 papers

6.1Dimensionality reduction techniques

  1. 1×
    What is dimensionality reduction? Explain how it can be used for classification and clustering tasks.
    May 23May 24Dec 24May 25Dec 25May 26
  2. 1×
    Explain the concept of feature selection and feature extraction.
    May 23May 24Dec 24May 25Dec 25May 26

6.2Principal Component Analysis (PCA)

  1. 3×
    Describe the PCA algorithm along with an example.
    Also asked as
    • Give the steps to design the PCA dimensionality reduction technique along with an example. Dec 24
    • Write a detailed note on PCA for dimension reduction. May 25
    May 23May 24Dec 24May 25Dec 25May 26

6.3Linear Discriminant Analysis (LDA)

  1. 5×
    Explain Linear Discriminant Analysis (LDA) for dimension reduction, with an example.
    Also asked as
    • Explain LDA and its real-world applications. May 24
    • Write a short note on linear discriminant projection along with an example. May 25
    • Write a detailed note on LDA for dimension reduction. May 23, May 26
    May 23May 24Dec 24May 25Dec 25May 26

6.4Singular Value Decomposition (SVD)

  1. 1×
    Find the SVD of the matrix below.
    A =22−11
    NumericalMay 23May 24Dec 24May 25Dec 25May 26