If A^T= [ rr 3 & 4 -1 & 2 0 & 1 ] and B= [ rrr -1 & 2 & 1 1 & 2 &… - Vidyadip

Question

If $A^T=\left[\begin{array}{rr}3 & 4 \\ -1 & 2 \\ 0 & 1\end{array}\right]$ and $B=\left[\begin{array}{rrr}-1 & 2 & 1 \\ 1 & 2 & 3\end{array}\right]$, then find $A^T-B^T$.

✓

Answer

(a) : $B^T=\left[\begin{array}{rr}-1 & 1 \\ 2 & 2 \\ 1 & 3\end{array}\right]$
So, $\quad A^T-B^T=\left[\begin{array}{cc}3 & 4 \\ -1 & 2 \\ 0 & 1\end{array}\right]-\left[\begin{array}{cc}-1 & 1 \\ 2 & 2 \\ 1 & 3\end{array}\right]=\left[\begin{array}{cc}4 & 3 \\ -3 & 0 \\ -1 & -2\end{array}\right]$

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

Let L denote the set of all straight lines in a plane. Let a relation R be defined by lRm if l is perpendicular to m for all l, m ∈ L. Then, R is:

Reflexive.
Symmetric.
Transitive.
None of these.

Find the matrix $A^2$, where $A=\left[a_{i j}\right]$ is a $2 \times 2$ matrix whose elements are given by $a_{i j}=$ maximum $(i, j)-$ minimum $(i, j)$ :

The distance of the line $\vec{\text{r}}=2\hat{\text{i}}-2\hat{\text{j}}+3\hat{\text{k}}+\lambda(\hat{\text{i}}-\hat{\text{j}}+4\hat{\text{k}})$ from the plane $\vec{\text{r}}.(\hat{\text{i}}+5\hat{\text{j}}+\hat{\text{k}})=5$ is:

$\frac{5}{3\sqrt{3}}$
$\frac{10}{3\sqrt{3}}$
$\frac{25}{3\sqrt{3}}$
$\text{None of these}$

The direction cosines of $z$ axis are

The differential coefficient of $\text{f}(\log\text{x})$ w.r.t. x, where $\text{f(x)}=\log\text{x}$ is:

$\frac{\text{x}}{\log\text{x}}$
$\frac{\log\text{x}}{\text{x}}$
$(\text{x}\log\text{x})^{-1}$
$\text{None of these.}$

Area bounded by parabola $y^2 = x$ and straight line $2y = x$ is:

Evaluate : $\int_0^2 e^{3-4 x} d x$

A Linear Programming Problem is as follows:
Minimize Z = 2x + y
Subject to the constraints $x \geq 3, x \leq 9, y \geq 0$
$x-y \geq 0, x+y \leq 14$
The feasible region has

The number of bijective functions from set $A$ to itself when $A$ contains 106 elements is

Which of the following statements about an LP problem and its dual is false?