BE Civil Engineering (IOE, TU) Numerical Methods (IOE, SH 553) Question Paper 2077 Nepal
This is the official BE Civil Engineering (IOE, TU) Numerical Methods (IOE, SH 553) question paper for 2077, 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 2077 paper is a great way to practise under real exam conditions.
Section A: Long Answer Questions
Attempt all questions.
The cross-sectional design of an open channel leads to the nonlinear equation
(a) Show that a real root lies in the interval and perform two iterations of the bisection method to bracket the root. (b) Taking , apply the Newton-Raphson method until two successive iterates agree to four decimal places. (c) State the order of convergence of the Newton-Raphson method and explain one situation in which it may fail.
(a) Existence of a root and bisection (3 marks)
.
, and .
Since is continuous and , by the Intermediate Value Theorem a real root lies in .
Iteration 1: , . Root lies in .
Iteration 2: , . Root lies in .
(b) Newton-Raphson (5 marks)
, so .
| 0 | 2.500000 | 2.125000 | 2.380282 |
| 1 | 2.380282 | 0.105778 | 2.373669 |
| 2 | 2.373669 | 0.000312 | 2.373650 |
| 3 | 2.373650 | 0.000000 | 2.373650 |
Iterates and agree to four decimals.
Root .
(c) Convergence (2 marks)
Newton-Raphson has quadratic (second-order) convergence near a simple root: the error satisfies . It may fail when (or is very small), giving division by zero / divergence; it can also overshoot or cycle if the initial guess is far from the root.
The settlement (in mm) of a soil sample measured at equally spaced load steps is tabulated below.
| 0 | 1 | 2 | 3 | |
|---|---|---|---|---|
| 1 | 2 | 11 | 34 |
(a) Construct the forward difference table. (b) Using Newton's forward difference interpolation formula, estimate the settlement at . (c) Obtain the interpolating polynomial in expanded form.
(a) Forward difference table (3 marks)
| 0 | 1 | 1 | 8 | 6 |
| 1 | 2 | 9 | 14 | |
| 2 | 11 | 23 | ||
| 3 | 34 |
(b) Newton forward interpolation at (3 marks)
Here , , .
Settlement at is .
(c) Interpolating polynomial (2 marks)
With general (since , ):
Check: ✓, ✓.
A structural analysis problem yields the system of linear equations
(a) Verify that the coefficient matrix is diagonally dominant and write the Gauss-Seidel iteration formulae. (b) Starting from , perform iterations until each variable changes by less than in absolute value. (c) State the converged solution.
(a) Diagonal dominance and iteration formulae (2 marks)
Row 1: ✓ Row 2: ✓ Row 3: ✓
The matrix is diagonally dominant, so Gauss-Seidel converges. Rearranging each equation for its diagonal variable:
(b) Iterations (5 marks) — each new value uses the most recent estimates.
| Iter | |||
|---|---|---|---|
| 1 | 2.00000 | -0.20000 | 2.35000 |
| 2 | 1.36250 | -0.88500 | 2.85187 |
| 3 | 1.06578 | -0.96706 | 2.96709 |
| 4 | 1.01646 | -0.99342 | 2.99259 |
| 5 | 1.00350 | -0.99844 | 2.99834 |
| 6 | 1.00080 | -0.99966 | 2.99963 |
| 7 | 1.00018 | -0.99992 | 2.99992 |
From iteration 6 to 7 the changes are , , , all . Stop.
(c) Solution (1 mark)
Exact solution confirms the result.
The rate of change of water depth over distance in a flow model is governed by the initial value problem
Using the fourth-order Runge-Kutta (RK4) method with step size , compute and . Compare with the exact solution and find the absolute error.
RK4 formulae: with ,
Step 1: (3 marks)
.
Step 2: (3 marks)
.
Comparison with exact (2 marks)
Exact: .
Absolute error , showing RK4's high accuracy.
The steady-state temperature distribution over a thin square plate is governed by Laplace's equation . The plate is discretised by a uniform grid with four interior nodes arranged as a block. The boundary values are: top edge , all other edges (the four interior nodes share boundary neighbours symmetrically as shown).
100 100
| |
0 -- u1 -- u2 -- 0
| |
0 -- u3 -- u4 -- 0
| |
0 0
Using the five-point finite-difference (standard) formula , set up the four linear equations and solve them exactly to find .
Five-point formula (2 marks): each interior node equals one-quarter of the sum of its four neighbours.
Neighbour bookkeeping (left/right/top/bottom):
- : left , right , top , bottom
- : left , right , top , bottom
- : left , right , top , bottom
- : left , right , top , bottom
Equations (2 marks):
Exact solution (4 marks): By symmetry of the boundary (left-right mirror), and . Let , .
From (1): From (3):
Substitute:
Check (2): and ✓. The nodes nearer the hot top edge are hotter, as physically expected.
Section B: Short Answer Questions
Attempt all questions.
Evaluate using Simpson's rule with subintervals. Compare your result with the exact value and compute the absolute error.
Setup (2 marks): , , , , .
| 0 | 0.00 | 1.000000 |
| 1 | 0.25 | 0.941176 |
| 2 | 0.50 | 0.800000 |
| 3 | 0.75 | 0.640000 |
| 4 | 1.00 | 0.500000 |
Simpson's 1/3 rule (3 marks):
.
Comparison (1 mark): Exact value .
Absolute error .
A vehicle's velocity (m/s) is recorded every 2 seconds during a test run:
| (s) | 0 | 2 | 4 | 6 | 8 | 10 |
|---|---|---|---|---|---|---|
| (m/s) | 0 | 12 | 25 | 33 | 38 | 40 |
Using the trapezoidal rule, estimate the total distance travelled in the 10-second interval. State the formula and one source of error in the estimate.
Trapezoidal rule (2 marks): distance , with s, .
Computation (3 marks):
Total distance .
Source of error (1 mark): The trapezoidal rule replaces the true velocity curve by straight-line segments between data points. Where the curve is concave (as during acceleration here), the chords lie below the curve, so the estimate is slightly lower than the true distance; the error is and shrinks as the sampling interval decreases.
Using Lagrange's interpolation formula, estimate from the following data:
| 1 | 3 | 4 | |
|---|---|---|---|
| 1 | 27 | 64 |
Lagrange formula (2 marks): for three points,
Data: , , . Evaluate at .
Basis polynomials at (3 marks):
Interpolated value (1 mark):
. (Consistent with the cubic trend giving ; the quadratic Lagrange fit through three points yields .)
Given the function values , , (which are values of ), use the appropriate finite-difference formulae to estimate and with . Compare with the exact value .
Central difference for first derivative (2 marks):
.
Central difference for second derivative (2 marks):
.
Comparison (1 mark): Exact . Absolute error , the central-difference truncation error of order . (The small discrepancy is consistent with rounded four-decimal table data.)
Solve the initial value problem , using Euler's method with step size , computing at . Compare with the exact solution and comment on the accuracy.
Euler's formula (1 mark): with and , so .
Iterations (3 marks):
| 0 | 0.00 | 1.00000 |
| 1 | 0.25 | 0.50000 |
| 2 | 0.50 | 0.25000 |
| 3 | 0.75 | 0.12500 |
| 4 | 1.00 | 0.06250 |
.
Comparison (1 mark): Exact . Absolute error , a large error: with this big step Euler's first-order method substantially underestimates the decay. Accuracy would improve markedly with a smaller or a higher-order method (e.g. RK4).
(a) Find a root of correct to three decimal places using the secant method, taking and (use radians). (b) Fit a straight line to the following data using the method of least squares, and estimate at .
| 1 | 2 | 3 | 4 | 5 | |
|---|---|---|---|---|---|
| 3 | 4 | 6 | 7 | 9 |
(a) Secant method (5 marks)
Formula: , with .
| 1 | 0.500000 | 1.000000 | 0.725482 | 0.022698 |
| 2 | 1.000000 | 0.725482 | 0.738399 | 0.001149 |
| 3 | 0.725482 | 0.738399 | 0.739087 | -0.000003 |
Iteration: ; ; . Successive values and agree to three decimals.
Root rad.
(b) Least-squares straight line (5 marks)
With , build the sums:
| 1 | 3 | 1 | 3 |
| 2 | 4 | 4 | 8 |
| 3 | 6 | 9 | 18 |
| 4 | 7 | 16 | 28 |
| 5 | 9 | 25 | 45 |
Normal equations:
Solve: multiply the first by 3: . Subtract from the second: .
Then .
Best-fit line: .
At : .
Frequently asked questions
- Where can I find the BE Civil Engineering (IOE, TU) Numerical Methods (IOE, SH 553) question paper 2077?
- The full BE Civil Engineering (IOE, TU) Numerical Methods (IOE, SH 553) 2077 (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) 2077 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) 2077 paper?
- The BE Civil Engineering (IOE, TU) Numerical Methods (IOE, SH 553) 2077 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.