This document contains solved multiple choice questions (MCQs) for the MTH603 final term exam. It covers topics like matrix equations, eigenvalues, eigenvectors, finite difference methods, and numerical methods for solving equations. Some key points:
- The Jacobi method solves matrix equations for matrices with no zeros along the main diagonal.
- Eigenvalues of a symmetric matrix are always real.
- Numerical methods are used to find approximate solutions, while analytical methods find exact solutions.
- Iterative methods like the Newton-Raphson method do not require initial approximations, while bracketing methods like bisection do.
- Numerical integration techniques like Simpson's rule are used to evaluate definite integrals.
This document contains solved multiple choice questions (MCQs) for the MTH603 final term exam. It covers topics like matrix equations, eigenvalues, eigenvectors, finite difference methods, and numerical methods for solving equations. Some key points:
- The Jacobi method solves matrix equations for matrices with no zeros along the main diagonal.
- Eigenvalues of a symmetric matrix are always real.
- Numerical methods are used to find approximate solutions, while analytical methods find exact solutions.
- Iterative methods like the Newton-Raphson method do not require initial approximations, while bracketing methods like bisection do.
- Numerical integration techniques like Simpson's rule are used to evaluate definite integrals.
This document contains solved multiple choice questions (MCQs) for the MTH603 final term exam. It covers topics like matrix equations, eigenvalues, eigenvectors, finite difference methods, and numerical methods for solving equations. Some key points:
- The Jacobi method solves matrix equations for matrices with no zeros along the main diagonal.
- Eigenvalues of a symmetric matrix are always real.
- Numerical methods are used to find approximate solutions, while analytical methods find exact solutions.
- Iterative methods like the Newton-Raphson method do not require initial approximations, while bracketing methods like bisection do.
- Numerical integration techniques like Simpson's rule are used to evaluate definite integrals.
This document contains solved multiple choice questions (MCQs) for the MTH603 final term exam. It covers topics like matrix equations, eigenvalues, eigenvectors, finite difference methods, and numerical methods for solving equations. Some key points:
- The Jacobi method solves matrix equations for matrices with no zeros along the main diagonal.
- Eigenvalues of a symmetric matrix are always real.
- Numerical methods are used to find approximate solutions, while analytical methods find exact solutions.
- Iterative methods like the Newton-Raphson method do not require initial approximations, while bracketing methods like bisection do.
- Numerical integration techniques like Simpson's rule are used to evaluate definite integrals.
If n x n matrices A and B are similar, then they have the same eigenvalues (with the same multiplicities). TRUE FALSE
If A is a nxn triangular matrix (upper triangular, lower triangular) or diagonal matrix, the eigenvalues of A are the diagonal entries of A.
TRUE FALSE
The characteristics polynomial of a 3x 3
Identity matrix is __________, if x is the Eigen values of the given 3 x 3 identity matrix. Where symbol ^ shows power.
(X-1)^3 (x+1)^3 X^3-1 X^3+1
Two matrices with the same characteristic polynomial need not be similar.
TRUE
AWAIS REHMAN MCS 4th Semester
MTH603 Mth603 Solved MCQS for Final Term Exam Converted to PDF FALSE
Bisection method is a
Bracketing method Open method
Regula Falsi means
Method of Correct position
Method of unknown position Method of false position Method of known position
Eigenvalues of a symmetric matrix are all _________.
Select correct option:
Real Zero Positive Negative
An eigenvector V is said to be normalized if the coordinate of largest magnitude is equal to zero.
Select correct option:
TRUE FALSE
Exact solution of 2/3 is not exists.
Select correct option:
TRUE FALSE
The Gauss-Seidel method is applicable to strictly diagonally dominant or symmetric ________
definite matrices A. Select correct option:
Positive Negative
Differences methods find the ________ solution of the system.
Select correct option:
Numerical Analytical
The Power method can be used only to find the eigenvalue of A that is largest in absolute value— we call this Eigenvalue the dominant eigenvalue of A. Select correct option:
TRUE
AWAIS REHMAN MCS 4th Semester
MTH603 Mth603 Solved MCQS for Final Term Exam Converted to PDF FALSE
The Jacobi’s method is a method of solving a matrix equation on a matrix that has no zeros along its ________. Select correct option:
Main diagonal Last column Last row First row
If A is a nxn triangular matrix (upper triangular, lower triangular) or diagonal matrix , the eigenvalues of A are the diagonal entries of A. Select correct option:
TRUE FALSE
A 3 x 3 identity matrix have three and different Eigen values.
Select correct option:
TRUE FALSE
Newton Raphson method falls in the category of
Bracketing method Open Method Iterative Method Indirect Method
Newton Raphson method is also known as
Tangent Method Root method Open Method Iterative Method
Secant Method uses values for approximation
1 3 2 4
Secant Method is than bisection method for finding root
Slow Faster
In Newton Raphson method
Root is bracketed Root is not bracketed
AWAIS REHMAN MCS 4th Semester
MTH603 Mth603 Solved MCQS for Final Term Exam Converted to PDF Regula falsi method and bisection method are both
Convergent Divergent
In bisection method the two points between which the root lies are
Similar to each other
Different Not defined Opposite
In which methods we do not need initial approximation to start
Indirect Method Open Method Direct Method Iterative Method
Root may be
Complex Real Complex or real None
In Regula falsi method we choose points that have signs
2 points opposite signs
3 points opposite signs 2 points similar signs None of the given
In a bounded function values lie between
1 and -1 1 and 2 0 and 1 0 and -2
Newton Raphson method is a method which when it leads to division of number close to zero Diverges Converges
Which of the following method is modified form of Newton Raphson Method?
f ( x) x Finding the first derivative of at =0.4 from the following table:
x 0.1 0.2 0.3 0.4
f ( x) 1.10517 1.22140 1.34986 1.49182
Differential operator in terms of ----------------will be used.
Forward difference operator
Backward difference operator
AWAIS REHMAN MCS 4th Semester
MTH603 Mth603 Solved MCQS for Final Term Exam Converted to PDF Central difference operator All of the given choices
For the given table of values
x 0.1 0.2 0.3 0.4 0.5 0.6 f ( x) 0.425 0.475 0.400 0.452 0.525 0.575
f / (0.1) , using two-point equation will be calculated as.............
-0.5 0.5 0.75 -0.75
In f ( x) Simpson’s 1/3 rule, is of the form
ax b ax 2 bx c ► ax3 bx 2 cx d ► ax 4 bx 3 cx 2 dx e ►
b I f ( x) dx a
While integrating , h , width of the interval, is found by the formula-----
.
ba n ba n
a b n
None of the given choices
To apply Simpson’s 1/3 rule, valid number of intervals are.....
7 8 5 3
For the given table of values
AWAIS REHMAN MCS 4th Semester
MTH603 Mth603 Solved MCQS for Final Term Exam Converted to PDF x 0.1 0.2 0.3 0.4 0.5 0.6 f ( x) 0.425 0.475 0.400 0.452 0.525 0.575
f / / (0.2) , using three-point equation will be calculated as ……
17.5 12.5 7.5 -12.5
To apply Simpson’s 1/3 rule, the number of intervals in the following must be
2 3 5 7
To apply Simpson’s 3/8 rule, the number of intervals in the following must be
10 11 12 13
If the root of the given equation lies between a and b, then the first approximation to the root of the equation by bisection method is ……
(a b ) 2 ( a b) 2 (b a) 2 None of the given choices
............lies in the category of iterative method.
Bisection Method Regula Falsi Method Secant Method All of the given choices For 3 x 3x 1 0 the equation , the root of the equation lies in the interval......
(1, 3) (1, 2) (0, 1) (1, 2)
AWAIS REHMAN MCS 4th Semester
MTH603 Mth603 Solved MCQS for Final Term Exam Converted to PDF
Rate of change of any quantity with respect to another can be modeled by
An ordinary differential equation
A partial differential equation
A polynomial equation
None of the given choices
If dy f ( x, y ) dx
Then the integral of this equation is a curve in
None of the given choices
Xt-plane Yt-plane Xy-plane
In solving the differential equation y / x y ; y (0.1) 1.1
h 0.1 y (0.2) , By Euler’s method is calculated as
1.44 1.11 1.22 1.33
In second order Runge-Kutta method k1 is given by
k1 hf ( xn , yn ) k1 2hf ( xn , yn )
k1 3hf ( xn , yn ) None of the given choices
In k2 fourth order Runge-Kutta method, is given by
h k k2 hf ( xn , yn 1 ) 2 2
h k k2 hf ( xn , yn 1 ) 3 3
AWAIS REHMAN MCS 4th Semester
MTH603 Mth603 Solved MCQS for Final Term Exam Converted to PDF h k k2 hf ( xn , yn 1 ) 3 3
h k k2 hf ( xn , yn 1 ) 2 2
In k4 fourth order Runge-Kutta method, is given by
k3 hf ( xn 2h, yn 2k3 )
k3 hf ( xn h, yn k3 )
k3 hf ( xn h, yn k3 ) None of the given choices
Adam-Moulton P-C method is derived by employing
Newton’s backward difference interpolation formula
Newton’s forward difference interpolation formula Newton’s divided difference interpolation formula None of the given choices
The need of numerical integration arises for evaluating the definite integral of a function that has no explicit ____________ or whose antiderivative is not easy to obtain
Derivatives Antiderivative
If A 0 then system will have a
Definite solution Unique solution Correct solution No solution
If A 0 then There is a unique solution There exists a complete solution There exists no solution None of the above options
Direct method consists of method
2 3 5 4 We consider Jacobi’s method Gauss Seidel Method and relaxation method as Direct method Iterative method Open method All of the above
In Gauss Elimination method Solution of equation is obtained in
3 stages 2 stages 4 stages 5 stages
AWAIS REHMAN MCS 4th Semester
MTH603 Mth603 Solved MCQS for Final Term Exam Converted to PDF Gauss Elimination method fails if any one of the pivot values becomes Greater Small Zero None of the given
Changing the order of the equation is known as
Pivoting Interpretation
Full pivoting is than partial pivoting
Easy More complicated
The following is the variation of Gauss Elimination method
Jacobi’s method Gauss Jordan Elimination method
Courts reduction method is also known as Cholesky Reduction method
True False
Jacobi’s method is also known as method of Simultaneous displacement
True False Gauss Seidel method is also known as method of Successive displacement False True In Jacobi’s method approximation calculated is used for Nothing Calculating the next approximation Replaced by previous one All above
In Gauss Seidel method approximation calculated is replaced by previous one
True False
Relaxation method is derived by
South well Not defined
Power method is applicable for only
Real metrics Symmetric Unsymmetrical Both symmetric and real
The process of eliminating value of y for intermediate value of x is know as interpolation
