Minutes of the meeting of BOS of Maths , held on 27,06.

09 in the
Committee Room
The following members were present:
1. Dr. Ram Autar,
Head, Maths Deptt.
2. Dr. R.S.Gupta,
Prof. Maths, KNIT, Sultanpur
3. Dr. V.K.Katiyar,
Prof., Maths, IIT, Roorkee
4. Dr. Rekha Bali,
Asstt. Prof, Maths Deptt.
5. Dr. Ram Naresh,
Asstt. Prof, Maths Deptt.
6. Dr. S.U.Siddiquie, Asstt. Prof, Maths Deptt.
7. Dr. Sapna,
Lecturer, Maths Deptt.
8. Prof. Onkar Singh , Head, Mech. Engg, Deptt.
9. Prof. A.K.Mishra,
Head, Chem Engg, Deptt.
10.Dr. Karunakar Singh, Actg. Head, BEFT Deptt.
11.Dr. P.K.Kamani,
Actg. Head, OPT Deptt.
12.Dr. Deepak Srivastava, Actg. Head, Plastic Deptt.
13.Mr. Pradeep Kumar, Actg. Head, CE Deptt
14.Mrs. Rajni Bisht,
Head, ET Deptt.

Chairman
Member
Member
Member
Member
Member
Member
Member
Member
Member
Member
Member
Member
Member

The course contents/syllabi of various courses to be offered to B.Tech. students and

MCA students by Maths Deptt. were discussed and finalized as per details attached
herewith.

(Ram Autar)
Chairman,
BOS of Maths

HMA-101: MATHEMATICS -1
(B Tech, Ist Semester)

L T P
3 1 0

Unit I- Functions of One Real Variable:

Successive differentiation, Leibnitz theorem, Differentials and approximations, Mean value theorms,
Convergence of series, Expansion of functions, Improper integrals, Convergence, Beta and Gamma
functions.
Unit II- Functions of Several Real Variables:
Limit, Continuity, Partial differentiation, Total differential and approximations, Jacobian, Eulers theorem,
Expansion of functions, Multiple integrals, Change of order, Change of variables, Applications to area,
volume, mass, surface area etc. Dirichlets Integral & Applications.
Unit III- Vector Calculus:
Overview of solid geometry, Point functions, differentiation, Gradient, Directional derivative, Divergence
and Curl of a vector and their physical interpretations, Solenoidal & irrotational fields, Integration, Line,
Surface and Volume integrals, Greens, Stokes and Gauss Divergence theorems and applications.
Unit IV Matrices and Linear Algebra:
Vector space and subspace, linear dependence, dimensions and basis, Linear transformation, Elementary
transformations, Echelon form, rank & nullity, Consistency of linear system of equations and their
solutions, characteristic equation, Cayley Hamilton theorem, Real and complex eigenvalues and
eigenvectors, diagonalisation, quadratic forms, complex, orthogonal, and unitary matrices, Cryptography, An
error correcting code, discrete compartmental models, system stability.
Unit V Optimization:
Engineering applications of optimization, statement and classification of optimization problems,
optimization techniques, single variable optimization, multi variable optimization with no constraint, with
equality and inequality constraints, Linear Programming Problems, Graphical method and Simplex method.
Books Recommended:
1. R. K. Jain & S. R. K. Iyengar; Advanced Engineering Mathematics, Narosa Publishing House, 2002.
2. Erwin Kreyszig; Advanced Engineering Mathematics, John Wiley & Sons 8th Edition.
3. Dennis G, Zill & Michael R. Cullen; Advanced Engineering Mathematics, Jones & Bartlett
Publishers. 2nd Edition.
4. S. S. Rao; Optimization: Theory & Applications, Wiley Eastern Limited.

HMA-102: DISCRETE STRUCTURES

(MCA, I Semester)

LTP
3 1 0

UNIT I: Fundamentals of Logic:

Propositional Logic: Propositions, Basic logic operations and truth tables, Tautologies, Contradictions, Contigency,
Algebra of propositions, Logical equivalence: the laws of logic, Logical implication: Rules of inference, Logical
analysis of arguments, Some computing applications (Normal forms), Functionally complete set of operations, Formal
proofs.
First Order Logic:Predicates & quantifiers, Nested quantifiers, Use of quantifiers, Rules of inference, Validity of
arguments.
Notion of Proofs: Proof by counter example, the contraposition, proof by contradiction, inductive proofs.
UNIT II: Set Theory, Relations and Functions
Set Theory: sets & subsets, Venn diagrams, Set operations and laws, countable and uncountable sets, Cartesian
product, Cardinality, Principle of inclusion- exclusion.
Relations: Relation, Representation & properties, n-ray relations and applications, Composition of relations, Closures
of relations, Equivalence relation & partitions, partial orders, compatibility relation.
Functions: Functions and its types, Inverse function, Composition of functions, Special functions, Recursively
defined functions, Computational Complexity, Analysis of algorithms.
Theorem Proving Techniques: Mathematical induction, strong induction, and well ordering, structural induction,
Pigeonhole principle.
UNIT III: Algebraic Structures and Coding Theory
Algebraic Structures: Definition, Properties, Semi group, Monoid, Group, Properties of groups, Subgroup, Cyclic
group, Cosets and Lagranges theorem, Permutation groups, Normal subgroup, Homomorphism and isomorphism of
groups, Congruence relation, Rings and Fields. Example and standard results.
Coding Theory: Elements of coding theory, Hamming matric, Parity-check and generator matrices, Coding and
error detection, Group codes: decoding with coset leaders and error correction, Hamming matrices.
UNIT IV: Partially Ordered Structures
Posets,: Definitions, ordered set, Hasse diagram, isomorphic ordered set, well ordered set, Minimal and Maximal
elements, LUB & GLB etc.
Lattices: Definition & Properties, Product Lattices, Isomorphic Lattices, Applications, Types of Lattices
Boolean Algebras: Definitions & Properties, SOP & POS forms, Logic gates and minimization of circuits, Karnaugh
maps, Quine-McClusky method.
Trees: Definition & Examples and Properties , Rooted tree, Binary tree, Tree traversal, application in computer
science and engineering .
UNIT V: Combinatorics and Graph Theory:
Combinatorics: Basic counting techniques,Discrete numeric functions and properties, Recurrence relations and their
applications (modelling), various methods of solutions, system of recurrence relations, OGF & EGF, properties,
applications: solution of recurrence relations and combinatorial problems. Polyas enumeration theorem and
applications.
Graphs: Graphs and graph models, terminology, matrices associated with graphs, Isomorphism, Special types of
graphs, connectedness, Euler and Hamilton graphs with their applications, trees with properties, MST, planer graphs
and applications, criteria of planarity, Graph coloring and coloring models, directed graphs.
Books Recommended:
1. Trembley, J.P. & R. Manohar, Discrete Mathematical Structures with Applications to Computer Science,
McGraw Hill.
2. Kenneth H. Rosen, Discrete Mathematics and its Applications, McGraw Hill.
3. Ralph, P. Garimaldi, Discrete & Combinatorial Mathematics Pearson Publication, Asia.
4. Deo, Narsingh,Graph Theory with applications to Engineering & Computer Science, PHI.
5. Krishnamurthy, V., Combinatorics Theory & Application, East-West Press Pvt. Ltd., New Delhi.

HMA-201: Mathematics II
(B Tech., II Semester)

L T P
3 1 0

Unit I: Differential Equations:

First order differential equations as mathematical models, Existence and uniqueness of solutions of initial value
problems, Solution of linear and nonlinear models, Systems: linear and nonlinear models and their solutions: Solution
of higher order linear differential equation with constant coefficients, Solution of second order differential equations
by changing dependent and independent variables, Methods of diagonalization, undetermined coefficients and
variation of parameters: Cauchy- Euler equations, Nonlinear equations, Linear and nonlinear models, Initial value and
boundary value problems, Systems of linear and nonlinear differential equations and models solutions, Introduction to
local and global system stability analysis.

Unit II: Series Solutions and Special Functions:

Ordinary and singular points of an equation, Power series solutions, Frobenius method, Bessels and Legendres
equations and their series solutions, Properties of Legendres polynomials and Bessels functions, Generating
functions, Fourier- Bessel series and Fourier-Legendre series expansions, Sturm- Liouville Problem.

Unit III: Partial Differential Equations and Fourier Series:

Development of partial differential equations and solutions, Solution of first order partial differential equations,
Solutions of linear higher order partial differential equations with constant coefficients, Classification of second order
partial differential equations.
Orthogonal functions, Fourier series, existence conditions, Fourier series of even and odd functions,
Convergence of Fourier series, Fourier half range series, Harmonic analysis, Complex Fourier series and frequency
spectrum.

Unit IV: Laplace Transform:

Laplace transform, Existence conditions and ROC, Inverse Laplace transform, Operational properties, Convolution,
Unit step function, Dirac-Delta function, Periodic functions, Applications to solve IVP and BVP: Linear ordinary
differential equations, Integral equations, Integro-differential equations, Transfer function and control system analysis.

Unit V: Modeling and Boundary-Value Problems:

Modeling of heat flow and vibrating string: derivation of heat flow, wave and Laplace equations in rectangular
coordinates, Boundary value problems and their solutions by the method of separation of variables, Nonhomogeneous
equations and boundary conditions, Orthogonal series expansions, Fourier series in two dimensions, Boundary value
problems in polar, cylindrical and spherical coordinate systems and their solutions.

Books Recommended:
1. Dennis G, Zill & Michael R. Cullen; Advanced Engineering Mathematics, Jones & Bartlett Publishers. 2 nd
Edition.
2. R. K. Jain & S. R. K. Iyengar; Advanced Engineering Mathematics, Narosa Publishing House, 2002.
3. Erwin Kreyszig; Advanced Engineering Mathematics, John Wiley & Sons 8 th Edition.

HMA-202:COMPUTER ORIENTED NUMERICAL AND

STATISTICAL TECHNIQUES
(MCA , II Semester )

LT P

3 1 0
UNIT I: Nonlinear Equations and Simultaneous Linear Equations:
Roots of nonlinear equation, Methods of solution, Order of convergence of iterative methods, Simple roots: Bisection,
False position, Secant, Newton-Raphson, Chebyshev, Iteration and multi point iteration methods, Multiple roots:
Newton-Raphson and Chebyshev, Complex roots: Newton-Raphson and Mullers method, a system of nonlinear
equations: Newton-Raphson and Iteration methods, Polynomial equations: Bairstows method, convergence analysis
of above methods.
Linear systems: Introduction, Direct methods, Operation count, Pivoting, Ill conditioned linear systems & condition
number, Iteration methods: Jacobi, Gauss-Seidel, SOR methods, convergence conditions. Special system of equations:
Thomas algorithm. Eigen value problems: Givens and Power methods.

UNIT II: Interpolation, Differentiation and Integration:

Curve fitting: Polynomial interpolation, error, Existence and Uniqueness, Truncation error bounds, difference
operators, Newton forward and backward difference interpolations, Lagrange, Newton divided difference and Iterated
interpolations, Stirling and Bessels interpolations, Spline interpolation, Least squares and Chebyshev approximations.
Numerical Differentiation: Methods based on interpolation, Error analysis.
Numerical Integration: Methods based on interpolations (Trapezoidal, Simpsons 1/3 , Simpsons 3/8 rule), Gauss
quadrature methods, Romberg integration, Error bounds and estimates.

UNIT III: Numerical Solution of Ordinary Differential Equations:

Initial-value problems, Single step methods: Taylors, Picards, Eulers, Modified Eulers method and Runge -Kutta
method (Fourth Order), Error estimates, Multi-step methods: Adams-Bashforth and Milnes methods, convergence
and stability analysis, Simultaneous and Higher order equations: RK Fourth order method.

Unit IV: Curve Fitting, Correlation, Regression and Probability:

Curve-fitting, method of least- squares , fitting of straight lines, polynomials, non-linear and exponential curves etc.,
correlation analysis, linear, non-linear and multi-regression analysis, probability, random variables and probability
distributions, expectation, moments and transform methods, Binomial, Poisson and Normal distributions, overview of
t-distribution, F-distribution and 2-distribution.

Unit V: Statistical Methods:

Sampling theory, parameter estimation, confidence intervals, tests of hypotheses and significance; z-, t-, F-, and 2
tests, goodness of fit test - 2 test, analysis of variance, non-parametric tests (Simple application), time series analysis,
index numbers, quality control charts and acceptance sampling, Introduction to design of experiments, Forecasting
models.

Books Recommended:
1. M.K.Jain, S.R.K. Iyengar & R.K.Jain, Numerical methods for Scientific and Engineering Computation, New
2.
3.
4.
5.

age International Publication.

S.S. Sastry, Introductory Methods of Numerical Analysis, Eastern Economy Edition.
S. Rajasekaran, Numerical Method in Science and Engineering, Wheeler Publishing House.
B.S. Grewal, Numerical Method in Engineering & Science, Khanna Publishers.
D. L. Harnett, Statistical methods.

HMA-252: COMPUTER ORIENTED NUMERICAL AND

STATISTICAL TECHNIQUES LAB
(MCA, II Semester)

Develop Programs of the following techniques in C/C++ Language:

1. To implement iterative methods to solve nonlinear equations.
2. To implement iterative methods to solve a system of linear equations.
3. To implement Newtons divided difference and Lagranges interpolation formulae.
4. To implement Numerical differentiation.
5. To implement Numerical integration using Trapezoidal, Simpson 1/3 and Simpson 3/8 rules.
6. To implement single step/ multi step methods to solve initial value problems.
7. To implement least squares method for curve fitting.
8. To find correlation coefficient, regression coefficients and lines of regression.
9. To implement tests of hypothesis and significance.
10. To implement non parametric tests.
11. To determine the confidence interval to implement ANOVA.

LTP
0 0 3

HMA-301: MATHEMATICS III

(CE/EE/ME/CHE/BE/FT/OT/PT/PL/LT- III Semester)

L T P
3 1 0

Unit I: Transform Methods:

Fourier integral, conditions of convergence, Fourier sine and cosine integrals, complex form, applications, Fourier
transform pairs, existence conditions, operational properties. Applications of Laplace transform and Fourier transform
to solve boundary value problems, Discrete and Fast Fourier transforms and its applications.
Development of difference equations as models, operator method, method of undetermined coefficients, Z-transform
pairs, ROC. Operational properties, limiting- value theorems, its applications to solve difference equations and BVP,
systems of difference equations.

Unit II: Functions of a Complex Variable and Conformal Mapping:

Limit, continuity, differentiability and analyticity, Cauchy-Riemann equations, harmonic functions, complex functions
as mappings, linear transformation, inverse transformation, bilinear transformation, conformal mapping, applications.

Unit III: Integration of Complex Functions:

Contour integrals and evaluations, Cauchy- integral theorem, Cauchys integral formulae, Liouvilles theorem,
convergence of power series, Taylor series, Laurent series, zeros and singularities of a complex function, residues and
residue theorem, evaluation of definite and improper integrals.

Unit IV: Curve Fitting, Correlation, Regression and Probability:

Curve-fitting, method of least- squares , fitting of straight lines, polynomials, non-linear and exponential curves etc.,
correlation analysis, linear, non-linear and multi-regression analysis, probability, random variables and probability
distributions, expectation, moments and transform methods, Binomial, Poisson and Normal distributions, overview of
t-distribution, F-distribution and 2-distribution.

Unit V: Statistical Methods:

Sampling theory, parameter estimation, confidence intervals, tests of hypotheses and significance; z-, t-, F-, and 2
tests, goodness of fit test - 2 test, analysis of variance, non-parametric tests (Simple application), time series analysis,
index numbers, quality control charts and acceptance sampling, Introduction to design of experiments, Forecasting
models.

Books Recommended:
1. Dennis G, Zill & Michael R. Cullen; Advanced Engineering Mathematics, Jones & Bartlett Publishers. 2 nd
Edition.
2. R. K. Jain & S. R. K. Iyengar; Advanced Engineering Mathematics, Narosa Publishing House, 2002.
3. Erwin Kreyszig; Advanced Engineering Mathematics, John Wiley & Sons 8 th Edition.

HMA-302: COMPUTER ORIENTED NUMERICAL AND

STATISTICAL TECHNIQUES
(CS, ET, IT, III Semester)
3 1 0
UNIT I: Nonlinear Equations and Simultaneous Linear Equations:

L T P

Roots of nonlinear equation, Methods of solution, Order of convergence of iterative methods, Simple roots: Bisection,
False position, Secant, Newton-Raphson, Chebyshev, Iteration and multi point iteration methods, Multiple roots:
Newton-Raphson and Chebyshev, Complex roots: Newton-Raphson and Mullers method, a system of nonlinear
equations: Newton-Raphson and Iteration methods, Polynomial equations: Bairstows method, convergence analysis
of above methods.
Linear systems: Introduction, Direct methods, Operation count, Pivoting, Ill conditioned linear systems & condition
number, Iteration methods: Jacobi, Gauss-Seidel, SOR methods, convergence conditions. Special system of equations:
Thomas algorithm. Eigen value problems: Givens and Power methods.

UNIT II: Interpolation, Differentiation and Integration:

Curve fitting: Polynomial interpolation, error, Existence and Uniqueness, Truncation error bounds, difference
operators, Newton forward and backward difference interpolations, Lagrange, Newton divided difference and Iterated
interpolations, Stirling and Bessels interpolations, Spline interpolation, Least squares and Chebyshev approximations.
Numerical Differentiation: Methods based on interpolation, Error analysis.
Numerical Integration: Methods based on interpolations (Trapezoidal, Simpsons 1/3 , Simpsons 3/8 rule), Gauss
quadrature methods, Romberg integration, Error bounds and estimates.

UNIT III: Numerical Solution of Ordinary Differential Equations:

Initial-value problems, Single step methods: Taylors, Picards, Eulers, Modified Eulers method and Runge -Kutta
method (Fourth Order), Error estimates, Multi-step methods: Adams-Bashforth and Milnes methods, convergence
and stability analysis, Simultaneous and Higher order equations: RK Fourth order method.

Unit IV: Curve Fitting, Correlation, Regression and Probability:

Curve-fitting, method of least- squares , fitting of straight lines, polynomials, non-linear and exponential curves etc.,
correlation analysis, linear, non-linear and multi-regression analysis, probability, random variables and probability
distributions, expectation, moments and transform methods, Binomial, Poisson and Normal distributions, overview of
t-distribution, F-distribution and 2-distribution.

Unit V: Statistical Methods:

Sampling theory, parameter estimation, confidence intervals, tests of hypotheses and significance; z-, t-, F-, and 2
tests, goodness of fit test - 2 test, analysis of variance, non-parametric tests (Simple application), time series analysis,
index numbers, quality control charts and acceptance sampling, Introduction to design of experiments, Forecasting
models.

Books Recommended:
1. M.K.Jain, S.R.K. Iyengar & R.K.Jain, Numerical methods for Scientific and Engineering Computation, New
2.
3.
4.
5.

age International Publication.

S.S. Sastry, Introductory Methods of Numerical Analysis, Eastern Economy Edition.
S. Rajasekaran, Numerical Method in Science and Engineering, Wheeler Publishing House.
B.S. Grewal, Numerical Method in Engineering & Science, Khanna Publishers.
D. L. Harnett, Statistical methods.

HMA-352:COMPUTER ORIENTED NUMERICAL AND

STATISTICAL TECHNIQUES LAB
(II ET, III Semester)

Develop Programs of the following techniques in C/C++ Language:

1. To implement iterative methods to solve nonlinear equations.
2. To implement iterative methods to solve a system of linear equations.
3. To implement Newtons divided difference and Lagranges interpolation formulae.
4. To implement Numerical differentiation.
5. To implement Numerical integration using Trapezoidal, Simpson 1/3 and Simpson 3/8 rules.
6. To implement single step/ multi step methods to solve initial value problems.
7. To implement least squares method for curve fitting.
8. To find correlation coefficient, regression coefficients and lines of regression.
9. To implement tests of hypothesis and significance.
10. To implement non parametric tests.
11. To determine the confidence intervals/ to implement ANOVA.

LTP
0 0 3

HMA-303: DISCRETE MATHEMATICAL STRUCTURES

(CS, IT; III Semester)

L T P
3 1 0

UNIT I: Fundamentals of Logic

Propositional Logic: Propositions, Basic logic operations and truth tables, Tautologies, Contradictions, Contigency,
Algebra of propositions, Logical equivalence: the laws of logic, Logical implication: Rules of inference, Logical
analysis of arguments, Some computing applications (Normal forms), Functionally complete set of operations, Formal
proofs.
First Order Logic: Predicates & quantifiers, Nested quantifiers, Use of quantifiers, Rules of inference, Validity of
arguments, Proof methods.
UNIT II: Set Theory, Relations and Functions
Set Theory: sets & subsets, Venn diagrams, Set operations and laws, countable and uncountable sets, Cartesian
product, Cardinality, Principle of inclusion- exclusion.
Relations: Relation, Representation & properties, n-ray relations and applications, Composition of relations, Closures
of relations, Equivalence relation & partitions, partial orders, compatibility relation.
Functions: Functions and its types, Inverse function, Composition of functions, Special functions, Recursively
defined functions, Computational Complexity, Analysis of algorithms.
Theorem Proving Techniques: Mathematical induction (weak, strong, structural) and its applications, Proof by
contradiction, Pigeonhole principle..
UNIT III: Algebraic Structures and Coding Theory
Algebraic Structures: Definition, Properties, Semi group, Monoid, Group, Properties of groups, Subgroup, Cyclic
group, Cosets and Lagranges theorem, Permutation groups, Normal subgroup, Homomorphism and isomorphism of
groups, Congruence relation, Rings and Fields. Example and standard results.
Coding Theory: Elements of coding theory, Hamming matric, Parity-check and generator matrices, Coding and
error detection, Group codes: decoding with coset leaders and error correction, Hamming matrices.
UNIT IV: Partially Ordered Structures
Posets,: Definitions, ordered set, Hasse diagram, isomorphic ordered set, well ordered set, Minimal and Maximal
elements, LUB & GLB etc.
Lattices: Definition & Properties, Product Lattices, Isomorphic Lattices, Applications, Types of Lattices
Boolean Algebras: Definitions & Properties, SOP & POS forms, Logic gates and minimization of circuits, Karnaugh
maps, Quine-McClusky method.
Trees: Definition & Examples and Properties , Rooted tree, Binary tree, Tree traversal, application in computer
science and engineering .
UNIT V: Combinatorics and Graph Theory:
Combinatorics: Discrete numeric functions and properties, Recurrence relations and their applications (modelling),
various methods of solutions, system of recurrence relations, OGF & EGF, properties, applications: solution of
recurrence relations and combinatorial problems.
Graphs: Graphs and graph models, terminology, matrices associated with graphs, Isomorphism, Special types of
graphs, connectedness, Euler and Hamilton graphs with their applications, trees with properties, MST, planer graphs
and applications, criteria of planarity, Graph coloring and coloring models, directed graphs.
Books Recommended:
1. Trembley, J.P. & R. Manohar, Discrete Mathematical Structures with Applications to Computer Science,
McGraw Hill.
2. Kenneth H. Rosen, Discrete Mathematics and its Applications, McGraw Hill.
3. Ralph, P. Garimaldi, Discrete & Combinatorial Mathematics Pearson Publication, Asia.
4. Deo, Narsingh,Graph Theory with applications to Engineering & Computer Science, PHI.
5. Krishnamurthy, V., Combinatorics Theory & Application, East-West Press Pvt. Ltd., New Delhi.

10

HMA-304: COMPUTER BASED OPTIMIZATION TECHNIQUES

(MCA, III Semester)
LTP
310
UNIT I: Optimization and Classical Optimization Theory:
Introduction, Applications of optimization, Optimization problem, Classification, Optimization techniques,
algorithms, Single variable optimization and multi-variable optimization with no constraints, equality & inequality
constraints (Unconstrained & constrained problems).
UNIT II: Linear Programming:
OR model, Formulation of LPP model, Graphical LPP solution and sensitivity analysis, Simplex method, M- method,
Two-phase method, Special cases in simplex method application, Duality theory, Dual simplex method, Revised
simplex method, Degeneracy, Sensitivity analysis, Various industrial applications of LP.
UNIT III: Nonlinear Programming and Dynamic Programming:
NLP: Definition and formulation of NLP, Unconstrained algorithms: Direct Search method, Gradient method:
Constrained algorithms: solution of NLPP with all equality constraints, not all equality constraints & inequality
constraints: Kuhn-Tucker Conditions, Graphical solution, KT Conditions Separable programming, Quadratic
Programming: Wolfes Method.
Dynamic Programming: Principle of Optimality, Computations in DP, Multistage decision problem and its solution
by Dynamic Programming with finite number of stages, Solution of LPP as a DPP & other selected DP applications.
UNIT IV: Transportation Models, Assignment Models and Integer Programming:
Formulation and Optimal solution of transportation models, Assignment models, Transshipment models, Degeneracy
in TP model, Industrial applications, Formulation and Solution of integer linear programming problems; Cutting-plane
algorithm, Branch and Bound algorithm, 0-1 ILPP, applications, Knapsack problem, facility-location problem.
UNIT V: Queuing Theory, CPM/ PERT Charts & Genetic Algorithms:
Queuing Theory: Applications of queuing models, Elements of a queuing model, Some distributions, Models for
arrival process and service times, Pure-Birth and Death models, Generalized Poisson queuing models, Kendalls
notations, Specialized Poissons Queues and some standard queuing models.
CPM/PERT Charts: Objectives of CPM & PERT, Characteristics of CPM/ PERT Project, Network diagram,
Terminology, Critical, path, Project duration, PERT Network: Activity time, Probabilities of project completion,
Optimal crashing of project activities.
Genetic Algorithms: Genetic Algorithm, working principles, similarities and differences between GAs and
Traditional Methods, GAs for constraint optimization, Applications of GAs to solve simple problems.

Text Books Recommended:

1.
2.
3.
4.

S.S. Rao, Optimization: Theory and Applications Willey Eastern Limited

Taha, H.A., Operations Research- AN Introduction, Macmillan.
Hiller, F.S., G.J. Lieberman, Introduction to Operations Research, Holden-Day.
Harvey M. Wanger, Principles of Operations Research with Applications to Managerial Decisions, Prentice
Hall of India Pvt. Ltd.
5. Kalyanmoy Deb, Optimization for Engineering Design: Algorithms & Examples Prentice-Hall of India

11

HMA-401: COMPUTER ORIENTED NUMERICAL METHODS

(CE, ME, BE, FT, OT, PT, PL, LT; IV Semester)

LTP
3 1 0

UNIT I: Nonlinear Equations and Simultaneous Linear Equations:

Roots of nonlinear equation, Methods of solution, Order of convergence of iterative methods, Simple roots: Bisection,
False position, Secant, Newton-Raphson, Chebyshev, Iteration and multi point iteration methods, Multiple roots:
Newton-Raphson and Chebyshev, Complex roots: Newton-Raphson and Mullers method, a system of nonlinear
equations: Newton-Raphson and Iteration methods, Polynomial equations: Bairstows method, convergence analysis
of above methods.
Linear systems: Introduction, Direct methods, Operation count, Pivoting, Ill conditioned linear systems & condition
number, Iteration methods: Jacobi, Gauss-Seidel, SOR methods, convergence conditions. Special system of equations:
Thomas algorithm. Eigen value problems: Givens and Power methods.

UNIT II: Interpolation, Differentiation and Integration:

Curve fitting: Polynomial interpolation, error, Existence and Uniqueness, Truncation error bounds, difference
operators, Newton forward and backward difference interpolations, Lagrange, Newton divided difference and Iterated
interpolations, Stirling and Bessels interpolations, Spline interpolation, Least squares and Chebyshev approximations.
Numerical Differentiation: Methods based on interpolation, Error analysis.
Numerical Integration: Methods based on interpolations (Trapezoidal, Simpsons 1/3 , Simpsons 3/8 rule), Gauss
quadrature methods, Romberg integration, Error bounds and estimates.

UNIT III: Numerical Solution of Ordinary Differential Equations:

Initial-value problems, Single step methods: Taylors, Picards, Eulers, Modified Eulers method and Runge -Kutta
method (Fourth Order), Error estimates, Multi-step methods: Adams-Bashforth and Milnes methods, convergence
and stability analysis, Simultaneous and Higher order equations: RK Fourth order method.

UNIT IV: Boundary value- and Initial Boundary value Problems:

BVP: Finite difference method, Shooting method, Solution of Laplace & Poisson equations: Standard 5 point and
diagonal 5-point formulae, Jacobi method, Gauss Seidel method (Liebmanns iterative method) Relaxation method.
Solution of heat equation: Crank-Nicolson method, Solution of wave equation.

UNIT V: Finite Element Method:

Basic concepts, Variational formulation and functionals, base functions, approximations by Ritz method, Galerkin
method, Least squares method, collocation method, time dependent problems, Finite element solution of simple
problems.

Books Recommended:
1. M.K.Jain, S.R.K. Iyengar & R.K.Jain, Numerical methods for Scientific and Engineering Computation, New
age International Publication.
2. S.S. Sastry, Introductory Methods of Numerical Analysis, Eastern Economy Edition.
3. S. Rajasekaran, Numerical Method in Science and Engineering, Wheeler Publishing House.
4. B.S. Grewal, Numerical Method in Engineering & Science, Khanna Publishers.

12

HMA-451: NUMERICAL TECHENIQUES LAB

(II CE, ME, BE, FT, OT, PT, PL, LT; IV Semester )
LTP
0 0 3
Develop Programs of the following techniques in C/C++ Language:
1. To implement iterative methods to solve a nonlinear equation.
2. To implement iterative methods to solve a system of linear equations.
3. To implement Forward, Backward and Central difference interpolation formulae.
4. To implement Newtons divided difference and Lagranges interpolation formulae.
5. To implement Numerical differentiation.
6. To implement Numerical integration using Trapezoidal, Simpson 1/3 and Simpson 3/8 rules.
7. To implement single step methods to solve initial value problems.
8. To implement multi step methods to solve initial value problems.
9. Solution of Heat equations (Parabolic equations) by finite difference method.
10. Solution of Laplace equations (elliptic equations) by finite difference method.
11. Solution of wave equations (Hyperbolic equations) by finite difference method.

13

HMA-601: COMPUTER ORIENTED NUMERICAL METHODS

(CHEM. Engg, VI Semester )

LTP
3 1 0

UNIT I: Nonlinear Equations and Simultaneous Linear Equations:

Roots of nonlinear equation, Methods of solution, Order of convergence of iterative methods, Simple roots: Bisection,
False position, Secant, Newton-Raphson, Chebyshev, Iteration and multi point iteration methods, Multiple roots:
Newton-Raphson and Chebyshev, Complex roots: Newton-Raphson and Mullers method, a system of nonlinear
equations: Newton-Raphson and Iteration methods, Polynomial equations: Bairstows method, convergence analysis
of above methods.
Linear systems: Introduction, Direct methods, Operation count, Pivoting, Ill conditioned linear systems & condition
number, Iteration methods: Jacobi, Gauss-Seidel, SOR methods, convergence conditions. Special system of equations:
Thomas algorithm. Eigen value problems: Givens and Power methods.

UNIT II: Interpolation, Differentiation and Integration:

Curve fitting: Polynomial interpolation, error, Existence and Uniqueness, Truncation error bounds, difference
operators, Newton forward and backward difference interpolations, Lagrange, Newton divided difference and Iterated
interpolations, Stirling and Bessels interpolations, Spline interpolation, Least squares and Chebyshev approximations.
Numerical Differentiation: Methods based on interpolation, Error analysis.
Numerical Integration: Methods based on interpolations (Trapezoidal, Simpsons 1/3 , Simpsons 3/8 rule), Gauss
quadrature methods, Romberg integration, Error bounds and estimates.

UNIT III: Numerical Solution of Ordinary Differential Equations:

Initial-value problems, Single step methods: Taylors, Picards, Eulers, Modified Eulers method and Runge -Kutta
method (Fourth Order), Error estimates, Multi-step method: Adams-Bashforth and Milnes methods, convergence and
stability analysis, Simultaneous and Higher order equations: RK Fourth order method.

UNIT IV: Boundary value- and Initial Boundary value Problems:

BVP: Finite difference method, Shooting method, Solution of Laplace & Poisson equations: Standard 5 point and
diagonal 5-point formulae, Jacobi method, Gauss Seidel method (Liebmanns iterative method) Relaxation method.
Solution of heat equation: Crank-Nicolson method, Solution of wave equation.

UNIT V: Finite Element Method:

Basic concepts, Variational formulation and functionals, base function, approximations by Ritz method, Galerkin
method, Least squares method, collocation method, time dependent problems, Finite element solution of simple
problems.

Books Recommended:
1. M.K.Jain, S.R.K. Iyengar & R.K.Jain, Numerical methods for Scientific and Engineering Computation, New
age International Publication.

2. S.S. Sastry, Introductory Methods of Numerical Analysis, Eastern Economy Edition.

3. S. Rajasekaran, Numerical Method in Science and Engineering, Wheeler Publishing House.
4. B.S. Grewal, Numerical Method in Engineering & Science, Khanna Publishers.

14

HMA-651: NUMERICAL TECHENIQUES LAB

(CHEM. Engg, VI Semester )
LTP
0 0 3
Develop Programs of the following techniques in C/C++ Language:
1. To implement iterative methods to solve a nonlinear equation.
2. To implement iterative methods to solve a system of linear equations.
3. To implement Forward, Backward and Central difference interpolation formulae.
4. To implement Newtons divided difference and Lagranges interpolation formulae.
5. To implement Numerical differentiation.
6. To implement Numerical integration using Trapezoidal, Simpson 1/3 and Simpson 3/8 rules.
7. To implement single step methods to solve initial value problems.
8. To implement multi step methods to solve initial value problems.
9. Solution of Heat equations (Parabolic equations) by finite difference method.
10. Solution of Laplace equations (elliptic equations) by finite difference method.
11. Solution of wave equations (Hyperbolic equations) by finite difference method.

15