Paper Tayyari

Final Term PreparationFinal term ki tayyari

Syllabus: lectures 23–45. Past-paper MCQs are shown first.Syllabus: lecture 23–45. Past paper ki MCQs pehle dikhai gayi hain.

52 MCQs · 6 short · 9 long questions · 52 MCQs from past papers52 MCQs · 6 short · 9 long sawal · 52 MCQs past papers se

Start mock testMock test shuru karein
DoneHal kiye 0/52
– correctsahi
1.
★ Final term past paper (Waqar Siddhu 1)Lecture 23

If B = {(0, 1), (2, 0)} for ℝ² and x ∈ ℝ² has coordinate vector [x]_B = (1, 3), then which of the following is the value of x?

  1. Ax = (6, 1)
  2. Bx = (2, 0)
  3. Cx = (0, 1)
  4. Dx = (1, 3)

x = 1(0, 1) + 3(2, 0) = (6, 1).

2.
★ Final term past paper (Waqar Siddhu 1)Lecture 23

If a set S = {1, x, x²} is a basis for P₂ and [p]_S = (2, 4, 7), then which of the following is the most appropriate option?

  1. Ap = 2 − 4x + 7x²
  2. Bp = 2 − 4x − 7x²
  3. Cp = 2 + 4x + 7x²
  4. Dp = 4x − 7x²

p = 2·1 + 4·x + 7·x².

3.
★ Quiz MCQs (Shining Star)Lecture 23

Consider a basis B = {b₁, b₂} for ℝ², where b₁ = (1, 0) and b₂ = (1, 2), and suppose x in ℝ² has coordinate vector [x]_B = (−2, 3). Then x is

  1. A(−1, 6)
  2. B(−6, 1)
  3. C(−1, −6)
  4. D(1, 6)

x = −2(1, 0) + 3(1, 2) = (1, 6).

4.
★ Final term 2008Lecture 24

The number of pivot columns of a matrix equals the dimension of its column space.

  1. ATrue
  2. BFalse

The pivot columns of A form a basis of Col A.

5.
★ Final term 2008Lecture 24

A plane in ℝ³ is a two-dimensional subspace of ℝ³.

  1. ATrue
  2. BFalse

Only planes through the origin are subspaces.

6.
★ Final term 2008Lecture 24

The dimension of the vector space P₄ is 4.

  1. ATrue
  2. BFalse

P₄ has basis {1, t, t², t³, t⁴}, so its dimension is 5.

7.
★ Final term 2008Lecture 24

If dim V = n and S is a linearly independent set in V, then S is a basis for V.

  1. ATrue
  2. BFalse

S must also have exactly n elements (or span V).

8.
★ Final term 2008Lecture 24

If a set {v₁, …, vₙ} spans a finite-dimensional vector space V and T is a set of more than n vectors in V, then T is linearly dependent.

  1. ATrue
  2. BFalse

dim V ≤ n, so more than n vectors must be dependent.

9.
★ Final term 2008Lecture 24

The number of variables in the equation Ax = 0 equals the dimension of Nul A.

  1. ATrue
  2. BFalse

dim Nul A equals the number of free variables.

10.
★ Final term 2008Lecture 24

A vector space is infinite-dimensional if it is spanned by an infinite set.

  1. ATrue
  2. BFalse

It is infinite-dimensional only if no finite set spans it.

11.
★ Final term 2008Lecture 24

If dim V = n and S spans V, then S is a basis for V.

  1. ATrue
  2. BFalse

S must also have exactly n elements (or be independent).

12.
★ Final term 2008Lecture 24

The only three-dimensional subspace of ℝ³ is ℝ³ itself.

  1. ATrue
  2. BFalse

Three independent vectors in ℝ³ span all of ℝ³.

13.
★ Quiz MCQs (Shining Star)Lecture 24

In the set S = {(x − 2t, x + t, 3t) : x, t ∈ ℝ}, its dimension is

  1. A1
  2. B2
  3. C0
  4. D3

S = Span{(1, 1, 0), (−2, 1, 3)} and these two vectors are independent.

14.
★ Quiz MCQs (Shining Star)Lecture 24

The dimension of the zero vector space {0} is

  1. ANot defined
  2. BOne
  3. CZero
  4. DArbitrary

{0} has the empty set as basis, so its dimension is 0.

15.
★ Quiz MCQs (Shining Star)Lecture 25

If the rank of a 3 × 5 matrix is 3, then the dimension of its null space is

  1. A0
  2. B3
  3. C2
  4. DWe can't say anything

Rank theorem: dim Nul A = 5 − 3 = 2.

16.
★ Quiz MCQs (Shining Star)Lecture 25

As the rank of a matrix is the number of its pivot columns, the rank of [1 2; 2 4] is

  1. A4
  2. B2
  3. C1
  4. DInconclusive

Row 2 is twice row 1, leaving one pivot.

17.
★ Quiz MCQs (Shining Star)Lecture 25

The rank of a zero matrix of any order is

  1. Azero
  2. Bthree
  3. Cfour
  4. Dnine

A zero matrix has no pivots.

18.
★ Final term past paper (Waqar Siddhu 1)Lecture 26

Consider the bases for ℝ² given by B = {b₁, b₂} and C = {c₁, c₂}, where b₁ = (1, 0), b₂ = (−1, 1), c₁ = (−5, 3), c₂ = (−2, 1); also assume that P_{B←C} = [−2 −1; 3 1]. Which of the following is the change-of-coordinates matrix from B to C?

  1. AP_{C←B} = [1 1; −3 −2]
  2. BP_{C←B} = [1 −1; 0 1]
  3. CP_{C←B} = [−5 −2; 3 1]
  4. DP_{C←B} = [−8 −3; 3 1]

P_{C←B} = (P_{B←C})⁻¹; det = 1, so the inverse is [1 1; −3 −2].

19.
★ Quiz MCQs (Shining Star)Lecture 26

Let B = {b₁, b₂} and C = {c₁, c₂} be bases for a vector space V such that b₁ = 4c₁ + c₂ and b₂ = −6c₁ + c₂. Suppose x = 3b₁ + b₂, i.e. [x]_B = (3, 1). Then [x]_C will be

  1. A(6, 4)
  2. B(−4, 6)
  3. C(−6, 4)
  4. D(−6, −4)

x = 3(4c₁ + c₂) + (−6c₁ + c₂) = 6c₁ + 4c₂.

20.
★ Final term past paper (Waqar Siddhu 1)Lecture 27

If the general term of a typical signal is (0.6)ᵏ, then determine which of the following is the signal for k = −2?

  1. A(0.6)⁻² = 0
  2. B(0.6)⁻² = 0.6
  3. C(0.6)⁻² = (0.6)²
  4. D(0.6)⁻² = 1/(0.6)²

A negative exponent means the reciprocal: (0.6)⁻² = 1/(0.6)².

21.
★ Final term past paper (Waqar Siddhu 1)Lecture 27

If {y_k} = {…, 1, 0.7, 0, −0.7, −1, −0.7, 0, 0.7, 1, 0.7, 0, …} (arrow marks y₀ = 1) and 0.35y_{k+2} + 0.6y_{k+1} + 0.42y_k = z_k, then which of the following is the value of z₀?

  1. A0.840
  2. B0.049
  3. C−0.770
  4. D−1.139

z₀ = 0.35·y₂ + 0.6·y₁ + 0.42·y₀ = 0.35·0 + 0.6·0.7 + 0.42·1 = 0.84.

22.
★ Quiz MCQs (Shining Star)Lecture 28

If λ is an eigenvalue of the invertible matrix A, then an eigenvalue of A⁻¹ will be

  1. Aλ⁻¹
  2. B1/λ²
  3. Cλ²
  4. DCan't be determined

Ax = λx gives A⁻¹x = (1/λ)x.

23.
★ Quiz MCQs (Shining Star)Lecture 28

Vector u is not an eigenvector of a matrix A if

  1. AThere exists λ such that Au = λu
  2. BThere does not exist λ such that Au = λu
  3. CAu = 0
  4. DAu = (1, 1)

An eigenvector (nonzero) must satisfy Au = λu for some λ.

24.
★ Quiz MCQs (Shining Star)Lecture 29

Roots of the characteristic equation (λ + 1)² = 0 are of multiplicity

  1. AZero
  2. BOne
  3. CTwo
  4. DThree

λ = −1 is a repeated root, multiplicity 2.

25.
★ Quiz MCQs (Shining Star)Lecture 29

If there exists a matrix whose characteristic equation is λ³ = 1, then the roots of the equation are

  1. A1, (−1 ± √−3)/2
  2. B1
  3. C±1
  4. Dφ = {}

λ³ − 1 = (λ − 1)(λ² + λ + 1), giving 1 and (−1 ± √−3)/2.

26.
★ Final term past paper (Waqar Siddhu 1)Lecture 30

If A = [a₁₁ a₁₂; a₂₁ a₂₂] is diagonalizable then A has 2 distinct eigenvalues.

  1. ATrue
  2. BFalse

The identity matrix is diagonalizable but has the single eigenvalue 1.

27.
★ Final term past paper (Waqar Siddhu 1)Lecture 30

A is diagonalizable if A = PDP⁻¹ where

  1. AD is any matrix and P is an invertible matrix
  2. BD is a diagonal matrix and P is any matrix
  3. CD is a diagonal matrix and P is invertible matrix
  4. DD is a invertible matrix and P is any matrix

Diagonalizable means similar to a diagonal matrix D through an invertible P.

28.
★ Current paper (Masoom Fairy)Lecture 30

An n × n matrix A is ___ if and only if A has n linearly independent [eigen]vectors.

  1. Adiagonalizable
  2. Bsingular
  3. Csymmetric
  4. Dscalar

Diagonalization theorem: A = PDP⁻¹ exactly when A has n linearly independent eigenvectors.

29.
★ Current paper (Masoom Fairy)Lecture 30

An n × n matrix with n distinct eigenvalues is diagonalizable.

  1. ATRUE
  2. BFALSE

Eigenvectors for distinct eigenvalues are independent, giving n independent eigenvectors.

30.
★ Final term past paper (Waqar Siddhu 1)Lecture 32

Let A be an n × n matrix whose entries are real. If λ is an eigenvalue of A with x a corresponding eigenvector in ℂⁿ, then

  1. AAx̄ = λx̄
  2. BAx̄ = conj(λx)
  3. CAx̄ = λ̄x
  4. DAx̄ = λ⁻¹x̄

Taking conjugates of Ax = λx with A real gives Ax̄ = conj(λx) = λ̄x̄.

31.
★ Final term past paper (Waqar Siddhu 1)Lecture 33

Suppose that A = [1.25 −0.75; −0.75 1.25] has eigenvalues 2 and 0.5. Then the origin is a

  1. ASaddle point
  2. BRepellor
  3. CAttractor

One eigenvalue has magnitude above 1 and the other below 1, so the origin is a saddle point.

32.
★ Final term 2008Lecture 35

Which one is the numerical method used for approximation of the dominant eigenvalue of a matrix?

  1. APower method
  2. BJacobi's method
  3. CGauss-Seidel method
  4. DGram-Schmidt process

The power method iterates Axₖ to estimate the dominant eigenvalue.

33.
★ Final term past paper (Waqar Siddhu 1)Lecture 38

Let ℝ³ have the Euclidean inner product. Then u = (2, 1, 3), v = (1, 7, k) are orthogonal for

  1. Ak = 9
  2. Bk = −3
  3. Ck = −9
  4. Dk = 3

u·v = 2 + 7 + 3k = 0 gives k = −3.

34.
★ Current paper (Masoom Fairy)Lecture 38

Two vectors u and v are orthogonal to each other if ___.

  1. Au·v = 0
  2. Bu·v = 1
  3. Cu + v = 0
  4. Du − v = 0

Orthogonality is defined by a zero dot product.

35.
★ Quiz MCQs (Shining Star)Lecture 38

The set of all vectors in ℝⁿ orthogonal to one fixed vector is a subspace of ℝⁿ.

  1. ATrue
  2. BFalse

It is the orthogonal complement of Span{u}, which is a subspace.

36.
★ Quiz MCQs (Shining Star)Lecture 38

If W is a subspace of ℝⁿ, then W and W⊥ have no vectors in common.

  1. ATrue
  2. BFalse

The zero vector lies in both.

37.
★ Quiz MCQs (Shining Star)Lecture 39

If a square matrix has orthonormal columns, then it also has orthonormal rows.

  1. ATrue
  2. BFalse

UᵀU = I for square U implies UUᵀ = I.

38.
★ Final term past paper (Waqar Siddhu 1)Lecture 40

By the Best Approximation Theorem, the distance from y to W is ‖y − ŷ‖, where ŷ =

  1. Aproj_W ŷ
  2. Bproj_W y
  3. Cproj_y w

The closest point in W to y is its orthogonal projection proj_W y.

39.
★ Quiz MCQs (Shining Star)Lecture 40

If w is the orthogonal projection of a vector v in ℝⁿ onto a subspace W of ℝⁿ, then w is orthogonal to v.

  1. ATrue
  2. BFalse

In general v − w (not w) is orthogonal to W; w itself is not orthogonal to v unless w = 0.

40.
★ Quiz MCQs (Shining Star)Lecture 40

Let W be a subspace of ℝⁿ and v a vector in ℝⁿ. Among all vectors in W, the vector closest to v is the orthogonal projection of v onto W⊥.

  1. ATrue
  2. BFalse

The closest vector in W is the projection onto W, not onto W⊥.

41.
★ Final term past paper (Waqar Siddhu 1)Lecture 42

Which statement about the General Least Square Method is true?

  1. ASolution obtained by this method is always unique.
  2. BThis is a numerical method for the solution of System of Linear Equations.
  3. CThis method finds an x that makes Ax as close as possible to b.
  4. DThis method gives us exact solution of the system.

A least-squares solution minimizes ‖b − Ax‖ and need not be unique or exact.

42.
★ Final term past paper (Waqar Siddhu 1)Lecture 42

The matrix equation AᵀAx̂ = Aᵀb represents a system of linear equations commonly referred to as the

  1. Anormal equations for x
  2. Bnormal equations for x̂
  3. Cnormal equations for A
  4. Dnormal equations for b

AᵀAx̂ = Aᵀb are the normal equations whose solutions are the least-squares solutions x̂.

43.
★ Final term past paper (Waqar Siddhu 1)Lecture 43

Let u = (3, −2), v = (4, 5). For the weighted Euclidean inner product ⟨u, v⟩ = 4u₁v₁ + 5u₂v₂, ⟨v, u⟩ =

  1. A2
  2. B−2
  3. C3
  4. D−3

⟨v, u⟩ = 4(4)(3) + 5(5)(−2) = 48 − 50 = −2.

44.
★ Final term past paper (Waqar Siddhu 1)

‖u + v + w‖ ≤ ‖u‖ + ‖v‖ + ‖w‖ for all vectors u, v and w in an inner product space.

  1. ATrue
  2. BFalse

Applying the triangle inequality twice gives the bound.

45.
★ Final term past paper (Waqar Siddhu 1)

A square matrix A is invertible if and only if λ = 0 is not an eigenvalue of A.

  1. ATrue
  2. BFalse

0 is an eigenvalue exactly when Ax = 0 has a nontrivial solution, i.e. when A is singular.

46.
★ Final term past paper (Waqar Siddhu 1)

Which statement about the matrix [1 0 0 0; 7 2 0 0; 9 1 2 0; 5 4 2 −1] is false?

  1. AEigenvalue 2 has algebraic multiplicity 1
  2. BEigenvalues of the matrix are 1, 2 and −1.
  3. CCharacteristic polynomial of the matrix is (1 − λ)(2 − λ)²(−1 − λ).
  4. DEigenvalue −1 has multiplicity 1.

The matrix is triangular with diagonal 1, 2, 2, −1, so eigenvalue 2 has algebraic multiplicity 2.

47.
★ Final term past paper (Waqar Siddhu 1)

Let v = (1, −2, 2, 0). The unit vector in the same direction as v is

  1. A(1/3, 2/3, 2/3, 0)
  2. B(1/3, −2/3, 2/3, 0)
  3. C(−1/3, 2/3, −2/3, 0)
  4. D(1/3, −2/3, 2/3, 1/3)

‖v‖ = √(1 + 4 + 4) = 3, so v/‖v‖ = (1/3, −2/3, 2/3, 0).

48.
★ Final term past paper (Waqar Siddhu 1)

Let v = (0, 2, 2, 1). The unit vector in the same direction as v is

  1. A(0, 2/3, 2/3, −1/3)
  2. B(0, −2/3, 2/3, −1/3)
  3. C(0, 2/3, 2/3, 1/3)
  4. D(0, −2/3, 2/3, 1/3)

‖v‖ = √(0 + 4 + 4 + 1) = 3, so v/‖v‖ = (0, 2/3, 2/3, 1/3).

49.
★ Final term Fall 2004

If matrix A has zero as an eigenvalue, which statement(s) about A must be true? I. A is not invertible. II. A will also have an eigenvalue 2. III. A is diagonalizable.

  1. AII and III only
  2. BI only
  3. CII and III only
  4. DAll three

Ax = 0x has a nonzero solution, so A is singular; nothing forces an eigenvalue 2 or diagonalizability.

50.
★ Current paper (Masoom Fairy)

An n × n matrix A is ___ if and only if 0 is not an eigenvalue of A.

  1. Ainvertible
  2. Bsingular
  3. Csymmetric
  4. Dscalar

0 is an eigenvalue exactly when Ax = 0 has a nontrivial solution, i.e. when A is singular.

51.
★ Quiz MCQs (Shining Star)

The angle between the vectors x = (1, 0, 0, 0) and y = (1, 1, 1, 1) is

  1. Aπ/2
  2. Bπ
  3. C0
  4. Dπ/3

cos θ = x·y/(‖x‖‖y‖) = 1/(1·2) = 1/2, so θ = π/3.

52.
★ Quiz MCQs (Shining Star)

The distance between the vector (1, 2) and its reflection about the x₂-axis is

  1. AZero
  2. B4
  3. C√2
  4. D2

Reflection gives (−1, 2); the distance is ‖(2, 0)‖ = 2.