Compulsory Courses

Semester- I
Course Code: MAM-101
Course Title: Linear Algebra
Course Credits: 04
Course Objectives: The objective of this course is to introduce the concepts of linear algebra
that a graduate student ought to know. This course emphasizes on decomposition theorem
and canonical forms for a linear transformation. It will equip the students with several tools
and ideas which can be used in variety of applications.

Course Outcomes: After completion of this course, students will be able to:

1. Describe basic concepts of vector spaces, work within vector spaces, change linear
transformation into matrices, understand eigenvalues and eigenspaces.
2. Describe diagonalizable operators, direct sum decompositions, the rational and
Jordan canonical forms.
3. Explain basic geometry of finite dimensional inner product spaces.

Evaluation Criteria:
(a) End-Semester Examination: 70%
(b) Sessional (Class Test/Quiz/Presentation/Seminar/Assignments etc.): 30%
Course Contents:

Unit 1: Quick review: vector spaces, subspaces, bases and dimensions, linear
transformations, range and kernel of linear transformations, rank-nullity theorem, matrix
representation of linear transformation, isomorphisms, linear functionals, dual spaces.

Eigenvalues and eigenvectors, characteristic polynomials, minimal polynomials, Cayley-

Hamilton theorem, diagonalizable transformations.

Unit 2: Invariant subspaces and triangular form, simultaneous triangularization and

diagonalization, T-conductors and T-annihilators, direct sum decompositions, invariant
direct sums, primary decomposition theorem, cyclic decomposition theorem and rational
canonical form, Jordan canonical form and some applications.

Unit 3: Inner product spaces, orthogonal bases, Gram-Schmidt orthogonalization process,

orthogonal projections.

Unit 4: Linear functionals and adjoints, self-adjoints, unitary and normal operators, and the
spectral theorem.

Reference Books:

Page 1 of 61
 1. K. Hoffman and R. Kunze, Linear Algebra, 2nd Edition, Prentice Hall of India, 2005
2. S. Axler, Linear Algebra Done Right, 2nd Edition, Springer UTM, 1997.
3. P. Halmos, Finite dimensional vectors paces, Springer, 1974.
4. P. D. Lax, Linear algebra, Wiley student edition, 1997.
5. H. Helson, Linear Algebra, Hindustan Book Agency, New Delhi, 1994.
6. G. Strang, Introduction to Linear Algebra, Fifth Edition, Wellesley-Cambridge Press,
2016.
7. V. Sahai, V. Bist, Linear Algebra, Narosa Pub. House Pvt. Ltd., 2010.
8. E. B. Vinberg, A Course in Algebra, Graduate text in Mathematics, volume 56, AMS,
2003.
9. S. Lang, Introduction to Linear Algebra, 2nd Edition, Springer, 2012.

-------------------------------------------------------------

Course Code: MAM-102

Course Title: Real Analysis
Course Credits: 04
Course Objectives: The aim of this course is to introduce the concept of Riemann-Stieltjes
integral, point-wise convergence and uniform convergence of sequence and series of
functions, differentiation of vector-valued functions on ℝ𝑛 and their properties, integration
of functions over a rectangle in ℝ𝑛 , change of variables, and the partition of unity.

Course Outcomes: After completion of this course, students will be able to:
1. Understand the Riemann-Stieltjes integral of real-valued functions and be able to
work out examples.
2. Understand the differentiability of vector-valued functions on ℝ𝑛 , partial derivatives
and differentiability, and directional derivatives.
3. Understand higher-order derivatives and Taylor’s formulas.
4. Understand the inverse function theorem, and implicit function theorem and their
applications.

Evaluation Criteria:
(a) End-Semester Examination: 70%
(b) Sessional (Class Test/Quiz/Presentation/Seminar/Assignments etc.): 30%
Course Contents:
Unit 1: Review of least upper bound axiom and Riemann integration, definition and
existence of Riemann-Stieltjes (R-S) integral, properties of R-S integral, reduction of an R-S
integral to a finite sum, mean value theorem for R-S integral, fundamental theorem of
integral calculus. Functions of bounded variation and its properties, Jordan Decomposition
Theorem, absolutely continuous functions.

Page 2 of 61
Unit 2: Sequence and series of functions, point-wise and uniform convergence, uniform
convergence and continuity, uniform convergence and integration, uniform convergence
and differentiation, Weierstrass approximation theorem.

Unit 3: Multivariable calculus: Differentiability of functions from ℝ𝑛 to ℝ𝑚 , partial

derivatives and differentiability, directional derivatives, chain rule, mean value theorems,
derivatives of higher-order and Taylor’s formula.

Unit 4: Inverse function theorem, implicit function theorem, integration over a k-cell,
primitive mappings, partition of unity, change of variables.

Reference Books:

1. W. Rudin, Principles of Mathematical Analysis, (3rd edition) McGraw-Hill, Kogakusha,

1986.
2. J. R. Munkres, Analysis on manifolds, CRC Press, 2018.
3. R. R. Goldberg, Methods of Real Analysis, Oxford-IBH, New Delhi, 1970.
4. R. G. Bartle and D.R. Sherbert, Introduction to Real Analysis, (4th edition) Wiley,
Hoboken NJ, 2011.
5. H. L. Royden and P. M. Fitzpatrick, Real Analysis, 4th ed., Pearson, 2015.
6. T. M. Apostol, Mathematical Analysis, Narosa Publishing House, New Delhi, 1985.
7. M. Giaquinta and G. Modica, Mathematical Analysis: An Introduction to Functions of
Several Variables, Birkhäuser, 2009.

---------------------------------------------------------------------------
Course Code: MAM 103
Course Title: Ordinary Differential Equations
Course Credits: 04
Course Objectives: The course objective is to introduce the students the existence and
uniqueness theory of ordinary differential equations, various methods of solution of second
and higher-order linear differential equations, solution of boundary value problems through
construction of Green’s function and the series solutions of linear differential equations.

Course Outcomes: After completion of this course, the student will be able to:
1. Solve the linear differential equations arising in different areas of science.
2. Understand the existence, uniqueness, and continuation of the solution to initial
value problems.
3. Solve boundary value problems through the construction of Green’s function and
understand the eigenvalues and eigenfunctions of Sturm-Liouville systems.
4. Find the power series solution of linear differential equations.

Evaluation Criteria:

Page 3 of 61
 (a) End-Semester Examination: 70%
(b) Sessional (Class Test/Quiz/Presentation/Seminar/Assignments etc.): 30%

Course Contents:
Unit 1: Existence and uniqueness of the solution to initial value problems: Picard’s method
of successive approximations, Lipschitz Condition, Picard’s theorem for local existence and
uniqueness of solutions of an initial value problem of the first order, Dependence of solution
on initial conditions, Continuation of solutions, Non-local existence of solutions, Local
existence and uniqueness theorems for systems and higher order equations.

Unit 2: Linear differential equations of higher order: Homogeneous and Non-homogenous

linear differential equations, Method of undetermined coefficients, Method of variation of
parameters, Reduction of order, Euler-Cauchy equations. Non-linear first order differential
equations of particular forms: Bernoulli and Ricatti equations.

Unit 3: Two-point boundary value problem, Green’s functions, Construction of Green’s

functions, Non-homogeneous boundary conditions, Sturm-Liouville boundary value
problem, Eigenvalues and Eigenfunctions.

Unit 4: Power series solution, Solutions near an ordinary point, Solutions near a regular
singular point: The Method of Frobenius. Bessel’s equation, Bessel functions, Generating
functions, Recurrence relations.

Reference Books:
1. G. F. Simmons and S. G. Krantz, Differential Equations: Theory, Technique and
Practice, Tata Mcgraw-Hill Publishing Company Ltd. New Delhi, 2007.
2. E. A. Coddington, Theory of Ordinary Differential equations, Tata Mcgraw-Hill
Publishing Company Ltd. New Delhi, 1972.
3. B. Rai, D. P. Chaudhary and H.I. Freedman: A Course in Ordinary Differential
Equations, Narosa Publishing House, New Delhi, 2002.
4. S. L. Ross, Introduction to Ordinary Differential Equations, 4th Edition, Wiley, New
York, 1989.
5. A. K. Nandakumaran, P. S. Datti, and Raju K. George; Ordinary differential equations:
Principles and Applications, Cambridge University Press, 2017.
6. W. E. Boyce and R.C. DiPrima; Elementary Differential Equations and Boundary value
problems. John Wiley & Sons, 2008.
7. R. P. Agarwal, D. O'Regan, An Introduction to Ordinary Differential Equations,
Springer-Verlag New York, 2008.

---------------------------------------------
Course Code: MAM-105
Course Title: Computer Programming in C

Page 4 of 61
Course Credits: 04
Course Objectives: The main objective is to give the knowledge to write a program in C
programming for different kinds of problems like programming for solving systems of linear
equations, roots of nonlinear transcendental equations or evaluation of eigenvalues for a
square matrix.

Course Outcomes: On completing the course, a student is enabling to understand:

1. To write a program for various problems.

2. To understand how to write a program to solve the system of linear equations.
3. To understand how to write a program to find the roots of nonlinear transcendental
equations.
4. To understand how to write an algorithm, etc.

Evaluation Criteria:
(a) End-Semester Examination: 70%
(b) Sessional (Class Test/Quiz/Presentation/Seminar/Assignments etc.): 30%

Course Contents:
Unit 1: Programmer's model of a computer. Algorithms, Flow Charts; Data Types, Arithmetic
and input/output instructions.

Unit 2: Decisions control structures; Decision statements, Logical and Conditional operators;
Loop: for loop, while loop, do while loops, Case control structures. Functions; Pre-
processors; Arrays; Puppettting of strings.

Unit 3: Pointers; Structures; File formatting; Algorithms and programs to analyse statistical
data. Measures of location and dispersion, sorting of data.

Unit 4: Numerical algorithm: Solution of nonlinear equations by bisection method, method

of False Position, functional iteration and Newton-Raphson methods for real roots.
Computation of and determinant and inverse of a matrix. Solution of a system of linear
equations by Gauss Elimination, Thomas algorithms.

Reference Books:
1. H. Mullish and H. L. Cooper, Spirit of C: An Introduction to Modern Programming,
Jaico Publishers, Bombay, 1988.
2. B. W. Kernighan and D. M. Ritchie, C Programming Language, Prentice Hall, Software
Series, 1988.
3. Y. Kanetkar, Let us C, BPB Publications, 2010.
4. M. T. Somashekara, D. S. Guru and K. S. Manjunatha, Problem solving with C, PHI
Learning Pvt. Ltd, 2018.
--------------------------------------------------------------------

Page 5 of 61
 Semester-II
Course Code: MAM-201
Course Title: Topology
Course Credits: 04
Course Objectives: The objective of this course is to introduce the concept of topological
spaces, bases, and subbases for a topology. The course focuses on the basic notions of
topological spaces such as continuous functions, homeomorphisms, connected and compact
spaces, product spaces, countability and separation axioms.

Course Outcomes: After completing this course, the student will be able to:

1. Understand topologies, bases and sub-bases, determine interior, limit points and
closure of subsets.
2. Understand the convergence of sequences, continuous functions and
homeomorphism.
3. Explain connected, locally connected spaces and continuity in topological space.
4. Determine compact spaces and locally compact spaces.
5. Understand the countability axioms and separation axioms.

Evaluation Criteria:
(a) End-Semester Examination: 70%
(b) Sessional (Class Test/Quiz/Presentation/Seminar/Assignments etc.): 30%
Course Contents:

Unit 1: Definition and examples of metric spaces, neighbourhood, open and closed sets,
definition and examples of topology, open and closed sets, closure, interior, boundary and
limit points, derives set dense subset, bases and sub-bases, subspaces and relative topology
and its counterparts in metric spaces.

Unit 2: Convergence of sequences in metric spaces and topological spaces, continuous

functions in metric spaces, completeness, Cantor’s intersection theorem, Banach’s
contraction principle.

Continuous functions in topological spaces, homeomorphisms, topological invariants, box

and product topology.

Unit 3: Connectedness, connected subspaces of the real line, components, local

connectedness, path connectedness. Compact spaces, the tube lemma, finite intersection
property, compact subspaces of the real line, the Lebesgue number lemma, uniform
continuity theorem, sequentially and countably compact sets, local compactness, statement
of Tychnoff’s product theorem.

Page 6 of 61
Unit 4: Countability axioms: first and second countable spaces, Lindelöf spaces, separable
spaces.

Separation axioms: T0, T1, T2, T3, T4 spaces, basic properties, the Urysohn lemma, the
statement of Urysohn’s metrization theorem, and the Tietze extension theorem.

Reference Books:

1. J. R. Munkres, Topology, 2nd Edition, Pearson International, 2000.

2. J. L. Kelley, General Topology, Van Nostrand, 1995.
3. K. D. Joshi, Introduction to General Topology, Wiley Eastern, 1983.
4. J. Dugundji, Topology, Prentice-Hall of India, 1966.
5. G. F. Simmons, Introduction to Topology and Modern Analysis, McGraw-Hill, 1963.
6. N. Bourbaki, General Topology, Part I, Addison-Wesley, 1966.
7. S. Willard, General Topology, Addison-Wesley, 1970.
8. T. B. Singh, Elements of Topology, CRC Press, Taylor & Francis, 2013.

--------------------------------------------------

Course Code: MAM-202

Course Title: Complex Analysis
Course Credits: 04
Course Objectives: The objective of this course is to familiarise students with the complex
function theory of one variable, analytic functions theory, the concept of winding numbers
and Cauchy’s theorems, integral formulas, singularities and contour integrations.

Course Outcomes: After completing this course, the student will be able to:

1. Apply the concept of the analyticity of complex-valued functions and evaluate

complex contour integrals.
2. Describe the basic properties of zeros of analytic functions and calculate residues and
use these to calculate integrals.
3. Describe the basic properties of entire functions and meromorphic functions, and
apply bilinear transformations.
4. Find automorphisms of the unit disc and the complex plane.

Evaluation Criteria:
(a) End-Semester Examination: 70%
(b) Sessional (Class Test/Quiz/Presentation/Seminar/Assignments etc.): 30%
Course Contents:

Page 7 of 61
Unit 1: Algebraic and geometric representation of complex numbers, the standard topology
on the complex plane, review of differentiability of vector-valued functions on real planar
domains, complex differentiability and the Cauchy-Riemann equations, holomorphicity,
examples of holomorphic functions (exp, log, sine, cosine, etc.), harmonic functions,
harmonic conjugate.

Unit 2: Complex line integrals, Cauchy-Goursat Theorem, Cauchy integral formula,

representation of holomorphic functions in terms of power series, Morera’s theorem,
Cauchy estimates and Liouville’s theorem, the fundamental theorem of Algebra, maximum
modulus theorem, open mapping theorem, Schwarz lemma.

Unit 3: Zeros of holomorphic functions, isolated singularities, Laurent expansions,

classification of singularities, Casorati-Weierstrass theorem, meromorphic functions, the
branch of logarithm, winding numbers, homotopy version of Cauchy’s theorem, simply
connectedness, the residue theorem, Jordan’s lemma, evaluation of proper and improper
integrals, integration along a branch cut, argument principle, Rouche’s theorem.

Unit 4: Riemann sphere and the stereographic projection, conformal mapping, linear
fractional transformations, conformal self-maps of the unit disc and the complex plane,
Blaschke product.

Reference Books:

1. L. V. Ahlfors, Complex Analysis, McGraw Hill Co., 1979.

2. J. B. Conway, Functions of One Complex Variables, 2nd edition, Narosa, New Delhi,
1996.
3. T. W. Gamelin, Complex Analysis, Springer, 2001.
4. B. P. Palka, An Introduction to Complex Function Theory, Springer, 1991.
5. E. M. Stein and Rami Shakarchi, Complex Analysis, Princeton University Press, 2003.
6. D. C. Ullrich, Complex Made Simple, AMS, 2008.

---------------------------------------------------------

Course Code: MAM 203

Course Title: Abstract Algebra
Course Credits: 04
Course Objectives: The aim of this course is to introduce group action and using this prove
Sylow's theorems, understand the Fundamental theorem of finite abelian groups and
introduce the concepts of Rings and the theory of modules.

Course Outcomes: This course will enable the students to:

Page 8 of 61
 1. Learn Group actions, Class equations, Normalizer and centralizer, Fundamental
theorem of Finite abelian groups and their applications.
2. Learn Sylow's theorems, determine the non-simplicity of certain finite groups,
Solvable groups.
3. Understand the concepts of Rings, ideals, Noetherian rings and Artinian rings.
4. Learn the concepts of Modules, Submodules, Direct sum & product of modules and
Exact sequences of modules.

Evaluation Criteria:

(a) End-Semester Examination: 70%

(b) Sessional (Class Test/Quiz/Presentation/Seminar/Assignments etc.): 30%
Course Contents:

Unit 1: Groups: Normalizer and Centralizer, Group action and class equation, symmetric
groups, direct products of groups, Fundamental theorem of Finite abelian groups.
Unit 2: Sylow's theorems and their applications, Cauchy`s theorem, Normal series,
Composition series, Jordan-Holder theorem, Solvable groups.
Unit 3: Rings and ideals: Quick review of Commutative rings, Nil-radical and Jacobson
radical, Extension and Contraction, UFD, PID and ED, Rings of Fractions, Noetherian rings.
Unit 4: Modules: Introduction, Submodules and Quotient modules, Direct sum and Product,
Finitely generated modules, Exact sequences, Tensor product of modules, Noetherian and
Artinian modules, Modules of Fractions.
Reference Books:
1. M. Atiyah: Introduction to Commutative Algebra, Westview Press, 1994.
2. D. S. Dummit and R.M. Foote, Abstract Algebra, 3rd edition, Wiley,2003.
3. O. Zariski and P. Samuel, Commutative Algebra I. Vol. 1, Springer, 1975.
4. P. B. Bhattacharya, S. K. Jain, S. R. Nagpaul, Basic Abstract Algebra, 2nd edition,
Cambridge, 1995.
5. J. A Gallian, Contemporary Abstract Algebra, Narosa Pub. House P. Ltd.
6. J. B. Fraleigh, A First Course in Abstract Algebra, Pearson Edu. Inc., 2003.
7. I. N. Herstein, Topics in Algebra, John Wiley and Sons, New York.

--------------------------------------------
Course Code: MAM-205
Course Title: MATLAB
Course Credits: 02
Course Objectives: The aim of this course is to introduce the students to the basics of

Page 9 of 61
MATLAB programming, execution of loops and controls and their application to program the
numerical methods for the solution of the system of linear and nonlinear equations using
MATLAB.

Course Outcomes: After completion of this course, students will be able to:

1. Create and troubleshoot basic m scripts, implement loops and control instructions in
MATLAB programming environment.
2. Draw two and three dimensional plots of functions in MATLAB.
3. perform curve fitting in MATLAB.
4. Program numerical methods to solve linear and nonlinear equations in MATLAB.

Evaluation Criteria:
(a) End-Semester Examination: 70%
(b) Sessional (Class Test/Quiz/Presentation/Seminar/Assignments etc.): 30%

Course Contents:
Unit 1: Basics of MATLAB programming, building array and matrices, matrix and array
operations, working with files: scripts and functions, Conditional statements, Loops and
execution control, plotting of functions, subplot, two- and three-dimensional plots, Handles
and properties.

Unit 2: Curve fitting: Straight line fit, Polynomial fit. Solutions to systems of linear equations:
LU Decomposition method, Gauss Jacobi Method, Gauss Seidel Method. Nonlinear
equations in a single variable: Bisection method, Regula-Falsi method, and Newton-Raphson
method.

Reference Books:
1. R. Pratap, Getting Started with MATLAB: A Quick Introduction for Scientists &
Engineers, Oxford University Press, 2010.
2. J. H. Mathews, K.D. Fink, Numerical Methods using MATLAB, Prentice Hall, 1999.
3. A. H. Register, A guide to MATLAB object-oriented programming, Boca Raton, FL:
CRC Press, 2007.

--------------------------------------------------

Page 10 of 61
 Semester- III
Course Code: MAM-301
Course Title: Measure Theory
Course Credits: 04
Course Objectives: The objective of this course is to understand the concept of Lebesgue
outer measure, measurable sets, measurable functions, Lebesgue integration, and the
convergence of sequences of measurable functions and their integrals.

Course Outcomes: After completion of this course, students will be able to:
1. Verify whether a given subset of ℝ or a real-valued function is measurable.
2. Understand the requirement and the concept of the Lebesgue integral (a
generalization of the Reimann integration) along with its properties.
3. Demonstrate understanding of the statement and proofs of the fundamental integral
convergence theorems and their applications.

Evaluation Criteria:
(a) End-Semester Examination: 70%
(b) Sessional (Class Test/Quiz/Presentation/Seminar/Assignments etc.): 30%
Course Contents:
Unit 1: Countable and uncountable sets, cardinal numbers and their arithmetic, Schroeder-
Bernstein theorem, partially ordered sets, lattices, Zorn’s lemma (without proof), Well-
ordering theorem.

Unit 2: Lebesgue outer measure, measurable sets, σ-algebra, Borel sets, theorems on
measurable sets, Outer and Inner Approximation of Lebesgue Measurable Sets, the Cantor
set and Cantor-Lebesgue function, Borel-Cantelli Lemma, non-measurable sets.

Unit 3: Measurable function, properties of measurable functions, Egoroff’s theorem, Lusin’s

theorem, convergence in measure, simple function, simple approximation theorem.

Unit 4: Lebesgue integral of bounded measurable functions, comparison of Lebesgue and

Riemann integral, bounded convergence theorem, Lebesgue integral of measurable non-
negative functions, Fatou’s lemma, monotone convergence theorem, general Lebesgue
integral, Lebesgue dominated convergence theorem, uniform integrability, Vitali
convergence theorem, general Vitali convergence, convex functions, Jensen’s inequality.

Reference Books:
1. H. L. Royden and P.M. Fitzpatrick, Real Analysis, 4th ed., Pearson, 2015.
2. G. de Barra, Measure Theory and Integration, New Age International (P) Ltd., New
Delhi, 2014.
3. P. K. Jain and V. P. Gupta, Lebesgue Measure and Integration, Wiley.

Page 11 of 61
 4. S. Goldberg: Real analysis Oxford and IBH New Delhi,1997.
5. I. K. Rana, An Introduction to Measure and Integration, Narosa Publishing House,
Delhi, 1997.
6. C. Swartz, Measure, Integration and Function spaces, World Scientific, 1994.
7. T. M. Apostol, Mathematical Analysis, Narosa Publishing House, New Delhi, 1985.
8. E. M. Stein and R. shakarchi, Real analysis, Princeton University Press, 2009.
----------------------------------------------

Course Code: MAM-302

Course Title: Partial Differential Equations
Course Credits: 04
Course Objectives: This course aims to formulate physical problems as PDEs using
conservation laws, understand analogies between mathematical descriptions of different
(wave) phenomena in physics and engineering, classify PDEs, apply analytical methods, and
physically interpret the solutions.

Course Outcomes: After completing this course, the student will be able to:

1. Analyze the origin of first-order partial differential equations.

2. Explain the solution of first-order partial differential equations using Lagrange’s and
Charpit’s methods.
3. Identify the second-order equations and solve them using the separation of the
variable method.
4. Provide information on Monge’s method for second-order partial differential
equations.

Evaluation Criteria:
(a) End-Semester Examination: 70%
(b) Sessional (Class Test/Quiz/Presentation/Seminar/Assignments etc.): 30%

Course Contents:
Unit 1: Classification of first order partial differential equations, the origin of partial
differential equations, Cauchy’s problem for first order equations, classification of the
solution, Lagrange's method, Integral surface passing through a given curve, surfaces
orthogonal to a given system of surfaces.

Unit 2: Cauchy’s method of characteristics for solving non-linear first-order partial

differential equations, the compatible system of first-order equations, Charpit's method,
Jacobi's method, and Monge’s method.

Unit 3: Second order partial differential equations: Origin of second order p.d.e.,
classification of second-order p.d.e's, characteristic equation, separation of variables,

Page 12 of 61
Laplace equation, boundary value problems, properties of harmonic functions: the spherical
mean and mean value theorem, maximum-minimum principles, Dirichlet problem for a
rectangular region/circle/annulus, Neumann problem for a rectangular region.

Unit 4: Heat equation, boundary conditions, Heat conduction problem for an infinite rod,
Heat conduction in a finite rod, existence and uniqueness of the solution, Wave equation,
vibrations of a finite string, existence and uniqueness of the solution.

Reference Books:
1. I. Sneddon, Elements of partial differential equation, McGraw-Hill Book Company,
1982.
2. M. D. Raisinghania, Ordinary and partial differential equations, S. Chand, 2014.
3. K. S. Rao, Introduction to partial differential equation, PHI Learning, 2009.
4. S. J. Farlow, Partial Differential equations for scientist and engineer, Wiley
Publisher, 2006.
5. P. Prasad and R. Ravindran, Partial Differential equations, New Age International
Pub., N. Delhi, 1985.
6. F. John, Partial Differential equations, Springer- Verlag, N. York, 2004.
7. L. C. Evans, Partial Differential Equations, American Mathematical Society; 2nd
edition, 2010.
8. C. Constanda, Solution techniques for elementary Partial Differential Equations,
Chapman and Hall Book Publishing, 2015.
--------------------------------------------------

Course Code: MAM-303

Course Title: Analytical Dynamics
Course Credits: 04
Course Objectives: The objective of the course is to make the students acquainted with the
concept of generalized coordinates where a single equation can be used to discuss various
types of motions. After studying this course, the students will be able to deal with motions
of celestial bodies.
Course Outcomes: After completing this course, the student will be able to:
1. Understand Euler dynamic and geometrical equations of motion.
2. Explain Lagrange approach and Lagrange equations for constrained motion under
finite forces.
3. Describe Hamilton principle and principle of least action.
4. Apply canonical transformations to various real-world problems.

Evaluation Criteria:
(a) End-Semester Examination: 70%

Page 13 of 61
 (b) Sessional (Class Test/Quiz/Presentation/Seminar/Assignments etc.): 30%
Course Contents:
Unit 1: Rotation of a vector in two and three dimensional fixed frame of references.
Kinetic energy and angular momentum of rigid body rotating about its fixed point.
Euler dynamic and geometrical equations of motion.

Unit 2: Generalized coordinates, momentum and force components.

Lagrange equations of motion under finite forces, cyclic coordinates and conservation of
energy.

Lagrangian approach to some known problems: -motion of a particle in polar system,

motion of a particle in a rotating plane, motion of an insect crawling on a rod rotating about
its one end, motion of masses hung by light strings passing over pulleys, motion of a sphere
on the top of a fixed sphere and Euler dynamic equations.

Lagrange equations for constrained motion under finite forces.

Small oscillations for longitudinal and transverse vibrations.

Unit 3: Equations of motion in Hamiltonian approach and its applications on known

problems as given above. Conservation of energy. Legendre dual transformations.
Hamilton principle and principle of least action. Hamilton-Jacobi equation of motion,
Hamilton-Jacobi theorem and its verification on the motions of a projectile under gravity in
two dimensions and motion of a particle describing a central orbit.

Unit 4: Phase space, canonical transformations, conditions of canonicality, cyclic relations,

generating functions, invariance of elementary phase space, canonical transformations form
a group and Liouville theorem.
Poisson brackets, Poisson first and second theorems, Poisson. Jacobi identity and invariance
of Poisson bracket.

Reference Books:

1. N. C. Rana and P.S. Joag, Classical Mechanics, Tata McGraw-Hill, 1991.

2. H. Goldstein, Classical Mechanics, Narosa, 1990.
3. J. L. Synge and B. A. Griffith, Principles of Mechanics, McGraw-Hill, 1991.
4. L. N. Hand and J. D. Finch, Analytical Mechanics, Cambridge University Press, 1998.
5. N. Kumar, Generalized Motion of Rigid Body, Narosa, New Delhi, 2004.
6. R. G. Takwale and P. S. Puranik, Introduction to Classical Mechanics, McGraw Hill
Education, 2017.
7. C. R. Mondal, Classical Mechanics, PHI Learning, 2008.
8. F. R. Gantmakher, Lectures in Analytical Mechanics, Mir Publishers, 2008.
------------------------------------------------------

Page 14 of 61
Course Code: MAM-305
Course Title: Research Methodology
Course Credits: 02
Course Objectives: This course is designed to enable students to identify and discuss the
role and importance of research. This course aims to identify and discuss the issues and
concepts salient to the research process. This course will discuss the complex issues
inherent in selecting a research problem.

Course Outcomes: At the end of this course, the students should be able to:
1. Understand some basic concepts of research and its methodologies
2. Identify appropriate research topics
3. Select and define appropriate research problem and parameter
4. Know the journals in mathematical sciences

Evaluation Criteria:
(a) End-Semester Examination: 70%
(b) Sessional (Class Test/Quiz/Presentation/Seminar/Assignments etc.): 30%

Course Contents:
Unit 1: Qualitative research, Quantitative research, Concept of measurement, causality,
generalization, replication, and merging of the two approaches.

Paper writing layout of a research paper, Journals in Mathematical Sciences, Impact factors
of Journals, Ethical issues related to publishing, Plagiarism and Self-Plagiarism.
Unit 2: LaTeX: Producing input and output files, Greek letters, standard functions,
mathematical expressions, matrices, tables, derivatives, integrations, matrix array, tables,
ordinary and partial differential equations.

Reference Books:
1. C. R. Kothari, Research Methodology: Methods and Techniques, New Age
International Publishers, New Delhi, 2019.
2. B. L. Garg, R. Karadia, F. Agarwal, and U. K. Agarwal, An Introduction to
Research Methodology, RBSA Publishers, 2002.
3. G. Gratzer, First steps in LATEX: A Short Course, Birkhauser, Boston and Springer
Verlag, New York, 1999.
4. A. H. Register, A guide to MATLAB object-oriented programming, Boca Raton, FL:
CRC Press, 2007.
5. E. Don, Schaum's Outline of Mathematica, 2nd Edition, McGraw-Hill Education, 2009.
6. G. Frank, The maple book, Chapman and Hall/CRC, 2001.
----------------------------------------------------

Page 15 of 61
 Semester-IV
Course Code: MAM-401
Course Title: Functional Analysis
Course Credits: 04
Course Objectives: The main objective of this course is to introduce the notion of normed
spaces, Banach spaces and Hilbert spaces.

Course Outcomes: After completion of this course, students will be able to:

1. Describe the properties of a normed linear space, Banach space and linear
transformations on Banach space.
2. Explain central theorems of functional analysis, including the Hahn-Banach theorem,
the open mapping theorem and the closed graph theorem.
3. Describe the properties of Hilbert space and linear operator on Hilbert space.
4. Produce examples and counterexamples illustrating the mathematical concepts
presented in the course.

Evaluation Criteria:
(a) End-Semester Examination: 70%
(b) Sessional (Class Test/Quiz/Presentation/Seminar/Assignments etc.): 30%

Course Contents:

Unit 1: Normed linear spaces, Banach spaces, examples and counter examples, subspace,
quotient space of normed linear spaces and its completeness, bounded linear
transformations, normed linear spaces of bounded linear transformations, equivalent
norms, basic properties of finite dimensional normed linear spaces, Riesz Lemma.

Unit 2: Open mapping theorem, closed graph theorem and its consequences, uniform
boundedness principle and its consequences, bounded linear functionals, Hahn-Banach
theorem and its application, dual spaces with examples, reflexive spaces.

Unit 3: Inner product spaces and Hilbert spaces, properties of Hilbert spaces, orthogonal
complements, orthonormal sets, Bessel’s inequality, complete orthonormal sets and
Parseval’s identity.

Unit 4: Structure of Hilbert spaces, projection theorem, Riesz representation theorem,

adjoint of an operator on a Hilbert space, reflexivity of Hilbert spaces, self-adjoint operators,
normal and unitary operators, orthogonal projection operators.

Reference Books:

Page 16 of 61
 1. G. Bachman, and L. Narici, Functional Analysis, Dover Publications, 2012.
2. W. Rudin, Functional Analysis, Tata McGraw Hill, 2010.
3. M. T. Nair, Functional Analysis, A First Course, PHI Learning PVT LTD, Delhi, 2021.
4. E. Kreyszig, Introductory Functional Analysis with Applications, John Wiley and Sons,
New York, 2006.
5. G. F. Simmons, Introduction to Topology and Modern Analysis, McGraw Hill Book
Co., New York,1963.
6. J. B. Conway, A Course in Functional Analysis, Springer, 2006.
7. P. K. Jain, O. P. Ahuja and K. Ahmed, Functional Analysis, New Age International,
2004.
8. B. V. Limaye, Functional Analysis, New Age International, 2014.

------------------------------------

Course Code: MAM-402

Course Title: Numerical Analysis
Course Credits: 04
Course Objectives: The main objective is to give a brief knowledge how to find the solutions
of system of linear equations, roots of transcendental equations, various formulae have
been introduced to evaluate the values of derivatives/integrals for given set of data, various
types of approximations of functions are also introduced. Finite difference method is
introduced for solving boundary value problems (BVPs).

Course Outcomes: On completing the course, a student is enabling to understand

1. To evaluate unknown value at certain point via interpolations.

2. To compute solutions of system of linear equations by various direct and numerical
methods and capable to utilize various method for eigenvalue problems.
3. To compute roots of nonlinear equations, derivatives/integral values at certain point
for the given set of data.
4. To compute solutions of BVPs by finite difference methods, etc…

Evaluation Criteria:
(a) End-Semester Examination: 70%
(b) Sessional (Class Test/Quiz/Presentation/Seminar/Assignments etc.): 30%

Course Contents:

Unit 1: Interpolation: Newton, Lagrange and Hermite Interpolations, error of the

interpolating polynomial, piecewise-polynomial approximation, Spline interpolation.
Different types of approximations: Least square polynomial approximation, Polynomial
approximation using orthogonal polynomials, Chebyshev polynomials.

Page 17 of 61
Unit 2: Solutions of system of linear equations: Direct methods (LU Decomposition method
and Gaussian elimination method with and without pivoting). Iterative Methods (Jacobi,
Gauss-Seidel) and their error formats. Thomas algorithm for the solutions of tridiagonal
system of linear equations. Eigenvalue Problems: Power method, Jacobi’s method, Givens
method, Householder method. Eigen values of complex matrices.

Unit 3: Numerical Integration: Newton-Cotes formula, Optimum choice of step length and
methods based on undetermined coefficients, Quadrature methods, Gaussian integration,
double integration.

Solution of ODEs: Numerical differentiation, difference equations, Taylor series method,

Euler's method and its convergence, Second and fourth order Classical explicit Runge-Kutta
methods, Milne and Adam Predictor-Corrector methods, Stability of numerical methods.

Unit 4: Finite difference method for linear second order differential equations: Finite
difference methods for BVPs. Finite difference method for non-linear second order
differential equations. Numerical solutions of second-order of linear and non-linear
boundary value problems (BVP) by shooting method. Local truncation errors.

Reference Books:

1. M. K. Jain, S. R. K. Iyengar, R. K. Jain, Numerical methods Problems and Solutions,

New Age International (P) ltd, 2009.
2. S. S. Sastry, Introductory method of Numerical Analysis, PHI, New Delhi, 2005.
3. D. V. Griffiths, I. M. Smith, Numerical Methods for Engineers, Taylor & Francis, 2006.
4. C. E. Froberg, Numerical Mathematics - Theory and Computer Applications, The
Benjamin Cummings Pub. Co., 1985.
5. J. H. Mathews, Numerical Methods for Mathematics, Science and Engineering,
Prentice-Hall 2nd edition, 1992.
6. R. S. Gupta, Elements of Numerical Analysis, Macmillan India Ltd. New Delhi, 2009.

--------------------------------------------

Page 18 of 61
 Elective Courses

Semester-I
Course Code: MAM-104
Course Title: Calculus of Variations and Integral Equations
Course Credits: 04
Course Objectives: The course is aimed to lay a broad foundation for an understanding of
the problems of the calculus of variations and its many methods and techniques. This course
also provides a forum for the students to understand the methods of solving Integral
Equations.

Course Outcomes: After completing this course, the student will be able to:

1. Understand what functionals are, and have some appreciation of their applications
2. Understand the concept of the calculus of variation for the Brachistochrone,
isoperimetric, and geodesics problems.
3. Convert ordinary differential equations into Fredholm and Volterra type integral
equations.
4. Explain the solution of integral equations by successive approximation.

Evaluation Criteria:
(a) End-Semester Examination: 70%
(b) Sessional (Class Test/Quiz/Presentation/Seminar/Assignments etc.): 30%

Course Contents:
Unit 1: Calculus of Variations: Motivational problems (Brachistochrone, isoperimetric, and
geodesics) functional, deduction of Euler’s equations for functional of first-order and higher
orders for fixed boundaries.

Unit 2: Isoperimetric problems, Brachistochrone problems, moving boundary problems, and

the shortest distance between two non-intersecting curves.

Unit 3: Integral equation: definition and classification, the relations of ODEs with integral
equations, Fredholm equations (homogeneous and non-homogenous) of the second kind
with separable kernels, characteristic numbers and eigen-functions, Fredholm alternative
theorem.

Unit 4: Method of successive approximations, iterated kernels, resolvent kernel, solution of

Fredholm and Volterra integral equation of the second kind by successive substitutions,
solution of Fredholm and Volterra integral equation of the second kind by successive
approximations: Neumann series, solution of Fredholm and Volterra integral equation of the
first kind. Fredholm’s fundamental theorems.

Page 19 of 61
Reference Books:

1. R. P. Kanwal, Linear Integral Equations, Academic Press, 1997.

2. I. M. Gelfand and S. V. Fomin, Calculus of Variations, Prentice Hall, Inc., 2000.
3. A. S. Gupta, Text Book on Calculus of Variation, Prentice-Hall of India, 2004.
4. I. Sneddon, The use of integral transforms, Tata McGraw Hill, 1972.
5. F. B. Hildebrand, Method of Applied Mathematics, Dover Publications, 1992.
6. A. J. Jerri, Introduction to integral equations with Applications, Marcel Dekker Inc.,
1985.

------------------------------------------------

Course Code: MAM 104

Course Title: Advanced Mathematical Modeling
Course Credits: 04
Course Objectives: The objective of this course is to introduce students to the process of
mathematical modeling and make them equipped with the techniques used to formulate
and analyze the mathematical models comprising of ordinary or partial differential
equations. The basic concepts of formulation of mathematical models in terms of directed
graphs, signed graphs, and weighted graphs will also be introduced.

Course Outcomes: After completion of this course, students will be able to:
1. Gather and convert the information of a physical phenomenon into a mathematical
model.
2. Revise and improve mathematical models so that they will represent the problem
under consideration more realistically.
3. Formulate the mathematical models using linear and nonlinear differential
equations.
4. Formulate models in terms of terms of directed graphs, signed graphs, and weighted
digraphs.

Evaluation Criteria:
(a) End-Semester Examination: 70%
(b) Sessional (Class Test/Quiz/Presentation/Seminar/Assignments etc.): 30%

Course Contents:
Unit 1: Simple situations requiring mathematical modeling, techniques of mathematical
modeling, Characteristics and limitations of mathematical models, Mathematical
modeling through differential equations: Single species population models, Harvesting
models.

Page 20 of 61
Unit 2: Overview of basic concepts in ODE and stability of solutions: steady state and their
local and global stability. Mathematical modeling through systems of ordinary differential
equations: Mathematical models in ecology, Compartmental models of infectious disease.

Unit 3: Mathematical modeling through partial differential equations, Methods of obtaining

partial differential equation models: Mass-balance equation, moment balance equation and
variational principle, Model for Traffic flow problem, Diffusion models in population
dynamics.

Unit 4: Mathematical modeling through graphs: Mathematical models in terms of Directed

graphs, signed graphs, and weighted digraphs.

Reference Books:
1. J. N. Kapur, Mathematical Modeling, Wiley Eastern, 1988.
2. J. N. Kapur, Mathematical Models in Biology and Medicine, Affiliated East-West
Press Pvt. Ltd., 2010.
3. F. R. Giordano, William Price Fox, Maurice D. Weir, A First Course in Mathematical
Modelling, 4th Ed., Cengage Learning, 2009.
4. W. J. Meyer, Concepts of Mathematical Modelling, McGraw-Hill, 1984.
5. F. Brauer and C. Castillo-Chavez, Mathematical Models in Population Biology and
Epidemiology, Springer, 2001.
------------------------------------------------

Course Code: MAM-104

Course Title: Discrete Mathematics
Course Credits: 04
Course Objectives: This course will discuss fundamental concepts and tools in discrete
mathematics. Topics include propositional logic, partial ordering sets, Boolean algebra, and
graphs. This course aims to develop the mathematical concepts and techniques which should
serve as a preparation for more advanced quantitative courses.
Course Outcomes: Students completing this course will be able to
1. Express a logic sentence in terms of predicates, quantifiers, and logical connectives.
2. Determine properties of relations, identify equivalence and partial order relations
and sketch relations.
3. Evaluate Boolean functions and simplify expressions using the properties of Boolean
algebra.
4. Define graphs, digraphs, and identify their main properties.

Evaluation Criteria:
(a) End-Semester Examination: 70%

Page 21 of 61
 (b) Sessional (Class Test/Quiz/Presentation/Seminar/Assignments etc.): 30%

Course Contents:
Unit 1: Formal Logic: Statements, Symbolic Representation of statements, Truth tables,
Logical equivalence, Algebra of propositions, Conditional proposition, Converse, Contra
positive and Inverse, Bi-conditional Proposition, Negation of compound statement,
Tautologies and contradictions, Normal forms, Predicates and Validity of arguments,
Quantifiers.

Unit 2: Lattices as partially ordered sets, their properties, duality, Lattices as algebraic
systems, Sub lattices, direct products, Bounded Lattices, Complete Lattices, Complemented
Lattices and Distributive lattices.

Unit 3: Boolean Algebras as lattices, Various Boolean Identities, The Switching Algebra
examples. Sub algebras, Direct products and Homeomorphisms,

Boolean forms and their Equivalence, Min-term Boolean forms, Sum of product Canonical
forms, Minimization of Boolean functions.

Unit 4: Definition of the graph, Walk, Path, Circuit, Cycles, Degree of a vertex, Types of
graphs, Sub-graphs, and Isomorphic graphs, Eulerian and Hamiltonian graphs, and Shortest
path problems.
Reference Books:

1. S. Lipschutz, Finite Mathematics, McGraw-Hill Book Co. New –York, 2004.

2. J. E. Hopcroft and J. D. Ullman, Introduction to Automata Theory Languages &
Computation, Narosa Publishing House, Delhi, 2007.
3. S. K. Sarkar, A Textbook of Discrete Mathematics, S Chand and Company Ltd., 2006.
4. C. L. Liu, Elements of Discrete Mathematics, McGraw-Hill Book Co, 2010.
5. N. Deo, Graph Theory with Applications to Engineering and Computer Sciences, PHI,
New Delhi, 1794.
-----------------------------------------------

Course Code: MAM-104

Course Title: Special Functions
Course Credits: 04
Course Objectives: The aim of this course is to study the different types of special functions,
investigate and derive the basic properties of special functions and find the solution of
different types of differential equations by using special functions.

Course Outcomes: After completion of this course students will be able to:

Page 22 of 61
 1. Understand the concepts of Legendre Functions, Bessel Functions, Hypergeometric
Functions, etc. and their applications in Physical Sciences.
2. Solve, expand and interpret solutions of many types of differential equations by
making use of special functions and orthogonal polynomials.
3. Finding power series solutions to some special types of differential equations.
4. Understand certain specific systems of orthogonal polynomials and their properties.

Evaluation Criteria:
(a) End-Semester Examination: 70%
(b) Sessional (Class Test/Quiz/Presentation/Seminar/Assignments etc.): 30%

Course Contents:
Unit 1: Legendre Functions: Legendre polynomials, recurrence relations for the Legendre
polynomials, Murphy and Rodrigues formula, series of Legendre polynomials, Legendre’s
differential equation, Neumann’s formula for the Legendre functions, recurrence relations
for the functions 𝑄𝑛 (𝜇), Integral expression for the associated Legendre function, Surface
spherical harmonics, use of associated Legendre functions in wave mechanics.

Unit 2: Bessel Functions: Origin of Bessel functions, recurrence relations for the Bessel
coefficients, series expansions for the Bessel coefficients, integral expressions for the Bessel
coefficients, Bessel’s differential equation, spherical Bessel functions, Integrals involving
Bessel functions, modified Bessel functions, expansions in series of Bessel functions, use of
Bessel functions in potential theory, asymptotic expansion of Bessel functions.

Unit 3: The Functions of Hermite and Laguerre: The Hermite polynomials, Hermite’s
differential equation, the occurrence of Hermite functions in wave mechanics, The Laguerre
polynomials, Laguerre’s differential equation, The associated Laguerre polynomials and
functions.

Unit 4: Hypergeometric functions: Hypergeometric series, the integral formula for the
hypergeometric series, hypergeometric equation, Linear relations between the solutions of
the hypergeometric equation, relations of contiguity, The confluent hypergeometric
function, Generalised hypergeometric series.

Reference Books:
1. I. N. Sneddon, Special Functions of Mathematical Physics and Chemistry, Edinburg,
Oliver & Boyd, 1956.
2. E. D. Rainville, Special Functions, The Macmillan Company, New York, 1960.
3. N. N. Lebedev, Special Functions & Their Applications, Revised Edition, Dover, 1976.
4. G. Andrews, R. Askey & R. Roy, Special Functions, Cambridge, 1999.
5. L. Andrews, Special Functions for Engineers and Applied Scientists, Macmillan, 1985.
6. W. W. Bell, Special Functions for Scientists and Engineers, Dover, 1968.
7. Z. X. Wang and D. R. Guo, Special Functions, World Scientific Publishing Co., 1989.

Page 23 of 61
 ---------------------------------------------------
Course Code: MAM 104
Course Title: Algebraic Coding Theory
Course Credits: 04
Course Objectives: The aim of this course is to introduce the coding problem: error
detection and correction, Some classical encoding and decoding methodologies, bounds on
codes which determines the relative error detection and correction capacity. It also talks
about some famous codes like Hamming code, Golay code, Reed-soloman code etc.

Course Outcomes: This course enables the students to:

1. Learn the basic concepts of recovery of corrupted messages after transmission

through a noisy channel.
2. Learn how to increase the error detection and correction capacity of a
communication channel.
3. Compute the bounds of codes and using it optimize the information rate as well as
the relative minimum distance of a code of communication channel.
4. Learn about some famous codes like Hamming code, Golay code, Reed-soloman
code etc.

Evaluation Criteria:

(a) End-Semester Examination: 70%

(b) Sessional (Class Test/Quiz/Presentation/Seminar/Assignments etc.): 30%

Course contents:

Unit 1: The Communication Channel, coding problem, error detecting and correcting codes,
Block codes, Hamming metric, Nearest neighbour decoding, Linear codes, Generator and
parity check matrices, dual codes, Syndrome decoding, permutation equivalent codes.
Unit 2: Hamming codes, Golay codes, Reed-Muller codes, Bounds on codes: 𝐴𝑞 (𝑛, 𝑑)and
𝐵𝑞 (𝑛, 𝑑), sphere packing bound, covering radius and perfect codes. Singleton bound and
MDS codes.
Unit 3: Finite fields, cyclotomic cosets and minimal polynomials. Cyclic codes: factoring 𝑥 𝑛 −
1, basic theory of cyclic codes, Generator polynomial and parity check polynomial, minimum
distance of cyclic codes, BCH bound, Encoding decoding of cyclic codes.
Unit 4: Hamming and Golay codes as cyclic codes, BCH codes, Reed-Soloman codes,
Quadratic residue codes, Graphical codes, Convolutional codes.
Reference Books:

Page 24 of 61
1. W. C. Huffman and V. Pless, Fundamentals of Error-correcting Codes, Cambridge
University Press, 2003.
2. S. Ling and C. Xing, Coding Theory - A First Course, Cambridge University Press, 2004.
3. E. R. Berlekamp, Algebraic Coding Theory, Aegean Park Press, 1984.
4. J. H. Van Lint, Introduction to Coding Theory, 3rd edition, Springer, 1999.
5. R. Roth, Introduction to Coding Theory, Cambridge University Press, 2006.
6. S. Roman, Introduction to Coding and Information Theory, Springer-Verlag, 1997.
---------------------------------------------------

Page 25 of 61
 Semester-II
Course Code: MAM 204
Course Title: Probability and Probability Distributions
Course Credits: 04
Course Objectives: The main objective is to give knowledge of probability and distributions.
Various types of distributions are explained in detail. Correlation and regression and partial
correlation/regression analysis are also discussed.

Course Outcomes: On completing the course, a student is enabling to understand

1. To handle various types of distributions.
2. To understand about nature of distributions via moments, etc.
3. To understand standard errors, hypotheses and sampling.

Evaluation Criteria:
(a) End-Semester Examination: 70%
(b) Sessional (Class Test/Quiz/Presentation/Seminar/Assignments etc.): 30%

Course Contents:
Unit 1: Probability: Set theoretic approach, Baye’s theorem, Geometric probability, Random
experiments, Sample spaces, Random variables, Distribution functions. Joint probability
distribution function, Conditional distribution function. Moment and cumulant; moment
generating function and cumulant generating function. The mathematical expectation of
random variables. Covariance and Variance of variables; Chebysheff’s inequality.

Unit 2: Transformations of random variables: in one and two dimensions.

Discrete distributions: Geometric, Binomial, Poisson and uniform distributions; Continuous
distributions: Normal, Exponential, Gamma, Chi-square, t, F, Beta and uniform distributions.

Unit 3: Large sample theory: Sampling, standard error, Tests of significance: null &
alternative hypothesis, critical region and level of significance, one tail & two tail tests
critical value and significant value.
Test of significance for large sample. Test of significance for single proportion/differences of
two proportions.
Sampling of variables: test of significance for sample mean/difference of sample
means/difference of standard deviations.

Unit 4: Correlation and regression: Partial and multiple correlations, Correlation coefficients,
rank correlation, Regression lines and its properties.

Reference Books:
1. S. C. Gupta and V. K. Kapoor, Fundamentals of Mathematical Statistics, Sultan Chand
& Sons, 2020.

Page 26 of 61
 2. W. J. Kennedy and J. E. Gentle, Statistics Computing, CRC Press, 1980.
3. V. K. Rohatgi, A. K. Md. Ehsanes Saleh, An Introduction to Probability and Statistics,
Wiley-Interscience, 2011.
4. P. L. Mayer, Introductory Probability and Statistical Applications, IBH, 1970.
5. A. M. Mood and F. Graybill, Introduction to the Theory of Statistics, TMH, New Delhi,
1973.

----------------------------------------------------

Course Code: MAM 204

Course Title: Number Theory
Course Credits: 04
Course Objectives: This course introduces the concepts of congruences, utilising which it
establishes certain important results like Fermat's little, Euler and Wilson's theorems. It also
aims to introduce the concepts of quadratic reciprocity, Simple continued fractions,
arithmetical functions, Binary quadratic forms and Cryptography.
Course Outcomes: This course enables the student to

1. Understand the Modular arithmetic and its use.

2. Make computations involving indices modulo a prime and determine whether a
given integer is a square or not modulo the same prime.
3. Solve Pell's equation and determine whether a given integer is prime or composite.
4. Learn the concepts of Binary quadratic forms and public key cryptosystems.

Evaluation Criteria:

(a) End-Semester Examination: 70%

(b) Sessional (Class Test/Quiz/Presentation/Seminar/Assignments etc.): 30%

Course Contents:

Unit 1: Fundamental theorem of arithmetic, divisibility in Z, congruences, Linear

Congruences, Chinese Remainder Theorem, Euler’s Ø- function, Fermat's Little, Euler and
Wilson's Theorem, Perfect Numbers.

Unit 2: The order of an integer modulo n, Primitive roots for primes, Euler’s criterion for
quadratic residues and non-residues, Legendre’s symbol and its properties, Quadratic
reciprocity, Quadratic congruences with composite moduli, Representation of integers as
sum of two squares and sum of more than two squares.

Unit 3: Simple continued fractions, Pell’s Equation, Arithmetical functions, Sum and number
of Divisors, their multiplicative nature, Greatest integer function and De Polignac's formula,
Mobius inversion formula, Primality Testing and Factoring.

Page 27 of 61
Unit 4: Binary quadratic forms, equivalence relations and reduced forms among binary
quadratic forms, Cryptography: Classical and Public Key Cryptosystems, RSA, Diffie-Hellman
Key exchange and Elgamal cryptosystems.

Reference Books:

1. G. H. Hardy and E. M. Wright, An Introduction to The Theory of Numbers, 6th edition,

Oxford University Press, 2008.
2. D. M. Burton, Elementary Number Theory, 6th edition, McGraw-Hill, 2005.
3. I. Niven, H. S. Zuckerman and H. L. Montgomery, An Introduction to The Theory of
Numbers, 5th edition, Wiley, 1991.
4. T. M. Apostol, Introduction to Analytic Number Theory, Springer- Verlag, 1976.
5. N. Koblitz, A Course in Number Theory and cryptography: A Graduate Text, Springer
(second edition), 1994.

-----------------------------------------------------------

Course Code: MAM 204

Course Title: Commutative Algebra
Course Credits: 04
Course Objectives: The aim of this course is to develop a good base in the theory of
Commutative rings, which is an important prerequisite for several classical courses like
Algebraic number theory, Algebraic geometry etc.
Course Outcomes: This course enables the students to:
1. Develop a good understanding about the concepts of ideals and modules.
2. Understand ring of fractions, module of fractions and localization.
3. Learn about Integral dependence, primary decompositions and valuation rings.
2. Learn about Noetherian and Artinian rings as well as modules.
Evaluation Criteria:

(a) End-Semester Examination: 70%

(b) Sessional (Class Test/Quiz/Presentation/Seminar/Assignments etc.): 30%
Course Contents:
Unit 1: Extension and contraction of ideals, Jacobson and nil radicals of a ring, Prime
avoidance lemma, Modules and Module homomorphisms, Submodules and quotient
modules, operations on submodules, Direct sum and product, finitely generated modules,
Exact sequences.

Page 28 of 61
Unit 2: Tensor product of Modules, Restriction and extension of scalars, Exactness
properties of the tensor product, Rings and Modules of fractions, local and semilocal rings,
localization, local properties, Extended and contracted ideals in rings of fractions.

Unit 3: Primary decomposition, First and second uniqueness theorem of primary

decomposition, Integral dependence, Going up theorem, Going down theorem, Integrally
closed domains, Valuation rings.

Unit 4: Chain conditions, Noetherian and Artinian modules, Noetherian rings, Composition
series of a module, Hilbert's Basis theorem, Primary decomposition in Noetherian rings,
Artinian rings.

Reference Books:

1. M. F. Atiyah and I. G. MacDonald, Introduction to Commutative Algebra, CRC Press,

Taylor & Francis, 2018.
2. B. Singh, Basic Commutative Algebra, World Scientific, 2011.
3. D. Eisenbud, Commutative Algebra with a View Towards Algebraic Geometry, Springer,
2004.
4. O. Zariski and P. Samuel, Commutative Algebra, Volume I & II, Springer, 1975.
5. R. Y. Sharp, Steps in Commutative Algebra, Cambridge University Press, 2000.
-----------------------------------------------------

Course Code: MAM-204

Course Title: Numerical Solutions of Partial Differential Equations
Course Credits: 04
Course Objectives: This course aims to impart knowledge of numerical analysis in solving
partial differential equations. The course introduces numerical methods, especially the finite
difference method for solving different types of partial differential equations. The
techniques are provided to solve the elliptic, parabolic, and hyperbolic partial differential
equations.

Course Outcomes: Students completing this course will be able to:

1. Choose and apply suitable methods for partial differential equations.
2. Design numerical schemes for partial differential equations.
3. Select suitable methods for elliptic, parabolic, and hyperbolic partial differential
equations.
4. Set up, implement, and analyse discretization methods for selected partial
differential equations.
Evaluation Criteria:

(a) End-Semester Examination: 70%

Page 29 of 61
 (b) Sessional (Class Test/Quiz/Presentation/Seminar/Assignments etc.): 30%

Course Contents:
Unit 1: Finite Differences: Review of finite difference operators, finite difference methods,
inverse interpolation, their developments, and applications.
Unit 2: Elliptic PDE: Five-point formulae for Laplacian, replacement for Dirichlet and
Neumann’s boundary conditions, curved boundaries, solution on a rectangular domain,
block tri-diagonal form and its solution using the method of Hockney, condition of
convergence.
Unit 3: Parabolic PDE: Concept of compatibility, convergence, and stability, explicit, full
implicit, Crank-Nicholson, du-Fort and Frankel scheme, ADI methods to solve two-
dimensional equations with error analysis.
Unit 4: Hyperbolic PDE: Solution of hyperbolic equations using FD, and Method of
characteristics, Limitations, and Error analysis.
Reference Books:

1. C. F. Gerald and P. O. Wheatley, Applied Numerical Analysis, 6th Ed., Addison-Wesley

Publishing, 2002.
2. G. D. Smith, Numerical Solution of Partial Differential Equations, Oxford University
Press, 2001.
3. M. K. Jain, Numerical suctions of differential equations, New Age International, 2002.
4. L. V. Fausett, Applied Numerical Analysis, Prentice Hall, 2nd Ed. 2007.
5. C. E. Froberg, Introduction to Numerical Analysis, 2nd Ed., Addison Wesley. 2004.
6. G. E. Forsythe and W. R. Wasow, Finite Difference methods for partial Differential
equation, Literary Licensing, LLC, 2013.

------------------------------------
Course Code: MAM-204
Course Title: Matrix Analysis
Course Credits: 04
Course Objectives: The objective of this course is to see matrix theory via functional analytic
tools.

Course Outcomes: After completing this course, the student will be able to:

1. Understand the concept of Lie groups.

2. Understand Hermitian matrices and their properties.
3. Understand norms for vectors and matrices and analytic properties of norms.
4. Understand the positive definite and semidefinite matrices.

Page 30 of 61
Evaluation Criteria:

(a) End-Semester Examination: 70%

(b) Sessional (Class Test/Quiz/Presentation/Seminar/Assignments etc.): 30%

Course Contents:

Unit 1: Closed subgroups of general linear group, examples and their compactness and
connectedness, matrix exponential.

Unit 2: Hermitian matrices, properties and characterizations of Hermitian matrices, Rayleigh

quotient theorem, Courant-Fischer min-max theorem, Weyl inequality.

Unit 3: Norms for vectors and matrices, algebraic and analytic properties of norms, Duality
and geometric properties of norms, Gersgorin discs.

Unit 4: Positive definite and semidefinite matrices, characterizations and properties,

Sylvester’s theorem, polar decomposition.

Reference Books:

1. B. C. Hall, Lie Groups, Lie Algebras, and Representations: An Elementary

Introduction, Springer, 2015.
2. R. A. Horn and C. R. Johnson, Matrix Analysis, Cambridge University Press, 2013.
3. F. Zhang, Matrix Theory, Basic Results and Techniques, Springer Verlag, 1999.
4. R. Bhatia, Matrix Analysis, Springer, 1997.
5. C. C. Meyer, Matrix Analysis and Applied Linear Algebra, SIAM, 2000.

------------------------------------------------

Course Code: MAM-204

Course Title: Fuzzy system & Analysis
Course Credits: 04
Course Objectives: This course introduces Fuzzy sets and applications, geometric
representation of Fuzzy sets, Fuzzy relations, Fuzzy logic and for solving real-life decision-
making problems where the crisp formulation is not appropriate.

Course Outcomes: After completion of this course students will be able to:
1. Understand the basic ideas of fuzzy sets, operations and properties of fuzzy sets and
fuzzy relations.
2. Understand the basic features of membership functions, fuzzification process and
defuzzification process.
3. Design Fuzzy rule-based models for function approximation.

Page 31 of 61
 4. Understand combining fuzzy set theory with probability to handle random and non-
random uncertainty and the decision-making process.
5. Understand decision-making in fuzzy environments, fuzzy databases and queries.

Evaluation Criteria:
(a) End-Semester Examination: 70%
(b) Sessional (Class Test/Quiz/Presentation/Seminar/Assignments etc.): 30%
Course Contents:
Unit 1: Basic Concepts of Fuzzy Sets and Fuzzy Logic: Motivation. Fuzzy sets and their
representations. Membership functions and their designing. Types of Fuzzy sets. Operations
on fuzzy sets. Convex fuzzy sets. Alpha-level cuts. Geometric interpretation of fuzzy sets.
Linguistic variables.

Unit 2: Possibility measure and distribution. Fuzzy rules. Fuzzy Relations and Fuzzy
Arithmetic: Composition of fuzzy relations. Fuzzy numbers. Arithmetic operations on fuzzy
numbers. Fuzzy reasoning Fuzzy mapping rules and fuzzy implication rules. Fuzzy rule-based
models for function approximation.

Unit 3: Types of fuzzy rule-based models (the Mamdani, TSK, and standard additive models).
Fuzzy Implications and Approximate Reasoning: Fuzzy Logic and Probability Theory:
Possibility versus probability. Probability of a fuzzy event. Baye’s theorem for fuzzy events.
Probabilistic interpretation of fuzzy sets. Fuzzy measure.

Unit 4: Decision making in a Fuzzy Environment: Fuzzy Decisions, Fuzzy Linear programming,
Fuzzy Multi-criteria analysis, Multi-objective decision making.
Fuzzy databases and queries: Introduction, Fuzzy relational databases, Fuzzy queries in crisp
databases.

Reference Books:
1. J. Yen and R. Langari, Fuzzy Logic: Intelligence, Control, and Information, Pearson
Education, 2003.
2. G. J. Klir and B. Yuan, Fuzzy Sets and Fuzzy Logic: Theory and Applications, Prentice-
Hall of India, 1997.
3. H. J. Zimmermann, Fuzzy Set theory and its applications, Kluwer Academic Publ,
2001.

--------------------------------------------------
Course Code: MAM 204
Course Title: Biomathematics
Course Credits: 04

Page 32 of 61
Course Objectives: The objective of this course is to introduce students to the role of
mathematics in examining a biological phenomenon and the fundamentals of applying
mathematical modeling techniques to understand and predict the dynamics of biological
systems. Further, this course will make students familiar with the various applications of
mathematical modeling in the areas such as ecology, biology, population dynamics, control
of infectious diseases, etc.

Course Outcomes: After completion of this course, students will be able to:
1. Apply the mathematical tools and techniques to examine a biological phenomenon.
2. Formulate the mathematical models to explore the dynamics of interacting species
in the ecosystem.
3. Formulate the mathematical models for the spread and control of infectious
diseases.
4. Formulate the reaction-diffusion models of a biological phenomenon.

Evaluation Criteria:
(a) End-Semester Examination: 70%
(b) Sessional (Class Test/Quiz/Presentation/Seminar/Assignments etc.): 30%

Course Contents:
Unit 1: Role of Mathematics in biosciences, Continuous population Models for single
species: Exponential growth model, logistic growth model, Gompertz growth, logistic
models with time-delay effects, Stochastic Models of population growth.

Unit 2: Continuous models for interacting populations: Two species models, Community
matrix approach, Qualitative behaviour of the community matrix, Predator-prey models:
Dynamic of the Lotka Volterra model, Predator-prey models involving different kinds of
functional responses. Chemostat models, Competition models, Mutualism models.

Unit 3: Dynamics of Infectious diseases, simple epidemic models; SIS, SIR, SIRS, SEIS, rate of
immigration, contact rate, types of interactions, types of transmission, basic reproduction
number (definition and its calculation), endemic situation.

Unit 4: Reaction-Diffusion models: Simple Random Walk and Derivation of the Diffusion
Equation, Reaction-Diffusion Equations, Diffusion models for insects and animal dispersal,
Chemotaxis.

Reference Books:
1. J. D. Murrey, Mathematical Biology I: An Introduction, Springer, 2010.
2. A. Hastings, Population Biology: Concepts and Models, Springer, 1997.
3. F. Brauer and C. Castillo-Chavez, Mathematical Models in Population Biology and
Epidemiology, Springer, 2001.
4. M. Kot, Elements of Mathematical Ecology. Cambridge University Press, 2001.

Page 33 of 61
5. J. N. Kapur, Mathematical Models in Biology and Medicine, Affiliated East-West Press
Pvt. Ltd., 2010.
--------------------------------------------

Page 34 of 61
 Semester-III
Course Code: MAM-304
Course Title: Operations Research
Course Credits: 04
Course Objectives: The aim of this course is to introduce various methods to find the
optimal solution to linear and non-linear programming problems, inventory problems, and
to introduce the various model to find out the optimum service rate and the number of
servers in a queuing system.

Course Outcomes: After completion of this course students will be able to:
1. Formulate real-world problems as a linear programming model and describe the
theoretical workings of the graphical, simplex method and dual simplex method.
2. Understand the various inventory control techniques and their applications in stock
management in an organization.
3. Understanding of the theoretical background of queuing systems.
4. Understand and compute quantitative metrics of performance for queuing systems

Evaluation Criteria:
(a) End-Semester Examination: 70%
(b) Sessional (Class Test/Quiz/Presentation/Seminar/Assignments etc.): 30%

Course Contents:
Unit 1: Definition, scope and applications of Linear programming problems (L.P.P.),
Mathematical formulation of the problems, Solution of L.P.P. by graphical method, Simplex
method, Duality in L.P.P., Dual simplex method and sensitivity analysis.

Unit 2: Dynamic programming, Solution of discrete dynamic programming, Solution of L.P.P.

by dynamic programming, Nonlinear programming problem (NLPP), Kuhn-Tucker conditions
for NLPP, quadratic programming, Wolfe’s modified simplex method, Beale’s method.

Unit 3: Inventory control, Deterministic inventory problems with no shortages, deterministic

inventory problems with shortages, EOQ problems with price breaks, multi-item
deterministic problems.

Unit 4: Queuing theory: Steady-state solution of Markovian queuing models: M/M/1,

M/M/1 with limited waiting space. General model: Birth-Death Process.

Reference Books:
1. H. A. Taha, Operation Research: An Introduction, Pearson Prentice Hall Pearson
Education, Inc., 2016.
2. K. Swarup, P. K. Gupta and M. Mohan, Operations Research, S. Chand and Sons, New
Delhi, 2010.

Page 35 of 61
 3. S. S. Rao, Optimization Theory and Applications, Wiley Eastern Ltd, New Delhi,1979.
4. G. Hadley, Linear Programming, Narosa Publishing House, 1995.
5. N. S. Kambo, Linear and nonlinear programming, East West Press, 1997.

-------------------------------------------------------------
Course Code: MAM 304
Course Title: Finite Elements Methods
Course Credits: 04
Course Objectives: The main objective of this course is to make the students acquainted
with the weighted residual and finite element methods. After doing this course students will
be able to solve ordinary and partial differential equations for simple as well as complex
domains.

Course Outcomes: This course enables the students to:

1. Learn the concepts of fields Weighted residual methods and moment methods for
homogeneous and non-homogeneous boundary conditions.
2. Understand the concepts of the variational method.
3. Learn the concepts of Finite element methods.
4. Understand the solutions of ODEs FEM.

Evaluation Criteria:
(a) End-Semester Examination: 70%
(b) Sessional (Class Test/Quiz/Presentation/Seminar/Assignments etc.): 30%

Course Contents:
Unit 1: Introduction, Weighted residual methods: Galerkin, Least square, Subdomain,
collocation and moment methods for homogeneous and non-homogeneous boundary
conditions. Examples.

Unit 2: Variational method: Euler equation, Construction of Functional, Rayleigh-Ritz

method, Equivalence of Galerkin and Rayleigh-Ritz methods. Examples.

Unit 3: Finite element methods: Shape functions-straight lines, triangular, rectangular.

Natural coordinates in one, two and three dimensions. Shape functions using Lagrange’s
polynomials for one, two and three dimensions.

Unit 4: Solution of ODEs FEM, weighted-residue methods and parabolic, hyperbolic and
elliptic equations using FEM.

Reference Books:
1. M. K. Jain, S. R. K. Iyengar and R. K. Jain, Numerical methods Problems and Solutions,
New Age International (P) ltd, 2007.
2. R. S. Gupta, Elements of Numerical Analysis, Macmillan India Ltd. New Delhi, 2009.

Page 36 of 61
 3. P. Duchateau and D. Zachmann, Schaum's Outline of Partial Differential Equations,
McGraw-Hill, 1986.
4. O. C. Zienkiewic and Y. K. Cheung, The finite element method in structural and
continuum mechanics, 2005.
------------------------------------------------------

Course Code: MAM 304

Course Title: Field Extension Theory
Course Credits: 04
Course Objectives: The aim of this course is to introduce the concepts of field extensions,
Galois theory and its applications, Solvability by radicals and constructability by ruler and
compass. It gives a strong base for certain courses in later semesters like Algebraic Number
theory.

Course Outcomes: This course enables the students to:

1. Learn the concepts of fields, finite fields and irreducibility criteria of polynomials
over fields.
2. Understand the concepts of Galois theory and its applications to insolvability of
quintic and higher degree polynomials.
3. Learn the concepts of constructability of plane geometric objects by ruler and
compass.

Evaluation Criteria:

(a) End-Semester Examination: 70%

(b) Sessional (Class Test/Quiz/Presentation/Seminar/Assignments etc.): 30%
Course Contents:

Unit 1: Field extensions: Finite, algebraic and transcendental extensions, Algebraically closed
fields, Algebraic closure of a field, irreducibility criterion.

Unit 2: Finite fields, Simple (primitive) extensions, Separable extensions, Primitive element
theorem, Perfect fields, automorphisms of a Field extension. Cyclotomic Polynomials and
extensions

Unit 3: Splitting fields, Normal Extensions, Galois extensions, Galois group of an irreducible
polynomial: Quadratic, Cubic and Quartic, Fundamental Theorem of Galois Theory.

Unit 4: Radical extensions, Solvability by radicals, Insolvability of the general quintic by

radicals, Constructability by ruler and compass.

Reference Books:

Page 37 of 61
 1. P. B. Bhattacharya, S. K. Jain, S. R. Nagpaul, Basic Abstract Algebra, 2nd edition,
Cambridge, 1995.
2. D. S. Dummit and R. M. Foote, Abstract Algebra, 3rd edition, Wiley,2003.
3. M. Artin, Algebra, Prentice Hall India, 2009.
4. S. Lang, Algebra, 3rd edition, Springer, 2002.
5. J. Rotman, Galois Theory, 2nd edition, Springer, 2006.
6. P. Morandi, Field and Galois Theory, Springer, 2010.
7. I. S. Luthar and I. B. S. Passi, Algebra 4 - Field Theory, Narosa, 2004.

-----------------------------------------------

Course Code: MAM-304

Course Title: Algebraic Topology
Course Credits: 04
Course Objectives: The primary objective of this course is to introduce students certain
topological notions such as homotopy, fundamental groups and covering spaces.

Course Outcomes: After completing this course, students will:

1. Understand some fundamental ideas in algebraic topology.

2. Apply discrete, algebraic methods to solve topological problems.
3. Develop some intuition for how algebraic topology relates to concrete topological
problems.

Evaluation Criteria:

(a) End-Semester Examination: 70%

(b) Sessional (Class Test/Quiz/Presentation/Seminar/Assignments etc.): 30%
Course Contents:

Unit 1: Transformation groups, group action, geometric motions, homotopic maps,

homotopy type, retraction and deformation retract.

Unit 2: Fundamental group, calculation of fundamental groups of n-sphere, the cylinder, the
torus, and the punctured plane.

Unit 3: Brouwer fixed-point theorem, the fundamental theorem of algebra, free product
free groups, Seifert-Van Kampen theorem and its applications.

Unit 4: Covering projections, the lifting theorem, relation with the fundamental group,
universal covering space, the Borsuk-Ulam theorem, classification of covering spaces.

Reference Books:

Page 38 of 61
 1. J. R. Munkres, Topology, 2nd Edition, Pearson International, 2000.
2. W. S. Massey, A Basic Course in Algebraic Topology, Springer Verlag, 1991.
3. S. Deo, Algebraic Topology: A Primer, Text and Reading in Mathematics 27,
Hindustan Book Agency, 2003.
4. T. B. Singh, Elements of Topology, CRC Press, Taylor & Francis, 2013.
5. G. E. Bredon, Geometry and Topology, Springer, 2014.
6. J. J. Rotman, An Introduction to Algebraic Topology, Springer, 2011.

------------------------------------------------------
Course Code: MAM 304
Course Title: Cryptography
Course Credits: 04
Course Objectives: This course aims to prepare a good background in the theoretical as well
as practical aspects of modern cryptography, which are the prerequisite in the current
research as well as in modelling a good scheme with high securities as per the demand in
several public sectors.

Course Outcomes: This course enables the student to:

1. Learn the basic idea/ problem of cryptography.

2. Understand several classical cryptosystems and need of public key cryptosystems.
3. Exhibit some well-known cryptosystems in the programming languages C/C++.
4. Develop some public key cryptosystems with high securities.

Evaluation Criteria:

(a) End-Semester Examination: 60%

(b) Practical Examination: 10%
(c) Sessional (Class Test/Quiz/Presentation/Seminar/Assignments etc.): 30%

Course Contents:

Unit 1: Introduction to basic terminologies associated with Cryptography, Definition and

classification of cryptosystem, Classical crypto systems, Description of rail fence cipher,
Simple Columnar cipher, Caesar cipher, Linear cipher, Affine linear cipher, Distinction
between Substitution cipher and Permutation cipher.

Unit 2: Classical cipher as particular case of Affine linear cipher, Insecurity of Affine linear
cipher, Block cipher and different modes of implementation of Block cipher, Stream cipher,
Feistel cipher, DES (Data Encryption Standard) and AES (Advanced Encryption Standard).

Page 39 of 61
Unit 3: Public Key cryptosystems, Need for Public Key cryptosystems, Description of RSA,
Rabin cryptosystem, Diffie-Hellman key exchange, ElGamal cryptosystem, Cryptanalysis of
Public Key cryptosystem, Introduction to Elliptic curve cryptography, Digital signatures.

Unit 4: Perfect security and Shanon’s Theorem. Mathematical problems related to

cryptography, Division Algorithm, Calculation of Units in Z/nZ, Fast Exponentiation,
Factoring problem, Different factorisation Algorithms, Discrete Log problems.

Lab Component: Cryptography Lab in C/C++ (at least 10 Sessions), Use of Sage software.

Reference Books:

1. J. A. Buchmann, Introduction to Cryptography, Springer, 2004.

2. N. Koblitz, A Course in Number Theory and Cryptography, Springer, 1994.
3. M. Welschenbach, Cryptography in C and C++, 2nd edition, Apress, 2002.
4. W. Stallings, Cryptography and Network Security, Principles and Practice, 5th ed.,
Pearson Education, 2012.
5. D. R. Stinson, Cryptography, Theory and Practice, CRC Press, 3rd ed., 2005.
6. W. Trappe and L. C. Washington, Introduction to Cryptography with Coding Theory,
Pearson, 2006.
7. J. Hoffstein, J. Pipher, and J. H. Silverman, An Introduction to Mathematical
Cryptography, 2nd ed., Springer, 2014.

----------------------------------------------------

Course Code: MAM-304

Course Title: Financial Mathematics
Course Credits: 04
Course Objectives: The main objective of this course is to make the students acquainted
with the present and past value of money. This course will also help the students while
understanding and dealing with share markets for predicting the market value of shares of a
company.
Course Outcomes: This course enables the student to

1. Learn the basic time value of money and applications.

2. Understand the asset classes and derivatives.
3. Learn about the greeks and their role in risk management and Exotic Options.
4. Learn the Fixed-Income Markets and Analysis.

Evaluation Criteria:

(a) End-Semester Examination: 70%

(b) Sessional (Class Test/Quiz/Presentation/Seminar/Assignments etc.): 30%

Page 40 of 61
Course Contents:

Unit 1: Time value of money and applications: Discrete compounding and increased
frequency. Continuous compounding and discounting, Annuities and perpetuities-
applications to mortgages and pensions, Nominal and effective rates, Market interest rate
adjustments, Capital budgeting and Net Present Value (NPV).

Unit 2: Asset Classes: Equities exchanges, dividends, stock-splits, short selling, Currencies FX
markets, currency pairs, Commodities of different types, seasonality effects, Indices,
Derivatives: Futures and forwards; options, No arbitrage, Payoff diagrams; P&L diagrams,
Option strategies, Life-cycle of an option, Put Call parity, Speculation, hedging, gearing.

Unit 3: The Greeks and their role in risk management, Plain vanilla types, Exotic Options:
Over-the-counter (OTC), Early exercise embedded decisions, Americans and Bermudans,
Classification features of exotics.

Unit 4: Sampling types discrete and continuous, Asian options arithmetic and geometric
averaging; running averages, Look backs, Fixed and floating strike rate exotics, Fixed-Income
Markets and Analysis: Fixed income markets and products zero-coupon bonds, swaps and
their relationship; coupon bearing bonds.

Reference Books:

1. R. L. Burden, J. D. Faires, and A. C. Reynolds, Numerical analysis. Brooks/cole Pacific

Grove, CA, 2001.
2. P. Glasserman, Monte Carlo methods in financial engineering. 2003.
3. K. Back, Asset pricing and portfolio choice theory. Oxford University Press, 2010.
4. H. Follmer and A. Schied, Stochastic finance: an introduction in discrete time. Walter
de Gruyter, 2011.
5. A. J. McNeil, R. Frey, and P. Embrechts, Quantitative risk management: Concepts,
techniques and tools. Princeton university press, 2015.
6. J. Hull, Options, Futures, and Other Derivatives, 9th ed. 2017.

----------------------------------------------
Course Code: MAM-304
Course Title: Differential Geometry
Course Credits: 04
Course Objectives: The main objective of this course is to understand the notion of curves
and surfaces, geometry of orientable surfaces, vector fields, Gauss map, geodesics,
Weingarten maps, line integrals, parameterization of surfaces, areas, volumes and Gauss-
Bonnet theorem.

Page 41 of 61
Course Outcomes: After completing this course, the students will be able to:

1. Understand the local and global theory of curves and surfaces so that they can
embark on further studies and research in topics like Algebraic Topology, Differential
Topology, Riemannian Geometry, and allied areas.
2. Understand notions such as orientation, Gauss maps, geodesics, and parallel
transport.
3. Learn about Weingarten map and curvature of a plane curve.
4. Deal with parametrization and be familiar with well-known surfaces as equations in
several variables, able to find area and volumes.
Evaluation Criteria:
(a) End-Semester Examination: 70%
(b) Sessional (Class Test/Quiz/Presentation/Seminar/Assignments etc.): 30%

Course Contents:

Unit 1: Graphs and level sets of functions on Euclidean spaces, vector fields, integral curves
of vector fields and tangent spaces.

Unit 2: Surfaces in Euclidean spaces, vector fields on surfaces, orientation, Gauss map.
Geodesics, parallel transport.

Unit 3: Weingarten map, curvature of plane curves, arc length and line integrals, Curvature
of surfaces. Parameterized surfaces, local equivalence of surfaces, Gauss-Bonnet Theorem

Unit 4: Definition and examples of manifolds, compatible charts, smooth manifolds,

examples of smooth manifolds, smooth maps between manifolds

Reference Books:

1. M. P. Do Carmo, Differential Geometry of Curves and Surfaces, Prentice-Hall, Inc.,

Englewood Cliffs, New Jersey, 1976.
2. B. O’ Neill, Elementary Differential Geometry, Academic Press, 1997.
3. A. Gray, Differential Geometry of Curves and Surfaces, CRC Press, 1998.
4. A. Pressley, Elementary Differential Geometry, Springer (Undergraduate Mathematics
Series), 2001.
5. C. Bar, Elementary Differential Geometry, Cambridge University Press, 2010.
6. J. A. Thorpe, Elementary Topics in Differential Geometry, Springer (Undergraduate
Texts in Mathematics), 1979.
7. L. W. Tu, An Introduction to Manifolds, Springer, 2011.
8. A. Mishchenko and A. Formentko, A Course of Differential Geometry and Topology,
Mir Publishers Moscow, 1988.
--------------------------------------------------------------

Page 42 of 61
 Semester- IV
Course Code: MAM-404
Course Title: Fluid Dynamics
Course Credits: 04
Course Objectives: This course gives fundamental knowledge of fluid, its properties, and
behaviour under various conditions of internal and external flows. This course aims to
develop an understanding of mass, momentum, and energy equation in fluid flow. The
concept of stress-strain relation and the Navier-Stokes equation will also be discussed.

Course Outcomes: After completing this course, the student will be able to:

1. Derive the equation of continuity in various geometries.

2. Explain the momentum equation and Bernoulli’s equation for fluid flow.
3. Understand two-dimensional irrotational motion produced by the motion of a
cylinder.
4. Develop the relationship between stresses and strains.

Evaluation Criteria:
(a) End-Semester Examination: 70%
(b) Sessional (Class Test/Quiz/Presentation/Seminar/Assignments etc.): 30%

Course Contents:
Unit 1: Definition of fluid, streamlines, path lines and streak lines, material derivative,
Lagrange’s and Euler’s methods, equation of continuity in Cartesian, polar and curvilinear
coordinates system, boundary surfaces, vorticity, vortex lines, rotational and irrotational
motions.

Unit 2: Euler’s equation of motion in Cartesian, polar, and curvilinear coordinate systems,
Bernoulli's equation, Bernoulli's theorem, and their applications.

Unit 3: Motion in two dimensions, Conjugate functions, Source, sink, doublets, and their
images, conformal mapping, and two-dimensional irrotational motion produced by the
motion of a circular cylinder in an infinite mass of liquid.

Unit 4: Stress components in a real fluid, Equilibrium equation in stress components,

Transformation of stress components, Principal stress, Nature of strains, Transformation of
rates of strain, Relationship between stress and rate of strain, Navier-Stokes equation of
motion in Cartesian coordinates.

Reference Books:

Page 43 of 61
 1. W. H. Besant and A. S. Ramsey, A Treatise on Hydrodynamics, CBS Publishers and
Distributors, Delhi, 1988.
2. S. W. Yuan, Foundations of Fluid Dynamics, Prentice-Hall of India, 1988.
3. M. D. Raisinghania, Fluid Dynamics, S. Chand, 2010.
4. F. Charlton, Introduction to Fluid Dynamics, CBC Publishers, 2004.

------------------------------------------------------
Course Code: MAM-404
Course Title: Wavelet Analysis
Course Credits: 04

Course Objectives: To study the Fourier transform on 𝐿1 (ℝ) and 𝐿2 (ℝ) spaces, some
theorems related to Fourier transform, wavelets and wavelet transforms and their basic
properties, Multiresolution Analysis, orthonormal wavelets and construction of wavelets.

Course Outcomes: After completion of this course students will be able to:

1. Find the Fourier transform of functions in 𝐿1 (ℝ) and 𝐿2 (ℝ), and its properties.
2. Understand the basic properties of wavelets with examples.
3. Construct the wavelets by using convolutions.
4. Find the continuous wavelet transform of the functions.
5. Understand the concepts of Frames and Frame operators and orthonormal wavelets.
6. Understand the construction of orthonormal wavelets.

Evaluation Criteria:
(a) End-Semester Examination: 70%
(b) Sessional (Class Test/Quiz/Presentation/Seminar/Assignments etc.): 30%

Course Contents:

Unit 1: Fourier Analysis: Fourier transforms in 𝐿1 (ℝ), Basic properties of Fourier transforms,
Fourier transforms in 𝐿2 (ℝ), Poisson’s Summation formula, the Shannon sampling theorem
and Gibbs’s phenomenon, Heisenberg’s uncertainty principle.

Unit 2: Definition and examples of wavelets, Continuous wavelet transforms and their basic
Properties, continuous wavelet transforms and Holder continuity.

Unit 3: Discrete wavelet transforms, Frames and Frame operators, orthonormal wavelets.

Unit 4: Definition of Multi-resolution Analysis and examples, properties of scaling functions

and orthonormal wavelet Bases, construction of wavelets, cardinal B-splines, Franklin
wavelet, Battle-Lemarie wavelet, Daubechies’ wavelets.

Reference Books:

Page 44 of 61
 1. L. Debnath and F. A. Shah, Wavelet Transforms and their Applications, 2nd ed.,
Birkhauser, 2015.
2. I. Daubechies, Ten Lectures on Wavelets, SIAM: Society for Industrial and Applied
Mathematics, 1992.
3. C. K. Chui, An Introduction to Wavelets, Academic Press, 1992.
4. A. Boggess, and F. J. Narcowich, A First Course in Wavelets with Fourier Analysis, 2nd
ed., Wiley, 2009.
5. E. Hernandez and G. L. Weiss, A First Course on Wavelets, CRC Press, 1996.
6. D. F. Walnut, An Introduction to Wavelet Analysis, Birkhauser, 2004.
7. P. Wojtaszczyk, A Mathematical Introduction to Wavelet, Cambridge University
Press, 1997.

-----------------------------------------------------
Course Code: MAM-404
Course Title: Theory of Distributions
Course Credits: 04
Course Objectives: To develop the concepts of Distributions and their basic properties, e.g.,
convergence of distributions, distributional derivative, Fourier transform of tempered
distributions and Sobolev Spaces.

Course Outcomes: After completion of this course students will be able to:
1. Understand the basic ideas of test functions, distributions, distributional derivatives,
tempered distributions, etc.
2. Construct the test functions and find the distributional derivative of generalised
functions.
3. Find the Fourier transforms of test functions and distributions.
4. Solve the differential equations by using distributions.
5. Understand the basic ideas of Sobolev spaces and their applications.

Evaluation Criteria:
(a) End-Semester Examination: 70%
(b) Sessional (Class Test/Quiz/Presentation/Seminar/Assignments etc.): 30%
Course Contents:
Unit 1: Test functions, Distributions, basic properties of distributions, convergence of
distributions.

Unit 2: Distributional Derivative, distributions of compact support, Convolution of

distributions.

Page 45 of 61
Unit 3: The Space of rapidly decreasing functions, tempered distributions, Fourier
transformation in S, Fourier transformation in S’, convolution theorem in S’, Fourier
transformation in E’, Applications to differential equations.

Unit 4: Sobolev space 𝑊 {𝑚,𝑝} , Sobolev space 𝐻 𝑠 , Product and convolution in 𝐻 𝑠 ,

Applications to boundary value problems.

Reference Books:
1. M. A. Al-Gwaiz, Theory of Distributions, CRC Press, 1992.
2. A. H. Zemanian, Distribution Theory and Transform Analysis: An Introduction to
Generalized Functions with Applications, Dover Publications Inc, 2003.
3. A. H. Zemanian, Generalized Integral Transforms, Dover Publications Inc, 1987.
4. R. S. Pathak, A Course in Distribution Theory and Applications, Narosa, 2001.
5. R. Strichartz, A Guide to Distribution Theory and Fourier Transforms, World
Scientific, 2003.

----------------------------------------------------
Course Code: MAM-404
Course Title: Operator Theory
Course Credits: 04
Course Objectives: To introduce eigenvalues and eigenvector of a linear operator, spectrum
theory, compact linear operators, spectral properties of compact operators, spectral theory
of self-adjoint operators and Banach Algebra.

Course Outcomes: After completion of this course students will be able to:
1. Understand the basic ideas of eigenvalues and eigenvector of linear operators, the
spectrum of bounded operators and spectral properties of bounded operators.
2. Understand the concepts of compactness, selfadjointness and positivity of bounded
linear operators.
3. Understand the Spectral theory of self-adjoint operators.
4. Understand the basic ideas of Banach Algebra, commutative Banach algebra with
examples, Gelfand transform and Maximal-ideal space with examples.

Evaluation Criteria:
(a) End-Semester Examination: 70%
(b) Sessional (Class Test/Quiz/Presentation/Seminar/Assignments etc.): 30%

Course Contents:
Unit 1: Operators on Hilbert space, eigenvalues and eigenvector of a linear operator, the
spectrum of bounded operators, resolvent, spectral properties of bounded operators.

Page 46 of 61
Unit 2: Compact linear operators, Basic properties, adjoint of compact operators, Spectral

properties of compact operators, Fredholm alternative.

Unit 3: Spectral theory of self-adjoint operators, Spectral properties of self-adjoint

operators, Positive operators and their properties, Spectral representation of a self-adjoint
compact operator, Spectral family of a self-adjoint operator and its properties, Spectral
representation of a self-adjoint operator, Continuous functions of self-adjoint operators.

Unit 4: Banach Algebra, Regular and Singular elements, Topological division of zero, spectral
mapping theorem for polynomials and spectral radius formula, Ideals in Banach algebra,
Commutative Banach algebra with examples, Gelfand transform, Maximal-ideal space with
examples.

Reference Books:
1. W. Rudin, Functional Analysis, Tata McGraw Hill, 2010.
2. G. Bachman and L. Narici, Functional analysis, Academic Press, New York, 1998.
3. B. V. Limaye, Functional Analysis, 3rd ed., New Age International Ltd., 2014.
4. J. B. Conway, A Course in Operator Theory: A Graduate Studies in Mathematics,
Springer, 1985.
5. G. F. Simmons, An Introduction to Topology and Modern Analysis, Tata McGraw-Hill,
2004.
6. E. Kreyszig, Introductory Functional Analysis with Applications, John Wiley & Sons,
India, 2006.
7. M. Schechter, Principles of Functional Analysis, 2nd ed., American Mathematical
Society, 2001.
8. E. Kaniuth, A Course in Commutative Banach Algebras, Springer-Verlag, 2009.
----------------------------------------------------

Course Code: MAM 404

Course Title: Algebraic Number Theory
Course Credits: 04
Course Objectives: The objective of this course is to introduce about Number fields and Ring
of integers and understand the Ideal factorizations in a ring of integers, class numbers and
Kummer's approach to solve the Fermat's conjecture.

Course Outcomes: This course enables the students to:

1. Do the calculations on Quadratics and Cyclotomic fields, roots of unity and their
irreducible polynomials.
2. Calculate the units in the ring of integers of Quadratics and Cyclotomic fields.
3. Solve the Pythagorus and Fermat's equations.
4. know the concepts of ideal factorizations and ramifications in ring of integers.

Page 47 of 61
Evaluation Criteria:

(a) End-Semester Examination: 70%

(b) Sessional (Class Test/Quiz/Presentation/Seminar/Assignments etc.): 30%

Course Contents:

Unit 1: Algebraic Numbers and Algebraic Integers, Algebraic Number Fields, Integral Basis
and Discriminant, Ring of Integers in an Algebraic Number Field (with explicit calculations for
Quadratic & Cyclotomic fields).

Unit 2: Divisibility in Algebraic Number Fields, Euclidean Fields, Group of Units in an

Algebraic Number Field, Divisibility in Quadratic Fields.

Unit 3: Ideals, Divisors and Factors, Fundamental Theorem of Ideal Theory, Fractional Ideals,
Inverse of an Ideal, Congruences, Norm of an Ideal.

Unit 4: The problem of ramification, Class numbers, The Fermat's conjecture (last theorem).

Reference Books:

1. H. Pollard and H. G. Diamond, The Theory of Algebraic Numbers, 3rd edition, Dover,
2010.
2. S. Alaca, K. S. Williams, Introductory Algebraic Number Theory, CUP, 2003.
3. E. Weiss, Algebraic Number Theory, Dover, 1998.
4. I. Stewart, D. Tall, Algebraic Number Theory and Fermat’s Last Theorem, 3rd edition,
A K Peters/CRC Press, 2001.
5. G. J. Janusz, Algebraic Number Fields, 2nd edition, 1996.

---------------------------------------------------
Course Code: MAM-404
Course Title: Dynamical Systems
Course Credits: 04
Course Objectives: The aim of this course is to introduce the students to the basic concepts
of dynamical systems and techniques used to analyze linear and nonlinear dynamical
systems. A major part of the course is devoted to the qualitative theory of nonlinear system
of differential equations.

Course Outcomes: After completion of this course, students will be able to:
1. Solve dynamical systems and interpret phase portrait in several applications from
biology, physics, chemistry, and engineering.

Page 48 of 61
 2. Describe qualitatively the behaviour of the solution of a dynamical system without
necessarily finding the exact solution using the stability theory of differential
equations.
3. Explain the basic results of stability theory including stable manifold theorem,
Hartman-Grobman theorem, Centre manifold theorem, and Normal form theory.
4. Identify various types of bifurcations (saddle-node, transcritical, super- and sub-
critical pitchfork, Hopf) arising in dynamical systems.

Evaluation Criteria:
(a) End-Semester Examination: 70%
(b) Sessional (Class Test/Quiz/Presentation/Seminar/Assignments etc.): 30%

Course Contents:
Unit 1: Linear dynamical systems: Preliminary concepts, Diagonalization, Exponentials of
operators, Fundamental theorem of linear systems, Stability, Stable, unstable and centre
subspaces, Non-homogeneous linear systems.

Unit 2: Non-linear dynamical systems: Existence and uniqueness theorem, Maximal interval
of existence, Flow, Fixed points and Linearization, Stable and unstable manifolds of
equilibria, Stable manifold theorem, Hartman-Grobman theorem.

Unit 3: Stability and Liapunov function, Liapunov’s direct method, Converse Lyapunov's
theorems, Center manifold theory, Normal form theory, Examples and applications to
nonlinear systems.

Unit 4: Existence and non-existence of limit cycles, Bendixson’s non-existence criterion,

Poincare-Benedixon theorem and applications. Bifurcation theory, Classification of
bifurcation in 2-D systems: Saddle-node bifurcation, Transcritical bifurcation, Pitchfork
bifurcation, Hopf-bifurcation.

Reference Books:
1. L. Perko, Differential Equations and Dynamical Systems, 3rd Edition, Springer, 2010.
2. F. Verhulst, Non-linear Differential Equations and Dynamical Systems, Springer,
1990.
3. M. W. Hirsch and S. Smale, Differential Equations, Dynamical Systems and Linear
Algebra, Academic Press, New York, 1974.
4. S. Wiggins, Introduction to applied nonlinear dynamical systems and chaos. Springer-
Verlag, USA, 1990.
5. S. H. Strogatz, Nonlinear Dynamics and Chaos: With Applications to Physics, Biology,
Chemistry, and Engineering, Westview Press, Boulder, 2000.

-----------------------------------------------

Page 49 of 61
Course Code: MAM-404
Course Title: Advanced Complex Analysis
Course Credits: 04
Course Objectives: The primary objective of this course is to understand the notion of
normality and its application, the theory of range of an entire function leading to Picard’s
theorem, the Riemann mapping theorem, Runge’s theorem and topics related to
approximation, introduce harmonic function theory leading to Dirichlet’s problem in the
unit disc.

Course Outcomes: After completion of this course, students will be able to:

1. Understand the concept of normality and how this concept is applicable in the
proofs of the Riemann mapping theorem, Picard’s little theorem, Picard’s big
theorem, Schottky’s theorem.
2. Understand the approximation results such as Mittag-Lefffler theorem, and
Weierstrass factorization theorem. Students will understand Dirichlet’s problem in
the unit disc.

Evaluation Criteria:

(a) End-Semester Examination: 70%

(b) Sessional (Class Test/Quiz/Presentation/Seminar/Assignments etc.): 30%

Course Contents:

Unit 1: Space of analytic functions, normal convergence, local boundedness, equicontinuity,

normality, Montel’s theorem, the Vitali-Porter theorem, Marty’s theorem and its
extensions, Zalcman’s lemma, the Montel-Carathéodory theorem and its consequences.

Unit 2: Picard’s little theorem, Picard’s big theorem, Schottky’s theorem, the Riemann
mapping theorem.

Unit 3: Analytic continuation, Schwarz reflection principle, analytic continuation along a

path, Monodromy theorem. Runge’s theorem, the Mittag-Lefffler theorem, Weierstrass
factorization theorem, Gamma function and the Riemann zeta function.

Unit 4: Harmonic functions, mean-value property, maximum principle, the Poisson integral
formula, Dirichlet problem on the disc.

Reference Books:

1. T. W. Gamelin, Complex Analysis, Springer, 2001.

2. L. V. Ahlfors, Complex Analysis, McGraw Hill Co., 1979.

Page 50 of 61
 3. J. B. Conway, Functions of One Complex Variables, 2nd edition, Narosa, New Delhi,
1996.
4. R. Narasimhan and Y. Nivergelt, Complex Analysis in One Variable, Birkhauser, 2001.
5. B. P. Palka, An Introduction to Complex Function Theory, Springer, 1991.
6. E. M. Stein and R. Shakarchi, Complex Analysis, Princeton University Press, 2003.
7. D. C. Ullrich, Complex Made Simple, AMS, 2008.
8. W. Rudin, Real and Complex Analysis, Tata McGraw-Hill, 2006.
9. C. A. Berenstein and R. Gay, Complex Analysis: An Introduction, Springer, 2011.
-----------------------------------------------------

Course Code: MAM-404

Course Title: Differentiable Manifolds
Course Credits: 04
Course Objectives: The objective of this course is to introduce differentiable manifolds, local
coordinates and charts on it, smooth maps and their derivations, vector fields, tangent
spaces on differential manifold, differential forms and Stokes’ theorem.

Course Outcomes: Study of this course enables students to

1. Understand local coordinate systems on manifolds so that they can relate it to the
global coordinate system on the Euclidean space of the same dimension.
2. Understand what a smooth map between manifolds is, and differentiate smooth
maps between manifolds. Students can compute tangent vectors and regular values.
3. Learn about the tangent space and vector fields at a point in a differential manifold.
4. Learn about differential forms and their use for the change of axes in multiple
integrals in a differential manifold.
5. Appreciate better the topics covered in allied courses like Algebraic Topology,
Differential Topology, and Riemannian geometry as well as be adequately prepared
for pursuing research in these topics.

Evaluation Criteria:
(a) End-Semester Examination: 70%
(b) Sessional (Class Test/Quiz/Presentation/Seminar/Assignments etc.): 30%

Course Contents:

Unit 1: Differentiable manifolds, smooth maps, diffeomorphisms, tangent spaces to a

manifold, derivatives of smooth maps, regular values and the statement of Sard’s theorem,
submersions and immersions, submanifolds.

Unit 2: Vector fields, flows, exponential map, Frobenius theorem, Lie groups and Lie
algebras, homogeneous spaces.

Page 51 of 61
Unit 3: Multi-linear algebra, exterior algebra, tensors and differential forms, exterior
derivatives, Lie derivatives.

Unit 4: Orientable manifolds, integration on manifolds and Stokes’ Theorem, tangent and
cotangent bundles as examples of vector bundles.

Reference Books:

1. J. Lee, Introduction to Smooth Manifolds, Springer, 2013.

2. W. M. Boothby, An Introduction to Differentiable Manifolds and Riemannian
Geometry, Elsevier Science, 2003
3. M. Spivak, Comprehensive Introduction to Differential Geometry, Publish or Perish,
Incorporated, 1979.
4. F. W. Warner, Foundations of Differentiable Manifolds, Springer, 2013.
5. S. Kumaresan, A Course in Differential Geometry and Lie Groups, Hindustan Book
Agency,2002.
6. J. R. Munkers, Analysis on Manifolds, Westview Press, 1997.
7. S. Lang, Introduction to Differentiable Manifold, 2nd edition, Springer, 2002.
8. L. Auslander, and R. E. Mackenzie, Introduction to Differentiable Manifolds, Dover,
2009.
----------------------------------------------

Course Code: MAM-404

Course Title: Computational Fluid Dynamics
Course Credits: 04
Course Objectives: This course provides the students with a significant level of experience in
using modern CFD software to analyze complex fluid-flow systems. This course improves the
student’s understanding of the basic principles of fluid mechanics. This course also improves
the student’s research and communication skills by using a self-directed, detailed study of a
complex fluid-flow problem and communicating the results in written form.

Course Outcomes: After completing this course, the student will be able to:

1. Recognize the type of fluid flow that is occurring in a particular physical system and
e-model equations to investigate the flow.
2. Describe various flow features regarding appropriate mechanical principles and force
balances.
3. Simplify a real fluid-flow system into a simplified model problem, to select the
proper governing equations for the physics involved in the system, solve for the flow,
investigate the fluid-flow behaviour, and understand the results.

Page 52 of 61
 4. Communicate the results of this detailed fluid-flow study in a written format.

Evaluation Criteria:
(a) End-Semester Examination: 70%
(b) Sessional (Class Test/Quiz/Presentation/Seminar/Assignments etc.): 30%

Course Contents:
Unit 1: Finite Difference Method: Classification Of 2nd Order Partial Differential Equations -
Parabolic, Hyperbolic, and Elliptic Types, Governing Equations of Fluid Dynamics,
Introduction to Finite Difference discretization, Explicit and Implicit Schemes.

Unit 2: ADI Method for 2-D Heat Conduction Problem, Splitting and Approximate
Factorization for 2-D Laplace Equation, Multigrid Method, Upwind Scheme, Lax-Wendroff,
and McCormack Schemes.

Unit 3: Finite Volume Method: Preliminary Concepts, Flux Computation across Quadrilateral
Cells, Reduction of A BVP to Algebraic Equations, Illustrative Example Like, Solution of
Dirichlet Problem For 2-D Laplace Equation.

Unit 4: Basic Equations of Viscous and Inviscid Flow, Basic Equations in Conservative Form,
Associated Typical Boundary Conditions for Euler and Navier-Stokes Equations, Grid
Generation Using Elliptic Partial Differential Equations, Incompressible Viscous Flow Field
Computation: Stream Function Vorticity Formulation.

Reference Books:

1. P. Niyogi, S. K. Chakraborty and M. K. Laha, Introduction to computational fluid

Dynamics, Pearson Education, Delhi 2005.
2. C. A. J. Fletcher, Computational Techniques for Fluid Dynamics, Vol-I and Vol-II,
Springer, 1988.
3. R. Peyret and T. D. Taylor, Computational Methods for Fluid Flow, Springer 1983.
4. J. F. Thompson, Z.U.A Warsi and C. W. Martin, Numerical Grid Generation,
Foundations and Applications, North Hollamm, 1985.
5. J. D. Anderson Jr., Computational Fluid Dynamics, McGraw Hill, 2012.

----------------------------------------------
Course Code: MAM 404
Course Title: Lie Group and Lie Algebra
Course Credits: 04
Course Objectives: The objective of this course is to introduce the concepts of a Lie group, a
Lie algebra, computation of Lie algebra as a tangent space at identity on a Lie group. It also
aims to study about Simple Lie algebras over complex field, their Weyl groups and their
representations.
Page 53 of 61
Course Outcomes: Study of this course enables the student to:

1. Learn the concepts of Lie groups and Lie algebras and relations among them.
2. Compute Lie algebras of some classical Lie groups as tangent space at identity
element.
3. Learn about Simple Lie algebras and their representations over complex numbers.
4. Learn about Lie theory, Representation theory, the Peter Weyl theorem and induced
representations.

Evaluation Criteria:

(a) End-Semester Examination: 70%

(b) Sessional (Class Test/Quiz/Presentation/Seminar/Assignments etc.): 30%

Course Contents:
Unit 1: Lie Algebras and Root Systems: Introduction to Lie Algebras, Representations, Special
kind of Lie Algebra, The Lie algebras 𝑠𝑙𝑛 (𝐶),.

Unit 2: Simple Lie Algebras over ℂ, Killing form, Weyl group, The Dynkin diagram,
Representations of simple Lie algebras, Simple groups of Lie type.

Unit 3: Lie Groups: Introduction, 𝑆𝑈2 , 𝑆𝑂3 and 𝑆𝑙2 (𝑅), Homogeneous spaces, some
theorems about matrices, Lie theory.

Unit 4: Representation theory, Compact groups and integration, Maximal compact

subgroups, the Peter-Weyl theorem, Functions on 𝑅 𝑛 and 𝑆 𝑛−1 , Induced representations.

Reference Books:

1. R. Carter, G. Segal and I. Macdonald, Lectures on Lie Groups and Lie Algebras,
London Mathematical Society, 1995.
2. J. E. Humphreys, Introduction to Lie Algebras and Representation Theory, Springer,
2010.
3. D. A. Bump, Lie Groups, Springer, 2011.
4. M. Artin, Algebra, Prentice Hall India, 2009.
--------------------------------------------------

Page 54 of 61
CBCS (Open Elective) courses for other Departments/Schools other than SPDS
Semester-I
Course Code: MAM-106
Course Title: Linear Programming and Optimization
Course Credits: 04
Course Objectives: The purpose of this course is to introduce linear programming problems
and various techniques to solve linear programming problems, transportation and
assignment problems. Introduce the concepts of game theory and various methods for
solving games.
Course Outcomes: After completion of this course students will be able to:
1. Formulate real-world problems as a linear programming model and find their
solutions by using graphical methods.
2. Solve linear programming problems by the simplex method, dual simplex method,
etc.
3. Solve transportation and assignment problems.
4. Formulate different strategic situations in terms of game theoretic models and find
out the optimal strategy.

Evaluation Criteria:
(a) End-Semester Examination: 70%
(b) Sessional (Class Test/Quiz/Presentation/Seminar/Assignments etc.): 30%

Course Contents:
Unit 1: Definition, scope and applications, Linear programming problems (L.P.P.),
Mathematical formulation of the problems, Solution of L.P.P. by graphical method.

Unit 2: Simplex method, Duality in L.P.P., Dual simplex method.

Unit 3: Transportation problems and assignment problems of linear programming. Travelling

salesman problem.

Unit 4: Game theory: Two-person zero-sum games, Games with mixed strategies, Graphical
solutions, and solutions by linear programming.

Reference Books:
1. H. A. Taha, Operation Research- An introduction, Macmillan Publishing Co. Inc., NY.,
2016.
2. K. Swarup, P. K. Gupta and M. Mohan, Operations Research, S Chand and Sons, New
Delhi, 1977.
3. G. Hadley, Linear Programming, Narosa Publishing House, 1995.

Page 55 of 61
 ---------------------------------------------------

Semester-II
Course Code: MAM-206
Course Title: Mathematical Modeling
Course Credits: 04
Course Objectives: The objective of this course is to introduce the students to the elements
of the mathematical modeling process, and to make them familiar with the basic concepts
of mathematical modeling using differential equations and difference equations. Various
mathematical models arising in ecology, physics, and epidemiology will be explained. The
techniques of formulation and solution of linear and nonlinear programming models will
also be explained.
Course Outcomes: After completion of this course, students will be able to:
1. Translate everyday situations into the mathematical model by identifying the
assumptions which are consistent with the context of the problem and which in turn
shape and define the mathematical characterization of the problem.
2. Revise and improve mathematical models so that they will represent the problem
under consideration more realistically.
3. Formulate mathematical models using differential equations and difference
equations, and analyze them.
4. Formulate and solve the linear and nonlinear programming models.

Evaluation Criteria:
(a) End-Semester Examination: 70%
(b) Sessional (Class Test/Quiz/Presentation/Seminar/Assignments etc.): 30%

Course Contents:
Unit 1: Introduction to Mathematical Modeling: modeling process, Classifications of
mathematical models, Some simple illustrations. Basic concepts of ordinary differential
equations; Mathematical modeling through differential equations, linear growth and decay
models, Nonlinear growth and decay models.
Unit 2: Mathematical modeling through systems of ordinary differential equations of first
order: Mathematical models in population dynamics and epidemics, Mathematical
Modeling through second order differential equations: Mathematical Modeling of planetary
motion, circular motion, motion of satellites.
Unit 3: Mathematical modeling through difference equations, Basic theory of linear
difference equations with constant coefficients, Mathematical modeling through difference
equations in population dynamics, economic, and finance.
Unit 4: Mathematical modeling through linear programming, Linear programming models in
Transportation and assignment, Mathematical modeling through non-linear programming.
Reference Books:

Page 56 of 61
 1. J. N. Kapur, Mathematical Modeling, Wiley Eastern,1988.
2. D. N. Burghes, A.D. Wood, Mathematical Models in the Social Management and Life
Sciences, John Wiley & Sons, 1980.
3. F. Charlton, Ordinary Differential and Difference Equations, Van Nostrand, 1989.

CBCS (Open Elective) courses for other Departments within SPDS

Semester-III
Course Code: MAM-306
Course Title: Mathematical Methods
Course Credits: 04
Course Objectives: The main objective is to give knowledge to find rank of a matrix,
solutions of system of linear equations, roots of transcendental equations. Basic properties
of Laplace transform and its applications have been introduced.
Course Outcomes: On completing the course, a student is enabling to understand
1. To compute solutions of system of linear equations by various direct methods.
2. To compute roots of nonlinear transcendental equations and algebraic equations by
using various numerical techniques.
3. To compute solutions of ordinary differential equations with constant coefficients
and initial boundary value problems like heat equations & wave equations

Evaluation Criteria:
(a) End-Semester Examination: 70%
(b) Sessional (Class Test/Quiz/Presentation/Seminar/Assignments etc.): 30%

Course Contents:
Unit 1: Rank of matrices, Solutions of linear systems: Existence & Uniqueness, Gauss-
Elimination method, Gauss–Jordan method, LU-Factorization: Crout/Doolittle’s
decomposition, Cholesky decomposition method
Unit 2: Bisection method, False Position method, Secant Method, Iteration Method,
Newton-Raphson method, Error computation and convergence.
Unit 3: Laplace transform, linearity, first shifting theorem (s-shifting), transforms of
derivatives and integrals, Unit-step function (Heaviside Function), second shifting theorem
(t-shifting), Dirac’s delta function, partial fractions, convolution, differentiation and
integration of transforms.
Unit 4: Laplace transform: Solutions of ordinary differential equations with constant
coefficients and solutions of initial boundary value problems: heat equations & wave
equations

Page 57 of 61
Reference Books:
1. S. R. K. Iyengar, R. K. Jain, Numerical Methods, New Age International Publishers,
2009.
2. E. Kreyszig, Advanced Engineering Mathematics (10e) John Wiley & Sons, 2015.
3. S. S. Sastry, Introductory Methods of Numerical Analysis, Prentice Hall India Learning
Private Limited, Fifth edition, 2012.
4. M. Spiegel, Schaum's Outline of Laplace Transforms, McGraw-Hill Education
5. L. Debnath, D. Bhutta, Integral Transforms and Their Applications, Chapman and
Hall/CRC, 2nd edition, 2006.
6. S. C. Gupta, Mathematical Statistics, Sultan Chand & Sons, 2014.

--------------------------------------

Semester-IV

Course Code: MAM-405

Course Title: Numerical methods
Course Credits: 04
Course Objectives: The main objective is to give the knowledge to introduce various
formulas have been introduced to evaluate the values of derivatives/integrals for given set
of data, and various types of approximations of functions are also introduced. The finite
difference method is introduced for solving boundary value problems (BVPs). Finite
difference operators are also introduced.

Course Outcomes: On completing the course, a student is enabling to understand:

1. To evaluate unknown value at certain point via interpolations.

2. To compute derivatives values at certain point for the given set of data.
3. To compute solutions of BVPs by finite difference methods, etc.
4. To compute numerically single as well as double integration of a function via its set of
values at given at interpolating points.

Evaluation Criteria:

(a) End-Semester Examination: 70%

(b) Sessional (Class Test/Quiz/Presentation/Seminar/Assignments etc.): 30%

Course Contents:

Unit 1: Solution of ODEs: Picard’s method, Taylor series method, Euler's method, Euler's
modified method, and their convergence. Runge-Kutta method of order two and four.
Unit 2: Numerical Integration: Newton-Cotes formula: - Properties of Cote’s numbers, and
deduction from Newton-Cotes numbers - trapezoidal rule, Simpson’s 1/3 rule, and

Page 58 of 61
Simpson’s 3/8 rule and Weddle’s rule; methods based on undetermined coefficients, Gauss
quadrature method.
Unit 3: Interpolation: Newton, Lagrange and Hermite Interpolations, error of the
interpolating polynomial, piecewise-polynomial approximation, Spline interpolation.

Unit 4: Different types of approximations: Least square polynomial approximation,

Polynomial approximation using orthogonal polynomials.
Reference Books:

1. M. K. Jain, S. R. K. Iyengar, R. K. Jain, Numerical methods Problems and Solutions,

New Age International (P) ltd, 2009.
2. S. S. Sastry, Introductory method of Numerical Analysis, PHI, New Delhi, 2005.
3. D. V. Griffiths, I. M. Smith, Numerical Methods for Engineers, Taylor & Francis, 2006.
4. C. E. Froberg, Numerical Mathematics, Theory and Computer Applications; The
Benjamin Cummings Pub. Co., 1985.
5. J. H. Mathews: Numerical Methods for Mathematics, Science and Engineering,
Prentice-Hall, 2nd edition, 1992.
6. R. S. Gupta, Elements of Numerical Analysis, Macmillan India Ltd., New Delhi, 2009.
-------------------------------------------------------

Page 59 of 61