DR.

RAMMANOHAR LOHIA AVADH UNIVERSITY, AYODHYA

Structure of Syllabus for the

Program: M.A./M.Sc., Subject: MATHEMATICS
Structure of Syllabus Developed by
Name of BoS Convener/
Designation Department College/University
BoS Member
Professor & K.S. Saket P.G.
Mathematics
Prof. Shiv Kumar Tiwari Convener College, Ayodhya
Professor &
Mathematics B.H.U., Varanasi
Prof. Arvind Kumar Misra Expert
Professor & Shri L. B. S. Degree
Mathematics
Prof. Sanjay Kumar Pandey Member College, Gonda
Professor & G. S. P.G. College,
Mathematics
Prof. Jayash Nath Mishra Member Sultanpur

Evaluation
Course Code Course Title Credits T/P
CIE ETE

A B C D E F G

SEMESTER-I (YEAR-I)
B030701T CORE Advanced Abstract Algebra 5 T 25 75
B030702T CORE Advanced Real Analysis 5 T 25 75
B030703T CORE Topology 5 T 25 75
B030704T FIRST Mathematical Modeling 5 T 25 75
B030705T ELECTIVE Riemannian Geometry 5 T 25 75
B030706T (Select any one) Fuzzy Sets 5 T 25 75
B030707P SECOND Programming in Python-I 5 P 50 50
B030708P ELECTIVE Computational Techniques
(Select any one) 5 P 50 50
using C
 SEMESTER- II (YEAR-I )
B030801T CORE Analytical Dynamics 5 T 25 75
B030802T Theory of Differential Equation and
CORE 5 T 25 75
Boundary Value Problems
B030803T CORE Measure and Integration 5 T 25 75
B030804T History of Mathematics 5 T 25 75
THIRD
B030805T ELECTIVE Indian Contribution in Mathematics 5 T 25 75
B030806T (Select any one)
Elementary Statistics 5 T 25 75
B030807P Programming in Python-II 5 P 50 50
FOURTH
ELECTIVE
B030808P Computer Aided Numerical
(Select any one) 5 P 50 50
Analysis
SEMESTER-III (YEAR-II)
B030901T CORE Functional Analysis 5 T 25 75
B030902T CORE Integral Equations 5 T 25 75
B030903T CORE Machine Learning 5 T 25 75
B030904T FIFTH General Relativity 5 T 25 75
B030905T ELECTIVE Finsler Geometry 5 T 25 75
B030906T (Select any one) Advanced Discrete Mathematics 5 T 25 75
B030907P SIXTH Introduction to SCILAB
5 P 50 50
ELECTIVE /MATLAB
B030908P (Select any one) Introduction to LaTex 5 P 50 50
SEMESTER-IV(YEAR-II)
B031001T CORE Advanced Operations Research 5 T 25 75
B031002T CORE Fluid dynamics 5 T 25 75
B031003T Special Functions 5 T 25 75
SEVENTH
B031004T ELECTIVE Differential Geometry of Manifolds 5 T 25 75
(Select any one)
B031005T Advanced Numerical Methods 5 T 25 75
B031006P RESEARCH
PROJECT / Research Project / Dissertation 10 P 50 50
DISSERTATION
 M.A./M.Sc. I (SEMESTER-I), PAPER-I
ADVANCED ABSTRACT ALGEBRA
Course Code: B030701T Credit-5 Core paper
Max. Marks: 25+75
Total No. of Lectures-Tutorials (in Course Title: Advanced Abstract Algebra
hours per week): 4+1=5
Course outcomes:
CO1: The students will be able to define Isotropic groups, solvable groups, cauchy's theorem for finite
abelian group.
CO2: The students will be able to define Maximal subgroups, simple groups, composition series, normal
and subnormal series, Jordan-Holder theorem, modules, Schur's leema, Jordan canonical and rational
canonical forms.
CO3: The students will be able to define Field extensions, splitting or decomposition field, normal and
seperable field extension, perfect field.
CO4: The students are able to analyse Galois group, fundamental theorem of Galois group.
CO5: The student is equipped with standard concepts and tools at advance level that will serve him/her well
towards pursuing research in algebra.
Unit Topics No. of
Lectures
I Action of Group G on set, G-set, stabilizers and faithful action of G, Isotopric groups,
solvable groups, cauchy's theorem for finite abelian group and finite groups. 20
II Maximal subgroups, simple groups, composition series, normal and subnormal series,
Jordan-Holder theorem, modules, sub-modules, cyclic module, module 20
homomorphism and isomarphism, Schur's lemma, Invariant subspaces, Jordan
canonical and rational canonical forms.
III Field extensions, finite field extensions, simple field extensions, algebraic field 20
extension, splitting or decomposition field, normal and separable field extension,
perfect field.
IV Galois group, fundamental theorem of Galois group, Galois group of seperable 15
polynomial, Galois field, construction of Galois field and its subfields.
Suggested Readings:
1. Absract algebra: David S.Dummit, Richard M. Foote–Wiley India Pvt. Ltd.
2. Topic in algebra: I. N. Herstein–Wiley India Pvt. Ltd
3. Modern algebra: A. R. Vasishtha, A.k. Vasishtha -Krishna publications.
 M.A./M.Sc. I (SEMESTER-I), PAPER-II
ADVANCED REAL ANALYSIS

Course Code: B030702T Credit-5 Core paper

Max. Marks: 25+75
Total No. of Lectures-Tutorials (in Course Title: Advanced Real Analysis
hours per week): 4+1=5
Course outcomes:
CO1: The students will be able to analyse Sequence and series of functions of real numbers, Uniform
convergence.
CO2: The students will be able to analyse Riemann-Stieltjes integration and their properties, Relation
between Riemann and R-S integrals.
CO3: The students will be able to analyse Functions of several variables, Taylor’s theorem, Young’s
Theorem and Schwarz’s theorem.
CO4: The students will be able to analyse Functions of bounded variation and their properties, Absolutely
continuous functions and their properties, Relation between absolute continuity and function of bounded
variation.
Unit Topics No. of
Lectures
I Sequence and series of functions of real numbers, Point wise convergence and
Uniform convergence, Cauchy’s criterion of uniform convergence, Weierstrass 20
test for uniform convergence of series, Uniform convergence and continuity,
Uniform convergence and Uniform integration convergence and
differentiation.
II Riemann-Stieltjes integration and their properties, Riemann-Stieltjes
integration with respect to arbitrary integrator, Existence of Riemann-Stieltjes 20
integrals, Integration by parts theorem, Properties of R-S integrable functions,
Relation between Riemann and R-S integrals.
III Functions of several variables, limit, continuity and differentiability of several 20
variables, Directional derivatives, Derivative of functions in an open subset of
Rn to Rm. Taylor’s theorem, Young’s Theorem, Schwarz’s theorem.
IV Functions of bounded variation and their properties, Absolutely continuous 15
functions and their properties, Relation between absolute continuity and
function of bounded variation.

Suggested Readings:
1. Walter, R. Principles of Mathematical Analysis. 3rd edition, McGraw-Hill, 2017.
2. Terence T. Analysis II. Hindustan Book Agency, 2009.
3. Malik, S. C. and Arora, S. Mathematical Analysis. 2nd edition reprint. New Age International Publishers
2005.
4. Apostol, T. M. Mathematical Analysis. 2nd edition. Wesley Publishing Co. 2002.
5. Somasundram, D. and Chaudhary, B. A First Course in Mathematical Analysis. Narosa Publishing
House, 1996.
6. Royden, H. L. Real Analysis, Macmillan Pub. Co., Inc. 4th edition, New York, 1993.
 M.A./M.Sc. I (SEMESTER-I), PAPER-III
TOPOLOGY
Course Code: B030703T Credit-5 Core paper
Max. Marks: 25+75
Total No. of Lectures-Tutorials (in Course Title: Topology
hours per week): 4+1=5
Course outcomes:
CO1: The students are able to analyse Topological space, open and closed sets in Topological space,
neighborhoods, closure, interior, exterior, derived and dense sets, bases and sub-bases.
CO2: The students are able to analyse Continuous functions and Homeomorphism, first and second
countable spaces and separability.
CO3: The students are able to understand various concepts like: T0, T1, T2, T3, T4 spaces and basic
properties.
CO4: The students are able to understand various concepts like: Compactness, Connectedness and
Tychonoff product topology.
CO5: It provides the students useful tools for studying local properties of a space. Without the
knowledge of topology, it is rather impossible even to conceive the idea of learning mathematics at
higher level.

Unit Topics No. of

Lectures
I Definition and example of Topological space, open and closed sets in
Topological space, neighborhoods, closure, interior, exterior, derived and 20

dense sets, bases and sub-bases, sub-spaces.

II Continuous functions and Homeomorphism, first (1st) and second (2nd)
countable spaces, separability. 20
III T0, T1, T2, T3, T4 spaces and their basic properties. 20
IV Connectedness and compactness, definition and some basic theorem. 15

Suggested Readings:
1. K. D.Joshi: Introduction to general topology―Wiley Eastern, New Delhi
2. J. L. Kelly : General Topology ―Van Nostrand Reinhold company, Newyork
3. James R Munkres: Topology ―Prentice Hall India Private Ltd, New Delhi
4. J. N. Sharma : Topology ―Krishna publications, Meerut.
 M.A./M.Sc. I (SEMESTER-I), PAPER-IV
MATHEMATICAL MODELLING
Course Code: B030704T Credit-5 First Elective paper
Max. Marks: 25+75
Total No. of Lectures-Tutorials (in Course Title: Mathematical Modelling
hours per week): 4+1=5
Course outcomes:
CO1: The students will be able to convert a real-world problem into a mathematical model.
CO2: The students will be able to analyse mathematical modelling: need, classification, modelling
process, Elementary mathematical models, Role of mathematics in problem solving and Single species
population model.
CO3: The students will be able to do mathematical modelling through ordinary differential equations
of first order and second order and Some applications in economics, ecology, Modelling in epidemiology
(SIS, SIR, SIRS models) and basic reproduction number.
CO4: The students will be able to do mathematical modelling through difference equations, Some
simple models, Basic theory of linear difference equations with constant coefficients.
CO5: The students will be able to do mathematical modelling through partial differential equations.
Unit Topics No. of
Lectures
I Introduction to mathematical modelling: need, classification, modelling process,
Elementary mathematical models; Role of mathematics in problem solving. 20

Single species population model: The exponential model and the logistic model,
Harvesting model and its critical value.
II Modelling with ordinary differential equations: Overview of basic concepts in
ODE and stability of solutions: steady state and their local and global stability, 20

Linear and non-linear growth and decay models. Compartment models. Some
applications in economics, ecology, Modelling in epidemiology (SIS, SIR, SIRS
models) and basic reproduction number.
III Mathematical models through difference equations, Some simple models, Basic 20
theory of linear difference equations with constant coefficients, Mathematical
modelling through difference equations in economics and finance, Mathematical
modelling through difference equations in population dynamics.
IV Mathematical modelling through partial differential equations, Situations giving 15
rise to of partial differential equation models. The one-dimensional heat equation:
derivation and solution. Wave equation: derivation and solution.
Suggested Readings:
1. D. N. P. Murthy, N. W. Page and E. Y. Rodin, Mathematical Modelling, Pergamon Press.
2. J. N. Kapoor, Mathematical Modelling, Wiley Estern Ltd.
3. J.N. Kapur, Mathematical Models in Biology and Medicine, East-West Press.
4. F. Charlton, Ordinary Differential and Differential equation, Van Nostarnd.
5. Fred Brauer and Carlos Castillo-Chavez, Mathematical Models in Population Biology and Epidemiology, Springer.
6. Frank R. Giordano, William Price Fox, Maurice D. Weir, A First Course in Mathematical Modelling, 4th Ed., Charlie
Van Wagner.
7. Walter J. Meyer, Concept of Mathematical Modelling, McGraw-Hill.
8. Zafar Ahsan: Differential Equations and Their Applications, PHI learning Private Limited, New Delhi.
9. Steven H. Strogatz, Nonlinear dynamics and chaos, With Applications to Physics, Biology, Chemistry, and
Engineering.

M.A./M.Sc. I (SEMESTER-I), PAPER-IV

RIEMANNIAN GEOMETRY
Course Code: B030705T Credit-5 First Elective paper
Max. Marks: 25+75
Total No. of Lectures-Tutorials (in COURSE TITLE: Riemannian Geometry
hours per week): 4+1=5
Course outcomes:
CO1: Students will be able to define Riemannian space, metric, Curvature of a curve, curvature of
curve and Geodesic and its applications.
CO2: Students will be able to define Congruences of curves, Ricci coefficient of rotation, Curvature
of a congruence, Geodesic congruence, normal and irrotational congruence.
CO3: Students will be able to define congruences and orthogonal ennuples and Ricci’s coefficients of
rotation, curvature of congruence.
CO4: Students will be able to analyse Curvature tensor and Ricci tensor, Bianchi's Identity, Theorem
of schur, Projective and Conformal transformation, Weyl's Curvature tensor and Conformal curvature
tensor with their fundamental properties.
CO5: Students will be able to analyse Hypersurfaces, Meusnier's theorem, Line of curvature.
Unit Topics No. of
Lectures
I Riemannian space, metric, length of a curve, magnitude of vector, unit tangent
vector, Gradient of a scalar function, Angle between two curve, Curvature of a 20

curve, Principal normal, First curvature and geodesic curvature, Equation of

geodesic and it’s fundamental properties, Parallelism of vectors of constant and
variable magnitude, Definition of a subspace of a Riemannian space.
II Congruences of curves and orthogonalennuple, Ricci coefficient of rotation,
Curvature of a congruence, Geodesic congruence, normal and irrotational 20

congruence.
III Curvature tensor and Ricci tensor, Covariant curvature tensor, Bianchi's Identity, 20
Theorem of schur, Projective and Conformal transformation, Weyl's Curvature
tensor and Conformal curvature tensor with their fundamental properties.
IV Hypersurfaces : Definition of Hypersurface, Gauss formula for a Hypersurface, 15
Curvature of a curve in a Hypersurface, Meusnier's theorem, Line of curvature.
Suggested Readings:
1. L.P. Ersenhart : Riemannian Geometry – Princeton University Press.
2. C.E. Weatherburn: An Introduction to Riemannian Geometry and the Tensor Calculus ―Cambridge University Press.
 M.A./M.Sc. I (SEMESTER-I), PAPER-IV
FUZZY SETS

Course Code: B030706T Credit-5 First Elective paper

Max. Marks: 25+75
Total No. of Lectures-Tutorials (in Course Title: Fuzzy Sets
hours per week): 4+1=5
Course outcomes:
CO1: The students will be able to define Fuzzy sets and representations of Membership functions and
types of Fuzzy sets.
CO2: The students will be able to define Fuzzy numbers, Fuzzy cardinality, Fuzzy arithmetic
operations on intervals and Fuzzy equations.
CO3: Students will be able to analyse Fuzzy relations.
CO4: Students will be able to define Fuzziness, Shannon Entropy, Fuzzy linear programming
problems.
Unit Topics No. of
Lectures
I Fuzzy sets and representations of Membership functions, types of Fuzzy sets,α-
cut, strong α-cut, level set, support core and height of Fuzzy sets, Normal, equal 20

and equivalent Fuzzy set, containments, union, intersection of Fuzzy sets, degree
of sub-set hood, hamming distance, convex fuzzy sets and algebra of convex fuzzy
sets.
II Fuzzy numbers, Fuzzy cardinality, Fuzzy arithmetic operations on intervals,
arithmetic operations on Fuzzy numbers, Fuzzy equations A+X=B, AX=B. 20

III Fuzzy relations, union and intersection of Fuzzy relations, Binary Fuzzy relations, 20
domain, range, height, inverse and matrix representations of binary Fuzzy
relations, standard composition of Fuzzy relations, Fuzzy equivalence relations.
IV Fuzziness, Shannon Entropy, Fuzzy linear programming problems. 15

Suggested Readings:
1.Fuzzy set theory :Michael Smithson, Jay Verkuilen― Sage Publications
2.Fuzzy sets, Fuzzy logic and Fuzzy systems :George J.Klir, Boyuan ―World Scientific, Singapore
3.Fuzzy sets and Fuzzy logic : M Ganesh ― PHI Publications
4.Fuzzy set theory :Shiv Raj Singh ―Krishna publications, Meerut
 M.A./M.Sc. I (SEMESTER-I), PAPER-V
PROGRAMMING IN PYTHON-I
Course Code: B030707P Max. Marks: 50 + 50 Second Elective Paper
Course Title: PROGRAMMING IN PYTHON-I
Total No. of Lectures-Practicals (in hours
per week) : 4 + 2
Course outcomes:
CO1: The students will be able to describe the basic principles of Python programming language.
CO2: The students will be able to implement object-oriented concepts.
CO3: The students will be able to making use of software easily right out of the box.
CO4: The students will be able to experience with an interpreted language.

Basics of Python programming

Introduction to Python, Python Identifiers, Key words, Variables & Operators, Data Types, Strings,
Lists and Tuples, Dictionary & Sets, Input-Output, Conditional Statements and Expressions, Loops,
Control Flow statements, Functions, Modules & Recursions, introduction to Classes and Inheritance,
Working with files

1 Getting started, Anaconda Installation, Python notebooks and Editors. Github

2 Calculate the distance between two points in three dimensions
3 Write a program to calculate average of two numbers and print their deviation.
4 Write a program to calculate factorial of a number.
5 Write a program to find GCD of two numbers.
6 Write a program greatest number from three numbers.
7 Write a program to print the reverse of a number.
8 Write a program to classify a given number as prime or composite
9 Write a program that computes permutations P(n,r) and combinations C(n,r)
10 Write a program that computes displays all leap years from 1900-2101
11 Write a program to print Fibonacci series up to a given number
12 Write a program to convert binary number to decimal number and vice versa
13 Opening, closing, editing, deleting and creating files in python
14 Create a simple function and call it from the main program
15 Loops in python: examples

Suggested readings:
1 S. Gowrishankar and A. Veena A, Introduction to Python Programming, CRC Press (2019).
2 Adam Stewart -Python Programming (2016).
3 Kenneth A. Lambert, Fundamentals of Python First Programs with Mindtap, Cengage
Learning India (2011).
 M.A./M.Sc. I (SEMESTER-I), PAPER- V
Computational Techniques using C
Course Code: B030708P Credit-5 Second Elective Paper
Max. Marks: 50 + 50
Total No. of Lectures-Practicals (in hours Course Title: Computational Techniques using C
per week): 4 + 2
Course outcomes:
CO1: The students will be able to learn and use basic principles of C programming language.
CO2: The students will be able to define and manage various type of data and data- structures based
on problems subject domain.
CO3: The students will be able to have ability to handle possible errors during program execution.
CO4: The students will be able to define various types of functions and able to apply various types of
decision making, statements/loops.
CO5: The students will be able to able to apply in various fields of Mathematics.
Basics of C programming
Overview of C: History and importance of C. Sample Programs. Programming Style. Executing a 'C'
Programme, Constants, Variables, and Data Type. Operators: Arithmetic, Relational, Logical, Assignment,
Increment and Decrement, Conditional, Bitwise, Special. Expressions: Arithmetic expressions, evaluation of
expressions. Input and output operators. Decision Making and Branching: Decision making with if statement,
simple if statement, the if-else statement, Nesting of if-else statements, The else if Ladder, The Switch
statement, The Goto statement. Decision Making and Looping: The while statement, The do statement, The
for statement. Jump in Loop. Arrays: One and Two− Dimensional Arrays. Deceleration of One and
Two−Dimensional Arrays. Initializing of One and Two−Dimensional Arrays. Multi−dimensional Arrays,
Dynamic Arrays, Character Arrays and Strings. User-defined Functions: Need for user-defined functions. A
multi-function program. Elements of user-defined functions. Definition of functions. Functions Call,
Functions Deceleration. Category of function, Nesting of functions.
Practical: Programming in C (with ANSI features)
1. To print the prime numbers between 1 and 100.
2. Write a program to add, subtract, multiply and divide common fractions.
3. To find the average of between n and 12n where n is an integer.
4. Write a program to check a number is Armstrong or not ?
5. Write a program to display table from 11 to 20.
6. To find the roots of a cubic equation.
7. To sum and difference of any two matrices and hence find the row sum and
column sum of a given matrix. .
8. To find inverse of a given 3x3 matrices.
9. Write a program to find the transpose, trace and norm of a matrix.
10.To sort all the elements of a 4x4 matrix.
11. Program to accept a matrix and determine whether it is a symmetric matrix,
skew-symmetric or not.
12. Write a program to print Fibonacci numbers.
13. Program to find the sum of the series: 1 ⋯ .
Suggested Readings:
1. Balagurusamy: Programming in ANSI C, MacGraw Hill Education (India) Pvt. Ltd., New Delhi.
2. Kernigham and Ritche: C Programming Language, Pearson Education India,
 M.A./M.Sc. I (SEMESTER-II), PAPER-I
Analytical Dynamics
Course Code: B030801T Credit-5 Core paper
Max. Marks: 25+75
Total No. of Lectures-Tutorials (in Course Title: Analytical Dynamics
hours per week): 4+1=5
Course outcomes:
CO1: The students will be able to classify dynamical systems, and define generalized coordinates,
Classification of Dynamical System and D’Alembert’s Principle, Lagrange’s equations.
CO2: The students will be able to define Hamilton’s canonical equations, Hamilton’s principle and
principle of least action.
CO3: The students will be able to define two-dimensional motion of rigid bodies, Euler’s dynamical
equations for the motion of a rigid body about an axis, theory of small oscillations and examples.
CO4: The students will be able to define Lagrange Bracket, Poisson Bracket, Canonical
Transformation, Jacobi Identity, Hamilton Jacobi Theorem and Poisson’s Theorem.
Unit Topics No. of
Lectures
I Introduction of Analytical Dynamics, Generalized coordinates, Degree of 20
Freedom, Classification of Dynamical System, Conservative and Non
Conservative System, generalized Forces, D’Alembert’s Principle, Lagrange’s
equations
II Hamilton’s canonical equations, Hamilton’s principle and principle of least
action, Conservation of Momentum and Displacement of the System, 20
Hamiltonian Function and total Energy, Cyclic or Ignorable Coordinate.
III Two-dimensional motion of rigid bodies, Euler’s dynamical equations for the
motion of a rigid body about an axis, theory of small oscillations and 20
examples.
IV Lagrange Bracket, Poisson Bracket, Canonical Transformation, Jacobi 15
Identity, Hamilton Jacobi Theorem, Poisson’s Theorem
Suggested Readings:
1 Classical Mechanics : Goldestein, H, Pearson Education, 2011
2 Classical Mechanics : Rana and Jog, McGraw Hill Education, 2017
3 Classical Mechanics : J.C. Upadhyaya, Himalaya publication, 2014
4 Analytical Dynamics: A New Approach, Udwadia and Robert, Cambridge University Press, 2007
 M.A./M.Sc. I (SEMESTER-II), PAPER-II
Theory of Differential Equation and Boundary Value Problem
Course Code: B030802T Credit-5 Core paper
Max. Marks: 25+75
Total No. of Lectures-Tutorials (in Course Title: Theory of Differential Equation and Boundary
hours per week): 4+1=5 Value Problem

Course outcomes:
CO1: The students will be able to analyse Laplace’s Equation, Harmonic functions, Heat and Wave equations
and their Fundamental solutions.
CO2: The students will be able to analyse Existence and uniqueness theorem, initial value problems and
picardes theorem, Peano's existence theorem and corollaries.
CO3: The students will be able to analyse Ordinary Differential Equations of Sturm-Liouville boundary value
problem, Green’s function, Poisson representation formula.
CO4: The students will be able to analyse Application of Laplace transform to solve differential equations
and Fourier transforms to boundary value Problems.
Unit Topics No. of
Lectures
I Method of separation of variables for Laplace, Fundamental solution of Laplace’s
Equation, Harmonic functions and properties, The maximum principle, Energy 20
methods, Heat and Wave equations, Mean value Method, Solution of Wave
equation with initial values, Fundamental solutions of Heat Equation.
II Existence and uniqueness theorem for first order ODE, initial value problem and
picardes theorem, convergence of solution of initial value problems, Peano's 20
existence theorem (statement only) and corollaries.
III Ordinary Differential Equations of Sturm-Liouville boundary value problem, Eigen 20
values and Eigen functions, Orthogonality theorem, Expansion theorem, Green’s
function.
IV Application of Laplace transform to solve differential equations, Application of 15
Fourier transforms to boundary value Problems.
Suggested Readings:
1. G. F. Simmons, Differential Equations with Applications and Historical Notes, McGrawHillEducation.
2. Coddington, E. A. and Levinson, N. (1955) Theory of Ordinary Differential equations, TMHEducation.
3. M. D. Raisinghania, Advanced Differential Equations, S. Chand, 2016.
4. D.P. Choudhary and H. I. Freedman: A Course in Ordinary Differential Equations, Narosa Publishing House, New
Delhi,2002.
5. I.N. Sneddon, Elements of Partial Differential Equations, McGraw-Hill, 1988.
6. Robert C Mcowen, Partial Differential Equations: Methods and Applications, Pearson Education Inc. 2003.
 M.A./M.Sc. I (SEMESTER-II), PAPER-III
MEASURE AND INTEGRATION
Course Code: B030803T Credit-5 Core paper
Max. Marks: 25+75
Total No. of Lectures-Tutorials (in Course Title: Measure and Integration
hours per week): 4+1=5
Course outcomes:
CO1 : Students will be efficient to know the measurability of a set calculating meter and inner
measure only meter measure gives the measurability of a set. Student will easily classify some
measurable and non -measurable sets.
CO2 : Students will enable themselves to know measurable and non-measurable functions.
Countability and measurability of a set is clearly known to students with Boral.
CO3 : Students will be defined Lebesgue integral, Relation between Riemann integral and Lebesgue
integral, Lebesgue integral of bounded measurable function and it’s properties.
CO4 : The students will be able to analyse -space, some basic definitions and theorem, Holder’s
inequality, Minikowski inequality, Schwarz’s and Jensen Inequality.
Unit Topics No. of
Lectures
I Measurable sets, outer and inner measure of a bounded set. Union and
intersection of a Measurable sets. Lebesgue measurable sets. Sets of measure 20
zero. Boral sets, measure of countable and uncountable sets.
II Measurable functions, algebra of measurable functions, Boral measurable
function, measurability of a continuous function, non-measurable function. 20
III Lebesgue integral, Relation between Riemann integral and Lebesgue integral, 20
criterion theorem for Lebesgue integral, Lebesgue integral of bounded
measurable function and it’s properties, Lebesgue integral of unbounded
functions.
IV -space, some basic definitions and theorem, Holder’s inequality, 15
Minikowski inequality, Schwarz’s and Jensen Inequality.
Suggested Readings:
1 – Measure theory : Krishna B.Athreya, Soumendra N.Lahiri – Trim Hindustan book Agency
2 – Measure theory and Integration : G. DE Barra – New Age international Publisher
3 – Measure theory and Integratism : A K Malik, S C Malik, S K Gupta – willy Eastern Publisher
 M.A./M.Sc. I (SEMESTER-II), PAPER-IV
HISTORY OF MATHEMATICS
Course Code:B030804T Credit-5 Third Elective Paper
Max. Marks: 25+75
Total No. of Lectures-Tutorials (in hours Course Title: HISTORY OF MATHEMATICS
per week): 4+1=5
Course outcomes:
CO1: The students will be able to know that how the concepts have been developed in Mathematics

Unit Topics No. of

Lectures
I Ancient Mathematics: The Babylonians. The Egyptians. The Greeks. The 20
Romans, The Maya, The Chinese, The Japanese. The Hindus. The Arabs

II Mathematics in Europe during the middle age.

20
III Mathematics during the sixteenth, seventeenth, eighteenth, nineteenth, and
twentieth centuries. 20
IV There naissance Vieta and Descartes to Newton, Euler, Lagrange, Laplace, 15
Hardy, and Ramanujan

Suggested Readings:
1. F. Cajon: A History of Mathematics, 1894.
2. J. Stillwell: Mathematics and its History, Springer International Edition, 4th Indian
Reprint, 2005.
 M.A./M.Sc. I (SEMESTER-II), PAPER-IV
Indian Contribution in Mathematics
Course Code:B030805T Credit-5 Third Elective Paper
Max. Marks: 25+75
Total No. of Lectures-Tutorials (in hours Course Title: Indian Contribution in Mathematics
per week): 4+1=5
Course outcomes:
CO1: The students will be able to know Vedic period and some Indian contribution in Mathematics.

Unit Topics No. of

Lectures
I Vedic period: Yajurveda samhita in which collection of large number is 20
used, mantra in asvamedha, solution of partial fraction in purush sukta, value
of virtual geometric constructions in satpatha Brahmma. Rules for construction
of sacrificial five altars in sulbha sutra, verbal expression of Pythagorean
theorem and square root of two in Baudhayana Sulba Sutra. Peninis grammer
for use of Boolean logic and Null operator.
II Post Vedic Period: Chhandas shastra of pingla for enumeration of syllabic
combination; Pascal’s triangle, bionomial coefficients, basic ideas of fibonacci 20
numbers and combinatorial identity in work of Katyayana. Jain philosopher
Mahavira's classified number as enumerable, innumerable and infinite. He
used beejganita samikaran and shunya (zero) with Anuyoga dwara sutra
including factorials. Astronomical work of Bhadrabahu.
III Classical Period: Aryabhatiya and Arya- Siddhanta of aryabhatta, his work
includes Place value system and position of a planet along with number of 20
days in a year. Bhramhagupta who introduced concept and computing method
of zero. Works of Varahamihira, Bhaskara l, Bhaskara ll, Mahavira, Madhava
of sangamgrama and nilakantha somayaji. Works of shridhara, manjula,
shripati mishra.
IV Modern Period: Contribution of Bharati krishna tirtha, Contribution of 15
Ramanujan, Mahalanobis, C R Rao, Kaprekar, Harish Chandra, Satyendra
Nath Bose, Narendra Karmakar and Shakuntala Devi, Shankaracharya.
Suggested Readings:
1. Gerard G. Emch, M.D. Srinivas, R. Sridharan (2005), Contributions to the History of Indian Mathematics,
Hindustan Book Agency.
2. Gaurav Tekriwal (2021), The Great Indian Mathematics, Penguin Random house India Private Limited.
3. Jayant V Narlikar (2003), The Scientific Edge, The Indian Scientist from Vedic to Modern Times,
Penguin Books Limited.
 M.A./M.Sc. I (SEMESTER-II), PAPER-IV
Elementary Statistics
Course Code: B030806T Credit-5 Third Elective paper
Max. Marks: 25+75
Total No. of Lectures-Tutorials (in Course Title: Elementary Statistics
hours per week): 4+1=5
Course outcomes:
CO1: Students will learn basic concepts of statistics used in various disciplines
CO2: Students will be able to study various measures of dispersion like range, mean deviation, quartile
deviation and standard deviation.
CO3: Students will be able to analyze and solve various concepts related to probability and probability
distributions.
CO4: Students will be able to learn and use concepts confidence intervals, hypothesis testing, linear
regression
Unit Topics No. of
Lectures
I Introduction to Statistics, Branches of Statistics, Population versus Sample, 15

Basic Terminology, Types of Variables, Summation Notation, Sources of Data,

and Sampling Techniques, Frequency Distributions, Relative Frequency.
II Pie Charts, Frequency Histogram, and Cumulative Frequency. Measures of
Center: Mean, Median and Mode. Intro to Measures of Dispersion 15

(Ungrouped Data), Measures of Variability: Range, variance and standard

deviation.
III Random variables, Discrete and continuous Random Variables. Mean and
Standard Deviation, Probability, probability distributions, Intro to Normal 20

Distribution, Applications of Normal Distribution sampling distributions,

binomial distribution, the student's t distribution, the Chi-square distribution
IV Estimation using confidence intervals, hypothesis testing, linear regression, 25
correlation

Suggested Readings:
1. Gupta, S.C. and Kapoor, V.K. (2007): Fundamentals of Mathematical Statistics, 11th Edn.,
(Reprint), Sultan Chand and Sons.
2. Miller, Irwin and Miller, Marylees (2006): John E. Freund’s Mathematical Statistics with
Applications, (7th Edn.), Pearson Education, Asia.
3. Spiegel and Stephens: Schaum’s outlines Statistics, McGraw Hill Education
 M.A./M.Sc. I (SEMESTER-II), PAPER-V
PROGRAMMING IN PYTHON-II

Course Code: B030807P Max. Marks: 50 + 50 Fourth Elective Paper

Course Title: PROGRAMMING IN PYTHON-II
Total No. of Lectures-Practicals (in hours
per week) : 4 + 2

Course outcomes:
CO1: The students will be able to analyze the data by plotting Bar chart/Pie chart/Histogram using Python
programming.
CO2: The students will be able to solve simultaneous equations by using Python Programming.
CO3: The students will be able to solve ordinary and partial differential equations by using Python
Programming.
CO4: The students will be able to find roots of equations by using different methods with Python
programming.
Use of Matplotlib for plotting and data representation. Introduction to numpy, scipy, sympy, using these
libraries for Fourier series and Fourier transform,
ࡵPracticals:
Practicals:
I Data Visualization - I
1. Scatter plots
2. Bar charts
3. Histograms
4. Pie Charts
II Data Visualization - II
5. Interactive plots -1 : modifying display.
6. Interactive plots – 2 : editing data and plots.
7. How to make a simple animation in python
III Numpy
8. Array Arithmatic
9. Matrix Arithmatic
10. Numerical Methods through numpy
IV Scipy
11. Regression
12. Optimization
13. Root-Finding

Suggested readings:
1 S. Gowrishankar and A. Veena A, Introduction to Python Programming, CRC Press (2019).
2 Adam Stewart -Python Programming (2016).
3 Kenneth A. Lambert, Fundamentals of Python First Programs with Mindtap, Cengage Learning India
(2011)
4 John V. Guttag, Introduction to Computation and Programming using Python, MIT Press (2021)
 M.A./M.Sc. I (SEMESTER-II), PAPER-V
Computer Aided Numerical Analysis
Course Code: B030808P Credit-5 Fourth Elective Paper
Max. Marks: 50 + 50
Total No. of Lectures-Practicals (in hours Course Title: Computer Aided Numerical Analysis
per week): 4 + 2

Course outcomes:
CO1: The students will be able to find roots of equations by using different methods with C
programming.
CO2: The students will be able to solve simultaneous equations by using different methods with C
programming.
CO3: The students will be able to solve differential equations by using different methods with C
programming.

Finite differences, Operators, Interpolation, Roots of a polynomial , Bisection Method, Newton-Raphson

Method, Regula Falsi Method, Simultaneous linear Algebraic Equations, Gauss Elimination Method, Gauss-
Seidal Method, L U Decomposition method, Numerical Quadrature, Simpson’s rules, Trapezoidal Rule,
Solving a ordinary differential equation using Euler’s Method, . Runge-Kutta Method. Eigen value problem,
Practicals: Write Code for following
1. Find roots of a polynomial using Bisection Method
2. Find roots of a polynomial using Newton-Raphson Method
3. Find roots of a polynomial using Regula-Falsi Method
4. Find the polynomial from a given data set using Lagrange’s Interpolation formula.
5. Solve a system of linear equations using Gauss Elimination Method
6. Solve a system of linear equations using L U Decomposition method
7. Use Gauss-Seidal Method for system of linear equations.
8. Integrate a function using Simpson’s 1/3rd rule and 3/8th rule for a given set of limits.
9. Integrate a function using Trapezoidal Rule and find the difference with above methods.
10. Find solution of ordinary differential equation using Euler’s Method and Runge-Kutta Method
11. Solve a systems of ordinary differential equations using appropriate numerical methods.
12. Find eigenvalue and corresponding eigenvectors of a given matrix.

Suggested Readings:
1. M. K. Jain, S. R. K. Iyengar – R. K. Jain, Numerical Methods for Scientific and Engineering Computation, New
Age International, 6th Edition 2012.
2. A. Ralston and P. Rabinowitz – A First Course in Numerical Analysis, 2nd Edition, McGraw - Hill, New York,
1978
3. K.E. Atkinson, An Introduction to Numerical Analysis, John Wiley and Sons, 1989.
4. F.B.Hilderbrand, Introduction to Numerical Analysis, Dover Publication.
 M.A./M.Sc. II (SEMESTER-III), PAPER-I
FUNCTIONAL ANALYSIS
Course Code: B030901T Credit-5 Core Paper
Max. Marks: 25+75
Total No. of Lectures-Tutorials (in Course Title: Functional Analysis
hours per week): 4+1=5
Course outcomes:
CO1: The students will be able to analyse Normed linear space, Banach space.
CO2: The students will be able to analyse , , Banach spaces, Banach space C(X) , Riesz
– Fisher theorem , Continous and Bounded linear Transformation.
CO3: The students will be able to analyse Isometric Isomarphism, Topological Isomarphism,
Equivalent norm, Riesz- Lemma, Convexity, Hahn- Banach Theorem, Open mapping Theorem,
Closed Graph Theorem.
CO4: The students will be able to analyse Hilbert space, Riesz representation theorem.
Unit Topics No. of
Lectures
I Normed linear space, Banach space, Summability in Normed linear space, 15
continuity and joint continuity.
II , , Banach spaces, Riesz – Fisher theorem, Subspaces and 15
Quotient spaces of Banach space, Continous and Bounded linear
Transformation.
III Isometric Isomarphism, Topological Isomarphism, Equivalent norm, Riesz- 20
Lemma, Convexity, Hahn- Banach Theorem, Open mapping Theorem , Closed
Graph Theorem.
IV Hilbert space, The adjoint of an operators T in Hilbert space, Self adjoint, 25
Normal and Unitary operators, Riesz representation theorem.
Suggested Readings:
1. Walter Rudin : Functional Analysis - TATA McGraw Hill New Delhi
2. Lusternik and sobolev : Elements of Functional Analysis - Hindustan Publishing corporation New Delhi
3. E.C. Titchmarsh : A Theory of Functions - Oxford University Press New Delhi
4. J.N. Sharma & A.R.Vasishtha : Functional Analysis - Krishna Publications Meerut
 M.A./M.Sc. II (SEMESTER-III), PAPER-II
INTEGRAL EQUATIONS

Course Code:B030902T Credit-4 Core paper

Max. Marks: 25+75
Total No. of Lectures-Tutorials (in hours Course Title: INTEGRAL EQUATIONS
per week): 4
Course outcomes:
CO1 Understand the methods to reduce Initial value problems associated with linear differential equations to
various integral equations.
CO2 Categories and solve different integral equations using various techniques.
CO3 The students will be able to analyze Fredholm and Volterra integral equations, Solution by the
successive approximations, Neumann series and resolvent kernel, equations with convolution type kernels.
CO4 The students will be able to analyze and solve the solution of integral equations by transform methods

Unit Topics No. of

Lectures
I Integral Equations: Definition and classification of linear integral equations. 20
Conversion of initial and boundary value problems into integral equations.
Conversion of integral equations into differential equations.
II Fredholm Integral Equations: Solution of integral equations with separable
kernels, Eigen values and Eigen functions. Solution by the successive 20
approximations, Neumann series and resolvent kernel. Solution of integral
equations with symmetric kernels, Hilbert-Schmidt theorem.
III Volterra Integral Equations: Successive approximations, Neumann series and
resolvent kernel. Equations with convolution type kernels. 20
IV Solution of integral equations by transform methods: Singular integral 15
equations, Hilbert transform and solutions by Laplace transformation.
Suggested Readings:
1. Kanwal, R.P.: Linear Integral Equation. Theory and Techniques. Academic Press, 2014.
2. Raisinghania M. D.: Integral Equation & Boundary Value Problem. S. Chand Publishing, 2007.
3. Jerri, A. :Introduction to Integral Equations with Applications, John Wiley & Sons, 1999.
4. Hildebrand, F. B.: Method of Applied Mathematics, Courier Corporation, 2012.
5. Wazwaz, A. M.: A First Course in Integral Equations. World Scientific Publishing Co Inc, 1997.
 M.A./M.Sc. II (SEMESTER-III) PAPER-III
MACHINE LEARNING
Credits-4
Course Code: B030903T Core paper
Marks: 25+75

Total No. of Lectures (in hours per week) – Course Title: MACHINE LEARNING
4

Course outcomes:
CO1: The students will be able to understand the need for machine learning for various problem solving.
CO2: The students will be able to understand a wide variety of learning algorithms and know how to evaluate
models generated from data.
CO3: The students will be able to understand the latest trends in machine learning.
CO4: The students will be able to identify appropriate machine learning algorithms for general real-world
problems and apply these algorithms to solve these problems.
Unit Topics No. of
Lectures
I Introduction to Machine Learning (ML), Applications of ML, Recent trends in 20
Machine Learning, Learning, Types of Learning, Introduction to Machine Learning
Approaches Understanding of Data and Datasets, Preparation of Data for Analysis
and Machine Learning, Dataset cleaning Train, Test and Validation Datasets,
Imbalanced data, Outliers, Data Science vs Machine Learning.
II SUPERVISED LEARNING (REGRESSION): Regression: Linear Regression, 20
Cost Function, Multiple Linear Regressions, Logistic Regression. Decision Trees,
Overfitting and Underfitting, Confusion Matrix, Performance Metrics: Accuracy,
Precision, Recall
III Unsupervised Learning: k-Nearest Neighbor (KNN) Classification, Decision Trees 20
for classification, Logistic Regression
Advanced Machine Learning Methods: Neural Networks and Polynomial Fits -
over and under fitting.
IV 15
Statistical Inference and Bayes Theorem, Frequentist vs. Bayesian Approaches,
Introduction to Bayesian Methods: Estimation, Likelihood, Posterior and Priors,
Model comparison, Maximum Likelihood.
Suggested readings:
1. Coryn A. L., Bailer, Jones, Practical Bayesian Inference: A Primer for Physical Scientists, CUP
2. Stone, James V., Bayes Rule: A tutorial introduction, Sebtel Press
3. Srinivasaraghavan, A. and Joseph, V: Machine Learning, Wiley India Pvt Ltd. 2019
4. Mehryar Mohri, Afshin Rostamizadeh, Ameet Talwalkar: Foundations of Machine Learning, MIT Press, 2012.
5. Siman Haykin: Neural Netowrks, Pearson Education.
 M.A./M.Sc. II (SEMESTER-III) PAPER-III
GENERAL RELATIVITY

Course Code: B030904T Max. Marks: 25+75 Fifth Elective paper

Total No. of Lectures (in hours per Course Title: GENERAL RELATIVITY
week) – 4

Course outcomes:
CO1: The students will be able to understand metric tensor and Riemannian space.
CO2: The students will be able to learn Ricci tensor, Bianchi Identities, examples of symmetric
space time.
CO3: The students will be able to understand Einstein’s field equation, gravitational waves in empty
space.
Unit Topics No. of
Lectures
I Transformation of coordinates, transformation law of tensor, Product of two tensor, 15
Contraction, Quotient law, Metric tensor and Riemannian space, Conjugate tensor,
symmetric and anti−tensor, Levi-Civita tensor, Christoffel symbol, Covariant derivative,
Riemannian metric,
II Tensor form of gradient, divergence and curls, Parallel transport, Riemannian curvature 20
tensor, Ricci tensor, Bianchi identities, Geodesic, Null geodesic, Geodesic deviation
III Introduction to General Relativity, Principle of Equivalence, Principle of General 20
covariance, Mach's Principle, geodesic postulate, Energy momentum tensor, Newtonian
approximation of equation of motion, Search for Einstein's field equation, Einstein's field
equation reduces to Poisson's equations, deviation of Einstien’s field equation from
vibrational principle,
IV Gravitational field in empty space, Schwarzschild exterior solution, Singularities in 20
Schwarzschild line element, Isotropic form of Schwarzschild exterior line element,
Planetary orbits, Three Crucial tests in General relativity, Birkhoff's theorem.

Suggested readings:
1. J.V.Narlikar:An Introductions to Relativity; Cambridge University Press, 2010.
2. James Hartle: Gravity, Pearson Education, 2003
3. S Dhurandhar and Sanjit Mitra: General Relativity and Gravitational Waves, Springer 2022
4. S. P. Puri: General Theory of Relativity; Pearson, 2013.
5. I.B. Khriplovich: General Relativity; Springer Science& Business media, 2005.
6. Ta-Pei Cheng: Relativity, Gravitation and Cosmology, Oxford. 2012
 M.A./M.Sc. II (SEMESTER-III) PAPER-III
FINSLER GEOMETRY

Course Code: B030905T Max. Marks: 25+75 Fifth Elective paper

Total No. of Lectures (in hours per Course Title: Finsler Space
week) – 4

Course outcomes:
CO1: The students will be able to analyse Finsler space and homogeneity properties of gij and Cijk,
Geodesics.
CO2: The students will be able to analyse Fundamental postulates of Cartan, Cartan covariant
derivatives, Properties of Cartan covariant derivatives, Berwald's connection, Covariant derivatives
of Berwald's and it’s properties, Relation between connection coefficients of Cartan and Berwald.
CO3: The students will be able to find Commutation formulae, The three Curvature tensors of
Cartan, Identities satisfied by the Curvature tensors and Bianchi identities.
CO4: The students will be able to analyse Curvature tensor of Berwald, The Lie-derivatives in a
Finsler space and Motion in a Finsler space.
Unit Topics No. of
Lectures
I Curve line element, Fundamental function, Finsler metric, Finsler space, Tengent 20
space, Indicatrix, Minkowskian space, magnitude of a vector, homogeneity
properties of gij and Cijk, Geodesics.
II Fundamental postulates of Cartan, Cartan covariant derivatives, Properties of 20
Cartan covariant derivatives, Berwald's connection, Covariant derivatives of
Berwald's and it’s properties, Relation between connection coefficients of Cartan
and Berwald.
III Commutation formulae, The three Curvature tensors of Cartan, Identities satisfied 20
by the Curvature tensors, Bianchi identities.
IV Curvature tensor of Berwald, The Lie-derivatives in a Finsler space, Motion in a 15
Finsler space.
Suggested readings:
1.Hanno Rund: The Differential Geometry of Finsler spaces ―Springer publication
2. Matsumoto: Foundations of Finsler Geometry and special Finsler spaces― Kaiseisha press
 M.A./M.Sc. II (SEMESTER-III), PAPER-IV
Advanced Discrete Mathematics
Course Code: B030906T Credit-5 Fifth Elective paper
Max. Marks: 25+75
Total No. of Lectures-Tutorials (in Course Title: Advanced Discrete Mathematics
hours per week): 4+1=5
Course outcomes:
CO1: Understand the basics of combinatorics, and be able to apply the methods from these subjects in
problem solving.
CO2: Be able to use effectively algebraic techniques to analyse basic discrete structures and algorithms.
CO3: To provide a formal connection between algorithmic problem solving and the theory of languages and
automata and develop them into a mathematical (abstract) view towards algorithmic design and in general
computation itself.
Unit Topics No. of
Lectures
I Basic counting principles, Permutations and Combinations (with and without 15
repetitions),Binomial theorem, Multinomial theorem, Counting subsets, Set-
partitions, Stirling numbers
Principle of Inclusion and Exclusion, Derangements, Inversion formulae
II Definition, examples and basic properties of graphs, pseudo graphs, complete
graphs, bi-partite graphs, isomorphism of graphs, paths and circuits, Eulerian circuits, 20
Hamiltonian cycles, the adjacency matrix, weighted graph, travelling salesman’s
problem, shortest path, Dijkstra’s algorithm, Floyd-Warshall algorithm.
III Generating functions: Algebra of formal power series, Generating function models,
Calculating generating functions, Exponential generating functions. 20
Recurrence relations: Recurrence relation models, Divide and conquer relations,
Solution ofrecurrence relations, Solutions by generating functions.
IV Languages : Alphabets, string, language, Basic Operations on language, 20
Concatenation, KleeneStar
Finite Automata and Regular Languages:
Regular Expressions, Transition Graphs, Deterministics and non-deterministic finite
automata, NFA to DFA Conversion, Regular languages and their relationship with
finite automata, Pumping lemma and closure properties of regular languages.
Suggested Readings:
1. .C. L. Liu: Elements of discrete mathematics, Tata McGraw Hill Education, 2008.
2. Ram Babu: Disrete Mathematics, Pearson Edition India, 2011.
3. J.H. van Lint and R.M. Wilson, A Course in Combinatorics, 2nd Ed., Cambridge University Press, 2001
4. S.S. Sane, Combinatorial Techniques, Hindustan Book Agency, 2013
5. J. E. Hopcroft, R. Motwani and J. D. Ullman, Introduction to Automata Theory, Languages, and Computation, 2nd Ed.,
Addison-Wesley, 2001.
6. P. Linz, An Introduction to Formal Language and Automata 4th edition Publication Jones Bartlett, 2006
 M.A./M.Sc. II (SEMESTER-III), PAPER- VI
Introduction to SCILAB /MATLAB

Course Code: B030907P Credit-5 Sixth Elective paper

Max. Marks: 50 + 50
Total No. of Lectures-Practicals (in hours Course Title: Introduction to SCILAB /MATLAB
per week): 2+6
Course outcomes:
CO1: The students will be able to use SciLab/MATLAB in their mathematical problem solving.
CO2: The students will be able to use these software in working problems related to polynomials and Linear
Algebra
Introduction to SciLab/ MATLAB, Installation of SciLab/ MATLAB, Basic elements of the language, Looping
and Branching: If, select, for, break, continue, Functions, return, Contour plots, tiles, axes, legends.
Matrices: Creating matrices, sum, product of matrices, inverse, rank determinant, comparing matrices,
system of equations, working with polynomials, defining a function and output arguments.
Practicals:
1. To print the prime numbers between 1 and 100.
2. Write a program to add, subtract, multiply and divide common fractions.
3. To find the average of between n and 12n where n is an integer.
4. Write a program to check a number is Armstrong or not ?
5. Write a program to display table from 11 to 20.
6. To find the roots of a cubic equation.
7. To sum and difference of any two matrices and hence find the row sum and
column sum of a given matrix. .
8. To find inverse of a given 3x3 matrices.
9. Write a program to find the transpose, trace and norm of a matrix.
10.To sort all the elements of a 4x4 matrix.
11. Program to accept a matrix and determine whether it is a symmetric matrix,
skew-symmetric or not.
12. Write a program to print Fibonacci numbers.

Suggested Readings:
1. Gilat, A. : MATLAB: An Introduction with Applications, Wiley , 2012
2.Pratap, R : Getting Started with MATLAB, Oxford Univ Press, 2019
3. Nagar, S. : Introduction to Scilab, Apress , 2017
 MA./M.Sc. II (SEMESTER-III), PAPER- VI
Introduction to LaTex
Course Code: B030908P Credit-5 Sixth Elective paper
Max. Marks: 50+50
Total No. of Lectures-Practicals (in hours Course Title: Introduction to LaTex
per week): 2+6
Course outcomes:
CO1: The students will be able to know that how the concepts have been developed in Mathematics
CO2: The students will be able to different typesetting Mathematical formulae and equations.
CO3: The students will be able to typeset in different formats including research paper, report and thesis
Topics
Introduction to LaTeX, Installation of LaTeX, Layout Design, LaTeX input files, Input file structure.
Document classes, packages, environments, page styles, Typesetting texts, Fancy Header, tables,
Inline math formulas and displayed equations, Math symbols and fonts, delimiters, matrices, arrays,
Typesetting Mathematical formulae: fractions, Integrals, sums, products, etc.
Producing Mathematical Graphics.
Document classes for paper writing, thesis, books, etc. Table of contents, index, bibliography management.
Hypertext, pdf pages, geometry, fancy header and footer, Verbatim, itemize, enumerate, boxes, equation
number.
Practicals:
Practicals based on above .
Suggested Readings:
1.Kortwitz: Latex A beginner guide, Packt Publishing Ltd, 2021
2. Karmali: A Short Introduction to Latex, Greatespace Independent Pub Plateform, 2019
3. Lamport: Latex: A Document Preparation System, Addison Wisley,1994
4. Swapan Kumar: Latex A beginner guide, Lakxmi Pub Pvt Ltd, 2019
 M.A./M.Sc. II (SEMESTER-IV), PAPER-I
ADVANCED OPERATION RESEARCH

Course Code: B031001T Credit-4 Core paper

Max. Marks: 25+75
Total No. of Lectures-Tutorials (in Course Title: Advanced Operation Research
hours per week): 4
Course outcomes:
CO1: Student will be able to define Inventory theory and Models.
CO2: Student will be able to define Quening theory and its characteristics, stochastic Processes under
steady and transient states. Study of M/M/1 and M/M/s quening models and Parametric Linear
Programming
CO3: Student will be able to analyse Network analysis, CPM and PERT.
CO4: Student will be able to define Game theory and Solution of rectangular game with saddle point,
Solution of 2×2 game without saddle point. Graphical method of solution for 2×n and m×2 games.
CO5: Student will be able to solve Integer Programming problem and Branch and Bound technique.
Unit Topics No. of
Lectures
I Game theory, Zero- Sum Game, Solution of rectangular game with saddle point, 20
Solution of 2×2 game without saddle point. Graphical method of solution for 2×n
and m×2 games. Integer Programming, Branch and Bound technique.
II Network analysis, CPM and PERT, Network components and general procedure 20
forconstruction of networks and numbering of events (Fulkerson's rule) . CPM
computation and determination of critical path.
III Inventory theory, economic order Quantity Models under various demands 20
having shortages and no shortages, Probabilistic Inventory models with discrete
or continuous demand. Simple replacement model for Equipments that
deteriorates with time in descreteand continuous form.
IV Quening theory and its characteristics, stochastic Processes under steady and
transient states. Study of M/M/1 and M/M/s quening models, Parametric Linear 15

Programming.
Suggested Readings:
1. Operations Research – kantiswarup, P.K.gupta, Man Mohan–Sultan Chand & sons, New Delhi
2. Operations Research (An Introduction) – Hamdy A. Taha – Pearson
3. Operations Research– R.K.Gupta–Krishna Prakasan
4. Operations Research –K.Nagrajan - New Age International Publications
 M.A./M.Sc. II (SEMESTER-IV), PAPER-II
FLUID DYNAMICS

Credit-4
Course Code: B031002T Core paper
Max. Marks: 25+75

Total No. of Lectures-Tutorials (in Course Title: FLUID DYNAMICS

hours per week): 4
Course outcomes:
CO1: The Students will be able to identify the fundamental concepts of Fluid dynamics and their role in
modern mathematics and applied contexts.
CO2: The Students will be able to apply the Fluid dynamics concepts to diverse situations in physics,
engineering, and other mathematical contexts.
Unit Topics No. of
Lectures
I Lagrangian and Eulerian methods to describe the fluid motion, Equation of continuity, 20
Boundary conditions, Stream Lines. Pathlines and streak lines, Velocity potential.
Irrotational and rotational motions.
II Euler's equations of motion, Pressure equation, Bernoulli's theorem, Impulsive actions,
Flow and circulation, The permanence of irrotational motion. Stream function. Irrotational 20
motion in two dimensions. Complex velocity potential. Sources, sinks, doublets, and their
images.
III The two-dimensional irrotational motion is produced by the motion of circular and elliptic
cylinders in a liquid, Kinetic energy of liquid, Milne-Thomson circle theorem. The 20
theorem of Blasius, Stoke's stream function.
IV Wave motion in gas, speed of sound, equation of motion of a gas, subsonic, sonic, super- 15
sonic flow of a gas, isentropic of a gas, shock formation
Suggested Readings:
1 F. Chorlton: Text Book of Fluid Dynamics, C.B.S. Publishers, Delhi,1985.
2 W.H. Besaint and A.S. Ramsey: A Treatise on Hydrodynamics, Part II, C.B.S. Publishers,
Delhi,1988.
3 B.G.Verma: Hydrodynamics, Pragati Prakashan, Meerut, 1995.
4 M.D. Raisinghania: Fluid Dynamics, S.Chand and Co, 2003
 M.A./M.Sc. II (SEMESTER-IV), PAPER-III
Special Functions
Course Code: B031003T Credit-5 Seventh Elective paper
Max. Marks: 25+75
Total No. of Lectures-Tutorials (in Course Title: Special Functions
hours per week): 4+1=5
Course outcomes:
CO1: Student will be able to define Fundamental System of Integrals, Singularity of a Linear Differential
Equation. Series solution to Legendre, Bessel differential equations by Frobenius method.
CO2: Student will be able to define Hermite equation and its solution, Generating function, Rodrigue’s
formula, Recurrence relations, Orthogonal Properties of Hermite Polynomials.
CO3: Student will be able to define Lagurre equation and its solution.
CO4: Student will be able to define Hypergeometric Functions and Series Solution.
Unit Topics No. of
Lectures
I Singularities: 15
Fundamental System of Integrals, Singularity of a Linear Differential Equation.
Solution in the neighbourhood of a singularity, Regular Integral, Series solution to
Legendre, Bessel differential equations by Frobenius method.
II Hermite Polynomial:
Hermite equation and its solution, Generating function, Rodrigue’s formula, 20
Recurrence relations, Orthogonal Properties of Hermite Polynomials
III Lagurre polynomial:
Lagurre equation and its solution, Generating function, Recurrence relations, 20
Orthogonal Properties of Hermite Polynomials.
IV Hypergeometric Function: 20
Hypergeometric Functions, Series Solution near zero, one and infinity. Integral Formula,
Confluent Hypergeometric function, Integral representation of Hypergeometric function,
Differentiation of Hypergeometric Function.
Suggested Readings:
1. Simmons, G.F., Differential Equations, Tata McGraw Hill.
2. Agarwal, Ravi P. and O' Regan D., An Introduction to Ordinary Differential Equations, Springer, 2000
3. Codington, E.A and Levinson, N., Theory of Ordinary Differential Equation, McGraw Hill.
 M.A./M.Sc. II (SEMESTER-IV), PAPER-III
DIFFERENTIAL GEOMETRY OF MANIFOLDS
Credit-5
Course Code: B031004T Seventh Elective paper
Max. Marks: 25+75
Total No. of Lectures-Tutorials (in Course Title: Differential Geometry of Manifolds
hours per week): 4+1=5
Course outcomes:
CO1: Students will be able to explain the concept of a manifold and give examples.
CO2: Students will be able to define Connections.
CO3: Students will be able to define Lie – bracket, Lie – derivative.
CO4: Students will be able to analyse Riemannian manifold, Riemannian connection, Riemannian
curvature tensor, Ricci tensor, scalar curvature, Bianchi identities, constant curvature, definition of
Einstein manifold, Geodesic in Riemannian manifold, Projective curvature tensor.
Unit Topics No. of
Lectures
I Definition and examples of differentiable manifold, differentiable function, 20
Tangent space, vector field.
II Connections, Affine connection and Covariant derivative, torsion and 20
curvature tensors, difference tensor of two connections.
III Lie – bracket, Lie – derivative, exterior product of two vectors, Exterior 20
algebra, Exterior derivative.
IV Definition of Riemannian manifold and examples, Riemannian connection, 15
Riemannian curvature tensor and Ricci tensor, scalar curvature, Bianchi
identities, constant curvature, definition of Einstein manifold, Geodesic in
Riemannian manifold, Projective curvature tensor.
Suggested Readings:
1 Quddus Khan : DifferenLal Geometry of manifolds ― PHI PublicaLons
2 H. S. Shukla & B. N. Prasad: DifferenLal Geometry of manifolds ― Vandana Prakashan.
 M.A./M.Sc. II (SEMESTER-IV), PAPER-III
Advanced Numerical Methods

Course Code: B031005T Credit-5 Seventh Elective Paper

Max. Marks: 25+75
Total No. of Lectures-Tutorials (in Course Title: Advanced Numerical Methods
hours per week): 4+1=5
Course outcomes:
CO1: Student will be able to solve System of Linear Algebraic Equations, ordinary differential equations,
and Partial differential equations.
CO2: The students will be able to understand and apply various iterative techniques for solving system of
algebraic equations.
CO3: The students will be able to analyze the consistency and convergence of a given numerical scheme.
CO4: The students will be able to explain what kind of numerical schemes are best suited for each type of
PDEs (hyperbolic, parabolic and elliptic) and the reasons behind these choices.
CO5: The students will be able to demonstrate familiarity with the basics of finite difference methods for the
numerical solution of partial differential equations.

Unit Topics No. of

Lectures
I Numerical Solution of System of Linear Equations: Gauss Elimination Method 20
with Partial and Complete Pivoting. Triangular factorisation methods. Iterative
methods: Jacobi method, Gauss-Seidel method and Gauss Jacobi method and their
convergence, diagonal dominance, Successive-Over Relaxation (SOR) method, Ill-
conditioned matrix.
II Numerical Solution of ordinary Differential equations: Numerical solution of ODE
by Picard’s, Euler’s and Runge-Kutta methods, Boundary value problems: Finite 20
difference method, Shooting method.
III Numerical Solution of Partial Differential equations: Classification of second order
general PDE, Difference method. Difference methods for Parabolic PDE. Heat 20
conduction equation and its numerical solutions with finite difference methods (Two
and three level difference methods).
IV Difference methods for Hyperbolic PDE. Wave equation and its numerical solutions 15
with finite difference methods (First order only). Difference methods for Elliptical
PDE. Dirichlet problem for Laplace equation and its numerical solutions with finite
difference methods.
Suggested Readings:
1. M. K. Jain, S. R. K. Iyengar – R. K. Jain, Numerical Methods for Scientific and Engineering Computation, New Age
International, 6th Edition 2012.
2. S.D. Conte and C. DeBoor, Elementary Numerical Analysis: An Algorithmic Approach, McGraw Hill, N.Y., 1980.
3.C. F. Gerald and P. O. Wheatly – Applied Numerical Analysis, Pearson Education, Inc., 1999
4.A. Ralston and P. Rabinowitz – A First Course in Numerical Analysis, 2nd Edition,
McGraw - Hill, New York, 1978
5. K.E. Atkinson, An Introduction to Numerical Analysis, John Wiley and Sons, 1989.
6. F.B.Hilderbrand, Introduction to Numerical Analysis, Dover Publication.
7. W.F. Ames, Numerical Methods for PDEs, Academic Press, N.Y., 1977.