MTH603 Final Term by JUNAID

MTH603-NUMERICAL ANALYSIS
Solved MCQS for Final terms papers

Solved by JUNAID MALIK and Team
AL-JUNAID INSTITUTE GROUP
Question # 1 Total Marks: 1

The determinant of a diagonal matrix is the product of the diagonal elements.
 True
 False

Power method is applicable if the eigen vectors corresponding to eigen values are
linearly independent.
 True
 false
A 3 x 3 identity matrix have three and different eigen values.
 True
 False

If n x n matrices A and B are similar, then they have the different eigenvalues
(with the same multiplicities).
 True
 False

The Jacobi’s method is a method of solving a matrix equation on a matrix that has
____ zeros along its main diagonal.
 No
 At least one
An eigenvector V is said to be normalized if the coordinate of largest magnitude is
equal to ______.
 Unity
 zero
The Gauss-Seidel method is applicable to strictly diagonally dominant or
symmetric positive definite matrices A.
 True
 False
The determinant of a _______ matrix is the product of the diagonal elements.

 Diagonal CLOSELY
 Upper triangular
 Lower triangular
 Scalar
yeh charon options theek hain….

You can confirm it from internet…

Eigenvalues of a symmetric matrix are all _________.
 Real
 Zero
 Positive
 Negative

The Power method can be used only to find the eigen value of A that is largest in
absolute value—we call this eigen value the dominant eigen value of A.
 True
 False
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
For differences methods we require the set of values.
 True
 False
 True
 False
If x is an eigen value corresponding to eigen value of V of a matrix A. If a is any

constant, then x – a is an eigen value corresponding to eigen vector V is an of the
matrix A - a I.
 True
 False
Central difference method seems to be giving a better approximation, however it

requires more computations.
 True
 False
Iterative algorithms can be more rapid than direct methods.
 True
 False

Central Difference method is the finite difference method.
 True
 False

Exact solution of 2/3 is not exists.
 TRUE
 FALSE
 no
 atleast one
A 3 x 3 identity matrix have three and __________eigen values.

 same
 different
Eigenvalues of a symmetric matrix are all _______ .

 real
 complex
 zero
 positive
The Jacobi iteration converges, if A is strictly diagonally dominant.

 TRUE
 FALSE

Below are all the finite difference methods EXCEPT _________.
 jacobi’s method
 newton's backward difference method
 Stirlling formula
 Forward difference method
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 global error in Simpson's 3/8 rule is of

 o(h2)
 o(h3)
 o(h4)
 None of the given choices
Two matrices with the same characteristic polynomial need not be similar.
 TRUE
 FALSE

Which of the following period strategic management was considered to be cure for
all problems?
 Mid 1950s to mid 1960s

Which of the following is not a pitfall an organization should avoid in strategic
planning?
Select correct option:
 Failing to involve key employees in all phases of planning

 Involving all managers rather than delegating planning to a planner
 Top managers not actively supporting the strategic planning process
 Doing strategic planning only to satisfy accreditation or regulatory
requirements

which of the following are the factors that concern the nature and direction of the
economy in which a firm operates? Select correct option:
 Technological
 Ecological
 Social
 Economic
Which of the following best describes this statement; “a Systematic and ethical
process
for gathering and analyzing information about the competition’s activities and
general
business trends to further a business’ own goals”?
 External assessment
 Industry analysis
 Competitive intelligence program
 Business ethics
According to Porter, which strategy offers products or services to a small range of

customers at the lowest price available on the market?
 Low cost
 Best value
 Cost focus

Long-term objectives includes all of the following EXCEPT:
 Measurable
 Reasonable
 Varying
 Consistent
Which one of the following is NOT is a basic mission of a competitive
intelligence program?
 To provide a general understanding of an industry
 To provide a general understanding of a company’s competitors
 To identify industry executives who could be hired by the firm
 To identify potential moves a competitor might make that would endanger a
firm
While preparing an External Factor Evaluation Matrix, a total score of 0.8
indicates that:
 Firm is taking advantages of strengths and avoiding threats
 Firm is taking no advantage of opportunities and is avoiding threats
 Firm is not taking advantages of opportunities and is not avoiding threats
 Firm is taking advantage of opportunities and is avoiding the threats
Question No 36 ( Marks: 1 )
Symbol used for forward differences is
►
►
►

►
Question No: 37 ( Marks: 1 )

The
relationship between central difference operator and the shift operator is given by
►     1
►     1
1 1

►    
2 2
1 1

►    2 2
Muller’s method requires --------starting points
►1
►2
►3
►4

If S is an identity matrix, then
►
► S S
t
►
1
► S S
t

If we retain r+1 terms in Newton’s forward difference formula, we obtain a
yx x0, x1 ,..., xr
polynomial of degree ---- agreeing with at
► r+2
► r+1
►r
► r-1

P in Newton’s forward difference formula is defined as
x  x0
p( )
 h
x  x0
p( )
 h
x  xn
p( )
 h
x  xn
p( )
 h

Octal number system has the base ---------------
►2
►8
► 10
► 16

Newton’s divided difference interpolation formula is used when the values of the
independent variable are
► Equally spaced
► Not equally spaced

► Constant
► None of the above

Given the following data
x 0 1 2 4
f ( x) 1 1 2 5
f (2, 4)
Value of is
► 1.5
►3
►2
►1
y( x) pn ( x)
Question No: 45 ( Marks: 1 ) If is approximated by a polynomial of
degree n then the error is given by
 ( x)  y( x)  Pn ( x)
►
 ( x)  y( x)  Pn ( x)
►
 ( x)  Pn ( x)  y( x)
►
 ( x)  y( x)  Pn ( x)
►
x0 , x1, x2 , x3 , x4 , x5 , x6 , x7 , x F ( x)
Let I denotes the closed interval spanned by . Then
vanishes ------times in the interval I .
► n-1
► n+2
►n
► n+1
Question No: 47 ( Marks: 1 ) - Please choose one
Differential operator in terms of forward difference operator is given by
1  2 3  4 5
D (      ...)
 h 2! 3! 4! 5!
1  2 3  4 5
D  (      ...)
 h 2 3 4 5
1  2
3  4 5
D  (      ...)
 h 2 3 4 5
1  2
3 4 5
D  (      ...)
 h 2! 3! 4! 5!
f ( x)
Finding the first derivative of at x =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
► Central difference operator
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
f ( x)
Question No: 50 ( Marks: 1 ) In Simpson’s 1/3 rule, is of the form
► ax  b
► ax  bx  c
2
► ax 3  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----

-.
 ba
n
ba

n
a b

n

To apply Simpson’s 1/3 rule, valid number of intervals are.....
►7
►8
►5
►3
For
the given table of values
x 02 0.3 0.4 0.5 0.6 0.7
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
............lies in the category of iterative method.
► Bisection Method
► Regula Falsi Method
► Secant Method

For the equation x  3 x  1  0 , the root of the equation lies in the interval......
3
► (1, 3)
► (1, 2)
► (0, 1)
► (1, 2)

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

If
dy
 f ( x, y )
dx
Then the integral of this equation is a curve in

► xt-plane
► yt-plane
► xy-plane

In solving the differential equation
y /  x  y ; y(0.1)  1.1
h  0.1 , By Euler’s method y (0.2) 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 )
►

k2
In 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
h k
 k2  hf ( xn  , yn  1 )
3 3
h k
k2  hf ( xn  , yn  1 )
 2 2

k4
In fourth order Runge-Kutta method, is given by
 K4=hf(xn+2h, yn+2K3)
 K4=hf(xn-h, yn-K3)
 K4=hf(xn+h, yn+K3)

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
Question no. 66 Total Marks: 1

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.
 Antiderivative
 Derivatives
In Runge – Kutta Method, we do not need to calculate higher order derivatives and
find greater accuracy.
 TRUE
 FALSE)
An indefinite integral may _________ in the sense that the limit defining it may
not exist.
 diverge
 converge
Question # 69 Total Marks: 1Page No.98
The Trapezoidal Rule is an improvement over using rectangles because we have
much less "missing" from our calculations. We used ________
to model the curve in trapezoidal Rule.
 straight lines
 curves
 parabolas
 constantsec(s)
An improper integral is the limit of a definite integral as an endpoint of the interval
of integration approaches either a specified real number or 8
or -8 or, in some cases, as both endpoints approach limits.
 TRUENo.99
 FALSE
Euler's Method numerically computes the approximate derivative of a function.
 FALSE
 TRUE
If we wanted to find the value of a definite integral with an infinite limit, we can
instead replace the infinite limit with a variable, and then take
the limit as this variable goes to _________.
 constant
 finite
 infinity
 zero
Bisection method is ……………….. method
 Bracketing Method
 Open
 Random
 none
Newton Raphson method is ……………….. method
 Open
 Random
 None
Eigenvalue is
 Real
 Vector
 odd
 even
For Simpson’s 1/3 rule no.of intervals must be
 2 ( even)
 3
 5
 7
For Simpson’s 1/3 rule valid no.of intervals are
 1
 3
 5
 8
For Simpson’s 3/8 rule no.of intervals must be
 10
 11
 12 multiple of three
 14
The determinant of a diagonal matrix is the product of the diagonal elements.
 TRUE
 FALSE
linearly independent.
 TRUE
 FALSE
To apply simpson's 3/8 rule, the number of intervals can be
 4
 7
 9 ( multiple of three)
 8
 TRUE
 FALSE
Page No.105
 no
 atleast one
Question #84 Total Marks: 1
equal to ______.
 unity
 zero
.106
 TRUE
 FALSE
 diagonal
 upper triangular
 lower triangular
 scalar
 real
 zero
 positive
 negative
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.
 TRUE
 FALSE

no zeros along its main diagonal.
 TRUE
 FALSE
In fourth order Runge-Kutta method, K1 is given by
 K1 =hf ( xn , yn)
 K1 =2hf ( xn , yn)
 K1 =3hf ( xn , yn)

If there are (n+1) values of y corresponding to (n+1) values of x, then we can
represent the function f (x) by a polynomial of degree
 n+2
 n+1
 n
 n-1

For differences methods we require the set of values.
 TRUE
 FALSE
 TRUE
 FALSE
If x is an eigen value corresponding to eigen value of V of a matrix A. If a is any
constant, then x – a is an eigen value corresponding to eigen vector V is an of the
matrix A - a I.
No.111
 TRUE
 FALSE
 TRUE
 FALSE
 TRUE
 FALSE
Iterative algorithms can be more rapid than direct methods.e No.113
 FALSE
 TRUE
 TRUE
 FALSE
 TRUE
 FALSE

 Zero
 Real
 positive
 negative
equal to zero.
 TRUE
 FALSE
 TRUE
 FALSE
symmetric ________ definite matrices A.
 positive
 negative
Differences methods find the ________ solution of the system.
 numerical
 Analytical
While deriving Trapezoidal rule, we approximate f (x) in the form_____
 ax+b
 ax2+bx+c
 ax3+bx2+cx+d
 ax4+bx3+cx2+dx+e
The Power method can be used only to find the eigen value of A that is largest in
absolute value—----------we call this eigen value the dominant eigen value of A.
 TRUE
 FALSE
no zeros along its ________.
 main diagonal
 last column
 last row
 first row
 TRUE
 FALSE
 TRUE
 FALSE
Differences methods find the ________ solution of the system.
 numerical
 Analytical
 TRUE
 FALSE
 TRUE
 FALSE
Eigenvalues of a _________ matrix are all real.
 symmetric
 antisymmetric
 rectangular
 triangular
By using determinants, we can easily check that the solution of the given system of
linear equation exits and it is unique.Page No.122
 TRUE
 FALSE
The dominant eigenvector of a matrix is an eigenvector corresponding to the
eigenvalue of largest magnitude (for real numbers, smallest absolute value) of that
matrix.
 TRUE
 FALSE
 real
 complex
 zero
 positive
The central difference method is finite method.
 True
 False
linearly _______.
 independent
 dependent
Page No.123
 TRUE
 FALSE
The Jacobi iteration ______, if A is strictly diagonally dominant.
 converges
 diverges
Power method is applicable if the eigen values are ______________.
 real and distinct
 real and equal
 positive and distinct
 negative and distinct
Determinant of a diagonal matrix is the product of the diagonal elements.
 TRUE
 FALSE
 TRUE
 FALSE
If n x n matrices A and B are similar, then they have the _____ eigenvalues (with
 same
 different
equal to ______.
 unity
 zero
 TRUE
 FALSE
 no
 atleast one
A 3 x 3 identity matrix have three and __________eigen values.
 same
 different
 real
 complex
 zero
 positive
The Jacobi iteration converges, if A is strictly diagonally dominant.
 TRUE
 FALSE
No.125
If n x n matrices A and B are similar, then they have the same eigenvalues (with
 TRUE
 FALSE
 TRUE
 FALSE
Two matrices with the same characteristic polynomial need not be similar.
No.126
 TRUE
 FALSE
sec(s)
 diagonal
 upper triangular
 lower triangular
 scalar
The absolute value of a determinant (|detA|) is the product of the absolute values of
the eigenvalues of matrix A
 TRUE
 FALSE
sec(s)
 TRUE
 FALSE
absolute value—we call this eigenvalue the dominant
eigenvalue of A.
 TRUE
 FALSE
Let A be an n ×n matrix. The number x is an eigenvalue of A if there exists a non-
zero vector v such that _______.
 Av = xv
 Ax = xvPage No.129
 Av + xv=0
 Av = Ax
no zeros along its main diagonal.
 TRUE
 FALSEsec(s)
Given the following data
x 0 1 4
y=f(x) 2 1 4
Value of first order divided difference y(0,1) is

 -1
 1
 2
 4
 TRUE
 FALSE
sec(s)
By using determinants, we can easily check that the solution of the
given system of linear equation exits and it is unique.
 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
The Inverse of a matrix can only be found if the matrix is
 Singular
 Non singular
 Scalar
 Diagonal
If f (x) contains trigonometric, exponential or logarithmic functions then
this equation is known as
 Transcendental equation
 Algebraic
 Polynomial
 Linear
In interpolation is used to represent the δ
 Forward difference
 Central difference
 Backward difference
The base of the decimal system is _______
 10
 0
 2
 8
 None of the above.
No.137
Bisection method is ……………….. method
 Open Method
Which method is not used to solve problems related to integration?
 Runge-Kutta Method
 Simpson’s 1/3rd rule
 Trapezoidal rule.
Adams – Bashforth is a multistep method.
 True
 False
Generally, Adams methods are superior if output at _____ points is needed.
 Many
 Two
 Single
 At most
In Trapezoidal rule, the integral is computed on each of the subintervals
by using linear interpolating formula, i.e. for n = 1 and
then summing them up to obtain the desired integral.
 True
 False

A third order ordinary differential equation can be reduced to a system of
_____ first order ordinary differential equations.
 0
 1
 2
 3
Euler's Method numerically computes the approximate ________ of a function.
 antiderivative
 derivative
 value
 error

Multistep method does not improves the accuracy of the answer at each step.
FALSE
TRUE
The trapezoidal rule is a numerical method that approximates the value of a
________.
 indefinite integral
 definite integral
 improper integral
 function
145
Simpson’s rule is a numerical method that approximates the value of a definite
integral by using __________ polynomials.
 quadratic
 linear
 cubic
 quarticPage No.146
In Simpson's Rule, we use parabolas to approximate each part of the curve. This
proves to be very efficient as compared to Trapezoidal rule.
 True
 False
The first langrange polynomial with equally spaced nodes produced the formula
for __________.
 Simpson's rule
 Trapezoidal rule
 Newton's method
 Richardson's method
147The need of numerical integration arises for evaluating the indefinite integral of
a function that has no explicit antiderivative or whose antiderivative is not easy to
obtain.
 TRUE
 FALSE
The Trapezoidal Rule is an improvement over using rectangles because we have
much less "missing" from our calculations. We used ________ to model the curve
in trapezoidal Rule.
 straight lines
 curves
 parabolas
 constant
The Euler method is numerically unstable because of ________ convergence of
error.
 slow
 fast
 moderate
 no
In integrating , by dividing the interval into eight equal parts, width of the
interval should be
 0.125
 0.250
 0.500
 0.825
x0 , x1 , x2 , x3 , x4 , x5 , x6 , x7 , x F ( x)
Let I denotes the closed interval spanned by . Then
vanishes ------times in the interval I .
 6
 9
 7
 8
The minimum interval in which the root of the equation x2-3x+1=0 is
 (0,1)
 (1,2)
 (2,4)
 (0,2)
The quantity of error which is present in the statement of the problem itself, before
finding its solution is called
 Inherent error
 Local round off error
 Local truncation error
 Tying error
In Regula Falsi Method two points xn and x n+1 are chosen such that f (xn) and f
(n+1) have ______ signs.
 +ve
 -ve
 Opposite
 Same
Regula Falsi Method lies in the category of______
 Iterative method
 Bracketing method
 Random method
 Graphical method
Secant method converges______ than bisection
 Faster
 Slower
 Equally
Muller's method is a generalization of:
 Bisection method
 Iteration method
 Secant method
 Regula Falsi Method
Diagonal dominance of a coefficient matrix is strictly checked in:
 Muller's method
 Bisection method
 Jacobi’s method
 Newton-Raphson method
It can be verified that for matrix A=
 AA-1=I, I= identity matrix

 AA-1=D, D =diagonal matrix
 AA-1=S, S =symmetric matrix
 AA-1=Z , Z =orthogonal matrix

If [A] is an n×n real symmetric matrix, its eigenvalues are real, and there exists an
orthogonal matrix [S] such that the diagonal matrix (D) is given by:
 [D]=[S]-1[A][S]
 [D]=[S]-1[S][A]
 [D]=[S]2[A][S]
 None of the above
Given the the following data
x 1 2 -4
f (x) 3 -5 -4
Which formula is useful in finding the interpolating polynomial?

 Newton's backward difference formula
 Lagrange’s interpolation formula
 Newton's forward difference formula
The magnitude of truncation error in Milne's predictor formula is

6 5 3 2
If f (x)= 5x +6x -7x -9x +4x-3, then its derivative is zero for all x.
 4th
 7th
 6th
 5th
In Richardson's extrapolation method, the extrapolation process is repeated 8until
accuracy is achieved, this is called extrapolation to the_____
 Limit
 Function
 Arbitrary value of ‘h'
While deriving Simpson's 3/8 rule, we approximate f (x) in the form_____
 ax+b
 ax2+bx+c
 ax3+bx2+cx+d
 ax4+bx3+cx2+dx+e
When we apply simpson's 3/8 rule, the number of intervals n must be:
 Even
 Odd
 Multiple of 3
 Multiple of 8
In integrating by dividing into eight equal parts, width of the

interval should be......
 0.250
 0.500
 0.125
 0.625
Romberg's integration method is _____ than Trapezoidal and Simpson's rule.
 More accurate
 Less accurate
 Equally accurate
A fourth order ordinary differential equation can be reduced to a system of
fourth_____ order ordinary differential equations
 First
 Second
 Third
 Fourth
 3.0392
 2.0392
 1.0392
 0.0392
Y' =x+y, y (0.1)= 1.1
h=0.1, By Euler's method y (0.2) is calculated as:
 1.44
 1.11
 1.22
 1.33

The truncation error in Adam's predictor formula is

Y' = x2 + 2xy ; y (0) =1
h=0.1, By Euler's method y (0.1) is calculated as
 1
 2
 3
 4
Y' = x2 + 2y ; y (1) =3
h=1, By Euler's method y (2) is calculated as
 4
 6
 8
 10 not sure
In integrating , by dividing the interval into four equal parts, width of

the interval should be:




The minimum interval in which the root of the equation x2- 3x +1=0 lie is:
 (0,1)
 (1,2)
 (2,4)
 (0,2)
If the root the given equation lies between a and b, then the first approximate to
the root of the equation by bisection method.....

If 8+7i is the root of a quadratic equation f (x)=0, then the other root of the
equation will be:
 8-7i
 -8-7i
 -8+7i
 8
If there are two roots of the equation and one root is 2+3i , then the other root will
be:
 2+3i
 2-3i
 3+2i
 3-2i

In crout's reduction method the elements of the main diagonal of upper triangular
matrix are taken as
 0
 1
 -1
In Gauss-seidal method, the new approximation calculated is:
 Used in the next iteration for next approximation
 Instantly replaced by the previous one
 Never used again
In relaxation method, for fast convergence all the terms should be taken to one side
and then reordering should be done so that the largest coefficient should appear on
the
 End of rows
 Beginning of the rows
 Diagonal
Every squre _____ matrix has an inverse.
 Singular
 Non-Singular
 Zero

S-1 =ST
 ST =S
 I= S
A 3×3 matrix [A] is said to be orthogonal if
 [A]-1[ A]= I
 [AT ][A]=I
 [AT][ A]=0
Jacobi's method for finding the eigen values can be applied to:
 Real and symmetric matrix
 Real and unsymmetric matrix
 Real and complex unsymmetric matrix
Lagrange’s interpolation formula is used when the values of the independent
variable are:
 Equally spaced
 Not equally spaced
 Constant
From the following table of values
x 1.3 1.5 1.7 1.9 2.1 2.3
y 2.9648 2.6599 2.3333 1.9922 1.6442 1.2969
Estimation of y' (1.3) will be done using the formula of differential operator in
terms of
 Backward difference operator
 Central difference operator
 Forward difference operator

Relationship between differential operator and backward difference operator is
given by

Shift operator is defined as
 Ef (x)= f (x-h)
 Ef (x)= -f (x-h)
 Ef (x)= -f (x+h)
 Ef (x)= f (x+h)

MTH603 Final Term by JUNAID

Uploaded by

Copyright:

Available Formats

MTH603 Final Term by JUNAID

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

MTH603 Final Term by JUNAID

Uploaded by

Copyright:

Available Formats

MTH603-NUMERICAL ANALYSIS

Solved MCQS for Final terms papers

Question # 1 Total Marks: 1

Question # 2 Total Marks: 1

Question # 4 Total Marks: 1

Question # 5 Total Marks: 1

The determinant of a _______ matrix is the product of the diagonal elements.

yeh charon options theek hain….

Question # 9 Total Marks: 1

Question # 10 Total Marks: 1

Question # 11 Total Marks: 1

P-C method is derived by employing

Question # 13 Total Marks: 1

Question # 14 Total Marks: 1

If x is an eigen value corresponding to eigen value of V of a matrix A. If a is any

Question # 15 Total Marks: 1

Central difference method seems to be giving a better approximation, however it

Question # 16 Total Marks: 1

Iterative algorithms can be more rapid than direct methods.

Question # 17 Total Marks: 1

Question # 18 Total Marks: 1

Question # 19 Total Marks: 1

Question # 20 Total Marks: 1

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

Question # 21 Total Marks: 1

Eigenvalues of a symmetric matrix are all _______ .

Question # 22 Total Marks: 1

The Jacobi iteration converges, if A is strictly diagonally dominant.

Question # 23 Total Marks: 1

Question # 24 Total Marks: 1

Question # 25 Total Marks: 1

If A is a nxn triangular matrix (upper triangular, lower triangular) or diagonal

Question # 26 Total Marks: 1

The global error in Simpson's 3/8 rule is of

Question # 27 Total Marks: 1

Question # 28 Total Marks: 1

Question # 29 Total Marks: 1

 Failing to involve key employees in all phases of planning

Question # 30 Total Marks: 1

Question # 31 Total Marks: 1

Question # 32 Total Marks: 1

According to Porter, which strategy offers products or services to a small range of

Question # 33 Total Marks: 1

Symbol used for forward differences is

Question No: 37 ( Marks: 1 )

Question No: 38 ( Marks: 1 )

Muller’s method requires --------starting points

Question No: 39 ( Marks: 1 )

Question No: 40 ( Marks: 1 )

Question No: 41 ( Marks: 1 )

Question No: 42 ( Marks: 1 )

Question No: 43 ( Marks: 1 )

► Not equally spaced

Question No: 44 ( Marks: 1 )

Question No: 46 ( Marks: 1 )

Question No: 47 ( Marks: 1 ) - Please choose one

Differential operator in terms of forward difference operator is given by

Question No: 48 ( Marks: 1 ) - Please choose one

x 0.1 0.2 0.3 0.4