BE Computer Engineering (Pokhara University) Numerical Methods (PU, MTH 252) Question Paper 2079
This is the official BE Computer Engineering (Pokhara University) Numerical Methods (PU, MTH 252) question paper for 2079, as set in the regular annual examination. It carries 100 full marks and a time allowance of 180 minutes, across 12 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 2079 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 for the Newton-Raphson method for finding a real root of the equation , and state its order of convergence. Mention two situations in which the method fails. [6]
(b) Find a real root of the equation correct to four decimal places using the Newton-Raphson method, taking . Compare the number of iterations required with the Bisection method to achieve the same accuracy in the interval . [6]
(a) Construct Newton's divided difference table for the following data and hence estimate the value of .
| 0 | 1 | 2 | 4 | 5 | |
|---|---|---|---|---|---|
| 2 | 3 | 12 | 147 | 326 |
[7]
(b) Explain why Newton's divided difference formula is preferred over Lagrange's interpolation formula when a new data point is added to an existing set. Illustrate your answer briefly. [5]
(a) Derive the composite Simpson's rule for numerical integration and write down the expression for its error term. [6]
(b) Evaluate by taking 6 sub-intervals using (i) the Trapezoidal rule and (ii) Simpson's rule. Compare both results with the exact value and comment on the accuracy. [6]
(a) Describe the fourth-order Runge-Kutta method for solving a first-order ordinary differential equation with the initial condition , clearly writing all four slope expressions. [6]
(b) Using the fourth-order Runge-Kutta method, compute for the initial value problem , taking a step size . [6]
Section B: Short Answer Questions
Attempt all / any as specified.
Solve the following system of linear equations using Gauss elimination with partial pivoting, and explain why partial pivoting is necessary:
State the condition for convergence of the Gauss-Seidel iterative method. Apply the method to solve the following system, performing three iterations starting from :
Fit a straight line of the form to the following data using the method of least squares, and estimate when .
| 1 | 2 | 3 | 4 | 5 | |
|---|---|---|---|---|---|
| 14 | 27 | 40 | 55 | 68 |
The following table gives the value of a function . Using Newton's forward difference formula, find the first and second derivatives and at .
| 1.0 | 1.1 | 1.2 | 1.3 | 1.4 | |
|---|---|---|---|---|---|
| 7.989 | 8.403 | 8.781 | 9.129 | 9.451 |
(a) Distinguish between round-off error and truncation error with a suitable example of each. [3]
(b) The number is rounded to . Compute the absolute error, the relative error, and the percentage error. [3]
(a) Write down the iterative formula of the Secant method and explain how it differs from the Newton-Raphson method. [3]
(b) Perform two iterations of the Secant method to find a root of taking initial approximations and . [3]
Using Newton's forward difference interpolation formula, estimate the population in the year 1925 from the following census data, and state the assumption on which the formula is based.
| Year | 1911 | 1921 | 1931 | 1941 | 1951 |
|---|---|---|---|---|---|
| Population (in thousands) | 12 | 15 | 20 | 27 | 39 |
Using the Modified Euler (Heun's) method, compute and for the initial value problem with step size , iterating the corrector until two successive values agree to three decimal places.