M.Sc.

in Mathematics
(Syllabus approved by Board of Studies meeting on January 13, 2022)

Department of Mathematics

School of Mathematical and Computational Sciences

UNDER THE

CHOICE BASED CREDIT SYSTEM

1/41
 SCHEME OF EXAMINATION
As per the university authority decision and amendments from time to time.

M.Sc. in Mathematics
Semes Course Credit
Course Name Course
ter code Hours
AMPATT1 Abstract Algebra 05
AMPATT2 Topology 05
Core
AMPATT3 Discrete Mathematical Structures 05
I
AMPATT4 Geometry of Manifolds 05
Open Applications of Fuzzy Sets & Fuzzy
AMPATO1 05
Elective Logic
Core AMPBTT1 Real Analysis 05

AMPBTT2 Numerical Analysis 05

AMPBTD1 Coding Theory 05
AMPBTD2 Finsler Geometry 05
AMPBTD3 Fluid Mechanics 05
Mathematical Methods of Applied
II AMPBTD4 Mathematics 05
DSE (Any
Two)
AMPBTD5 Mathematical Statistics 05
Riemannian Manifold and
AMPBTD6 connections 05

Fractional Calculus and Integral

AMPBTD7 Transforms 05

Research
AMPBTT3 Research Methodology 02
Methodology
Functional Analysis
AMPCTT1 05
(Core)
Theory of ordinary differential
AMPCTT2 equations 05

Algebraic Topology
AMPCTD1 05
Complex Manifold
III AMPCTD2 05
Difference Equations
DSE (Any AMPCTD3 05
Two)
Fuzzy Sets and Fuzzy Logic
AMPCTD4 05
Information Theory and its
AMPCTD5 Applications 05

2/41
 Integral Equation and Calculus of
AMPCTD6 Variations 05

Multipoint Iterative Methods

AMPCTD7 05
Fundamentals of Elasticity
AMPCTD8 05
Project Phase-I
Project AMPCPF1 05
Complex Analysis
Core
AMPDTT1 05
Theory of partial differential
AMPDTT2 equations 05

Advanced Differential Equations

AMPDTD1 05
Advanced Functional Analysis
AMPDTD2 05
Applications of Fuzzy Logic
AMPDTD3 05
Ring and Category of Modules
AMPDTD4 05
Cryptography
AMPDTD5 05
IV
DSE (Any Financial Mathematics and its
Two) AMPDTD6 Applications 05

Mathematical Ecology
AMPDTD7 05
Operations Research
AMPDTD8 05
Theory of Relativity
AMPDTD9 05
Fundamentals of theoretical
AMPDTD10 Seismology 05

Project Phase-II
Project AMPDPF1 05

3/41
 SEMESTER - 1
Paper Code: AMPATT1

ABSTRACT ALGEBRA
Course Aim:This course is designed in such a manner which creates ability among the
students to understand the concepts of algebraic structures with their advance features.

Pre-requisite:Group theory, Ring theory, Linear algebra

Normal and Subnormal series, Composition series, Jordan -Holder theorem, Solvable groups,
Nilpotent groups
Modules, Sub modules, Quotient modules, Direct sums, Modules generated by a subset,
Cyclic module, Homomorphism of modules, Isomorphism theorems, Exact sequences of
modules, Simples modules, Schur’s lemma, Free modules, Nilpotent and nil ideals,
Noetherian and Artinian modules and rings, Homr (⊕ Mi , ⊕ Mi ), Hilbert Basis Theorem,
Wedderburn Artin Theorem.
Smith normal form over a PID and rank, Fundamental structure theorem for finitely
generated modules over a PID and its applications.
Field Theory, Extension fields, Algebraic and Transcendental extensions, Separable and
inseparable extensions, Normal extensions, Perfect Fields, Finite Fields, Primitive elements,
algebraically closed field.
Galois Theory, Galois Extension, Fundamental theorem of Galois Theory, Applications of
Galois theory to classical problems.
Algebra of Linear transformations, Characteristic roots and matrices for linear
transformations, Canonical forms - Similarity of linear transformation, Invariant subspaces,
Reduction of triangular form, Nilpotent transformation, Index of Nilpotency, Invariants of a
nilpotent transformation, The Primary Decomposition Theorem, Jordan blocks and Jordan
forms
Text Books:
1. I. N. Herstein, Topics in Algebra,Wiely Eastern Ltd. New Delhi (1975).
2. P. B. Bhattacharya, S. K. Jain and S. K. Jain and S. R. Nagpaul, Basic Abstract Algebra,
IInd Edition Cambridge University, Press Indian Edition.
Reference Books:
1. S. Lang, Algebra, Edition- Wisely.
2. M. Artin, Algebra, Prentice Hall of India, 1991.
3. N. Jacobson, Basic Algebra, Vol. I. II & III Hindustan Publishing Company.
4. D. S. Malik, J. N. Morderson& M. K. Sen, Fundamentals of Abstract Algebra, McGraw
Hill International Edition 1997.

CourseOutcomes: Students will be able to understand after the completions of the course:
4/41
 ➢ To describe algebraic structures solvable and nilpotent groups, nilpotent and nil
ideals, modules with isomorphism theorems and noetherian and artinian modules.
➢ To describe field theory with extensions, Galois Theory with application, smith normal
forms over PID and finitely generated modules over PID with its applications.
➢ To describe about canonical forms, linear and nilpotent transformation.

Paper Code: AMPATT2

TOPOLOGY
Course Aim: To introduce the students to topology and elementary properties of
topological spaces, continuous functions between topological spaces and to develop the
student’s ability to handle abstract ideas of Mathematics.
Pre-requisite: Basic concepts of topology.
Geometry and topology, from geometry to metric spaces, topological spaces, basis, sub basis,
order topology, subspace topology, closed sets, closure, interior, limit points, separable
spaces.
Continuous functions and their characterization, comparison of topologies, weak topologies,
sequential continuity, homeomorphism, topological property, constructing continuous
functions, metric topology, quotient topology
Connected topological spaces, Path-connected topological spaces, continuity and
connectedness, intermediate value theorem, components and path component of a
topological space, local connectedness PINK = NOT DONE
Compact spaces, limit point compact spaces, sequentially compact spaces, continuity and
compactness, extreme value theorem, uniform continuity theorem, local compactness, one
point compactification.
Countability axioms, separation axioms, Hausdorff topological spaces, Regular topological
spaces, Normal topological spaces, Urysohn lemma and Tietze extension theorem
Product topology and box topology, compactness and product topology, tube lemma,
Tychonoff theorem, connectedness and product topology
Text Book:
1. James R. Munkres, Topology, A First Course, Prentice Hall of India Pvt. Ltd., New Delhi.
Reference Books:
1. G. F. Simmons, Introduction to Topology and Modern Analysis, McGraw-Hill Book
Company.
2. K. D. Joshi, introduction to General topology, New Age International Pvt. Ltd. Publ.,
New Delhi.
3. J. Dugundji, Topology, Allyn and Bacon, 1966 (Reprinted in India by Prentice Hall of
India Pvt. Ltd).
Course outcomes:Upon successful completion of this course, the students will be able to
5/41
understand the interconnection of metric space and topological spaces. They will know about
the concepts of continuity and convergence in a more general sense. They will learn how to
generalize the mathematical concepts.

Paper Code:AMPATT3

DISCRETE MATHEMATICAL STRUCTURES

Course Aim:To develop logical thinking and its application to computer science (to
emphasize the importance of proving statements correctly and de-emphasize the hand-
waving approach towards correctness of an argument). The subject enhances one’s ability
to reason and ability to present a coherent and mathematically accurate argument.
Pre-requisite:Basic concepts of mathematical logic, Combinatorics, Lattice and Graph theory.
Unit 1: Mathematical Logic:
Statements, Connectives, Statement formulas, Truth tables, Tautologies, Equivalence and
Implications, functionally complete set of connectives, Normal forms (Disjunctive and
Conjunctive), Ordering of normal forms, Rules of Inference, Consistency of premises, Indirect
method of Proof, Automatic theorem proving, Predicate calculus, statement functions,
Quantification, Predicate formulas, Inference theory for predicate calculus.

Unit 2: Set Theory:

Basics of set theory, Relations, different types of binary relations, relation matrix and graph
of a relation, Partition and covering of a set, Equivalence and compatibility relation, Partial
ordering, Hasse-diagram, Characteristic functions of a set.

Unit 3: Combinatorics:
Basic of Counting’s, Permutations and Combinations, Enumeration of Permutations and
Combinations, Principle of inclusion and exclusion, The pigeonhole principle, Generating
Functions of Sequences, Calculating Coefficients of Generating Functions, Recurrence
Relations, Solving Recurrence Relations by Substitution and Generating Functions, The
Method of Characteristic Roots.

Unit 4: Lattices and Boolean algebra:

Lattices as Partially Ordered Sets and as Algebraic systems, Properties of Lattices, Sub-
lattices, Lattice homomorphism, Modular and Distributive Lattices, Complements, Boolean
Algebra, Boolean homomorphism, Boolean identities, Stone Representation Theorem for
finite Boolean Algebras (statement only), Boolean Functions and products, Free Boolean
Algebras, Relationship with Statement Logic, Karnaugh Map.

Unit 5: Graph Theory:

Fundamental concepts of graphs and digraphs, path, reachability and Connectedness,
Eulerian and Hamiltonian graphs, shortest path problems, chromatic numbers and chromatic

6/41
index, Matrix representation of Graph, Planarity of Graphs, Tree and their properties, Binary
tree, Spanning tree.

Text Books:
1. J. P. Trembly and R. Manohar, Discrete Mathematical Structures with Applications to
Computer Science, Mc-Graw Hill Book Company, 1977.
2. Joe. L. Mott, Abraham Kandel, Theodore P. Baker, Discrete Mathematics for
Computer Scientists and Mathematicians, Prentice Hall of India, 2008.
Reference Books:
1. Kolman, Busby and Ross, Discrete Mathematical Structures, Prentice Hall Publication,
New Jersey, USA.
2. Narsingh Deo, Graph Theory with Applications to Engineering and Computer Science,
Prentice Hall of India.
3. HalukBingol, Discrete Mathematics.
4. Preparata and Yeh: Discrete Mathematical Structures.
Course Outcomes: Students will be able to:
➢ Write an argument using logical notation and determine if the argument is or is not
valid.
➢ Demonstrate the ability to write and evaluate a proof or outline the basic structure
of and give examples of each proof technique described.
➢ Understand the basic principles of sets and operations in sets.
➢ Prove basic set equalities.
➢ Demonstrate an understanding of relations and functions and be able to determine
their properties.
➢ Apply counting principles to determine probabilities.
➢ Demonstrate different traversal methods for trees and graphs.
➢ Model problems in Computer Science using graphs and trees.

Paper Code: AMPATT4

GEOMETRY OF MANIFOLDS

Course Aim:After the study of Differential Geometry in previous semesters in this course
we introduce the basic concept of manifolds. The study of manifolds combines many
important areas of mathematics. It generalizes concepts of Manifolds through linear
algebra, Analysis and topology. In this part of the course student will learn about
Manifolds, Integral curves and Flows, Linear Connection, Exterior Algebra, Exterior
derivative Riemannian manifolds.
Pre-requisite:Manifolds and Differentiable manifolds.

7/41
Manifolds: Topological manifolds smooth manifolds, Differentiable structures defined on
sets, Differentiable functions on a manifold, Differentiable mapping from a manifold into
another manifold.

Differentiable manifolds: smooth maps, chart, atlas, differentiable structure, Definition and
examples of differentiable manifolds, differentials on smooth maps.

Vector fields and Lie bracket: vector fields as an equivalence class of curves, Tangent vector
as a directional derivative operator, algebraic approach of tangent vectors, tangent spaces,
Vector fields on differentiable manifolds, covariant Differentiation f- related vector fields,
tangent bundle Immersions, embeddings and transversality.

Integral curves and Flows: Definition, examples and related theorems of Integral curves.
Definition, examples and related theorems of one parameter group of transformation.

Exterior Algebra and Exterior derivative: Definition, examples related problems of tensor
products, tensor algebra and exterior Algebra.

Text Book:

1. U. C. De and A. A. Shaikh, Differential Geometry of Manifolds, Narosa Publishing

House, New Delhi, 2007.

Reference Books:
1. R. L. Bishop and R. J. Crittenden, Geometry of Manifolds, Academic Press, 1964.
2. S.S. Chern, W.H. Chen and K.S. Lam, Lectures on Differential Geometry, World
Scientific, 2000.
3. N. J. Hicks, Notes on Differential Geometry, Von Nostrand, 1965.
4. J.M. Lee, Introduction to Smooth Manifolds, Springer, 2006.
5. Y. Matsushima, Differentiable Manifolds, Dekker, 1972.
6. M. Spivak, A Comprehensive Introduction to Differential Geometry Vol. 1&3 rd
Edition Publish or Perish, 1999.
7. F. Warner, Foundations of Differentiable Manifolds and Lie Groups, Springer, 1983.

Course Outcomes: They are able to understand Integral curves and Flows, Linear Connection,
Exterior Algebra, Exterior derivative, Riemannian manifolds. Students learnt how topology,
algebra and linear algebra involved in the study of Manifold. Also they recognized the
application of manifold in different branches of Applied Sciences.

Paper Code: AMPATO1

APPLICATIONS OF FUZZY SETS AND FUZZY LOGIC
The basic aim of introducing this open elective is to introduce the application of fuzzy
techniques in decision making. The aim is to be achieved without giving unnecessary
emphasis on learning theoretical aspects of fuzzy set theory. Another aim is to study and

8/41
compare the two methods/theories for dealing with uncertainty namely probability theory
and possibility theory.
Course Aim: A student opting this open elective is supposed to know discrete mathematics
up to the level of higher secondary schools and basic theory of probability from any board
in India and basics of theory of probability. Besides a student must have a burning desire
to find applications of the most modern branch of mathematics broadly termed as Fuzzy
Set Theory and Fuzzy Logic.
Target group: Any P.G. student interested in using tools of mathematics in his/her discipline
of studies.
Objective:Basicobjective of this course is help to learn the wide scope of application of fuzzy
methods in various branches of disciplines like Economics, Political science, social science,
Natural science and Life science etc. Of course this course is most desirable course for any
branch of studies in engineering.
From Classical (Crisp) sets to fuzzy sets: A grand paradigm shift: Introduction, Crisp Sets: An
overview, Fuzzy sets: basic types, Fuzzy sets: Basic concepts, Characteristics and signification
of paradigm shifts

Operation on fuzzy sets: Types of operations, Fuzzy complements, Fuzzy intersections: t-

Norms, Fuzzy unions: t-conorms, Combination of operations, Aggregation of operations

Possibility Theory: Fuzzy measures, Evidence Theory, Possibility theory, Fuzzy sets and
possibility theory, Possibility theory vs. probability theory

Fuzzy Logic: Classical logic: An overview, multivalued logics, Fuzzy propositions, Fuzzy
quantifiers, Linguistic hedges

Approximate Reasoning: Fuzzy expert system: an overview, Fuzzy implications, Selection of

fuzzy implications, Multi conditional approximate reasoning, the role of fuzzy relation
Equations, Interval-valued approximate reasoning.

Fuzzy Systems: General discussion, Fuzzy controllers: An overview, Fuzzy controllers: An

Example, Fuzzy systems and neural networks, Fuzzy neural networks, Fuzzy automata, Fuzzy
dynamic systems.

Fuzzy decision making: General discussion, Individual decision making, multi-person decision
making, Multicriterial decision making, Multistage decision making, Fuzzy ranking methods,
Fuzzy linear programming.

Text Book:
1. George J. Klir, Bo Yuan, Fuzzy sets and fuzzy logic Theory and Applications, PHI
Publications 2002.
Reference Books:

9/41
 1. Zimmermann, H. J.,Fuzzy set theory and its applications. Springer Science & Business
Media (2011).
2. Garg, H. Pythagorean, Fuzzy Sets- Theory and Applications. Springer, Singapore
(2021).
Course Outcomes: After completion of this course a student is supposed to know:
➢ Need of techniques introduced under the course in using(logical) mathematical tools
available for cutting edge research in the area of his/her choice.
➢ Learn to deal with real world uncertainties especially of the fuzzy nature.
➢ Use of fuzzy logic for decision making under real world scenario which is mostly fuzzy.
➢ Basic idea of set theory and basics of fuzzy sets. The significance of application of
fuzzy sets.
➢ Binary and unary operations, combinations of operations on fuzzy sets. Aggregation
operations.
➢ A student is supposed to understand the application as Fuzzy measures evidence
theory, Possibility theory and probability theory.
➢ An overview of classical logic and basics types of fuzzy proposition. Basics inference
rules.
➢ Basics of appropriate reasoning and selection of fuzzy implication.
➢ Basics of fuzzy controller, idea of fuzzification and defuzzification.
➢ Study of fuzzy controllers by mean of examples, Individual and Multiple decision
making, Multicriteria and Multistage decision making.

SEMESTER - 2
Paper Code: AMPBTT1
REAL ANALYSIS
Course Aim:The proposed course is intended to be a basic course on Mathematical analysis
for M.Sc. students that enable to understand the basic concepts of Compact metric spaces,
measure theory and integration.
Pre-requisite: Basic Concepts of Mathematical Analysis.

Compact Metric Spaces: Totally bounded metric spaces, Compact metric spaces,
Lebesgue Covering lemma and Characterization of Compact metric spaces.

Riemann-Stieltjes Integration: Riemann-Stieltjes Integration, Properties of Riemann-

Stieltjes Integrals, Class of Riemann- StieltjesIntegrable functions.

Function ofBoundedVariation: Function of bounded variation, Total variation and its

additive property, Variation function and its properties, Necessary and sufficient
conditions for a function to be boundedvariation.

10/41
MeasurableSets: Measurable sets and their properties, Non- Measurable sets, set of
measure zero, Cantor set, σ-algebra, Borel Algebra, Complete measure.

MeasurableFunctions: Measurable functions, Properties of Measurable functions, Positive

and negative parts of function, Simple functions, Relation between continuity and
measurability of function, Lusin’s and Egoroff’s Theorems.

LebesgueIntegral: Comparison of Lebesgue and Riemann integrals, Lebesgue integral of a

bounded function over a set A of finite measure, Simple properties, Lebesgue integral for
unbounded functions, Bounded convergence theorem for a sequence of function, Fatou’s
lemma, Classical Lebesgue dominated convergence theorem, Monotone convergence
theorem, Fubini’s Theorem.
Text Books:
1. Rudin W., “Principles of Mathematical Analysis”, 3rd ed., McGraw-Hill,1983.
2. Royden H. L., “Real Analysis” (3rd Edition), Macmilan Publishing Co. Inc., New
York, 4th Ed., 1993.
3. Rana I. K., “An introduction to measure and Integration”, Narosa Publishing House,
Delhi,1997.
Reference Books:
1. Apostol T., “Mathematical Analysis”, 2nd ed., Narosa Publishers,2002.
2. G. de Barra, Measure theory and integration, Harwood Publishing Limited, Chichester,
2003.
3. E. M. Stein and R. Shakarchi, Real analysis, measure theory, integration and Hilbert
spaces, Princeton University Press, 2005.
Course Outcomes: After completion of this course, student will be able to:
➢ Understand the fundamental terms of theory of Compact metric spaces, Integration,
Function of bounded variation, Measure theory viz. algebra, σ-algebra, and Lebesgue
Integral.
➢ Understand the basic concepts of measure theory namely Monotone convergence
theorem, Fubini’s Theorem.
➢ Apply the concept of measure in the problems pertaining to integration of function
with respect to particular measure.
➢ Analyze and identify important dissimilarities between Riemann integration and
Lebesgue integration.
➢ Evaluate the value of Lebesgue integration (with respect to its measure) of any
measurable function.
➢ Construct proof of variety of results measure theory using the concept of outer
measure and integration with respect to measure.

11/41
 Paper Code: AMPBTT2
NUMERICAL ANALYSIS
Course Aim:The primary goal is to provide mathematics majors with a basic knowledge
ofnumerical methods including: root finding, numerical linear algebra, interpolation,
solving systems of linear equations, numerical solution to ordinary and partial differential
equations. The course will also develop an understanding of the elements of error analysis
for numerical methods and certain proofs. The course will further develop problem solving
skills.
Pre-requisite: Basic concepts of Numerical Analysis.
Brief review of numerical basic method for algebraic and transcendental equations
Errors, rate of convergence, efficiency index, computational order of
convergenceTranscendental & polynomial equations:
Muller’s method, Chebyshev’s methods, higher order methods, modified Newton-
Raphson method, method for finding multiple root in case of unknown multiplicity, Newton-
Raphson method for nonlinear systems.
Cardano’s method, Ferrari’s method, Descarte’s rule of signs, Sturm sequence, Birge-Vieta
method, Bairstow method,Graeffe’s root squaring method
System of linear equations: partial and complete pivoting in Gauss elimination method,
Doolittle's’ and Crout’s method.
Eigen values & Eigen vectors: Bounds on Eigen values, method for finding Eigen values of
symmetric matrices, method for finding Eigen values of arbitrary matrices,
Interpolation: existence & uniqueness of Lagrange’s & divided interpolation, Truncation
error, Hermite’s interpolation, cubic spline interpolation, errors in interpolation.
Numerical solution of ordinary different equations: solution of boundary value problems by
finite difference method, shooting method.
Numerical solution of partial differential equations: solution of elliptic, parabolic and
hyperbolic partial differential equations problems by finite difference method.
Text Book:
1. Jain M K, Iyengar S R K and Jain R K, Numerical Methods for Scientific and Engineering
Computation, 4th Edn, New Age International Pvt Ltd (2005).

Reference Books:
1. S. S. Sastry, Introductory Methods of Numerical Analysis, 5th Edn. Prentice Hall of
India (2013).
2. J. H. Mathews and K.D. Fink: Numerical Methods using MatLabs, 4rth edition, PHI
Learning Private Limited, New Delhi (2021).
3. B. Bradie: A Friendly Introduction to Numerical Analysis, Pearson Prenctice Hall, India
(2006).

12/41
Course Outcomes:Upon completion of the course, the students will be able to:
➢ Find the source of errors and its effect on any numerical computations and be familiar
with finite precision computations.
➢ Solve an algebraic or transcendental equation using an appropriate numerical
method andperform an error analysis for a given numerical method.
➢ Solve a linear system of equations using an appropriate numerical method which
include directand iterative methods and apply numerical methods to find Eigen-
values and corresponding Eigen-vectors.
➢ Approximate the given data with an interpolating polynomial and least square
approximations.
➢ Calculate a definite integral numerically and solve initial and boundary value
problems usingappropriate numerical methods.

Paper Code: AMPBTD1

CODING THEORY
Course Aim: Discuss various coding schemes. Implement the encoder and decoder of one
block code using any program language and comprehend various error control code
properties (Apply linear block codes for error detection and correction, convolution codes
for performance analysis & cyclic codes for error detection and correction and Design BCH
& RS codes for Channel performance improvement against burst errors.).
Pre-requisite:Basic concepts of Coding Theory.

Block codes, linear codes, minimum distance, generator and parity check matrices, hamming
codes, Nearest neighbour decoding for linear codes, syndrome decoding, weight
enumerators.

Singleton and sphere packing bounds, MDS codes and perfect codes, Gilbert–Varshamov
bound, Griesmer bound, Non-linear codes, Hadamard codes, binary and ternary Golay codes.

Constructions of linear codes, Reed-Solomon and Justesen codes, Reed–Muller codes,

Subfield codes, Cyclic codes, generator and parity-check polynomials, Weight distribution of
codes, Generalized BCH codes, Self-dual codes and invariant theory, Covering radius
problem.

Reed Solomon codes, binary group code, polynomial code, binary cyclic codes of Length 2n
(n odd), generalized Reed-Muller codes, Simplex codes, t-designs, Steiner systems, quadratic
residue codes, Convolutional Codes.

Goppa codes, Quaternary codes, binary codes derived from codes overℤ4 , Galois ring overℤ4 ,
cyclic and quadratic residue codes overℤ4 , self-dual codes overℤ4 .

Text Books:

13/41
 1. J. H. Van Lint, Introduction to Coding Theory, 3rd ed., Graduate Text in Mathematics,
86, Springer-Verlag, 1999.
2. W. C. Huffman and V. Pless, Fundamentals of Error-correcting Codes, Cambridge
University Press, 2003.
3. S. Ling and C. Xing, Coding Theory, A First Course, Cambridge University Press, 2004.
Reference Books:
1. J Buchmann, T. Hoholdt, H. Stichtenoth, Coding Theory, Cryptography and Related
Areas.
2. Wakerly, J. North-Holland, Error-correcting codes, self-checking circuits and
applications, New York 1978.
3. Wan Zh. Wissenschaftsverlag, Algebra und Codes, Peking, 1980.
4. Welsh, D., VCH, Weinheim, Codes and Cryptography, 1991.
5. Wolfowitz, J., Coding theorems of information theory, Springer, Berlin, 1978.
6. Wozencraft, M., Jacobs, I. John Wiley Principles of communication engineering, New
York.
7. Wozencraft, M., Reiffen, B Sequential Decoding, M.I.T. Press, Cambridge/Mass.
8. Wiggert, D. Artech, Boston/Mass, Codes for error control and synchronization, 1988.
Course Outcomes:After completion of the course, the student will be able to:
➢ Design the channel performance using Coding theory.
➢ Comprehend various error control code properties.
➢ Compare various capacity reduction based coding techniques for image and video
type of data.
➢ Illustrate various security oriented coding techniques for Block codes.
➢ Implement various error control techniques for Convolutional codes.

Paper Code: AMPBTD2

Finsler Geometry

Objective: The objective of this course is to enable the students, the basic concepts of Finsler
geometry which are useful for further study.

Line element, degree of homogeneity, Finsler space, Euler’s theorem, metric tensor,
generalized Christoffel symbols, Cartan tensor, Minkowskian space, Tangent space, dual
tangent space, length of a vector, Geodesic.
δ-differentiation, partial δ-differentiation, Berwald differentiation, commutation formulae,
metrical connection, Landsberg space, Affinely connected space, Ricci commutation formula,
Berwald curvature and torsion tensors, Berwald deviation tensor, Bianchi identities,
Recurrent Finsler space, Symmetric Finsler space.
Projective change, projective deviation tensor, projective curvature and torsion tensors.
Cartan two processes of covariant differentiation, Cartan curvature and torsion tensors.

14/41
Books Recommended:

1. H. Rund, The Differential Geometry of Finsler Spaces, Springer-Verlag, Berlin,

1959.

2. M. Matsumoto, Foundations of Finsler Geometry and Special Finsler Spaces,

Kaisheisha Press, Otsu, 1986.

3. P. L. Antonelli (ed.), Handbook of Finsler Geometry, Kluwer Academic

Publishers, Dordrecht, the Netherlands, 2003.

Learning outcomes: After the completion of the course, students will be able to learn
some basic concepts of Finsler geometry. They may understand covariant
differentiation better.

Paper Code: AMPBTD3

FLUID MECHANICS
Course Aim: To introduce basic concepts of Fluid Mechanics.
Pre-requisite: Basic knowledge of Mathematics.
Introduction and Basic Principles, Properties of Fluids and Fluid Statics: Density, Bulk
Modulus, Viscosity, Newtonian fluid, Non-Newtonian fluids, Reynolds number, Rotational
and Irrotational flows, Compressible and Incompressible flows, Governing equation of fluid
statics, Fluid under rigid body motion.
Lagrangian and Eulerian descriptions, Concept of different flow lines, Acceleration of fluid
flow, Deformation of fluid elements, Derivation of continuity equation, Stream Function,
Circulation, Velocity Potential
Euler's equation, Euler’s equation in streamline coordinates, Bernoulli’s equation,
Application of Bernoulli’s equation, Kelvin’s theorem, Reynolds Transport Theorem (RTT),
Application of RTT: Conservation of mass, Conservation of linear momentum, Conservation
of angular momentum.
Vortex motion, Helmholtz’s vorticity equation, Vortex line and filament equation of surface
formed by streamlines and vortex lines in case of steady motion, Strength of a filament,
Velocity field and kinetic energy of a vortex system, Vortex pair, Vortex doublet, Images of a
vortex with regards to plane and a circular cylinder.
Navier-Stokes equation, Pipe Flow, Principle of Similarity and Dynamical Analysis,
Temperature distribution in Coutte flow and in flow past a flat plate. Mathematical
formulation of the stability problem of incompressible flow, Stability of flows under different
cases, Prandtl’s momentum transfer theory.

15/41
Text Books:
1. M.D. Raisinghania, Fluid Dynamics with complete Hydrodynamics and Boundary layer
Theory (Revised Edition) , S. Chand Publication.
2. F. Chorlton, Text Book of Fluid Dynamics, CBS Publication.
Reference Books:
1. L.M. Milne-Thomson, Theoretical Hydrodynamics, Dover Publications Inc.
2. Batechelor, G.K., An Introduction to Fluid Dynamics, Cambridge Press.
3. Drazin, P.G., Reid W. H., Hydrodynamic Stability, Cambridge Press
4. Arthur Stanley Ramsey, Hydrodynamics, G. Bell and Sons, Limited.
5. L.D. Landau and E.M. Lipschitz, Fluid mechanics, Pergamon Press.
Course Outcomes: Students will be able to apply different moment equations viz., equation
of continuity, equation of motion and equation of pressure to discuss any problem of gas
dynamics.

Paper Code: AMPBTD4

Mathematical Methods of Applied Mathematics
Course Aim: The aim of this course is to get the insights of methods of applied mathematics.
Pre-requisite: Basic knowledge of differential equations is required.
Green’s Function, Green’s function for Laplace equation, The methods of Image, The Eigen
function method, Green’s Function for Wave Equation-Helmholtz theorem, Green’s Function
for Diffusion Equation.
Laplace transform methods, Transform of various functions, Complex Inversion Formula,
Solution of Ordinary differential Equations, Solution of Partial Differential Equations, Solution
of Diffusion Equation, Solution of Wave Equation.
Fourier Transform Methods, Transform of various functions, Multiple Fourier Transform,
Solution of Diffusion Equation, Solution of Wave Equation and Solution of Laplace Equation.
Z – Transform and its Applications.
Text Book:
1. Rao, K.S., Introduction to Partial Differential Equations, PHI Learning, Private Limited,
New Delhi, INDIA (2011).
Reference Books:
1. Jain, M.K., Iyenger, S. R. K and Jain, R.K., Computational Methods for Partial
Differential Equations, Wiley Eastern, (1994).
2. Evans, L.C., Partial Differential Equations, Graduate Studies in Mathematics, Vol. 19,
AMS (1999).
3. B.S. Grewal., Higher Engineering Mathematics, Khanna Publishers.

16/41
 Course Outcomes: After the completion of this course, students will have the knowledge
about mathematical concept of the methods of applied mathematics.

Paper Code: AMPBTD5

Mathematical Statistics

Prepared later

Paper Code: AMPBTD6

RIEMANNIAN MANIFOLDS AND CONNECTIONS
Course Aim: Base of the development of Differential Geometry during the 18th century and
the 19th century is the theory of plane and space curves and surfaces in the three
dimensional Euclidean space. Aim of the course Differential Geometry is to study the
problems in geometry using the techniques of differential calculus, integral calculus and
linear algebra. Since the late 19th century, differential geometry has grown into a field
concerned more generally with the geometric structures on differentiable manifolds.
Differential geometry is closely related to differential topology and the geometric aspects
of the theory of differential equations.
Pre-requisite: Basic concepts of Riemannian Manifolds and Connections are required for
this course.
Linear Connection: Affine connections, Torsion tensor of affine connection, Curvature tensor
of affine connection and related problems.
Riemannian Manifold Riemannian Connection: Definition and examples of Riemannian
Metric, Riemannian Connection and Riemannian Manifolds, Fundamental theorem of
Riemannian Geometry, Koszul’s formula, First and Second Bianchi’s identities, Ricci identity.
Curvatures in Riemannian Manifolds: Riemannian Curvature, Ricci curvature, scalar
curvature, Sectional curvature, Gaussian Curvature, Schur’s theorem, Projective curvature
tensor, conformal curvature tensor, Conhormonic Curvature tensor, Concircular Curvature
tensor.
Connections on Riemannian Manifolds: Gradient vector fields, Semi- symmetric metric
connection and related theorems, Jacobi Fields. Complete manifolds, Vector fields, all space
forms, Theorem of Cartan on the determination of the metric by means of the
curvature. Fundamental equations for Riemannian submanifolds, conformal killing.
Transformations on Riemannian Manifolds: Conformal transformation, Conformal killing
vector field, Locally symmetric Riemannian manifold, Recurrent Reimanian manifold, Ricci
17/41
recurrent Reimanian manifold, Ricci-semi- symmetric Reimanian manifold and related
theorems.
Text Book:

1. U. C. De and A. A. Shaikh, Differential Geometry of Manifolds, Narosa Publishing

House , New Delhi, 2007.
Reference Books:

1. S.S. Chern, W.H. Chen and K.S. Lam, Lectures on Differential Geometry, World
Scientific, 2000.
2. MP do Carmo, Riemannian geometry, Birkhauser, 1992.
3. N. J. Hicks, Notes on Differential Geometry, Von Nostrand, 1965.
4. P. Petersen, Riemannian geometry, Springer 2006.
5. J. Jost, Riemannian geometry and Geometric Analysis (6ed. Springer, 2011).
Course outcomes: In the sense of outcomes of the course Differential geometry students
have learnt how Differential Geometry involved in the study of curves and surfaces in three
dimensional Euclidean spaces. Also they are able to define surfaces and their properties,
Tangent spaces; Singularities on a surface, first fundamental form Second fundamental form,
Gauss and Weingarten equations, Normal Curvature. Differential Geometry has rich
applications in Theory of Relativity and Cosmology.

Paper Code: AMPBTD7

FRACTIONAL CALCULUS AND INTEGRAL TRANSFORMS
Course Aim: The objective of the paper is to develop the basic concept of Fractional Calculus
with the special interest recurrence relations and integral transformations.
Pre-requisite: A basic concept of fractional calculus and integral transforms.
Hankel Transform: Introduction, Definition and formulae, some more integrals involving
exponential functions and Bessel’s function of first kind; Inversion formula and Parsival’s
theorem for Hankel transform. Hankel transform of the derivative of a function; Application
of Hankel transforms of boundary value problems. Finite Hankel transmission formation and
another form of Hankel transform.
Z-Transform: Introduction and basic operations on sequences of Z-transform; Properties and
theorems of Z-transform; Solution of difference equation, Multiplication by K and division by
K, Initial and final value problem; Partial sum. Convolution: Definition and property of casual
sequence. Inverse of Z-transform: Inverse of Z-transform by Binomial expansion, partial
fractions, residue method and convolution method.
Fractional Calculus: Introduction and historical background; Riemann-Liouville fractional
integrals of arbitrary order α and Riemann-Liouville fractional derivatives; Basic properties
and Illustrative Examples.

18/41
Laplace Transform: Laplace transforms of fractional integral, Laplace of fractional
derivatives; Laplace transform of Caputo derivatives and Illustrative examples.
Mellin Transforms: Definition and some elementary properties of Mellin transform. Mellin
transform of fractional integral and Mellin transform of fractional derivative and Illustrative
examples.
Text Books:
1. A M Mathai et al.,the H-function: Theory and applications; Springer Publication, New
York.
2. H. K. Dass and Er. Rajnish Verma; Higher Engineering Mathematics; S. Chand &
Company PVT. LTD. New Delhi (2014).
Reference Books:
1. Keith B. Oltham and Jerome Spanier; The fractional calculus: Theory and applications
of differentiation and integration to arbitrary order; Academic press new York and
London (1974).
2. A. R.Vasishtha and Dr. R. K. Gupta; Integral Transform; Krishna Prakashan Media (P)
Ltd. Meerut.
Course Outcomes: Students will be able to solve transformations, differential and integrals
equation of arbitrary order. This course will help to develop the extended mathematical
modeling of fractional order in Science and Engineering.

Research Methodology
Paper Code: AMPBTT3
Prepared later

19/41
 SEMESTER - 3
Paper Code: AMPCTT1

FUNCTIONAL ANALYSIS
Course Aim:The aim of this course is to put most of the concept from functional analysis
which is essential for PG students to enhance their knowledge in the field of analysis. The
topics include here are geometry of different spaces with their properties along with
fundamental theorems (like Normed linear space, Banach space, Inner product space,
Hilbert space), contraction mapping principle and its applications etc.

Pre-requisite:Basis concepts of Analysis, Metric Space.

Normed linear spaces, Banach spaces, Properties of Normed linear spaces, Finite dimensional
Normed linear spaces and subspaces, Compactness and finite dimension, Linear operators,
Bounded and continuous operators, Linear functional, Linear operators and functional on
finite dimensional spaces, Normed spaces of operators, Dual space.
Zorn’s Lemma, Hahn-Banach Theorem, Hahn-Banach Theorem for complex vector spaces
and Normed spaces, Applications to bounded linear functional on C[a, b], Ad-joint operator,
Reflexive spaces, Category theorem, Uniform boundedness theorem, Strong and weak
convergences, Convergences of sequences of operators and functional, Open Mapping
Theorem, Closed linear operators, Closed Graph Theorem.
Inner product space, Hilbert space, Properties of inner product spaces, Orthogonal
complements and direct sum, orthonormal sets and sequences, Series related to
orthonormal sequences and sets Total orthonormal sets and sequences, Bessel’s Inequality,
Representation of functional on Hilbert spaces, Hilbert ad-joint operator, Self-ad-joint,
Unitary and normal operators.
Contraction mapping principle and it’s applications to Linear Equations, Differential
Equations and Integral Equations.
Text Book:
2. Erwin Kreyszig, Introductory Functional Analysis with Applications, Wiley Classics
Publications.
Reference Books:
1. Balmohan V. Limaye, Functional Analysis, New Age International Publications.
2. G. Bachman and L. Narici, Functional Analysis, Dover Publications.
3. B. K. lahri, Elements of Functional Analysis, Calcutta World Press.
4. P. K. Jain and Om P. Ahuja, Functional Analysis, New Age International Publications.
Course Outcomes: Students will be able to understand after learning the course:

20/41
 ➢ To describe the concept of mathematics like Norms, Normed linear spaces, Banach
spaces, Inner product spaces, Hilbert spaces and their properties with elaborative
examples and some fundamental theorems.
➢ To identify variables controlling behaviour(s) and to generate hypotheses about its
function(s) because Functional analysis is a methodology for systematically
investigating relationships between problem behaviour and environmental events.
So that students can understand how researcher uses concept of functional analysis
to solve real world problems.
➢ To do research work on Contraction principles in different spaces.

Paper Code: AMPCTT2

THEORY OF ORDINARY DIFFERENTIAL EQUATIONS
Course Aim: The prime aim of this course is to develop the theoretical approach to deal
the problem of the differential equations.
Pre-requisite: Basic concepts of differential equations are required for this course.
Linear Equations with Constant Coefficients: Second order homogenous equation, Initial
Value Problem for Second Order Equation, Linear Dependence and Independence, A formula
for Wronskian, The Non-homogeneous Equation of Order Two, Homogeneous Equation of
Order n, Initial Value Problem for nth Order Equation, The Non-Homogeneous Equation of
Order n, A Special Method (Annihilator Method) for Solving the Non-homogeneous Equation.
Linear Equations with Variable Coefficients: Initial Value Problem for the Homogeneous
Equation, Solution of the Homogeneous Equation, The Wronskian and Linear Independence,
Reduction of the Order of a Homogeneous Equation, The Non-homogeneous Equation,
Homogeneous Equation with Analytic Coefficients, The Legendre Equation, Justification of
the Power Series Method.
Linear Equation with Regular Singular Point: The Euler Equation, Second Order Equation
with Regular Singular Point (Example with General Cases as well), A convergence Proof, The
Exceptional Cases, The Bessel Equation, Regular Singular Point at Infinity.
Existence and Uniqueness of Solutions: Equation with Variables Separated, Exact Equations,
The method of Successive Approximations, Lipchitz Condition, Convergence of the Successive
Approximations, Nonlocal Existence of Solution, Approximations to Solutions, Uniqueness of
Solutions, Existence and Uniqueness of Solutions of System, Existence and Uniqueness for
the Linear System.
Text Book:
1. Earl A. Coddington, An Introduction to Ordinary Differential Equations, Dover
Publications, INC, New York (1989).
Reference Books:

21/41
 1. S. G. Deo, V. Lakshmikantham and V. Raghavendra., Text book of Ordinary Differential
Equations, Second Edition, Tata McGraw-Hill Publishing Company Limited, New Delhi,
1997.
2. George F. Simmons, Differential Equations, Tata McGraw-Hill Publishing Company
Limited, New Delhi.
3. W.T. Reid, Ordinary Differential Equations, John Wiley & Sons, NY (1971).
4. Phillip Hartman, Ordinary Differential Equations, John Wiley & Sons, NY (1971).

Course Outcomes: After the completion of this course, students will have the clear insight
about the mathematical structure of the differential equations.

Paper Code: AMPCTD1

ALGEBRAIC TOPOLOGY
Course Aim:The proposed course is intended to stimulate the students to understand the
interconnection of topology and Geometry and its applications in other sublects.
Course Description: Topology is a less rigid variant of geometry that studies shapes of spaces.
Algebraic topology associates algebraic invariants, such as groups or rings, to such spaces.
This is achieved by building a space from simpler ones or by algebraically keeping track of
how to map a simple space into a given space. This course will cover • Metrization theorems,
• the fundamental group and covering spaces, • Retraction and Fixed points along with
fundamental group of surfaces. Learning Objectives: At the end of this course, you should be
able to • compute algebraic invariants associated to topological spaces and maps between
them, • prove topological results by using algebraic methods, and • apply methods from
algebraic topology to problems in a broader mathematical context.
Product Topology: Preliminaries from general Topology, Product Topology, Tychonoff
Theorem (Arbitrary Case).
Metrization Theorems and Para-compactness: Local Finiteness, Nagata-Smirnov
Metrization Theorem, Para-compactness, Para-compactness Housdorff Spaces.
Fundamental Group: Homotopy, Paths Homotopy, The fundamental groups, covering
spaces, Fundamental group of the circle, Lifting lemma.
Retraction and Fixed Points: Retraction, Brouwer fixed point theorem, Fundamental
theorem of Algebra, Borsuk-Ulam theorem.
Fundamental Group Of Surfaces:Projective plane, Theorems on projective plane and
fundamental group.
Text Book:
1. James R. Munkres, Topology, A First Course, Prentice Hall of India Pvt. Ltd., New
Delhi.
Reference Books:
1. J. L. Kelley, General Topology, Van Nostrand, Reinhold Co. New York.
2. J. Dugundji, Topology, Allyn and Bacon, 1966 (Reprinted in India by Prentice Hall of
22/41
 India Pvt. Ltd).
CourseOutcomes: After completion of this course, student will be able to:
➢ Understand the fundamental terms of topology.
➢ Understand the rigorous aspects of Homotopy, Fundamental group.
➢ Apply the concept of algebraic topology in the problems pertaining to topological
fixed points and its applications.

Paper Code: AMPCTD2

COMPLEX MANIFOLDS

Course Aim: A complex manifold is a manifold with an atlas of charts to the open unit
diskin, such that the transition maps are holomorphic. In this part of the course student will
study almost complex manifold, Almost Hermite manifold, Kaehler Manifolds, Nearly
Kaehler Manifolds and Para Kaehler Manifolds. This course is also motivated to the student
in research.
Pre-requisite: Basic Concepts of Complex Manifolds.
Complex Manifold and Almost complex manifold: Definition and example, Nijenhuis tensor,
Eigen Values of an almost complex structure, Existence theorem and integrability condition,
contravariant and covariant almost analytic vector fields.
Almost Hermite manifold: Nijenhuis tensor, Almost analytic vector fields, Curvature in almost
Hermite manifold, Holomorphic Sectional Curvature, Linear connection in an almost Hermite
manifold.
Kaehler Manifolds: Holomorphic Sectional Curvature, Bochner Curvature tensor, affine
connection in almost Kaehler manifold.
Nearly Kaehler Manifolds: Definition, Projective correspondence between two Nearly
Kaehler manifolds, Curvature identities.
Para Kaehler Manifolds: Definition, Curvature Identities and conformal flatness of
parakaehler manifold.
Text Book:

1. U. C. De and A. A. Shaikh, Complex and Contact Manifolds, Narosa Publishing House ,

New Delhi, 2009.
Recommended Books:

1. S. S. Chern, W.H. Chen and K.S. Lam, Lectures on Differential Geometry, World
Scientific, 2000.
2. E.J. Flaherty, Hermitian and Kahlerian Geometry in Relativity, LNP 46, Springer,
1976. 3. Y. Matsushima, Differentiable Manifolds, Dekker, 1972.
3. R. S. Mishra: A course in Tensor with applications to Riemannian geometry, Pothishala
(Pvt.) Ltd, Allahabad.

23/41
 4. B. B. Sinha: an Introduction to modern differential geometry, KalyaniPrakashan, New
Delhi, 1982.
5. K. Yano: Structure of Manifolds, World Scientific Publishing Co. Pvt. Ltd., 1984.
Course Outcomes: They are able to define Nijenhuis tensor, Eigen Values of an almost
complex structure, Existence theorem and integrability condition, contravariant and
covariant almost analytic vector fields, Holomorphic Sectional Curvature, Bochner Curvature
tensor and affine connection in almost Kaehler manifold. Also student learnt the problems
related to complex manifolds and motivated to do research in manifolds.

Paper Code: AMPCTD3

DIFFERENCE EQUATIONS
Course Aim: This course helps in understanding basic concepts of discrete calculus. It
develops the ability to solve difference equations by standard methods. It will help to
students to take up further studies in discrete dynamical systems and numerical modelling
problems.
Pre requisite: Elementary Numerical Analysis, Calculus.
Difference Calculus: The Difference Operator, Summation, Generating functions and
approximate summation.

Linear Difference Equations: First order equations, General result for linear equations,
Equation with Constant coefficients, Applications, Equations with variable coefficients,
nonlinear equations that can be linearized, the z-transform.

Stability Theory: Initial value problems for linear systems, Stability of linear systems, Stability
of nonlinear systems, chaotic behavior.

Asymptotic methods: Introduction .of Asymptotic, Analysis of sums, Linear equations,

Nonlinear Equations.

The self ad-joint second order linear equations- Strurmian theory, Green’s function,
Disconjugacy, The Riccati Equations and Oscillation.
Text Book:
1. W. G. Kelley and Allan C. Peterson- Difference Equations. An Introduction with
Applications. Academic Press Inc., Harcourt Brace Joranovich Publishers, 1991.
Reference Books:
1. S. Goldberg, Introduction to Difference equations, Wiley Publication.
2. V.Lakshmikantham and D.Trigiante, Theory of difference equations, Academic Press.
Course Outcomes: Learn to solve difference equations, Analyses the properties of solution
and learns about discrete models and their stability also that learns to apply asymptotic
methods.

24/41
 Paper Code: AMPCTD4

FUZZY SETS AND FUZZY LOGIC

Course Aim:The basic aim of this course is to introduce the student fuzzy logic and fuzzy
techniques. The aim is to achieve with the emphasis on learning theoretical aspects of fuzzy
set theory. At the end of the course, we will see various generalizations of fuzzy sets.
Pre-requisite: Basis concepts of set theory.
From Classical (Crisp) sets to fuzzy sets: A grand paradigm shift :Introduction, Crisp Sets: An
overview, Fuzzy sets: basic types, Fuzzy sets: Basic concepts, Characteristics and signification
of paradigm shifts
Fuzzy sets vs. Crisp sets :Additional properties of α- cuts, Representation of fuzzy sets,
Extension principal for fuzzy sets
Operation on fuzzy sets:Types of operations, Fuzzy complements, Fuzzy intersections: t-
Norms, Fuzzy unions: t-conorms, Combination of operations, Aggregation of operations

Fuzzy Arithmetic: Fuzzy numbers, Linguistic variables, Arithmetic operation on intervals,

Arithmetic operation on fuzzy numbers, Fuzzy equations.

Fuzzy Relations: Crisp vs. fuzzy relations, Projections and cylindric extensions, Binary fuzzy
relations, Binary relations on single sets, Fuzzy equivalent relations, Fuzzy compatibility
relations, Fuzzy ordering relations, Fuzzy morphisms, Sup-i compositions of fuzzy relations,
Inf-ωi composition of fuzzy relations

Fuzzy Relation Equations: General discussion, Problem partitioning, Solution methods, Fuzzy
relation equation based on sup-I compositions, Fuzzy relation equation based on Inf-ωi
compositions, Approximate solutions, the use of neural networks.

Various Generalizations of Fuzzy sets: Soft sets, Bipolar sets, Pythagorean fuzzy sets.

Text Book:
1. George J. Klir, Bo Yuan, Fuzzy sets and fuzzy logic Theory and Applications, PHI
Publications 2002.
Reference Books:
1. Zimmermann, H. J., Fuzzy set theory—and its applications. Springer Science &
Business Media (2011).
2. Garg, H., Pythagorean Fuzzy Sets- Theory and Applications. Springer, Singapore
(2021).
Course Outcomes: Students will be able to understand after learning the course:
➢ Need of techniques introduced under the course in using (logical) mathematical tools
available for cutting edge research in the area of his/her choice.
➢ Learn to deal with real world uncertainties especially of the fuzzy nature.

25/41
 ➢ Basic idea of set theory and basics of fuzzy sets. The significance of application of
fuzzy sets.
➢ Binary and unary operations, combinations of operations on fuzzy sets. Aggregation
operations.

Paper Code: AMPCTD5

INFORMATION THEORY AND ITS APPLICATIONS

Course Aim:The main concern of Information theory is to discover Mathematical laws
governing the system design to communicate or manipulate information. It sets of
quantitative measure of information of capacity of various systems to transmit, store and
process the information. Coding is the application of Information theory which will be
taught to the students in this paper.
Pre-requisite:Basic concepts ofinformation theory and its applications.
Concepts of Probability For Information Theory: Probability measure, frequency of events,
combinatorial problems in probability, random variables, discrete probability functions and
distributions, bivariate discrete distribution, binomial distribution, Poisson distribution,
expected value of random variable.
Communication System: Introduction, communication process, a model for communication
system, a quantitative measure of information, a binary unit of information.
Basic Concepts of Information Theory: A measure of uncertainty, intuitive justification,
formal requirement for the average uncertainties, H-function as a measure of uncertainty,
an alternative proof for the entropy function posses a maximum, sources and binary sources.
Measure of Information: Measure of Information for two dimensional discrete finite
probability schemes, conditional entropies, a sketch of communication networks, derivation
of noise characteristics of channels, some basic relationship among different entropies, a
measure of mutual information, set theory interpretation of Shannon’s fundamental
inequalities redundancy, efficiency and channel capacities.
Elements of Encoding: The purpose of encoding, separate binary codes, Shannon’s-Fano
encoding, necessary and condition for noiseless coding, a theorem on decidability, average
length of encoded messages, fundamental theorem of discrete noiseless coding.
Text Book:
1. F.M. Reza, An introduction to information theory, Dover Publications Inc. New
York.
Reference Books:
1. Robert B. Ash, Information Theory , Inter-science Publisher, New York
2. John R. Pierce, An Introduction to Information Theory, Dower Publications Inc.
New York.
3. John Avery, Information theory and evolution, World Scientific, New Jersey.

26/41
Course Outcomes: After successful completion of this paper the students will be able to
explain the concepts of entropy and mutual information. The students will also be able to
understand the concept of information theory and its usefulness in various fields such as in
defence, in portfolio selection, in general election, in computer science, in pattern
recognition and in image processing.

Paper Code: AMPCTD6

INTEGRAL EQUATIONS
Course Aim: The objective of the paper is to develop the basic concept of Integral equations,
boundary value problems and initial value problems with the special interest Green’s
function.
Pre-requisite: Basic concepts of Integral Equations.
Basic concept of integral equation: Classification of integral equations; Leibnitz’s rule of
differentiation under the sign of integration; Transformation of differential equation into
integral equation and vice-versa, Illustrative examples.
Conversion of ODE’s into integral equations: Initial value problems, method of converting
an initial value problem into a Volterra integral equation; Alternative method of converting
an initial value problem into a Volterra integral equation; BVP and method of converting BVP
into a Fredholm integral equation.
Fredholm Integral Equations: Method of successive approximation: Orthogonal kernels,
Iterated kernels; Fredholm determinants, Degenerated kernels; Eigen value and Eigen
function of homogeneous integral equation.
Volterra Integral Equations: Resolvent kernel; Method of successive approximation; Volterra
integral equation of first kind and solution of non-linear Volterra integral equation.
Applications of Integral Equations and Green’s function to ODE: Green’s function:
Conversion of a BVP into Fredholm Integral Equations solution of BVP; Green’s function
approach for converting an IVP into an integral equation and modified Green’s function.

Text Books:
1. M D Raisinghania, Integral Equations and boundary value Problems; S. Chand and
Company PVT. LTD, New Delhi.
2. A BChandramouli, Integral Equations with boundary value problems, Shree
ShikshaSahityaPrakashan, Meerut.
Reference Books:
1. Abdul-MajidWazwaz, A first course in Integral Equations, World Scientific Publishing
Co. Pvt. Ltd.
2. M. Rahman, Integral Equations and their applications WIT press, Boston.

27/41
 3. Ram P. Kanwal, Linear Integral Equations, Theory and Technique, Academic Press,
New York.
4. A. D.Polyanin and A V Manzhirov, Handbook of Integral Equations CRC Press, Boca
Raton/ London/ New York/Washington D C.
Course Outcomes: Students will be able to solve Fredholm and Volterra integrals equation
of boundary value problems, initial value problems and Green’s function. This course will
help to develop the extended mathematical modeling of fractional calculus in Science and
Engineering.

Paper Code: AMPCTD7

MULTIPOINT ITERATIVE METHODS
Course Aim: Numerical methods helps in solving real life problems in different filed of
science engineering where either direct solution not exist or computationally costly. This
module aims to introduce students to use numerical methods and techniques for effective
numerical solution along with convergence and errors idea and applications that are used
in solving real life problems.
Pre-requisite: Basic concepts of Multipoint Iterative Methods.
Classification of iterative methods, order of convergence, computational order of
convergence (COC), R-order of convergence, computational efficiency of iterative methods,
initial approximations, one-point iterative methods for simple zeros, methods for
determining multiple zeros, stopping criteria,
Cubically convergent two-point methods: multipoint-point without memory IM, Traub’s two-
point methods, Two-point methods generated by derivative Estimation,
Ostrowski’s fourth-order method and its Generalizations, Family of optimal two-point
methods, Optimal derivative free two-point methods, Optimal two-point methods of
Jarratt’s Type,
Multipoint methods with memory: Early works, Self-accelerating Steffensen-like method,
Self-accelerating secant method, Multipoint methods with memory constructed by inverse
interpolation, Generalized multipoint root-solvers with memory, Derivative free families
with memory.
Non-optimal two-point methods for multiple Zeros, optimal Two-point methods for multiple
roots, multipoint-point method for nonlinear systems,
Text Book:
1. M. S. Petkovic, B. Neta, L.D. Petkovic, J. Dzunic (2013): Multipoint iterative
methods for solving nonlinear equations, Elsevier, MA, USA.
References Books:
1. J. F. Traub (1982): Multipoint iterative methods for solution of equations, Chelsea
Publishing Company, NY, USA.
28/41
 2. C. T. Kalley (1995): Iterative methods for linear and nonlinear equations, SIAM,
Philadelphia.
Course Outcomes: Upon completion of the course, the students will be able to:
➢ Know the classifications of iterative methods (IMs) and important related concepts.
➢ Cubically convergence iterative methods (IMs).
➢ Optimal two-steps iterative methods (IMs).
➢ Two-steps with memory iterative methods (IMs).
➢ Two-steps iterative methods (IMs) for multiple roots.

Paper Code: AMPCTD8

FUNDAMENTALS OF ELASTICITY
Course Aim: The main aim of this course is to give the basic idea about the elasticity.
Pre-requisite: Any Mathematics Graduate students can learn this course.
Analysis of Strain: Extension, Pure shear, Simple shear, Homogeneous strain, Component of
strain, Strain quadric, Transformation of the components of strain, Types of strain, Identical
relation between components of strain, Curvilinear orthogonal coordinates, Components of
strain referred to curvilinear orthogonal coordinates, Dilatation and rotation referred to
curvilinear orthogonal curvilinear orthogonal coordinates, Cylindrical and polar coordinates.
Analysis of Stress: Traction across a plane at a point, Surface traction and body forces,
Equation of motion, Equilibrium, Specification of stress at a point, Measure of stress,
Transformation of stress components, Stress quadric, Types of stress, Stress equation of
motion and of equilibrium, Uniform stress and uniformly varying stress, Stress equation
referred to curvilinear orthogonal coordinates.
The elasticity of solid body: Work and energy, Hook’s law, Methods of determining the stress
in a body, Elastic constants and modules of isotropic solids, Modulus’s of elasticity, Initial
stress.
The Relation Between the Mathematical Theory of Elasticity and Technical Mechanics:
Limitation of the mathematical theory, stress-strain diagrams, Elastic limits, Saint-Venant’s
principle, Equation of Equilibrium in Terms of Displacements, Equilibrium Under Surface
Traction Only, Various Methods and Results, Plane Strain and Plain Stress,
The Propagation of Waves in Elastic Solid Media: Waves of dilatation and waves of
distortion, Motion of a surface of a continuity, Velocity of waves in isotropic medium,
Velocity of waves in Allotropic solid medium, wave surfaces, Motion due to body forces,
Waves propagated over the surface of an isotropic elastic solid body.
Text Book:
1. A.E.H. Love, A Treatise on the Mathematical Theory of Elasticity, Cambridge
University Press (1906).

29/41
Reference Books:
1. Laurwerier, H.A and Koiter, W.T., Applied Mathematics and Mechanics, North-
Holland Publishing Company - Amsterdam, London (1973).
2. Pujol, Jose, Elastic Wave Propagation and Generation in Seismology, Cambridge
University Press (2003).
3. Sokolnikoff, I.S., Mathematical Theory of Elasticity, McGraw Hill Book Co., New-York
(1956).
4. Kazimi, SMA, Solid Mechanics, McGraw Hill Education (India) Pvt. Ltd., (2013).
Course Outcomes: The students can deal the basic problem of elasticity after the completion
of this course.

Paper Code: AMPCPF1

Project Phase-1
Note: Under the guidance of faculty member(s) on the topic relevant to the Master’s Degree
Course.

30/41
 SEMESTER - 4
Paper Code: AMPDTT1

COMPLEX ANALYSIS
Course Aim:The course aims to introduce the theory of complex analysis to graduate
students with applications to solve problems in the mathematical sciences and engineering.
Pre-requisite: Brief discussion of Complex analysis.

Brief review of analytic function, Cauchy’s estimates, Poisson integral formula, Cauchy
Hadamard theorem, Complex power series, power series, radius of convergence of power
series,
Uniform convergence, general principle of uniform convergence of a sequence, uniform
convergence of series, Weirstrass M-test, continuity of sum function, term by term
integration, analyticity of sum function, term by term differentiation.
Uniqueness of Laurent series, Singularities, isolated singularities, poles and essential
singularities, removable singularities, Riemann’s theorem, Casorati-Weirstrass theorem,
argument theorem, Rouches’s theorem.
Holomorphic functions and their properties, maximum modulus theorem, zeros of analytic
functions, analytic continuation,
Cauchy residue theorem and its applications, evaluation of standard types of integrals by the
residue calculus method,
Conformal mapping, Mobius transformation, critical points, fixed points, cross-ratio,
harmonic conjugates, transformation of harmonic functions, Schwarz lemma, open mapping
theorem.
Text Book:
1. M. R. Spiegel, Seymour Lipschutz, John J. Schiller and Dennis Spellman: Complex
Variables with an introduction to conformal mapping and its applications, Second
Edition, Schaum’s Outline Series, Mc Graw Hill, New York (2009).
Reference Books:
2. J. W. Brown and R. V. Churchill: Complex variables and applications, McGraw Hill
Education (India) Pvt. Ltd., New Delhi, reprint (2016).
3. S. Ponnusamy: Foundations of Complex Analysis, Narosa Publishing House Pvt. Ltd.,
India second reprint (2008).
4. S. Lang: Complex Analysis, Springer-Verlag New York, 4th edition (1999).

Course Outcomes:Upon the completion of this course, the students will be able to:
➢ Inspect the analyticity of complex functions including the utility of Cauchy-Riemann
equations, evaluation of contour integrals using Cauchy integral formula.

31/41
 ➢ Represent complex functions as power series and their convergence, classification of
singularities.
➢ Apply residue calculus using Cauchy’s residue theorem and method of analytic
continuation.
➢ Have knowledge of conformal maps.

Paper Code: AMPDTT2

THOERY OF PARTIAL DIFFERENTIAL EQUATIONS

Course Aim:To Provide the mathematical Structure of the Partial differential Equations.
Pre-requisite:Ordinary Differential Equations, Multivariate Calculus.
Cauchy Problem for First Order Equation, Cauchy’s Method of Characteristics, Compatible
System of First Order Equation, Charpit’s Method, Jacobi’s Method
Characteristics Curve of Second Order Equation, Solution of Linear Hyperbolic Equation,
Separation of Variables, Nonlinear Equation of the Second Order
Occurrence of the Laplace Equation, Family of Equipotential Surface, Boundary Value
Problem and its Solution by Separation of Variable, The theory of Green’s Function for
Laplace Equation, Mixed Boundary Value Problem.
Occurrence of the Wave Equation, Elementary Solution of the one Dimensional Wave
Equation, Three Dimensional Problem, Green Function for the Wave Equation.
The Diffusion Equation, Duhamel’s Theorem, Solution of Diffusion Equation, The use of
Integral Transform and The use of Green Function.
Text Book:
1. Ian N. Sneddon, Elements of Partial Differential Equations, Dover Publications, (2006).
Reference Books:
1. Lawrence C. Evans,Partial Differential Equations, Graduate Studies in Mathematics,
American Mathematical Society (1998).
2. Phoolan Prasad and Renuka Ravindran, Partial Differential Equations, New Age
International Publishers, (2011).
3. Rao, K.S., Introduction to Partial Differential Equations, PHI Learning, Private Limited,
New Delhi, INDIA (2011).
Course Outcomes: Students will be able to solve the real-world problems.

32/41
 Paper Code: AMPDTD1

ADVANCED DIFFERENTIAL EQUATIONS

Course Aim: This course is designed to consider application in differential equations. This
course explains methods of solving boundary value problems, comparison of oscillations of
second order equations, studying stability concept in linear and nonlinear systems,
deviating arguments.

Pre requisite: Theory of Differential Equations, Calculus.

Existence and Uniqueness of Solutions: Preliminaries successive approximations – Picard’s
iteration method with some examples – Continuation of solution of IVP and dependence on
initial conditions, – Fixed point method.
Boundary value problems: Introduction Boundary value problems, Sturm – Liouville Problem
– Green’s function –Application of Boundary Value Problem – Picard’s theorem.
Oscillations of second order equations: Fundamental results - Sturm’s Comparison
theorem - Elementary linear oscillations - Comparison theorem of Hille – Wintner -
oscillations of x’’+ a (t) x =0.
Stability of linear and nonlinear systems: Elementary critical points – system of equations
with constant coefficients – Linear equation with constant coefficients – Lyapunov stability
– stability of quasi linear systems – second order linear differential equations.
Equations with deviating arguments: Equations with constant delay – Equations with
piecewise constant delay – a few other types of delay equations.
Text Book:
1. S.G. Deo, V. Lakshmikantham and V. Raghavendra: Text book of ordinary Differential
Equations, Second Edition, Tata McGraw-Hill Publishing Company Limited, New Delhi,
1997.
Reference Books:
1. George F. Simmons, Differential Equations, Tata McGraw-Hill Publishing Company
Limited, New Delhi.
2. W.T.Reid, Ordinary Differential Equations, John Wiley & Sons, NY (1971).
3. Phillip Hartman, Ordinary Differential Equations, John Willy &Sons, NY (1971).
4. E.A. Coddington& N. Levinson, Theorem of Ordinary Differential Equations, Mac,
Graw Hill, NY (1955).

Course Outcomes: The students will be able to understand various types of boundary value
problems, their solutions, and fundamental concepts about their existence and also
understood the concept of oscillations of second order equations with using various results;
the student will be able to understand stability of linear and nonlinear system.

33/41
 Paper Code: AMPDTD2

Advanced Functional Analysis

Objective:

After the Functional Analysis course in the previous semester student will be in a position to
know more about the Applications of Functional in Differential Equations, Integral Equations,
Operator Theory, Spectral Theory, Convex Programming.

Inner product spaces. Hilbert spaces. Orthonormal sets. Bessels inequality. Structure of
Hilbert spaces. Projection theorem. Adjoint of an operator on a Hilbert space. Reflexivity of
Hilbert spaces. Self adjoint operator, positive projection, normal and unitary operators.
Convex Sets and Projections, Orthogonality and Orthonormal Bases, Continuous Linear
Functionals, Riesz Representation Theorem, Weak Convergence, Nonlinear Functionals and
Generalized Curves, The Hahn-Banach Theorem.
Support Functional of a Convex Set, Minkowski Functinoals, The Support Mapping Theorem,
Separation Theorem, Applications to Convex Programming, Generalization to Infinite
Dimensional Inequality, The Fundamental Result of Game Theory: Minimax Theorem,
Application: Theorem of Farkas.

Linear Operators and their adjoints, Spectral theory of Operators, Spectral theory of compact
operators, Operators on separable Hilbert spaces.
Text Book:
1. G. F. Simmons, Introduction to Topology and Modern Analysis, McGraw-Hill Book
Company, 1963.
2. Alampallam V. Balakrishnan, Applied Functional Analysis (Applications of
Mathematics), Springer, 2nd edition (May 4, 1981), ISBN-10: 0387905278.

Expected Out-Come:

After this course student may understand the basic properties of Convex Programing and
fundamental result of Game Theory. Also they are in a position to learn the applications of
linear operators and their applications. This course will be helpful for them in joining research
in Nonlinear Functional Analysis.

34/41
 Paper Code: AMPDTD3

APPLICATIONS OF FUZZY LOGIC

Course Aim: The basic aim this course is introducing the student the application of fuzzy
techniques in decision making. Another aim is to study fuzzy system and approximation
reasoning. Over all we will emphasis on applied aspects of fuzzy logic.
Pre-requisite: Basis concepts of Fuzzy set theory.
1. Fuzzy Logic
Classical logic: An overview, multivalued logics, Fuzzy propositions, Fuzzy quantifiers,
Linguistic hedges

2. Constructing Fuzzy Sets and Operation on Fuzzy Sets

General discussion, Methods of construction: An overview, Direct methods with one
expert, Direct method with multiple experts, Indirect methods with one expert,
Indirect methods with multiple experts, Construction from sample data

3. Approximate Reasoning
Fuzzy expert system: an overview, Fuzzy implications, Selection of fuzzy implications,
Multi conditional approximate reasoning, the role of fuzzy relation Equations,
Interval-valued approximate reasoning.

4. Fuzzy Systems
General discussion, Fuzzy controllers: An overview, Fuzzy controllers: An Example,
Fuzzy systems and neural networks, Fuzzy neural networks, Fuzzy automata, Fuzzy
dynamic systems.

5. Fuzzy decision making

General discussion, Individual decision making, multi-person decision making,
Multicriterial decision making, Multistage decision making, Fuzzy ranking methods,
Fuzzy linear programming.

6. Miscellaneous Applications
Introduction, Medicine, Economics, Fuzzy systems and genetic algorithm, Fuzzy
regressions, Interpersonal communications, other applications
Text Book:
3. George J. Klir, Bo Yuan, Fuzzy sets and fuzzy logic Theory and Applications, PHI
Publications 2002.
Reference Books:
1. Zimmermann, H. J., Fuzzy set theory—and its applications. Springer Science &
Business Media (2011).
2. Garg, H., Pythagorean Fuzzy Sets- Theory and Applications. Springer, Singapore
(2021).
35/41
Course Outcomes:Students will be able to understand after learning the course:
➢ Use of fuzzy logic for decision making under real world scenario which is mostly fuzzy.
➢ Basic idea of set theory and basics of fuzzy sets. The significance of application of
fuzzy sets.
➢ Basics of fuzzy controller, idea of fuzzification and defuzzification. Study of fuzzy
controllers by mean of examples, Individual and Multiple decision making,
Multicriteria and Multistage decision making.

Paper Code: AMPDTD4

RINGS AND CATEGORIES OF MODULES
Course Aim: To inculcate the basic features of Rings and Categories of Modules, to teach
categories of modules, endomorphism rings, decomposition of rings, to introduce dualities.
Pre-requisite: Brief discussion of ring and categories of modules.
Rings, Modules and Homeomorphisms: Review of Rings and their Homomorphism’s,
Modules and Sub-modules, Homomorphism’s of Modules, Categories of Modules,
Endomorphism Rings
Direct Sums and Products: Direct Summands, Direct Sums and Products of Modules,
Decomposition of Rings, Generating and Cogenerating
Functors between Module Categories: The Hom Functors and Exactness- Projectivity and
Injectivity, Projective Modules and Generators, Injective Modules and Cogenerators, the
Tensor Functors and Flat Modules, Natural Transformations
Equivalence and Duality for Module Categories: Equivalent Rings, the Morita
Characterizations of Equivalence, Dualities, Morita Dualities.
Injective Modules, Projective Modules, and Their Decompositions: Injective Modules and
Noetherian Rings-The Faith- Walker Theorems. Direct Sums of Countably Generated
Modules-With Local Endomorphism Rings, Semi perfect Rings, Perfect Rings and Modules
with Perfect Endomorphism Rings
Text Books:
1. P.B. Bhattacharya, S.K. Jain and S.R. Nagpaul, Basic Abstract Algebra, Cambridge
University Press.
2. M. Artin, Algebra, Prentice Hall of India, 1991.
Reference Book:
Frank W. Anderson Kent R. Fuller, Rings and Categories of Modules, Springer-Verlag, New
York.

Course Outcomes: After completion of this course the students will be able to understand
the Categories of Modules, Endomorphism Rings, Generating and Cogenerating, The Tensor
Functors and Flat Modules, Natural Transformations.
36/41
 Paper Code: AMPDTD5

CRYPTOGRAPHY
Course Aim: Students undergoing this course are expected to learn fundamentals of
cryptography and its application to network security, to learn about how to maintain the
Confidentiality, Integrity and Availability of a data.
Pre-requisite: Basic concepts of Cryptography.
Unit I:
Introduction to cryptography: Basic Cryptography Concepts, Monoalphabetic and
Polyalphabetic cipher, The Shift Cipher, The Substitution Cipher, The Affine Cipher, The
Vigenere Cipher, The Hill Cipher, The Permutation Cipher, Cryptanalysis, Some Cryptanalytic
Attacks, Stream & Block ciphers, Mode of operations in block and stream cipher.
Unit II:
Shannon's Theory of Perfect Secrecy: Perfect Secrecy, Birthday Paradox, Vernam One Time
Pad, Random Numbers, Pseudorandom Numbers.
DES & AES: The Data Encryption Standard (DES), Feistel Ciphers, Description of DES, Security
analysis of DES, Differential & Linear Cryptanalysis of DES, Triple DES, The Advanced
Encryption Standard (AES), Description of AES, analysis of AES.
Prime Number Generation: Trial Division, Fermat Test, Carmichael Numbers, Miller Rabin
Test, Random Primes.
Unit III:
Public Key Cryptography: Principle of Public Key Cryptography, RSA Cryptosystem, Factoring
problem, Cryptanalysis of RSA, RSA-OAEP, Rabin Cryptosystem, Security of Rabin
Cryptosystem, Quadratic Residue Problem, Diffie-Hellman (DH) Key Exchange Protocol,
Discrete Logarithm Problem (DLP), ElGamal Cryptosystem, ElGamal& DH, Algorithms for DLP,
Elliptic Curve, Elliptic Curve Cryptosystem (ECC), Elliptic Curve Discrete Logarithm Problem
(ECDLP).
Unit IV:
Cryptographic Hash Functions: Hash and Compression Functions, Security of Hash Functions,
Iterated Hash Functions, SHA-1, Others Hash Functions, Message Authentication Codes.
Digital Signatures: Security Requirements for Signature Schemes, Signature and Hash
Functions, RSA Signature, ElGamal Signature, Digital Signature Algorithm (DSA), ECDSA, Fail
Stop Signature, Undeniable Signature, Blind Signature, Proxy Signature, Group Signature.
Unit V:
Identification and Authentication: Passwords, One Time Passwords, Challenge-Response
Identification, Zero-Knowledge Proofs, The Schnorr Identification Scheme, The Okamoto
Identification Scheme, Identity-based Identification Schemes.
Secret Sharing: The Principle, Shamir Secret Sharing Protocol.

Text Books:

37/41
 1. Wenbo Mao, Modern Cryptography: Theory and Practice. Pearsion Education, 2004
2. J Buchmann, Introduction to Cryptography, Springer (India) 2004.
3. Bruce Schenier, Applied cryptography, John Wiley & Sons, 1996.B. Forouzan,
Cryptography and Network security, Tata McGraw Hill, 2011.
Reference Books:
1. D. R. Stinson, Cryptography: Theory and Practice. CRC Press, 2000.
2. W. Starling, Cryptography and Network security, Pearson Education, 2004.
Course Outcomes: Upon the successful completion of the course, students will be able to:
➢ Understand various Cryptographic Techniques.
➢ Apply various public key cryptography techniques.
➢ Implement Hashing and Digital Signature techniques.
➢ Understand the various Security Applications.
➢ Implement system level security applications.

Paper Code: AMPDTD6

FINANCIAL MATHEMATICS AND ITS APPLICATIONS

Course Aim: The aim of this paper is to study various types of financial instruments and
their applications in various fields. The Mathematical concepts of Black-Scholes formula
and option Greeks for option pricing will be explained.
Pre-requisite: Basicconcepts offinancial mathematics and its applications.
Financial Derivatives: Meaning of financial derivatives, Types of financial derivatives –
Forwards and futures, Advantages and disadvantages of forward and future contracts,
Features of future contracts. Hedging using futures, Difference between forward and future
contracts.
Technical analysis: Meaning of technical analysis, basic principal of technical analysis, bullish
trend, bearish trend, support and resistance.
Mathematical Indicators: Moving averages, simple moving averages and exponential moving
averages.
Options: Definition of option, types of options, call option and put option. Long call, long put,
short call, short put, purpose of options, profit and pay of curve, open interest, change in
open interest, volume, put call ratio based on open interest and volume, Volatility and
implied volatility, Swaps.
Pricing contract via arbitrage: Explanation of option pricing and arbitrage with examples, the
Arbitrage Theorem, proof of the Arbitrage Theorem, The multi-period binomial model.
The Black-Scholes Formula: Proof of Black-Scholes formula, properties of Black-Schole’s
option formula, the delta hedging arbitrage strategy.

38/41
Option Greeks: Delta, gamma, Vega, theta and rho, Mathematical and theoretical
explanation of option Greeks.
Text Books:
1. John C Hall, Options, features and other derivatives, Prentice- Hall of India Private
Limited.
2. Sheldon M Ross, An introduction to Mathematical Finance, Cambridge University
Press.
Reference Books:
1 Sahil N. Nettci and Ali Hirsa, An introduction to Mathematics of financial derivatives,
Academic Press Inc
2 Robert J Elliot and P. ekkehard Kopp, Mathematics of financial markets, Springer-
verlag New YarkInc
3 S. Kevin, Security analysis and portfolio management, PHI learning Private limited.
4 Redhead, Keith, 1998, Financial Derivatives- An Introduction to Futures, Forwards,
Options and Swaps, PHI New Delhi.
Course Outcomes: After successful completion of this paper the students will be able to
understand about the financial derivatives, technical analysis, Mathematical indicators and
option Greeks used in option pricing of securities.

Paper Code: AMPDTD7

Mathematical Ecology

Paper Code: AMPDTD8

OPERATIONS RESEARCH
Course Aim: Operations research helps in solving problems in different environments that
needs decisions. This module aims to introduce students to use quantitative methods and
techniques for effective decisions–making; model formulation and applications that are
used in solving business decision problems.
Pre-requisite: Basic concepts of Operations Research.
Operation research: Origin and development of O.R., Nature and future of O.R., scientific
method in O.R., Modelling in operation research, advantages and limitations of models,
general solution methods for OR models, methodology of operation research, operation
research and decision – making, applications of operational research.
Brief Review of LPP, simplex method, duality, Integer Programming:Introduction, Pureand
mixed integer problems, Gomory’s All I.P.P.method, construction of Gomory’s constants,
fractional cut method All I.P.P. , fraction cut method -mixed integer linear programming
problem, Branch and bound method, applications of integer programming.
CPM/PERT: Basic definitions, activity, fullkerson’srule, event numbering, critical path, critical
39/41
path method, forward and backward pass computation, network diagram, PERT.
Queuing theory:Queuing system, elements of a Queuing system, operating characteristics of
aQueueing system, deterministic Queueing system, probability distributions in Queueing
system, classification of Queueing models, definition of transient and steady states, Poisson
Queueing systems, non-Poisson Queueing systems, cost models in Queueing, other
Queueing models.
Dynamic programming problem:introduction, the recursive equation approach,
characteristicsof dynamic programming, dynamic programming algorithm, solution of DPP,
some applications, solution of LPP by dynamic programming.
Non-Linear Programming: Introduction, formulating a Non-linear programming problem
(NLPP),general NLPP, constraint optimization with equality constraints, constraint
optimization with inequality constraints.
Text Book:
1. KantiSwarup, P. K. Gupta and Man Mohan, Operations Research, Sultan Chand &
Sons, New Delhi.
Reference Books:
1. G. Hadley, Linear Programming, Narosa Publishing House, 1995.
2. G. Hadley, Nonlinear and Dynamic Programming, Addison –Wesley, Reading Mass.
3. H. A. Taha, Operation Research- An Introduction, Macmillan Publishing Co. Inc.,
New York.
4. S. D. Sharma, Operation Research, S. Chand Publ. New Delhi.
Course Outcomes: Upon completion of this course, the student will be able to:
➢ Formulate and solve some real life problems where integer optimal value is
desirable.
➢ Aware about CPM/PERT techniques.
➢ Find optimal solution of dynamic programming problem.
➢ To solve two person zero sum game.
➢ Solve unconstrained and constrained nonlinear programming problems.

Paper Code: AMPDTD9

Theory of Relativity

Paper Code: AMPDTD10

FUNDAMENTALS OF THEORETICAL SEISMOLOGY

Course Aim: To provide the mathematical aspects of the Seismic waves Propagation.
Pre-requisite: Basic Knowledge of Elasticity.

40/41
Basic Relations of Continuum Mechanics, Stress-Strain relation, Strain Energy function,
Green’s Function, Seismic Wave, Classification of Seismic Waves, Seismic Source, Equation of
Motion-3D Problem, Equation of motion in the time and frequency domains, Wave
Potentials, Separation of the Equation of Motion, Plane Wave, Harmonic Plane Waves,
Spherical Waves, Reflection and Transmission of Plane Waves at a plane Interface, Love
Waves in a layered half-space, Love Waves in a layer over half-space, Seismic Response. The
Ray Method, The Ray Series in the Frequency domain, The Ray Series in the Time Domain,
The Basic System of the Equations of the Ray Method, Ray and Ray Field, Transport Equation,
Solution of Transport Equations.
Text Book:
Peter Moczo, Introduction to Theoretical Seismology, Lecture Notes.,
http://www.fyzikazeme.sk/mainpage/stud_mat/Introduction_to_Theoretical_Seismology.p
df
Reference Books:
1. Shearer, P.M., Introduction to Seismology, Cambridge University Press (2012).
2. Ewing, W.M., Elastic Waves in Layered Media, McGraw-Hill Inc., US (2018).
3. Pujol, Jose, Elastic Wave Propagation and Generation in Seismology, Cambridge
University Press (2003).
Learning Outcomes: After completing this course, Students will have the Basic mathematical
Knowledge of the Seismic Wave Propagation.

Paper Code: AMPDPF1

Project Phase-2
Note: Under the guidance of faculty member(s) on the topic relevant to the Master’s Degree
Course.

41/41