ML Study Hub

Home / Past papers / MLF Quiz 1 / this paper

IIT M FOUNDATION AN EXAM QDF3 26 Oct - 26 Oct 2025

MLF Quiz 118 questions40 marks12 MCQ · 4 SA · 2 MSQFoundation / afternoon / QDF3
Elapsed 00:00
Q1MCQ1 mark
A bank wants to decide whether a loan applicant should be given a loan or not, based on features like income, credit score and past records. Which of the following machine learning techniques is applicable for this scenario?
  1. Regression
  2. Classification
  3. Clustering
  4. Dimensionality Reduction
Q2MCQ3 marks
question figure
  1. question figure
  2. question figure
  3. question figure
  4. question figure
Q3MSQ2 marksselect all that apply
question figure
  1. question figure
  2. question figure
  3. question figure
  4. question figure
Q4SA3 marks
question figure
Q5SA3 marks
question figure
Q6SA2 marks
question figure
Comprehension passage - the questions below it refer to this
Based on the above data, answer the given subquestions. question figure
Q7MCQ3 marks
Which of these models has the smallest squared loss on this training dataset?
  1. question figure
  2. question figure
  3. question figure
  4. question figure
Q8MCQ2 marks
question figure
  1. No
  2. Yes
  3. Insufficient information to answer the question
Comprehension passage - the questions below it refer to this
Based on the above data, answer the given subquestions. question figure
Q9MCQ3 marks
Which of the following sets forms a basis for the row space of A?
  1. {(1, 0, 2), (0, 1,−1)}
  2. {(1, 0, 2), (0, 1,−1), (0, 0,−1)}
  3. {(1, 0, 2), (0,−1, 1), (0,−1,−4)}
  4. {(0, 1,−1), (0, 0,−4)}
Q10MCQ2 marks
question figure
  1. question figure
  2. question figure
  3. question figure
  4. question figure
Comprehension passage - the questions below it refer to this
Based on the above data, answer the given subquestions. question figure
Q11MSQ2 marksselect all that apply
Which of the following is/are true?
  1. A is an orthogonal matrix
  2. A is invertible
  3. A is symmetric
Q12MCQ3 marks
Which of the following is true?
  1. A does not have real eigenvalues
  2. A has two distinct real eigenvalues
  3. A has two real eigenvalues, not necessarily distinct
Comprehension passage - the questions below it refer to this
There is no common data for this question. There are three independent sub-questions for which you have to answer True/False.
Q13MCQ2 marks
If a square matrix A is diagonalizable, then A is invertible.
  1. True
  2. False
Q14MCQ1 mark
The eigenvalues of a real symmetric matrix are real.
  1. True
  2. False
Q15MCQ2 marks
A square matrix A of shape n x n is diagonalizable if and only if it has n distinct eigenvalues.
  1. True
  2. False
Comprehension passage - the questions below it refer to this
Based on the above data, answer the given subquestions. question figure
Q16MCQ2 marks
question figure
  1. question figure
  2. question figure
  3. question figure
  4. question figure
Q17SA2 marks
question figure
Q18MCQ2 marks
question figure
  1. (A)
  2. (B)

Answer key

  1. Q1 (MCQ, 1 marks): B
  2. Q2 (MCQ, 3 marks): A
  3. Q3 (MSQ, 2 marks): B, C, D
  4. Q4 (SA, 3 marks): 72
  5. Q5 (SA, 3 marks): 1024
  6. Q6 (SA, 2 marks): 0
  7. Q7 (MCQ, 3 marks): A
  8. Q8 (MCQ, 2 marks): A
  9. Q9 (MCQ, 3 marks): B
  10. Q10 (MCQ, 2 marks): C
  11. Q11 (MSQ, 2 marks): A, B
  12. Q12 (MCQ, 3 marks): A
  13. Q13 (MCQ, 2 marks): B
  14. Q14 (MCQ, 1 marks): A
  15. Q15 (MCQ, 2 marks): B
  16. Q16 (MCQ, 2 marks): A
  17. Q17 (SA, 2 marks): 1
  18. Q18 (MCQ, 2 marks): A

Concepts this paper tests

Auto-generated summary from the source site. Handy as a checklist; the lessons above explain each idea from scratch.

Here’s a structured summary of core topics, concepts, principles, and equations for the "Diploma Level: Machine Learning Foundations" exam, along with Mermaid knowledge graphs to visualize relationships.


1. Core Topics & Concepts

A. Machine Learning Fundamentals

  1. Supervised Learning:

    • Classification (e.g., loan approval: income, credit score → approve/reject).

      • Algorithms: Logistic Regression, Decision Trees, SVM.
    • Regression (predict continuous values).

      • Algorithms: Linear Regression, Polynomial Regression.
    • Loss Functions:

      • Squared Loss (MSE): L(y,y^)=(y−y^)2L(y, \hat{y}) = (y - \hat{y})^2.
      • Goal: Minimize loss over training data.
  1. Unsupervised Learning:

    • Clustering (e.g., K-Means, Hierarchical Clustering).
    • Dimensionality Reduction (e.g., PCA, SVD).
  1. Model Evaluation:

    • Overfitting/underfitting.
    • Train-test split, cross-validation.

B. Linear Algebra (Critical for ML)

  1. Matrices & Vectors:

    • Row Space: Span of row vectors of a matrix AA.
    • Basis: Linearly independent vectors spanning a space.

      • Example: For A∈Rm×nA \in \mathbb{R}^{m \times n}, row space basis has rank r≤min⁡(m,n)r \leq \min(m, n).
    • Rank: Number of linearly independent rows/columns.
  1. Matrix Properties:

    • Orthogonal Matrix: ATA=IA^T A = I (columns are orthonormal).
    • Invertible Matrix: det⁡(A)≠0\det(A) \neq 0, AA−1=IAA^{-1} = I.
    • Symmetric Matrix: A=ATA = A^T.
    • Eigenvalues/Eigenvectors:

      • Av=λvA \mathbf{v} = \lambda \mathbf{v}.
      • Real symmetric matrices have real eigenvalues.
    • Diagonalizable Matrix:

      • A=PDP−1A = PDP^{-1} (where DD is diagonal).
      • Not all diagonalizable matrices are invertible (e.g., singular matrices).
  1. Key Theorems:

    • A matrix is diagonalizable iff it has nn linearly independent eigenvectors (not necessarily distinct eigenvalues).
    • Spectral Theorem: Real symmetric matrices are diagonalizable.

C. Probability & Statistics (Implied in Questions)

  1. Basics:

    • Expected value, variance.
    • Conditional probability (e.g., loan approval given credit score).
  1. Bayes’ Theorem (for classification):
P(y∣X)=P(X∣y)P(y)P(X)P(y|X) = \frac{P(X|y)P(y)}{P(X)}

D. Calculus (Optimization)

  1. Gradient Descent:

    • Update rule: θ=θ−α∇J(θ)\theta = \theta - \alpha \nabla J(\theta).
    • Used to minimize loss functions (e.g., MSE).

2. Key Equations

TopicEquation
Squared LossL(y,y^)=(y−y^)2L(y, \hat{y}) = (y - \hat{y})^2
Matrix InverseAA−1=IAA^{-1} = I
Eigenvalue EquationAv=λvA \mathbf{v} = \lambda \mathbf{v}
Orthogonal MatrixATA=IA^T A = I
DiagonalizationA=PDP−1A = PDP^{-1}
Bayes’ TheoremP(y∣X)=P(X∣y)P(y)P(X)P(y|X) = \frac{P(X|y)P(y)}{P(X)}
Gradient Descentθnew=θold−α∇J(θ)\theta_{new} = \theta_{old} - \alpha \nabla J(\theta)

Graph 2: Linear Algebra Concepts

Graph 3: Relationship Between ML and Linear Algebra

Graph 4: Model Evaluation


4. Exam-Specific Insights

  1. Classification vs. Regression:

    • Loan approval (Q2) is classification (discrete output: yes/no).
  1. Linear Algebra Tricks:

    • Row Space Basis (Q10): Must span all rows and be linearly independent.

      • Correct answer: B (includes all independent rows).
    • Orthogonal Matrix (Q12): ATA=IA^T A = I (option A).
    • Eigenvalues (Q13, Q15):

      • Real symmetric matrices have real eigenvalues (Q15: True).
      • Non-symmetric matrices may have complex eigenvalues (Q13: A).
    • Diagonalizable ≠ Invertible (Q14: False).
  1. Numerical Answers:

    • Q5: 72, Q6: 1024, Q7: 0, Q18: 1 (likely determinant or eigenvalue).
  1. True/False:

    • Q14: Diagonalizable ≠ invertible (False).
    • Q15: Real symmetric eigenvalues are real (True).
    • Q16: Diagonalizable ≠ distinct eigenvalues (False; needs full eigenbasis).

5. Study Recommendations

  1. Focus Areas:

    • Supervised Learning: Classification (logistic regression, decision trees) vs. regression.
    • Linear Algebra: Row space, basis, eigenvalues, diagonalization.
    • Optimization: Gradient descent, loss functions.
  1. Practice:

    • Solve eigenvalue problems (e.g., 2×22 \times 2 matrices).
    • Derive squared loss for simple linear regression.
    • Check matrix properties (orthogonal, symmetric) for given examples.
  1. Common Pitfalls:

    • Confusing classification with regression.
    • Assuming diagonalizable ⇒ invertible.
    • Forgetting that symmetric matrices have real eigenvalues.