Chapter

1.
/31
Given the differential equation y' = x — y
Numerical Methods

05. The iteration formula to find the square root

with initial condition y(0) = 0. The value of of a positive real number b by using the
y(0.1) calculated numerically upto the third Newton-Raphson method is
place of decimal by the 2nd order Runge- (GATE — 19951CSI)
Kutta method with step size h = 0.1 is 3(xk +b)
(a) x k+1 -
(GATE — 19931A111) 2xk

2. Simpson's rule for integration gives exact x2 +b

(b) xkl-1
result when f(x) is a polynomial function of 2x k
degree less than or equal to X k —2X"
(c) xk+, — 2
(GATE — 1993[ME]) X k +b

(a) 1 (b) 2 (d) None

(c) 3 (d) 4
6. Let f(x) = x — cos x. Using Newton-Raphson
03. Back ward Euler method for solving the method at the (n + 1)th iteration, the point
dy xn+i is computed from x„ as
differential equation — = f(x, y) is
dx (GATE — 1995)
specified by
(GATE — 19941CSD 7. The formula used to compute an
(a) yn+ +h Y pi) approximation for the second derivative of a
(b) yn+i = y„ + h f(x,,+1, Yn+1) function f at a point xo is
(C) Yn+ I = + 2h f(xn, yn) (GATE — 1996ICSO
(d) yn+, = (1 + h) Yn+i) f(xo + h)+f(x o —h)
(a)
2
04. In the interval [0, it] the equation x = cos x f(x + h)— f(xo — h)
(b) °
has 2h
(GATE — 1995[CS]) 0 + h) + 2f (x0)± f (x0 — h)
f
(a) No solution (c)
h2
(b) Exactly one solution
f(x0 + h)— 2 (x 0) + (xo — h)
(c) Exactly 2 solutions (d)
h2
(d) An infinite number of solutions

ACE Engineering Publications >Hyderabad I Delhi I Bhopal I Pune I Bhubaneswar I Lucknow I Patna I Bengaluru I Chennai I Vijayawada I Vizag Tirupati I Kukatpally Kolkata
 4 AC
Engineering Mathematics
110E r, Engineering Publications : 136:

8. The Newton-Raphson iteration formula for (a) always

finding V , where c > 0 is, (b) only iff is a polynomial
(GATE — 1996[CS]) (c) only if fixo) < 0
(d) none of the above
2x3 +.3‘R 2x3
(a) x n+1 = n (b) = 2
3 X 2n 3x. 13. The trapezoidal rule for integration give
2x3. + c 2x 3 — c exact result when the integrand is a
(c) — (d) x n+i = 2
3 X 2n 3x. polynomial of degree
(GATE — 2002[CS])
9. The order of error in the simpson's rule for (a) but not 1 (b) 1 but not 0
numerical integration with a step size h is (c) 0 (or) 1 (d) 2
(GATE — 1997[ME])
(b) h2 14. Given a>0, we wish to calculate it reciprocal
(a) h
(c) h3 (d) h4 1
value — by using Newton — Raphson
a
10. The Newton — Raphson method is used to method for fix) = 0. The Newton — Raphson
find the root of the equation x2 — 2 = 0. If the algorithm for the function will be
iterations are started from —1, then the (GATE — 2005[CE])
iteration will (GATE — 1997[CS]) a
(a) x k+, = 1(x k +
(a) converge to —1 (b) converge to Vi 2\ xk
(c) converge to „ri. (d) not converge a
(b) xk+, = x k + x k
2
2 1
(c) x k+i = 2x k — ax 2k
11. The value of dx computed using
a 2
(d) x k +1 = Xk --X k
simpson's rule with a step size of h= 0.25 is 2
(GATE — 1998[EE])
15. Given a > 0, we wish to calculate its
(a) 0.69430 (b) 0.69385
1
(c) 0.69325 (d) 0.69415 reciprocal value — by using Newton —
a
12. The Newton — Raphson method is to be used Raphson method for fix) = 0. For a = 7 and
starting with xo = 0.2 the first two iterations
to find the root of the equation and f '(x) is
will be
the derivative off The method converges
(GATE — 2005[CE])
(GATE — 1999[CS])
(a) 0.11, 0.1299 (b) 0.12, 0.1392
(c) 0.12, 0.1416 (d) 0.13, 0.1428
ACE Engineering Publications >Hyderabad Delhi Bhopal I Pune !Bhubaneswar Lucknow I Patna I Bengaluru I Chennai Vijayawada I Vizag I "Drupaii I Kukatpally I Kolkata
 ACE
‘1 r, Engineerg
in Publications : 137 : Numerical Methods
4

16. Starting from xo = 1, one step of Newton — 20. Match the following and choose the correct
Raphson method in solving the equation combination (GATE — 2005[EC])
x3 + 3x — 7 = 0 gives the next value xi as Group — I
(GATE — 2005[ME]) E. Newton — Raphson method
(a) xi = 0.5 (b) xi = 1.406 F. Runge-Kutta method
(c) xi = 1.5 (d) xi = 2 G. Simpson's Rule
H. Gauss elimination
17. For solving algebraic and transcendental
Group — II
equation which one of the following is used?
(1) Solving non-linear equations
(GATE — 2005[PI])
(2) Solving linear simultaneous equations
(a) Coulomb's theorem
(3) Solving ordinary differential equations
(b) Newton — Raphson method
(4) Numerical integration method
(c) Euler's method
(5) Interpolation
(d) Stoke's theorem
(6) Calculation of eigen values
18. Newton — Raphson formula to find the roots Codes:
of an equation f(x) = 0 is given by (a) E — 6, F — 1, G — 5, H — 3
(GATE — 2005 FPI]) (b) E — 1, F — 6, G — 4, H — 3
f(x ) (c) E — 1, F — 3, G — 4, H — 2
(a) x„, xn n (d) E — 5, F — 3, G — 4, H — 1
f l (x n )
f(x )
(b) xn+, = + " 21. The polynomial p(x) = x5 + x + 2 has
f „)
(GATE — 2007[IN])
f(x ) (a) all real roots
(c) x n+i = n
xnf l (x n )
(b) 3 real and 2 complex roots
xnf(x n ) (c) 1 real and 4 complex roots
(d) xn+1 =
f l (xn ) (d) all complex roots

19. The real root of the equation xex = 2 is 22. Identify the Newton — Raphson iteration
evaluated using Newton — Raphson's scheme for the finding the square root of 2
method. If the first approximation of the (GATE — 20071IN1)
value of x is 0.8679, the 2nd approximation (a) xn+ _1 2 (b) xn+ 2
xx„± x
of the value of x correct to three decimal 2( „ x x,,
I 2 "
places is (GATE — 2005 [PM
(c) x,1= 2 (d) x„4.1 = .1/2 +
(a) 0.865 (b) 0.853 x„
(c) 0.849 (d) 0.838
\ Lnginuci ing Publications :›Hyderabad I Delhi Bhopal I Pune I Bhubaneswar Lucknow I Patna I Bengaluru I Chennai I Vijayawada I Vizag I Tirupati Kukatpally I Kolkata
10
.".,
4 ACE
.5 Engbieering Publications : 138: Engineering Mathematics

23. Given that one root of the equation 26. The equation x3 — x2+ 4x — 4 = 0 is to be
x — 10X2 + 31x — 30 = 0 is 5 then other roots
3
solved using the Newton — Raphson method.
are (GATE — 200710ED If x = 2 taken as the initial approximation of
(a) 2 and 3 (b) 2 and 4 the solution then the next approximation
(c) 3 and 4 (d) — 2 and — 3 using this method, will be
(GATE — 2007 [EC])
24. The following equation needs to be (a) 2/3 (b) 4/3
numerically solved using the Newton — (c) 1 (d) 3/2
Raphson method x 3 + 4x — 9 = 0. The
iterative equation for this purpose is 27. If the interval of integration is divided into
(k indicates the iteration level) two equal intervals of width 1.0, the value of
(GATE — 2007[CE])
the definite integral f log, dx using
2x3 +9 3x3+9
(a) x k+1 = (b) x „, _
3x2k + 4 2x 2 + 9 simpson's one — third rule will be

(c) x„, = x k —32k +4 (d) x k+1 = 4x2k +3 (GATE — 2008)

9X 2 + 2 (a) 0.5 (b) 0.80
(c) 1.00 (d) 0.29
25. Matching exercise choose the correct one
out of the alternatives A, B, C, D dx —2/
Group —1 28. A differential equation — =e u(t) has to
dt
P. 2nd order differential equations be solved using trapezoidal rule of
Q. Non-linear algebraic equations integration with a step size h = 0.01 sec.
R. Linear algebraic equations Function u(t) indicates a unit step function.
S. Numerical integration If x(0) = 0 then the value of x at t = 0.01sec
will be given by (GATE — 2008[EE])
Group — II
(a) 0.00099 (b) 0.00495
(1) Runge — Kutta method
(c) 0.0099 (d) 0.0198
(2) Newton — Raphson method
(3) Gauss Elimination
29. Equation e —1= 0 is required to be solved
(4) Simpson's Rule
using Newton's method with an initial guess
(GATE — 2007[PI1)
xo = —1. Then after one step of Newton's
(a) P — 3, Q — 2, R — 4, S — 1
method estimate xi of the solution will be
(b) P — 2, Q — 4, R — 3, S — 1
given by (GATE — 2008 PEED
(c) P — 1, Q — 2, R — 3, S — 4
(a) 0.71828 (b) 0.36784
(d) P — 1, Q — 3, R — 2, S — 4
(c) 0.20587 (d) 0.0000
k(1.: liginccring Publications yderabad I Delhi I Bhopal I Pune Bhubaneswar' Lucknow I Patna I Bengaluru Chennai Vijayawada Vizag Tirupati I Kukatpally I Kolkata
4, ACE
4 4. Eugineering Publicaiions : 139 : Numerical Methods

30. It is known that two roots of the non-linear A

equation x3 — 6x2+ 1 lx — 6 = 0 are 1 and 3.

9—
The third root will be
4—
(GATE — 2008[IN])
3
(a) j (b) —j
(c) 2 (d) 4 2—
1—
P.
31. The recursion relation to solve x=e-x I I I x
2 3 4
using Newton — Raphson method is
(GATE — 2008[EC]) The evaluated area (in m2) will be
(a) cx. (a) 7 (b) 8.67
(b) x,„= x„ —e x„ (c) 9 (d) 18

x - x. 34. Let x2 — 117 0. The iterative steps for the

"A + n + e -x n )
solution using Newton — Raphson's method
2 e —x " ( + X n ) —1 is given by (GATE — 2009[EE])
(d) x i,,, = xn (
x n—e-xn 117
(a) x k+, xk +
Xk
2 \
32. The Newton- Raphson iteration 117
R (b) Xk+l = Xk
can be used to compute Xk
xn+I =— X n
2 xn
Xk
(a) square of R (b) reciprocal of R (c) Xk+l Xk
117
(c) square root of R (d) logarithm of R
111
(d) xk-Fi xk xk + —
33. The area under the curve shown between 2 Xk

x = 1 and x = 5 is to be evaluated using the

trapezoidal rule. The following points on the 35. During the numerical solution of a first
curve are given (GATE — 2009) order differential equation using the Euler
(also known as Euler Cauchy) method with
Point x — coordinate (m) y — coordinate (m) step size h, the local truncation error is of
1 1 1 the order of (GATE — 2009 [PI] )
2 2 4 (a) h2 (b) h3
3 3 9 (c) h4 (d) h5

ACE Enginecting Publications >HyderabadiDelhilBhopallPunelBhubaneswarl LucknowlPatrialBengalutulChennailVijayawadalVizag 1Tirupati I Kukatpallyi Kolkata

 ACE
.1 r, Engineering Publicafions : 140 : Engineering Mathematics
64
36. Consider a differential equation 39. The table below gives values of a function
dy(x) F(x) obtained for values of x at intervals of
y(x) = x with initial condition
chc 0.25 (GATE — 2010 [CE])
y(0) = 0. Using Euler's first order method x 0 0.25 0.50 0.75 1
with a step size of 0.1 then the value of y F(x) 1 0.9412 0.8 0.64 0.5
(0.3) is (GATE — 2010 [EC])
The value of the integral of the function
(a) 0.01 (b) 0.031
between the limits 0 to 1, using Simpson's
(c) 0.0631 (d) 0.1
rule is
37. Newton — Raphson method is used to (a) 0.7854 (b) 2.3562
compute a root of the equation x2 — 13 = 0 (c) 3.1416 (d) 7.5000
with 3.5 as the initial value. The
40. A numerical solution of the equation
approximation after one iteration is
(GATE — 2010[CS]) f (x) = x + AFc — 3 = 0 can be obtained using
(a) 3.575 (b) 3.677 Newton — Raphson method. If the starting
(c) 3.667 (d) 3.607 value is x = 2 for the iteration then the value
of x that is to be used in the next step is
38. The following algorithm computes the (GATE — 2011 [EC])
(a) 0.306 (b) 0.739
integral J = J f(x) chc from the given values
a (c) 1.694 (d) 2.306
= f(xj) at equidistant points xo=a, x1=x0+h,
41. The square root of a number N is to be
x2 = xo + 2h, ... x2m = xo + 2mh = b compute
obtained by applying the Newton — Raphson
So =f0 + f2m
iteration to the equation x2 — N = 0. If i
=fi +f3 + -Ff2m-1
denotes the iteration index, the correct
S2 = f2 +fa + +f2m-2
iterative scheme will be (GATE-2011 [CE])
J= [ So + 4(S1) + 2(S2A
3 1[ N
(a) x i." = x+—
The rule of numerical integration, which 2 x;
uses the above algorithm is
(GATE — 20101P11) (b) xi" —
——1[X
2i +N2
2 x.
(a) Rectangle rule
(b) Trapezoidal rule .1 + N2
(c) x xi
(c) Four — point rule 2[ X;
(d) Simpson's rule N
(d) xj„ = 1[x, — —1
2 " x,
ACE Engineering Publications HyderabadiDelhilBhopaliPunelBhubaneswari LucknowiPatna I Bengalurul ChennailVijayawadaiVizag airupati I Kukatpallyl Kolkata
bbi st ACE
Jr 4 Eogineering Publications : 141 : Numerical Methods

42. Solution, the variable xi and x2 for the (GATE — 2013 [EN)
following equations is to be obtained by (a) —0.82 (b) 0.49
employing the Newton — Raphson iteration (c) 0.705 (d) 1.69
method (GATE — 2011 IEED
equation (i) 10 x2 sin xi — 0.8 = 0 46. While numerically solving the differential
dy 2xy2 = 0, y (0)=1 using Euler's
equation —+
dx
Assuming the initial values xi = 0.0 and
predictor corrector (improved Euler-
x2 = 1.0 the Jacobian matrix is
Cauchy) method with a step size of 0.2, the
10 —0.8 [10
(a) (b) value of y after the first step is
0 — 0.6] 0 10
(GATE — 2013 [IN])
0 —0.8 10 0 (a) 1.00 (b) 1.03
(c) (d)
10 —0.6 10 —10 (c) 0.97 (d) 0.96

47. Match the CORRECT pairs.

43. The integral
J 1 dx when evaluated by
Numerical Order of Fitting
using simpson's 1/3rd rule on two equal sub Integration Scheme Polynomial
intervals each of length 1, equals to P. Simpson's 3/8 Rule 1. First
(GATE — 2011 [ME]) Q. Trapezoidal Rule 2. Second
R. Simpson's 1/3 Rule 3. Third
(a) 1.000 (b) 1.008
(c) 1.1111 (d) 1.120 (GATE — 2013[MEI)
Codes:
1.5
dx
44. The estimate of 1— obtained using (a) P-2, Q-1, R-3
X
05
(b) P-3, Q-2, R-1
Simpson's rule with three-point function (c) P-1, Q-2, R-3
evaluation exceeds the exact value by
(d) P-3, Q-1, R-2
(GATE — 2012 [CE])
(a) 0.235 (b) 0.068 48. There is no value of x that can
(c) 0.024 (d) 0.012 simultaneously satisfy both the given
equations. Therefore, find the 'least squares
45. When the Newton-Raphson method is
error' solution to the two equations, i.e.,
applied to solve the equation
find the value of x that minimizes the sum of
f(x) = x3 + 2x —1 = 0, the solution at the end squares of the errors in the two equations
of the first iteration with the initial value as 2x = 3
xo = 1.2 is 4x = 1 (GATE — 2013 ICED
I ACE Engineering Publicatiolis >>Hyderabad Delhi Bhopal Pune Bhubaneswar Lucknow I Patna l Bengaluru I Chennai Vijayawada Vizag I Tirupati Kukatpally Kolkata
 do
,,or .444 ACE
: r, Engineering Publications : 142: Engineering Mathematics
J . 4.4,

49. Functionfis known at the following points: 3

52. The definite integral f 1dx is evaluated
I x
x fix) using Trapezoidal rule with a step size of 1.
0 0 The correct answer is
0.3 0.09 (GATE — 14 — ME — Set 3)
0.6 0.36
0.9 0.81 53. Match the application to appropriate
1.2 1.44 numerical method
1.5 2.25 Applications
1.8 3.24 PI: Numerical integration
2.1 4.41 P2: Solution to a transcendental equation
2.4 5.76 P3: Solution to a system of linear equations
2.7 7.29 P4: Solution to a differential equation
3.0 9.00
Numerical Method
3
Ml: Newton—Raphson Method
The value of f f(x)dx computed using the M2: Runge—Kutta Method
0 M3: Simpson's 1/3—rule
trapezoidal rule is M4: Gauss Elimination Method
(GATE-2013 [CS]) (GATE — 14 — EC — Set 3)
(a) 8.983 (b) 9.003 (a) Pl—M3, P2—M2, P3—M4, P4—M1
(c) 9.017 (d) 9.045 (b) Pl—M3, P2—M1, P3—M4, P4—M2
(c) Pl—M4, P2—M1, P3—M3, P4—M2
50. Using the trapezoidal rule, and dividing the
(d) P1—M2, P2—M1, P3—M3, P4—M4
interval of • integration into three equal
+1
subintervals, the definite integral flxklx is 54. The function fix) = ex — 1 is to be solved
--1 using Newton — Raphson method. If the
(GATE —14 — ME — Set 1) initial value of xo is taken 1.0, then the
absolute error observed at 2nd iteration is
4
51. The value of f /n(x) calculated using the
25 (GATE — 14 — EE — Set 3)
Trapezoidal rule with five subintervals is
(GATE — 14 — ME — Set 2)

ACE Engineering Publications Hyderabad I Delhi I Bhopal I Pune I Bhubaneswar I Lucknow I Patna I Bengaluru I Chennai I Vijayawada I Vizag I Tirupati I Kukatpally I Kolkata

(:14
tit ACE
,
7
4
ri Engineering Publications
1i
: 143: Numerical Methods
4

55. The iteration step in order to solve for The 59. Using the. Simpson's 1/3rd rule, the value of
cube roots of a given number 'N' using the ydx computed, for the data given below, is
f
Newton-Raphson's method is
(GATE —14 — PI — Set 1)
(GATE-14— IN — Set 1)
x 1 3 5
(a) Xk+I Xk — (1 — X k )

y 2 6 4
1 N
(b) x k+, = — (2x k + — 60. A non-zero polynomial f(x) of degree 3 has
3 x2k
roots at x = 1, x =2 and x = 3. Which one of
(c) X k+i = X k — 1. — X 3k the following must be TRUE?
3
(GATE — 14 — CS — Set 2)
(a) f(0) f(4) < 0
(d) x k+i = 1 2X — —
N
3 k X2 (b) f(0) f(4) > 0
(c) f(0) + f(4) > 0
56. The real root of the equation 5x-2cosx = 0 (d) f(0) + f(4) < 0
(up to two decimal accuracy) is
61. In the Newton-Raphson method, an initial
(GATE — 14 — ME — Set 3)
guess of xo = 2 is made the sequence xo, xi,
57. Consider an ordinary differential equation x2, .... is obtained for the function
dx 0.75x3 — 2x2 — 2x + 4 = 0
— = 4t +4. If x = xo at t=0, the increment
dt Consider of the statements
in x calculated using Runge-Kutta fourth (I) x3 = 0.
order multi-step method with a step size of (II) The method converges to a solution in a
At = 0.2 is finite number of iterations.
(GATE —14 — ME — Set 4) Which of the following is TRUE?
(a) 0.22 (b) 0.44 (GATE — 14 — CS — Set 2)
(c) 0.66 (d)0.88 (a) Only I
(b) Only II
58. If the equation sin(x) = x2 is solved by (c) Both I and II
Newton Raphson's method with the initial (d) Neither I nor II
guess of x = 1, then the value of x after 2
iterations would be
(GATE — 14 — PI — Set 1)

ACE Engineering Publications `)Hyderabad Delhi j Bhopal Pune j Bhubaneswar Lucknow I PaIna Bengaluru Chennai I Vijayawada I Vizag IlimPati I Kukatpally I Kolkata
 4 ACE
La Engineering Publications : 144: Engineering Mathematics
4,11$
62. With respect to the numerical evaluation of (c) J = I
the definite integral, K= f b x 2d, c, where a (d) Insufficient data to determine the
a
relationship
and b are given, which of the following
statements is/are TRUE? 65. The quadratic equation x2 — 4x + 4=0 is to
I. The value of K obtained using the be solved numerically, starting with the
trapezoidal rule is always greater than initial guess x0=3. The Newton- Raphson
or equal to the exact value of the method is applied once to get a new estimate
definite integral. and then the Secant method is applied once
II. The value of K obtained using the using in the initial guess and this new
Simpson's rule is always equal to the estimate. The estimated value of the root
exact value of the definite integral after the application of the Secant method is
(GATE — 14 — CS — Set 3) . (GATE —15 — CE — Set 1)
(a) I only (b) II only
(c) Both I and II (d) Neither I nor II 66. In Newton-Raphson iterative method, the
initial guess value (xi.) is considered as zero
63. The Newton-Raphson method is used to while finding the roots of the equation:
solve the equation f(x) = x3 — 5x2 + 6x — 8 = f(x)=-2+6x-4x2+0.5x3. The correction, Ax,
0. Taking the initial guess as x = 5, the to be added to xini in the first iteration
solution obtained at the end of the first is . (GATE — 15 — CE — Set 2)
iteration is
(GATE — 15 — EC — Set 3) 67. For step-size, Lx = 0.4, the value of
following integral using Simpson's 1/3 rule
64. The integral f 2 X 2dX with x2 > x1 > 0 is is
x, 08
evaluated analytically as well as numerically 1(0.2 -I- 25x— 200x2 + 675x3 —900x4 +400x5 )dx
using a single application of the trapezoidal
(GATE — 15 — CE — Set 2)
rule. If I is the exact value of the integral
obtained analytically and J is the 1
approximate value obtained using the 68. Simpson's 3
— rule is used to integrate the
trapezoidal rule, which of the following
function f(x) = — 3 x 2 + 2 between x = 0 and
statements is correct about their 5 5
relationship? x = 1 using the least number of equal sub —
(GATE — 15 — CE — Set 1) intervals. The value of the integral is
(a) J > I . (GATE — 15 — ME — Set 1)
(b) J < I
'ACE Engineering Publications )Hyderabad I Delhi I Bhopal I Pune I Bhubaneswar Lucknow Patna Bengaluru I Chennai I Vijayawada I Vizag I Tirupati I Kultatpally1 Kolkata
 .s
lo ACE
t•!, 15, Eagineffing Publications : 145 : Numerical Methods

69. The values of function(x) at 5 discrete points 74. In the LU decomposition of the matrix
are given below: 2 21
, if the diagonal elements of U are
49
X 0 0.1 0.2 0.3 0.4
f(x) 0 10 40 90 160 both 1, then the lower diagonal entry 122 of L
is (GATE — 15 — CS — Set 1)
Using Trapezodial rule with step size of 0.1,
0.4
75. The velocity v (in kilometer/minute) of a
the value of f
J (x) dx is motorbike which starts from rest, is given at
0
(GATE — 15 — ME — Set 2) fixed intervals of time t(in minutes) as
follows:
70. Using a unit step size, the value of integral
t 2 4 6 8 10 12 14 16 18 20
2
v 10 18 25 29 32 20 11 5 2 0
J X In xdx by trapezoidal rule is
The approximate distance (in kilometers)
(GATE — 15 — ME— Set 3)
rounded to two places of decimals covered
71. Newton-Raphson method is used to find the in 20 minutes using Simpson's 1/3d rule
roots of the equation, x3+2x2+3x-1=0. If the is (GATE — 15 — CS — Set 3)
initial guess is x0=1, then the value of x after
76. Consider the first order initial value problem
2nd iteration is
y' = y + 2x — x2, y(0) = 1, (0 x < 09)
(GATE — 15 — ME — Set 3)
With exact solution y(x) = x2+ex. For
72. In numerical integration using Simpson's x = 0.1, the percentage difference between
rule, the approximating function in the the exact solution and the solution obtained
interval is a using a single iteration of the second-order
(GATE —15 — PI) Runge—Kutta method with step-size h = 0.1
(a) constant (b) straight line is
(c) cubic B-Spline (d) Parabola (GATE — 16 — EC — Set 3)

73. If a continuous function f(x) does not have a 77. Solve the equation x = 10 cos (x) using the
root in the interval [a, b], then which one of Newton-Raphson method. The initial guess
the following statements is TRUE? is x = 4 . The value of the predicted root
(GATE — 15 — EE — Set 1)
(a) f(a). f(b) = 0 (b) f(a) . f(b) < 0 after the first iteration, up to second
(c) f(a) . f(b) > 0 (d) f(a)/f(b) 0 decimal, is
(GATE-16-ME-SET1)

ACE Engineering Publications :,>1-1yderabad I Delhi I Bhopal I Pune I Bhubaneswar Lucknow I Patna 1 Bengaluru Chennai j Vitayawada I Vizag Tirupati Kukatpally I Kolkata
 ACE
Engineering Pub ions : 146: Engineering Mathematics

78. Gauss-Seidel method is used to solve the (a) — 8.101 (b) 1.901
following equations (as per the given order). (c) 2.099 (d) 12.101
x1 + 2x2 + 3x3 = 5 (GATE-16-PI-SET1)
2x1 + 3x2 + x3 = 1
3xi + 2x2 + x3 = 3 83. Newton-Raphson method is to be used to
Assuming initial guess as x1 = x2 = x3 = 0, find root of equation 3x — + sin x = 0. If
the value of x3 after the first iteration is the initial trial value for the root is taken as
(GATE-16-ME-SET1) 0.333, the next approximation for the root
would be (note: answer up to
79. Numerical integration using trapezoidal rule three decimal)
gives the best result for a single variable (GATE-16-CE-SET1)
function, which is
(GATE-16-ME-SET2) 84. The quadratic approximation of
(a) linear (b) Parabolic f(x) = x3 — 3x2 —5 at the point x = 0 is
(c) logarithmic (d) hyperbolic (GATE-16-CE-SET2)
(a) 3x2 — 6x —5 (b) —3x2 —5
80. The error in numerically computing the (c) —3x2 + 6x — 5 (d) 3x2 — 5

integral using the

J (sin x + cos x)dx 85. The ordinary differential equation
0
dx
trapezoidal rule with three intervals of equal —3x + 2, with x(0) =1 is to be solved
dt
length between 0 and rc is
using the forward Euler method. The largest
(GATE-16-ME-SET2) time step that can be used to solve the
equation without making the numerical
81. The root of the function f(x) = x3 + x — 1
solution unstable is
obtained after first iteration on application of
(GATE — 16 — EC — Set 2)
Newton-Raphson scheme using an initial
guess of xo = 1 is (GATE-16-ME-SET3) 86. Starting with x = 1, the solution of the
(a) 0.682 (b) 0.686 equation x3 + x = 1, after two iterations of
(c) 0.750 (d) 1.000 Newton-Raphson's method (up to two
decimal places) is
82. To solve the equation 2sinx = x by Newton-
(GATE-17—EC)
Raphson method, the initial guess was
chosen to x = 2.0. Consider x in radian
only. Thy value of x (in radian) obtained
after one iteration will be closest to

ACE Engineering Publications lyderabad Delhi I Bhopal I Pune I Bhubaneswar Lucknow I Patna I Bengalunt I Chennai Vijayawacla I Vizag I Tinipati I Kukatpally I Kolkata
 ACE
#
Dneering Publications : 147 : Numerical Methods

87. P (0, 3), Q (0.5, 4), and R (1, 5) are three du

88. Consider the equation — = 3t 2 +1 with
points on the curve defined by f(x). dt
Numerical integration is carried out using u = 0 at t = 0. This is numerically solved by
both Trapezoidal rule and Simpson's rule using the forward Euler method with a step
within limits x = 0 and x = 1 for the curve. size. At = 2. The absolute error in the
The difference between the two results will solution at the end of the first time step is
be
(a) 0 (b) 0.25 (GATE-17—CE)
(c) 0.5 (d) 1
(GATE-17—ME)

A( l iiginccriug l'ublicaliot, ( yderabad I Delhi I Bhopal I Pune' Bhubaneswar I Lucknow I Patna I Bengaluru I Chennai I Vijayawada j Vizag Tirupati I Kukatpally I Kolkata