WBUT Question Papers EC Numerical Methods And Programming B Tech Third Sem 201011
WBUT Question Papers EC
Numerical Methods And Programming B Tech Third Sem 201011
Time Allotted : 3 Hours
Full Marks: 70
The figures in the margin indicate full marks.
Candidates are required to give their answers in their own words
as far as practicable.
GROUPA ( Multiple Choice Type Questions )
 Choose the correct alternatives for any ten of the following: 10×1 = 10
i) The NewtonRaphson method is used to find the root of the equation x^{2} – 2 = 0. If the iteration started from – 1, the iteration will
a) converges to – 1 b) converges to V2
c) converges to – V2 d) not convergent.
x 9
ii) Consider the sequence x_{n}_{+}_{1} = — + (n a 0), x_{0} = 0 • 2
2 8x_{n}
obtained from NewtonRaphson method. The sequence converges to
a) 15 b) a/2 ■’
c) 16 d) 14.
What is the output of the following code ?
#iriclude<stdio.h>
void main ( )
{ ’ int x = 2;x = x «5; printf(“%d”,x); .
}
a) 5 b) 2
c) 32 d) none of these.
When Gauss elimination method is used to solve AX = B, A is transformed to a/an
a) null matrix
b) upper triangular matrix
c) identity matrix
d) diagonally dominant matrix.
vi) The kind of error occurs when ji approximated by 314 is
a) truncation error b)
c) inherent error d)
vii) The convergence condition for GaussSeidel iterative method for solving a system of linear equation is
a) the coefficient matrix is singular
b) the coefficient matrix has rank zero
c) the coefficient matrix must be strictly diagonally dominant
d) none of these.
viii) Recursive function may call . a) another function b) itself
c) both (a) & (b) d) none of these.
ix) Which of the following is a multistep method ?
a) Euler’s method
b) Predictorcorrector method
c) Taylor’s series method –
d) None of these.
x) The rate of convergence of the Fixed point iteration method for solving / ( x ) = 0 is
a) quadratic b) biquadratic
c) cubic d) linear.
xi) The value of x after execution of the following statements :
int x, y = 12;
x = (y<14)? (y+l):(yl);
is
/
a) 10 b) 15
c) 12 d) 13.
xii) Output of the following programme code
{ •
int a = 5, b = 3; ‘
a = a + b; b = a – b; a = a – b; printf (“a=%d, b=%d”, a, b);
}
is
a) a = 5, b = 3 b) a = 0, b = 5
c) a = 3, b = 5 d) none of these.
GROUPB (Short Answer Type Questions )
Answer any three of the following.
3 x 5 = 15
Find the inverse of the following matrix by Gauss elimination method :
2 1
3 2 1 4
a) Explain “closing a file” with the help of small programme segment in C.
b) Write a user defined recursive function to calculate factorial of n, where n is any integer number. 2 + 3
CS/B.Tech (EENEW)/SEM3/CS312/201011 5. From the following table find the polynomial / ( x ) by Newton’s divided difference interpolation formula :

5
A’ ‘ 2 2
 Using RungeKutta method to fourth order solve — = —7 *
dx y+x
with y ( 0 ) = 1 at x = 02.
GROUP C ( Long Answer Type Questions )
Answer any three of the following. 3x 15 = 45
 a) Find a real root of the equation f(x) = x^{3} 2x5 = 0
 using Regula falsi method corrrect to 3 decimal places.
b) Prove that n^{2} =1/4 (S^{2} +4), where n = mean operator and 5 = central difference operator. 7 + 8
 a) Find the value of y at x = 6 from the following data,
using Newton’s divided difference formula. 7

b) Find the values of y at x = 01 using Taylor’s series method of the third order, given that dy/dx = l/(x + y), y(0) = 2. 5
c) Write difference between Euler’s method and R.K. method. 3
 a) Prove that NewtonRaphson method has a quadratic
convergence.
b) Use Gauss elimination method to solve the following equations :
2x + y + z = 10
3x + 2y + 3z = 18
x + 4y + 9z = 16 6 + 9
 a) Evaluate f^{?}x^{2} log x dx by using Trapezoidal rule taking
J 3
rt = 4.
b) Find the missing term in the following table :
Explain why the result differs from 3^{3} = 27. > • ( 
c) Write a program in C to solve the equation
x^{3}+x^{2}+x+7 = 0 within ( – 3, – 2 ) by Bisection method.
.4+4+7
 a) Derive Simpson’s onethird rule from NewtonCote’s quadrature formula.
b) Solve the equation dy/dx^x + y with initial condition y ( 0 ) = 1*0 and h = 01, using predictorcorrector method, to find y ( 02 ).
/’
c) Write a program using recursive function to calculate the sum of all digits of any number. 6 + 5 + 4
Recent Comments