Numerical Methods and Computer Programming

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

Total Marks:30 Duration: 30min
Set-D 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] Which of the following methods require(s) to have identified a bracket [x0 , x1 ] where f (x) changes of sign
(f (x0 )f (x1 ) < 0).
(A) Birge-Vieta method (B) Newton-Raphson’s method (C) Secant method (D) Bisection method
√
[2] Which interval is suitable to find the real root of 3 29 in the bisection method?
(A) [1,2] (B) [2,3] (C) [3,4] (D) [4,5]
[3] Let f (x) = 3x − cosx − 1 = 0 and initial approximate interval is [0,1], the next approximate interval is . . . . . . in
Bisection method.
(A) [0.5,1] (B) [0,0.5] (C) [0.5,1.5] (D) None of these
[4] The bisection is only applicable when two initial values produces . . . . . ..
(A) same sign (B) opposite sign (C) any sign (D) zero
[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] Which of the following methods has guaranteed and fast convergence ?
(A) Secant method (B) Bisection method (C) Newton Raphson method (D) Regula Falsi method
[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 x3 using Secant method if x1 = 1.25 and x2 = 2, for the equation x3 − 3x + 1 = 0
(A) 1.407 (B) 1.704 (C) 1.093 (D) 1.843
[9] In the regula-falsi 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
[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
negative, then . . . . . . is replaced by x2
(A) x1 (B) x0 (C) x2 (D) None of these
[12] In the regula-falsi method of finding roots of equations, initial interval is [x0 , x1 ]. Then value of approximate root
at the end of iteration is . . . . . .
x0 f (x1 )−x1 f (x0 ) x0 f (x1 )+x1 f (x0 ) x0 −x1 x0 −x1
(A) x2 = f (x1 )−f (x0 )
(B) x2 = f (x1 )+f (x0 )
(C) x2 = f (x1 )−f (x0 )
(D) x2 = f (x1 )+f (x0 )

[13] The Newton Raphson Method is also called . . . . . .

(A) Bolzano’s Bisection Method (B) Iterative Method (C) Method of Tangents (D) Newton’s Method
[14] NR method gives best result if . . . . . .
(A) f 0 (x0 ) 6= 0 and f (x0 )f 00 (x0 ) > 0 (B) f 0 (x0 ) 6= 0 and f (x0 )f 00 (x0 ) < 0 (C) f 0 (x0 ) = 0 and f (x0 )f 00 (x0 ) > 0
(D) f 0 (x0 ) = 0 and f (x0 )f 00 (x0 ) < 0
[15] In Chebyshev method to find root of an equation, generalize formula is . . . . . .
f (xn ) 1 [f (xn )]2 00 f (xn ) 1 f (xn ) 0 f (xn )
(A) xn+1 = xn + f 0 (xn )
+ 2 [f 0 (xn )]3
f (xn ) (B) xn+1 = xn − f 0 (xn )
− 2 f 00 (xn )
f (xn ) (C) [xn+1 = xn − f 0 (xn )
f (xn ) 1 [f (xn )]2 00
(D) xn+1 = xn − f 0 (xn )
− 2 [f 0 (xn )]3
f (xn )

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

 ∂u ∂u   ∂u ∂v   ∂v ∂u   ∂u ∂u 
∂x ∂y ∂x ∂y ∂x ∂y ∂y ∂x
(A) J = ∂v ∂v (B) J = ∂u ∂v (C) J = ∂u ∂v (D) J = ∂v ∂v
∂x ∂y ∂x ∂y ∂x ∂y ∂x ∂y
Set-D MCQ Examination - Page 2 of 2

[17] Which method gives a unique set of values to the constants in the equation in the case of curve fitting ?
(A) Horners method (B) Method of least squares (C) Interpolation (D) Newton’s Method

[18] If for a real continuous function f (x), you have f (x0 )f (x1 ) < 0, then in the interval [x0 , x1 ] for f (x) = 0, there
is (are) . . . . . .
(A) one root (B) an undeterminable number of roots (C) no root (D) at least one root

[19] The best representative curve to the given set of points for which the sum of the squares of the residuals is a
minimum is known as . . . . . .
(A) curve fitting (B) approximating curve (C) principles of least squares (D) empirical relation

[20] In curve fitting by method of least square, second order curve fitting equation are as follows except
n n n n n n n n n n n
(A) a x2i +b xi + nc = yi (B) a x3i +b x2i + c xi = xi yi (C) a x4i +b x3i + c x2i =
P P P P P P P P P P P
x
i=1 i=1 i=1 i=1 i=1 i=1 i=1 i=1 i=1 i=1 i=1
n n n
x2i + b
P P P
(D) a xi + c = yi
i=1 i=1 i=1

[21] 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

[22] 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 dy and dy are
(A) xcos(xy) + 1 and cos(xy) − xysin(xy) (B) xcos(xy) + 1 and cos(xy) + xysin(xy) (C) xcos(xy) − 1 and
cos(xy) − xysin(xy) (D) −xcos(xy) + 1 and −cos(xy) − xysin(xy)

[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 + 10c = 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] Use NR method to find the root of equation f (x) = x − cos(x) = 0 if initial guess is x0 = 1 at the end of one
iteration root is
(A) 0.75036 (B) 0.73919 (C) 0.55036 (D) ill condition

[25] Solve f (x) = x3 − 9 = 0 using Chebyshev method if initial guess is x0 = 2 and f 0 (x) = 3x2 and f 00 (x) = 6x.
(A) 2.0890 (B) 2.1087 (C) 2.70986 (D) 2.07986

> > > BEST OF LUCK > > >