The given system 2x + 3y = 3, 6x + 9y = 7 has
- AUnique solution
- BInfinitely many solutions
- CNo solution
- DNone of these
Three times the first equation gives 6x + 9y = 9, which contradicts 6x + 9y = 7.
Syllabus: lectures 1–22. Past-paper MCQs are shown first.Syllabus: lecture 1–22. Past paper ki MCQs pehle dikhai gayi hain.
125 MCQs · 11 short · 2 long questions · 125 MCQs from past papers125 MCQs · 11 short · 2 long sawal · 125 MCQs past papers se
The given system 2x + 3y = 3, 6x + 9y = 7 has
Three times the first equation gives 6x + 9y = 9, which contradicts 6x + 9y = 7.
Given the system x₁ − 2x₂ + x₃ = 8, 2x₂ − 7x₃ = 0, −4x₁ + 3x₂ + 9x₃ = −6, the augmented matrix for the system is
The augmented matrix lists each row's coefficients followed by its constant.
If a system of linear equations is inconsistent, then it has ______
Inconsistent means the system has no solution.
2x − 3y = −2, 4x + y = 24. The above system has a ___ solution.
The coefficient determinant is 2·1 − (−3)·4 = 14 ≠ 0, giving the single solution x = 5, y = 4.
The linear equation 0x + 0y = 5 has
0 = 5 is never true, so there is no solution.
The row reduction algorithm applies only to augmented matrices for a linear system.
Row reduction can be applied to any matrix, not only augmented matrices.
The reduced echelon form of the matrix [1 2 3; 2 3 4] is
R₂ − 2R₁ gives (0, −1, −2) → (0, 1, 2); then R₁ − 2R₂ gives (1, 0, −1).
Which of the following is true for the matrix [1 3 2; 0 1 −1; 0 0 1]?
Leading entries step right with zeros below, but nonzero entries remain above pivots, so it is echelon but not reduced.
What is the largest possible number of pivots a 4 × 6 matrix can have?
At most one pivot per row, and there are 4 rows.
If v₁ = (2, 2, 2), v₂ = (0, 0, 3) and v₃ = (0, 1, 1) span ℝ³, then which of the following is true for any arbitrary b = (b₁, b₂, b₃) ∈ ℝ³?
Spanning ℝ³ means every b is a linear combination of v₁, v₂, v₃.
If v₁, v₂ and v₃ are in ℝᵐ then which of the following is equivalent to [v₁ v₂ v₃](2, −7, 5)?
Ax is the linear combination of the columns of A with the entries of x as weights.
In the matrix equation Ax = b, if the order of A is 4 × 3 and of b is 4 × 1, then the order of the column vector x is
x needs as many entries as A has columns, 3.
Let A be an m × n matrix. If for each b in ℝᵐ the equation Ax = b has a solution, then
Ax = b solvable for every b means every b is a combination of the columns.
Determine which of the following sets of vectors is linearly dependent.
(10, 4, 6) = 2(5, 2, 3), so the two vectors are multiples and hence dependent.
Two vectors are linearly dependent if and only if they lie
Two vectors are dependent exactly when one is a multiple of the other, i.e. both lie on one line through 0.
Two vectors are ___ if at least one of the vectors is a multiple of the other.
If v = cu then cu − v = 0 is a nontrivial dependence relation.
A single vector by itself is linearly dependent.
A single vector is dependent only if it is the zero vector.
The transposes of the row vectors of the 3 × 3 identity matrix
They are e₁, e₂, e₃, the standard basis of ℝ³.
Which statement about the set S is false, where S = {(1, 1, 3), (2, 3, 7), (2, 2, 6)}?
(2, 2, 6) = 2(1, 1, 3), so S is dependent; (2, 3, 7) does satisfy 5x − y − z = 0.
If T is a transformation, then which of the following is true for its linearity?
Linearity means T preserves linear combinations: T(cu + dv) = cT(u) + dT(v).
T(x₁, x₂) = (x₁ + x₂, x₁, −x₂) is an example of a transformation from
Two inputs and three outputs.
Consider the linear transformation T whose standard matrix is [1 2 0; 0 1 0; 1 0 0]. Then T(2, 4, 6) is
[1 2 0; 0 1 0; 1 0 0](2, 4, 6) = (2 + 8, 4, 2) = (10, 4, 2).
Each linear transformation T from ℝⁿ to ℝᵐ is equivalent to multiplication by a matrix A of order
A must take n-vectors to m-vectors, so it is m×n.
A linear transformation T: ℝ² → ℝ² is such that T(e₁) = (1, 1) and T(e₂) = (0, −1). Then T(1, −3) is
T(1, −3) = 1·T(e₁) − 3·T(e₂) = (1, 1) + (0, 3) = (1, 4).
Matrix multiplication is associative.
A(BC) = (AB)C whenever the products are defined.
For an n×n matrix, (Aᵀ)ᵀ =
Transposing twice returns the original matrix.
The matrix [a b; c d] is singular if
A 2 × 2 matrix is singular exactly when ad − bc = 0.
If Aᵀ is not invertible, then A is not invertible.
A is invertible exactly when Aᵀ is (det Aᵀ = det A).
If the columns of a matrix are linearly independent then the matrix is ___.
For a square matrix, linearly independent columns is one of the Invertible Matrix Theorem conditions.
If the columns of a matrix are ___ then the matrix is invertible.
A square matrix with linearly independent columns is invertible (IMT).
Which of the following is true for the partitioned matrices A = [C D] and B = [E F], where sub-matrices C and D have the same sizes as E and F respectively?
Conformable partitioned matrices are added block by block in the same positions.
If a matrix A is factorized into lower and upper triangular matrices, then which of the following is true for the matrix?
Writing A = LU is called an LU factorization or LU decomposition.
If A is an m×n matrix, then which of the following is true for the LU factorization of A?
L is a square m×m unit lower triangular matrix and U is an m×n echelon form.
If Ax = b and the factorization of A is LU, which pair of equations can be used to solve LUx = b for x?
Put y = Ux; then LUx = b becomes Ly = b, solved first, then Ux = y.
When solving a system of equations by an iterative method, we stop the process when the entries in two successive iterations are ______.
Iteration stops when successive approximations agree (repeat) to the required accuracy.
Jacobi's method ______ converges to the solution than the Gauss-Seidel method.
Gauss-Seidel uses updated values immediately, so it usually converges faster; Jacobi is slower.
If a system of equations is solved using Jacobi's method, then which of the following is NOT true about the matrix M that is derived from the coefficient matrix?
In Jacobi M is the diagonal part of A with nonzero diagonal entries, so it must be invertible.
If a system of equations is solved using the Gauss-Seidel method, then which of the following is the most appropriate answer about the matrix M that is derived from the coefficient matrix?
In Gauss-Seidel M is the lower triangular part of A (diagonal and below), so entries above the diagonal are zero.
If both the Jacobi and Gauss-Seidel sequences converge to the solution of Ax = b for any initial x⁽⁰⁾, then which of the following is true about both solutions?
Convergence from every starting vector forces a single limit, the unique solution of Ax = b, for both methods.
The Gauss-Seidel method is applicable to a strictly diagonally dominant matrix.
Strict diagonal dominance guarantees Gauss-Seidel convergence.
Jacobi's method is a method of solving a matrix equation on a matrix that has no zeros along its main diagonal.
Each Jacobi step divides by the diagonal entries, so they must be nonzero.
If A is strictly diagonally dominant, then A is ___.
A strictly diagonally dominant matrix is always nonsingular.
If the absolute value of each diagonal entry exceeds the sum of the absolute values of the other entries in the same row, then matrix A is called:
That is the definition of strict (row) diagonal dominance.
If A = [a b; c d], then which of the following is det A?
For a 2×2 matrix det A = ad − bc.
If A = [0 0 1; 1 −k 0; 1 0 0], then which of the following is the value of det(A)?
Expanding along row 1: det A = 1·det[1 −k; 1 0] = 0 + k = k.
Let A = [a b; c d] and let k be a scalar. A formula that relates det kA to k and det A is
Each of the 2 rows is scaled by k, so det kA = k² det A for a 2×2 matrix.
If two row interchanges are made in succession, then the new determinant
Each interchange multiplies det by −1, and (−1)(−1) = 1.
The determinant of A is the product of the pivots in any echelon form U of A, multiplied by (−1)ʳ, where r is
Only row interchanges change the sign; r counts the swaps used to reduce A to U.
If A is invertible, then det(A)·det(A⁻¹) = 1.
det(A)det(A⁻¹) = det(AA⁻¹) = det I = 1.
Let A be a 3×3 matrix with det(A) = 21. Then det(2A) =
det(2A) = 2³·21 = 168.
If det [a b c; d e f; g h i] = 5, then det [a b c; 3d 3e 3f; g h i] will be
Scaling one row by 3 multiplies the determinant by 3: 3·5 = 15.
For any 3×3 matrix A with det(A) = 3, det(2A) = ______.
det(2A) = 2³·3 = 24.
A matrix A and its transpose have the same determinant.
det Aᵀ = det A for every square matrix A.
The value of the determinant of a square matrix remains unchanged if we multiply each element of a row or a column by some scalar.
Multiplying a row or column by k multiplies the determinant by k.
If one row of A is multiplied by k to produce B, then which of the following is true?
Scaling one row by k scales the determinant by k.
At what condition is det(AB) = (det A)(det B) possible?
The product rule for determinants holds for square matrices of the same size.
If a multiple of one row of a square matrix A is added to another row to produce a matrix B, which condition is true?
A row-replacement operation does not change the determinant.
A matrix does not have the same determinant if we add a multiple of a column to another column.
Column replacement, like row replacement, leaves the determinant unchanged.
If two rows or columns of a square matrix are identical, then det(A) will be ___.
Subtracting one identical row from the other gives a zero row.
If all the entries of a row or a column of a square matrix are zero, then det(A) will be ___.
Cofactor expansion along the zero row gives 0.
The determinant of a non-invertible (singular) matrix always
A is invertible exactly when det A ≠ 0.
If A is a 2×2 matrix, the area of the parallelogram determined by the columns of A is
The area equals |det A|; adj A is a matrix, not a number.
Cramer's rule leads easily to a general formula for
Applying Cramer's rule to Ax = eⱼ gives A⁻¹ = (1/det A)·adj A.
While using Cramer's rule, if determinant D = 0 and another determinant is not zero, how many solutions are there?
D = 0 with some Dᵢ ≠ 0 means the system is inconsistent.
At what condition is Cramer's formula valid for linear systems?
Cramer's rule needs a square A with det A ≠ 0 (a nonzero determinant already implies A is square).
Which of the following is the volume of the parallelepiped determined by the columns of A, where A is a 3 × 3 matrix?
Volume is the absolute value of the determinant (det A itself may be negative).
How many subspaces does ℝ² have?
Besides {0} and ℝ², every line through the origin is a subspace, giving infinitely many.
Every vector space has at least two subspaces; one is the space itself and the second is:
The zero subspace {0} is a subspace of every vector space.
For any subspace W of a vector space V, which one is not an axiom for a subspace?
A vector space need not have a product u·v; subspace tests use zero, sums and scalar multiples.
Which one is not an axiom for a vector space?
0·u equals the zero vector, not u; the axiom is 1·u = u.
Which of the following is NOT an axiom for a vector space, where u, v, w in V are vectors and l, m are scalars?
Vector space axioms do not involve a product of two vectors.
Let W = {(x, y) : x, y ∈ ℝ and x = y}. Is W a vector subspace of the plane?
The line y = x passes through the origin and is closed under addition and scalar multiplication.
A null space is a vector space.
Nul A contains 0 and is closed under addition and scalar multiplication, so it is a subspace.
Let A = [2 3 4 5; 4 3 1 2; 1 2 5 3]. If the null space of A is a subspace of ℝᵏ, which of the following is the value of k?
A has 4 columns, so Nul A lies in ℝ⁴.
The null space of A is the solution set of the equation Ax = 0.
Nul A is defined as {x : Ax = 0}.
The null space of an m × n matrix is in ℝᵐ.
x must have n entries, so Nul A lies in ℝⁿ.
The column space of A is the range of the mapping x ↦ Ax.
Ax ranges over all linear combinations of the columns.
If the equation Ax = b is consistent, then Col A is ℝᵐ.
Col A = ℝᵐ needs Ax = b consistent for every b, not just one.
The kernel of a linear transformation is a vector space.
The kernel is a subspace of the domain.
Col A is the set of all vectors that can be written as Ax for some x.
Ax is exactly a linear combination of the columns of A.
Col A is the set of all solutions of Ax = b.
Col A is the set of b for which Ax = b has a solution.
Nul A is the kernel of the mapping x ↦ Ax.
Both are the set of x sent to 0.
The set of all solutions of a homogeneous linear differential equation is the kernel of a linear transformation.
It is the kernel of the linear differential operator.
Let A = [1 −3 −2; −5 9 1] and u = (5, 3, −2). Then u is in
Au = (5 − 9 + 4, −25 + 27 − 2) = (0, 0).
Let a set S be a basis of a vector space V, then which of the following is NOT true about it?
A basis is a linearly independent spanning set, so it cannot be dependent.
Which of the following is the set of standard basis for ℝ³?
The standard basis consists of the columns of the identity matrix I₃.
A basis is a linearly independent set that is as large as possible.
Adding any vector to a basis makes it dependent, so a basis is a maximal independent set.
A basis is a spanning set that is as small as possible.
Removing any vector from a basis destroys spanning, so a basis is a minimal spanning set.
If H = Span{b₁, …, bₙ}, then {b₁, …, bₙ} is a basis for H.
A spanning set need not be linearly independent.
The columns of an invertible n × n matrix form a basis for ℝⁿ.
They are linearly independent and span ℝⁿ.
In some cases, the linear dependence relations among the columns of a matrix can be affected by certain elementary row operations on the matrix.
Row operations preserve the dependence relations among columns.
A linearly independent set in a subspace H is a basis for H.
It may fail to span H.
The standard method for producing a spanning set for Nul A sometimes fails to produce a basis.
The vectors from the parametric solution are always independent.
If B is an echelon form of a matrix A, then the pivot columns of B form a basis for Col A.
Use the pivot columns of A itself, not of B.
If a finite set S of nonzero vectors spans a vector space V, then some subset of S is a basis for V.
Spanning Set Theorem: remove dependent vectors until a basis remains.
All the planes that pass through the origin are subspaces of a three-dimensional space.
A plane through the origin contains 0 and is closed under addition and scalar multiplication.
If two matrices are added, then which of the following should be true for them?
Matrix addition is defined entrywise, so the sizes must match.
If a matrix A = [1 2 3; 1 2 3; 6 1 1], then which of the following is true for A?
Two equal rows make det A = 0, so A is singular.
If A = [1 2 3; 0 0 1; 0 −1 1], then which of the following is true for the matrix A?
Expanding down the first column gives det A = 1·(0·1 − 1·(−1)) = 1 ≠ 0.
If the matrix A = [1 5 4; 0 1 7; 0 0 0], then which of the following is true about it?
A triangular matrix's determinant is the product of its diagonal entries: 1·1·0 = 0.
If for a linear transformation the equation T(x) = 0 has only the trivial solution, then T is
T is one-to-one exactly when T(x) = 0 has only the trivial solution.
Which one of the following is an elementary matrix?
[1 0; 0 −3] comes from I by one row operation (row 2 scaled by −3); the others need two operations or are not square.
The equation x = p + t v describes a line
At t = 0 the point is p, and the direction is v.
A square matrix A = [aᵢⱼ] is lower triangular if and only if aᵢⱼ = 0 for
Lower triangular means all entries above the diagonal (row index i < column index j) are zero.
The product of upper triangular matrices is
Products of upper triangular matrices keep all below-diagonal entries zero.
We can add matrices of ______.
Addition is entrywise, so both matrices must have the same size (order).
A system of linear equations is said to be homogeneous if it can be written in the form ______.
A homogeneous system has zero right-hand side: Ax = 0.
Whenever a system has no free variable, the solution set contains many solutions.
With no free variables a consistent system has exactly one solution (or none if inconsistent).
Which of the following is not a linear equation?
The product term x₁x₂ makes the equation nonlinear.
The determinant of a triangular matrix is the sum of the entries on the main diagonal.
It is the product, not the sum, of the diagonal entries.
Col A is all of ℝᵐ if and only if
Col A is the set of all b for which Ax = b is consistent.
If a homogeneous system Ax = 0 has the trivial solution, then which of the following is the value of the vector x?
The trivial solution is x = 0.
Since every linear transformation T: ℝⁿ → ℝᵐ is actually a matrix transformation, which of the following is the alternate notation for the transformation?
A matrix transformation is written x ↦ Ax.
If A = [2 1; 4 3] and B = [1+1 2−1; 2+2 4−1], then which of the following is true for A and B?
Simplifying gives B = [2 1; 4 3] = A.
Which of the following is true for the matrix A = [1 0; 0 −5]?
It is I with row 2 scaled by −5, one elementary row operation.
If A = [1 0 0; 2 4 0; 3 5 6], then which of the following is the value of det(A)?
A is lower triangular, so det A = 1·4·6 = 24.
The determinant of a diagonal matrix is the product of the diagonal elements.
A diagonal matrix is triangular, so its determinant is the product of its diagonal entries.
By using determinants, we can easily check that the solution of a given system of linear equations exists and is unique.
For a square system, det A ≠ 0 exactly when Ax = b has a unique solution for every b.
How many different permutations are there of the set of integers {1, 2, 3}?
There are 3! = 6 permutations.
A matrix that results from applying a single elementary row operation to an identity matrix is called
That is the definition of an elementary matrix.
The inverse of an invertible lower triangular matrix is
Inverting (e.g. by forward substitution) keeps the lower triangular shape.
If A is a triangular matrix, then det(A) is the product of the entries on the ___.
The determinant of a triangular matrix is the product of its main-diagonal entries.
If a matrix A is invertible, then adj(A) is also invertible.
adj A = (det A)A⁻¹ with det A ≠ 0, so det(adj A) = (det A)ⁿ⁻¹ ≠ 0.
Consider a system of linear equations Ax = b where A is a 3 × 3 matrix having 3 pivot positions. Which statement is false about the system Ax = b?
Three pivots in three columns leave no free variables.
A linear transformation T: ℝ² → ℝ² is defined by T(x) = [0 −1; 1 0](x₁, x₂) = (−x₂, x₁). If u = (4, 1) and v = (2, 3), then the image of u + v is
u + v = (6, 4) and T(6, 4) = (−4, 6).
No MCQs match this filter.Is filter mein koi MCQ nahi.
If A = B, then determine the values of x and y, where A = [1 y+2; x+2 3] and B = [1 2; 4 3].
Equal matrices have equal corresponding entries. (1,2) entry: y + 2 = 2 ⇒ y = 0. (2,1) entry: x + 2 = 4 ⇒ x = 2. So x = 2, y = 0.
Let A = [1 2 3 4; 2 3 4 5; 2 4 6 8] ~ [1 0 −1 −2; 0 1 2 3; 0 0 0 0]. Write the solutions of Ax = 0 in terms of the free variables.
From the reduced echelon form: x1 − x3 − 2x4 = 0 and x2 + 2x3 + 3x4 = 0, with x3 and x4 free. So x1 = x3 + 2x4, x2 = −2x3 − 3x4, x3 free, x4 free. In vector form: x = x3(1, −2, 1, 0) + x4(2, −3, 0, 1).
Determine the value of "s" for which the following system of linear equations does not have a unique solution: s·x1 + 2x2 = 10 5x1 + 7x2 = 20 (s is a parameter)
The system has a unique solution exactly when the coefficient determinant is non-zero. det [s 2; 5 7] = 7s − 10. 7s − 10 = 0 ⇒ s = 10/7. So the system does not have a unique solution when s = 10/7.
Let v₁ = (1, 0, −2), v₂ = (−2, 1, 7) and y = (h, −3, −5). For what value(s) of h is y in the plane generated by v₁ and v₂?
Solve c₁v₁ + c₂v₂ = y. Second entry: c₂ = −3. Third entry: −2c₁ + 7c₂ = −5, so −2c₁ − 21 = −5 and c₁ = −8. First entry: h = c₁ − 2c₂ = −8 + 6 = −2. So y is in the plane only when h = −2.
Find vector and parametric equations of the plane that passes through the origin of ℝ³ and is parallel to the vectors v₁ = (1, 2, 5) and v₂ = (5, 0, 4).
Vector equation: x = t₁v₁ + t₂v₂, i.e. (x, y, z) = t₁(1, 2, 5) + t₂(5, 0, 4), t₁, t₂ ∈ ℝ. Parametric equations: x = t₁ + 5t₂, y = 2t₁, z = 5t₁ + 4t₂ (t₁, t₂ ∈ ℝ).
If a square idempotent matrix A is nonsingular, show that A is equal to the identity matrix I.
Idempotent means A² = A. Since A is nonsingular, A⁻¹ exists. Multiply A² = A on the left by A⁻¹: A⁻¹(AA) = A⁻¹A, so (A⁻¹A)A = I, i.e. IA = I, hence A = I.
Determine whether T(x₁, x₂) = (6x₁ + 8x₂, 5x₁ − 8x₂) is invertible.
Standard matrix A = [6 8; 5 −8]. det A = 6(−8) − 8·5 = −48 − 40 = −88 ≠ 0, so A is invertible and hence T is invertible. A⁻¹ = (1/−88)[−8 −8; −5 6] = (1/88)[8 8; 5 −6], so T⁻¹(x₁, x₂) = ((8x₁ + 8x₂)/88, (5x₁ − 6x₂)/88) = ((x₁ + x₂)/11, (5x₁ − 6x₂)/88).
Find the volume of the parallelepiped determined by the vectors (1, 2, 4), (2, 4, −7) and (−1, −3, 2) [source prints the last vector as "(−1, −3, 20"].
Volume = |det M| where M has the three vectors as rows (or columns). det[1 2 4; 2 4 −7; −1 −3 2] = 1(4·2 − (−7)(−3)) − 2(2·2 − (−7)(−1)) + 4(2(−3) − 4(−1)) = 1(8 − 21) − 2(4 − 7) + 4(−6 + 4) = −13 + 6 − 8 = −15. Volume = |−15| = 15 cubic units. (The value is the same if the last entry is 20, since its cofactor det[1 2; 2 4] = 0.)
Determine a basis for the plane 3x − 2y + 5z = 0 as a subspace of ℝ³.
Solve for x: x = (2/3)y − (5/3)z with y, z free. So (x, y, z) = y(2/3, 1, 0) + z(−5/3, 0, 1). Scaling, a basis is {(2, 3, 0), (−5, 0, 3)}; both satisfy the equation (6 − 6 = 0, −15 + 15 = 0) and are not multiples, so they are independent and span the 2-dimensional plane.
Determine whether the set V = {(x, y, z) | x, y, z ∈ ℝ and x·y = 11} is a subspace of ℝ³ or not. [source: "x,y = 11"]
A subspace must contain the zero vector. For (0, 0, 0), x·y = 0 ≠ 11, so 0 ∉ V and V is not a subspace of ℝ³. (Also not closed under scaling: (1, 11, 0) ∈ V but 2(1, 11, 0) = (2, 22, 0) has xy = 44.) The same conclusion holds if the condition is read as x + y = 11.
Show that the following system of linear equations has a unique solution: 4x₁ + 3x₂ = 4, 5x₁ + 8x₂ = 6.
Coefficient matrix A = [4 3; 5 8], det A = 32 − 15 = 17 ≠ 0, so A is invertible and the system has a unique solution. By Cramer's rule: x₁ = det[4 3; 6 8]/17 = (32 − 18)/17 = 14/17, x₂ = det[4 4; 5 6]/17 = (24 − 20)/17 = 4/17. Check: 4(14/17) + 3(4/17) = 68/17 = 4; 5(14/17) + 8(4/17) = 102/17 = 6.
Compute (AB)23, (AB)13 and (AB)12 by using the row-column (product) rule, where A = [2 4 6; 1 3 4] and B = [4 2 3; 3 5 8; 2 1 3].
(AB)ij = (row i of A)·(column j of B). (AB)23 = (1, 3, 4)·(3, 8, 3) = 3 + 24 + 12 = 39. (AB)13 = (2, 4, 6)·(3, 8, 3) = 6 + 32 + 18 = 56. (AB)12 = (2, 4, 6)·(2, 5, 1) = 4 + 20 + 6 = 30.
Let A = [1 4; 5 6] and c = (2, 3). Define T: ℝ² → ℝ² by T(x) = Ax. Determine if c is in the range of the transformation T.
c is in the range if Ax = c has a solution. Row reduce [1 4 | 2; 5 6 | 3]: R₂ − 5R₁ gives [1 4 | 2; 0 −14 | −7], so x₂ = 1/2 and x₁ = 2 − 4(1/2) = 0. x = (0, 1/2) satisfies A x = c, so c IS in the range of T. (Also, det A = −14 ≠ 0, so T is onto ℝ².)