Download App

MATRICES — MATHS STD 12 Science — Question

Rajasthan BoardEnglish MediumSTD 12 ScienceMATHSMATRICES1 Mark
Question
The transpose of a row matrix is:
  1. zero matrix
  2. diagonal matrix
  3. column matrix
  4. row matrix
✓

Answer

  1. column matrix
Solution:
Transpose of row matrix Let $ \text{A}=\begin{bmatrix}\text{x} &\text{amp; y} &\text{amp; z} \end{bmatrix}$ be a row
matrix $\text{A}^\text{T}=\begin{bmatrix}\text{x}\\\text{y}\\\text{z}\end{bmatrix}$Clearly $\text{A}^\text{T}$ is a column matrix $\therefore$ Transpose of row.
 

Need a full question paper?

Generate a complete, print-ready paper with questions like this in minutes — across 16+ boards, with answer keys.

Start Generating Free

Explore more

More "M.C.Q (1 Marks)" from MATRICES→MATRICES — all question types→MATHS STD 12 Science question papers→Rajasthan Board STD 12 Science question papers→Rajasthan Board question paper generator→

Similar questions

If $A = [a_{ij}]$ is a scalar matrix of order $n \times n$ such that $a_{ij} = k,$ for all $i,$ then trace of $A$ is equal to$:$
→
The degree of the differential equation $2\text{x}^{2}\frac{\text{d}^{2}\text{y}}{\text{dx}^{2}}+3\frac{\text{dy}}{\text{dx}}+\text{y}=0$ is:
  1. 2
  2. 1
  3. 0
  4. Not defined.
→
For the curve $\sqrt{\text{x}}+\sqrt{\text{y}}=1,\frac{\text{dy}}{\text{dx}}$ at $\Big(\frac{1}{4},\frac{1}{4}\Big)$ is:
  1. $\frac{1}{2}$
  2. 1
  3. -1
  4. 0
→
If $\text{A}=\begin{bmatrix}\cos\theta&-\sin\theta\\\sin\theta&\cos\theta\end{bmatrix},$ then $A^T + A = I_2,$ if:
→
Corner points of the bounded feasible region for an LP problem are A(0, 5) B(0, 3) C(1, 0) D(6, 0). Let z = -50x + 20y be the objective function. Minimum value of z occurs at ______ center point.
  1. (0, 5)
  2. (1, 0)
  3. (6, 0)
  4. (0, 3)
→
If $\vec{\text{a}}.\hat{\text{i}}=\vec{\text{a}}.\big(\hat{\text{i}}+\hat{\text{j}}\big)=\vec{\text{a}}.\big(\hat{\text{i}}+\hat{\text{j}}+\hat{\text{k}}\big)=1.$then $\vec{\text{a}}=$
  1. $\vec{0}$
  2. $\hat{\text{i}}$
  3. $\hat{\text{j}}$
  4. $\hat{\text{i}}+\hat{\text{j}}+\hat{\text{k}}$
→
In a linear programming problem, the constraints on the decision variables $x$ and $y$ are $x-3 y \geq 0, y \geq 0$, $0 \leq x \leq 3$. The feasible region
→
$\int\frac{-1}{\text{y}^2}\text{dy}$ is:
  1. $\frac{1}{\text{y}}$
  2. 1 - y
  3. y
  4. 1 + y
→
If A is a square matrix, then A – A’ is a:
  1. Diagonal matrix.
  2. Skew-symmetric matrix.
  3. Symmetric matrix.
  4. None of these.
→
The maximum value of Z = 4x + 2y Subjected to the constraints $2\text{x}+3\text{y}\leq18,\text{x}+\text{y}\geq10,\text{x},\text{y}\geq0$ is:
  1. 36
  2. 40
  3. 20
  4. none of these
→