Orthogonality, Projections and Linear Systems Practice Questions for GATE DA: 36+ Solved Questions with Step-by-Step Solutions

Solve 36+ Orthogonality, Projections and Linear Systems practice questions for GATE DA with answers and detailed solutions. Free sample questions below.

Chapter Roadmap: Orthogonality, Projections and Linear Systems

Chapter Journey

Step 1: Projection Matrices, Null Space and Idempotence (Current)

Geometric intuition of orthogonal projections. Algebraic properties: Idempotence and Symmetry. Column space, Null space, and Eigenvalues.

Step 2: Consistency and Solution Sets of Linear Systems

Conditions for a linear system to have a solution. Geometric interpretation of consistency. Structuring the complete solution set.

Goal: Master the transition from projecting vectors to solving and analyzing linear systems.

The Geometry of Projection Matrices

The Core Idea

A projection matrix $P$ maps any vector $b \in R^{n}$ to a vector $p$ in a target subspace $U$ , such that the error vector $e = b - p$ is orthogonal to $U$ .

Geometric Meaning

$p$ is the "shadow" or closest point in $U$ .
$e$ is the "error" or perpendicular drop.
$P$ isolates the component of $b$ that lives inside $U$ .

Orthogonality, Projections and Linear Systems: Solved Questions with Step-by-Step Explanations (5 Problems)

Question 1 · Linear Algebra MCQ

A linear system $A x = b$ is consistent if and only if:

A.
$Rank (A) = Rank ([A ∣ b])$
B.
$Rank (A) < Rank ([A ∣ b])$
C.
$det (A) \neq = 0$
D.
$b = 0$

Correct Answer:

Step-by-Step Solution

Key idea: This is a direct-recall question about the fundamental condition for consistency.

Step 1: Consistency means there exists at least one solution $x$ .

Step 2: Geometrically, this means $b$ lies in the column space of $A$ .

Step 3: Algebraically, appending $b$ to $A$ to form the augmented matrix $[A ∣ b]$ adds a new column.

Step 4: If $b$ is already in the column space of $A$ , it does not increase the dimension of the column space. Thus, the rank remains unchanged.

Step 5: If $b$ is NOT in the column space, it adds a new independent direction, increasing the rank by 1.

Step 6: Therefore, consistency is equivalent to $Rank (A) = Rank ([A ∣ b])$ .

Answer: A

Question 2 · Linear Algebra MCQ

Which of the following pairs of algebraic properties uniquely defines an orthogonal projection matrix $P$ ?

A.
$P^{2} = I$ and $P^{T} = P$
B.
$P^{2} = P$ and $P^{T} = - P$
C.
$P^{2} = P$ and $P^{T} = P$
D.
$P^{2} = I$ and $P^{T} = - P$

Correct Answer:

Step-by-Step Solution

Key idea: This is a direct recall question about the defining algebraic properties of orthogonal projection matrices.

Step 1: Recall the geometric meaning. An orthogonal projection drops a perpendicular to a target subspace.

Step 2: Algebraically, projecting a vector twice is the same as projecting it once, because the first projection already lands in the subspace. This gives idempotence: $P^{2} = P$ .

Step 3: The projection is "orthogonal", meaning the error vector is perpendicular to the subspace. This geometric requirement translates to the matrix being symmetric: $P^{T} = P$ .

Answer: $P^{2} = P$ and $P^{T} = P$ (Option C).

Question 3 · Linear Algebra MCQ

An orthogonal projection matrix $P \in R^{n \times n}$ has rank $k$ . What are its eigenvalues, and what is its trace?

A.
Eigenvalues are $0$ and $1$ ; Trace is $k$
B.
Eigenvalues are $- 1$ and $1$ ; Trace is $0$
C.
Eigenvalues are $0$ and $1$ ; Trace is $n$
D.
Eigenvalues are $1$ and $k$ ; Trace is $k$

Correct Answer:

Step-by-Step Solution

Key idea: This question tests the spectral properties (eigenvalues and trace) of projection matrices.

Step 1: Since $P^{2} = P$ , any eigenvalue $λ$ must satisfy $λ^{2} = λ$ . Thus, the only possible eigenvalues are $λ \in {0, 1}$ .

Step 2: The rank of $P$ is the dimension of its column space, which equals the number of non-zero eigenvalues. So there are exactly $k$ eigenvalues equal to $1$ , and the remaining $n - k$ eigenvalues are $0$ .

Step 3: The trace is the sum of the eigenvalues: $k \times 1 + (n - k) \times 0 = k$ .

Answer: Eigenvalues are $0$ and $1$ ; Trace is $k$ (Option A).

Question 4 · Linear Algebra MCQ

A consistent system of linear equations with $n$ unknowns has infinitely many solutions if:

A.
$Rank (A) = n$
B.
$Rank (A) < n$
C.
$Rank (A) > n$
D.
$Rank (A) = 0$

Correct Answer:

Step-by-Step Solution

Key idea: This is a direct-recall question linking rank to the number of solutions.

Step 1: For a consistent system, the number of solutions is determined by the number of free variables.

Step 2: Number of free variables $= n - Rank (A)$ .

Step 3: If there are no free variables ( $n - Rank (A) = 0 ⟹ Rank (A) = n$ ), the solution is unique.

Step 4: If there is at least one free variable ( $n - Rank (A) \geq 1 ⟹ Rank (A) < n$ ), the system has infinitely many solutions.

Step 5: $Rank (A) > n$ is impossible since rank cannot exceed the number of columns.

Answer: B

Question 5 · Linear Algebra MCQ

For the system of linear equations $x + y = 2$ and $2 x + 2 y = k$ to have infinitely many solutions, what must be the value of the parameter $k$ ?

A.
4
B.
2
C.
0
D.
Any real number

Correct Answer:

Step-by-Step Solution

Key idea: This is a direct-formula application question involving a parameter that determines consistency.

Step 1: Write the augmented matrix for the system:

$[1212 ∣ ∣ 2 k]$

Step 2: Perform row reduction to echelon form. Apply the operation $R_{2} \to R_{2} - 2 R_{1}$ :

$[1010 ∣ ∣ 2 k - 4]$

Step 3: Analyze the second row. It represents the equation $0 x + 0 y = k - 4$ , or simply $0 = k - 4$ .

Step 4: For the system to have infinitely many solutions, it must first be consistent. This requires the second row to not be a contradiction. Thus, we must have $k - 4 = 0$ , which gives $k = 4$ .

Step 5: If $k = 4$ , the second row becomes $0 = 0$ , leaving one independent equation with two variables, resulting in infinitely many solutions.

Answer: A

A question from this chapter

Question 1

A linear system A x = b is consistent if and only if:

Question 2

Which of the following pairs of algebraic properties uniquely defines an orthogonal projection matrix P ?

Question 3

An orthogonal projection matrix P \in R^{n \times n} has rank k . What are its eigenvalues, and what is its trace?

Question 4

A consistent system of linear equations with n unknowns has infinitely many solutions if:

Question 5

For the system of linear equations x + y = 2 and 2 x + 2 y = k to have infinitely many solutions, what must be the value of the parameter k ?

Free preview ends here

Login to view the complete practice 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

Orthogonality, Projections and Linear Systems Practice Questions for GATE DA: 36+ Solved Questions with Step-by-Step Solutions

Chapter Roadmap: Orthogonality, Projections and Linear Systems

Chapter Journey

The Geometry of Projection Matrices

The Core Idea

Orthogonality, Projections and Linear Systems: Solved Questions with Step-by-Step Explanations (5 Problems)

Step-by-Step Solution

Step-by-Step Solution

Step-by-Step Solution

Step-by-Step Solution

Step-by-Step Solution

More practice questions in this unit

A question from this chapter

Login to view the complete practice 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