BE Computer Engineering (IOE, TU) Numerical Methods (IOE, SH 553) Question Paper 2078
This is the official BE Computer Engineering (IOE, TU) Numerical Methods (IOE, SH 553) question paper for 2078, as set in the regular annual examination. It carries 80 full marks and a time allowance of 180 minutes, across 12 questions. On Kekkei you can attempt this Numerical Methods (IOE, SH 553) 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 (IOE, TU) Numerical Methods (IOE, SH 553) 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 for the Newton-Raphson method for finding a real root of a nonlinear equation , and give a clear geometrical interpretation of the method. State two situations in which the method fails to converge. [7]
(b) A real root of the equation lies between 0 and 1. Using the Newton-Raphson method, compute the root correct to four decimal places. [5]
(a) Explain the construction of a natural cubic spline that interpolates a set of data points. Clearly state the continuity conditions imposed at the interior knots and the boundary conditions for the natural spline. [6]
(b) Using Newton's divided difference interpolation, estimate the value of from the following data:
| 0 | 1 | 2 | 4 | 5 | |
|---|---|---|---|---|---|
| 1 | 3 | 9 | 33 | 51 |
(a) Describe the Gauss elimination method with partial pivoting for solving a system of linear equations. Explain why partial pivoting is necessary and how it improves numerical stability. [6]
(b) Solve the following system of equations using the Gauss-Seidel iterative method, performing three iterations and starting with the initial guess :
[6]
(a) Derive the standard five-point finite difference formula for the Laplace equation over a rectangular region. [5]
(b) A square plate is divided into a mesh as shown, with the boundary values of specified. Set up the system of linear equations for the interior nodal values using the five-point formula, and solve for the interior values by the Gauss-Seidel (Liebmann) iteration, taking the boundary on all four edges as on the top edge and on the remaining three edges. [7]
Section B: Short Answer Questions
Attempt all / any as specified.
Find a real root of the equation correct to three decimal places using the Bisection method, taking the initial interval as . Tabulate your iterations clearly.
Evaluate the integral using Simpson's 1/3 rule with , and compare your result with the exact value. Briefly explain how the accuracy could be improved using Romberg integration.
Fit a straight line to the following data using the method of least squares:
| 1 | 2 | 3 | 4 | 5 | |
|---|---|---|---|---|---|
| 2.1 | 3.9 | 6.1 | 7.8 | 10.2 |
Hence estimate the value of when .
Derive the central difference formulae for the first and second derivatives of a function from Taylor's series expansion, and state their orders of accuracy. Using the data below, compute and :
| 1.8 | 2.0 | 2.2 | |
|---|---|---|---|
| 6.050 | 7.389 | 9.025 |
Using the fourth-order Runge-Kutta method, solve the initial value problem , with , and find taking a step size .
Using Lagrange's interpolation formula, find the value of from the following data:
| 0 | 1 | 3 | 4 | |
|---|---|---|---|---|
| -12 | 0 | 12 | 24 |
Explain the shooting method for solving a two-point boundary value problem of a second-order ordinary differential equation. How does it convert a boundary value problem into an initial value problem?
Explain the LU (Doolittle) decomposition method for solving a system of linear equations . State its main advantage over Gauss elimination when the system must be solved for several different right-hand-side vectors .