CUET UG Mathematics Booster Test 1 - Adjoint, Inverse Matrices and Applications of Determinants
π Answers are locked once submitted β results and explanations appear at the end.
QUESTION 1 OF 20
Arrange the correct steps to form \(adjβ‘(A)\)for \(A=[a_{ij}]\):
1. Find all minors \(M_{ij}\)
2. Apply signs to obtain cofactors \(A_{ij}=(-1)^{\left(i,\ j\right)}M_{ij}\)
3. Form the cofactor matrix \(\left[A_{ij}\right]\)
4. Transpose the cofactor matrix
QUESTION 2 OF 20
Which statements are correct?
I. Adjoint is defined only for square matrices
II. \(\left(i,\ j\right)\)element of \(adjβ‘(A)\)is \(A_{ji}\)
III. It is required to compute \(A^{-1}\)when \(β£Aβ£\neq 0\)
QUESTION 3 OF 20
Let
\(A=\left(\begin{pmatrix}1 & 2\\ 3 & 4\end{pmatrix}\right)\)
Find the sum of diagonal elements of \(adjβ‘(A)\).
\(adjβ‘(A)=\left(\begin{pmatrix}4 & -2\\ -3 & 1\end{pmatrix}\right)\)
Sum of diagonal \(=4+1=5\)
QUESTION 4 OF 20
Identify the incorrect statement:
QUESTION 5 OF 20
If a matrix is singular, its determinant is:
QUESTION 6 OF 20
If \(β£Aβ£=0\), the probability that \(A\) is non-invertible is:
QUESTION 7 OF 20
If determinant \(=\pm 8\neq 0\), the matrix is:
QUESTION 8 OF 20
A matrix is invertible if it is:
QUESTION 9 OF 20
\(A^{-1}=\frac{adjβ‘(A)}{β£Aβ£}\)
If \(β£Aβ£=0\), compute \((adjβ‘A)B\) to check consistency.
Which formula gives inverse?
QUESTION 10 OF 20
\(A^{-1}=\frac{adjβ‘(A)}{β£Aβ£}\)
If \(β£Aβ£=0\), compute \((adjβ‘A)B\) to check consistency.
If \(A\) is singular, compute:
QUESTION 11 OF 20
Given dataset: 2,3,5,X.
The moving average of period 2 for the last two values is:
\(\frac{5+X}{2}\)
Also,
\(β£ABβ£=β£Aβ£β£Bβ£=3\times 2=6\)
So,
\(\frac{5+X}{2}=6\Rightarrow 5+X=12\Rightarrow X=7\)
QUESTION 12 OF 20
Match expressions with meanings:
| List I | List II |
|---|---|
| 1. \(AB=I\) | a. Invertibility condition |
| 2. \(β£Aβ£\neq 0\) | b. \(B\) is inverse of \(A\) |
| 3. \(A(adjβ‘A)=β£Aβ£I\) | c. Fundamental adjoint theorem |
QUESTION 13 OF 20
Evaluate:
\(\int_{0}^{1}\,2xβdx=[x^{2}]_{0}^{1}=1\)
QUESTION 14 OF 20
Assertion (A): \(X=A^{-1}B\) gives the unique solution when \(A\) is non-singular.
Reason (R): Premultiplying \(AX=B\) by \(A^{-1}\)gives \(A^{-1}A=I\).
QUESTION 15 OF 20
Two linearly independent vectors in a plane correspond to:
QUESTION 16 OF 20
Which conditions imply inconsistency?
I. \(β£Aβ£=0\)
II. \((adjβ‘A)B\neq 0\)
III. Infinite solutions
QUESTION 17 OF 20
For a unique solution, \(β£Aβ£\)must be:
QUESTION 18 OF 20
\(A=\left(\begin{pmatrix}1 & 2\\ 2 & 4\end{pmatrix}\right)β£Aβ£=1β 4-2β 2=4-4=0\)
QUESTION 19 OF 20
Arrange the following steps involved in solving a system of linear equations using the inverse matrix method in the correct sequence.
1. Define the variables.
2. Form the equations from the given problem.
3. Write the system in matrix form \(AX=B\).
4. Solve using \(X=A^{-1}B\).
QUESTION 20 OF 20
Identify incorrect statement:
Test Complete!
Answer Review
1 Arrange the correct steps to form \(adjβ‘(A)\)for \(A=[a_{ij}]\):
1. Find all minors \(M_{ij}\)
2. Apply signs to obtain cofactors \(A_{ij}=(-1)^{\left(i,\ j\right)}M_{ij}\)
3. Form the cofactor matrix \(\left[A_{ij}\right]\)
4. Transpose the cofactor matrix
Adjoint uses cofactors and transpose First compute minors Then apply signs and transpose
To construct \(adjβ‘(A)\), first compute minors, then apply signs to obtain cofactors. Next form the cofactor matrix, and finally transpose it. Thus the correct order is: \(1\rightarrow 2\rightarrow 3\rightarrow 4\) Hence Option B is correct.
- Option A β Cofactor matrix cannot be formed before applying sign factors.
- Option C β Signs cannot be applied before calculating minors.
- Option D β Transpose is the final step, not the first step.
Used
- Option Grouping
Application:
- Arrange steps according to the standard adjoint-construction procedure.
Final Logic:
- Adjoint is transpose of cofactor matrix obtained after minors and signs.
"Minor β Sign β Cofactor β Transpose"
2 Which statements are correct?
I. Adjoint is defined only for square matrices
II. \(\left(i,\ j\right)\)element of \(adjβ‘(A)\)is \(A_{ji}\)
III. It is required to compute \(A^{-1}\)when \(β£Aβ£\neq 0\)
Adjoint exists for square matrices Adjoint uses transpose of cofactors Inverse formula involves adjoint
All three statements are correct. Adjoint is defined only for square matrices. The \(\left(i,\ j\right)\)entry of \(adjβ‘(A)\)equals the cofactor \(A_{ji}\)due to transposition. Also, \(A^{-1}=\frac{adjβ‘(A)}{β£Aβ£}\) for non-singular matrices. Hence Option D is correct.
- Option A β Ignores Statement III, which correctly relates adjoint to inverse computation.
- Option B β Excludes Statement I, although adjoint is defined only for square matrices.
- Option C β Omits Statement II, which correctly describes adjoint entries.
Used
- Option Grouping
Application:
- Verify each statement independently using standard adjoint properties.
Final Logic:
- All three statements satisfy the definition and inverse relation.
"Adjoint = transpose of cofactors"
3 Let
\(A=\left(\begin{pmatrix}1 & 2\\ 3 & 4\end{pmatrix}\right)\)
Find the sum of diagonal elements of \(adjβ‘(A)\).
\(adjβ‘(A)=\left(\begin{pmatrix}4 & -2\\ -3 & 1\end{pmatrix}\right)\)
Sum of diagonal \(=4+1=5\)
Adjoint diagonal entries are 4 and 1 Add principal diagonal terms Result equals 5
For: \(A=\left(\begin{pmatrix}1 & 2\\ 3 & 4\end{pmatrix}\right)\) Adjoint is: \(\left(\begin{pmatrix}4 & -2\\ -3 & 1\end{pmatrix}\right)\) Diagonal elements are 4 and 1. Their sum: \(4+1=5\) Hence Option A is correct.
- Option B β Incorrect addition doubles the actual trace.
- Option C β Negative value does not arise from adding diagonal entries.
- Option D β Sign error occurs in diagonal summation.
Used
- Substitution
Application:
- Use the given adjoint matrix and add its principal diagonal elements.
Final Logic:
- Trace of the adjoint matrix equals 5.
"Trace = sum of diagonal"
4 Identify the incorrect statement:
Adjoint uses cofactors and transpose Determinant sign change is unrelated 2Γ2 adjoint swaps diagonal entries
Adjoint is formed by taking the transpose of the cofactor matrix, not by changing the sign of the determinant. Thus Option C is incorrect. Options A and B correctly define minors and cofactors, while Option D describes the standard 2Γ2 adjoint construction rule.
- Option A β Correct definition of a minor.
- Option B β Correct cofactor formula using checkerboard sign pattern.
- Option D β Correct rule for forming adjoint of a 2Γ2 matrix.
Used
- Elimination
Application:
- Compare each statement with the formal definition of adjoint.
Final Logic:
- Adjoint depends on cofactors and transpose, not determinant sign change.
"Adjoint = transpose of cofactors"
5 If a matrix is singular, its determinant is:
Singular matrices are non-invertible Zero determinant defines singularity Inverse does not exist
A matrix is singular if: \(β£Aβ£=0\) Such matrices are non-invertible because division by zero determinant is impossible in inverse formulas. Hence Option B is correct.
- Option A β Negative determinants may still correspond to invertible matrices.
- Option C β Positive determinants also allow inverses.
- Option D β Determinants are always defined for square matrices.
Used
- Contextual/Tonal Matching
Application:
- Recall the standard algebraic definition of singular matrices.
Final Logic:
- Singularity is directly linked to zero determinant.
"Singular β determinant zero"
6 If \(β£Aβ£=0\), the probability that \(A\) is non-invertible is:
Zero determinant implies singularity Singular matrices are never invertible Probability becomes certain
If: \(β£Aβ£=0\) then the matrix is singular. Singular matrices do not possess inverses. Therefore the probability that \(A\) is non-invertible equals 1. Hence Option B is correct.
- Option A β Invertibility is impossible when determinant is zero.
- Option C β No uncertainty exists; the condition guarantees singularity.
- Option D β Non-invertibility is certain, not partial.
Used
- Contextual/Tonal Matching
Application:
- Use the determinant criterion for invertibility directly.
Final Logic:
- Zero determinant guarantees non-invertibility.
"Determinant zero β inverse impossible"
7 If determinant \(=\pm 8\neq 0\), the matrix is:
Nonzero determinant implies invertibility Singular matrices require zero determinant Matrix becomes non-singular
Since: \(β£Aβ£=\pm 8\neq 0\) the determinant is nonzero. Therefore the matrix is invertible and hence non-singular. Thus Option C is correct.
- Option A β Null matrices have determinant zero.
- Option B β Singular matrices require determinant equal to zero.
- Option D β Identity matrices specifically have determinant 1.
Used
- Elimination
Application:
- Apply the determinant criterion for singularity and invertibility.
Final Logic:
- Any nonzero determinant implies non-singular matrix.
"Nonzero determinant β inverse exists"
8 A matrix is invertible if it is:
Invertibility requires nonzero determinant Non-singular matrices satisfy condition Singular matrices lack inverses
A matrix is invertible when: \(β£Aβ£\neq 0\) Such matrices are called non-singular. Therefore Option D is correct. Symmetry alone does not guarantee invertibility.
- Option A β Zero matrix always has determinant zero.
- Option B β Singular matrices cannot have inverses.
- Option C β Symmetric matrices may still be singular.
Used
- Contextual/Tonal Matching
Application:
- Use the standard equivalence between invertibility and non-singularity.
Final Logic:
- Invertibility requires a nonzero determinant.
"Non-singular means invertible"
9
\(A^{-1}=\frac{adjβ‘(A)}{β£Aβ£}\)
If \(β£Aβ£=0\), compute \((adjβ‘A)B\) to check consistency.
Which formula gives inverse?
Inverse uses adjoint and determinant Determinant must be nonzero Standard inverse formula
For a non-singular matrix: \(A^{-1}=\frac{adjβ‘(A)}{β£Aβ£}\) This is the standard inverse formula. Hence Option A is correct. Other expressions misuse determinants or adjoints algebraically.
- Option B β Determinant cannot be divided by a matrix meaningfully here.
- Option C β Determinant of adjoint is not the inverse matrix.
- Option D β Dividing matrix entries directly by determinant does not produce inverse.
Used
- Contextual/Tonal Matching
Application:
- Use the inverse formula stated directly in the passage.
Final Logic:
- Inverse equals adjoint divided by determinant.
"Inverse = adjoint over determinant"
10
\(A^{-1}=\frac{adjβ‘(A)}{β£Aβ£}\)
If \(β£Aβ£=0\), compute \((adjβ‘A)B\) to check consistency.
If \(A\) is singular, compute:
Singular matrices lack inverses Consistency uses adjoint multiplication Passage directly states required computation
When: \(β£Aβ£=0\) the inverse does not exist. In such cases, consistency of the system is checked using: \((adjβ‘A)B\) as stated in the passage. Hence Option C is correct.
- Option A β Simple addition has no consistency-checking role.
- Option B β Inverse cannot exist for singular matrices.
- Option D β Multiplying by determinant does not test consistency.
Used
- Contextual/Tonal Matching
Application:
- Use the exact instruction given in the passage for singular matrices.
Final Logic:
- Singular systems are checked using \((adjβ‘A)B\).
"Singular? Use adjoint-times-B"
11 Given dataset: 2,3,5,X.
The moving average of period 2 for the last two values is:
\(\frac{5+X}{2}\)
Also,
\(β£ABβ£=β£Aβ£β£Bβ£=3\times 2=6\)
So,
\(\frac{5+X}{2}=6\Rightarrow 5+X=12\Rightarrow X=7\)
Use moving-average formula Equate with determinant product value Solve resulting linear equation
The moving average of the last two values is: \(\frac{5+X}{2}\) Given: \(β£ABβ£=β£Aβ£β£Bβ£=3\times 2=6\) Equating: \(\frac{5+X}{2}=65+X=12X=7\) Thus Option D is correct.
- Option A β Substitution gives moving average \(=5\), not 6.
- Option B β Produces moving average \(5.5\), not the required value.
- Option C β Gives moving average \(6.5\), exceeding the condition.
Used
- Substitution
Application:
- Substitute determinant-product value into the moving-average equation.
Final Logic:
- Solving the equation yields \(X=7\).
"Average equation β isolate \(X\)"
12 Match expressions with meanings:
| List I | List II |
|---|---|
| 1. \(AB=I\) | a. Invertibility condition |
| 2. \(β£Aβ£\neq 0\) | b. \(B\) is inverse of \(A\) |
| 3. \(A(adjβ‘A)=β£Aβ£I\) | c. Fundamental adjoint theorem |
Identity product indicates inverse Nonzero determinant ensures invertibility Adjoint theorem connects determinant and adjoint
If: \(AB=I\) then \(B\) is inverse of \(A\). Also, \(β£Aβ£\neq 0\) is the condition for invertibility. Finally, \(A(adjβ‘A)=β£Aβ£I\) is the fundamental adjoint theorem. Hence matching is: \(1-b,β β2-a,β β3-c\) Therefore Option B is correct.
- Option A β Incorrectly swaps inverse relation and invertibility condition.
- Option C β Fundamental adjoint theorem is mismatched.
- Option D β Identity product does not itself represent invertibility condition.
Used
- Option Grouping
Application:
- Match each matrix expression with its standard algebraic interpretation.
Final Logic:
- Each expression corresponds uniquely to a known theorem or condition.
"AB=I means inverse"
13 Evaluate:
\(\int_{0}^{1}\,2xβdx=[x^{2}]_{0}^{1}=1\)
Integrate \(2x\) to get \(x^{2}\) Apply limits carefully Final value equals 1
Integrating: \(\int 2xβdx=x^{2}\) Applying limits: \(\left[x^{2}]_{0}^{1}=1^{2}-0^{2}=1\right.\) Thus Option A is correct.
- Option B β Incorrectly doubles the evaluated result.
- Option C β Ignores upper-limit contribution.
- Option D β Represents incorrect integration or averaging.
Used
- Substitution
Application:
- Apply definite integration formula using upper and lower limits.
Final Logic:
- \(1^{2}-0^{2}=1\).
"Integral of \(2x\)β \(x^{2}\)"
14 Assertion (A): \(X=A^{-1}B\) gives the unique solution when \(A\) is non-singular.
Reason (R): Premultiplying \(AX=B\) by \(A^{-1}\)gives \(A^{-1}A=I\).
Non-singular matrices have inverses Premultiplication produces identity matrix Unique solution follows immediately
For a non-singular matrix: \(A^{-1}Β exists\) From: \(AX=B\) Premultiplying by \(A^{-1}\): \(A^{-1}AX=A^{-1}BIX=A^{-1}BX=A^{-1}B\) Thus both statements are true and the Reason correctly explains the Assertion.
- Option A β Both statements are standard matrix-equation results.
- Option B β Reason is true because inverse multiplication gives identity matrix.
- Option D β Assertion is correct for non-singular matrices.
Used
- Contextual/Tonal Matching
Application:
- Relate inverse multiplication directly to matrix-equation solving.
Final Logic:
- Inverse existence guarantees unique solution.
"Multiply by inverse β isolate \(X\)"
15 Two linearly independent vectors in a plane correspond to:
Linear independence implies non-singularity Unique representation exists System has exactly one solution
Two linearly independent vectors form a basis in the plane. The corresponding coefficient matrix becomes non-singular, ensuring a unique solution for the associated system. Hence Option D is correct.
- Option A β Linear independence does not eliminate all solutions.
- Option B β Systems generally have one unique solution, not exactly two.
- Option C β Infinite solutions occur only under dependence conditions.
Used
- Contextual/Tonal Matching
Application:
- Use the relationship between linear independence and invertibility.
Final Logic:
- Independent vectors guarantee a unique solution.
"Independent β unique"
16 Which conditions imply inconsistency?
I. \(β£Aβ£=0\)
II. \((adjβ‘A)B\neq 0\)
III. Infinite solutions
Singular systems may become inconsistent Adjoint condition tests compatibility Infinite solutions imply consistency
If: \(β£Aβ£=0\) the system is singular. Further, if: \((adjβ‘A)B\neq 0\) the system becomes inconsistent. Infinite solutions indicate consistency, not inconsistency. Hence Statements I and II are correct, making Option A correct.
- Option B β Infinite solutions correspond to consistent dependent systems.
- Option C β Infinite solutions do not imply inconsistency.
- Option D β Statement III contradicts inconsistency conditions.
Used
- Elimination
Application:
- Separate inconsistent conditions from infinitely consistent cases.
Final Logic:
- Only Statements I and II imply inconsistency.
"Singular + incompatible β inconsistent"
17 For a unique solution, \(β£Aβ£\)must be:
Unique solution requires inverse Inverse exists for nonzero determinant Non-singular matrices guarantee uniqueness
A unique solution exists only when: \(β£Aβ£\neq 0\) Then \(A\) is non-singular and invertible, allowing: \(X=A^{-1}B\) Hence Option B is correct.
- Option A β Zero determinant produces singular systems.
- Option C β Determinant need not equal exactly 1.
- Option D β Determinant may be positive or negative as long as nonzero.
Used
- Elimination
Application:
- Use the determinant criterion for invertibility and uniqueness.
Final Logic:
- Nonzero determinant guarantees unique solution.
"Unique β determinant nonzero"
18 \(A=\left(\begin{pmatrix}1 & 2\\ 2 & 4\end{pmatrix}\right)β£Aβ£=1β 4-2β 2=4-4=0\)
Use \(ad-bc\) formula Rows are proportional Determinant becomes zero
For: \(A=\left(\begin{pmatrix}1 & 2\\ 2 & 4\end{pmatrix}\right)\) Determinant: \(β£Aβ£=1(4)-2(2)=4-4=0\) Hence Option A is correct. The matrix is singular because its rows are proportional.
- Option B β Incorrect subtraction during determinant evaluation.
- Option C β Ignores cancellation of equal products.
- Option D β Represents multiplication instead of determinant subtraction.
Used
- Substitution
Application:
- Apply the 2Γ2 determinant formula directly.
Final Logic:
- Equal products cancel, giving determinant zero.
"Proportional rows β determinant zero"
19 Arrange the following steps involved in solving a system of linear equations using the inverse matrix method in the correct sequence.
1. Define the variables.
2. Form the equations from the given problem.
3. Write the system in matrix form \(AX=B\).
4. Solve using \(X=A^{-1}B\).
Define the unknown variables first. Translate the information into linear equations. Express the equations in matrix form and apply the inverse method.
The inverse matrix method follows a systematic procedure. Step 1: Define the unknown variables. Example: Let x = first unknown y = second unknown Step 2: Form the required linear equations from the given information. Example: 2x + 3y = 8 x β y = 1 Step 3: Express the equations in matrix form. AX = B where A = Coefficient matrix X = Variable matrix B = Constant matrix That is, A = | 2 3 | | 1 -1 | X = | x | | y | B = | 8 | | 1 | Step 4: Find the inverse of A (if it exists) and compute X = Aβ»ΒΉB This gives the values of the unknown variables. Therefore, the correct sequence is 1 β 2 β 3 β 4 Hence, Option C is correct.
- Option A β Incorrect because the inverse method cannot be applied before writing the matrix equation.
- Option B β Incorrect because variables must be defined before forming equations.
- Option D β Incorrect because the matrix equation cannot be written before defining variables and forming the equations.
Used: Contextual/Tonal Matching
Application:
- Arrange the steps according to the standard NCERT procedure for solving simultaneous linear equations using the inverse matrix method.
Final Logic:
- Define variables β Form equations β Write matrix equation β Apply the inverse matrix method.
"Define β Form β Matrix β Inverse"
20 Identify incorrect statement:
Matrix method uses inverses Coefficient matrix forms system Determinant addition is unrelated
The matrix method solves: \(AX=B\) using: \(X=A^{-1}B\) It relies on inverses and coefficient matrices, not addition of determinants. Therefore Option D is incorrect. Options A, B, and C correctly describe the matrix method.
- Option A β Matrix inversion is a standard solving technique.
- Option B β \(A\) indeed represents the coefficient matrix.
- Option C β Matrix inversion works only for consistent non-singular systems.
Used
- Elimination
Application:
- Compare each statement with the standard inverse-matrix method.
Final Logic:
- Determinants are not added to compute solution vectors.
"Inverse solves, determinants don't add"
