Matoshri college of Engineering & Research Centre, Nashik

x C. Third order D. None of the above.

1. Solve the equation e −4x=0 using Newton-
Raphson iteration. 7. Newton Raphson method of solution of
A. x=0.61906 and x=1.51213 numerical equation is not preferred when
B. x=0.35 and x=2.1
C. x=0.35740 and x=2.15329 A. The graph of f(x) is nearly horizontal where it
D. Newton-Raphson iteration cannot be crosses the x-axis.
used since the answer oscillates B. The graph of f(x) is nearly vertical where it
between 2 and −2. crosses the x-axis.
C. Both conditions (A) and (B) above prevail.
2. Use the Newton-Raphson method to D. None of the above.
solve 2x3−6x2+6x−1=0 to 4 decimal places.
A. There is no solution since the curve is always 8. The Newton-Raphson method of finding roots
increasing. of nonlinear equations falls under the category
of _____________ methods.
B. x=0.2063.
C. x=0.7351.
(A) Bracketing (B) Open
D. Newton-Raphson cannot be used because the (C) Random (D) Graphical
tangents to the curve do not cut the axes on
the interval 0≤x≤1. 9. The next iterative value of the root of X 2− 4 = 0
using the Newton-Raphson method, if the initial
3. Newton-Raphson method will always converge guess is 3, is
to a solution for f(x) =0 on the interval a≤x≤b if
certain conditions are met. Which of the (A) 1.5 (B) 2.067
following is not one of these conditions? (C) 2.167 (D) 3.000

A. f is continuous on the interval a≤x≤b.
B. f(a) and f(b) have opposite signs.
C. f′′(x) does not change sign on the
interval a≤x≤b.
D. f′(x) =0 on the interval a≤x≤b.
10. Suppose we want to find a root of the
polynomial x3 - 5x. Using the Bisection method
and starting boundaries a = 2 and b = 4, what is
the third approximation to the root obtained by
the algorithm?

4. The function f(x) =2X3 − 2X2 − 3X + 2 has a root A. 2.875 B. 2.125

between 0 and 1. Which of the following B. 2.5 C. 3.0
conditions fail?
11. Newton Raphson method is also called as
A. f(0) and f(1) have opposite signs.
B. f′(x)≠0 on 0≤x≤1. A. Method of chords
C. f′′(x) does not change sign on the B. Interval halving method
interval 0≤x≤1. C. Method of linear interpolation
D. The tangents at 0 and 1 cut the axes in the D. Method of tangents
interval 0≤x≤1.
12. The Iterative formula for Newton-Raphson
5. Consider the function f(x) = X 4+3 X 2− X − 5. It method is:
has one root at x =−1. Use the Newton-
Raphson method to find the other real root to A. Xn+1 = f (Xn) C. Xn+1 = Xn –
9 decimal places.
A. The other root is x=1.185037375.
B. The other root is x=−1.000003000. B. Xn+1 = Xn- 1 – D. Xn+1 = Xn –
C. The iterations do not converge.
D. The other root is x=1.185038651
13. Which iterative method requires single initial
6. The order of convergence of Newton-Raphson guess root?
iterative algorithm is A. Bisection method
B. Secant method
A. First order B. Second order C. Method of false position
D. Newton Raphson Method

Numerical Methods & C Programming Unit – 3 Page 1

Matoshri college of Engineering & Research Centre, Nashik

14. If initial guess root of the equation x3–5x + 3 = 22. The root of the equation e power x=4x lies
0 is 1, then first approximation for the root by between________.
Newton Raphson method is:
A. (0, 1) B. (1, 2)
(a) 0.5 (b) 1.5 C. (2, 3) D. (3, 4)
(c) 1.0 (d) None of the above
23. A root of the equation cos(x) - x * exp(x) = 0 ,
15. Which method has slow convergence? the first initial guess lies between.

(a) false poison (b) Secant A. (0, 1) B. (-1,-2)

(c) Newton-Raphson (d) Bisection C. (-2, 3) D. (3, 4)

16. One root of the equation x3 + 3x2- 5x + 2 = 0 24. _________method is faster than bi-section
lies between: method.

(a) –5 and –4 (b) –4 and –3 A. Secant B. Newton-Raphson

(c) 0 and 1 (d) –1 and +1 C. Bisection D. Regula-falsi

17. The next iterative value of the root of using 25. The general problem of finding equations of
secant method, if the initial guesses approximating curves which fit a given data is
are 1 and 2, is x4-x-10 = 0 called.

(A) 1.7142 (B) 2.5000 A. curve fitting B. approximating curve

(C) 5.5000 (D) 5.7143 C. empirical relation D. linear form

18. Newton-Raphson method is applicable the
solution of ______.
A. Both algebraic and transcendental equations
B. Both algebraic and transcendental and also
used when the roots are complex
C. Algebraic equations only
D. Transcendental equations only
26. 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. empirical relation
D. principles of least squares

19. Fourth degree equations are also called 27. The root of x3 - 2x - 5 = 0 correct to three
_______ equations. decimal places by using Newton-Raphson method
is
A. quadratic B. cubic
C. linear D. bi-quadratic A 2.0946 B. 1.0404
C. 1.7321 D. 0.7011
20. In which of the following methods proper
choice of initial value is very important? 28. Newton-Raphson method of solution of
numerical equation is not preferred when
A. Newton Raphson Method
B. Bisection Method A Graph of f(x1) is vertical
C. Iterative Method B. Graph of x(y) is not parallel
D. Regula Falsi Method C. The graph of f(x) is nearly horizontal-where it
crosses the x-axis.
21. In the case of Newton-Raphson method the D. None of these
error at any stage is proportional to______.
A. the error in the previous stage 29. A root of the equation x3 - x - 11 = 0 correct
B. the square of the error in the previous stage to four decimals using bisection method is,
C. the cubic of the error in the previous stage A. 2.3737 B. 2.3838
D. square root of the error in the previous stage C. 2.3736 D. None of these

Numerical Methods & C Programming Unit – 3 Page 2

Matoshri college of Engineering & Research Centre, Nashik

30. Newton-Raphson method is applicable to the

solution of

A. Both algebraic and transcendental Equations

B. Both algebraic and transcendental and also
used when the roots are complex
C. Algebraic equations only
D. Transcendental equations only

31. Using Newton-Raphson method, find a root

correct to three decimal places of the equation
sin x = 1 - x

A. 0.511 B. 0.500
C. 0.555 D. None of these

32. The convergence of which of the following

method is sensitive to starting value?
A. False position
B. Gauss seidal method
C. Newton-Raphson method
D. All of these

33. Newton-Raphson method is used to find the

root of the equation x2 - 2 = 0. If iterations are
started from - 1, then iterations will be

A. converge to -1 B. converge to √2
C. converge to -√2 D. no coverage

34. Which of the following statements applies to

the bisection method used for finding roots of
functions?

A. Converges within a few iterations

B. Guaranteed to work for all continuous
functions
C. Is faster than the Newton-Raphson method
D. Requires that there be no error in determining
the sign of the function

35. We wish to solve x2 - 2 = 0 by Newton

Raphson technique. If initial guess is x0 = 1.0,
subsequent estimate of x (i.e. x1) will be

A. 1.414 B. 1.5
C. 2.0 D. None of these

36. Using Newton-Raphson method, find a root

correct to three decimal places of the equation
x3 - 3x - 5 = 0

A. 2.275 B. 2.279
C. 2.222 D. None of these

Numerical Methods & C Programming Unit – 3 Page 3