MCQs Asked in Previous NET EXAMINATION

1) Let be the set of × upper triangular matrices over ℂ. The dimension of as a vector space over ℂ
is

( )
(A) (B) (C) (D) ( − 1)
1 2
Sol: If = 2 and = is upper triangular matrix it can expressed as
0 3
1 2 1 0 0 1 0 0
= = 1. +2 +3
0 3 0 0 0 0 0 1
( )
There are three vectors in the basis, therefore, dimV = 3 =

1 2 5
If = 3 and = 0 3 −1 is upper triangular matrix it can expressed as
0 0 4
1 2 5 1 0 0 0 1 0 0 0 1 0 0 0 0 0 0 0 0 0
= 0 3 −1 = 1 0 0 0 + 2 0 0 0 + 5 0 0 0 + 3 0 1 0 + (−1) 0 0 1 + 4 0 0 0
0 0 4 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1
( )
There are six vectors in the basis, therefore, dimV = 6 =

2) Let be a finite dimension vector space over field , be a linearly independent subset of , be a
basis of and be a set of generators of . Then

(A) | | ≤ | | ≤ | | (B) | |>| |>| | (C) | | > | | ≥ | | (D) | | ≥ | | > | |

Sol: Since ⊆ ⊆ ⊆ ⟹ | |≤| |≤| |
3) Let be a -dimension vector space over field , : → be a linear transformation. Which of the
following statements is correct?
(A) is 1-1 implies is onto, but not vice versa (B) is onto implies is 1-1, but not vice versa

(C) is 1-1 if and only if is onto (D) There is no relationship between being 1-1 and
being onto.
Sol: is 1-1 if and only if is onto
4) Let and be × matrices over field . Let be the statement “ is invertible”. Let be the
statement “Both and are invertible”. Then

(A) ⟹ ⇏ (B) ⟹ ⇏

(C) ⟺ (D) There is no relationship between the statements ,

Sol: ⟺
Since, If is invertible then ( ) exists and ( ) = ⟹ Both and are invertible
If both and are invertible then and exist ⟹ =( ) ⟹ is invertible.

1
 MCQs Asked in Previous NET EXAMINATION

5) Let : ℝ ⟶ ℝ be a linear transformation such that the Eigen values of are 1, √2, − √2. Then the
maximum number of linearly independent eigen vectors of is

(A) 4 (B) 3 (C) 5 (D) 2

Sol: 3; Sinc has three distinct eigen values, then the eigen vectors corresponding to these eigen values
are linearly independent

6) Let and be × matrices over field . Let rank = . Then

(A) = (B) = but = −

(C) = = (D) must be n.
Sol: By sylvester’s inequality + − ≤ ≤ min { , }
≤ ≤ and ≤ ≤ .
Hence = =
7) Let be a vector space with basis = {1, , 2 + , }, the matrix representing ∶ → related
to basis is give by

0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
(A) 0 0 0 0 (B) 1 0 0 0 (C) 1 0 0 0 (D) 0 0 0 0
2 2 0 0 0 2 0 0 2 2 0 0 0 1 0 1
0 1 3 0 0 −6 3 0 0 −6 3 0 0 −6 3 0

8) Let be a linear operator on a finite dimensional inner product space over ℂ. Then is unitary if and
only if
∗ ∗ ∗ ∗ ∗ ∗
(A) = (B) = (C) + = (D) = =

9) If is an × matrix over a field . Then

(A) There is no relationship between Eigen values of and those of
(B) All Eigen values of are also Eigen values of with same multiplicities
(C) A scalar ∈ an Eigen value of if and only if it is an Eigen value of
(D) If a nonzero scalar ∈ is an Eigen value of then it is an Eigen value of but not vice versa

10) If is a vector space of all polynomials of degree at most 10 with coefficients from a field , then
the dual space ∗ is a vector space over of dimension

(A) 10 (B) 12 (C) 9 (D) 11

11) If is an 3 × 3 nonsingular matrix such that = . The determinant of is

(A) 0 (B) √2 (C) −2 (D) 1

12) The dimension of the space of all linear maps from ℝ into itself, for ≥ 2 is
2
 MCQs Asked in Previous NET EXAMINATION

(A) (B) ! (C) (D) Infinite

13) The matrix of the linear transformation : ℝ ⟶ ℝ given by ( , , , )=( , , , )

(w.r.t. the standard basis) given by
0 0 1 0 0 1 0 0 0 1 0 0 1 1 1 0
(A) 1 0 0 0 (B) 0 0 1 0 (C) 0 0 0 1 (D) 1 0 0 0
0 0 0 1 1 0 0 0 1 0 0 0 1 1 1 1
0 1 0 0 0 1 0 0 0 0 1 0 1 1 0 0

0 1 −2 3 −4
⎡−1 0 0 0 0 ⎤⎥
14) Let = ⎢⎢ 2 0 0 0 1 ⎥. Then
⎢−3 0 0 0 −1⎥
⎣ 4 0 −1 1 0⎦

(A) =0 (B) =1 (C) = −3 (D) =5

−1 0 0 0
Sol: Determinant expansion of A along second column is = 1. 2 0 0 1 + remaining terms are 0
−3 0 0 −1
4 −1 1 0

0 0 1
Determinant expansion of above determinant along first row is = −1 0 0 −1 + remaining terms are 0
−1 1 0
Hence det(A)=0
3 1 1 1
15) Let = 1 3 1 1 the Eigen values are
1 1 3 1
1 1 1 3
(A) 3 1 (B) 6 3 (C) 3 2 (D) 6 2

16) The dual basis of the basis = {(1, 1), (2, 1)} of ℝ is

(A) {(2, 1), (1,1)} (B) {(−1, 2), (1, − 1)} (C) {(−1, −2), (−1, −1)} (D) {(1, 0), (0, 1)}

1 2 ⋯
2 3 ( + 1)
17) Consider the matrix = for ≥ 4. Then the determinant of is:
⋮ ⋱ ⋮
( + 1) ⋯ (2 − 1)

(A) 0 (B) (C) (D)

3
 MCQs Asked in Previous NET EXAMINATION

1 2 3 4 1 4 9 16 1 0 0 1
4 9 ( )= 0 1 0 −3
Sol: If n=4 then = 2 3 4 5 = 16 25 ⟹
3 4 5 6 9 16 25 36 0 0 1 3
4 5 6 7 16 25 36 49 0 0 0 0
( )=0
1 2 3 4 5
⎡ ⎤ ⎡1 4 9 16 25
⎤
1
⎡0
0 0 1 3
⎢2 3 4 5 6 ⎥ ⎢ 4 9 16 25 36⎥ 1 0 −3 −8⎤⎥
If n=5 then = ⎢3 4 5 6 7 ⎥ = ⎢ 9 16 25 36 49⎥ ⟹ ( ) = ⎢⎢0 0 1 3 6⎥
⎢4 5 6 7 8 ⎥ ⎢16 25 36 49 64⎥ ⎢0 0 0 0 0⎥
⎣5 6 7 8 9 ⎦ ⎣25 36 49 64 81⎦ ⎣0 0 0 0 0⎦
( ) = 0. We generalized the result for any natural number.

18) Let be the subspace of the space of polynomials ℝ[ ], of degree at most n. Let { , ,. . . } be
a basis of . Then

(A) Some has degree 0 (B) The have distinct degrees

(C) Some has degree n (D) The have the same degrees

−
19) The matrix = , ∈ ℝ has real Eigen values if and only if

(A) is a multiple of (B) is a multiple of 2

(C) is a multiple of 2 (D) is reflection.

−
Sol: = characteristic equation is given by − ( ) + = 0
− (2 ) +( + ) = 0⇒ − (2 ) +1 = 0
±√ ± ( )
= = = ± (− ) for real roots, =0 . . =
20) Let ={ ∈ (ℝ); = 0} then dimension of V is
( ) ( )
(A) −1 (B) ( − 1) (C) (D)

21) Let ∈ (ℝ), = 0, then

(A) 0 is not an Eigen value
(B) 0 is an Eigen value of but 0 is not an Eigen value
(C) The rank of is strictly less than
(D) must be nilpotent

22) If is a linear operator on a vector space with characteristic polynomial ( − 4) and minimal
polynomial ( − 4), then the rank of is

(A) 5 (B) 4 (C) 5 − 4 (D) 5 + 4

23) If ∈ (ℝ) and is diagonalizable and nilpotent, then

4
 MCQs Asked in Previous NET EXAMINATION

0 0 0 1 0 0 0 0 1 0 0 0
(A) = 1 0 0 (B) = 0 2 0 (C) = 0 0 0 (D) = 0 0 0
0 2 0 0 0 −3 0 0 0 0 0 0

24) Let be a 10 × 10 matrix such that = . Then the minimal polynomial of can not be

(A) ( ) = ( − 1)( − 2) (B) ( ) = (C) ( ) = ( − 1) (D) ( ) = ( − 1)

1 2 3 4
25) If ∈ (ℝ) and is similar to the matrix = 0 5 6 7 . Let = + ( )= + .
0 0 8 9
0 0 0 10
Then trace B is

(A) 1 + 5 + 8 + 10 (B)1 + 5 + 8 + 10 (C) ∑ () (D) (1) + (5) + (8) + (10)

26) If ∈ (ℝ), = 0 and ≠ 0 then Jordan canonical form for is

1 0 0 0 1 0 0 1 0 0 0 1
(A) 0 1 0 (B) 0 0 1 (C) 0 0 0 (D) 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0

27) Let be a finite dimensional vector space over field and : → be a linear transformation.
Then

(A) If = ℤ then must have an Eigen Value (B) If = ℚ then must have an Eigen Value

(C) If = ℝ then must have an Eigen Value (D) If = ℂ then must have an Eigen Value

28) Let = { : ℝ → ℝ, is a polynomial of degree ≤ 5}, = ℝ {1, 2+ , 3+ + ,3 +2 + }.

Define an inner product on by < , > = ∫ ( ) ( ) . Then dimension of

(A) is 1 (B) is 3 (C) is 4 (D) cannot be determine

29) Let : → be a linear transformation on a vector space such that every one dimensional
subspace of is invariant under . Then
(A) must be onto
(B) must be one to one
(C) There exists a scalar such that = for all
(D) If { , , . . . } is a basis of then there exists distinct scalar constants , , . . . such
that = .

30) Let ∈ ( ) and let characteristic polynomial of be ( − )( − ) with ≠ then the

minimal polynomial of is

(A) ( − ) (B) ( − ) (C) ( − )( − ) (D) None of the above

5
 MCQs Asked in Previous NET EXAMINATION
∗
31) Let be a finite dimension vector space over field and ={ : → , }. then

∗∗
(A) is isomorphic to ∗ and ∗ is not isomorphic to
∗∗
(B) is isomorphic to ∗ and ∗ is isomorphic to
∗∗
(C) is not isomorphic to ∗ and ∗ is not isomorphic to
∗∗
(D) is not isomorphic to ∗ and ∗ is isomorphic to

32) Consider ℝ with usual inner product space, for ⊆ ℝ = { ∈ ;< , >= 0, ∀ ∈ }. Then
(A) is a subspace of ℝ if and only if is a subspace of ℝ
(B) is never a subspace of ℝ
(C) is always a subspace of ℝ
(D) is a subspace of ℝ then is a subspace of ℝ

33) Let ={ ∈ (ℝ); }, then dimension of is

( ) ( )
(A) (B) −1 (C) − (D)

34) Let ∈ (ℝ). Then

(A) rank must be equal to rank (B) rank ≥ rank

(C) rank ≤ rank (D) rank must be strictly less than rank

2 1
35) Let = which of the following matrices is zero?
3 −1
(A) − −5 (B) + −5 (C) + + (D) −3 +5

Sol: Chara poly of A is − − 5 by Cayley –Hamilton thm, A satisfies its chara poly ⇒ option (A) is
correct
3 4
36) Which of the following matrices is similar to
5 6
6 3 6 5 6 3 6 5
(A) (B) (C) (D)
5 4 4 3 4 5 3 4

37) If is an 10 × 10 idempotent matrix, that is = and ≠ , ≠ 0. Then the degree of the

minimal polynomial of is

(A) 10 (B) 2 (C) 1 (D) 100

1 2 3 4
38) Let ∈ (ℝ) be similar to the matrix = 0 5 6 7 . Then trace is
0 0 8 9
0 0 0 10
(A) 3 + 7 (B)2 + 6 + 9 (C) 4 (D) 1 + 5 + 8 + 10

6
 MCQs Asked in Previous NET EXAMINATION

39) Let be a × matrix over ℝ and ∈ ℝ . Let ={ ∈ℝ ; = }. Then

(A) ≠ (B) must be a subspace of ℝ

(C) must be a singleton set (D) None of the above necessarily true

40) Let , ∈ (ℝ). If and are nilpotent, then

(A) + is invertible (B) + is nilpotent

(C) 0 is an Eigen value of + with multiplicity

(D) None of the above
one

41) Let , ∈ (ℝ) be diagonalizable matrices. There exists a non singular matrix Let such that
and are diagonal

(A) For all such , (B) If and only if = .

(C) Only if , are non singular (D) If only if and are symmetric

2 4
42) Let = . Then = where is equal to
1 2
(A) 2 (B) 2 (C) 2 (D) 2
2 4 8 16 ) = 8 16 2048 4096
Sol: = = =( = = 2 ∗2 2 ∗4 =2 ∗
1 2 4 8 4 8 1024 2048 2 ∗1 2 ∗2

43) Let ∈ ( ) commute with all diagonal matrices in Let ( ). Then

(A) must be a scalar matrix (B) must be a non singular matrix

(C) must be 0 (D) must be a diagonal matrix

44) Let : → be a linear transformation and the characteristic polynomial of be ( − 2) ( + 3)

and minimal polynomial of be ( − 2)( + 3) . Then the Jordan canonical form of A is
2 0 0 0 2 0 0 0 2 0 0 0 2 0 0 0
(A) 0 2 0 0 (B) 1 2 1 0 (C) 1 2 0 0 (D) 0 2 0 0
0 0 −3 0 0 0 −3 0 0 0 −3 0 0 0 −3 0
0 0 0 −3 0 0 1 −3 0 0 0 −3 0 0 1 −3

45) Consider ℝ with usual inner product space, for ⊆ ℝ = { ∈ ; < , >= 0, ∀ ∈ }. Then
(A) is a subspace of ℝ and =
(B) is need not be a subspace of ℝ and =
(C) is a subspace of ℝ and =
(D) is need not be a subspace of ℝ and =
0 1 0 1 1 2 1 2
46) Let = , = , = , = be matrices over ℂ. Then
0 0 0 2 0 3 3 4
7
 MCQs Asked in Previous NET EXAMINATION

(A) is not diagonalizable (B) is not diagonalizable

(C) is not diagonalizable (D) is not diagonalizable

47) Let ∈ ℝ, : ℝ → ℝ be ( ) = for = 1, 2, 3. Then

(A) , , are linearly independent

(B) , , are linearly independent if and only if ≠
(C) , , are linearly independent if and only if ≠ , ≠
(D) , , are linearly independent if and only if ≠ , ≠ , ≠

48) If characteristic polynomial of a 4 × 4 matrix over ℂ is ( − 1) ( − 2) and its minimal

polynomial is ( − 1) ( − 2). Then its Jordan canonical form is
1 0 0 0 1 0 0 0 1 0 0 0 1 0 0 0
(A) 0 1 0 0 (B) 0 1 0 0 (C) 1 1 0 0 (D) 1 1 0 0
0 0 2 0 0 0 2 0 0 0 2 0 0 0 2 0
0 0 0 2 0 0 1 2 0 0 0 2 0 0 1 2

CSIR NET EXAM JUNE-2009

49) Let { , , }be a basis of a vector space V over ℝ . Consider the following sets:
= { , + , + + }, = { , - , − + }, = { 2 , 3 + , 6 + 3 + }
(A) A and B are bases of V. (B) A and C are bases of V.

(C) B and C are bases of V. (D) Only B is a basis of V.

Sol: Given = { , , } be a basis of V over ℝ. Consider = { , + , + + },
suppose + ( + )+ ( + + )=0⇒ ( + ) +( + + ) + =0
⇒ + = 0, + + = 0, = 0 since , , are linearly independent, hence vectors in A are
linearly independent and hence forms a basis for V.
(Using dim.V =3 and any linearly independent set with 3 vectors form a basis.)
Similarly, consider = { , - , − + },
Suppose + ( - ) + ( − + ) = 0 ⇒ = = = 0 ⇒ forms a basis for V.
Same as above consider = { 2 , 3 + , 6 + 3 + }, here 6 + 3 + = 3(2 ) + 3 + , hence
linearly dependent, and hence doesn't form a basis of V. A and B are bases of V.

50) Let be an × matrix and = ( 1, 2, … , ) . Consider the following statements:

(a) If rank A = n, the system has a unique solution
(b) If rank A < n, the system has infinitely many solutions.
(c) If b = 0, the system has at least one solution.
Which of the following is correct?
(A) (a) and (b) are true. (B) (a) and (c) are true. (C) only (a) is true. (D) only (b) is true.
Sol: We have × × = × If = , then unique solution exists.
if < , solution may or mayn't exist. if = 0, then the system has at least one
solution(zero solution). Hence (a) and (c) are true.
8
 MCQs Asked in Previous NET EXAMINATION

0 1 1
51) Let = 1 0 1 Then the eigenvalues of A are
1 1 0
(A) 2, 0. (B) 2, + 1 1– 1. (C) 2, – 1 – 1. (D) 1, – 1 0.
0 1 1
Sol: = 1 0 1 Characteristic equation of is given by
1 1 0
− ( ) + (A11 + A22 + A33) − | | = 0
− 0 + (−1 − 1 − 1) − 2 = 0 ⇒ − 3 − 2 = 0 ⇒ ( − 1) ( − 2) = 0
Hence eigen values are -1,-1,2.
−
52) Let = be such that A has real eigenvalues. Then

(A) = for some integer (B) = 2 + ⁄2 for some integer .

(C) There is no restriction on . (D) =2 + ⁄4 for some integer .

−
Sol: = characteristic equation is given by − ( ) + = 0
− (2 ) +( + ) = 0⇒ − (2 ) +1 = 0
±√ ± ( )
= = = ± (− ) for real roots, =0 . . = .

53) Let = ( )be an × matrix with real entries such that the sum of all the entries in
each row is zero. Consider the following statements:
(a) A is non-singular.
(b) A is singular.
(c) 0 is an eigenvalue of A.
Which of the following is correct?
(A) Only (a) is true. (B) (a) and (c) are true. (C) (b) and (c) are true. (D) Only (c) is true.
Sol: Sum of entries in each row implies determinant = 0.
Which implies that A is singular and 0 is an eigen value. Hence (b) and (c) are true.

1 2 2
54) Let = 2 1 2 Then the minimal polynomial of A is
2 2 1
(A) − 4 − 5. (B) + 5 + 4. (C) −3 − 9 − 5. (D) +3 −9 +5
Sol: Characteristic polynomial is given by − ( ) + (A11 + A22 + A33) − | |
− 3 − 9 − 5 ⇒ ( − 1) ( − 5) ⇒ minimal polynomial may be ( − 1)( − 5)
or ( − 1) ( − 5)
we check for ( − 1)( − 5)
consider ( + )( − 5 ) ℎ
Therfore ( − 1)( − 5) is the minimal polynomial for A.
55) Let = ( ) be an × matrix such that = 3 for all and . Then the nullity of A is
9
 MCQs Asked in Previous NET EXAMINATION

(A) –1 (B) –3 (C) (D) 0

3 3 3
Sol: Suppose =3
= 3 3 3 ⇒ =0 ⇒3 +3 +3 =0 ⇒ + + =0
3 3 3
Nullity =2 = number of free variables. Therefore, for matrix A of order n, nullity = n-1
56) Let be a non-zero matrix of order 8 with = 0, Then one of the possible value for rank
of A is

(A) 5 (B) 6 (C) 4 (D) 8

Sol: We know that + − ≤ ,
where A is of order × and B is of order × 1
we take = , therefore + − ≤
⇒ + − 8 ≤ 0⇒2 ≤8 ⇒ ≤4

57) Let = {( , , ) ∈ ℝ | + + = 0 } with standard dot product in ℝ . Then an

orthonormal basis of W is

(A) {(1,0,0), (0,1,0), (0,0,1)} (B) (1,1,1), (1,0, −1), (0,1, −1) .
√ √ √

(C) (1,0, −1), (1,0, −1), (0,1, −1) . (D) (1,1, −2), (1, −1,0)
√ √ √ √ √
Sol: = {( , , ) ∈ ℝ | + + = 0 } one of the basis of W is { = (1, −1,0), = (0, 1, −1)}
= = ( 1, −1,0)
〈 , 〉 〈( , , ),( , , )〉( , , )
= − 〈
= (0, 1, −1) −
〉
= (0, 1, −1) −
〈( ,
( 1, −1,0) = ( 1, 1, −2)
, , ),( , , )〉
now normalize , ⇒ =‖ = (1, −1,0), =‖ = (1,1, −2)
‖ √ ‖ √

CSIR NET EXAM DEC-2009

58) A homogeneous system of 5 linear equations in 6 variables admits

(A) no solution in ℝ (B) a unique solution in ℝ

(C) infinitely many solutions in ℝ (D) finite, but more than 2 solutions in ℝ
Sol: × = 0. Homogeneous system, where number of unknowns is greater than the number
of equations, hence infinitely many solutions exist.
59) Let V be the space of all linear transformations from ℝ to ℝ under usual addition
and scalar multiplication. Then
(A) V is a vector space of dimension 5. (B) V is a vector space of dimension 6.

(C) V is a vector space of dimension 8. (D) V is a vector space of dimension 9.

Sol: : ℝ → ℝ V=Hom(ℝ , ℝ ) Dim.V=3x2 = 6.
60) Let = {( , , … , ) ∈ ℝ | = 0, 2 = 3 − −⋯ = 0}. Then
10
 MCQs Asked in Previous NET EXAMINATION

(A) dim V = 98 (B) dim V = 49 (C) dim V = 99 (D) dim V = 97

Sol: Dim V = number of non trivial elements = 97.
⋯
61) Consider an × matrix ⋮ ⋱ ⋮
A is nonsingular if and only if
⋯

(A) ≠ (B) ≠ −( − 1) (C) ≠ or ≠ −( − 1) (D) ≠ and ≠ −( − 1)

Sol: If = , then all the rows are identical. For any matrix with two identical rows,
we know that | | = 0, which gives that A is singular, so ≠ .
If = −( − 1), then the sum of elements of each row is 0. then | | = 0. So ≠ .
62) Let A:ℝ → ℝ and : ℝ → ℝ be two linear transformations. Then which of the following
can be true.
(A) A and B are one-one (B) A is one-one and B is not one-one.
(C) A is onto and B is one-one (D) A and B both are onto.
Sol: A is onto and B is one-one.
63) Let be an × a matrix with rank and be an × a matrix with rank . What
will be the rank of ?( < < ).
(A) (B) (C) (D) +

Sol: We have that + − ≤ ≤ min { , }

. . + − ≤ ≤ min{ , }, . . ≤ ≤ , ℎ , = .
64) A square matrix A is said to be idempotent if = . An idempotent matrix is non-singular
if and only if
(A) All eigenvalues are real (B) All eigenvalues are nonnegative.
(C) All eigenvalues are either 1 or 0 (D) All eigenvalues are 1.
Sol: = ⇒ ( − ) = 0 ⇒ possible eigen values are 0, 1.
A is non singular if all eigen value are 1.
65) Let A be a symmetric idempotent matrix. Which of the following is not true?
(A) det( ) ≠ 0 ⟹ = (B) Trace A = Rank A.
th
(C) If the i diagonal element of A is zero, at (D) Every latent/characteristic root of A is
th
least one element in the i row is non-zero. either 0 or 1.
Sol: = = ⇒ eigen values of are 0 1.
Consider a 3 × 3 matrix which is symmetric and idempotent and check for all the options
Answer is (C).

CSIR NET EXAM JUNE-2010

66) Let = {( , , …, )∈ℝ | = =⋯= + +⋯+ = 0}. Then

(A) dim V = 98 (B) dim V = 59 (C) dim V = 49 (D) dim V = 50

11
 MCQs Asked in Previous NET EXAMINATION

Sol: Dim V = no. of non trivial elements = 50.

67) The system of simultaneous linear equations + + = 0; − − = 0 has
(A) No solution in ℝ , (B) A unique solution in ℝ .
(C) Infinitely many solutions in ℝ . (D) More than 2 but finitely many solutions in ℝ .
Sol: .Change into echleon form, free variables exists, hence infinitely many solutions in ℝ .
68) Let (3) = { + + + | ∈ ℝ, ≠ 0, = 0,1,2,3} Under the standard
operation of addition (+) and scalar multiplication (.), P(3) is
(A) not a vector space (B) a vector space of infinite dimension
(C) vector space of dimension 3 (D) vector space of dimension 4
Sol: P(3) isn't a vector space.
69) If is a real 2 × 2 matrix such that – = 0, then
1 0 −1 0 (B) there are infinitely many such matrices
(A) either = or = ,
0 1 0 −1 A.
(C) there are only finitely many such matrices A (D) A has to be a diagonal matrix
0 0 0
Sol: − = 0 ⟹ ( − ) = 0 ⟹ eigen values of A are 0 and 1. , , ℎ ∈ℝ
1 0 1
Therefore, there are infinitely many such matrices A.
70) Let A and B be upper triangular matrices given by
1 . 1 .
⋯ . . ⎡0 2 ⋯ 0 0 ⎤
0 2 ⎢ ⎥ Then
= and B= ⎢ ⋮ ⋱ ⋮ ⎥
⋮ ⋱ ⋮
⎢. . ⋯ 0 0 ⎥
0 0 ⋯ 0 ⎣ . − 1⎦
(A) A is invertible and B is singular (B) A is singular and B is invertible
(C) both A and B are invertible (D) Neither A nor B is invertible
Sol: For upper and lower triangular matrices determinant is product of diagonal elements.
Here, = 1 × 2 × … × ( − 1) × ≠ 0, hence A isn't invertible.
Also = 1 × 2 × … × 0 × ( − 1) = 0, hence B isn't invertible and is singular.

71) Given that a 3 × 3 matrix satisfies the equation − + − = 0, the value of is

(A) not computable from the given data (B) − − + − (C) 0 (D)
Sol: Since − + − =0 ⟹ − + − =0⟹ = − + =
So we get that =
72) Let A be the n × n matrix with all entries equal to 1. The eigenvalues of A are
(A) 0 with multiplicity (n-1) and 1with
(B) 0 with multiplicity 1 and n with multiplicity (n-1)
multiplicity 1
(C) 0 with multiplicity 1 and 1 with
(D) with multiplicity 1 and 1 with multiplicity 1.
multiplicity 1
1 1 1
Sol: Consider a 3 × 3 matrix 1 1 1 , 0 is an eigen value with multiplicity 2 and 1 is an eigen
1 1 1
value with multiplicity 1. Generate for × matrix.
12