1. If f(x) is a polynomial of degree n then which order difference of f(x) is constant?

Ans: the Nth divided difference of f(x) is a constant.

2. Round off the numbers 0.00243468, 0.10046, 1.0034 up to 4 decimal figure?

Ans: 0.002435, 0.1005, 1.003

3. Round off the numbers 0.00243468, 0.10046, 1.0034 up to 4 significant figure?

Ans:

4. The no. of significant digit in 0.00243468, 0.10046, 1.0034

Ans:

5. If 5/6 is represented by approximate numbers 0.8333 then percentage error is?

Ans: 0.005%

6. If y=4 cos (x) – 6x then the percentage error in y is (given for x=0 if the error in x is 0.005)
Ans:

7. Let f ( x)  x 2  2 x  1  and the derivative of f(x) at x=1 is approximated by using the

f  1 h  f  1 h 1
f   1  ; with h    
central difference formula 2h 2 then the absolute value
f   1
of error in the approximation of =
Ans:

8. If f(x)is a polynomial of degree 3 and f(0)= -1, f(1)=5, f(2)=13, f(3)=36, f(4)=69 where
f(2) is not correct. find the error in f(2) and hence find the correct value of f(2)
Ans:

9. Classification of errors
Ans: Errors are normally classified in three categories: systematic errors, random errors, and
blunders.
10. What is inherent error, truncation error, rounding off error?
Ans: Inherent Error: Errors that are present in the data that are input to the model are inherent
errors. They are also called input errors.
Truncation Error: Truncation errors occur when an exact mathematical procedure is
approximated. When a numerical process is truncated after a finite number of iterations for
computational simplicity, truncation error arises.
Round off Error: Round off errors occur because computers have limited capacity to store
exact numbers. These errors can have cumulative effect in a numerical process.

11. Find the relative error in computation of x+y for x=11.75, y=7.23 having absolute errors
of x and y are 0.002 and 0.005 respectively.
Ans: 0.00037

12. Find the relative error in computation of x-y for x=9.05, y=6.56 having absolute errors of
x and y are 0.001 and 0.003 respectively.
Ans: 0.00034

13. In interpolation the value of n lies

Ans:

x  x0
u
14. In Newtons forward and backward interpolation formula the value of h lies
between
0<u<1; -1<u<0
Ans:

15. Newtons forward interpolation formula is used when

Ans: Newton’s forward interpolation technique is to be used when the x – data point is near
the beginning.

16. Newtons backward interpolation formula is used when

Ans: Newton’s backward difference technique is to be used when the x - data points is
near the finish.

17. A real root of any equation f(x)=0 can be computed by _____ interpolation
Ans:

18. Consider the interpolation data given below:

X 1 ½ 3
Y 3 -10 2
The interpolating polynomial corresponding to this data is given by

 1 2  1
p  x   3  x    x  3  8  x  1  x  3   x  1  x  
 2 5  2
Ans:

19. Consider the interpolation data given below:

X -1 0 1 2
Y 1 1 1 -3
The interpolating polynomial corresponding to this data is given by
Ans:

20. The second order divided difference of f(x)= 1/x based on points x0 , x1, x2 is
Ans:

21. The second order divided difference of f(x)= 1/x2 based on points a,b,c is
Ans:

22. Find missing term in the following tables

X 0 1 2 3 4
F(x) 1 3 9 ---- 81
Ans: 31

23. Lagrange’s interpolation is used for

Ans: The Lagrange interpolation formula is a way to find a polynomial which takes on
certain values at arbitrary points.
Lagrange’s interpolation formula can be used whether the values of x, the independent
variable are equally spaced or not whether the difference of y become smaller or not.
24. Newton’s divided difference interpolation is used for
Ans: Newton's divided difference interpolation formula is an interpolation technique used
when the interval difference is not same for all sequence of values.

25. Relation between shifting operator and forward difference operator

Ans:

26. Relation between shifting operator and backward difference operator

Ans:

27. Relation between shifting operator and central difference operator

Ans:

28. Relation between shifting operator and average operator

Ans:

2 3
x
29. Find  (1/ ( x  5)) ,  log f ( x) ,  (1/ ( x  5)) ,    , E
2 2

Ans:

30. Polynomial Interpolation is based on the ______theorem

Ans: Lagrange
Polynomial interpolation is the interpolation of a given data set by the polynomial of lowest
possible degree that passes through the points of the dataset.

31. Consider the interpolation data given below:

X 0 1 2 3
F(X) 1 2 11 34

Find f (1),  2 f (2),  3 f (1),  2 f (0),  2 f (3), f (1)

Ans:
32. Consider the interpolation data given below:
X 0 1 5 7
Y 1 2 146 386
Find f(1,5),f(1,5,7),f(0,1,5,7)
Ans:

33. Find the polynomial from the following set of datas:

x -1 0 1 2

f(x) 1 1 1 -3

Ans:

34. The degree of precision of trapezoidal, Simpson’s 1/3, Weddle’s rule are respectively
Ans: 1, 3, 6

35. Weddle’s rule gives exact result for a polynomial of degree

Ans: 6

36. Order of h in the error expression of Simpson’s 1/3 rule

Ans: O(h4)

37. Order of h in the error expression of Trapezoidal’s rule

Ans: O(h2)

38. Order of h in the error expression of Weddle’s rule

Ans: O(h8)

39. For what values of a and b , the quadrature formula 

f ( x )dx af (1)  f (b)
1 is exact for
all polynomial of degree  1 .
[put f(x)=1 and f(x)=x then you get the ans.]
Ans:

dx
1

40. Evaluate 0 1  x using trapezoidal rule with n=5
2

Ans:

41. Simpson’s 1/3 rule gives exact result for a polynomial of degree
Ans: 2

42. Trapezoidal rule gives exact result for a polynomial of degree

Ans: 1

43. Which method is the self-corrected method

Ans: Iteration

44. Which method is the tangent method

Ans: Newton-Raphson method

45. Which method is the chord method

Ans: Geometrically this method is equivalent to exchanging the curve у = F ( x ) with a
chord, lead at first through the points and then with chords, lead through the ends of received
segments

46. The rate of convergence of Secant method is

Ans: 1.62

47. Newton-Raphson method fails to give a real root of f(x)=0 when

Ans: the tangent line at x = 0 never intersects the x axis.

48. Which one of the following alternative representation of the equation

f ( x)  x 3  x 2  1  0, is suitable for finding its root in the interval [0,1], by linear iteration
method?
 1 1
x x x
1
1 x
a. x b. x2 c. x  1 [Link] of these

x    x  holds if    x   1, x  [a, b]
1 1 1
in t his question   x    x or 2  1 or
[we know that for iteration method x x x  1 check
it for [0,1]]
Ans:

49. The rate of convergence of Bisection method, Iteration method, Newton-Raphson and
Regula Falsi method are respectively
Ans: Linear, Linear, Linear, Linear

50. The bisection method is surely convergent/ conditionally convergent method.

Ans:

51. Root of the equation 3x-cosx-1=0 lies between

Ans: 0.6071

52. e  3x  0 is a ____________equation.
x

Ans:

53. The condition of convergence for Iteration method is

Ans: A sufficient condition for convergence is that the spectral radius of the derivative is
strictly bounded by one in a neighborhood of the fixed point.

54. The condition of convergence for Newton Raphson method is

Ans: Since the iteration for f(x)=0 is x = x - f(x)/f’(x), if the derivative does not get close to
zero. The iteration will usually converge.

55. Write down advantage of Bisection, Fixed point iteration and Newton Raphson method
Ans: The bisection method is always convergent. Since the method brackets the root, the
method is guaranteed to converge.
Advantages of Newton-Raphson Method o One of the fastest convergences to the
root. o Converges on the root quadratic.

56. Write down disadvantage of Bisection, Fixed point iteration and Newton Raphson method
Ans: Slow Rate of Convergence

3
57. For evaluating 2 using Newton Raphson method, the iterative procedure
is_____________
Ans:

58. The first approximation of a root of x3+3x-1=0 by Newton-Raphson method taking x0 = 0

is
Ans:

xn  a 
xn 1  1  2 
2  xn 
59. The iterative scheme converges to √a . then the rate of
convergence is___________
Ans:

60. Let f:[0,2]

→ 60.
R be a twice continuously differentiable function. If 0
f ( x)dx 2 f (1)
then the error in approximation is___________
Ans:

R be a twice continuously differentiable function. If 

→ f ( x) dx 4 f (3)
61. Let f:[0,2] 2 then
the degree of precision of the quadrature formula is___________
Ans:

1
 f (a )  f (b)
1

62. Consider the formula 1

 x f ( x )dx 
2 where a,b are quadrature points.
Then the highest degree polynomials for which, the above formula is exact, equals
to________
Ans: 3
 1

63. For what values of a, b and c, the quadrature formula 

f ( x)dx af (0)  bf (c)
1 is exact
for polynomials of degree as high as possible?
Ans:

64. The equation e  4 x  0 has a root between 4 and 5. Fixed point iteration with iteration
x 2

1 2x
e
2

a diverges b converges c oscillates d converge monotonically

Ans:

xn  xn2 
xn 1   3  
2 a  a . then the rate of convergence
65. The iterative scheme converges to
is___________
Ans:
Ans:

xn  3a xn2 
xn 1   6  2  
8 xn a 
66. The iterative scheme converges to √a . then the
rate of convergence is___________
Ans:

1 dx
67. Evaluate
 1 x
0
using Simpson 1/3 rule
Ans:

68. The equation x3-5x2+4x-3=0 has one root near x=4 which is to be computed by the
following iterative scheme

3  ( k  4) xn  5 xn2  xn3
xn 1 
k with x0 = 4 and k is integer. The value of k that gives
fastest convergence is____________
Ans:
 xn 1  g  xn 
69. Suppose x0 is sufficiently close to 3. Which one of the following iteration
will converges to the fixed point x=3?

 3 3 xn 2  2
xn 1   16  6 xn   xn 1  x 
 xn  xn 1  3  2 xn xn  2 d n 1 2
a b c
Ans:

1 a 
xk 1   xk  n 1 
2 xk 
70. An iteration to find the nth root of a positive number a is given by
.A value of n for which the iterative method fails to converge is___________
Ans:

1 3  1  1 1
 f ( x )dx  f    af    f  1
71. For what values of a, the quadrature formula
1 2  3  3 2 is
exact for polynomials of degree as high as possible?
Ans:

72. The second approximation of a root of x3-9x+1=0 by Bisection method taking x0 = 3

is_______
Ans: 2.6875

73. The second approximation of a root of x3+x-1=0 by iterative method taking x0 = 0.6
is_______
Ans:

74. The first approximation of a root of x3-8x-4=0 by Regula-Falsi method taking x0 = 3

is______
Ans:

75. Diagonal dominance is must for

Ans: Gaussian elimination

76. For a system of linear equation AX=B if A  0, B  0;

Ans: Non-homogeneous system (Not sure)

77. The condition of partial pivoting process to solve system of linear equations by Gauss
elimination method is
Ans:

78. The convergence of Gauss-Seidal method is

Ans: The Gauss-Seidel method converges if the number of roots inside the unit circle is equal
to the order of the iteration matrix.

 1 4 3   l11 0 0  1 u12 u13 

    
 2 7 9    l21 l22 0  0 1 u23 
5 8 a l 50  1 
79. If    31 l32  0 0 then value of a=
Ans:

 2 
1 u12
 3 4 2   l11 0 0  3 
    
 5 2 1    l21 l22 0 0 1 u23 
2 3 a l l32   0 0 1 
   31 l32  
80. If   then value of a=

Ans:

81. Which of the following method is not direct method?

a) factorization method
b) Gauss elimination method
c) Matrix inversion method
d) Gauss-Seidal method
Ans: d) Gauss-Seidal method

82. The truncation error in 4th order Runge-Kutta method is of the

Ans: O(h4)

83. The truncation error in 2nd order Runge-Kutta method is of the

Ans: O(h3)

84. The predictor-corrector method is

Ans: predictor–corrector methods belong to a class of algorithms designed to integrate
ordinary differential equations – to find an unknown function that satisfies a given
differential equation.

85. Solution is obtained as a power series of x in Picard’s method

Ans: iterative method


86. A Runge-Kutta method for numerically solving the IVP y  f ( x, y ); y ( x0 )  y0 is given
by (for h small)
y ( x  h)  y ( x)  w1F1 ( x , y )  w2 F2 ( x, y )
F1 ( x, y )  hf ( x, y ); F2 ( x, y )  hf ( x  ah, y  bF1 )

The objective is to determine the constants w1 , w2 , a and b such that the above formula is
accurate to order 2 (i.e. the error is O(h3)). Which of the following is not correct set of
values for these constants?
w1  1/ 2, w2  1/ 2, a  1, b  1
1) a
w1  2, w2  1, a  1/ 2, b  1/ 2
2) b
w1  1/ 3, w2  2 / 3, a  3 / 4, b  3 / 4
3) c

[check if w1  w2  1, aw2  1/ 2 holds then this is correct set values otherwise not]
Ans:

dy
 1  y, y (0)  0, h  0.1
87. Find y(0.2) by Euler’s method from the differential equation dx
Ans:

dy x  y
 , y (0)  2, h  0.5
88. Find y(1) by Euler’s method from the differential equation dx 2

Ans:

89. Example of single step method

Ans: Euler’s method
90. Example of Multi-step method
Ans: Runge-Kutta method