Multiple Choice Questions (MCQs) on

Numerical Methods
 Bisection Method
Solution of Algebraic &
 Newton-Raphson’s Method
Transcendental Equation  Regula-Falsi Method

 Gauss elimination Method

Solution of System of  Gauss-Jordan Method
Linear Equations  Gauss-Seidel Method
 Gauss-Jacobi Method
 Crout’s Method

𝑴𝒂𝒕𝒉𝒆𝒎𝒂𝒕𝒊𝒄𝒔 − 𝑮𝒂𝒏𝒊𝒕 𝑺𝒂𝒏𝒈𝒓𝒂𝒉 | 𝑺𝒂𝒕𝒊𝒔𝒉 𝑻𝒊𝒘𝒂𝒓𝒊

Examples-1 to 50
 MCQs on Numerical Methods
Numerical Methods-I
1. The equation x 4  log10 x  cos x  0 is known as

(a)Algebraic equation (b)Transcendental equation

(c)Polynomial (d)None of these
Ans: (b)

2. Which of the following equation can be solved by Regula-Falsi method


sin t
(a) 3x  cos x  1  0 (b)  dt
0
t
dy 1
(c) 2 x  3 y  20z  25, 20 x  y  2 z  17, 3x  20 y  z  18 (d)  (1  x 2 ) y 2 , y(0)  1
dx 2
Ans: (a)

Mathematics-Ganit Sangrah | Satish Tiwari

 MCQs on Numerical Methods
3. Which of the following method is not used to solve algebraic and transcendental equations?
(a)Newton-Raphson method (b) False position method
(c)Relaxation Method (d)Method of successive approximation
Ans: (c)
4. 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
Ans: (a)
5. Newton – Raphson formula of successive approximation to find the approximate
value of a root of the equation f ( x)  0 is
f ( xn ) f ( xn )
(a) Xn+1 = xn  (b) Xn+1 = xn 
f ( xn ) f ( xn )
f ( xn ) f ( xn )
(c) Xn+1 = xn  (d) Xn+1 = xn 
f ( xn ) f ( xn )
Ans: (b)
Mathematics-Ganit Sangrah | Satish Tiwari
 MCQs on Numerical Methods

6. The false position formula to find root of equation f(x)= 0 is

𝑎𝑓 𝑎 −𝑏𝑓 𝑏 𝑏𝑓 𝑏 −𝑎𝑓 𝑎 𝑎𝑓 𝑏 −𝑏𝑓 𝑎
𝑎 𝑥1 = (b) 𝑥1 = (c) 𝑥1 = 𝑑 𝑁𝑜𝑛𝑒 𝑜𝑓 𝑡ℎ𝑒𝑠𝑒
𝑓 𝑎 +𝑓 𝑎𝑏 𝑓 𝑏 −𝑓 𝑎 𝑓 𝑏 −𝑓 𝑎

Ans: (c)

7. If the root of the equation x log10 x  1.2  0 lying between 2.7 and 2.8 then
first approximation to root using Regula falsi Method is given by
(a) 2.7202 (b)2.7406 (c) 2.7605 (d)2.7806
Ans: (b)

8. Order of Convergence of Newton-Raphson Method and Regula-Falsi method

are respectively,
(a) 2,2 (b)2, 1.168 (c) 2, 1.6 (d) 1.4, 1.8
Ans: (b)

Mathematics-Ganit Sangrah | Satish Tiwari

 MCQs on Numerical Methods
9. If one root of equation f(x)=0 is near to x0 , then the first approximate of
this root as calculated by Newton – Raphson method is the abscissa of the point ,
where the following straight line intersect the x-axis
(a)normal to the curve y = f(x) at the point (x0 , y = f(x0))

(b)tangent to the curve y = f(x) at the point (x0 , y = f(x0))

1
(c) The straight line through the point (x0 , y = f(x0)) having the gradient
f ( x0 )
(d) Passing through the point (x , f(x0))
Ans: (b)
10. Condition for convergence of the Newton – Raphson method to a root  is
1 f ( ) f ( )
(a) 1 (b) 1
2 f ( ) f ( )
f ( )
(c) 1 (d) None of these
f ( )
Ans: (c)
Mathematics-Ganit Sangrah | Satish Tiwari
 MCQs on Numerical Methods

11. After first iteration of Newton – Raphson method the positive root of
equation x2=3 is (taking Initial approximation 3/2)
(a) 7/4 (b) 97/56 (c) 3/2 (d) 347/200
Ans: (a)

12. Newton – Raphson method converges fast , if f ' ( ) is (  is the exact value of root)
(a) small (b) large (c) zero (d) None of these
Ans: (b)

13. The Newton-Raphson method is used to find the root of equation x  2  0 .

2

If the iteration are started from -1 , the iteration will

(a) converge to -1 (b) converge to 2 (c) converge to  2 (d) Not converge
Ans: (c)

Mathematics-Ganit Sangrah | Satish Tiwari

 MCQs on Numerical Methods

3
14. Newton-Raphson iteration formula for finding C , where C>0 is
2 xn3  3 C 3xn3  3 C 2 xn3  3 2 xn3  c
(a) xn-1 = (b) xn-1 = (c) xn-1 = 2
(d) xn-1 = 2
2 xn2 3xn2 3xn 3xn
Ans: (c)

15. Given the equation x  x  10  0 by Newton-Raphson method.

4

(a) The root of the given equation lies between 1 and 2

(b) The root of the given equation lies between -1 and -2
(c) The root of equation lies between 0 and 1
(d) No root exist
Ans: (a)

Mathematics-Ganit Sangrah | Satish Tiwari

 MCQs on Numerical Methods
16. The first approximation to solution for following system of equations
2 x  3 y  20z  25,20 x  y  2 z  17, 3x  20 y  z  18
using Gauss-Seidal Method with the initial approximation x0  0, y0  0, z0  0 is
(a) x1  1.0025, y1  0.9998, z1  0.9998
(b) x1  1, y1  1, z1  1 Ans: (c)
(c) x1  0.85, y1  1.0275, z1  1.0109
(d) None of the above
17. Which is correct Lower triangular matrix for
3x  2 y  7 z  4, 2 x  3 y  z  5, 3x  4 y  z  7 using Crout’s Method.
 2 7   2 7     2 7
1 3 3  1  3 3  3 0 0   1
3 3
 11  11    11
(a) 0 1   (b) 0 1   (c) 2
5
0  (d) 0 1  Ans: (c)
 5  5  3   5
0 0 1  0 0 1  3 2  8  0 0 1
     5   

Mathematics-Ganit Sangrah | Satish Tiwari

 MCQs on Numerical Methods
18. Gauss-Seidal iterative method is used to solve
(a)differential equation (b)System of non-linear equation
(c)System of linear equation (d)Partial differential equations
Ans: (c)

19. Guass-Seidal methods gives result faster when the pivotal element are
(a)Smaller than other coefficient (b)Larger than other coefficient
(c)Equal to other coefficient (d)None of the above
Ans: (b)

20. In the Regula-Falsi method while finding the real root of an equation, the curve AB is replaced by
(a)Tangent AB (b)Straight Line AB
(c)Chord AB (d)All of the above
Ans: (c)

Mathematics-Ganit Sangrah | Satish Tiwari

 MCQs on Numerical Methods

21. Newton’s Iterative formula to find the value of N is

1 N 1 N 1 2 N  1 2 N 
(a)  xn   (b)  xn   (c)  xn   (d)  xn  
2 xn  2 xn  2 xn  2 xn 
Ans: (b)
22. In solving simultaneous equations by Gauss-Jordan method, the coefficient matrix is reduced to
(a)Lower triangular matrix (b)Upper triangular matrix
(c)Diagonal matrix (d)Symmetric Matix
Ans: (c)
23. If f (a) is negative and f (b) is positive then first approximation to the root for an equation
f ( x)  0 using bisection method is given

(a) x1  a  b  (b) x1  a  b 
1 1
2 2
(c) x1   f (a)  f (b)  (d) x1   f (a)  f (b) 
1 1
2 2
Ans: (b) Mathematics-Ganit Sangrah | Satish Tiwari
 MCQs on Numerical Methods
24. As soon as a new value of a variable is found by iteration, it is used immediately in the following
equations, this method is called
(a)Gauss-Jordan method (b)Gauss-Seidal Method
(c)Gauss elimination method (d)Jacobi’s Method
Ans: (b)
25. Out of Regula-falsi method, Newton-Raphson method and Bisection method, the rate of
convergence is faster for
(a) Regula-falsi method (b) Newton-Raphson method
(c) Bisection method (d)All of the above
Ans: (b)
26. The convergence in the Gauss-Seidal method is thrice as fast as in the Jacobi’s Method
(a) True (b) False
(c)Can’t say anything (d) Both methods having same convergence rate
Ans: (a)
Mathematics-Ganit Sangrah | Satish Tiwari
 MCQs on Numerical Methods
27. Regula Falsi method requires _______ initial approximation to the root
(a) 1 (b) 2 (c)3 (d) 4
Ans: (b)
1
28. An approximate root of the equation sin x  at second stage that lies between
x
x  1 and x  1.5 is
(a) 1.25 (b) 1.125 (c)1.0625 (d) 1.255
Ans: (b)
1
29. Newton’s Iterative formula to find the value of is
N
(a) xn 1  xn (1  Nxn ) (b) xn 1  xn (1  Nxn )
(c) xn 1  xn (2  Nxn ) (d) xn 1  xn (2  Nxn )
Ans: (d)
Mathematics-Ganit Sangrah | Satish Tiwari
 MCQs on Numerical Methods
30. Newton’s Method has second order of quadratic convergence because
(Here  n and  n 1 are two consecutive error in finding the approximate root by Newton’s
Method)
(a)  n 1 ( n ) (b)  n 1 ( n )
2


(c) n 1  ( n ) 2
(d)  n 1  ( n )
Ans: (a)
31. Find by Newton-Raphson method the first approximate root of the equation x  6 x  4  0
3

nearer to 0.7
(a) 0.7321 (b) 0.71 (c) 0.7316 (d) 0.7222
Ans: (a)
32. Find by Newton-Raphson method the first approximate root of the equation 3x  cos x  1  0
with initial approximation 0.6
(a) 0.62 (b) 0.6071 (c) 0.7210 (d) 0.6062
Ans: (b)
Mathematics-Ganit Sangrah | Satish Tiwari
 MCQs on Numerical Methods
33. Find using Regula Falsi method the first approximate root of the equation xe  cos x
x

,if the root lies between 0 and 1.

Ans: (d)
(a) 0.2222 (b) 0.4241 (c) 0.5154 (d) 0.3147

34. Find the values of x,y,z in the following system of equations by Gauss elimination method
1  1 2  x   1
0 1 1   y    3 
     
0 0 6  z   6  Ans: (c)

(a) x  3, y  1, z  2 (b) x  3, y  1, z  1
(c) x  1, y  2, z  1 (d) x  1, y  3, z  6

35. In Gauss elimination method, upper triangular matrix of coefficient matrix can be found by
(a) Column transformation (b) Row transformation
Ans: (b)
(c) Both (a) & (b) (d) None of these
Mathematics-Ganit Sangrah | Satish Tiwari
 MCQs on Numerical Methods
36. If f(a) and f(b) have opposite signs, then
(a) f(x)=0 has no root lying between a and b
(b) f(x)=0 has many roots lying between a and b
(c) f(x)=0 has atleast one root lying between a and b Ans: (c)
(d) f(x)=0 has exactly one root lying between a and b

37. Which of the following step is not involved in the Gauss Elimination Method?
(a) Elimination of unknowns
(b) Reduction to an upper triangular system
(c) Finding unknowns by back substitution Ans: (d)
(d) Evaluation of cofactors

38. The root/roots of the equation e x  4 x  0 lying between

(I) 0 & 1 (II) 2 & 3
(a) Only (I) is correct (b) Only (II) is correct Ans: (c)
(c) both (I) & (II) are correct (d) None of them are correct

Mathematics-Ganit Sangrah | Satish Tiwari

 MCQs on Numerical Methods
39. Which of the following methods is used for obtaining the inverse of matrix?
(a) Gauss Seidel method (b) Newton-Raphson method
(c) Gauss-Jordan method (d) Secant Method
Ans: (c)

40. What is the main difference between Jacobi’s method and Gauss-Seidel method?
(a) Computations in Jacobi’s method can be done in parallel but not in Gauss-Seidel method.
(b) Convergence in Jacobi’s method is faster as compared to Gauss-Seidel method.
(c) Gauss-Seidel cannot solve the system of linear equations in three variables whereas Jacobi can
(d) Deviation from the correct answer is more in Gauss-Seidel method.
Ans: (a)
41. While solving by Gauss-Seidel method, which of the following is the first Iterative solution system;
x-2y=1 and x+4y=4?
(a) (1,0.75) (b) (0.25,1) (c) (0,0) (d) (1,1)
Ans: (a)

Mathematics-Ganit Sangrah | Satish Tiwari

 MCQs on Numerical Methods

42. The coefficient matrix can be expressed by Crout’s method as

1 u12 u13  l11 0 0  1 u12 u13   1 0 0

(a) A UL  0 1 u 23
 l l 0  
(b) A UL  0 1 u 23
 l 1 0 
   21 22     21 
0 0 1  l31 l32 l33  0 0 1  l31 l32 1
l11 0 0  1 u12 u13   1 0 0 1 u12 u13 
  0 1 u   
(c) A  LU  l21 l22 0  (d) A  LU  l21 1 0 0 1 u23 
 23   
l31 l32 l33  0 0 1  l31 l32 1 0 0 1 

Ans: (c)

Mathematics-Ganit Sangrah | Satish Tiwari

 MCQs on Numerical Methods
3 2 7 l11 l11u12 l11u13 
2 3 1  l l21u12  l22 l21u13  l22u23  
43. We have,    21
3 4 1 l31 l31u12  l32 l31u13  l32u23  l33 
What is the value of l22 ?
5 8 1
(a) (b) 2 (c)  (d) 
3 5 2
Ans: (a)
1 2 3  l11 0 0  1 u12 u13 
2 7 15    0 1
44. We have,  l
  21 22 l 0  u23 
 
3 5 41 l31 l32 l33  0 0 1 
What are the value of l11, l21, l31 ?
(a) 1,7,14 (b) 1,2,3 (c) 2,7,15 (d) 3,15,41
Ans: (b)
Mathematics-Ganit Sangrah | Satish Tiwari
 MCQs on Numerical Methods
1 2 3  l11 0 0  1 u12 u13 
    0 1
45. We have, 2 7 15  l21 l22 0
  u23 
 
3 5 41 l31 l32 l33  0 0 1 
What are the value of u12 , u13 , u23 ?
(a) 1,2,3 (b) 3,2,3 (c) 2,3,3 (d) 5,2,3

Ans: (c)

Mathematics-Ganit Sangrah | Satish Tiwari

 MCQs on Numerical Methods

46. If X is true value and X’ is its approximate value then Absolute Error , Relative Error and
Percentage Error is given by,
X  X X  X
(a) E A | X  X  | , ER  , EP  100
X X
X X X X
(b) E A | X   X | , ER  , EP  100
X X
X  X X  X
(c) E A | X  X  | , ER  , EP  100
X X
X X X X
(d ) E A | X   X | , ER  , EP  100
X X
Ans: (a)

Mathematics-Ganit Sangrah | Satish Tiwari

 MCQs on Numerical Methods

47. Find relative maximum error in the function

2
5 xy
u  3 at x  y  z  1 with x  y  z  0.001.
z
(a) 5 (b) 0.3 (c) 0.006 (d) 0.001
Ans: (c)

48. Relative maximum error for the function u( x, y, z ) is given by

(u ) min (u ) max
(a) ( ER ) max  (b) ( ER ) max 
u u
u (u ) max
(c) ( E R ) max  (d) ( ER ) max 
(u ) max u
Ans: (d)

Mathematics-Ganit Sangrah | Satish Tiwari

 MCQs on Numerical Methods
49. Truncation error arises due to
(a) approximate given data , limitations of computing aids
(b) rounding off the numbers while process of computations.
(c) use of approximate formula in computation or by truncating the infinite series to some approximate
terms.
(d) all of these are correct
Ans: (c)

50. At which point iterations in the Newton – Raphson method are stop
𝐴 When the consecutive iteratives value of x are not equal
𝐵 When the consecutive iteratives value of x differ by 2 decimal places
𝐶 When the consecutive iterative value of x differ by 3 decimal places
𝐷 When the consecutive iteratives value of x are equal
Ans: (d)

Mathematics-Ganit Sangrah | Satish Tiwari

 Like and Share the video
SUBSCRIBE THE CHANNEL
𝑴𝒂𝒕𝒉𝒆𝒎𝒂𝒕𝒊𝒄𝒔 − 𝑮𝒂𝒏𝒊𝒕 𝑺𝒂𝒏𝒈𝒓𝒂𝒉 | 𝑺𝒂𝒕𝒊𝒔𝒉 𝑻𝒊𝒘𝒂𝒓𝒊

Thank you