Numerical Methods and Computer Programming

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

Total Marks:30 Duration: 30min
Set-A 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 bisection method can be used to solve . . . . . .

(A) algebraic equations only (B) transcendental equation only (C) both algebraic and transcendental
equations (D) none of these
√
[2] Let 12 and initial approximate interval is [3,4], the next approximate interval is . . . . . . in Bisection method.
(A) [3.5,4.5] (B) [3.5,4] (C) [3,3.5] (D) None of these

[3] If initial approximation to solve f (x) = 0 are x0 and x1 produces opposite signs, the formula used to determine
new approximation in the bisection method is . . . . . ..
x0 x1 x0 +x1 x0 −x1 2
(A) x2 = 2
(B) x2 = 2
(C) x2 = 2
(D) x2 = x0 +x1

[4] Which is not correct statement if x0 and x1 are initial approximations to solve f (x) = 0?
(A) Bisection method is suitable, if f (x0 ) is positive and f (x1 ) is negative. (B) Bisection method is suitable, if
f (x0 ) is negative and f (x1 ) is positive. (C) Bisection method is suitable, if f (x0 ).f (x1 ) < 0. (D) Bisection
method is suitable, if f (x0 ) is positive and f (x1 ) is positive.

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

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

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

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

[9] 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 )

[10] 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 )

[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] Regula Falsi means

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

[13] . . . . . . method is faster than bisection method.

(A) Regula-falsi (B) Gauss-elimination (C) Newton Raphson’s method (D) Secant
f (x0 )
[14] If the ratio f 0 (x0 )
is small then . . . . . .
(A) The next approximation approximation is near to root (B) The next approximation approximation is root
(C) The next approximation approximation is away to root (D) Can’t say
Set-A MCQ Examination - Page 2 of 2

[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 ) 2
1 [f (xn )]
(D) xn+1 = xn − f 0 (xn )
− 2 [f 0 (xn )]3
f 00 (xn )

[16] To solve x3 − 5x + 1 = 0 and initial guess of x0 = 0.5 using Chebyshev method for one iteration we need to find
out
(A) f 0 (x) at x0 = 0.5 (B) f 00 (x) at x0 = 0.5 (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 
∂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

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

[19] . . . . . . method is slower than Newtons Raphson Method.

(A) Gauss-elimination (B) Newtons (C) Horners (D) Regula-falsi

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

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

[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 straight line for the following data is
x 5 10 15 20 25
y 16 19 23 26 30
x = 75, y = 114, x2 = 1375, xy = 1885
P P P P

(A) y = 0.7x − 12.3 (B) y = 0.7x + 12.3 (C) y = 12.3x − 0.7 (D) y = 12.3x + 0.7

[24] The equation of a best fit parabola for the following total 5 data is
30a + 10b + 5c = 76, 100a + 30b + 10c = 243, 354a + 100b + 30c = 851
x 0 1 2 3 4
y 1 5 10 22 38

(A) P x = 10, P y = 76, P x2 = 30, P

P 2 P 3
x = 100, Px4 = 354
P P P P P
xy = 243, P x y = 851, P
(B) P x = 30,P y = 76, P x2 = 1000,P xy = 243,P x2 y = 851,P x3 = 10, P x4 = 354
(C) x = 0, y = 100, x2 = 100, xy = 243, x2 y = 851, x3 = 100, x4 = 354
(D) none of these

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