• edited by
8,609 views
25 25 votes

The rank of the matrix $\begin{bmatrix} 1 & 1 \\ 0 & 0 \end{bmatrix}$ is

  1. $4$
  2. $2$
  3. $1$
  4. $0$

7 Answers

Best answer
27 27 votes
Rank of this matrix is 1 as the determint of 2nd order matrix is 0 and 1st order matrix is non zero so rank is $1$.

Correct Answer: $C$
• edited by
2 2 votes
Eigen Value of a upper triangular matrix = Principal diagonal elements.

The above matrix is a upper triangular matrix, thus the Eigen Value of the above matrix is 1 and 0 (diagnal elemnts).  

Number of non zero Eigen values of a matrix = Rank of that matrix.

Therefore the rank of above matrix=1.

 

1 1 vote
Rank Of A Matrix Can be easily calculated by Calculating Order of Submatrix Having Determinant Not Equal to zero in the above submatrix of size 2*2 determinant turns out to be zero hence rank cannot be One but if we see for 1*1 submatrix we have [1] as submatrix whose determinant is not equal to zero hence Rank is 1 .
1 1 vote

The column rank of a matrix is equal to the number of pivot columns, which is also equal to the number of linearly independent columns.

Hence,there is only one pivot column (i.e., only one linearly independent column), the rank of the matrix is 1.

Answer:
Position:
Show:

Related questions

51 51 votes
9 answers 9 answers
32.8k
32.8k views
Kathleen asked Sep 15, 2014
32,788 views
The maximum number of edges in a $n$-node undirected graph without self loops is$n^2$$\frac{n(n-1)}{2}$$n-1$$\frac{(n+1)(n)}{2}$
45 45 votes
6 answers 6 answers
21.6k
21.6k views
Kathleen asked Sep 15, 2014
21,605 views
In the absolute addressing mode:the operand is inside the instructionthe address of the operand in inside the instructionthe register containing the address of the operan...
26 26 votes
1 answers 1 answer
11.7k
11.7k views
Kathleen asked Sep 15, 2014
11,701 views
The optimal page replacement algorithm will select the page thatHas not been used for the longest time in the pastWill not be used for the longest time in the futureHas b...
40 40 votes
6 answers 6 answers
25.5k
25.5k views
Kathleen asked Sep 15, 2014
25,536 views
Which of the following scheduling algorithms is non-preemptive?Round RobinFirst-In First-OutMultilevel Queue SchedulingMultilevel Queue Scheduling with Feedback