2- MARK QUESTIONS AND ANSWER

Unit-II Design of experiment

1. What do you understand by “Design of an experiment”?

The design of an experiment may be defined as the logical construction of the
experiment in which the degree of uncertainty with which the inference is drawn
may be well defined.
2. What are the three essential steps to plan an experiment?
(or) What are the basic principles of the design of experiment?
1. Randomization, 2. Replication 3. Local control (error control)
3. Define replication. (or) Describe Replication and what are the advantages of replication?
Replication means „the repetition of the treatments under investigation‟. An
experimenter resorts to replication, in order to average out the influence or the change
factors on different experimental units. Thus, the repletion of treatments results in
more reliable estimate than is possible with a single observation. The following are the
chief advantages of replication

4. Define Analysis of variance.

According to R.A. Fisher, Analysis of variance (ANOVA) is the „separation of variance
ascribable to one group of causes from the variance ascribable to other group‟.
5. What is the assumption in analysis of variance?
1. The samples are drawn from normal population.
2. The variances for the population from which samples have been drawn are equal.
3. The variation of each value around its own grant mean should be independent for
each value.
6. What are the basic steps in ANOVA?
1. One estimate of the population variance from the variance among the sample means.
2. Determine a second estimate of the population variance from the variance within the
sample.
3. Compare these two estimates, if they are approximately equal in value, accept the
null hypothesis.
6. State the uses of ANOVA.
7. Write down the ANOVA table for One-way classification.
 Source of Sum of Degrees of Mean sum Table
Variance ratio
Variation squares freedom of squares Value
Between SSC MSC
SSC C-1 MSC = F=
columns C 1 MSE F C  1, N  C 
Within SSE (or) (or)
SSE N-C MSE=
Columns N C F=
MSE F N  C , C  1
Total TSS N-1 MSC

8. Write the ANOVA table for randomized block design.

Source Degrees
Sum of Mean sum Table
of of Variance ratio
squares of squares Value
Variation freedom
Between SSC  C  1, N  C  R  1
SSC C-1 MSC =  
columns C 1 MSC MSE FC 
Fc  (or) or 
Between SSR MSE MSC  N  C  R  1, C  1
SSR R-1 MSR =  
row R 1
SSE
Error SSE N-C-R+1 MSE=  R  1, N  C  R  1
N  C  R 1 FR 
MSR
(or)
MSE  
MSE MSR FR  or 
Total TSS N-1  N  C  R  1, R  1
 

9. Write the ANOVA table for Latin square.

Degrees
Source of Sum of Mean sum Table
of Variance ratio
Variation squares of squares Value
freedom
 K  1, K  1K  2
Between SSC MSC MSE  
SSC K-1 MSC = Fc  (or) FC  or 
columns K 1 MSE MSC  K  1K  2, K  1
 

FR 
MSR
(or)
MSE  K  1, K  1K  2
Between SSR  
SSR K-1 MSR = MSE MSR FR  or 
row K 1  K  1K  2, K  1
 
 MST
(or)
MSE  K  1, K  1K  2
Between SSK FT  
SST K-1 MST = MSE MST FT  or 
Treatment K 1  K  1K  2, K  1
 
SSE
Error SSE (K-1)(K-2) MSE=
K  1K  2
Total TSS K2-1

10. Write the difference between RBD and LSD

Sol.:-
S.
LDS RBD
No.
1. It is suitable for small number of No such restriction suitable for upto
treatments, between 5 and 12 24 treatments
2. The number of rows and columns are There is no such restriction. It can
equal and hence the number of have any number of replication and
replication is equal to the number of treatments.
treatment.
3. Experimental error is reduced to a Variation is control in one direction
large extent, because variation is only.
control in two directions.
4. Experimental area must be a square. Suitable, it is rectangle or square.

UNIT – III Solution of equations and Eigen value problems

1. What is the condition for applying the fixed point iteration method approximation
method? In find the real root of the equation x = g(x). (or)
If g(x) is the continuous in [a,b], then under what condition of the iterative method
x-g(x) has a unique solution in [a,b]? (or)
Write sufficient condition for convergence of an iterative method for f(x)=0 written
as x=g(x).
The condition for convergence is that in the neighborhood of the root g  x   1 .
2. State the order of convergence and convergence condition for Newton’s Raphson
method.
The order of convergence is 2.
Condition for convergence is f  x  f  x   f  x  .
2

3. What is the criterion for the convergence in Newton’s Raphson method?

(i) f(x0) should not be equal to zero. If f`(x0)=0 then the initial approximation is
changed.
(ii) For better convergence the product f(x0)f``(x0) should be positive.

4. Write the iterative formula of Newton Raphson method.

f  xn 
xn1  xn  , n= 0,1,2,….
f xn 
5. Show that the N.R formula to find N can be expressed in the form
1 N
xn1   xn   , n=0, 1, 2, … (OR) Find N.R formula to find N , N is a
2 xn 
positive integer.
Let x = N , then x 2  N
Let f x   x 2  N , then f x   2 x
f  xn 
N.R formula is xn1  xn  , n= 0,1,2,….
f xn 

xn1  xn 
2

2

 2

xn  N 2 xn  x 2  N 2 xn  xn  N xn  N 1  xn
2

2
 
2
N
 
2 xn 2 xn 2 xn 2 xn 2  xn xn 
1 N
xn1   xn   , n = 0,1,2,….
2 xn 

6. What are the merits of Newton’s Raphson of iteration?

1. Newton‟s method is successfully used to improve the result obtained by other
method.
2. It is applicable to the solution of equation involving algebraical function as well as
transcendental function.

7. Explain the term ‘Pivot element’.

 a11 a12 .... a1n b1 
a a 22 .... a 2 n b2 
 21
In an Augmented matrix  ... .... ... ... ...  . The element a11, a22, …. ann which
 
 ... ... ... ... ... 
 a n1 an 2 ..... a nn bn 
have been assumed to be non-zero are called pivot elements.

8. Write the procedure involved in Gauss elimination method and Gauss Jordan method.
In Gauss elimination method starting with the augmented matrix of the system,
using elementary row operation, we transform the co-efficient matrix into upper
triangular matrix. By back substitution we get the solution
In Gauss Jordan method starting with the augmented matrix of the system, using
elementary row operation, we transform the co-efficient matrix into diagonal (or) unit
matrix. By direct substitution we get the solution.

9. Compare Gauss elimination and Gauss Jordan method.

Gauss elimination method Gauss Jordand method
1 Direct method Direct method
2 Coefficient matrix is transformed into Coefficient matrix is transformed
upper triangular matrix into diagonal or unit matrix
3 We obtain the solution by back No need to back substitution
 substitution method
4 Less number of multiplication are More number of multiplication are
required compared to Gauss-Jordan required to Gauss-elimination
method. method

10. Compare Gauss elimination and Gauss Seidel method.

Gauss elimination method Gauss-Seidel method

1 Direct method Indirect method
2 It gives the exact solution in finite Successive approximation get the
number of steps solution
3 It woks on the basis of elimination of It employs initial values and iteraties
variables to obtain refined estimation

11. Compare Gauss-Jacobi method and Gauss-Seidel method.

Gauss-Jacobi method Gauss-Seidel method

1 Indirect method Indirect method
2 Convergence rate is slow Convergence rate is fast
3 Condition for convergence is the co- Condition for convergence is the co-
efficient matrix is diagonally dominant. efficient matrix is diagonally
dominant.

Compare Direct method and Indirect method.

Direct method Indirect method
1 We get exact solution Approximation soultion
2 Simple take less time Time consuming, labourious
3 Direct method performance is affected There is no round off error problem
due to round off errors

12. Which of the iterative method for solving linear system of equations converge
faster? Why?
Gauss Seidel method is solving for linear system of equations converge faster to the
method the rate of convergence is roughly twice as fast as that of Gauss-Jacobi‟s
method.

Unit-IV Interpolation, Numerical Differentiation and Numerical Integration

1. What do you meant by an interpolation?

The process of finding the value of the function inside the given range is called
Interpolation
2. State Lagrange’s interpolation Formula.
Let y = f(x) be a function which takes the values y0 , y1......, yn corresponding to
x  x0 , x1......, xn . Then, Lagrange‟s interpolation formula is
 y  f x  
x  x1 x  x2 ...x  x n  y  x  x0 x  x2 ...x  x n  y
x0  x1 x0  x2 ...x0  xn  9 x1  x0 x1  x2 ...x1  xn  1
 ..............................................
x  x0 x  x1 ...x  x n1  y
xn  x0 xn  x2 ...xn  xn1  n
3. What is the Lagrange’s formula to find y, if there sets of values
x0 , y0 , x1 , y1  and x2 , y2  are given.
yx  
x  x1 x  x2  y  x  x0 x  x2  y  x  x0 x  x1  y
x0  x1 x0  x2  0 x1  x0 x1  x2  1 x2  x0 x2  x1  2

4. What advantage has Lagrange’s formula over Newton?

Lagrange‟s formula used any type of arguments, but Newton formula used equally spaced
arguments also interpolate near to beginning of table value used forward and near to end
of table value used backward formula.
5. State any two properties of divided difference.
1. The divided differences are symmetrical of all arguments.
2. The operator  is linear
3. The nth divided difference of a polynomial of nth degree is constant.

6. Give the Newton divided difference interpolation formula.

f(x) =f(x0) +(x-x0)f(x0.x1) + (x-x0) (x-x1)f(x0.x1,x2) + (x-x0) (x-x1) (x-x2)f(x0.x1,x2,x3) + …

7 State Gregory-Newton forward difference interpolation formula.

uu  1 2 uu  1u  2 3 uu  1u  2u  3 4
yu  y0  uy0   y0   y0   y0  ..
2! 3! 4!
x  x0
where u  ,
h
8. State Newton backward difference interpolation formula
vv  1 2 vv  1v  2 3 vv  1v  2v  3 4
yv  yn  vy0   yn   yn   yn  ..
2! 3! 4!
x  xn
where v  ,
h
9. When Newton’s forward interpolation formula is used?
The formula is mainly to interpolate the value of y near the beginning of a set of tabular
values and also extrapolating the values of y a start distance ahead ( to the left) of y0

10. When Newton’s backward interpolation formula is used?

The formula is mainly to interpolate the value of y near the end of a set of tabular
values and also extrapolating the values of y a start distance ahead ( to the right) of yn

11. Using Newton‟s forward interpolation formula, write the formula for the first, second
and third order derivatives upto the fourth order difference term.
 dy  1  2u  1 2 3u 2  6u  2 3 2u 3  9u 2  11u  3 4 
 = y0   yo   yo   yo  ...
 dx  h  2 6 12 
d y 1  2
2
6u  18u  11 4
2

 2  = 2  yo  u  13 yo   yo  ...
 dx  h  12 
  d3y  1 3  3 2u  3 4 
 3  = 3  yo   y0  ...
 dx  h  2 

12. Using Newton‟s backward interpolation formula, write the formula for the first, second
and third order derivatives upto the fourth order difference term.
 dy  1  2v  1 2 3v 2  6v  2 3 2v3  9v 2  11v  3 4 
  = 
 ny   y n   y n   yn  ...
 dx  h  2 6 12 
 d2y  1  2 6v 2  18v  11 4 
 2  = 2  yn  v  13 yn   yn  ...
 dx  h  12 
 d3y  1 3  3 2v  3 4 
 3  = 3  yn   yn  ...
 dx  h  2 

13. Using Newton‟s forward difference formula, write the formula for the first, second and
third order derivatives at the values x = xo upto the fourth order difference term.
 dy   dy  1 1 2 1 3 1 4 
  =   = yo   yo   yo   yo  ...
 dx  x  x0  dx u  0 h  2 3 4 
 d2y   d2y 
 2  = 2 2 yo  3 yo  4 yo  ...
1 11
 2  =
 dx  x  x0  dx u  0 h  12 
 d3y   d3y  1  3
3
3 
 3  =  3  = 3  yo  4 yo  ...
 dx  x  xo  dx u  0 h  2 

14. Using Newton‟s backward difference formula, write the formula for the first, second
and third order derivatives at the end values x = xn upto the fourth order difference
term.
 dy   dy  1 1 1 1 
  =   = yn   2 yn  3 yn   4 yn  ...
 dx  x  x n  dx v  0 h  2 3 4 
 d2y   d2y 
 2  = 2  2 yn  3 yn   4 yn  ...
1 11
 2  =
 dx  x  xn  dx  v  0 h  12 
 d3y   d3y 
 3  = 3  3 yn   4 yn  ...
3
1 3
 3  =
 dx  x  xn  dx v  0 h  2 
xn

15. State Trapezoidal rule to evaluate  f xdx .

xo
b xn

 f x dx =  f x dx = 2  y  yn   2 y1  y2  ...  yn 1 

h
o
a xo

h Sum of the first and last ordinates  

b xn

 f x dx  f x dx =
a
2  2Sum of the remaining ordinates 
xo
xn

 f xdx .
rd
16. State Simpson‟s 1 rule to evaluate
3
xo
 b xn

 f x dx =  f x dx = 3  y  yn   4 y1  y3  ...  yn 1   2 y2  y4  ...  yn  2 

h
o
a xo

b xn Sumof the first and last ordinates  

h
 f  x dx =  f x dx =
  4Sumof the remaining odd ordinates  
3
a xo
 2Sumof the remaining even ordinates

xn

17. State Simpson‟s three-eight rules to evaluate  f xdx .

xo
b xn

 f x dx =  f x dx =
3h
 yo  yn   3 y1  y2  y4  y5...  yn 1   2 y3  y6  ...  yn 3 
a xo 8

b xn Sumof the first and last ordinates  

3h 
 f  x dx =  f x dx =
  3Sumof the remaining ordinates except multiple of 3
8
a xo
 2Sumof the remaining multiple of three ordinates 

Degree No. of
Rule Error Order
of y(x) Intervals

Trapezoidal One any E

b  a h2 M h2
12
Simpson‟s 1/3 Two even E
b  a h4 M h4
180
3
Simpson‟s 3/8 Three Multiple of 3 E  h5 h5
8
18. Compare Trapezoidal rule and Simpson‟s 1/3 rule for evaluating numerical integeation.

Trapezoidal ruel Simpson’s 1/3 rule

1. Any number of intervals Even number of intervals
2. Degree of y(x) is one Degree of y(x) is two
3.
Error is E 
b  a h2 M Error is E 
b  a h4 M
12 180
2 4
4. Order h Order h
5. It is approximated by trapezoids It is approximated by set of parabolas

19. State the formula for Trapezoidal rule for double integral
d b Sumof the values of f at the four courners  
hk 
I=  f  x, y dxdy =
  2Sumof the values of f at the remaining nodes on the boundary
4
c a
 4Sumof the values of f at the int erier nodes 
20. State the formula for Simpson‟s 1/3 rule for double integeral

d b

  f x, y dxdy =
hk
I = [(Sum of the value of f at four corners) +
c a 9
2(Sum of the values of f at the odd positions on the boundary
except the corners) + 4(Sum of the values of f at the even
 positions on the boundary) + { 4(Sum of the values of f at the
odd positions) + 8(Sum of the values of f at the even positions)
on the odd rows of the matrix except boundary rows} + { 8(Sum
of the values of f at the odd positions) + 16(Sum of the values
of f at the even positions) on the even rows of the matrix}]

UNIT-V NUMERICAL SOLUTION OF ORDINARY DIFFERENTIAL EQUATIONS

1. State the disadvantage of Taylor’s series method.

Sol.:-

 f x, y  , the function f x, y  may have the complicated

dy
In the differential equation
dx
algebraical structure. Then, the evaluation of higher order derivatives may become
tedious. This is the disadvantage of this method.

2. Write Taylor‟s formula to solve y  f x, y  , with y(xo) = yo.

Sol.:-
h , h2 h3 h 4 iv
y1  yo  yo  yo  yo  yo  ...
1! 2! 3! 4!
(OR)
y  yo 
 x  xo  , x  xo 
y 
2
y 
 x  xo 
3
y 
 x  xo 
4
yoiv  ... s
o o o
1! 2! 3! 4!

dy
3. Find y(0.1) if  1  y , y(0) = 1, using Taylor’s series method.
dx
Sol.:-
Given xo = 0 yo = 1, h = 0.1
y' = 1 + y  y‟o = 1 + yo = 1 + 1 = 2
y” = y‟  y”o = y‟o = 2
y‟‟‟ = y”  y”‟o = y”o = 2
iv
y = y”‟  yivo = y”‟o =2
By Taylor‟s series formula
h , h2 h3 h 4 iv
y1  yo  yo  yo  yo  yo  ...
1! 2! 3! 4!

y0.1  y1  1 
0.1
2
0.1 2  0.1 2  0.1 2  ...
2 3 4

1 2 6 24
y(0.1) = y1 = 1.2103

 f x, y  , with y(xo) = yo.

dy
4. Write down Euler’s algorithm to the differential equation
dx
Sol.:-
yn 1  yn  h f  xn , yn  When n = 0, 1, 2, …
i.e., y1 = yo + h f(xo, yo)

5. Find y(0.2) for the equation y’= y + ex, given that y(0) = 0 by using Euler’s method.
 Sol.:-
Given f(x, y) = y + e x ,xo = 0 yo = 0, h = 0.2
By Euler‟s formula
y1 = yo + h f(xo, yo)
y(0.2) = y1 = 0 + (0,2) f(0, 0)
= 0 + 0.2 [0 + e0]
= 0.2
i.e., y(0.2) = 0.2

6. State modified Euler’s algorithm to solve y’ = f(x, y), y(xo) = yo at

x = xo+h
Sol.:-
 
ym1  ym  hf  xm  , ym  f xm , ym  , m = 0, 1,2, …
h h
 2 2 
 
y1  yo  hf  xo  , yo  f xo , yo 
h h
 2 2 
dy
7. Write down the Runge-Kutta formula of fourth order to solve = f(x, y) with
dx
y(xo) = yo.
Sol.:-
Let h denote the interval between equidistant values of x, if the initial values are (xo, yo),
the first increment in y is computed from the formulas.
k1  hf xo , yo 
 h k 
k 2  hf  xo  , yo  1 
 2 2
 h k 
k3  hf  xo  , yo  2 
 2 2
k 4  hf xo  h, yo  k3 

and y  k1  2k2  2k3  k4 

1
6
Then, x1 = xo + h, y1 = yo + y
The increment in y in the second interval is computed in the similar manner using the
same four formulas, using the values x1, y1 in the place of xo, yo respectively.

8. State which is better, Taylor’s method or R.K method? Why? (or)

What is the advantage of R.K method over Taylor’s series method? (or)
State the special advantage of R.K method over Taylor’s method. (or)
Why in Runge-kutta method preferred to Taylor series method.
Sol.:-
R.K methods do not require prior calculation of higher derivatives of y(x) as the Taylor
method does.
Since, the differential equations using in applications often complicated, the calculation
of derivatives may be difficult.
Also the R-K formula involves the computation of f(x, y) at various positions, instead of
derivatives and this function occurs in the given equation.
  f1 x, y, z  and
dy
9. Write down the Runge-Kutta formula of fourth order to solve
dx
 f 2 x, y, z  with y  xo   yo , z xo   zo .
dz
dx
Sol.:-
k1  hf1 xo , yo , zo  l1  hf2 xo , yo , zo 
 h k l   h k l 
k2  hf1  xo  , yo  1 , zo  1  l2  hf2  xo  , yo  1 , zo  1 
 2 2 2  2 2 2
 h k l   h k l 
k3  hf1  xo  , yo  2 , zo  2  l3  hf2  xo  , yo  2 , zo  2 
 2 2 2  2 2 2
k4  hf1 xo  h, yo  k3 , zo  l3  l4  hf2 xo  h, yo  k3 , zo  l3 

y  k1  2k2  2k3  k4  z  l1  2l2  2l3  l4 

1 1
6 6
y1  yo  y z1  zo  z

10. Write Milne‟s predictor and corrector formula.

Sol.:-
Milne‟s predictor formula is

yn 1, p  yn 3 
4h
 2 yn  2  yn 1  2 yn 
3
 yo   2 y1  y2  2 y3 
4h
i.e., y4, p
3

Milne‟s corrector formula is

yn 1,c  yn 1 
h
 yn 1  4 yn  yn 1 
3
 y2   y2  4 y3  y4 
h
i.e., y4, c
3

11. Write Adams-Bash forth predictor and corrector formula.

Sol.:-
Adams-Bash forth predictor formula is

yn 1, p  yn 
h
 55 yn  59 yn 1  37 yn 2  9 yn 3 
24
 y3   55 y3  59 y2  37 y1  9 y0 
h
i.e., y4, p
24
Adams-Bash forth corrector formula is

yn 1,c  yn 
h
 9 yn 1  19 yn  5 yn 2  yn2 
24
 y3   9 y4  19 y3  5 y2  y1 
h
i.e., y4, c
24