Innovative Institute of Mathematics, Jaipur

NUMERICAL ANALYSIS
1. Consider the iteration function for Newton’s (4) p ( x ) q ( x ) + r ( x ) NET Dec. 2011
f ( x) 1.01 0.99   2
method g ( x ) = x − and its application to 4. Let A = 
f ( x)  , A =   and x0 be the
 0.99 1.01  2
find (approximate) square root of 2 starting unique solution of the equation Ax = b . Let x̂1
with x0 = 2 , Consider the first and the second
1.01
iterates x1 and x2 . Respectively, then and x̂2 be the two approximate solutions  
1.01
(1) 1.5  x1  2
 2
(2) 1.5  x1  2 and   . Finally, let r1 = Ax0 − Axˆ1 = b − Axˆ1 and
0
(3) x1  1.5 , x2  1.5
r2 = Ax0 − Axˆ2 = b − Axˆ2 be the corresponding
(4) x1 = 1.5 ; x2  1 Net June-2011
residues. Which of the following is/are correct?
2. Consider a linear system Ax = b with a (1) x̂1 is a good approximation to x0 and r1 is
computed solution xc ; the error and the
small
residure are defined, respectively by e = x − xc , (2) x̂1 is not a good approximation to x0 but r1 is
r = Ax − Axc Then small.
(1) A small error necessarily implies a small (3) x̂2 is a good approximation to x0 and r2 is
residue. small
(2) The error can be large with relatively small
(4) x̂2 is not a good approximation to x0 but r2 is
residue.
(3) The error can be small with relatively large small. NET Dec. 2011
residue. 5. Given that an upper triangular matrix (UTM) is
(4) The error and the residue are always equal. invertible if and only if all its diagonal elements
NET June-2011 are different from zero, consider the linear
3. Consider the interpolation data given below system.
x 1 12 3 2 x1 + 3x2 − x3 = 5
y 3 -10 2 4 x1 + 4 x2 − 3 x3 = 3 …(1)
The interpolating polynomial corresponding to −2 x1 + 3 x2 − x3 = 1
this data is given by Then system (1)
 1 (1) Can be transformed into an UTM but is not
(1) p ( x ) = −3  x −  ( x − 3) − 8 ( x − 1)( x − 3)
 2 invertible because the diagonal entries of
the UTM are not different from zero.
( x − 1)  x − 
2 1
5  2 (2) Is invertible though cannot be transformed
into a UTM.
−53
( x −1)  x − 
1
(2) q ( x ) = 3 + 26 ( x − 1) + (3) Can be transformed into an UTM because
5  2 above diagonal entries are all different from
−53 2 419 −283
(3) r ( x ) = x + x+ zero.
5 10 10

Dr. Ashutosh Sharma Dr. Onkar Singh Bhati 1|Page

Innovative Institute of Mathematics, Ground Floor Krishna Tower, Gopalpura Mod, Near Big Bazaar, Jaipur (Raj.)
Mob. : 7792988108, 8696149555
 Innovative Institute of Mathematics, Jaipur
(4) Can be transformed into a UTM and the and L3 polynomial, then L1 , L2 and L3 are
solution of the UTM is the solution of (1). uniquely determined.
NET Jun.2012 (3) If p is written in the form
6. Let f be a continuous map from the interval L1 ( t ) + e1 2 L2 (t ) + eL3 (t ) ,then one of L1 , L2
0,1 into itself and consider the iteration or L3 must be linear.
xn+1 = f ( xn ) .Which of the following maps will (4) The polynomial p is uniquely determined.
yield a fixed point for f ? NET Dec.2012
(1) f ( x ) = x2 4 9. If the points x1 , x2 ,...xn are distinct , then for
(2) f ( x ) = x2 8 arbitrary real values y1 , y2 ..., yn the degree of
(3) f ( x ) = x2 16 the unique interpolating polynomial p ( x ) such
(4) f ( x ) = x2 32 NET Dec. 2012 that p ( xi ) = yi (1  i  n ) is
7. Let f (u ) = u3 − u −1 . (1) n
(2) n −1
( )
(1) Starting with the initial guess u = 1.5 ,
0
(3)  n −1
the fixed point iterates of the equation (4)  n Jun-2013
u = g ( u ) , where g ( u ) = u3 − 1Converge. [Link] a sufficiently smooth function f ( x ) .
( )
Starting with the initial guess u = 1.5
0
(2) A formula for estimating its derivativeis is given
df 1
the fixed point iterates of the equation by =  f ( x + 2h ) − f ( x − 2h )  + error
u = g (u ) , dx 4h 
term where h  0. Let f ( ) denote the nth
n
where g ( u ) = 1 + u 3 converge.
derivative of f and let  be a point between
(3) If u is a root of the equation f ( u ) = 0

x − 2h and x + 2h . Which of the following

and u   1 ,then u is a stable fixed point of expressions for the error term are correct?
the equation u = g ( u ) . − f 2 ( ) h 2 −2 f 3 ( ) h2
(1) (2)
(4) f ( u ) = 0 has root between 1 and 2. 2 3
− f ( ) h 4
4
NET Dec. 2012 (3) − f ( ) h
1
(4)
8. To compute the value of e in the interval 0,1
t 12
NET Jun-2013
, pick t1 = 0 , t2 = 0.5 , t3 = 1 . Let p be the
11.. A Runge-Kutta method for numerically solving
quadratic polynomial that interpolates et , that the initial value ordinary differential equation
is, p ( ti ) = eti , i = 1, 2,3 Then y = f ( x, y ) ; y ( x0 ) = y0 is given by (for h
(1) The polynomial p can be written in the small) y ( x + h ) = y ( x ) + w1F1 ( x, y ) + w2 F2 ( x, y )
form L1 ( t ) + e L2 (t ) + eL3 (t ) for some
12
F1 ( x, y ) = hf ( x, y )
choice of quadratic polynomials L1 , L2 , L3 . F2 ( x, y ) = hf ( x +  h, y +  F1 )
(2) If the polynomial p can be written in the The objective is to determine the constants
form L1 ( t ) + e1 2 L2 (t ) + eL3 (t ) where L1 , L2 w1 , w2 ,  and  such that the above formula is
accurate to order2 (that is, the error term is

Dr. Ashutosh Sharma Dr. Onkar Singh Bhati 2|Page

Innovative Institute of Mathematics, Ground Floor Krishna Tower, Gopalpura Mod, Near Big Bazaar, Jaipur (Raj.)
Mob. : 7792988108, 8696149555
 Innovative Institute of Mathematics, Jaipur
O ( h3 ) ). Which of the following are correct sets f −f h3
(2) f 0 = 1 −1 − f  ( )
of values for these constants? h 3
1 1 f −f h2
(1) w1 = , w2 = ;  = 1,  = 1 (3) f 0 = 1 −1 − f  ( )
2 2 h 6
(2) w1 = 2, w2 = 1;  = 1 2,  = 1 2 f1 − f −1 h3

(4) f 0 = + f  ( )
1 2 3 3 2h 6
(3) w1 = , w2 = ; = ,  =
3 3 4 4 NET Dec. 2013
3 1 [Link] f ( x ) = ax + b for a, b . Then the
(4) w1 = , w2 = ;  = 2,  = 2
4 4 iteration xn+1 = f ( xn ) starting from any given
(NET Jun_2013)
x0 for n  0 converges.
[Link] f ( x ) = e be approximated by Taylor’s
x

(1) for all a (2) for no a

polynomial of degree n at the point x =1 2 (3) for a0,1 (4) only for a = 0
and on the entire interval 0,1 . If the absolute
NET Jun-2014
error in this approximation does not exceed [Link] the function f ( x ) = 2 + x for
10−2 , then the value of n should be taken as ?
(1) 0 (2) 1 x  −2 and the iteration xn+1 = f ( xn ) ; n  0 ;
(3) 2 (4) 3 NET Dec. 2013 for x0 = 1 . Which are the possible limits of the
[Link] a partition of the interval 0,1 by iteration?
points of subdivision 0 = x0 , x1...xn = 1 with (1) 2 + 2 + 2 + ... (2) -1
each subinterval of length h . Let mi be the (3) 2 (4) 1
midpoint of the i th sub-interval  xi −1 , xi  and NET Jun- 2014
f  2 (0,1) . Then an error bound for the 1 2
[Link] the iteration xn+1 =  xn +  , n  0
n 2 xn 
f ( x ) dx   f ( mi ) h is
1
quadrature rule  0
i =1
for a given x0  0 . Then

h2 h3 (1) xn converges to 2 with rate of

(1) f  max (2) f  max
2 6 convergence 1
h2 h4 (2) xn converges to 2 with rate of
(3) f  max (4) f 
24 max
24 convergence 2.
NET Dec. 2013 (3)The given iteration is the fixed point
f 3
( x , x1 ) iteration for f ( x ) = x2 − 2 .
[Link] −1
where x−1 = x0 − h ,
(4)The given iteration is the Newton’s method
x1 = x0 + h with h  0, f ( x0 ) = f0 , for f ( x ) = x2 − 2 . NET Jun- 2014
f ( xj ) = f j →
for j = −1,1 and f  ( x0 ) = f0 . [Link] f : be a smooth function with
Then for some  ( x−1, x1 ) we have non-vanishing derivative. The Newton’s
method for finding a root of f ( x ) = 0 is the
f − f h2
(1) f 0 = 1 0 − f  ( ) same as
h 2

Dr. Ashutosh Sharma Dr. Onkar Singh Bhati 3|Page

Innovative Institute of Mathematics, Ground Floor Krishna Tower, Gopalpura Mod, Near Big Bazaar, Jaipur (Raj.)
Mob. : 7792988108, 8696149555
 Innovative Institute of Mathematics, Jaipur
(1) Fixed point iteration for the map 3
(3) Simpson’s th Rule
g ( x) = x − f ( x) f  ( x) 8
(2) Forward Euler method with Unit step (4) Gauss- Legendre 2 point formula
length for the differential equation (NET Jun- 2015)
dy f ( y ) [Link] f ( x ) = ax + 100 for a  . Then the
+ =0
dx f  ( y ) iteration xn+1 = f ( xn ) for n  0 and x0 = 0
(3)fixed point iteration for g ( x) = x + f ( x) converges for
(4) fixed point iteration for g ( x ) = x − f ( x ) (1) a = 5 (2) a = 1
(3) a = 0.1 (4) a = 10
NET DEC. 2014
NET Dec. 2015
[Link] of the following approximations for
1 2
estimating the derivative of a smooth function [Link] iteration xn+1 =  xn +  , n  0 for a
f at a point x is of order 2 .(i.e the error term 2 xn 

is O ( h2 ) ) given x0  0 is an instance of

f ( x + h) − f ( x)
(1) fixed point iteration for f ( x ) = x2 − 2
(1) f  ( x ) = (2) Newton’s method for f ( x ) = x2 − 2
h
f ( x + h) − f ( x − h) x2 + 2
(2) f  ( x ) = (3) fixed point iteration for f ( x ) =
2h 2x
3 f ( x ) − 4 f ( x − h ) + f ( x − 2h ) (4) Newton’s method for f ( x ) = x + 2
2

(3) f  ( x ) =
2h NET Dec. 2015
−3 f ( x ) + 4 f ( x + h ) + f ( x + 2h ) [Link] f ( x ) = x + 3 for x  −3 . Consider the
(4) f  ( x ) =
2h iteration xn+1 = f ( xn ) , x0 = 0 ; n  0 The
[Link] y (t ) satisfy the differential equation possible limits of the iteration are
y =  y , y ( 0) = 1 . Then the backward Euler (1) -1 (2) 3
yn − yn −1 3 + 3 + 3 + ...
Method, for n  1 and h  0 =  yn ; (3) 0 (4)
h NET Dec. 2015
y0 = 1 yields 25..Let f ( x ) = x + 2x + 1 and the derivative of f
2

(1) a first order approximation to e nh

at x = 1is approximated by using the central-
(2) a polynomial approximation to e nh
f (1 + h ) − f (1 − h )
(3) a rational function approximation to e nh difference formula f  (1) 
(4) a Chebyshev polynomial approximation to 2h
1
e nh NET Dec. 2014 with h = . Then the absolute value of the
2
[Link] following numerical integration formula is
exact for all polynomials of degree less than or error in the approximation of f  (1) is equal to
equal to 3. (1) 1 (2) 1 2
(1) Trapezoidal rule (3) 0 (4) 1 12
1 NET June-2016
(2) Simpson’s rd Rule
3

Dr. Ashutosh Sharma Dr. Onkar Singh Bhati 4|Page

Innovative Institute of Mathematics, Ground Floor Krishna Tower, Gopalpura Mod, Near Big Bazaar, Jaipur (Raj.)
Mob. : 7792988108, 8696149555
 Innovative Institute of Mathematics, Jaipur
[Link] H ( x ) be the cubic Hermite interpolation of (2) The composite midpoint rule with three
equal subintervals is exact
f ( x ) = x4 + 1 on the interval I = 0,1 (3) The composite trapezoid rule with four
interpolating at x = 0 and x = 1. Then equal subintervals is exact.
1
(1) max xI f ( x ) − H ( x ) = (4) The composite midpoint rule with four
16 equal subintervals is exact.
(2) The maximum of f ( x ) − H ( x ) is attained NET June- 2016
1 [Link] values of  and  , such that
at x = 
2  x2 a 
xn +1 =  xn  3 − n  +  xn 1 + 2  has 3rd
1
(3) max xI f ( x ) − H ( x ) =  a   xn 
21 order convergence to a are:
(4) The maximum of f ( x ) − H ( x ) is attained 3 1 1 3
(1)  = ,  = (2)  = ,  =
1 8 8 8 8
at x = . NET June-2016
4 2 2 1 3
(3)  = ,  = (4)  = ,  =
[Link] the Runge-Kutta method of the form 8 8 4 4
yn +1 = yn + ak1 + bk2 , k1 = hf ( xn , yn ) NET Dec. 2016
[Link] order of linear multi step method
k2 = hf ( xn +  h, yn +  k1 ) to approximate the
u j +1 = (1 − a ) u j + au j −1 + ( a + 3) uj +1 + ( 3a + 1) uj −1
h
solution of the initial value problem
4
y ( x ) = f ( x, y ( x ) ) , y ( x0 ) = y0 .which of the for solving u = f ( x, u ) is
following choices of a , b ,  and  yield a (1) 2 if a = −1 (2) 2 if a = −2
second order method? (3) 3 if a = −1 (4) 3 if a = −2
1 1
(1) a = , b = ,  = 1,  = 1 NET Dec-2016
2 2 [Link] magnitude of the truncation error for the
1 1 scheme
(2) a = 1, b = 1,  = ,  =
2 2 f  ( x ) = Af ( x ) + Bf ( x + h ) + Cf ( x + 2h ) is
1 3 2 2
(3) a = , b = ,  = ,  = equal to
4 4 3 3 5 3 2
3 1 (1) h2 f  ( ) if A = − , B = ,C = −
(4) a = , b = ,  = 1,  = 1 6h 2h 3h
4 4 5 3 2
NET June- 2016 (2) h2 f  ( ) if A = , B = , C = −
6h 2h 3h
[Link] f : 0,3 → be defined by 5 3 2
(3) h2 f  ( x ) If A = − , B = , C=−
f ( x ) = 1 − x − 2 ’where . denotes the 6h 2h 3h
5 3 2
absolute value. Then for the numerical (4) h2 f  ( x ) if A = ,B = ,C =
 f ( x ) dx , which of the
3 6h 2h 3h
approximation of
0 NET Jun-2017
following statements are true?
(1) The composite trapezoid rule with three
equal subintervals is exact

Dr. Ashutosh Sharma Dr. Onkar Singh Bhati 5|Page

Innovative Institute of Mathematics, Ground Floor Krishna Tower, Gopalpura Mod, Near Big Bazaar, Jaipur (Raj.)
Mob. : 7792988108, 8696149555
 Innovative Institute of Mathematics, Jaipur
[Link] a differentiable function f : → define (3)
en
converges to 0 as n →  for all b  3
the difference quotient e
f ( x + h) − f ( x) and any 0
( Dx f )( h ) = ;h  0 e
(4) n does not converge to 0 as n →  for any
h
Consider numbers of the form hˆ = h (1 + e ) for b  3 unless 0
e =0
. NET Dec.2017
a fixed e  0 and let e1 ( h ) = f  ( x ) − ( Dx f )( h ) [Link] f  0,1 and n  1 . Let
()
e2 ( h ) = ( Dx f )( h ) − ( Dx f ) hˆ 1 1 1
T ( f ) =  f ( 0 ) + f (1) +  j =1 f
n −1  j 
  be
e ( h ) = e1 ( h ) + e2 ( h ) n 2 2  n 
an approximation of the integral
( )
If f x + hˆ = f ( x + h ) , Then
I ( f ) =  f ( x ) dx . For which of the following
1

(1) e1 ( h ) → 0 as h → 0 . 0

functions f is T ( f ) = I ( f ) ?
(2) e2 ( h ) → 0 as h → 0
(1) 1 + sin 2 nx (2) 1 + cos2 nx
 f ( x)
(3) e2 ( h ) → (3) sin 2 nx (4) cos2 2 ( n + 1) x
2
as h → 0 .
(1+ ) NET Dec. 2017
(4) e ( h ) → 0 as h → 0 Net Jun. 2017 [Link] values of a, b, c such that
[Link] iterative method xn+1 = g ( xn ) for the  h 
 f ( x ) dx = h af ( 0) + bf  3  + cf ( h ) is exact
h

solution of x − x − 2 = 0 converges
2 0

quadratically in a neighborhood of the root for polynomials f of degree as high as possible

x = 2 if g ( x ) equals are
(1) x 2 − 2 (2) ( x − 2 ) − 6 3 1 3 2 1
2
(1) a = 0, b = , c = (2) a = , b = , c =
4 4 4 4 4
2 x2 + 2
(3) 1 + (4) −2 3 1 1 3
x 2x −1 (3) a = ,b = ,c = (4) a = 0, b = , c =
4 4 4 4 4
NET Dec. 2017 NET Jun-2018
[Link] the linear system Ax = b with [Link] that a non-singular matrix
2 1 − 3 A = L + D + U ,where L and U are lower and

A = 1 2 − 2  , Let x n denote the n Gauss
th
upper triangular matrices respectively with all
 −3 − 2 1 diagonal entries are zero, and D is a diagonal
Seidel iteration and en = xn − x . Let M be the matrix. Let x * be the solution of Ax = b . Then
corresponding matrix such that the Gauss-Seidel iteration method
en +1 = Men , n  0 .which of the following x( k +1) = Hx( k ) + c , k = 0,1, 2... with H  1
statements are necessarily true? converges to x * provided H is equal to
(1) − D−1 ( L + U ) (2) − ( D + L ) U
−1
(1) all eigenvalues of M have absolute value
less than 1.
(3) − D ( L + U ) (4) − ( L − D ) U
−1 −1
(2) there is an eigenvalues of M with absolute
value at least 1. NET June-2018

Dr. Ashutosh Sharma Dr. Onkar Singh Bhati 6|Page

Innovative Institute of Mathematics, Ground Floor Krishna Tower, Gopalpura Mod, Near Big Bazaar, Jaipur (Raj.)
Mob. : 7792988108, 8696149555
 Innovative Institute of Mathematics, Jaipur
[Link] forward difference operator is defined as 7 −16 1
(3) a = ,b = ,c =
U n = U n +1 − U n . Then which of the following 15 15 15
difference equations has an unbounded general 7 −16 −1
(4) a = , b = ,c = Net June-2019
solution? 15 15 15
(1) 2Un − 3Un + 2Un = 0 42. Consider the equation x 2 + ax + b = 0 which
1 has two real roots  and  . Then which of the
(2)  2U n + U n + U n = 0 following iteration scheme converges when x0
4
(3)  Un − 2Un + 2Un = 0
2 is chosen sufficiently close to  ?
ax + b
1 (1) xn+1 = − n If   
(4)  2U n +1 −  2U n = 0 NET June-2018 xn
3
[Link] f ( x ) be a polynomial of unknown degree (2) xn +1 = −
xn 2 + b
If a  1
taking the values a
b
x 0 1 2 3 (3) xn+1 = − If   
f ( x) 2 7 13 16 xn + a
xn 2 + b
All the fourth divided differences are −1 6 . (4) xn +1 = − If 2    + 
a
Then the coefficient of x 3 is
Net Jun-2019
(1) 1 3 (2) −2 3
43. Let f : 0,1 → 0,1 be twice continuously
(3) 16 (4) −1 NET Dec. 2018
differentiable function with a unique fixed
[Link] solving the following system by Jacobi
iteration scheme point f ( x* ) = x* . For a given x0  ( 0,1)
x + 2my − 2mz = 1 consider the iteration xn+1 = f ( xn ) for n  0 .
nx + y + nz = 2
If L = max x0,1 f  ( x ) then which of the
2mx + 2my + z = 1
Where m, n  . With any initial vector, the following are true?
(1) If L  1 , then xn converges to x* .
scheme converges provided m, n satisfy
(1) m + n = 3 (2) xn converges to x , provided L  1
(2) m  n (3) The error en = xn − x* satisfies en+1  L en
(3) m  n
(4) If f  ( x* ) = 0 then en+1  C en
2
for some
(4) m = n NET June.2019
41. The values of a, b, c so that the truncation error C 0 NET Dec.2018
in the formula 44. Consider a second order ordinary differential
Equation and its finite difference
f ( x ) dx = ahf ( − h ) + bhf ( 0 ) + ahf ( h )
h
−h
representation. Identify which of the following
statements is correct?
+ch2 f  ( −h ) − ch2 f  ( h ) is minimum, are
(1) The finite difference representation is
7 16 1 unique.
(1) a = , b = , c =
15 15 15 (2) The finite difference representation is
7 16 −1 unique for some ODE.
(2) a = , b = , c =
15 15 15 (3) There is no unique finite difference scheme
for the ODE.

Dr. Ashutosh Sharma Dr. Onkar Singh Bhati 7|Page

Innovative Institute of Mathematics, Ground Floor Krishna Tower, Gopalpura Mod, Near Big Bazaar, Jaipur (Raj.)
Mob. : 7792988108, 8696149555
 Innovative Institute of Mathematics, Jaipur
(4) The uniqueness of a finite difference Here U j is an approximation to u ( x j ) where
scheme can not be determined.
Net June 2012 x j = jh , j = 0,...N is a partition of 0,1 with
45. Consider the function h = 1 N for some positive integer N . Then
f ( x ) = x2 − x − 2 = 0 which of the following are true?
….(1)
(1) There exists a solution to ( BVP )h of the
Let x = g ( x ) so that any fixed point of g ( x ) is
a solution of (1). Then form U j = ar j + b for some a, b  with
x2 − x − 2 r  1 and r satisfying
(1) g ( x ) = x − , m  −a, a is a ( 2 + h) r 2 − 4r + ( 2 − h) = 0
m
possible choice where a is positive (2) U j = ( r j − 1) ( r N − 1) Where r satisfies
constant.
2 ( 2 + h) r 2 − 4r + ( 2 − h) = 0 and r  1
(2) g ( x ) = x2 − 2 , g ( x ) = 1 + are possible (3) u is monotonic in x .
x
choices. (4) U j is monotonic in j . (NET Dec. 2018)
x2 − x − 2 48. Let x =  be a solution of x 4 − 3x 2 + x − 10 = 0.
(3) g ( x ) = x − , K  0 , K  R is a
K The rate of convergence for the iterative
possible choice. method xn+1 = 10 − xn4 + 3xn2 is equal to.
2
(4) g ( x ) = x2 − 2 , g ( x ) = 1 + are the only (1)1 (2) 2
x (3) 3 (4) 4 (Net Dec. 2019)
possible choices. (Net June-2012)
49. Consider the ordinary differential equation
46. Consider the function f ( x ) = e− x and its Taylor
(ODE)
approximation g ( x ) of degree of 3. For  y ' ( x ) + y ( x ) = 0, x  0 and the following


1  y ( 0 ) = 1,
x = , g ( x ) is 
3 numerical scheme to solve the ODE
(1) Positive and less than 1.  Yn+1 − Yn−1
 + Yn−1 = 0, n  1, If 0  h  1 , then
(2) Negative and less than 2.  2h

2
(3) Positive and greater than 1. Y0 = 1, Y1 = 1.
(4) Less than 1 but greater than 0.75. which of the following statements are true?
NET Jun-2011 (1) (Yn ) →  as n → 
47. Let u ( x ) satisfy the boundary value problem
(2) (Yn ) → 0 as n → 
u + u = 0, x  ( 0,1)
 (3) (Yn ) is bounded
u ( 0 ) = 0
 (4) max | y ( nh ) − Yn |→  as T → 
u (1) = 1 nh0,T 

Consider the finite difference (Net Dec. 2019)

approximation in (BVP)
U j +1 − 2U j + U j −1 U j +1 − U j −1
 + = 0, j = 1...N − 1
 h2 2h
( BVP )h U 0 = 0
U = 1
 N


Dr. Ashutosh Sharma Dr. Onkar Singh Bhati 8|Page

Innovative Institute of Mathematics, Ground Floor Krishna Tower, Gopalpura Mod, Near Big Bazaar, Jaipur (Raj.)
Mob. : 7792988108, 8696149555
 Innovative Institute of Mathematics, Jaipur
50. The values of  , A, B, C for which the (Net Dec. 2019(P2))
quadrature formula [Link] a   ( 0,1) . consider the iteration defined
by (*) xk +1 = 1 ( xk2 +  ) , k = 0,1, 2,... The above
1
−1(1 − x ) f ( x ) dx = Af ( − ) + Bf ( 0) + Cf ( ) 2
is exact for polynomials of highest possible iteration has two distinct fixed points  1 and
degree, are.
 2 such that 0   1  1   2 . Which of the
3 5 5 8 5 5
(1)  = ,A= + , B = ,C = − following statements are true?
5 9 3 3 9 9 3 3 (1) The iteration (*) is equivalent to the
3 5 5 8 5 5
(2)  = ,A= − , B = ,C = + recurrence relation
5 9 3 3 9 9 3 3 1
xk +1 −  1 =( xk +  1 )( xk −  1 ) , k = 0,1, 2,...
3 5 3 8 5 3 2
(3)  = , A = 1 −  , B = , C = 1 + 
5 9 5 9 9 5  (2) The iteration (*) is equivalent to the
   3 recurrence relation
(4)  = 3 , A = 5 1 + 3  , B = 8 , C = 5 1 − 
9  5  9  5 
1
5 9 xk +1 −  1 = ( xk +  2 )( xk −  1 ) . k = 0,1, 2,...
2
(Net Dec. 2019)
(3) If 0  x0   2 then lim xk =  1
[Link] that a, b \ 0 and a 2  b 2 k →

(4) If − 2  x0  0 then lim xk =  1

suppose that the Gauss- Seidel method is used k →

to solve the system of equations (Net Dec. 2020)

 a b   x  1 [Link] f be an infinitely differentiable real valued
b a   y  = 1 then the set of all values of function on a bounded interval I . Take n  1
    
( a, b ) such that the method converges for interpolation points x0 , x1 ,..., xn−1 . Take n
every choice of initial vector is. additional interpolation points
xn+ j = x j +  , j = 0,1,..., n −1 where   0 is

(1) ( a, b ) | a 2  b 2  (2) ( a, b ) | a  b 
such that x0 , x1..., x2n−1 are all distinct. Let
(3) ( a, b ) | b  a  
(4) ( a, b ) | a 2 + b 2  1  p2 n −1 be the Lagrange interpolation polynomial
(Net Dec. 2019(P2)) of degree 2n − 1 with the interpolation points
[Link] the first order initial values problem x0 , x1,..., xn−1 for the function f . Let q2 n−1 be
y ' ( x ) = − y ( x ) , x  0, y ( 0) = 1 and the the Hermite interpolation polynomial of degree
corresponding numerical scheme 2n − 1 with the interpolation points
y −y  y −y 
4  n+1 n−1  − 3  n+1 n  = − yn with
x0 , x1,..., xn−1 for the function f . In the
 2n   n   → 0 Limit the quantity
−h
y0 = 1, y1 = e , where h is the step size. Then sup p2 n −1 ( x ) − q2 n −1 ( x ) ?
x1
which of the following statements are true?
(1) does not necessarily converge
(1) The order of the scheme is 1
1
(2) The order of the scheme is 2 (2) converges to
2n
(3) yn − y ( nh ) →  as n →  (3) converges to 0
(4) yn − y ( nh ) → 0 as n → 

Dr. Ashutosh Sharma Dr. Onkar Singh Bhati 9|Page

Innovative Institute of Mathematics, Ground Floor Krishna Tower, Gopalpura Mod, Near Big Bazaar, Jaipur (Raj.)
Mob. : 7792988108, 8696149555
 Innovative Institute of Mathematics, Jaipur
1 (3) The integration formula is exact for
(4) converges to (Net Dec. 2020)
2n + 1 polynomials of the form a + bx + cx 2 + dx3 for
[Link] the function f : 0,1 → defined by all a, b, c, d 
(4) The integration formula is exaxt for
    1   1 


 − 1+ log
   2  x    polynomials of the form a + bx + cx3 + dx 4 for
f ( x ) = 2  
for x  ( 0,1 all a, b, c, d  (Net Dec. 2020 (P2))


 0 for x = 0 [Link] a, b, c, be such that quadrature rule
Where   ( 0,  ) is a parameter. Consider the −1 f ( x ) dx = af ( −1) + bf ' ( 0) + cf ' (1) is exact
1

iterations xk +1 = f ( xk ) , k = 0,1,...; x0  0. which for all polynomials of degree less than or equal
to 2. Then a + b + c equal to
of the following statements are true about the
(1) 4 (2)3
iteration ?
(3)2 (4) 1 (NET June. 2021)
(1) For  = 1 the sequence xk  converges to 0
[Link] the Euler method for integration of
linearly with asymptotia rate of convergence the system of differential equations
x = − y , y = x Assume that ( x nj , y nj ) are the
log10 2
(2) for   1 the sequence ( xk ) does not
points obtained for i = 0,1,..., n 2 using a time-
converge to 0 step h = 1/ n starting at the initial point
(3) for   ( 0,1) the sequence xk  converges
( x0 , y0 ) = (1,0) . Which of the following
to 0 sub linearly statements are true?
(4) for   ( 0,1) , the sequence xk  converges
(1)The points ( xin , yin ) lie on a circle of radius 1
to 0 super linearly (Net Dec. 2020)
[Link] the newton – raphosn method applied (2) lim ( xnn , ynn ) = ( cos (1) ,sin (1) )
n→

to approximate the square root of a positive (3) lim ( x2n , y2n ) = (1,0 )
number  . A recursion relation for the error n→

(4) ( xin ) + ( yin )  1, i  1

2 2
en = xn −  is given by ? (NET June. 2021)

1  1  [Link] A be the following invertible matrix with

(1) en +1 =  en +  (2) en +1 =  en −  1 2 
2 en  2 en  real positive entries: A =   . Let G be the
1 en2 en2 8 9 
(3) en +1 = (4) en+1 = associated Gauss – Seidel iteration matrix.
2 en +  en + 2 
What are two eigenvalues of G?
(Net Dec. 2020 (P2)) (1) 0 and 4/3 (2) 0 and -4/3
57. −1 g ( x ) dx  g ( ) + g ( − ) where  = ( 0.2 )
1 1/4
(3) 0 and 16/9 (4) 4/3 and -4/3
(NET June. 2022)
which of the following statements are true?
(1) The integration formula is exact for
polynomials of the form a + bx for all a, b 
(2) The integration formula is exact for
polynomials of the form a + bx + cx 2 for all
a, b, c 

Dr. Ashutosh Sharma Dr. Onkar Singh Bhati 10 | P a g e

Innovative Institute of Mathematics, Ground Floor Krishna Tower, Gopalpura Mod, Near Big Bazaar, Jaipur (Raj.)
Mob. : 7792988108, 8696149555
 Innovative Institute of Mathematics, Jaipur
1+ 5 1− 5 p (1) = F1 , p (3) = F3 , p (5) = F5 which of the
[Link]  = and  = . Define a
2 2 following statements are TRUE?
sequence of numbers Fn as follows: (1) Fn = Fn −1 + Fn − 2 for n  3
n − n (2) p ( 7 ) = 13
Fn = for n = 1, 2,.... Let p : → be
 − (3) Fn = Fn −1 + 2 Fn − 2 for n  5
a polynomial of degree at most 2 such that (4) p ( 7 ) = 10 (NET June. 2022)

Answer’s Key
1. 2,3 13. 3 26. 1,2 39. 1 52. *
2. 2,3 14. 3 27. 1,3 40. 4 53. 1,3,4
3. 1,2,3 15. 3 28. 1,2 41. 1 54. 3
4. 1,4 16. 1,3 29. 2 42. 1,3,4 55. 1,3
5. 3,4 17. 2,4 30. 2,3 43. 1,3,4 56. 3
6. 1,2,3,4 18. 1,2 31. 1 44. 3 57. 1,4
7. 4 19. 2,3,4 32. 1,3 45. 2,3 58. 1
8. 1,2,4 20. 1,3 33. 4 46. 1 59. 2,3,4
9. 3 21. 2,3,4 34. 2,4 47. 1,2,3,4 60.
10. 2 22. 3 35. 1,4 48. 1 61.
11. 1,3,4 23. 2,3 36. 1 49. 2,3
12. 4 24. 4 37. 2 50. 1,4
25. 3 38. 1,3,4 51. *

Dr. Ashutosh Sharma Dr. Onkar Singh Bhati 11 | P a g e

Innovative Institute of Mathematics, Ground Floor Krishna Tower, Gopalpura Mod, Near Big Bazaar, Jaipur (Raj.)
Mob. : 7792988108, 8696149555