BE Civil Engineering (IOE, TU) Numerical Methods (IOE, SH 553) Question Paper 2076 Nepal
This is the official BE Civil Engineering (IOE, TU) Numerical Methods (IOE, SH 553) question paper for 2076, as set in the regular annual examination. It carries 80 full marks and a time allowance of 180 minutes, across 11 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 Civil Engineering (IOE, TU) Numerical Methods (IOE, SH 553) exam or solving previous years' question papers, this 2076 paper is a great way to practise under real exam conditions.
Section A: Long Answer Questions
Attempt all questions.
The depth of penetration (in metres) of a floating cylindrical buoy used in a hydrographic survey satisfies the equation
(a) Show graphically/analytically that a real root lies in the interval . (b) Use the Newton–Raphson method to find this root correct to four decimal places, starting from . Tabulate every iteration. (c) State two situations in which the Newton–Raphson method may fail to converge.
(a) Bracketing the root
Evaluate at the interval ends:
Since and is continuous, a real root lies in .
(b) Newton–Raphson iteration
The derivative is . The iteration formula is
Start with , where .
| 0 | 1.000000 | 2.000000 | 1.050000 | |
| 1 | 1.050000 | 1.707500 | 1.049048 | |
| 2 | 1.049048 | 1.713061 | 1.049048 |
Working for : . Working for : , , so . At the value repeats to six decimals, so convergence is achieved.
Root (4 d.p.):
(c) Failure cases of Newton–Raphson
- When is zero or very near zero, the correction term blows up (the tangent is nearly horizontal).
- When the initial guess is far from the root or near a turning point, successive iterates may oscillate or diverge.
The settlement (in mm) of a building foundation measured at different elapsed times (in months) after construction is recorded below:
| (months) | 1 | 2 | 4 | 7 |
|---|---|---|---|---|
| (mm) | 3 | 7 | 21 | 60 |
(a) Construct the Newton's divided-difference table for the data. (b) Obtain the interpolating polynomial and estimate the settlement at months. (c) Briefly state one advantage of divided differences over the Lagrange form.
(a) Divided-difference table
First differences:
Second differences:
Third difference:
| 1st | 2nd | 3rd | ||
|---|---|---|---|---|
| 1 | 3 | |||
| 4 | ||||
| 2 | 7 | 1 | ||
| 7 | 0.033333 | |||
| 4 | 21 | 1.2 | ||
| 13 | ||||
| 7 | 60 |
(b) Newton's divided-difference polynomial
Estimate at :
- Term 0:
- Term 1:
- Term 2:
- Term 3:
Estimated settlement at months:
(c) Advantage: When a new data point is added, Newton's divided-difference form only requires computing one additional bottom-edge difference and term; the existing polynomial is reused, whereas the Lagrange form must be rebuilt entirely.
A planar truss analysis yields the following system of simultaneous equations for the unknown joint displacements (in mm):
(a) Show that the system is diagonally dominant and hence the Gauss–Seidel method will converge. (b) Perform three iterations of the Gauss–Seidel method starting from . Tabulate the results to four decimal places. (c) Compare Gauss–Seidel with the Jacobi method in one sentence.
(a) Diagonal dominance
For each row, :
- Row 1: ✓
- Row 2: ✓
- Row 3: ✓
The coefficient matrix is strictly diagonally dominant, so Gauss–Seidel converges for any starting vector.
(b) Gauss–Seidel iteration
Rearranged update equations:
Iteration 1 (start ):
Iteration 2:
Iteration 3:
| Iter | |||
|---|---|---|---|
| 1 | 0.9000 | 2.2625 | 2.9938 |
| 2 | 0.1481 | 1.6080 | 3.2096 |
| 3 | 0.2574 | 1.5404 | 3.1945 |
The iterates are approaching the true solution mm.
Approximate displacements after 3 iterations:
(c) Gauss–Seidel uses the most recently updated values within the same iteration, so it generally converges faster than the Jacobi method, which uses only previous-iteration values.
An irregular plot of land has its width (in metres) measured at equally spaced offsets along a baseline of length 8 m:
| (m) | 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 |
|---|---|---|---|---|---|---|---|---|---|
| (m) | 0 | 4 | 7 | 9 | 12 | 11 | 8 | 5 | 0 |
(a) Estimate the area of the plot using Simpson's 1/3 rule. (b) Estimate the area using the Trapezoidal rule and compare. (c) State the condition on the number of intervals required by Simpson's 1/3 rule.
(a) Simpson's 1/3 rule
There are intervals (even number — applicable), with step m. Label ordinates .
- Ends:
- Odd ordinates: , times 4
- Even interior: , times 2
Area (Simpson's 1/3):
(b) Trapezoidal rule
Interior sum: .
Area (Trapezoidal):
Comparison: The two estimates differ by . Simpson's rule fits parabolic arcs through triples of points and is more accurate for smoothly curving boundaries, while the trapezoidal rule uses straight chords and tends to underestimate area on a convex (bulging) boundary such as this.
(c) Condition: Simpson's 1/3 rule requires the number of intervals to be even (equivalently, an odd number of ordinates), with equal spacing . Here is even, so the rule applies directly.
The cooling of a freshly poured concrete mass follows the first-order ODE
where is temperature in C and is time in hours.
(a) Use the fourth-order Runge–Kutta (RK4) method with step size h to estimate at h (i.e. two steps). Show all -values. (b) The exact solution is . Compute the exact value at h and find the absolute error of the RK4 estimate.
(a) RK4 method
Let , . The RK4 update is
where
Step 1: .
Step 2: .
RK4 estimate at h:
(b) Exact value and error
Absolute error:
Absolute error: — RK4 is highly accurate even with a relatively large step.
Section B: Short Answer Questions
Attempt all questions.
Using the bisection method, perform three iterations to find a root of in the interval . Tabulate the iterations and state the approximate root and the bound on the error after the third iteration.
Bisection method on , interval
Check: , — root bracketed.
| Iter | New interval | ||||
|---|---|---|---|---|---|
| 1 | 2.00 | 3.00 | 2.5000 | ||
| 2 | 2.00 | 2.50 | 2.2500 | ||
| 3 | 2.00 | 2.25 | 2.1250 |
Working:
- Iter 1: , so root in .
- Iter 2: , so root in .
- Iter 3: , so root in .
Approximate root (next midpoint): .
Error bound after 3 iterations: .
(true root ).
The following table gives the discharge (in m³/s) of a river at hourly gauge readings:
| (h) | 0 | 1 | 2 | 3 |
|---|---|---|---|---|
| 10 | 18 | 30 | 46 |
Using Newton's forward-difference interpolation, estimate the discharge at h.
Forward-difference table
| 0 | 10 | 8 | 4 | 0 |
| 1 | 18 | 12 | 4 | |
| 2 | 30 | 16 | ||
| 3 | 46 |
First differences: . Second differences: . Third difference: .
Newton's forward formula with , :
Substitute :
- Term 1:
- Term 2:
- Term 3:
- Term 4:
Estimated discharge at h:
The position (in m) of a survey trolley moving along a track is recorded at equal time intervals of s:
| (s) | 0.0 | 0.1 | 0.2 | 0.3 |
|---|---|---|---|---|
| (m) | 0.00 | 0.12 | 0.28 | 0.50 |
Using finite-difference approximations, estimate the velocity at s (central difference) and the acceleration at s.
Velocity at s (central difference)
Acceleration at s (central second difference)
Results:
Solve the initial-value problem
using the modified Euler (Heun's) method with step size to estimate (two steps). Show the predictor and corrector at each step.
Modified Euler (Heun's) method
For , each step uses a predictor and one corrector:
Step 1: .
- Predictor:
- Corrector:
Step 2: .
- Predictor:
- Corrector:
Estimate: (Exact solution gives , so the error is only .)
A square plate is governed by the Laplace equation . The plate is discretised by a uniform grid with four interior nodes arranged in a block. The boundary values are such that the standard five-point finite-difference equations reduce to:
State the five-point Laplace formula and, using symmetry, solve for the four interior temperatures.
Five-point finite-difference (Laplace) formula
For a uniform grid with spacing , the discretised Laplace equation at an interior node is
i.e. each interior value equals the average of its four neighbours.
Using symmetry
By the symmetry of the equations, and . Let and .
From equation 1: → → From equation 3: → → →
Substitute into :
Then
Solution:
Check (equation 2): ✓. (Equation 4): ✓.
The compressive strength (MPa) of concrete cubes is measured against curing age (days):
| (days) | 1 | 2 | 3 | 4 | 5 |
|---|---|---|---|---|---|
| (MPa) | 8 | 13 | 16 | 21 | 24 |
Fit a straight line by the method of least squares and estimate the strength at days.
Least-squares fit of
Normal equations:
Compute the sums ():
| 1 | 8 | 1 | 8 |
| 2 | 13 | 4 | 26 |
| 3 | 16 | 9 | 48 |
| 4 | 21 | 16 | 84 |
| 5 | 24 | 25 | 120 |
Normal equations become:
From (1): . Multiply (1) by 3: . Subtract from (2):
Then
Best-fit line:
Estimate at days:
Predicted strength at 7 days:
Frequently asked questions
- Where can I find the BE Civil Engineering (IOE, TU) Numerical Methods (IOE, SH 553) question paper 2076?
- The full BE Civil Engineering (IOE, TU) Numerical Methods (IOE, SH 553) 2076 (regular) question paper is available free on Kekkei. You can read every question online and attempt the paper under timed exam conditions.
- Does the Numerical Methods (IOE, SH 553) 2076 paper come with solutions?
- Yes. Every question on this Numerical Methods (IOE, SH 553) past paper includes a step-by-step solution, plus instant AI feedback when you attempt it on Kekkei.
- How many marks is the BE Civil Engineering (IOE, TU) Numerical Methods (IOE, SH 553) 2076 paper?
- The BE Civil Engineering (IOE, TU) Numerical Methods (IOE, SH 553) 2076 paper carries 80 full marks and is meant to be completed in 180 minutes, across 11 questions.
- Is practising this Numerical Methods (IOE, SH 553) past paper free?
- Yes — reading and attempting this Numerical Methods (IOE, SH 553) past paper on Kekkei is completely free.