Chapter 3
Numerical Methods
TU BIT past exam questions
Past questions and answers
60 questions set from this chapter. Most repeated first.
- 2078 · 5 marks
Solve by Gauss elimination with pivoting: , , .
Similar questions: Solve by Gauss elimination with partial (2083)
Answer
Equations: , , .
Augmented matrix:
Pivot 1. The largest entry in column 1 is , so swap :
and :
Pivot 2. The larger entry in column 2 is , so swap :
:
Back substitution
Check in the third equation: , which is correct.
Answer checked by Claude Sonnet · Oct 21, 2026
Test yourself · 2 MCQs
Loading…
- 2078 · 5 marks
Solve Poisson's equation over , , with on the boundary and .
Similar questions: Solve Poisson's equation $\frac{\partial^2 f}{\partial x^2}+\frac{\partial^2 (2080)
Answer
Use the five-point formula with :
The interior points are and all boundary values are . Let , and (the problem is symmetric in and ).
- At :
- At :
- At :
From the first, . From the third, . Substituting into the second:
Then and .
.
Answer checked by Claude Sonnet · Oct 21, 2026
Test yourself · 2 MCQs
Loading…
- 2080 · 5 marks
Solve Poisson's equation over the square domain , , with on the boundary and .
Similar questions: Solve Poisson's equation $ abla^2 f (2078)
Answer
Use the five-point finite-difference formula with :
The interior points are , with on the boundary. By symmetry in and , write , , .
- Point :
- Point :
- Point :
From the first and third equations, and . Substituting into the second:
So and .
.
Answer checked by Claude Sonnet · Oct 21, 2026
Test yourself · 2 MCQs
Loading…
- 2083 · 5 marks
Solve by Gauss elimination with partial pivoting: , , .
Similar questions: Solve by Gauss elimination with pivoting: (2078)
Answer
Augmented matrix:
Pivot 1. The largest entry in column 1 is 3 (row 3). Swap :
Eliminate with and :
Pivot 2. Between and , the larger is (already in row 2), so no swap is needed. Apply :
Back substitution.
Solution: .
Check in equation 1: .
Answer checked by Claude Sonnet · Oct 21, 2026
Test yourself · 2 MCQs
Loading…
- 2078 · 10 marks
Derive the formula for Simpson's 3/8 rule for integration. Use the Secant method to estimate a root of with , .
Answer
Derivation of Simpson's 3/8 rule. Fit a cubic through four equally spaced points with values . Put , so and runs from to . Newton's forward formula gives
Integrating term by term over to :
Substitute , , and collect terms:
Secant method for . The iteration is
With and : and .
| Step | ||||
|---|---|---|---|---|
| 1 | 4 | 2 | 9.0000 | 35.0000 |
| 2 | 2 | 9.0000 | 4.0000 | -10.0000 |
| 3 | 9.0000 | 4.0000 | 5.1111 | -4.3210 |
| 4 | 4.0000 | 5.1111 | 5.9565 | 1.6541 |
| 5 | 5.1111 | 5.9565 | 5.7225 | -0.1431 |
| 6 | 5.9565 | 5.7225 | 5.7411 | -0.0040 |
| 7 | 5.7225 | 5.7411 | 5.7417 | 0.00001 |
The root is , which agrees with the exact value .
Answer checked by Claude Sonnet · Oct 21, 2026
Test yourself · 2 MCQs
Loading…
- 2078 · 10 marks
What is a boundary value problem? Using the shooting method, solve with and on . Find taking .
Answer
Boundary value problem. A differential equation of order two or higher in which the conditions are given at more than one point, usually at the two ends of the interval (for example and ), is a boundary value problem. In an initial value problem, all conditions are given at a single point.
Shooting method. Replace the BVP by an IVP. Guess the missing slope , integrate to , and compare with the required value. Adjust by linear interpolation (secant) until matches the boundary value.
Here , , . Write , so and . Integrating the second equation gives and then
This is exact, so it agrees with Euler/RK stepping on this problem.
- Trial 1, : .
- Trial 2, : .
The target is . Because is linear in ,
Then with :
Answer: .
Answer checked by Claude Sonnet · Oct 21, 2026
Test yourself · 2 MCQs
Loading…
- 2078 · 10 marks
Write an algorithm and a program to compute interpolation using Lagrange's method.
Answer
Algorithm (Lagrange interpolation)
- Read , the data points for , and the point at which to interpolate.
- Set .
- For to :
- set ;
- for to with , set ;
- set .
- Print as .
- Stop.
The formula used is
C program
#include <stdio.h>
int main(void) {
int n, i, j;
double x[20], y[20], xp, sum = 0.0, term;
printf("Enter number of data points: ");
scanf("%d", &n);
printf("Enter x and y values:\n");
for (i = 0; i < n; i++)
scanf("%lf %lf", &x[i], &y[i]);
printf("Enter the value of x to interpolate: ");
scanf("%lf", &xp);
for (i = 0; i < n; i++) {
term = y[i];
for (j = 0; j < n; j++) {
if (j != i)
term *= (xp - x[j]) / (x[i] - x[j]);
}
sum += term;
}
printf("f(%.4f) = %.6f\n", xp, sum);
return 0;
}
The x values must be distinct, otherwise the program divides by zero.
Answer checked by Claude Sonnet · Oct 21, 2026
Test yourself · 2 MCQs
Loading…
- 2078 · 5 marks
Show that the Newton-Raphson method converges quadratically.
Answer
Newton-Raphson iteration. For ,
Let be a simple root, so and . Define the error .
Expand about by Taylor's theorem, with between and :
Divide by and rearrange:
The left side is , so
As , we have and
The new error is proportional to the square of the previous error, so the order of convergence is (quadratic). The number of correct digits roughly doubles with every iteration once is close to the root.
Answer checked by Claude Sonnet · Oct 21, 2026
Test yourself · 2 MCQs
Loading…
- 2078 · 5 marks
The temperature of a metal strip was recorded over time: t (min) = 1, 2, 3, 4; T (°C) = 70, 83, 100, 124. If , estimate the temperature at min.
Answer
Let . Then is linear in , and least squares applies.
| 1 | 70 | 1.28403 | 1.64872 | 89.882 |
| 2 | 83 | 1.64872 | 2.71828 | 136.844 |
| 3 | 100 | 2.11700 | 4.48169 | 211.700 |
| 4 | 124 | 2.71828 | 7.38906 | 337.067 |
| Sum | 377 | 7.76803 | 16.23775 | 775.493 |
Normal equations:
Solving gives and , so
At , :
Estimated temperature at min is about C.
Answer checked by Claude Sonnet · Oct 21, 2026
Test yourself · 2 MCQs
Loading…
- 2078 · 5 marks
Given the data below, construct the divided difference table and use it to estimate .
1 2 3 4 5 0 7 26 63 124
Answer
Divided difference table
| 1st | 2nd | 3rd | 4th | ||
|---|---|---|---|---|---|
| 1 | 0 | ||||
| 7 | |||||
| 2 | 7 | 6 | |||
| 19 | 1 | ||||
| 3 | 26 | 9 | 0 | ||
| 37 | 1 | ||||
| 4 | 63 | 12 | |||
| 61 | |||||
| 5 | 124 |
Each entry is . For example, .
Newton's divided difference polynomial (the 4th difference is , as expected for a cubic):
At :
, which equals exactly.
Answer checked by Claude Sonnet · Oct 21, 2026
Test yourself · 2 MCQs
Loading…
- 2078 · 5 marks
Find the eigenvalues and corresponding eigenvectors of .
Answer
Characteristic equation . Expanding along the third row:
Eigenvalues: .
For : gives , , . So , :
For : , , . So and :
For : , , . So , :
Any non-zero scalar multiple of each vector is also an eigenvector.
Answer checked by Claude Sonnet · Oct 21, 2026
Test yourself · 2 MCQs
Loading…
- 2078 · 5 marks
The distance travelled by a car at various times is given below: t (sec) = 5, 6, 7, 8, 9; Distance (m) = 10.0, 14.5, 19.5, 25.5, 32.0. Estimate the velocity and acceleration at sec.
Answer
Step size s. Use central differences at with , , .
Velocity
Acceleration
At s: velocity m/s and acceleration m/s.
Answer checked by Claude Sonnet · Oct 21, 2026
Test yourself · 2 MCQs
Loading…
- 2078 · 5 marks
Using the trapezoidal rule with , evaluate .
Answer
with , so . The rule is
| 0 | 2.00 | 17.0000 |
| 1 | 2.25 | 26.6289 |
| 2 | 2.50 | 40.0625 |
| 3 | 2.75 | 58.1914 |
| 4 | 3.00 | 82.0000 |
| 5 | 3.25 | 112.5664 |
| 6 | 3.50 | 151.0625 |
| 7 | 3.75 | 198.7539 |
| 8 | 4.00 | 257.0000 |
Sum of interior values .
. The exact value is , so the trapezoidal rule overestimates slightly because is convex.
Answer checked by Claude Sonnet · Oct 21, 2026
Test yourself · 2 MCQs
Loading…
- 2078 · 5 marks
Given with , estimate by Euler's method using .
Answer
, , . Euler's formula: .
| 0 | 1.0 | 2.000 | 4.00 | 2.800 |
| 1 | 1.2 | 2.800 | 5.32 | 3.864 |
| 2 | 1.4 | 3.864 | 6.88 | 5.240 |
| 3 | 1.6 | 5.240 | 8.68 | 6.976 |
| 4 | 1.8 | 6.976 | 10.72 | 9.120 |
. The exact solution is , giving , so Euler with this step size underestimates.
Answer checked by Claude Sonnet · Oct 21, 2026
Test yourself · 2 MCQs
Loading…
- 2079 · 10 marks
Define true error and relative error. Derive the bisection method for a nonlinear equation and apply it to with and , up to 10 iterations.
Answer
True error: .
Relative (true) error: , often given as a percentage.
Bisection method (derivation). Suppose is continuous on and . By the intermediate value theorem there is a root in . Take the midpoint
- If , then is the root.
- If , the root lies in , so set .
- Otherwise the root lies in , so set .
Repeat. The interval halves every step, so after steps its width is .
Application: on . Here and .
| 1 | 1 | 2 | 1.5 | -1.2500 |
| 2 | 1.5 | 2 | 1.75 | 2.2188 |
| 3 | 1.5 | 1.75 | 1.625 | 0.3320 |
| 4 | 1.5 | 1.625 | 1.5625 | -0.4956 |
| 5 | 1.5625 | 1.625 | 1.59375 | -0.0911 |
| 6 | 1.59375 | 1.625 | 1.609375 | 0.1181 |
| 7 | 1.59375 | 1.609375 | 1.601563 | 0.0129 |
| 8 | 1.59375 | 1.601563 | 1.597656 | -0.0393 |
| 9 | 1.597656 | 1.601563 | 1.599609 | -0.0132 |
| 10 | 1.599609 | 1.601563 | 1.600586 | -0.0002 |
After 10 iterations the root is (accurate to about three decimal places).
Answer checked by Claude Sonnet · Oct 21, 2026
Test yourself · 2 MCQs
Loading…
- 2079 · 10 marks
Describe applications of interpolation and distinguish interpolation from regression. Using Lagrange's interpolation, estimate from: x = 5, 6, 9, 11; y = 13, 14, 15, 16.
Answer
Applications of interpolation
- Estimating values between tabulated data, for example from a table of sines, logarithms or steam tables.
- Reconstructing missing readings from experiments or sensors.
- Numerical differentiation and integration, which are built on interpolating polynomials.
- Computer graphics and image resizing (curves, surfaces, resampling).
Interpolation versus regression
| Interpolation | Regression (curve fitting) |
|---|---|
| The curve passes exactly through every data point. | The curve passes near the points and need not touch any. |
| Suited to accurate, precise data. | Suited to noisy or experimental data. |
| Polynomial degree for points. | Degree chosen by the user, usually much lower than . |
| No error at the data points. | Minimises the sum of squared errors (least squares). |
Lagrange interpolation at with and :
. The weights sum to , as they must.
Answer checked by Claude Sonnet · Oct 21, 2026
Test yourself · 2 MCQs
Loading…
- 2079 · 10 marks
Explain numerical integration and give one application. Write an algorithm and a C program for the multi-segment trapezoidal rule.
Answer
Numerical integration means approximating a definite integral by a weighted sum of function values, . It is needed when has no closed-form antiderivative or when is known only as a table of values.
Application: finding the distance travelled from tabulated speed readings, or the area of an irregular plot of land from measured offsets.
Multi-segment trapezoidal rule. Divide into equal segments of width :
Algorithm
- Read , and .
- Set and .
- For to : set and .
- Set .
- Print and stop.
C program (the example integrand is )
#include <stdio.h>
double f(double x) {
return 1.0 / (1.0 + x * x);
}
int main(void) {
double a, b, h, sum, x, I;
int n, i;
printf("Enter lower limit a, upper limit b: ");
scanf("%lf %lf", &a, &b);
printf("Enter number of segments n: ");
scanf("%d", &n);
h = (b - a) / n;
sum = f(a) + f(b);
for (i = 1; i < n; i++) {
x = a + i * h;
sum += 2.0 * f(x);
}
I = (h / 2.0) * sum;
printf("Integral = %.6f\n", I);
return 0;
}
Answer checked by Claude Sonnet · Oct 21, 2026
Test yourself · 2 MCQs
Loading…
- 2079 · 5 marks
Construct the divided difference table for the data below, then find the first and second derivatives at . x = 1, 2, 4, 8, 10; y = 0, 1, 5, 21, 27.
Answer
Data: and .
Divided difference table
| 1st | 2nd | 3rd | 4th | ||
|---|---|---|---|---|---|
| 1 | 0 | ||||
| 1 | |||||
| 2 | 1 | 1/3 | |||
| 2 | 0 | ||||
| 4 | 5 | 1/3 | -1/144 | ||
| 4 | -1/16 | ||||
| 8 | 21 | -1/6 | |||
| 3 | |||||
| 10 | 27 |
For example, and .
Interpolating polynomial
First derivative at . Let . Since is a factor, . Then
Second derivative at . Write with . Then , and
and .
Answer checked by Claude Sonnet · Oct 21, 2026
Test yourself · 2 MCQs
Loading…
- 2079 · 5 marks
Explain the least squares method of curve fitting. Fit a second-order polynomial to: x = 1, 2, 3, 4, 5, 6, 7; y = 2, 6, 7, 8, 10, 12, 15.
Answer
Least squares method. Given data , choose the curve's parameters so that the sum of squares of the vertical deviations is minimum. Setting the partial derivative of with respect to each parameter to zero gives the normal equations. For :
Sums for the data (): , , , , , , .
Solving gives , and .
Answer checked by Claude Sonnet · Oct 21, 2026
Test yourself · 2 MCQs
Loading…
- 2079 · 5 marks
Solve by the Gauss-Seidel method: , , .
Answer
The system is diagonally dominant, so Gauss-Seidel converges. Rearrange:
Start with and always use the newest values.
| Iteration | |||
|---|---|---|---|
| 1 | 1.2000 | 1.0600 | 0.9480 |
| 2 | 0.9992 | 1.0054 | 0.9991 |
| 3 | 0.9996 | 1.0002 | 1.0001 |
| 4 | 1.0000 | 1.0000 | 1.0000 |
Solution: .
Answer checked by Claude Sonnet · Oct 21, 2026
Test yourself · 2 MCQs
Loading…
- 2079 · 5 marks
Using Heun's method with , find at for , given at .
Answer
, , . Heun's method:
Step 1 (): , , ,
Step 2 (): , , ,
Step 3 (): , , ,
.
Answer checked by Claude Sonnet · Oct 21, 2026
Test yourself · 2 MCQs
Loading…
- 2079 · 5 marks
Explain why the composite Simpson's 3/8 rule is preferred over the simple Simpson's 3/8 rule. Then apply Simpson's 3/8 rule to: x = 0, 1, 2, 3, 4, 5, 6; y = 1, 0.5, 0.2, 0.1, 0.0588, 0.0385, 0.027.
Answer
Why the composite rule is preferred. The simple 3/8 rule uses a single cubic over only three sub-intervals, so over a wide interval the error is large (it depends on with a large ). The composite rule applies the 3/8 rule repeatedly over successive groups of three sub-intervals and adds the results. This lets be small, so the error falls to overall, and the rule handles any interval whose number of sub-intervals is a multiple of .
Composite Simpson's 3/8 rule (number of intervals a multiple of 3):
Application. Here and (two groups of three intervals).
.
Answer checked by Claude Sonnet · Oct 21, 2026
Test yourself · 2 MCQs
Loading…
- 2079 · 5 marks
Solve by Gaussian elimination: , , .
Answer
Forward elimination
and :
:
Back substitution
.
Check in the second equation: .
Answer checked by Claude Sonnet · Oct 21, 2026
Test yourself · 2 MCQs
Loading…
- 2079 · 5 marks
Define eigenvalue and eigenvector. Explain how the shooting method solves a boundary value problem.
Answer
Eigenvalue and eigenvector. For a square matrix , a scalar is an eigenvalue if there is a non-zero vector with
The vector is the corresponding eigenvector. The eigenvalues are the roots of the characteristic equation , and each eigenvector is a non-zero solution of .
Shooting method for a BVP. Consider with and .
- Convert to a first-order system with : , .
- Guess the missing initial slope and solve the resulting IVP (Euler, Runge-Kutta) from to . Record .
- Compare with . Take a second guess and find .
- Improve the guess by the secant (linear interpolation) formula
- Repeat until is within tolerance. For a linear ODE, one interpolation gives the exact slope.
- The IVP solution with this final slope is the solution of the BVP.
The method is called shooting because adjusting is like adjusting the angle of a gun until the shot hits the target at .
Answer checked by Claude Sonnet · Oct 21, 2026
Test yourself · 2 MCQs
Loading…
- 2079 · 5 marks
A steel plate measures 24 cm x 24 cm. Two opposite sides are held at 100 °C and the other two at 0 °C. Using an 8 cm grid, find the steady-state temperatures at the interior points.
Answer
The plate is cm and the grid spacing is cm, so there are divisions and interior points. Let the top and bottom edges be at C and the left and right edges at C. Label the interior points (top row) and (bottom row).
Laplace's equation in difference form: each interior temperature is the average of its four neighbours.
By symmetry all four are equal, , so
All four interior points are at C.
Answer checked by Claude Sonnet · Oct 21, 2026
Test yourself · 2 MCQs
Loading…
- 2079 · 5 marks
Write an algorithm for Horner's method. Use it to evaluate at .
Answer
Algorithm (Horner's method for )
- Read , the coefficients and the value .
- Set .
- For down to : set .
- Print as and stop.
Horner's method rewrites the polynomial in nested form, which needs only multiplications and additions.
Evaluation of at
| Step | Calculation | Result |
|---|---|---|
| 1 | ||
| 5 | ||
| 15 | ||
| 37 | ||
| 83 |
. Direct check: .
Answer checked by Claude Sonnet · Oct 21, 2026
Test yourself · 2 MCQs
Loading…
- 2080 · 10 marks
Write an algorithm and a C program to obtain roots of a non-linear equation using the Newton-Raphson method.
Answer
Algorithm (Newton-Raphson)
- Define and .
- Read the initial guess , tolerance and the maximum number of iterations .
- For to :
- if , print "derivative is zero" and stop;
- compute ;
- if , print as the root and stop;
- set .
- Print "does not converge in N iterations" and stop.
C program (example )
#include <stdio.h>
#include <math.h>
double f(double x) { return x * x * x - 2 * x - 5; }
double df(double x) { return 3 * x * x - 2; }
int main(void) {
double x0, x1, eps;
int i, maxit;
printf("Enter initial guess, tolerance, max iterations: ");
scanf("%lf %lf %d", &x0, &eps, &maxit);
for (i = 1; i <= maxit; i++) {
if (fabs(df(x0)) < 1e-12) {
printf("Derivative is zero. Method fails.\n");
return 1;
}
x1 = x0 - f(x0) / df(x0);
printf("Iteration %d: x = %.6f\n", i, x1);
if (fabs(x1 - x0) < eps) {
printf("Root = %.6f after %d iterations\n", x1, i);
return 0;
}
x0 = x1;
}
printf("Did not converge in %d iterations.\n", maxit);
return 1;
}
For this converges to the root .
Answer checked by Claude Sonnet · Oct 21, 2026
Test yourself · 2 MCQs
Loading…
- 2080 · 10 marks
Solve the following ODE using the shooting method: , with and .
Answer
Write and , with and unknown . The ODE is linear, so is a linear function of .
Trial 1: . Integrating from to (Runge-Kutta, step ) gives .
Trial 2: . The same integration gives .
The target is . By linear interpolation (secant on ):
Final solution. Integrating the IVP with , :
| 0 | 0.5 | 1.0 | 1.5 | 2.0 | |
|---|---|---|---|---|---|
| 1 | 2.52 | 4.24 | 6.55 | 10.00 |
So the BVP solution is the IVP solution with the slope , and it satisfies . Values at interior points are and .
Answer checked by Claude Sonnet · Oct 21, 2026
Test yourself · 2 MCQs
Loading…
- 2080 · 10 marks
Compare and contrast the Jacobi iterative and Gauss-Seidel methods. Solve the following equations using the Gauss-Seidel method: , ,
Answer
Comparison
| Jacobi | Gauss-Seidel |
|---|---|
| Uses only values from the previous iteration for all unknowns. | Uses the newest available values in the same iteration. |
| Updates can be done in parallel. | Updates are sequential. |
| Converges more slowly, roughly twice as many iterations. | Converges faster, usually about twice as fast. |
| Needs two arrays (old and new). | Needs one array. |
| Both need diagonal dominance (or similar) to be sure of convergence. | Same condition. |
Gauss-Seidel solution. The equations are
This system is not diagonally dominant (for example, in row 1), so convergence is slow. Starting from :
| Iteration | |||
|---|---|---|---|
| 1 | 5.0000 | -0.5000 | -0.1707 |
| 2 | 6.5122 | -0.4085 | -0.2506 |
| 3 | 6.5689 | -0.2031 | -0.3078 |
| 4 | 6.3295 | 0.0140 | -0.3573 |
| 5 | 6.0438 | 0.2216 | -0.4025 |
| 6 | 5.7644 | 0.4158 | -0.4444 |
| 7 | 5.5016 | 0.5967 | -0.4833 |
| 8 | 5.2565 | 0.7650 | -0.5195 |
The iterates move steadily toward the exact solution. Elimination confirms it: gives , and gives . Hence , , .
Solution: . Many more Gauss-Seidel iterations are needed to reach this; reordering the equations to improve dominance would speed it up.
Answer checked by Claude Sonnet · Oct 21, 2026
Test yourself · 2 MCQs
Loading…
- 2080 · 5 marks
Use the secant method to estimate the root of , with initial estimates and (EPS = 0.05).
Answer
, , . Here and .
, so and the iteration stops at once.
The root is . Indeed , so is an exact root. The other root is .
Answer checked by Claude Sonnet · Oct 21, 2026
Test yourself · 2 MCQs
Loading…
- 2080 · 5 marks
Solve the double integral using Simpson's 1/3 rule: .
Answer
, with and . Take two sub-intervals in each direction: and .
The nodes are and . Simpson's 1/3 weights in each direction are , so
Because is separable, the sum factorises.
x-direction:
y-direction:
. The exact value is .
Answer checked by Claude Sonnet · Oct 21, 2026
Test yourself · 2 MCQs
Loading…
- 2080 · 5 marks
What are the sources of errors? Discuss the various types of errors encountered in numerical computation.
Answer
Sources of errors in numerical computation
- Inherent (input) errors in the data: measurement errors in experimental values, or errors from approximating physical constants.
- Errors introduced by the mathematical model, which simplifies the real problem.
- Errors arising from the numerical method (truncation) and from the finite-precision computer (round-off).
- Human or programming errors (blunders), such as wrong formulas or typing mistakes.
Types of errors
- Round-off error: caused by the computer storing only a finite number of digits, for example or . The error accumulates over many operations, and subtracting nearly equal numbers loses significant digits.
- Truncation error: caused by cutting off an infinite process after finitely many terms, for example using or replacing a derivative by a finite difference.
- Absolute error: .
- Relative error: , and the percentage error is this multiplied by .
- Blunder (gross) error: mistakes due to carelessness; these are avoidable.
- Inherent error: error already present in the input data.
- Propagated error: error carried forward from earlier steps into later calculations.
Answer checked by Claude Sonnet · Oct 21, 2026
Test yourself · 2 MCQs
Loading…
- 2080 · 5 marks
Fit a second-order polynomial to the data below: X = 1, 2, 3, 4, 5; F(x) = 2, 6, 12, 20, 30.
Answer
Fit for the data and .
| 1 | 2 | 1 | 1 | 1 | 2 | 2 |
| 2 | 6 | 4 | 8 | 16 | 12 | 24 |
| 3 | 12 | 9 | 27 | 81 | 36 | 108 |
| 4 | 20 | 16 | 64 | 256 | 80 | 320 |
| 5 | 30 | 25 | 125 | 625 | 150 | 750 |
| Sum | 70 | 55 | 225 | 979 | 280 | 1204 |
Normal equations ():
Solving gives , and .
This fits every data point exactly.
Answer checked by Claude Sonnet · Oct 21, 2026
Test yourself · 2 MCQs
Loading…
- 2080 · 5 marks
Why is numerical integration required? Compute using the composite trapezoidal rule with .
Answer
Why numerical integration is required: many integrands have no elementary antiderivative (for example ), and in practice the function is often known only as a table of measured values. Numerical methods give an approximate answer in both cases.
Composite trapezoidal rule, . , with nodes .
| -1 | -0.5 | 0 | 0.5 | 1 | |
|---|---|---|---|---|---|
| 0.36788 | 0.60653 | 1.00000 | 1.64872 | 2.71828 |
. The exact value is , so the error is about .
Answer checked by Claude Sonnet · Oct 21, 2026
Test yourself · 2 MCQs
Loading…
- 2080 · 5 marks
Evaluate at using Newton's forward interpolation formula for the table below: X = 1, 3, 5, 7, 9; y = -1.20, 12.80, 119.60, 472.80, 1302.80.
Answer
Data: , , so corresponds to .
Forward difference table
| 1 | -1.20 | 14.0 | 92.8 | 153.6 | 76.8 |
| 3 | 12.80 | 106.8 | 246.4 | 230.4 | |
| 5 | 119.60 | 353.2 | 476.8 | ||
| 7 | 472.80 | 830.0 | |||
| 9 | 1302.80 |
Newton's forward formula for the derivative:
At the coefficients are , and :
.
Answer checked by Claude Sonnet · Oct 21, 2026
Test yourself · 2 MCQs
Loading…
- 2080 · 5 marks
Find the eigenvalues and eigenvectors of the matrix .
Answer
. The characteristic equation is
Eigenvalue: (repeated, with algebraic multiplicity ).
Eigenvector: gives
Only one independent eigenvector exists for the repeated eigenvalue, so is not diagonalisable.
Answer checked by Claude Sonnet · Oct 21, 2026
Test yourself · 2 MCQs
Loading…
- 2080 · 5 marks
Solve with for () using Euler's method.
Answer
, , . Euler's formula is .
Step 1 (): ,
Step 2 (): ,
.
Answer checked by Claude Sonnet · Oct 21, 2026
Test yourself · 2 MCQs
Loading…
- 2082 · 2+4+4 marks
Compare the bisection and secant methods. Derive the Newton-Raphson formula. Use Newton-Raphson to solve , correct to three decimal places.
Answer
Comparison of bisection and secant methods
| Bisection | Secant |
|---|---|
| Needs a bracketing interval with . | Needs two starting points; no bracketing is required. |
| Always converges, but only linearly (slow). | Converges faster (order about ) but may diverge. |
| Uses only the sign of . | Uses the function values to interpolate. |
Derivation of Newton-Raphson. Let be an approximation to a root of . The tangent to at is . The next approximation is where this tangent meets the x-axis ():
Solving . . Since and , a root lies in . Take .
| 0 | 1.00000 | 1.00000 | 5.0000 | 0.80000 |
| 1 | 0.80000 | 0.11200 | 3.9200 | 0.77143 |
| 2 | 0.77143 | 0.00208 | 3.7854 | 0.77092 |
| 3 | 0.77092 | 0.0000006 | 3.7831 | 0.77092 |
The iterates have settled to three decimal places, so the root is .
Answer checked by Claude Sonnet · Oct 21, 2026
Test yourself · 2 MCQs
Loading…
- 2082 · 5+5 marks
Write an algorithm for interpolation using Newton's divided difference method. Write a program for the same method.
Answer
Algorithm (Newton's divided difference interpolation)
- Read , the points for , and the value .
- Build the table: set . For to and to , compute
- Set and .
- For to : set and .
- Print as and stop.
The interpolating polynomial is
C program
#include <stdio.h>
int main(void) {
int n, i, j;
double x[20], d[20][20], xp, prod, result;
printf("Enter number of data points: ");
scanf("%d", &n);
printf("Enter x and y values:\n");
for (i = 0; i < n; i++)
scanf("%lf %lf", &x[i], &d[i][0]);
printf("Enter value of x to interpolate: ");
scanf("%lf", &xp);
/* divided difference table */
for (j = 1; j < n; j++)
for (i = 0; i < n - j; i++)
d[i][j] = (d[i + 1][j - 1] - d[i][j - 1]) / (x[i + j] - x[i]);
/* Newton form */
result = d[0][0];
prod = 1.0;
for (j = 1; j < n; j++) {
prod *= (xp - x[j - 1]);
result += d[0][j] * prod;
}
printf("f(%.4f) = %.6f\n", xp, result);
return 0;
}
Answer checked by Claude Sonnet · Oct 21, 2026
Test yourself · 2 MCQs
Loading…
- 2082 · 2+3+5 marks
List two applications of systems of linear equations. Differentiate between Gauss-Seidel and Jacobi iteration. Solve by Jacobi iteration: , , .
Answer
Two applications of linear systems: (1) analysis of electrical circuits using Kirchhoff's laws, and (2) structural analysis of trusses and frames, or balancing chemical equations and economic input-output models.
Gauss-Seidel versus Jacobi
| Jacobi | Gauss-Seidel |
|---|---|
| Computes every new value from the previous iteration's values only. | Uses each newly computed value immediately in the same iteration. |
| Slower convergence. | Usually converges about twice as fast. |
| Needs to store both old and new vectors. | Needs a single vector. |
Jacobi iteration. The system is diagonally dominant (, , ). Rewrite:
Start with :
| Iteration | |||
|---|---|---|---|
| 1 | 1.7500 | 0.6000 | 2.3333 |
| 2 | 1.0167 | 1.1833 | 1.2583 |
| 3 | 1.1396 | 0.9000 | 1.4306 |
| 4 | 1.1674 | 0.9443 | 1.4635 |
| 5 | 1.1480 | 0.9519 | 1.4349 |
| 6 | 1.1533 | 0.9443 | 1.4420 |
| 7 | 1.1534 | 0.9461 | 1.4419 |
| 8 | 1.1530 | 0.9461 | 1.4412 |
| 9 | 1.1532 | 0.9459 | 1.4415 |
| 10 | 1.1532 | 0.9460 | 1.4414 |
Solution: . The exact values are , and .
Answer checked by Claude Sonnet · Oct 21, 2026
Test yourself · 2 MCQs
Loading…
- 2082 · 2+3 marks
Differentiate round-off error from truncation error, and explain their effect on numerical computation with an example.
Answer
Round-off error versus truncation error
| Round-off error | Truncation error |
|---|---|
| Arises because a computer stores numbers with finite digits. | Arises because an infinite process or exact formula is replaced by a finite approximation. |
| Depends on machine precision and word length. | Depends on the method, such as the number of series terms or the step size. |
| Example: stored as . | Example: dropping later terms. |
Effect on computation. Round-off errors accumulate over many operations and can wipe out significant digits when nearly equal numbers are subtracted. Truncation error can be reduced by taking more terms or a smaller step size , but a smaller means more operations, hence more round-off.
Example. Approximating a derivative by for at : the truncation error is about , which falls as decreases. But for very small (about ), and agree to nearly all stored digits, so the subtraction loses accuracy and the round-off error, of order , dominates. The total error is therefore smallest at an intermediate .
Answer checked by Claude Sonnet · Oct 21, 2026
Test yourself · 2 MCQs
Loading…
- 2082 · 2.5+2.5 marks
Derive the two-point forward difference formula and the two-point backward difference formula.
Answer
Both formulas come from the Taylor series of about , with step size .
Two-point forward difference. Expand :
Rearranging for :
Neglecting the last term (truncation error of order ):
This uses the points and and is first-order accurate, .
Two-point backward difference. Expand :
Rearranging for :
Hence
This also has error . Averaging the two formulas gives the more accurate central difference , with error .
Answer checked by Claude Sonnet · Oct 21, 2026
Test yourself · 2 MCQs
Loading…
- 2082 · 5 marks
Fit to the points using least squares.
Answer
Take logarithms to linearise: . Put , , so .
| 1 | 15 | 2.7081 | 1 | 2.7081 |
| 2 | 22 | 3.0910 | 4 | 6.1821 |
| 3 | 33 | 3.4965 | 9 | 10.4895 |
| 4 | 48 | 3.8712 | 16 | 15.4848 |
| 5 | 70 | 4.2485 | 25 | 21.2425 |
| Sum | 17.4153 | 55 | 56.1069 |
Here , . The normal equations are
Solving for :
Fitted curve:
Check: at , , close to 33.
Answer checked by Claude Sonnet · Oct 21, 2026
Test yourself · 2 MCQs
Loading…
- 2082 · 5 marks
Solve by Cholesky decomposition: , , .
Answer
Write with
is symmetric (and positive definite), so with lower triangular.
Step 1: Find .
- ,
Step 2: Forward substitution, .
Step 3: Back substitution, .
Solution: .
Check in equation 1: . Correct.
Answer checked by Claude Sonnet · Oct 21, 2026
Test yourself · 2 MCQs
Loading…
- 2082 · 5 marks
Using the data below, find and . x = 1.5, 2, 2.5, 3, 3.5, 4; f(x) = 2.375, 4.5, 7.625, 12, 17.875, 23.
Answer
The step size is , and is an interior point, so use central differences.
First derivative:
Second derivative:
Result: and .
Using a more accurate five-point formula for the first derivative gives
which is consistent with the central value.
Answer checked by Claude Sonnet · Oct 21, 2026
Test yourself · 2 MCQs
Loading…
- 2082 · 5 marks
Evaluate using Simpson's 1/3 rule with .
Answer
Here , , , so .
| 0 | 0 | 1 |
| 1 | 0.5 | 1.25 |
| 2 | 1.0 | 3 |
| 3 | 1.5 | 7.75 |
| 4 | 2.0 | 17 |
| 5 | 2.5 | 32.25 |
| 6 | 3.0 | 55 |
Simpson's 1/3 rule:
Result: .
This equals the exact value , because Simpson's rule is exact for cubics.
Answer checked by Claude Sonnet · Oct 21, 2026
Test yourself · 2 MCQs
Loading…
- 2082 · 5 marks
Solve with at using the fourth-order Runge-Kutta method.
Answer
Here , , . To reach take and 3 steps.
RK4 formulas:
Step 1 ():
Step 2 ():
Step 3 ():
Result: .
The exact solution gives , so the RK4 value is accurate to about 3 decimals.
Answer checked by Claude Sonnet · Oct 21, 2026
Test yourself · 2 MCQs
Loading…
- 2082 · 2+3 marks
Explain a boundary value problem with an example, and describe how higher-order differential equations can be solved.
Answer
Boundary value problem (BVP). A differential equation whose auxiliary conditions are given at two or more different points (the boundaries) of the interval, instead of all at one starting point. A second-order ODE needs two such conditions.
Example:
The values of are fixed at and (two points), so this is a BVP. Its solution is . By contrast, an initial value problem would give and at the same point.
Solving higher-order differential equations. A higher-order ODE is converted into a system of first-order ODEs, which can then be solved by Euler, Runge-Kutta, etc.
For , let . Then
For example, becomes , . Each equation is advanced step by step with the same method (e.g. RK4) applied to every variable.
For a BVP the missing initial value is not known, so two approaches are used:
- Shooting method: guess the missing initial slope, solve as an IVP, compare the computed end value with the required boundary value, and adjust the guess (e.g. by secant or bisection) until the boundary condition is met.
- Finite difference method: replace derivatives by central differences, e.g. , giving a system of linear algebraic equations in the unknowns that is solved by Gauss elimination or an iterative method.
Answer checked by Claude Sonnet · Oct 21, 2026
Test yourself · 2 MCQs
Loading…
- 2082 · 2.5+2.5 marks
Define eigenvalue and eigenvector, and distinguish between regression and interpolation.
Answer
Eigenvalue and eigenvector. For a square matrix , a non-zero vector is an eigenvector and the scalar is the corresponding eigenvalue if
That is, multiplying by only scales and does not change its direction. The eigenvalues are the roots of the characteristic equation . The eigenvector for each is found by solving .
Regression versus interpolation.
| Basis | Regression (curve fitting) | Interpolation |
|---|---|---|
| Curve | Passes near the points, not necessarily through them | Passes exactly through every given point |
| Data | Suited to noisy or experimental data | Suited to accurate, exact data |
| Method | Least squares minimises | Lagrange, Newton, spline polynomials |
| Function | Low-degree function with few parameters | Polynomial of degree up to for points |
| Purpose | Shows the overall trend | Estimates values between known points |
Answer checked by Claude Sonnet · Oct 21, 2026
Test yourself · 2 MCQs
Loading…
- 2083 · 2+4+4 marks
Differentiate the Newton-Raphson and bisection methods. Derive the Newton-Raphson formula. Use bisection to solve in .
Answer
Newton-Raphson versus bisection.
| Basis | Newton-Raphson | Bisection |
|---|---|---|
| Starting data | One initial guess | Interval with |
| Derivative | Needs | Not needed |
| Convergence | Quadratic (fast) | Linear (slow, error halves each step) |
| Reliability | May diverge if or guess is poor | Always converges |
Derivation of Newton-Raphson. Let be near the root. Expand by Taylor series about and keep the linear terms:
At the root , so
Repeating gives
Geometrically, is where the tangent at cuts the -axis.
Bisection for in . and , so a root lies in .
| Iter | ||||
|---|---|---|---|---|
| 1 | 1 | 2 | 1.5 | |
| 2 | 1.5 | 2 | 1.75 | |
| 3 | 1.5 | 1.75 | 1.625 | |
| 4 | 1.5 | 1.625 | 1.5625 | |
| 5 | 1.5 | 1.5625 | 1.53125 | |
| 6 | 1.5 | 1.53125 | 1.51563 | |
| 7 | 1.51563 | 1.53125 | 1.52344 | |
| 8 | 1.51563 | 1.52344 | 1.51953 |
The interval is now , so the root is (exact root ).
Answer checked by Claude Sonnet · Oct 21, 2026
Test yourself · 2 MCQs
Loading…
- 2083 · 5+5 marks
Write an algorithm for Newton's backward interpolation. Write a program for Newton's backward interpolation.
Answer
Algorithm: Newton's backward interpolation
Given equally spaced points , , and a value to interpolate near the end of the table.
- Read , the values , , and the point .
- Compute .
- Build the backward difference table: set , then for and down to , compute .
- Compute .
- Set and .
- For to : ; .
- Print as .
This implements
Program (C):
#include <stdio.h>
int main() {
int n, i, j;
double x[20], d[20][20], xv, h, p, sum, term;
printf("Enter number of points: ");
scanf("%d", &n);
printf("Enter x and y values:\n");
for (i = 0; i < n; i++)
scanf("%lf %lf", &x[i], &d[i][0]);
printf("Enter value of x to interpolate: ");
scanf("%lf", &xv);
/* backward difference table */
for (j = 1; j < n; j++)
for (i = n - 1; i >= j; i--)
d[i][j] = d[i][j - 1] - d[i - 1][j - 1];
h = x[1] - x[0];
p = (xv - x[n - 1]) / h;
sum = d[n - 1][0];
term = 1.0;
for (j = 1; j < n; j++) {
term = term * (p + j - 1) / j;
sum = sum + term * d[n - 1][j];
}
printf("f(%.4lf) = %.6lf\n", xv, sum);
return 0;
}
Answer checked by Claude Sonnet · Oct 21, 2026
Test yourself · 2 MCQs
Loading…
- 2083 · 3+2+5 marks
Explain the power method for finding eigenvalues. Differentiate Jacobi and Gauss-Seidel methods. Solve by Jacobi: , , .
Answer
Power method. It finds the dominant (largest in magnitude) eigenvalue and its eigenvector of a matrix .
- Choose a non-zero starting vector (e.g. all ones).
- Compute .
- Let be the component of with largest magnitude, and normalise: .
- Repeat until .
Then and the corresponding eigenvector. It converges when one eigenvalue strictly dominates the others, at a rate set by . The smallest eigenvalue can be found by applying the method to .
Jacobi versus Gauss-Seidel.
| Basis | Jacobi | Gauss-Seidel |
|---|---|---|
| Values used | Only the previous iteration's values | Latest updated values immediately |
| Speed | Slower | Usually about twice as fast |
| Parallelism | Easy to parallelise | Sequential |
| Storage | Needs old and new vectors | One vector is enough |
Both converge for a diagonally dominant system.
Jacobi solution. The system is diagonally dominant. Rewrite:
Start with :
| Iter | |||
|---|---|---|---|
| 1 | 1.4000 | 1.5000 | 1.6667 |
| 2 | 0.7667 | 0.7333 | 0.7000 |
| 3 | 1.1133 | 1.1333 | 1.1667 |
| 4 | 0.9400 | 0.9300 | 0.9178 |
| 5 | 1.0304 | 1.0356 | 1.0433 |
The values oscillate and converge towards the exact solution:
Check: , , . All hold.
Answer checked by Claude Sonnet · Oct 21, 2026
Test yourself · 2 MCQs
Loading…
- 2083 · 1+4 marks
Differentiate absolute and relative error. Explain fixed point iteration.
Answer
Absolute versus relative error. If is the true value and the approximation:
- Absolute error . It is the raw size of the error, in the units of the quantity.
- Relative error , often given as a percentage. It is dimensionless and shows how large the error is compared with the quantity. For example, an error of 1 cm is large for a 10 cm object but negligible for a 1 km road.
Fixed point iteration. To solve , rewrite it as . A root of is then a fixed point of , meaning a point with .
Procedure:
- Choose an initial guess .
- Iterate .
- Stop when .
Convergence condition: the iteration converges if in an interval containing the root and the starting value. The smaller is, the faster it converges, and the order is linear.
Example: near . Write , so . From : , , , tending to 3.
Answer checked by Claude Sonnet · Oct 21, 2026
Test yourself · 2 MCQs
Loading…
- 2083 · 5 marks
Fit a second-degree polynomial by least squares to .
Answer
Fit . The normal equations are
| 2 | 1 | 1 | 2 | |||
| 0 | 1 | 0 | 0 | 0 | 0 | 0 |
| 1 | 2 | 1 | 1 | 1 | 2 | 2 |
| 2 | 5 | 4 | 8 | 16 | 10 | 20 |
| 3 | 10 | 9 | 27 | 81 | 30 | 90 |
| Sum | 20 | 15 | 35 | 99 | 40 | 114 |
Substituting (, ):
(2) (1): .
(3) 3(1): .
Substituting : , so . From (1): .
Fitted polynomial:
This passes exactly through all five points.
Answer checked by Claude Sonnet · Oct 21, 2026
Test yourself · 2 MCQs
Loading…
- 2083 · 5 marks
From the table below, find and . x = 1, 1.5, 2, 2.5, 3; f(x) = 1, 3.375, 8, 15.625, 27.
Answer
The step is and is an interior point, so use central differences.
First derivative:
Second derivative:
Result: and .
The table values are those of , whose exact values are and . The small error in comes from the truncation term of the central formula.
Answer checked by Claude Sonnet · Oct 21, 2026
Test yourself · 2 MCQs
Loading…
- 2083 · 1+4 marks
What is numerical integration? Derive the Newton-Cotes quadrature formula.
Answer
Numerical integration is the approximate evaluation of a definite integral by a weighted sum of function values at selected points, used when has no closed-form antiderivative or is known only as tabulated data.
Newton-Cotes quadrature formula. Divide into equal parts of width , with and . Replace by Newton's forward interpolating polynomial, with , so :
Integrating term by term from 0 to :
This is the general Newton-Cotes formula. Special cases:
- gives the trapezoidal rule: .
- gives Simpson's 1/3 rule: .
- gives Simpson's 3/8 rule: .
Answer checked by Claude Sonnet · Oct 21, 2026
Test yourself · 2 MCQs
Loading…
- 2083 · 5 marks
Evaluate using the trapezoidal rule with .
Answer
Here , , , , so .
| 0 | 1.0 | 2.71828 |
| 1 | 1.2 | 2.76676 |
| 2 | 1.4 | 2.89657 |
| 3 | 1.6 | 3.09565 |
| 4 | 1.8 | 3.36092 |
| 5 | 2.0 | 3.69453 |
Trapezoidal rule:
Result: .
Answer checked by Claude Sonnet · Oct 21, 2026
Test yourself · 2 MCQs
Loading…
- 2083 · 5 marks
For with , find using Runge-Kutta.
Answer
Here , , , and , so one step of the fourth-order Runge-Kutta method reaches .
Result: .
The exact solution is , which gives at , so the RK result is accurate.
Answer checked by Claude Sonnet · Oct 21, 2026
Test yourself · 2 MCQs
Loading…
- 2083 · 2+3 marks
Differentiate initial value and boundary value problems. Explain the solution of a system of ODEs.
Answer
Initial value problem versus boundary value problem.
| Basis | Initial value problem (IVP) | Boundary value problem (BVP) |
|---|---|---|
| Conditions | All given at one point, e.g. , | Given at two or more different points, e.g. , |
| Example | ||
| Methods | Euler, Runge-Kutta, predictor-corrector (marching) | Shooting, finite difference |
| Solution | Step-by-step from the start | Often needs a whole system solved at once |
Solution of a system of ODEs. A system has the form
with initial values . In vector form it is , and any single-variable method extends directly by applying it to every equation at each step.
For example, with RK4 for two equations , , compute for and for at the same stage values, then update
Higher-order equations are first reduced to such first-order systems.
Answer checked by Claude Sonnet · Oct 21, 2026
Test yourself · 2 MCQs
Loading…
- 2083 · 5 marks
Explain the classification of partial differential equations by order and linearity.
Answer
A partial differential equation (PDE) involves an unknown function of two or more independent variables and its partial derivatives.
Classification by order. The order is the highest-order partial derivative present.
- First order:
- Second order: (Laplace equation)
Classification by linearity.
- Linear: the unknown function and its derivatives appear only to the first power and are not multiplied together, with coefficients depending only on the independent variables, e.g. (heat equation).
- Semi-linear: linear in the highest-order derivatives, with coefficients that depend only on the independent variables, but the lower-order terms may be nonlinear, e.g. .
- Quasi-linear: linear in the highest-order derivatives, but their coefficients may depend on and lower derivatives, e.g. .
- Non-linear: the highest-order derivatives appear non-linearly, e.g. .
Second-order linear PDEs are further classified by the discriminant :
| Discriminant | Type | Example |
|---|---|---|
| Elliptic | Laplace: | |
| Parabolic | Heat: | |
| Hyperbolic | Wave: |
A PDE is also called homogeneous if every term contains or its derivatives, and non-homogeneous otherwise.
Answer checked by Claude Sonnet · Oct 21, 2026
Test yourself · 2 MCQs
Loading…
Questions from TU BIT 2078 Third Semester Data Structures and Algorithms (TU IOST semester board exam, 2078 (BS), via StudyNp), TU BIT 2079 Third Semester Data Structures and Algorithms (TU IOST semester board exam, 2079 (BS), via StudyNp), TU BIT 2080 Third Semester Data Structures and Algorithms (TU IOST semester board exam, 2080 (BS), via StudyNp), TU BIT 2082 Third Semester Data Structures and Algorithms (TU IOST semester board exam, 2082 (BS), via StudyNp), TU BIT 2083 Third Semester Data Structures and Algorithms (TU IOST semester board exam, 2083 (BS), via StudyNp), TU BIT 2078 Third Semester Database Management System (TU IOST semester board exam, 2078 (BS), via StudyNp), TU BIT 2079 Third Semester Database Management System (TU IOST semester board exam, 2079 (BS), via StudyNp), TU BIT 2080 Third Semester Database Management System (TU IOST semester board exam, 2080 (BS), via StudyNp), TU BIT 2082 Third Semester Database Management System (TU IOST semester board exam, 2082 (BS), via StudyNp), TU BIT 2083 Third Semester Database Management System (TU IOST semester board exam, 2083 (BS), via StudyNp), TU BIT 2078 Third Semester Numerical Methods (TU IOST semester board exam, 2078 (BS), via StudyNp), TU BIT 2079 Third Semester Numerical Methods (TU IOST semester board exam, 2079 (BS), via StudyNp), TU BIT 2080 Third Semester Numerical Methods (TU IOST semester board exam, 2080 (BS), via StudyNp), TU BIT 2082 Third Semester Numerical Methods (TU IOST semester board exam, 2082 (BS), via StudyNp), TU BIT 2083 Third Semester Numerical Methods (TU IOST semester board exam, 2083 (BS), via StudyNp), TU BIT 2078 Third Semester Operating Systems (TU IOST semester board exam, 2078 (BS), via StudyNp), TU BIT 2079 Third Semester Operating Systems (TU IOST semester board exam, 2079 (BS), via StudyNp), TU BIT 2080 Third Semester Operating Systems (TU IOST semester board exam, 2080 (BS), via StudyNp), TU BIT 2082 Third Semester Operating Systems (TU IOST semester board exam, 2082 (BS), via StudyNp), TU BIT 2083 Third Semester Operating Systems (TU IOST semester board exam, 2083 (BS), via StudyNp), TU BIT 2078 Third Semester Principles of Management (TU IOST semester board exam, 2078 (BS), via StudyNp), TU BIT 2079 Third Semester Principles of Management (TU IOST semester board exam, 2079 (BS), via StudyNp), TU BIT 2080 Third Semester Principles of Management (TU IOST semester board exam, 2080 (BS), via StudyNp), TU BIT 2082 Third Semester Principles of Management (TU IOST semester board exam, 2082 (BS), via StudyNp) and TU BIT 2083 Third Semester Principles of Management (TU IOST semester board exam, 2083 (BS), via StudyNp). Answers are written for this site; check them against your class notes.