Numerical Methods and Computer Programming

Name:. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Roll No:. . . . . . . . . . . . Shift:. . . . . .

Total Marks:30 Duration: 30min
Set-B MCQ Examination

Instructions to students:
This exam contains 2 pages and 25 problems.
MCQ from 1-20 are for 1 marks and 21-25 for 2 marks
Dark appropriate circle in OMR sheet.

[1] The equation f (x) = 0 is a continuous function between x0 and x1 . If the bisection method is to be used, then
......
(A) f (x0 ).f (x1 ) < 0 (B) f (x0 ).f (x1 ) > 0 (C) f (x0 ).f (x1 ) = 0 (D) f (x0 ).f (x1 ) 6= 0

[2] In the bisection method, the minimum number of iterations required are . . . . . ., if x0 and x1 are initial approxi-
mations with required accuracy as ε.
|x −x0 | |x −x0 | |x −x0 |
loge 1 ε loge 1 ε loge 1 ε
(A) n ≥ loge 2
(B) n ≤ loge 2
(C) n = loge 2
(D) None of these

[3] Which interval is suitable to find the real root of f (x) = x3 − 29 = 0 in the bisection method?
(A) [1, 2] (B) [2, 3] (C) [3, 4] (D) [4, 5]

[4] For finding the root of sin(x) = 0, the following choice of initial guesses would be appropriate if bisection method
is to be used
(A) [ π4 , π3 ] (B) [ π4 , π2 ] (C) [ −π , π]
2 2
(D) [ π6 , π3 ]

[5] In the secant method of finding roots of equations, initial interval will be [x0 , x1 ], if . . . . . .
(A) f (x0 ) = f (x1 ) (B) f (x0 ) 6= f (x1 ) (C) both A and B (D) none of the above

[6] The next iterative value of the root of x2 − 4 = 0 using secant method is . . . . . ., if the initial guesses are 3 and 4,
is
(A) 2.2857 (B) 2.5 (C) 3.5 (D) 5.2857

[7] In the secant method of finding roots of equations, initial interval will be [x0 , x1 ], if . . . . . .
(A) f (x0 ).f (x1 ) > 0 (B) f (x0 ).f (x1 ) < 0 (C) both A and B (D) none of the above

[8] Find x5 using Secant method if x3 = 1.482 and x2 = 1.513, for the equation x3 − 3x + 1 = 0
(A) 1.407 (B) 1.704 (C) 1.525 (D) 1.843

[9] In regula falsi method, if f (x0 ) is negative and f (x1 ) is positive and next approximation x2 produces f (x2 ) is
negative, then . . . . . . is replaced by x2
(A) x1 (B) x0 (C) x2 (D) None of these

[10] Regula Falsi means

(A) Method of Correct position (B) Method of false position (C) Method of unknown position (D) Method
of known position

[11] In regula falsi method, if f (x0 ) is negative and f (x1 ) is positive and next approximation x2 produces f (x2 ) is
positive, then . . . . . . is replaced by x2
(A) x1 (B) x0 (C) x2 (D) None of these

[12] In method of false position to find root of an equation, generalize formula is . . . . . .

xn −xn+1 xn f (xn+1 )−xn+1 f (xn ) xn f (xn+1 )+xn+1 f (xn )
(A) xn+2 = f (xn+1 )−f (xn )
(B) xn+2 = f (xn+1 )−f (xn )
(C) xn+2 = f (xn+1 )+f (xn )
(D) xn+2 =
xn −xn+1
f (xn+1 )−f (xn )

[13] Which method is fast converging method?

(A) Bisection (B) Secant (C) Regula-falsi (D) Newton-Raphson

[14] Which statement is correct?

(A) NR method can be used if f 0 (x0 ) = 0 (B) NR method is suitable if roots are very near to each other.
(C) NR method surely converges if f (x0 )f (x0 ) > 0 (D) Formula of NR method is xn+1 = xn + ff0(x
00 n)
(xn )

[15] Which method is not suitable for transcendental equations?

(A) Bisection method (B) Newton Raphson method (C) Chebyshev method (D) Birge-Vieta method
Set-B MCQ Examination - Page 2 of 2

[16] To solve x2 − 29 = 0 and initial guess of x0 = 4 using Chebyshev method for one iteration we need to find out
(A) f 0 (x) at x0 = 4 (B) f 00 (x) at x0 = 4 (C) Both A and B (D) None of the above

[17] In NR method of two variable Jacobian matrix is given by . . . . . .

 ∂u ∂u   ∂u ∂v   ∂v ∂u   ∂u ∂u 
(A) J = ∂x∂v
∂y
∂v (B) J = ∂u ∂x ∂y
∂v (C) J = ∂u ∂x ∂y
∂v (D) J = ∂y
∂v
∂x
∂v
∂x ∂y ∂x ∂y ∂x ∂y ∂x ∂y

[18] In curve fitting by method of least square, first order curve fitting equation are as follows except
n n n n n n n
(A) a x2i + b xi = yi (C) a x2i + b =
P P P P P P P
xi yi (B) a xi + nb = yi (D) None of these
i=1 i=1 i=1 i=1 i=1 i=1 i=1

[19] The curve obtained by the method of least square is known as the curve of . . . . . .
(A) straight line (B) second degree equation (C) best fit (D) polynomial equation

[20] The bisection method of finding roots of nonlinear equations falls under the category of a (an). . . . . . method.
(A) open (B) bracketing (C) graphical (D) random

[21] To solve the given system of equations by Newton Raphson method f (x) = sin(xy)+x−y and g(x) = ycos(xy)+1,
df dg
The values of The dx and dx are
(A) ycos(xy) + 1 and xycos(xy) (B) ycos(xy) + 1 and cos(xy) + xysin(xy) (C) ycos(xy) − 1 and cos(xy) −
xysin(xy) (D) −ycos(xy) + 1 and −xycos(xy)

[22] The equation of a best fit straight line for the following data is
x 1 2 3 4 5
y 14 27 40 55 68
x = 15, y = 204, x2 = 55, xy = 748
P P P P

(A) y = 13.6x + 2.3 (B) y = 13.6x + 2.3 (C) y = 2.3x + 13.6 (D) y = 13.6x

[23] The equation of a best fit parabola for the following data is
x 0 1 2 3 4
y 1 5 10 22 38
x = 10, y = 76, x2 = 30, xy = 243, x2 y = 851, x3 = 100, x4 = 354
P P P P P P P

(A) 30a + 10b + 5c = 76, 100a + 30b + 5c = 243, 354a + 100b + 30c = 851
(B) 30a + 10b + c = 76, 100a + 30b + 5c = 243, 354a + 100b + 30c = 851
(C) 100a + 10b + 5c = 76, 30a + 30b + 5c = 243, 354a + 100b + 30c = 851
(D) none of these

[24] To Solve f (x) = ex − 2x2 using NR method method, f 0 (x) = ex − 4x and initial approximation is x0 = 1.0.
Solution at the end of 1st iteration is
(A) 1.66040 (B) 1.48681 (C) 1.56040 (D) 1.55040

[25] To Solve f (x) = 3x − cosx − 1 using Chebyshev method, f 0 (x) and f 00 (x) is given by
(A) 3 − sinx and cosx (B) 3 − sinx and −cosx (C) 3 + sinx and cosx (D) 3 + sinx and −cosx

> > > BEST OF LUCK > > >