CHAPTER 1: INTRODUCTION, APPROXIMATION AND ERRORS OF

COMPUTATION (2 HOURS) = (REQUIRED TIME: 45 MINUTES X 4 PERIODS)

Periods Sub-topic Methodology Code Time (min)

1.1 Introduction to Numerical Methods a. Fw, Sd a. 20

a. Introduction b. Ex b. 10
b. Need for Numerical Methods c. Ex c. 15
c. Importance d. Ex, Fg d. 15
1 d. Steps in numerical Methods e. Ex e. 15
e. Importance of Computer f. Ex f. 15
Programming in Numerical Methods
f. Use of Computer Programming in
Numerical Methods
1.2 Approximation & Errors a. Fw, Ex a. 20
a. Introduction b. Ex, Nu b. 10
2 b. Approximation c. Ex, Sd, Nu c. 40
c. Errors, Types, Error Calculation d. Ex, Nu d. 20
d. Taylor Series

SAMPLE THEORY QUESTIONS

1. Explain the importance of numerical methods in engineering.

2. What are the steps in numerical methods?
3. Explain different types of error.

SAMPLE NUMERICAL QUESTIONS

1. Find absolute, relative and percentage error if the number 752.6835 is truncated to four
significant digits.
2. Find absolute, relative and percentage error if the number 72.639 is truncated to three
significant digits.

CHAPTER 2: SOLUTION OF NONLINEAR EQUATIONS (5 HOURS) = (REQUIRED

TIME: 45 MINUTES X 10 PERIODS)

Periods Sub-topic Methodology Code Time (min)

2.1 Solution of Nonlinear Equations & a. Ex a. 10

Bisection Method b. Ex b. 10
3 a. Introduction c. Ex, Fg, De c. 20
b. Bracketing & Open Method d. Nu d. 20
c. Bisection Method e. Ex e. 10
 d. Bisection Method Examples f. Ex f. 10
e. Bisection Method Algorithms g. Ex, De g. 10
f. Bisection Method Advantages &
Disadvantages
g. Rate of Convergence of
Bisection Method
2.2 False Position Method a. Fw, Ex, De, Fg a. 30
a. Introduction b. Nu b. 10
b. Examples c. Ex c. 20
4
c. Algorithms d. Ex d. 10
d. Advantages & Disadvantages e. Ex, De e. 20
e. Rate of Convergence

2.3 Newton Raphson Method a. Fw, Ex, De, Fg a. 30

a. Introduction b. Nu b. 10
b. Examples c. Ex c. 20
5
c. Algorithms d. Ex d. 10
d. Advantages & Disadvantages e. Ex, De e. 20
e. Rate of Convergence

2.4 Secant Method a. Fw, Ex, De, Fg a. 30

a. Introduction b. Nu b. 10
b. Examples c. Ex c. 20
6
c. Algorithms d. Ex d. 10
e. Ex, De e. 20
d. Advantages & Disadvantages
e. Rate of Convergence
2.5 Fixed Point Iteration Method a. Fw, Ex, De, Fg a. 30
a. Introduction b. Nu b. 10
b. Examples c. Ex c. 20
7
c. Algorithms d. Ex d. 10
e. Ex, De e. 20
d. Advantages & Disadvantages
e. Rate of Convergence

SAMPLE THEORY QUESTIONS

1. Explain graphically how real root of nonlinear equation is obtained using Secant method.
2. Discuss the algorithms for Newton Raphson method.
3. Write a program in C to find real root of nonlinear equation using Bisection method.

SAMPLE NUMERICAL QUESTIONS

1. Find real root of nonlinear equation: cos(x) – xex = 0 using Secant Method.
2. Find root of nonlinear equation x3 – 3x-11=0 using Newton Raphson method taking 0.9
as initial guess.
CHAPTER 3: SOLUTION OF SYSTEM OF LINEAR ALGEBRAIC EQUATIONS (6
HOURS) = (REQUIRED TIME: 45 MINUTES X 12 PERIODS)

Periods Sub-topic Methodology Code Time (min)

3.1 Introduction & Gauss Elimination a. Fw, Ex, Eg a. 10

Method b. Ex b. 10
a. Introduction c. Ex c. 10
b. Gauss Elimination Method d. Nu d. 20
c. Gauss Elimination Method with e. Ex, De e. 10
Pivoting Strategy f. Ex f. 20
8 d. Gauss Elimination Method g. Ex g. 10
Example
e. Computational Complexity of
Gauss Elimination Method
f. Gauss Elimination Method
Algorithm
g. Advantages & Disadvantages
3.2 Gauss Jordan Method a. Fw, Ex, De a. 20
a. Introduction b. Nu b. 20
9 b. Numerical Examples c. Ex, De c. 10
c. Computational Complexity d. Ex d. 20
d. Algorithms e. Ex e. 20
e. Advantages & Disadvantages
3.3 LU Factorization Method a. Fw, Ex a. 10
a. Introduction to Factorization b. Ex, De b. 10
Method c. Nu c. 20
b. LU Factorization Method d. Ex, De d. 10
10 c. Numerical Examples e. Ex e. 20
d. Computational Complexity f. Ex f. 20
e. Algorithms
f. Advantages & Disadvantages

3.4 Iterative Methods & Jacobi Iteration a. Fw, Ex, Me a. 10

a. Introduction to Iterative Method b. Ex, De b. 20
b. Jacobi Methods c. Nu c. 20
11 c. Jacobi Method Examples d. Ex, Eg d. 10
d. Convergence of Jacobi Method e. Ex e. 20
e. Algorithms f. Ex f. 10
f. Advantages & Disadvantages
3.5 Seidel Iteration a. Fw, Ex, De, Me a. 10
12 a. Introduction b. Nu b. 30
b. Examples c. Ex, Eg, Me c. 20
c. Convergence d. Ex d. 20
 d. Algorithms e. Ex e. 10
e. Advantages & Disadvantages
3.6 Power Method a. Fw, Ex, De a. 30
a. Introduction b. Nu b. 30
13 b. Examples c. Ex, Eg c. 20
c. Algorithms d. Ex d. 10
d. Advantages & Disadvantages

SAMPLE THEORY QUESTIONS

1. Explain procedure for solving system of linear equation using Gauss Jordan method.
2. Write algorithms for solving system of linear equation using Gauss Elimination method.
3. Compare computational complexity of Gauss Elimination and Gauss Jordan method.
4. Explain procedure for Seidel iteration.

SAMPLE NUMERICAL QUESTIONS

1. Solve x+y+z=9, 2x-3y+4z=13, 3x+4y+5z=40 using LU factorization method.

2. Solve 3x + 20y - z = -18 2x - 3y + 20z = 25 20x + y - 2z = 17 using Seidel iteration
method.
5 4
3. Find numerically dominant Eigen value and Eigen vector of [ ] using power method.
1 2

CHAPTER 4: INTERPOLATION (7 HOURS) = (REQUIRED TIME: 45 MINUTES X 14

PERIODS)

Periods Sub-topic Methodology Time (min)

Code

4.1 Interpolation a. Fw, Ex a. 20

b. Ex b. 10
a. Introduction c. Ex, Me c. 10
b. Introduction to Finite Difference d. Ex, Me d. 10
14 c. Newton’s Forward Difference and Table e. Ex, Me e. 10
d. Newton’s Backward Difference & Table f. Ex, Me f. 10
e. Central Difference & Table g. Ex, Me g. 20
f. Divided Difference & Table
g. Difference Operators and Relations
4.2 Newton’s Forward & Backward Interpolation a. Fw, Ex, Eg a. 10
15 b. Ex, De, Me b. 20
a. Introduction c. Ex, De, Me c. 20
b. Derivation for Forward d. Nu d. 30
 c. Derivation for Backward e. Ex e. 10
d. Numerical Examples
e. Use Case
4.3 Central Difference Interpolation a. Fw, Ex a. 10
b. Me, Ex b. 15
a. Introduction c. Me, Ex c. 15
b. Stirling’s Formula d. Nu d. 40
16 c. Bessel’s Formula e. Ex e. 10
d. Numerical Examples on Stirling & Bessel
e. Use Case

4.4 Interpolation with Unequal Intervals a. Fw, Ex, De, a. 45

Me, Nu b. 45
a. Lagrange Interpolation: Introduction, b. Ex, De, Me,
17 Derivation, Numerical Examples, Nu
algorithms, Use Case
b. Newton’s Divided Difference
Interpolation: Introduction, Derivation,
Numerical Examples, algorithms, Use Case
4.5 Curve Fitting a. Fw, Ex a. 10
b. Ex, De, Me b. 30
a. Introduction c. De, Ex, Nu c. 25
b. Least Square Method: Introduction, d. De, Ex, Nu d. 25
18 Derivation
c. Fitting Linear Equation: Procedure,
Examples and Algorithms
d. Fitting Nonlinear Equation: Procedure,
Examples and Algorithms
4.6 Fitting Transcendental Equations a. Ex, De, Nu a. 90
19
a. Introduction, Procedure, Algorithms and
Examples for y=abx, y=axb, y=aebx
4.7 Cubic Spline Interpolation a. Ex, Eg a. 20
b. De, Me b. 35
20 a. Introduction c. Nu c. 35
b. Derivation
c. Numerical Examples

SAMPLE THEORY QUESTIONS

1. Derive Newton’s forward interpolation formula.

2. Write procedure to find curve of best fit for y = aebx.
3. Write algorithms for Lagrange interpolation.
4. Write a program in C for linear regression.
SAMPLE NUMERICAL QUESTIONS

1. The table gives the distance in nautical miles of the visible horizon for the given heights
in feet above the earth’s surface:
x = height 100 150 200 250 300 350 400

y = distance 10.63 13.03 15.04 16.81 18.42 19.90 21.27

a. Find y when x = 218 ft.

b. Find y when x = 410 ft.
c. Find y when x = 280 ft.
2. Find the missing term in the following table using Lagrange interpolation:
x: 0 1 2 3 4

y: 1 3 9 ? 81

CHAPTER 5: NUMERICAL DIFFERENTIATION AND INTEGRATION (5 HOURS) =

(REQUIRED TIME: 45 MINUTES X 10 PERIODS)

Periods Sub-topic Methodology Code Time (min)

5.1 Numerical Differentiation a. Fw, Ex a. 10

a. Introduction b. De, Me, Ex, Nu b. 20
b. Differentiation Using Forward c. De, Me, Ex, Nu c. 20
Difference Formula: Derivation, d. De, Me, Ex, Nu d. 20
Examples e. Ex e. 10
21 c. Differentiation Using Backward
Difference Formula: Derivation,
Examples
d. Differentiation Using Central
Difference Formula: Derivation,
Examples
e. Maxima & Minima
5.2 Numerical Integration a. Fw, Ex a. 10
b. De, Me, Ex b. 20
a. Introduction c. De, Me, Ex c. 20
22 b. Quadrature Formula Derivation d. De, Me, Ex d. 20
c. Derivation for Trapezoidal Rule e. De, Me, Ex e. 20
d. Derivation for Simpson’s 1/3 Rule
e. Derivation for Simpson’s 3/8 Rule
 5.3 Numerical Integration Examples a. Nu a. 30
b. Nu b. 30
23 a. Trapezoidal Examples c. Nu c. 30
b. Simpson’s 1/3 Examples
c. Simpson’s 3/8 Examples
5.4 Numerical Integration Algorithms & a. Fw, Ex a. 20
Error Analysis b. Ex b. 20
a. Algorithm for Trapezoidal Methods c. Ex c. 20
b. Algorithm for Simpson’s 1/3 d. Ex, Eg, Me, De d. 30
24 Method
c. Algorithm for Simpson’s 3/8
Method
d. Errors in Trapezoidal, Simpson’s
1/3 and Simpson’s 3/8 Method
25 5.5 Romberg & Gaussian Integration a. Fw, Ex, De, Me, a. 45
a. Romberg Integration: Procedure, Nu b. 45
Numerical Examples b. Ex, Me, Nu
b. Gaussian Integration: Formula,
Numerical Examples

SAMPLE THEORY QUESTIONS

1. Derive formula to find numerical first and second derivative using Newton’s forward
interpolation formula.
2. Derive Newton’s Cote general quadrature formula for numerical integration.
3. Write algorithms to integrate given function using Simpson’s 1/3 rule.
4. Write a program in C to find numerical integration of given function using Trapezoidal
method.

SAMPLE NUMERICAL QUESTIONS

1. Find dy/dx and d2y/dx2 at x = 200 for the following data:

x 100 150 200 250 300 350 400

y 10.63 13.03 15.04 16.81 18.42 19.90 21.27

6 1
2. Find numerical integration of: ∫0 𝑑𝑥 taking 12 sub-intervals using:
1+𝑥 2
a. Trapezoidal Method
b. Simpson’s 1/3 Method
c. Simpson’s 3/8 Method

CHAPTER 6: SOLUTION OF ORDINARY DIFFERENTIAL EQUATIONS (5 HOURS) =

(REQUIRED TIME: 45 MINUTES X 10 PERIODS)
Periods Sub-topic Methodology Code Time (min)

6.1 Ordinary Differential Equation a. Fw, Ex, Eg a. 20

b. Ex b. 10
a. Introduction c. Nu c. 20
b. Real world examples d. Ex d. 10
c. Solving ordinary differential equation e. Ex e. 20
26 in standard form using analytical f. Ex f. 10
approach.
d. Understanding initial value problem
(IVP) and boundary value problem
(BVP).
e. Examples of IVP & BVP
f. Need for Numerical Approach
6.2 Euler’s Method a. Fw, Ex a. 5
b. De, Me, Ex, Fg b. 15
a. Introduction c. Nu c. 20
b. Derivation d. Ex d. 20
27 c. Numerical Examples e. Ex e. 10
d. Algorithms f. De, Me, Ex, Fg f. 10
e. Drawbacks g. Nu g. 10
f. Modified Euler’s Method
g. Numerical Examples
6.3 Runge Kutta (RK) Method a. Fw, Ex, Me a. 10
b. Ex, Me, Nu b. 40
a. RK Method Procedure c. Ex, Me, Nu c. 40
28 b. RK Method for 1st order with
Examples
c. RK Method for 2nd order with
Examples
6.4 Solution of BVP Using Finite Method a. Fw, Ex a. 10
b. Ex, Me, De b. 20
a. Finite Method Introduction c. Ex, Me c. 20
29 b. Finite Difference Approximation d. Nu d. 40
Using Taylor’s Series
c. Procedure for Solving BVP using
Finite Difference
d. Numerical Examples
6.5 Solution of BVP Using Shooting Method a. Fw, Ex, Me a. 20
b. Ex, Me b. 30
30 a. Shooting Method Background c. Nu c. 40
b. Shooting Method Procedure
c. Shooting Method Examples

SAMPLE THEORY QUESTIONS

 1. Derive Euler’s method to approximate solution of first order differential equation.
2. Write procedure to find solution of second order ordinary differential equation using RK
method.
3. Write a program in C to find numerical solution of first order differential equation given
initial condition.

SAMPLE NUMERICAL QUESTIONS

1. Given dy/dx = x+y, y(0) = 1, find y at x =0.3 using:

a. Euler’s Method
b. Modified Euler’s Method
c. RK Method
2. Solve d2y/dx2 = x+y with the boundary conditions y (0) = y (1) = 0 taking finite
difference h = ¼.

CHAPTER 7: NUMERICAL SOLUTION OF PARTIAL DIFFERENTIAL EQUATION

(5 HOURS) = (REQUIRED TIME: 45 MINUTES X 10 PERIODS)

Periods Sub-topic Methodology Code Time (min)

7.1 Partial Differential Equation a. Fw, Ex a. 10

b. Ex, Eg b. 20
a. Introduction c. Me, Ex c. 10
31 b. Real World Examples d. Me, Ex d. 20
c. General Form e. Nu e. 30
d. Classification
e. Numerical Examples on
Classification
7.2 Laplace Equation a. Fw, Ex a. 10
b. Me, Ex b. 10
a. Introduction c. De, Me, Ex, Fg c. 25
b. General Form d. Me, Ex d. 5
32 c. Standard 5 Point Formula e. Ex e. 10
Derivation f. Nu f. 30
d. Diagonal 5 Point Formula
e. Numerical Solution of Laplace
Equation Procedure
f. Numerical Examples
7.3 Poisson’s Equation a. Fw, Ex a. 10
33 b. Me, Ex b. 10
a. Introduction c. Me, De, Ex, Fg c. 30
b. General Form d. Nu d. 40
 c. Numerical Solution of Poisson
Equation Procedure Using Finite
Difference Approach
d. Numerical Examples
7.4 Relaxation Method a. Fw, Ex a. 10
b. Ex, Me, Fg b. 30
34 a. Introduction c. Nu c. 50
b. Procedure
c. Numerical Examples
7.5 Schmidt Method a. Fw, Ex a. 10
b. Ex, Me b. 10
a. Introduction to 1D Heat c. Ex c. 10
Equation d. De, Me, Ex d. 20
35 b. Real World Examples e. Ex e. 10
c. General Form f. Nu f. 20
d. Finite Difference Approximation g. Ex g. 10
e. Numerical Solution Procedure
f. Numerical Examples
g. Final Words

SAMPLE THEORY QUESTIONS

1. Derive standard 5-point formula for approximating Laplace equation.

2. How do you solve Poisson’s equation numerically? Explain complete procedure.
3. Explain procedure to solve 1D heat equations using Schmidt method.

SAMPLE NUMERICAL QUESTIONS

1. Solve the partial differential equation ∆2u = 0 under the conditions: h=1, u (0, y) =0, u (4,
y) =12+y for 0≤y≤4, u(x,0) = 3x and u(x,4) = x2 for 0≤x≤4.
2. Solve the partial differential equation ∆2u = -10(x2+y2+10) over the square with sides
x=0=y, x=3=y with u=0 on the boundary and mesh length = 1.