ML Study Hub

Home / Past papers / MLF End Term / this paper

IIT M DIPLOMA AN EXAM QDD3 31 Aug - 31 Aug 2025

MLF End Term13 questions40 marks6 SA · 5 MSQ · 2 MCQDiploma / afternoon / QDD3
Elapsed 00:00
Q1MCQ3 marks
question figure
  1. question figure
  2. question figure
  3. question figure
  4. question figure
Q2MSQ4 marksselect all that apply
question figure
  1. question figure
  2. question figure
  3. question figure
  4. question figure
Q3MSQ3 marksselect all that apply
question figure
  1. question figure
  2. question figure
  3. question figure
  4. question figure
Q4SA4 marks
question figure
Q5SA4 marks
question figure
Q6SA4 marks
question figure
Q7SA3 marks
question figure
Comprehension passage - the questions below it refer to this
question figure
Q8MCQ2 marks
Let A = (x, y) be a point in the set S which is closest to the origin. Choose the correct Primal optimization problem from the following.
  1. question figure
  2. question figure
  3. question figure
  4. question figure
Q9MSQ2 marksselect all that apply
Which of the following options is/are true?
  1. question figure
  2. question figure
  3. question figure
  4. question figure
  5. question figure
Q10SA3 marks
If A = (x, y) is the closest point to the origin, then find the value of 3x − y.
Q11MSQ2 marksselect all that apply
Which of the following options is/are true ?
  1. S is a convex set.
  2. The objective function of the Primal optimization problem from the previousquestion number no 9 is a convex function.
  3. The objective function of the Primal optimization problem from the previousquestion number no 9 is a concave function.
  4. None of these
Comprehension passage - the questions below it refer to this
Based on the above data, answer the given subquestions. question figure
Q12SA3 marks
question figure
Q13MSQ3 marksselect all that apply
Which of the following options is /are true?
  1. A is not a Hermitian matrix.
  2. A is not a unitary matrix.
  3. A is diagonalizable.
  4. None of these

Answer key

  1. Q1 (MCQ, 3 marks): A
  2. Q2 (MSQ, 4 marks): A, C
  3. Q3 (MSQ, 3 marks): A, D
  4. Q4 (SA, 4 marks): 24
  5. Q5 (SA, 4 marks): 0.31 to 0.37
  6. Q6 (SA, 4 marks): 0.02 to 0.06
  7. Q7 (SA, 3 marks): 0.5
  8. Q8 (MCQ, 2 marks): B
  9. Q9 (MSQ, 2 marks): B, C
  10. Q10 (SA, 3 marks): 7.8
  11. Q11 (MSQ, 2 marks): A, B
  12. Q12 (SA, 3 marks): -125
  13. Q13 (MSQ, 3 marks): A, B

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 the core topics, concepts, principles, and equations essential for this exam, followed by Mermaid knowledge graphs to visualize relationships.


Core Topics & Key Concepts

1. Probability & Statistics


2. Linear Algebra


3. Optimization & Convexity


4. Applied Mathematics


Key Equations

TopicEquation
Markov’s InequalityP(X≥a)≤E[X]a\mathbb{P}(X \geq a) \leq \frac{\mathbb{E}[X]}{a}
Chebyshev’s InequalityP(∣X−μ∣≥kσ)≤1k2\mathbb{P}(|X - \mu| \geq k\sigma) \leq \frac{1}{k^2}
Binomial VarianceVar(X)=np(1−p)\text{Var}(X) = np(1-p)
Projectionprojv1v2=(v2⋅v1v1⋅v1)v1\text{proj}_{v_1} v_2 = \left( \frac{v_2 \cdot v_1}{v_1 \cdot v_1} \right) v_1
Normal Linear ComboU=aX+bY∼N(aμX+bμY,a2σX2+b2σY2)U = aX + bY \sim N(a\mu_X + b\mu_Y, a^2\sigma_X^2 + b^2\sigma_Y^2)
Conditional ProbabilityP(C∣D)=P(C∩D)P(D)P(C \mid D) = \frac{P(C \cap D)}{P(D)}
LagrangianL=f(x)+∑uigi(x)L = f(x) + \sum u_i g_i(x)
KKT Stationary∇f(x)+∑ui∇gi(x)=0\nabla f(x) + \sum u_i \nabla g_i(x) = 0
Convexity CheckHessian ∇2f⪰0\nabla^2 f \succeq 0
Eigenvalue Transformationλ(2A2−3I)=2λ2(A)−3\lambda(2A^2 - 3I) = 2\lambda^2(A) - 3

2. Linear Algebra

3. Optimization & Convexity

4. Applied Math (Cost Minimization)


Exam Preparation Tips

  1. Probability:

    • Memorize Markov/Chebyshev inequalities and their applications to binomial distributions.
    • Practice joint PDF calculations (marginals, expectations, variances).
    • Understand linear combinations of normals and standardization.
  1. Linear Algebra:

    • Master projections, orthogonality, and span.
    • Review eigenvalues, Hermitian/unitary matrices, and diagonalizability.
  1. Optimization:

    • Know how to check convexity (Hessian test).
    • Write Lagrangians and KKT conditions for constrained problems.
    • Recognize convex sets from linear inequalities.
  1. Applied Math:

    • Solve constrained quadratic minimization using substitution and calculus.