Numerical Analysis
a) (1 ) f ( x)
(i) Ef (x) (ii) f (x)
(iii) f (h) (iv) h!
b) Within the interval [a, b] , the monotone equation f ( x) 0 possesses one root if
(i) f (a) f (b) 0 (ii) f (a) f (b) 0
(iii) f (a) f (b) 0 (iv) f (a) f (b)
c) The order of convergence of Bisection method is
(i) Linear (ii) quadratic (iii) cubic (iv) biquadratic
d) The divided difference of a constant function for two unequal arguments a and b is
(i) 0 (ii) a
(iii) b (iv) undefined
e) The degree of precision of Simpson’s one-third rule is
(i) 0 (ii) 1
(iii) 2 (iv) 3
f) If f(x) is a polynomial of degree n then n f ( x)
(i) 0 (ii) n!
(iii) 2 (iv) none
g) The solution of a system of linear equation in Gauss seidel iteration method can be
obtained
if the coefficient matrix is
(i) Upper triangular (ii) lower triangular
(iii) diagonally dominant (iv) identity matrix
h) One of the methods to solve the initial value problem is
(i) Bisection method (ii) Euler method
(iii) finite difference scheme (iv) finite element method
i) The error term of Simpson’s one third rule is
h 5 iv h 5 iv
(i) f (ii) f
90 91
h 5 iv h 5 iv
(iii) f (iv) f
92 93
j) Lagrange’s interpolation is applicable if the set of arguments are
(i) equispaced (ii) un-equispaced
(ii) Both (i) and (ii) (iv) None
k) The iteration formula for Euler’s method is
h
(i) yi 1 yi hf xi , yi (ii) yi 1 yi f xi , yi
2
h
(iii) yi 1 yi hf xi , yi (iv) yi 1 yi f xi , yi
2
l) The iteration formula for Newton Raphson’s method is
f xn f ' xn
(i) xn 1 xn (ii) xn 1 xn
f ' xn f '' xn
f '' xn f xn
(iii) xn1 xn (iv) xn 1 xn
f ' xn f ' xn
dy
m) The order of the differential equation value of f ( x, y ) is
dx
(i) 0 (ii) 1
(iii) 2 (iv) undefined
m) For the system of linear equation AX=b, the solution can be obtained by performing
(ii) X Ab1 (ii) X A1b
(iii) X A1b1 (iv) X Ab
The value of x is
2 2
m)
(i) 3h2 (ii) 1
(iii) 2h2 (iv) undefined
n) The value of x is
2
(i) 0 (ii) 1
(iii) 2 (iv) 3
1
n) The value of xdx is
0
(i) 0.5 (ii) 1.5
(iii) 2.5 (iv) 3.5
1
n) The value of x3dx is
0
(i) 0.5 (ii) 1.5
(iii) 2.5 (iv) 3.5
n) The value of 1 1 is
(i) 0 (ii) 1
(iii) 2 (iv) undefined
b) (1 ) f ( x)
(ii) Ef (x) (ii) f (x)
(iii) f (h) (iv) h!
b) Within the interval [a, b] , the monotone equation f ( x) 0 possesses one root if
(ii) f (a) f (b) 0 (ii) f (a) f (b) 0
(iii) f (a) f (b) 0 (iv) f (a) f (b)
c) Lagrange’s interpolation is applicable if the set of arguments are
(iii) equispaced (ii) un-equispaced
(iv) Both (i) and (ii) (iv) None
d) The order of convergence of Newton Raphson method is
(ii) Linear (ii) quadratic
e) The divided difference of a constant function for two unequal arguments a and b is
(ii) 0 (ii) a
(iii) b (iv) undefined
f) The degree of precision of Trapezoidal rule is
(ii) 0 (ii) 1
(iii) 2 (iv) 3
g) If f(x) is a polynomial of degree n then n1 f ( x)
(ii) 0 (ii) 1
(iii) 2 (iv) 3
h) The solution of a system of linear equation in Gauss seidel iteration method can be
obtained
if thecoefficient matrix is
(ii) Upper triangular (ii) lower triangular
(iii) diagonally dominant (iv) identity matrix
i) In LU decomposition method, the significance of L is
(i) Upper triangular (ii) lower triangular
(iii) diagonally dominant (iv) identity matrix
j) One of the method to solve the initial value problem is
(i) Bisection method (ii) Euler method
(iii) finite difference scheme (iv) finite element method
k) One of the method to solve the boundary value problem is
(ii) Bisection method (ii) Euler method
(iii) finite difference scheme (iv) finite element method
l) The value of 1 1 is
(ii) 0 (ii) 1
(iii) 2 (iv) undefined
d
m) The expression of e hD D is
dx
(i) E (ii) E-1
(iii) E/2 (iv) 0
n) The order of convergence of Bisection method is
(i) Linear (ii) quadratic
o) The error term of trapezoidal rule is
h3 h3
(i) f ' ' (ii) f ' '
12 14
h3 h3
(iii) f ' ' (iv) f ' '
16 18
p) The error term of Simpson’s one third rule is
h 5 iv h 5 iv
(ii) f (ii) f
90 91
h 5 iv h 5 iv
(iii) f (iv) f
92 93