chapter

Linear Classifiers, Discriminant Analysis and Margin-Based Methods PYQs for GATE DA

Solve 6+ Linear Classifiers, Discriminant Analysis and Margin-Based Methods previous year questions for GATE DA with answers and detailed solutions. Free samp

Try a question

Answer it here to see how it works. Nothing is recorded until you sign in.

Question 1

2025 PYQ

Consider designing a linear classifier y = s i g n (f (x; w, b)), f (x; w, b) = w^{T} x + b on a dataset D = {(x_{1}, y_{1}), (x_{2}, y_{2}), ..., (x_{N}, y_{N})}, x_{i} \in R^{d}, y_{i} \in {+ 1, - 1}, i = 1, 2, ..., N . Recall that the sign function outputs + 1 if the argument is positive, and - 1 if the argument is non-positive. The parameters w and b are updated as per the following training algorithm: w_{n e w} = w_{o l d} + y_{n} x_{n}, b_{n e w} = b_{o l d} + y_{n} whenever s i g n (f (x_{n}; w_{o l d}, b_{o l d})) \neq = y_{n} . In other words, whenever the classifier wrongly predicts a sample (x_{n}, y_{n}) from the dataset, w_{o l d} gets updated to w_{n e w}, and likewise b_{o l d} gets updated to b_{n e w} . Consider the case (x_{n}, + 1), f (x_{n}; w_{o l d}, b_{o l d}) < 0 . Then

Question 2

2025 PYQ

Question 3

2025 PYQ

Question 4

2024 PYQ

Consider the dataset with six datapoints: {(x_{1}, y_{1}), (x_{2}, y_{2}), \dots, (x_{6}, y_{6})}, where x_{1} = [10], x_{2} = [01], x_{3} = [0 - 1], x_{4} = [- 1 0], x_{5} = [22], x_{6} = [- 2 - 2] and the labels are given by y_{1} = y_{2} = y_{5} = 1, and y_{3} = y_{4} = y_{6} = - 1 . A hard margin linear support vector machine is trained on the above dataset. Which ONE of the following sets is a possible set of support vectors?

Question 5

2024 PYQ

Consider the following figures representing datasets consisting of two-dimensional features with two classes denoted by circles and squares. (i) (ii) (iii) (iv) 321123321123321123321123 Which of the following is/are TRUE?

Question 6

2024 PYQ

For any binary classification dataset, let S_{B} \in R^{d \times d} and S_{W} \in R^{d \times d} be the between-class and within-class scatter (covariance) matrices, respectively. The Fisher linear discriminant is defined by u^{*} \in R^{d}, that maximizes J (u) = \frac{u ^{T} S _{B} u}{u ^{T} S _{W} u} If λ = J (u^{*}), S_{W} is non-singular and S_{B} \neq = 0, then (u^{*}, λ) must satisfy which ONE of the following equations? Note: R denotes the set of real numbers.

Free preview ends here

Login to view the complete previous-year questions and solutions

Creating an account is free. You get the rest of this chapter, step-by-step solutions, and a study plan built around the topics you are actually weak at.

Why MastersUp

Personalised first. High quality throughout.

Most platforms hand everyone the same content. Here the content moves with your performance, topic by topic.

Built around you, not around a syllabus PDF

Every answer you give moves your topic-level intelligence rate. The next question, the next revision card and tomorrow's plan all change with it.

Revision that hits your weak spots

We only revise topics you have actually attempted and are still below the safe bar on — never the same chapter on repeat.

Questions calibrated to the real exam

Each question carries a measured toughness. You are served a rung above your current level, so practice keeps stretching you.

Notes written for recall, not for volume

Full lesson cards for first study, curated short-note cards for the last mile — with derivations, traps and exam patterns marked.

One place for everything

Notes, chapter practice, previous-year questions, test series and full-length papers — all feeding one picture of your preparation.

Honest progress

No vanity streaks. Progress here means chapters mastered and accuracy that held up on harder questions.

Unlock the whole course

Full notes and short notes, the complete question bank with worked solutions, mock tests, full-length papers, and an adaptive plan that rebuilds itself as you improve.

View all plans Start free

Linear Classifiers, Discriminant Analysis and Margin-Based Methods PYQs for GATE DA

Solve 6+ Linear Classifiers, Discriminant Analysis and Margin-Based Methods previous year questions for GATE DA with answers and detailed solutions. Free sample questions below.

Chapter Roadmap: Linear Classifiers and Margin Methods

1. Fisher Discriminant and Distance-Based Classifiers

Intuition of class separation, scatter matrices, and optimal projection. Current Topic

2. Fisher Discriminant: Mathematical Optimization

Deriving the weight vector using generalized eigenvalue problems.

3. Linear Separability and Perceptron Updates

Understanding linearly separable data and mistake-driven weight updates.

4. Perceptron Algorithm and Convergence

Formal algorithm steps, learning rate, and convergence theorem.

5. Support Vector Machines: Margins and Vectors

Hard margin, soft margin, and geometric intuition of support vectors.

6. SVM Optimization and Practical Application

Primal and dual formulations, hinge loss, and kernel trick basics.

The Core Idea: Why Fisher Discriminant?

The Goal of Fisher Linear Discriminant (FLD)

When reducing dimensions for classification, maximizing total variance (like PCA) can be disastrous. The direction of maximum variance might be orthogonal to the direction that best separates the classes.

Fisher's insight was to frame dimensionality reduction as a supervised optimization problem. For a binary classification task, we seek a projection vector $w$ that maps $d$ -dimensional data $x$ to a scalar $y = w^{T} x$ , such that:

The projected class means are far apart (maximize between-class scatter).
The projected points within each class are tightly clustered (minimize within-class scatter).

This creates a linear decision boundary in the original space that is optimally tuned for separating the two classes.

Linear Classifiers, Discriminant Analysis and Margin-Based Methods: Solved Questions with Step-by-Step Explanations (6 Problems)

Question 1 · Machine Learning · 2025 MCQ

Consider designing a linear classifier

y = s i g n (f (x; w, b)), f (x; w, b) = w^{T} x + b

on a dataset

D = {(x_{1}, y_{1}), (x_{2}, y_{2}), ..., (x_{N}, y_{N})}

x_{i} \in R^{d}

y_{i} \in {+ 1, - 1}

i = 1, 2, ..., N

. Recall that the sign function outputs

+ 1

if the argument is positive, and

- 1

if the argument is non-positive. The parameters

w

and

b

are updated as per the following training algorithm:

w_{n e w} = w_{o l d} + y_{n} x_{n}, b_{n e w} = b_{o l d} + y_{n}

whenever

s i g n (f (x_{n}; w_{o l d}, b_{o l d})) \neq = y_{n}

. In other words, whenever the classifier wrongly predicts a sample

(x_{n}, y_{n})

from the dataset,

w_{o l d}

gets updated to

w_{n e w}

, and likewise

b_{o l d}

gets updated to

b_{n e w}

. Consider the case

(x_{n}, + 1)

f (x_{n}; w_{o l d}, b_{o l d}) < 0

. Then

A.
$f (x_{n}; w_{n e w}, b_{n e w}) > f (x_{n}; w_{o l d}, b_{o l d})$
B.
$f (x_{n}; w_{n e w}, b_{n e w}) < f (x_{n}; w_{o l d}, b_{o l d})$
C.
$f (x_{n}; w_{n e w}, b_{n e w}) = f (x_{n}; w_{o l d}, b_{o l d})$
D.
$y_{n} f (x_{n}; w_{o l d}, b_{o l d}) > 1$

Question 2 · Machine Learning · 2025 MSQ

A.
The sample $x = 0$ is assigned the label green if $∥ μ_{r e d} ∥ < ∥ μ_{g r ee n} ∥$
B.
$f$ is a linear function of $x$
C.
$f (x) = w^{T} x + b$ , where $w$ and $b$ are functions of $μ_{r e d}$ and $μ_{g r ee n}$
D.
$f$ is a quadratic polynomial in $x$

Question 3 · Machine Learning · 2025 MSQ

A.
$w = (44)$ and $b = 1$
B.
The number of support vectors is 3
C.
The margin is $2$
D.
Training accuracy is 98%

Question 4 · Machine Learning · 2024 MCQ

Consider the dataset with six datapoints:

{(x_{1}, y_{1}), (x_{2}, y_{2}), \dots, (x_{6}, y_{6})}

,
where

x_{1} = [10]

x_{2} = [01]

x_{3} = [0 - 1]

x_{4} = [- 1 0]

x_{5} = [22]

x_{6} = [- 2 - 2]

and the labels are given by

y_{1} = y_{2} = y_{5} = 1

, and

y_{3} = y_{4} = y_{6} = - 1

. A hard
margin linear support vector machine is trained on the above dataset.
Which ONE of the following sets is a possible set of support vectors?

A.
${x_{1}, x_{2}, x_{5}}$
B.
${x_{3}, x_{4}, x_{5}}$
C.
${x_{4}, x_{5}}$
D.
${x_{1}, x_{2}, x_{3}, x_{4}}$

Question 5 · Machine Learning · 2024 MSQ

Consider the following figures representing datasets consisting of
two-dimensional features with two classes denoted by circles and squares.

Which of the following is/are TRUE?

A.
(i) is linearly separable.
B.
(ii) is linearly separable.
C.
(iii) is linearly separable.
D.
(iv) is linearly separable.

Question 6 · Machine Learning · 2024 MCQ

For any binary classification dataset, let

S_{B} \in R^{d \times d}

and

S_{W} \in R^{d \times d}

be the
between-class and within-class scatter (covariance) matrices, respectively. The
Fisher linear discriminant is defined by

u^{*} \in R^{d}

, that maximizes

J (u) = \frac{u ^{T} S _{B} u}{u ^{T} S _{W} u}

λ = J (u^{*})

S_{W}

is non-singular and

S_{B} \neq = 0

, then

(u^{*}, λ)

must satisfy which ONE
of the following equations?
Note:

R

denotes the set of real numbers.

A.
$S_{W}^{- 1} S_{B} u^{*} = λ u^{*}$
B.
$S_{W} u^{*} = λ S_{B} u^{*}$
C.
$S_{B} S_{W} u^{*} = λ u^{*}$
D.
$u^{* T} u^{*} = λ^{2}$

Try a question

Login to view the complete previous-year questions and solutions

Personalised first. High quality throughout.

Built around you, not around a syllabus PDF

Revision that hits your weak spots

Questions calibrated to the real exam

Notes written for recall, not for volume

One place for everything

Honest progress

Unlock the whole course

Linear Classifiers, Discriminant Analysis and Margin-Based Methods PYQs for GATE DA

Chapter Roadmap: Linear Classifiers and Margin Methods

The Core Idea: Why Fisher Discriminant?

Linear Classifiers, Discriminant Analysis and Margin-Based Methods: Solved Questions with Step-by-Step Explanations (6 Problems)

More previous year questions (pyqs) in this unit