 MCQ:

1. In which of the following method, we approximate the curve of solution by the tangent in each
interval.

a. Picard’s method
b. Euler’s method
c. Newton’s method
d. Runge Kutta method

2. The convergence of which of the following method is sensitive to starting value?

A.False position

B.Gauss seidal method

C.Newton-Raphson method

D.All of these

3. The shifting operator is denoted by ________.

A. E
B. nabla
C. omega
D. T
4. The process of finding the values inside the interval (X0, Xn) is called
A. Interpolation
B. Extrapolation
C. Iterative
D. Polynomial equation
Ans- A

5. The Delta of power two is called the ____order difference operator.

A. First B. second
C. Third D. Fourth

6. Newton forward interpolation formula is used for _________ intervals.

A. open B. unequal
C. equal D. closed

7. For the given distributed data find the value of Δ3y0 is?

A. 0.095 B. 0.007
C. 1.872 D. 0.123

8. If the exact solution of equation y′ = f(x,y) with y(x0) = y0 then Taylor’s series expansion for y(x) about
the point x = x0 is y(x) = - - - -
Numerical – M.A.S  Final 5

d
9. By using Newton’s backward difference table form the following data:
f (30) = 0.5000, f (35) = 0.5736, f (40) = 0.6428, f (45) = 0.7071. What is the value of 3yn?
A. - 0.0049 B. -1.872
C. - 0.0005 D. -0.0469

10. The relationship between E and delta is __________.

A. E =1-delta

B. E =1+delta

C. E = delta-1

D. E = delta

11. The forward difference operator is denoted by the symbol __________.

A. ∆ B. Ω
C. ∂ D. ∞

12. The Delta of power two is called the ____order difference operator.
A. First B. second
C. Third D. Fourth

13. The Lagrange’s interpolation formula is used for the arguments which are - - - - spaced
a) equally b) distinct c) unequally d) none of these
n
14. If n value of f(x) are given then Δ f(x) is - - - - -

a) 0 b) 1 c) 2 d) n
15. The technique for computing the value of the function inside the given argument is called - - - -
a) interpolation b) extrapolation
c) partial fraction d) inverse interpolation
16. ..……………is an approach for solving complex mathematical problems using only simple basic
arithmetic operations
A. Numerical computing

B. Binary computing

C. Arithmetical computing

D. Factorial computing

17. Every algebraic equation of nth degree, where n is a positive integer, has only……………
A. n – 1 roots

1
Numerical – M.A.S  Final 5

B. n + 1 roots

C. 2n roots

D. n roots

18. If a + ib is a root of f(x) = 0 then the other root is.……………

A. a – ib

B. a

C. b

D. ib

19. If x = a is a root of f(x) = 0, then the factor of f(x) is……………

A. x + a

B. a

C. x – a

D. x

20. Process of estimating the value of dependent variable at an intermediate value is called………………
A. Interpolation

B. Extrapolation

C. Estimation

D. Dependency

21. The value of the independent variable x is called the……………

A. Entry

B. Argument

C. Depositary

D. Amplitude

22. The polynomial y = f(x) satisfying the data is called…………

A. Dividing polynomial

B. Interpolating polynomial

C. Extrapolating polynomial

D. Polynomial

2
Numerical – M.A.S  Final 5

23. A …………………….. is a relation between the differences of an unknown function at one or more
general values of the argument.
A. Differential equation

B. Partial differential equation

C. Difference equation

D. linear equation

24. .………………of difference equation is an expression for y(n) which satisfies the given difference
equation.
A. Function

B. Order

C. Solution

D. Degree

25. A …………… difference equation is that in which yn+1, yn+2 etc. occur to the first degree only and
are not multiplied together.
A. Linear

B. Quadratic

C. Cubic

D. Quartic

26. A …………. solution is that solution which is obtained from the general solution by giving particular
values to the constants.
A. Accurate

B. Recurring

C. Particular

D. Integer

27. Error in Simpson’s three eighth rule is ………….. compared to Simpson’s one third rule.
A. Small

B. Negligible

C. Zero

D. Large

28. Simpsons 1/3 rd rule is obtained by taking n = ……….. in the general quadrature formula

3
Numerical – M.A.S  Final 5

A. 1

B. 2

C. 3

D. 4

29. To apply Simpson’s one third rule, the given interval must be divided into an …………… number of
equal intervals.
A. Odd

B. Even

C. Countable

D.Uncountable

30. The ……….. of a differential equation is the order of the highest derivative appearing in it.
A. Value

B. Degree

C. Dimension

D. Order

31. A differential equation together with the initial condition is called..………………………

A. Initial value

B. Initial value problem

C. Problem

D. Conditioned problem

32. In …………………. we approximate the curve of solution by the tangent in each interval.
A. Picard’s method

B. Euler’s method

C. Newton’s method

D. Runge Kutta method

33. The value of x that satisfies

f x   0 is called the

(A) root of an equation f x   0

(B) root of a function f x 
(C) zero of an equation f x   0

4
Numerical – M.A.S  Final 5

(D) none of the above

34. A quadratic equation has root(s).

(A) one
(B) two
(C) three
(D) four

35. For a certain cubic equation, at least one of the roots is known to be a complex root. How many total
complex roots does the cubic equation have?

(A) one
(B) two
(C) three
(D) cannot be determined
36. An equation such as tan x  x has root(s).

(A) zero
(B) one
(C) two
(D) infinite

37. A polynomial of order n has __________ zeros.

(A) n  1
(B) n
(C) n  1
(D) n  2
38. The velocity of a body is given by
v(t )  5e t  4 , where t is in seconds and v is in m/s. The velocity
of the body is 6 m/s at t = ____________ seconds.

(A) 0.1823
(B) 0.3979
(C) 0.9163
(D) 1.609

v(t )  5e t  4

where

v(t )  6 m/s

5
Numerical – M.A.S  Final 5

5e  t  4  6
5e t  6  4  2
2
e t 
5

If we take the natural log of both sides

2
ln(e t )  ln  
5
 t  0.9162
t  0.9163 s

Or if we take the log 10 of both sides

2
log 10 (e t )  log 10  
5
 t  log 10 (e)  0.3979
 0.3979
t
 0.4343
t  0.9163 s

39. The bisection method of finding roots of nonlinear equations falls under the category of a (an)
_________ method.

(A) open
(B) bracketing
(C) random
(D) graphical

40. If for a real continuous function

f x  , f (a) f b  0 , then in the range of a, b for f x   0 , there
is (are)

(A) one root

(B) an undeterminable number of roots
(C) no root
(D) at least one root

41. Assuming an initial bracket of

1,5 , the second (at the end of 2 iterations) iterative value of the root
t
of te  0.3  0 using the bisection method is

(A) 0
(B) 1.5
(C) 2

6
Numerical – M.A.S  Final 5

(D) 3
f (t )  te t  0.3

42. To find the root of f(x) = 0, a scientist is using the bisection method. At the beginning of an iteration,
x x
the lower and upper guesses of the root are l and u . At the end of the iteration, the absolute
relative approximate error in the estimated value of the root would be

xu
(A)
xu  x 
x
(B)
xu  x 
xu  x 
(C)
xu  x 
xu  x 
(D)
xu  x 
43. For an equation like x  0 , a root exists at
2
x  0 . The bisection method cannot be adopted to solve
this equation in spite of the root existing at x  0 because the function f x   x
2

(A) is a polynomial
(B) has repeated roots at x  0
(C) is always non-negative
(D) has a slope equal to zero at x  0
44. The false-position method for finding roots of nonlinear equations belongs to a class of a (an)
____________ method.
(A) open

(B) bracketing

(C) random

(D) graphical

45. The Newton-Raphson method of finding roots of nonlinear equations falls under the category of
_____________ methods.

(A) bracketing
(B) open
(C) random
(D) graphical

46. The Newton-Raphson method formula for finding the square root of a real number R from the
equation x  R  0 is,
2

7
Numerical – M.A.S  Final 5

xi
(A) xi 1 
2
3x
(B) xi 1  i
2
1 R
(C) xi 1   xi  
2 xi 
1 R
(D) xi 1   3xi  
2 xi 

47. The next iterative value of the root of x  4  0 using the Newton-Raphson method, if the initial
2

guess is 3, is

(A) 1.5
(B) 2.067
(C) 2.167
(D) 3.000
48. The root of the equation f ( x)  0 is found by using the Newton-Raphson method. The initial
x0  3 f 3  5
estimate of the root is , . The angle the line tangent to the function f (x) makes at
x  3 is 57 with respect to the x-axis. The next estimate of the root, x1 most nearly is

(A) –3.2470
(B) −0.24704
(C) 3.2470
(D) 6.2470
49. The root of x  4 is found by using the Newton-Raphson method. The successive iterative values of
3

the root are given in the table below.

Iteration Value of Root

Number
0 2.0000
1 1.6667
2 1.5911
3 1.5874
4 1.5874
The iteration number at which I would first trust at least two significant digits in the answer is

(A) 1
(B) 2
(C) 3
(D) 4

8
Numerical – M.A.S  Final 5

50. The secant method of finding roots of nonlinear equations falls under the category of _____________
methods.

(A) bracketing
(B) graphical
(C) open
(D) random

51. Every algebraic equation of the nth degree has exactly - - - - roots.
52. In bisection method if roots lies between a and b then f(a)×f(b) is - - - -
a) < 0 b) = 0 c) > 0 d) none of these
53. The root of the equation x3 – 2x – 5 = 0 lies between - - - -
a) 0 and 1 b) 1 and 2 c) 2 and 3 d) 3 and 4
54. In Newton Raphson method for finding the real root of equation f(x) = 0, the value of x is given by - - -
-

55. Which method is more useful in solving the differential equation y′ = f(x,y) with y(x0) = y0?
56. The secant method formula for finding the square root of a real number R from the equation
x 2  R  0 is

xi xi 1  R
(A)
xi  xi 1
xi xi 1
(B)
xi  xi 1
1 R
(C)  xi  
2 xi 
2 xi2  xi xi 1  R
(D)
xi  xi 1
57. The next iterative value of the root of x  4  0 using secant method, if the initial guesses are 3 and
2

4, is

(A) 2.2857
(B) 2.5000
(C) 5.5000
(D) 5.7143

58. For finding the root of sin x  0 by the secant method, the following choice of initial guesses would
not be appropriate.
π π
(A) and
4 2

9
Numerical – M.A.S  Final 5

π 3
(B) and
4 4
π π
(C)  and
2 2
π π
(D) and
3 2

59. Using the forwarded divided difference approximation with a step size of 0.2, the derivative of
f ( x)  5e 2.3 x at x  1.25 is

(A) 163.4
(B) 203.8
(C) 211.1
(D) 258.8

d x
(e )  20.220
60. A student finds the numerical value of dx at x  3 using a step size of 0.2. Which of
the following methods did the student use to conduct the differentiation?
(A) Backward divided difference
(B) Calculus, that is, exact
(C) Central divided difference
(D) Forward divided difference

61. The definition of the first derivative of a function f (x) is

f ( x  x)  f ( x)
(A) f ' ( x) 
x
f ( x  x)  f ( x)
(B) f ' ( x) 
x
f ( x  x)  f ( x)
(C) f ' ( x)  lim
x  0 x
f ( x  x)  f ( x)
(D) f ' ( x)  lim
x 0 x

62. Using the forward divided difference approximation with a step size of 0.2, the derivative of the
function at x  2 is given as

x 1.8 2.0 2.2 2.4 2.6

f x  6.0496 7.3890 9.0250 11.023 13.464

11
Numerical – M.A.S  Final 5

(E) 6.697
(F) 7.389
(G) 7.438
(H) 8.180
The forward divided difference approximation is

f ( xi 1 )  f ( xi )
f ( xi ) 
x

where

x i  2. 0
xi 1  2.2
x  0.2

Thus,

f (2.2)  f (2.0)
f (2.0) 
0.2

9.0250  7.3890

0.2
 8.180

63. A student finds the numerical value of f ( x)  20.220 atx  3 using a step size of 0.2. Which of the
following methods did the student use to conduct the differentiation if f x  is given in the table
below?

x 2.6 2.8 3.0 3.2 3.4 3.6

f x  e 2.6 e 2.8 e3 e 3.2 e 3.4 e 3.6

(E) Backward divided difference

(F) Calculus, that is, exact
(G) Central divided difference
(H) Forward divided difference

64. The velocity of a rocket is given as a function of time as

t, s 0 0.5 1.2 1.5 1.8

v, m/s 0 213 223 275 300

11
Numerical – M.A.S  Final 5

Allowed to use the forward divided difference, backward divided difference or central
divided difference approximation of the first derivative, the best estimate for the acceleration
 dv 
 a   in m / s of the rocket at t  1.5 seconds is
2

 dt 
(A) 83.33
(B) 128.33
(C) 173.33
(D) 183.33

v(ti 1 )  v(ti 1 )
a(t ) 
2(x)

where

t i  1 .5 s
t i 1  1.8 s
t i 1  1.2 s
x  0.3 s

Thus,

v1.8  v1.2
a(1.5) 
2(0.3)

300  223

0.6

 128.33 m / s 2

65. In a circuit with an inductor of inductance L , a resistor with resistance R , and a variable voltage
source E (t ) ,
di
E (t )  L  Ri
dt
The current, i, is measured at several values of time as
Time, t (secs) 1.00 1.01 1.03 1.1
Current, i (amperes) 3.10 3.12 3.18 3.24
If L  0.98 henries and R  0.142 ohms, the most accurate expression for E (1.00) is

 3.24  3.10 
(A) 0.98   (0.142)(3.10)
 0.1 
(B) 0.142  3.10

12
Numerical – M.A.S  Final 5

 3.12  3.10 
(C) 0.98   (0.142)(3.10)
 0.01 
 3.12  3.10 
(D) 0.98 
 0.01 

di i (ti1 )  i(ti )

dt ti1  ti

where

ti  1.00
ti1  1.01
di 3.12  3.10

dt 0.01
di
E (t )  L  Ri
dt
 3.12  3.10 
E (1)  0.98   (0.142)(3.10)
 0.01 

66. The number of different polynomials that can go through two fixed data points
x1 , y1  and x2 , y2 
is
A) 0
B) 1
C) 2
D) infinite

67. Given n+1 data pairs, a unique polynomial of degree __________________ passes through n  1 data
points.
(E) n 1
(F) n  1 or less
(G) n
(H) n or less

68. The following function(s) can be used for interpolation:

(A) polynomial
(B) exponential
(C) trigonometric
(D) all of the above

69. Polynomials are the most commonly used functions for interpolation because they are easy to
(E) evaluate
(F) differentiate
(G) integrate
(H) evaluate, differentiate and integrate

13
Numerical – M.A.S  Final 5

70. Given n  1 data points x0 , y0 , x1 , y1 ,......, xn1 , y n1 , xn , y n  , assume you pass a function f (x)
through all the data points. If now the value of the function f (x) is required to be found outside the
range of the given x-data, the procedure is called
(I) extrapolation
(J) interpolation
(K) guessing
(L) regression

71. Given three data points (1,6), (3,28), and (10, 231), it is found that the function
y  2 x 2  3x  1
passes through the three data points. Your estimate of y at x  2 is most nearly
(M) 6
(N) 15
(O) 17
(P) 28

72. The data of the velocity of a body as a function of time is given as follows.

Time (s) 0 15 18 22 24

Velocity (m/s) 22 24 37 25 123

The velocity in m/s at 16 s using linear polynomial interpolation is most nearly

E) 27.867
F) 28.333
G) 30.429
H) 43.000

For the first order polynomial, we choose the velocity given by

vt   a0  a1t

Since we want to find the velocity at t  16 , we choose the two data points that are closest to t  16
and that also bracket t  16 . Those two points are t0  15 and t1  18 . Then

t0  15, vt0   24

t1  18, vt1   37

gives

v15  a0  a1 15  24

v18  a0  a1 18  37

Writing the equations in matrix form

14
Numerical – M.A.S  Final 5

1 15 a0  24

1 18  a   37 
  1   

and solving the above two equations gives

a0  41

a1  4.3333

Hence

vt   a0  a1t

 41  4.3333t , 15  t  18

v16  41  4.333316

 28.333 m/s
73. The following data of the velocity of a body as a function of time is given as follows.

Time (s) 0 15 18 22 24

Velocity (m/s) 22 24 37 25 123

The velocity in m/s at 16 s using quadratic polynomial interpolation is most nearly

(A) 27.867
(B) 28.333
(C) 30.429
(D) 43.000
For second order polynomial interpolation (also called quadratic interpolation), we choose the velocity
given by

vt   a0  a1t  a2t 2

Since we want to find the velocity at t  16 , we need to choose the three data points that are closest
to t  16 and that also bracket t  16 . These three points are t0  15 , t1  18 , and t2  22 .

t0  15, vt0   24

t1  18, vt1   37

t 2  22, vt 2   25

gives

v15  a0  a1 15  a2 15  24

2

v18  a0  a1 18  a2 18  37

2

15
Numerical – M.A.S  Final 5

v22  a0  a1 22  a2 22  25

2

Writing the three equations in matrix form

1 15 225 a0  24

1 18 324  a   37 
  1   
1 22 484 a 2  25

and the solution of the above three equations gives

a0  323.86

a1  38.905

a2  1.0476

Hence

vt   323.86  38.905t  1.0476t 2 , 15  t  22

At t  16 ,

v16  323.86  38.90516  1.047616

2

 30.429 m/s
74. The Lagrange polynomial that passes through the 3 data points is given by
x 15 18 22
y 24 37 25
f 2 x   L0 x 24  L1 x 37  L2 x 25

The value of L1 x  at x  16 is

(A) –0.071430
(B) 0.50000
(C) 0.57143
(D) 4.3333

75. The following data of the velocity of a body is given as a function of time.

Time (s) 10 15 18 22 24

Velocity (m/s) 22 24 37 25 123

A quadratic Lagrange interpolant is found using three data points, t  15 , 18 and 22. From this
information, at what of the times given in seconds is the velocity of the body 26 m/s during the
time interval of t  15 to t  22 seconds.

(A) 20.173

16
Numerical – M.A.S  Final 5

(B) 21.858
(C) 21.667
(D) 22.020
n
vn (t )   Li (t )v(ti )
i 0

where

t0  15, vt0   24

t1  18, vt1   37

t2  22, vt2   25

gives
n t tj
Li (t )  
j 0 ti  t j
j i

2 t tj  t  t1  t  t2 
L0 (t )      
j 0 t 0  t j  t0  t1  t0  t2 
j 0

2 t tj  t  t 0  t  t 2 
L1 (t )      
j 0 t1  t j  t1  t 0  t1  t 2 
j 1

2 t tj  t  t 0  t  t1 
L2 (t )      
j 0 t 2  t j  t 2  t 0  t 2  t1 
j 2

 t  t1  t  t 2   t  t0  t  t 2   t  t0  t  t1 
v2 (t )    v(t0 )    v(t1 )    v(t 2 )
 t0  t1  t0  t 2   t1  t0  t1  t 2   t 2  t0  t 2  t1 

17
Numerical – M.A.S  Final 5

 t  18  t  22   t  15  t  22   t  15  t  18 
  v(15)    v(18)    v(22)
 15  18  15  22   18  15  18  22   22  15  22  18 
 t  18  t  22   t  15  t  22   t  15  t  18 
26      24      37      25
 15  18  15  22   18  15  18  22   22  15  22  18 
 t  18  t  22   t  15  t  22   t  15  t  18 
26      24      37      25
  3   7   3   4   7  4 
 t 2  40t  396   t 2  37t  330   t 2  33t  270 
26     24     37     25
 21    12   28 
  
26  1.1429t  45.714t  452.57   3.0833t  114.08t  1017.5
2 2


 0.89286t  29.464t  241.07
2

26  1.0476t 2  38.905t  323.86
0  1.0476t 2  38.905t  349.86
 38.905  38.9052  4  1.0476  349.86
t
2  1.0476
 21.858 and 15.278
4

 (e
2 x
 4 x 2  8) dx
76. The exact value of 1 most nearly is
(I) 6.0067
(J) 5.7606
(K) 60.0675
(L) 67.6075
4

 (e
2 x
 4 x 2  8) dx
77. The approximate value of 1 by a single application of Simpson’s 3/8 rule is
(M) 61.3740
(N) 60.0743
(O) 59.3470
(P) 58.8992
4

 (e
2 x
 4 x 2  8) dx
78. The approximate value of 1 by a multiple-segment Simpson’s 3/8 rule with n=6
segments is most nearly
(Q) 60.8206
(R) 60.6028
(S) 61.0677
(T) 60.0675

79. The two-segment trapezoidal rule of integration is exact for integrating at most ________ order
polynomials.

(A) first

18
Numerical – M.A.S  Final 5

(B) second
(C) third
(D) fourth
2.2

 xe
x
dx
80. The value of 0.2 by the using one-segment trapezoidal rule is most nearly

(A) 11.672
(B) 11.807
(C) 20.099
(D) 24.119
 f (a)  f (b) 
b

 f x dx  (b  a)
a
2 


where

a  0.2
b  0.2

f  x   xe x
f 0.2   0.2e 0.2
 0.24428
f 2.2  2.2e 2.2
 19.855
 0.24428  19.855 
2.2

 xe dx  2.2  0.2
x

2 
0.2

 2  10.050
 20.099

2.2

 xe dx
x

81. The value of 0.2 by using the three-segment trapezoidal rule is most nearly

(A) 11.672
(B) 11.807
(C) 12.811
(D) 14.633

ba   n1  
b

 f x dx   f ( a )  2  f (a  ih )  f (b)
a
2n   i1  

19
Numerical – M.A.S  Final 5

where

a  0 .2
b  2 .2
n3
ba
h
n
2 .2  0 .2

3
 0.66667
f ( x )  xe x

Thus

2.2  0.2   31  

b

 f x dx   f ( 0.2)  2  f (0.2  i  0.66667)  f (2.2)

a
23   i1  

2 2  
  f ( 0.2)  2  f (0.2  i  0.66667)  f (2.2)
6  i1  


1
 f (0.2)  2 f (0.86667)  2 f 1.5333  f (2.2)
3

where

f 0.2   0.2e 0.2

 0.24428
f 0.86667   0.86667e 0.86667
 2.0618
f 1.5333  1.5333e1.5333
 7.1048
f 2.2   2.2e 2.2
 19.855

Hence

2.2

 xe dx  0.333330.24428  2  2.0618  2  7.1048  19.855

x

0.2

 0.3333338.433
 12.811

21
Numerical – M.A.S  Final 5

 x 2 y  2 x  3, y0  5
dy
2
82. The differential equation dx is
(A) linear
(B) nonlinear
(C) linear with fixed constants
(D) undeterminable to be linear or nonlinear

83. A differential equation is considered to be ordinary if it has

(A) one dependent variable
(B) more than one dependent variable
(C) one independent variable
(D) more than one independent variable
84. Given

 5 y 2  sin x, y0.3  5
dy
3
dx

and using a step size of h  0.3 , the value of y0.9 using Euler’s method is most nearly

(A)  35.318
(B)  36.458
(C)  658.91
(D)  669.05

2
85. Newton-Raphson method is used to find the root of the equation x - 2 = 0. If iterations are started
from - 1, then iterations will be
A.converge to -1

B.converge to √2

C.converge to -√2 (Ans)

D.no coverage

86. Which of the following statements applies to the bisection method used for finding roots of
functions?
A.Converges within a few iterations

B.Guaranteed to work for all continuous functions (Ans)

C.Is faster than the Newton-Raphson method

D.Requires that there be no error in determining the sign of the function

87. If Δf(x) = f(x+h) - f(x), then a constant k, Δk equals

21
Numerical – M.A.S  Final 5

A.1

B.0

C.f(k)- f(0)

D.f(x + k) - f(x)

88. Newton-Raphson method of solution of numerical equation is not preferred when

A.Graph of A(B) is vertical

B.Graph of x(y) is not parallel

C.The graph of f(x) is nearly horizontal-where it crosses the x-axis.

D.None of these

Ans - C

89. Newton-Raphson method is applicable to the solution of

A.Both algebraic and transcendental Equations

B.Both algebraic and transcendental and also used when the roots are complex

C.Algebraic equations only

D.Transcendental equations only

Ans - A

90. The order of error s the Simpson's rule for numercal integration with a step size h is
A.h

B.h2

C.h3

D.h4

91. Errors may occur in performing numerical computation on the computer due to
A.Rounding errors

B.Power fluctuation

C.Operator fatigue

D.All of these

Ans - A

92. Which of the following statements applies to the bisection method used for finding roots of
functions?

22
Numerical – M.A.S  Final 5

A. Converges within a few iterations

B. Guaranteed to work for all continuous functions
C. Is faster than the Newton-Raphson method
D. Requires that there be no error in determining the sign of the function
93. The convergence of which of the following method is sensitive to starting value?

A. False position
B. Gauss seidal method
C. Newton-Raphson method
D. All of these
94. Newton-Raphson method of solution of numerical equation is not preferred when

A. Graph of A(B) is vertical

B. Graph of x(y) is not parallel

C. The graph of f(x) is nearly horizontal-where it crosses the x-axis.

D. None of these

95. Newton-Raphson method is applicable to the solution of

A. Both algebraic and transcendental Equations

B. Both algebraic and transcendental and also used when the roots are complex
C. Algebraic equations only
D. Transcendental equations only
96. In which of the following methods proper choice of initial value is very important?

A. Bisection method

B. False position

C. Newton-Raphson

D. Bairsto method

97. Let f(x) be an equation such that f(a) f(b) > 0 for two real numbers a and b. Then
at least one root of f(x) = 0 lies in (a, b)
no root lies in (a, b)
either no root or an even number of roots lie in (a, b)
None of these.

23
Numerical – M.A.S  Final 5

8=b, 9=c, 12=b, 14=a

24
Numerical – M.A.S  Final 5

25
Numerical – M.A.S  Final 5

26
Numerical – M.A.S  Final 5

6=b, 14=c, 16=c, 25=b, 28=b, 29=c

27
Numerical – M.A.S  Final 5

4=a, 5=c, 7=d, 23=a, 31=a, 33=b, 40=c

26. The piecewise polynomial:

28
Numerical – M.A.S  Final 5

9=c, 10=c, 21=a, 26=a, 34=a, 36=b, 37=c

29