dy/dx - = 1 - y,y(0) = 0 is an example of

[zaasmi]

@zaasmi said in MTH603 Mid Term Past and Current Solved Paper Discussion:

Differences methods find the ________ solution of the system.
Select correct option:
numerical
Analytical

Difference methods (such as finite difference methods) are used to find the numerical solution of systems of differential equations or partial differential equations.

Explanation:

• Numerical Solution: Difference methods approximate solutions to problems by discretizing the equations and solving them numerically. These methods are used when exact analytical solutions are difficult or impossible to obtain.

• Analytical Solution: Analytical methods seek exact solutions through algebraic manipulations and typically involve solving equations in their exact forms.

Thus, the correct option is:

numerical

[zaasmi]

To apply Simpson’s 1/3 rule, the number of intervals in the following must be
► 2 (Simpson’‘s 1/3 rule must use an even number of elements’)
► 3
► 5
► 7

[zaasmi]

@zaasmi said in MTH603 Mid Term Past and Current Solved Paper Discussion:

To apply Simpson’s 1/3 rule, the number of intervals in the following must be
► 2 (Simpson’‘s 1/3 rule must use an even number of elements’)
► 3
► 5
► 7

To apply Simpson’s 1/3 rule, the number of intervals ( n ) must be an even number. This is because Simpson’s 1/3 rule requires that the interval be divided into an even number of subintervals for proper application, as the rule is based on approximating the integral of a function using quadratic polynomials over pairs of subintervals.

Explanation:

• Simpson’s 1/3 Rule: This rule applies to cases where the number of intervals is even, ensuring that each pair of intervals is approximated by a quadratic polynomial.

Given the options:

• 2 (even number, so it’s valid for Simpson’s 1/3 rule)
• 3 (odd number, not valid)
• 5 (odd number, not valid)
• 7 (odd number, not valid)

The correct choice is:

2

[zaasmi]

Bisection and false position methods are also known as bracketing method and are
always
Divergent
Convergent

[zaasmi]

@zaasmi said in MTH603 Mid Term Past and Current Solved Paper Discussion:

Bisection and false position methods are also known as bracketing method and are
always
Divergent
Convergent

Bisection and false position methods (Regula Falsi) are known as bracketing methods. They are convergent methods.

Explanation:

• Bisection Method: This method always converges to a root if the function is continuous and if the initial interval ([a, b]) contains a root (i.e., ( f(a) \cdot f(b) < 0 )). It works by iteratively narrowing down the interval where the root lies.

• False Position Method (Regula Falsi): This method also converges to a root under similar conditions. It improves on the interval using linear interpolation to approximate the root.

Both methods guarantee convergence to a root as long as the initial conditions are satisfied (the function changes sign over the interval).

Thus, the correct option is:

Convergent

[zaasmi]

The Inverse of a matrix can only be found if the matrix is
Singular
None Singular: Every square non-singular matrix will have an inverse.
Scalar
Diagonal

[zaasmi]

@zaasmi said in MTH603 Mid Term Past and Current Solved Paper Discussion:

The Inverse of a matrix can only be found if the matrix is
Singular
None Singular: Every square non-singular matrix will have an inverse.
Scalar
Diagonal

The inverse of a matrix can only be found if the matrix is:

None Singular: Every square non-singular matrix will have an inverse.

Explanation:

• Singular Matrix: A matrix that does not have an inverse. A matrix is singular if its determinant is zero.

• Non-Singular Matrix: A matrix that has an inverse. A matrix is non-singular if its determinant is non-zero.

• Scalar Matrix: A diagonal matrix where all the diagonal elements are the same scalar value. Scalar matrices can be non-singular if the scalar value is non-zero.

• Diagonal Matrix: A matrix in which all off-diagonal elements are zero. Diagonal matrices can be non-singular if all diagonal elements are non-zero.

Thus, for a matrix to have an inverse, it must be non-singular (i.e., its determinant must be non-zero).

The correct option is:

None Singular: Every square non-singular matrix will have an inverse.

[zaasmi]

In interpolation is used to represent the δ
Forward difference Δ
Central difference
Backward difference

[zaasmi]

@zaasmi said in MTH603 Mid Term Past and Current Solved Paper Discussion:

In interpolation is used to represent the δ
Forward difference Δ
Central difference
Backward difference

In interpolation, the notation (\delta) typically represents the forward difference operator.

Explanation:

• Forward Difference (\delta): Used to denote the difference between successive values in a sequence. If ( f(x) ) is a function and ( \delta f(x) ) represents the forward difference, then:
  [ \delta f(x) = f(x + h) - f(x) ]

• Backward Difference (\nabla): Represents the difference between preceding values in a sequence. If ( \nabla f(x) ) represents the backward difference, then:
  [ \nabla f(x) = f(x) - f(x - h) ]

• Central Difference: Represents the average of the forward and backward differences:
  [ \Delta f(x) = \frac{f(x + h) - f(x - h)}{2} ]

• Difference Operator (\Delta): This operator generally represents the forward difference when used in the context of interpolation.

Thus, in interpolation, the symbol (\delta) is used to represent the forward difference.

So the correct option is:

Forward difference (\delta)

[zaasmi]

The base of the decimal system is _______
10
0
2
8
None of the above.

[zaasmi]

@zaasmi said in MTH603 Mid Term Past and Current Solved Paper Discussion:

The base of the decimal system is _______
10
0
2
8
None of the above.

The base of the decimal system is:

10

Explanation:

• Decimal System: The decimal system, also known as the base-10 system, uses ten digits (0 through 9) to represent numbers.

• Other Bases:

  • Binary System: Base-2 (digits 0 and 1).
  • Octal System: Base-8 (digits 0 through 7).
  • Hexadecimal System: Base-16 (digits 0 through 9 and letters A through F).

So the correct option is:

10

[zaasmi]

Bisection method is … method
► Open Method
► Bracketing Method

[zaasmi]

@zaasmi said in MTH603 Mid Term Past and Current Solved Paper Discussion:

Bisection method is … method
► Open Method
► Bracketing Method

The Bisection method is a:

Bracketing Method

Explanation:

• Bracketing Method: This method involves finding an interval [a, b] where the function changes sign (i.e., (f(a) \cdot f(b) < 0)). The bisection method iteratively reduces this interval to home in on the root.

• Open Method: This method does not require bracketing of the root. Examples include Newton-Raphson and Secant methods.

The Bisection method is specifically a bracketing method because it starts with an interval that contains the root and continuously reduces the size of this interval to locate the root more accurately.

So the correct option is:

Bracketing Method

[zaasmi]

A 3 x 3 identity matrix have three and __________eigen values.

same
different

[zaasmi]

@zaasmi said in MTH603 Mid Term Past and Current Solved Paper Discussion:

A 3 x 3 identity matrix have three and __________eigen values.

same
different

A (3 \times 3) identity matrix has three eigenvalues, and they are all the same.

Explanation:

• An identity matrix (I) of size (n \times n) has all its diagonal elements equal to 1 and all off-diagonal elements equal to 0.

• The eigenvalues of an (n \times n) identity matrix are all equal to 1.

For a (3 \times 3) identity matrix, the eigenvalues are (1, 1, 1), meaning they are all the same.

So the correct answer is:

same

[zaasmi]

Eigenvalues of a symmetric matrix are all _______ .
Real
complex
zero
positive