BE Computer Engineering (Pokhara University) Numerical Methods (PU, MTH 252) Question Paper 2078
This is the official BE Computer Engineering (Pokhara University) Numerical Methods (PU, MTH 252) question paper for 2078, as set in the regular annual examination. It carries 100 full marks and a time allowance of 180 minutes, across 11 questions. On Kekkei you can attempt this Numerical Methods (PU, MTH 252) past paper online with a timer, get instant AI feedback and step-by-step solutions, and track the topics where you lose marks — completely free. Whether you are revising for your BE Computer Engineering (Pokhara University) Numerical Methods (PU, MTH 252) exam or solving previous years' question papers, this 2078 paper is a great way to practise under real exam conditions.
Section A: Long Answer Questions
Attempt all / any as specified.
(a) Derive the iterative formula of the Newton-Raphson method for finding a real root of the equation , and state the geometric interpretation of the method. Discuss the conditions under which the method may fail to converge. (6)
(b) A real root of the equation lies between 2 and 3. Using the Newton-Raphson method, perform three iterations starting from and obtain the root correct to four decimal places. Compare the rate of convergence with that of the bisection method. (6)
(a) Derive Newton's forward difference interpolation formula and clearly state the situation in which it should be preferred over Newton's backward difference formula. (6)
(b) The following table gives the population (in thousands) of a town in different census years:
| Year () | 1971 | 1981 | 1991 | 2001 | 2011 |
|---|---|---|---|---|---|
| Population () | 46 | 66 | 81 | 93 | 101 |
Using an appropriate interpolation formula, estimate the population of the town in the year 1976. (8)
(a) Derive the fourth-order Runge-Kutta method for solving the first-order ordinary differential equation with the initial condition . (6)
(b) Using the fourth-order Runge-Kutta method, find for the initial value problem , taking step size . Carry out two steps and retain four decimal places. (8)
(a) Explain the Gauss-Seidel iterative method for solving a system of linear equations. State the condition of diagonal dominance and explain why it guarantees convergence. (5)
(b) Solve the following system of equations using the Gauss-Seidel iterative method, performing iterations until the values are correct to three decimal places:
(7)
Section B: Short Answer Questions
Attempt all / any as specified.
Using the secant method, find a real root of the equation correct to three decimal places. Take initial approximations and , and tabulate your iterations.
Fit a curve of the form to the following data by the method of least squares and hence estimate at :
| 1 | 2 | 3 | 4 | 5 | |
|---|---|---|---|---|---|
| 1.65 | 2.70 | 4.50 | 7.35 | 12.10 |
Evaluate the integral by dividing the interval into six equal subintervals, using (a) the Trapezoidal rule and (b) Simpson's rule. Compare both results with the exact value and comment on the accuracy.
From the following table of values, find the first and second derivatives of the function at using suitable numerical differentiation formulae:
| 1.0 | 1.2 | 1.4 | 1.6 | 1.8 | |
|---|---|---|---|---|---|
| 0.000 | 0.128 | 0.544 | 1.296 | 2.432 |
(a) Distinguish between truncation error and round-off error with one example of each. (3)
(b) If and errors in are each at , compute the maximum absolute error and the maximum relative error in . (3)
Using the Modified Euler method, solve the differential equation with to find and , taking . Perform the corrector iteration until two successive values agree to four decimal places.
Using the LU (Doolittle) decomposition method, factorize the coefficient matrix and hence solve the system of equations: