Free Printable Numerical Methods MCQ(2)-CAT I

1.

The iteration formula for Newton-Raphson method is

a)

$x_{n+1}=x_n+\frac{f\left(x_n\right)}{f'\left(x_n\right)}$

b)

$x_{n+1}=x_n-\frac{f\left(x_n\right)}{f'\left(x_n\right)}$

c)

$x_{n+1}=x_n-\frac{f'\left(x_n\right)}{f\left(x_n\right)}$

d)

$x_{n+1}=x_n+\frac{f'\left(x_n\right)}{f\left(x_n\right)}$

2.

What line is used to find the next iteration in Newton-Raphson method?

a)

Secant

b)

Normal

c)

Chord

d)

Tangent

3.

In Newton-Raphson method, if we want to give our answer correct to 3 decimal places then we need to use how many decimal places in the calculation of the iterations?

a)

3 decimal places

b)

2 decimal places

c)

4 decimal places

d)

any number of decimal places will do

4.

The following are ways to verify whether there is a root in the interval [a, b] for a continuous function f(x) except

a)

f(a) < 0 and f(b) > 0

b)

f(a) x f(b) < 0

c)

f(a) x f(b) > 0

d)

The sign for f(a) and f(b) changes

5.

In regula falsi method ,the formula is derived using the equation of ---- joining the point a and b.

a)

tangent

b)

chord

c)

midpoint

d)

curve

6.

Bisection method is also known as ----- method.

a)

Newton Raphson

b)

Regula Falsi

c)

Interval Halving

d)

Newton

7.

What is the solution to the 4x5 Matrix ?

a)

( 3, 4, 9, 6 )

b)

( 3, 4, 9, -6 )

c)

( -6, 9, 4, 3 )

d)

( 6, 9, 4, 3 )

8.

Using back-substitution, calculate the solution for the REF matrix.

a)

(3, -6, 3)

b)

(-6, -6, 3)

c)

(6, -6, 3)

d)

(-6, -6, 3)

9.

Iteration method is a self correcting method

a)

True

b)

False

10.

Iteration will converge if the leading diagonal element are greater than the sum of other coefficients of that row.

a)

True

b)

False

Numerical Methods MCQ(2)-CAT I

Total questions: 10

Worksheet time: 30mins

Similar Resources on Wayground