ACADEMY OF TECHNOLOGY

MCQ QUESTION BANK

Subject: Numerical Methods Subject Code: OEC-IT601A

Semester- 6th StreamCSE1/CSE2/CSE3

Subject Teachers: SK/NDS

GROUP-A
Each question carries one marks

1. The number of significant figures in 0.3409 is

(a) 5 (b) 6 (c) 7 (d) 4

2. The number 3.4506531 when round off to 4 places of decimal will be

(a) 3.4506, (b) 3.4507, (c) 3.451, (d) none.

3. The percentage error in approximating 4/3 to 1.3333 is (((true value)-approx value)/ true
value)/100%
(a) 0.0025%, (b) 25%, (c) 0.00025%, (d) 0.25%

4. In Newton’s forward interpolation, the interval should be

(a) equally spaced, (b) not equally spaced,
(c) may be equally spaced, (d) both (a) and (b)

5. In Newton’s backward interpolation, the interval should be

(a) equally spaced, (b) not equally spaced,
(c) may be equally spaced, (d) both (a) and (b)
x  x0
6. In Newton’s forward interpolation, the value of s  h lies between
(a) 1 and 2, (b) -1 and 1, (c) 0 and ∞, (d) 0 and 1

7. E 
(8) f (x) = f (x + h ) f (x)
and

E[ f (x )] = f (x + h) (a) E , (b) E 2 , (c)  , (d) 1

where h is the interval
of difference.
8. Which of the following is true?
f (x) = f (x + h ) f (x)
(a) E  1  , (b) E  1  , (c)   1 E , (d) E  1
f (x) = Ef (x ) f (x)
9. 2 (ax2  bx) is
f (x) = (E 1) f (x)

E1
(a) 2a , (b) a , (c) a  b , (d) a  b

10. Trapezoidal rule can be applied if the number of sub-intervals of the interval of
integration is

(a) odd, (b) even, (c) both, (a) none

11. Simpson’s one third rule is applicable only if the numbers of sub-intervals is
even-the statement is

(a) True, (b) False

12. Runge-Kutta method is used to solve

(a) an algebraic equation (b) a first order ODE (c) a first order PDE, (d) none of
this

13. Which of the following does not always guarantee the convergence

(a) Bisection method, (b) Regula-Falsi method,

(c) Newton-Raphson method, (d) none

14. Regular-Falsi method is

(a) Conditionally convergent, (b) Linearly convergent,

(c) Divergent, (d) None
 15. Which of the following is/are predictor-corrector method?

(a) Milne’s method (b) Adams Bash Forth Method,

(c) both (a) and (b) (d) Newton’s Formula

16. Milne’s corrector formula of order 4 is

h 4h
(a) yn1  yn1   f n1  4 fn  fn1  , (b) yn1  yn1   f n1  4 fn  fn1 
3 3
 h
(c) yn  y n1   f n1  4 fn  fn1 , (d) none
3
17. The finite difference method is used to solve

(a) a system of ordinary differential equations, (b) a B.V.P.

(c) a partial differential equations, (d) a system of transcendental equation

18. The Gauss elimination method is fails when any one of the following pivotal
elements is

(a) 0 (b) 1 (c) 2 (d) none

19. The inverse of a matrix A is given by

 A adjA
adjA
(a) A  (b) A 
1
1
, 1 , (c) A  , (d) None
A adjA A
20. In LU factorization method, a matrix A can be factorized into A = LU where L
is,
(a) upper triangular matrix, (b) lower triangular matrix,
(c) identity matrix, (d) diagonal matrix

21. One of the iterative methods by which we can find the solutions of simultaneous
equations is
 (a) Gauss-Seidel Method, (b) Gauss elimination method, (c) Crout’s
method (d) Gauss Jordan method

22. Error in the 4-th order Runge-Kutta method is of

(a) O(h3 ) , (b) O(h2 ) , (c) O(h4 ) , (d) O(h5 )

23. Lagrange’s interpolation formula deals with

(a) equispaced arguments only, (b) unequispaced arguments

only,

(c) both (a) and (b), (d) none.

24. Lagrange’s interpolation formula deals with

(a) equispaced arguments only, (b) unequispaced arguments

only,

(c) both (a) and (b), (d) none.

25. The degree of precision of Trapezoidal rule is

(a) 1, (b) 2, (c) 3, (d) 5.

26. The number of significant figures in 3.0056 is

(a) 5, (b) 6, (c) 7, (d) 4.

27. The number of significant figures in 3.0056 is

(a) 5, (b) 6, (c) 7, (d) 4.

28. The error which is inherent in a numerical method itself, is called

computational error a) true, b) False.

29. The value of 1 1  is

a) 0 b) 1 c) 2 d) 3.

30. If a is any constant, then  a=

a) 0 b) x 2  5x c) x3  x 2  5x d) 1

31. Round-off error is a form of computational error

a) truncation error b) numerical error c) Inherent error d) none of
these
 32. If a be the actual value and e be the its estimated value, the formula for
relative error is
b) a/e b) |a-e| /e c) (a-e)/e d) |a-e|
/a

32. The ratio of absolute error to the true value is called

a) relative error b) absolute error c) truncation error d) none of
these

33. What is the meaning of iteration in Numerical Methods?

a) successive approximations towards the exact value b)
repetition of the formula
c) desired accuracy d) none of
the above

34. Transcendental equation are combination of

a) algebraic functions only b) only trigonometric
function
c) combination of a and b d) none of above

35. The significant digit of 0.0001234 is

a) 4 b) 7 c) 8 d) none of
these

36. Round off the number 123456 to 4 significant digits is

a) 123500 b)123400 c) 1234 d) 1235

37. The relative error in approximating 4/3 to 1.3333 is

a) 0.000025 b) 0.25 c) 0.0000025 d) none of
these

38. The percentage error in approximating 4/3 to 1.3333 is

a) 0.0025% b) 25% c) 0.00025% d) 0.25%

39. If 5/3 is approximated to 1.6667, then absolute error is 0.000033333

a) 0.000033 b) 0.000043 c) 0.000034 d) none of
these

40. Bisection method is ---------- but ---------.

a) fast, fails b) fast, sometimes fails c) fast, never fails d)
slow, never fails

41. How do you decide the convergency in the process?

a) process is fast b)difference in successive
approximation is always reducing
c) process is continuous d) none of these

42. Which of the following does not guarantee the convergence?

a) Secant method b) Bisection method c)Regula-falsi

d)Newton-Raphson

43. Regula-falsi method used for finding the real root of a numerical
equation is
 a) analytical method b) iterative method c) graphical method
d) none of these

44. Example of the open end method for finding the real root of a
numerical equation is
a) bisection method b) false position method
c) secant method d) none of these

45. Newton-Raphson method is---------- than bisection method.

a) slow b) fast

46. The rate of convergence of bisection method is

a) linear b) quadratic c) cubic d)
none of these

47. If f(x) is continuous in the interval (a,b) and if f(a) and f(b) are of
opposite signs, then there is
a) at least one real root of f(x)=0 between a and b
b) at most one real root of f(x)=0 between a and b
c) there will be no real root of f(x)=0 between a and b
d) none of these

48. Which of the following is the disadvantage of regula –falsi method ?

a) it is very hard b) it is very complex c) it is very slow d)
none of these

49. Method of bisection is

a) conditionally convergence b) always convergent
c) non-convergent d) none of these

50. N-R method is --------but ----- --.

a) fast, fails b) fast, sometimes fails
c) fast, never fails d) slow, never fails

51. How many initial guesses are required for bisection method
a) one b) two c) three d) any

52. How many initial guesses are required for Newton-Raphson method
a) one b) two c) three d) any

53. In trapezoidal rule, no of strips each of width ‘h’ is

a) six b) any c) multiple of three d) even

54. In Simpson’s 1/3rd rule, no of

strips each of width ‘h’ isa)six b)any c) multiple of three d) even

55. Which of the following are equal interval method(s)?

1. Trapezoidal rule 2. Simpson’s 1/3 rule 3. Weddle’s rule
a) only 1 and 2 b)1,2,3 c) only 3 d) only 2,3

b
56. In evaluating ∫f(x)dx , the order of h in the error in trapezoidal rule is of
order

a) 1 b) 2
c) 3
 d) 4 where h
is the width of each sub- interval
of [a,b].

57. In trapezoidal rule, minimum no of points required for evaluation of

integration
a) four b) three c) two d) one

58. in Simpson’s 1/3 rule , minimum no of points required for evaluation of

integration
a) four b) three c) two d) one

59. The order of h in the truncation error in composite Simpson’s 1/3 rule is
of the order
a) 3 b) 4 c) 5 d) none of these

60. Write the degree and order of

the differential equation
(d3y/dx3)2 +xy(dy/dx)-y2 =0
a) two,three b) two,two c) three, two d) three , three

61. Gauss-elimination method does not fail even if one of the pivotal
element is equal to zero .
a) True b) False

62. The degree of

precision of
trapezoidal rule isa)
1 b) 2 c) 3 d) 4

63. Which of the following methods is an iterative method ?

a) gauss elimination method b) gauss –jordan method
c) gauss-jacobi method d) crout’s method

64. The order of h in error of 4th order Runge- kutta method is

a) 4 b) 5 c) 6 d) none of these
65. Which of the following relations is true?
a) E=1+∆ b) E=1-∆ c) E = 1/∆ d) none of these

66. Number of steps in Euler’s method is

a) one b) two c) three d) any

67. Number of steps in Runge –kutta

fourth order method is
a) one b) two c) any
d) none of these

68. In Euler’s method ,to get the exact value, no of steps are to be taken
a) one b) two c) many step to increase accuracy d) four

69. In Predictor Corrector method ,the behavior of the solution is

ignore and each step starts afresh. This sentence is
a) True b) False

70. Euler’s method is not very useful in practical problem because

a) difficult to use
 b) it requires a very small step length ‘h’ for a reasonable accuracy, so
time consuming
c) computer programming is difficult.
d) not getting accuracy

71. Although laborious , the Runge- Kutta method is widely used because
a) one step method & is particularly suitable for higher derivatives
b) computer programming is easy
c) is a very fast method
d) modification in the approximation can be done.

72. Predictor –Corrector method is used when

a) starting value is not known and rest of the calculation are to be done
b) starting value is known and rest of the interval is to be found in
successive steps.
c) starting value is not known and rest is to found next.
d) none of these

73. Forward & backward differences are useful only if the function is
tabulated at
a) equal intervals b) unequal intervals c) both d) none of these

74. Lagrange’s interpolation is useful if the function is tabulated at

a) equal intervals b) unequal intervals c) both d) none of these

75. Newton forward difference method is used when

a) value to be interpolated is unequally spaced
b) value to be interpolated is at the end of the difference table .
c) value to be interpolated is near the beginning of the difference table
d) cannot say.

76. Newton backward difference method is used when

a) value of the interpolated is near the end of the difference table
b) value to be interpolated is unequally spaced
c) value to be interpolated is at the beginning of the difference table
d) cannot say

77. Which method is used for solving system of linear algebraic equations
a) bisection method b) false position method
c) gauss elimination method d) secant method

78. Which method is base on elimination approach

a) matrix inversion method b) gauss jacobi method
c) gauss –seidel method d) none of these

79. Gauss elimination method does not fail even if one of the pivotal
elements is equal to zero .
This is
a) True b) False

80. To solve a system of m equation in m unknowns, the total numbers

of multiplications anddivision involved in solving the system by
gauss elimination method is of the order m3/3 approximately.
 a) True b) False

81. Which of the following is not a computational error?

a) Truncation error b) Round-off error
c) Inherent error d) None of these

82. Newton-Raphson method fails when

a) f ‘(x)=1 b) f ‘(x)=0 c) f ‘(x)= -1 d) f ‘’(x)=0

83. Finite difference method is used to solve

a) a system of linear simultaneous equations
b) a system of non-linear simultaneous equations
c) partial differential equations
d) non-linear equations

84. Divided difference interpolation formula can be used for

a) the tabular values with independent variable unequally spaced
b) inverse interpolation
c) both a) & b)
d) none of these

85. Trapezoidal method can be used to integrate numerically a

function represented intabular form
a) with odd number of intervals only
b) with even number of intervals only
c) both a) & b)
d) none of these

86. Modified Euler’s method has a truncation error of the order of

a) h b) h2 c) h4 d) h3

87. Regula falsi method has a convergence rate of the order of

a) 2 b) 1.6 c) 1 d) none of these

88. The order of h in the error expression of trapezoidal rule is

a) 1 b) 2 c) 3 d) 4

89. If y0=2, y1=4, y2=8, y4=32 then y3 is equal to

a) 5 b) 15 c) 6 d) 16.5

90. For dy/dx=xy and y(0)=2, the value of k2 according to

Runge-Kutta method of 2ndorder is(h=0.2)
a) 0.1 b) 0.01 c) 0.4 d) 0.04