MSC Mathematics
MSC Mathematics
Ins. Marks
Exam
Sem Course Course Title Hrs / Credit Total
Hrs Int. Ext.
Week
Core Course – I (CC) Algebra 6 5 3 25 75 100
Core Course – II (CC) Real Analysis 6 5 3 25 75 100
Ordinary Differential
Core Course – III (CC) 6 5 3 25 75 100
Equations
I Core Course – IV (CC) Graph Theory 6 5 3 25 75 100
Integral Equations,
Core Course - V (CC) Calculus of Variations and 6 5 3 25 75 100
Transforms
TOTAL 30 25 500
Core Course – VI (CC) Complex Analysis 6 5 3 25 75 100
Core Course – VII (CC) Linear Algebra 6 5 3 25 75 100
Partial Differential
Core Course – VIII(CC) 6 5 3 25 75 100
II Equations
Elective Course – I (EC) 6 3 3 25 75 100
Elective Course – II (EC) 6 3 3 25 75 100
TOTAL 30 21 500
Core Course – IX (CC) Classical Dynamics 6 5 3 25 75 100
Core Course – X (CC) Measure and Integration 6 5 3 25 75 100
Core Course – XI(CC) Topology 6 5 3 25 75 100
III Elective Course – III (EC) 6 3 3 25 75 100
Elective Course – IV (EC) 6 3 3 25 75 100
TOTAL 30 21 500
Core Course – XII (CC) Functional Analysis 6 5 3 25 75 100
Core Course – XIII (CC) Differential Geometry 6 5 3 25 75 100
Advanced Numerical
Core Course – XIV(CC) 6 5 3 25 75 100
IV Analysis
Elective Course – V (EC) 6 3 3 25 75 100
Project 6 5 - - - 100
TOTAL 30 23 500
GRAND TOTAL 120 90 2000
1
List of Elective Courses (For 2016 – 2017) :
Elective I Elective II
1 Advanced Probability Theory 1 Stochastic Processes
Tensor Analysis and Special Theory
2 Mathematical Modeling 2
of Relativity
3 Fuzzy sets and their Applications 3 Non linear Differential Equations
Elective III Elective IV
1 Design and Analysis of Algorithms 1 Financial Mathematics
2 Discrete Mathematics 2 Advanced Operations Research
3 Automata Theory 3 Combinatorics
Elective V
1 Algebraic Topology
2 Fluid Dynamics
3 Algebraic Number Theory
Note:
Core Papers - 10
Core Practical - 4
Elective Papers - 5
Project - 1
Note:
Note:
1. Theory
[ Internal 25 marks External 75 marks
2. Practical ” 40 marks ” 60 marks
3. Separate passing minimum is prescribed for Internal and External
a) The passing minimum for CIA shall be 40% out of 25 marks (i.e. 10
marks)
b) The passing minimum for University Examinations shall be 40% out of
75 marks (i.e. 30 marks)
c) The passing minimum not less than 50% in the aggregate.
ALGEBRA
Objectives
UNIT II
RING THEORY : Homomorphisms -Ideals and quotient rings – More ideals and
quotient rings –Euclidean Rings-A particular Euclidean Ring.
UNIT III
UNIT IV
UNIT V
TEXT BOOK
REFERENCE BOOKS
4
CORE COURSE III
ORDINARY DIFFERENTIAL EQUATIONS
Objectives
1. To give an in-depth knowledge of differential equations and their applications.
2. To study the existence, uniqueness, stability behavior of the solutions of the ODE
UNIT I
The general solution of the homogeneous equation– he use of one known solution to
find another – The method of variation of parameters – Power Series solutions. A
review of power series– Series solutions of first order equations – Second order linear
equations; Ordinary points.
UNIT II
Regular Singular Points – Gauss’s hypergeometric equation – The Point at infinity -
Legendre Polynomials – Bessel functions – Properties of Legendre Polynomials and
Bessel functions.
UNIT III
Linear Systems of First Order Equations – Homogeneous Equations with Constant
Coefficients – The Existence and Uniqueness of Solutions of Initial Value Problem for
First Order Ordinary Differential Equations – The Method of Solutions of Successive
Approximations and Picard’s Theorem.
UNIT IV
TEXT BOOKS
G.F. Simmons, Differential Equations with Applications and Historical Notes, TMH,
New Delhi, 1984.
UNIT – I Chapter 3: Sections 15, 16, 19 and Chapter 5: Sections 25 to 27
UNIT – II Chapter 5 : Sections 28 to 31 and Chapter 6: Sections 32 to 35
UNIT – III Chapter 7: Sections 37, 38 and Chapter 11: Sections 55, 56
UNIT – IV Chapter 4: Sections 22 to 24
UNIT – V Chapter 8: Sections 42 to 44
REFERENCES
1. W.T. Reid, Ordinary Differential Equations, John Wiley & Sons, New York, 1971.
2. E.A. Coddington and N. Levinson, Theory of Ordinary Differential Equaitons,
McGraw Hill Publishing Company, New York, 1955.
*****
5
CORE COURSE IV
GRAPH THEORY
Objectives
Unit II Connectivity
Vertex Cuts and Edge Cuts - Connectivity and Edge - Connectivity, Trees:Definitions,
Characterization and Simple Properties - Counting the Number of Spanning Trees -
Cayley’s Formula.
Vertex Independent Sets and Vertex Coverings - Edge Independent Sets -Matchings
and Factors - Eulerian Graphs - Hamiltonian Graphs.
Unit V Planarity
Planar and Nonplanar Graphs - Euler Formula and its Consequences - K5 and K3,3
are Nonplanar Graphs - Dual of a Plane Graph - The Four-Colour Theorem and the
Heawood Five-Colour Theorem-Kuratowski’s Theorem.
Textbook
References
1. J.A. Bondy, U.S.R. Murty, Graph Theory with Applications, Mac MilanPress Ltd.,
1976.
2. Gary Chartrand, Linda Lesniak, Ping Zhang, Graphs and Digraph,CRC press,2010.
3. F.Harary, Graph Theory, Addison - Wesley, Reading, Mass., 1969.
*****
6
CORE COURSE V
INTEGRAL EQUATIONS, CALCULUS OF VARIATIONS AND TRANSFORMS
Objectives.
1. To introduce the concept of calculus of variations and integral equations
and their applications.
2. To study the different types of transforms and their properties.
UNIT I
Calculus of variations – Maxima and Minima – the simplest case – Natural boundary
and transition conditions - variational notation – more general case – constraints and
Lagrange’s multipliers – variable end points – Sturm-Liouville problems.
UNIT – II
Fourier transform - Fourier sine and cosine transforms - Properties Convolution -
Solving integral equations - Finite Fourier transform - Finite Fourier sine and cosine
transforms - Fourier integral theorem - Parseval's identity.
UNIT III
Hankel Transform : Definition – Inverse formula – Some important results for Bessel
function – Linearity property – Hankel Transform of the derivatives of the function –
Hankel Transform of differential operators – Parseval’s Theorem
UNIT IV
Linear Integral Equations - Definition, Regularity conditions – special kind of kernels –
eigen values and eigen functions – convolution Integral – the inner and scalar product
of two functions – Notation – reduction to a system of Algebraic equations – examples–
Fredholm alternative - examples – an approximate method.
UNIT V
Method of successive approximations: Iterative scheme – examples – Volterra Integral
equation – examples – some results about the resolvent kernel. Classical Fredholm
Theory: the method of solution of Fredholm – Fredholm’s first theorem – second
theorem – third theorem.
TEXT BOOKS
[1] Ram.P.Kanwal – Linear Integral Equations Theory and Practise, Academic Press
1971.
[2] F.B. Hildebrand, Methods of Applied Mathematics II ed. PHI, ND 1972.
[3] A.R. Vasishtha, R.K. Gupta, Integral Transforms, Krishna Prakashan Media Pvt
Ltd, India, 2002.
UNIT – I Chapter 2: Sections 2.1 to 2.9 of [2]
UNIT – II Chapter 7 of [3]
UNIT – III Chapter 9 of [3]; UNIT – IV -Chapters 1 and 2 of [1]
UNIT – V Chapters 3 and 4 of [1]
REFERENCES
[1] S.J. Mikhlin, Linear Integral Equations (translated from Russian), Hindustan Book
Agency, 1960.
[2] I.N. Snedden, Mixed Boundary Value Problems in Potential Theory, North Holland,
1966.
*****
7
CORE COURSE VI
COMPLEX ANALYSIS
Objectives
1. To learn the various intrinsic concepts and the theory of Complex Analysis.
2. To study the concept of Analyticity, Complex Integration and Infinite Products in
depth.
UNIT I
Elementary Point Set Topology: Sets and Elements – Metric Spaces – Connectedness –
Compactness – Continuous Functions – Topological Spaces; Conformality: Arcs and
Closed Curves – Analytic Functions in Regions – Conformal Mapping – Length and
Area; Linear Transformations: The Linear Group – The Cross Ratio – Symmetry
UNIT II
Fundamental theorems in complex integration: Line Integrals – Rectifiable Arcs – Line
Integrals as Functions of Arcs – Cauchy’s Theorem for a Rectangle – Cauchy’s
Theorem in a Disk; Cauchy’s Integral Formula: The Index of a Point with Respect to a
Closed Curve – The Integral Formula – Higher Derivatives.
UNIT III
Local Properties of Analytic Functions - Removable Singularities - Taylor’s Theorem –
Integral representation of the nth term - Zeros and Poles – Algebraic order of f(z) –
Essential Singularity - The Local Mapping – The Open Mapping Theorem - The
Maximum Principle.
UNIT IV
The General Form of Cauchy’s Theorem: Chains and Cycles – Simple Connectivity –
Homology – The General Statement of Cauchy’s Theorem – Proof of Cauchy’s Theorem
– Locally Exact Differentials – Multiply Connected Regions; The Calculus of Residues:
The Residue Theorem – The Argument Principle – Evaluation of Definite Integrals
UNIT V
Harmonic Functions: Definition and Basic Properties – The Mean-value Property –
Poisson’s Formula – Schwarz’s Theorem – The Reflection Principle; Power series
expansions-Weierstrass’s Theorem – The Taylor Series – The Laurent Series;
TEXT BOOK
Lars V. Ahlfors, Complex Analysis, Third Ed. McGraw-Hill Book Company, Tokyo,
1979.
UNIT – I Chapter 3: 1.1-1.6, 2.1-2.4,3.1-3.3
UNIT – II Chapter 4: 1.1-1.5, 2.1-2.3
UNIT – III Chapter 4: 3.1, 3.2, 3.3,3.4
UNIT – IV Chapter 4: 4.1-4.7, 5.1-5.3
UNIT – V Chapter 4: 6.1-6.5, and Chapter 5: 1.1-1.3
REFERENCES
1. Serge Lang, Complex Analysis, Addison Wesley, 1977.
2. S. Ponnusamy, Foundations of Complex Analysis, Narosa Publishing House, New Delhi,
1997.
3. Karunakaran, Complex Analysis,Alpha Science international Ltd,Second
edition,2005.
*****
8
CORE COURSE VII
LINEAR ALGEBRA
Objectives
1. To give the students a thorough knowledge of the various aspects of Linear Algebra
2. To train the students in problem-solving as a preparatory for competitive exam.
UNIT I: Matrices:
Systems of linear Equations - Matrices and Elementary Row operations -Row-reduced
echelon Matrices - Matrix Multiplication - Invertible Matrices -Bases and Dimension.
(Only revision of Vector spaces and subspaces).
Unit II: Linear transformations:
The algebra of linear transformations - Isomorphism of Vector Spaces -
Representations of Linear Transformations by Matrices - Linear Functionals - The
Double Dual - The Transpose of a Linear Transformation.
Unit III: Algebra of polynomials:
The algebra of polynomials - Lagrange Interpolation - Polynomial Ideals -The prime
factorization of a polynomial - Commutative rings – Determinant functions.
Unit IV: Determinants:
Permutations and the uniqueness of determinants - Classical Adjoint of a (square)
matrix - Inverse of an invertible matrix using determinants -Characteristic values -
Annihilating polynomials.
Unit V: Diagonalization:
Invariant subspaces - Simultaneous triangulation and simultaneous Diagonalization
Direct-sum Decompositions - Invariant Direct sums – Primary Decomposition
theorem.
TEXTBOOK
1. Kenneth Hoffman and Ray Alden Kunze, Linear Algebra, Second Edition, Prentice
Hall of India Private Limited, New Delhi, 1975.
UNIT I Chapter 1 & 2 1.2-1.6 and 2.3
UNIT II Chapter 3
UNIT III Chapter 4 & 5 4.1 - 4.5 and 5.1 - 5.2
UNIT IV Chapter 5 & 6 5.3, 5.4 and 6.1 - 6.3
UNIT V Chapter 6 6.4 - 6.8
REFERENCES
1. S. Kumaresan, Linear Algebra: A Geometric Approach, Prentice-Hall of India
Ltd, 2004.
2. V. Krishnamurthy, V.P. Mainra, J.L. Arora, Introduction to Linear Algebra,
East West Press Ltd, 1985.
3. A.R. Rao, P. Bhimashankaram, Linear Algebra, Second Edition, Tata
McGraw Hill, 2000.
4. Edgar G.Goodaire, Linear Algebra-Pure & Applied World Scientific,
Cambridge University Press India Ltd, 2014
*****
9
CORE COURSE VIII
PARTIAL DIFFERENTIAL EQUATIONS
Objectives
1. To give an in-depth knowledge of solving partial differential equations and
apply them in scientific and engineering problems.
2. To study the other aspects of PDE
UNIT I
Partial differential equations- origins of first order Partial differential equations-
Cauchy’s problem for first order equations- Linear equations of the first order- Integral
surfaces Passing through a Given curve- surfaces Orthogonal to a given system of
surfaces -Non linear Partial differential equations of the first order.
UNIT II
Cauchy’s method of characteristics- compatible systems of first order equations-
Charpits method- Special types of first order equations- Solutions satisfying given
conditions- Jacobi’s method.
UNIT III
Partial differential equations of the second order : The origin of second order equations
–second order equations in Physics – Higher order equations in Physics - Linear partial
differential equations with constant co-efficient- Equations with variable coefficients-
Characteristic curves of second order equations
UNIT IV
Characteristics of equations in three variables- The solution of Linear Hyperbolic
equations-Separation of variables. The method of Integral Transforms – Non Linear
equations of the second order.
Unit V
Laplace equation : Elementary solutions of Laplace’s equations-Families of
equipotential Surfaces- Boundary value problems-Separation of variables –Problems
with Axial Symmetry.
TEXT BOOK
Ian N. Sneddon,Elements of Partial differential equations, Dover Publication –INC,
New York, 2006.
UNIT I Chapter II Sections 1 to 7
UNIT II Chapter II Sections 8 to 13
UNIT III Chapter III Sections 1 to 6
UNIT IV Chapter III Sections 7 to 11
UNIT V Chapter IV Sections 2 to 6
REFERENCES
1. M.D.Raisinghania, Advanced Differential Equations , S.Chand and company Ltd.,
New Delhi,2001.
2. E.T.Copson, Partial Differential Equations, Cambridge University Press
*****
10
ELECTIVE I (1)
(Any one)
ADVANCED PROBABILITY THEORY
Objectives:
1. To make the students to understand about fields, σ-fields and random variables.
2. To enable the students to learn about expectations, convergence in random
variables and distribution functions.
Unit I Fields and σ Fields:
*****
11
ELECTIVE I (2)
MATHEMATICAL MODELING
Objectives:
Linear Growth and Decay Models – Non-Linear Growth and Decay Models –
Compartment Models – Dynamics problems – Geometrical problems.
TEXT BOOK
J.N. Kapur, Mathematical Modelling, Wiley Eastern Limited, New Delhi, 1988.
REFERENCES
Objectives:
1. To introduce the concept of fuzzy theory and study its application in real problems
2. To study the uncertainty environment through the fuzzy sets that incorporates
imprecision and subjectivity into the model formulation and solution process.
UNIT I From Classical Sets To Fuzzy Sets, Fuzzy Sets Verses Crisp Sets:
Fuzzy sets: Basic types – Fuzzy sets: Basic Concepts –Additional Properties of α – cuts-
Extension Principle for fuzzy sets .
TEXT BOOK
George J. Klir and Bo Yuan, Fuzzy sets and Fuzzy Logic Theory and Applications,
Prentice Hall of India, (2005).
UNIT I Chapter 1 Sections 1.3, 1.4, Chapter :2 Sections 2.1 and 2.3
UNIT II Chapter 3 Sections 3.1, 3.2, 3.3, 3.4, 3.5.
UNIT III Chapter 4 Sections 4.1,4.2, 4.3, 4.4.
UNIT IV Chapter 5 Sections 5.3 ,5.4, 5.5, 5.6, 5.7, 5.8.
UNIT V Chapter 15 Sections 15.2,15.3, 15.6, 15.7
REFERENCES
1. H.J. Zimmermann, Fuzzy Set Theory and its Applications, Allied Publishers Limited
(1991).
2. M. Ganesh, Introduction to Fuzzy sets and Fuzzy logic, Prentice Hall of India, New
Delhi (2006).
*****
13
ELECTIVE II (1)
(Any one)
STOCHASTIC PROCESSES
Objectives
1. To understand the stochastic models for many real life probabilistic
situations.
2. To learn the well known models like birth-death and queuing to reorient the
knowledge of stochastic processes.
UNIT I
Stochastic Processes: Some notions – Specification of Stochastic processes –
Stationary processes – Markov Chains – Definitions and examples – Higher Transition
probabilities – Generalization of independent Bernoulli trails – Sequence of chain –
Dependent trains.
UNIT II
Markov chains : Classification of states and chains – determination of Higher
transition probabilities – stability of a Markov system – Reducible chains – Markov
chains with continuous state space.
UNIT III
Markov processes with Discrete state space : Poisson processes and their extensions –
Poisson process and related distribution – Generalization of Poisson process- Birth
and Death process – Markov processes with discrete state space (continuous time
Markov Chains).
UNIT IV
Renewal processes and theory : Renewal process – Renewal processes in continuous
time – Renewal equation – stopping time – Wald’s equation – Renewal theorems.
UNIT V
Stochastic processes in Queuing – Queuing system – General concepts – the queuing
model M/M/1 – Steady state Behaviour – transient behaviour of M/M/1 Model – Non-
Markovian models - the model GI/M/1.
TEXT BOOK
1. J. Medhi,Stochastic Processes, New age international pblishers,New Delhi–
Second edition.
UNIT I Ch. II & Ch.III Sec 2.1 to 2.3, Sec 3.1 to 3.3
UNIT II Ch III – Sec 3.4 tp 3.6, 3.8, 3.9 and 3.11
UNIT III Ch IV : Sec 4.1 to 4.5
UNIT IV Ch VI : Sec 6.1 to 6.5
UNIT V Ch X : Sec 10.1 to 10.3, 10.7 and 10.8 (omit sec 10.2.3 & 10.2.3.1)
REFERENCES
1. Samuel Karlin, Howard M. Taylor, A first course in stochastic processes, Academic
press, Second Edition,1975.
2. Narayan Bhat , Elements of Applied Stochastic Processes,John Wiley ,1972.
3. N.V. Prabhu, Stochastic Processes, Macmillan (NY).
*****
14
ELECTIVE II (2)
TENSOR ANALYSIS AND SPECIAL THEORY OF RELATIVITY
Objectives.
1. To introduce the notion of Tensor and study its properties.
2. To study the theory of relativity.
UNIT I
Invariance - Transformations of coordinates and its properties - Transformation by
invariance - Transformation by covariance and contra variance - Covariance and
contra variance - Tensor and Tensor character of their laws - Algebras of tensors -
Quotient tensors - Symmetric and skew symmetric tensors – Relative tensors.
UNIT II
Metric Tensor - The fundamental and associated tensors - Christoffel's symbols -
Transformations of Chrisffel's symbols- Covariant Differentiation of Tensors -
Formulas for covariant Differentiation- Ricci Theorem - Riemann -Christoffel Tensor
and their properties.
UNIT III
Einstein Tensor- Riemannian and Euclidean Spaces (Existence Theorem)-The e-
systems and the generalized Kronecker deltas - Application of the e-systems.
UNIT IV
Special Theory of Relativity: Galilean Transformation - Maxwell's equations - The ether
Theory – The Principle of Relativity Relativistic Kinamatics : Lorentz Transformation
equations - Events and simultaneity - Example Einstein Train - Time dilation -
Longitudinal Contraction -Invariant Interval - Proper time and Proper distance – World
line - Example - twin paradox - addition of velocities - Relativistic Doppler effect.
UNIT V
Relativistic Dynamics : Momentum – energy – Momentum-energy four vector – Force –
Conservation of Energy – Mass and energy – Example – inelastic collision – Principle of
equivalence – Lagrangian and Hamiltonian formulations .
Accelerated Systems : Rocket with constant acceleration – example – Rocket with
constant thrust .
TEXT BOOK
1. I.S. Sokolnikoff, Tensor Analysis, John Wiley and Sons, New York, 1964
2. D. Greenwood, Classical Dynamics, Prentice Hall of India, New Delhi, 1985
UNIT I Chapter 2 : Sections 18 to 28 of [1]
UNIT II Chapter 2 : Sections 29 to 37 of [1]
UNIT III Chapter 2 : Section 38 to 41 of [1]
UNIT IV Chapter 7 : Sections 7.1 and 7.2 of [2]
UNIT V Chapter 7 : Sections 7.3 and 7.4 of [2]
REFERENCES
1. J.L. Synge and A.Schild, Tensor Calculus, Toronto, 1949.
2. A.S. Eddington, The Mathematical Theory of Relativity, Cambridge University Press, 1930.
3. P.G. Bergman, An Introduction to Theory of Relativity, New york, 1942.
4. C.E. Weatherburn, Riemannian Geometry and Tensor Calculus, Cambridge, 1938
*****
15
ELECTIVE II (3)
Objectives.
First order systems in two variables and linearization: The general phase plane-some
population models – Linear approximation at equilibrium points – Linear systems in
matrix form.
Unit II
Averaging Methods: An energy balance method for limit cycles – Amplitude and
frequency estimates – slowly varying amplitudes – nearly periodic solutions - periodic
solutions: harmony balance – Equivalent linear equation by harmonic balance –
Accuracy of a period estimate.
Unit III
Perturbation Methods: Outline of the direct method – Forced Oscillations far from
resonance - Forced Oscillations near resonance with Weak excitation – Amplitude
equation for undamped pendulum – Amplitude Perturbation for the pendulum
equation – Lindstedt’s Method – Forced oscillation of a self – excited equation – The
Perturbation Method and Fourier series.
Unit IV
Unit V
Stability: Poincare stability – solutions, paths and norms – Liapunov stability Stability
of linear systems – Comparison theorem for the zero solutions of nearly – linear
systems.
TEXT BOOK
REFERENCES
*****
16
CORE COURSE IX
CLASSICAL DYNAMICS
Objectives
UNIT I
UNIT II
UNIT III
UNIT IV
UNIT V
TEXT BOOKS.
REFERENCES.
*****
17
CORE COURSE X
Objectives
UNIT II
UNIT III
UNIT IV
UNIT V
TEXT BOOKS
1. G.De Barra, Measure Theory and Integration, New age international (p) Limited.
REFERENCES
18
CORE COURSE XI
TOPOLOGY
Objectives
1. To study the concepts concerned with properties that are preserved under
continuous deformations of objects.
2. To train the students to develop analytical thinking and the study of
continuity and connectivity.
UNIT I TOPOLOGICAL SPACES:
Topological spaces - Basis for a topology - The order topology - The product topology
on X x Y - The subspace topology - Closed sets and limit points.
Connected spaces- connected subspaces of the Real line - Components and local
connectedness.
UNIT IV COMPACTNESS:
Compact spaces - compact subspaces of the Real line - Limit Point Compactness –
Local Compactness.
The countability Axioms - The separation Axioms - Normal spaces - The Urysohn
Lemma - The Urysohn metrization Theorem - The Tietz extension theorem.
TEXT BOOK
James R. Munkres, Topology (2nd Edition) Pearson Education Pvt. Ltd., New Delhi-
2002 (Third Indian Reprint).
UNIT – I Chapter 2: Sections 12 to 17
UNIT – II Chapter 2 : Sections 18 to 21 (Omit Section 22)
UNIT – III Chapter 3 : Sections 23 to 25.
UNIT – IV Chapter 3 : Sections 26 to 29.
UNIT – V Chapter 4 : Sections 30 to 35.
REFERENCES
19
ELECTIVE III (1)
(Any one)
Objectives
Unit I Algorithms:
Linked linear lists - operations on linked linear lists - circularly linked lists -doubly
linked linear lists - Non-linear data structures: trees - binary trees -operations on
binary trees - storage representation and manipulations of binary trees.
Divide and conquer - General method - Binary search - Finding the maximum and
minimum in a set of items - Merge sort - Quick sort - Selection sort. Basic Traversal
and Search Techniques for graphs: Breadth First Search – Depth First Search.
Unit V Interpolations:
TEXTBOOKS
REFERENCES
1. A.V. Aho, J.E.Hopcroft, J.D. Ullman, The Design and Analysis of Computer
Algorithms, Addison-Wesley Publ. Comp., 1974.
2. Seymour E.Goodman and S.T. Hedetniemi, Introduction to the design and analysis
of algorithms, McGraw Hill International Edition, 2002.
*****
20
ELECTIVE III (2)
DISCRETE MATHEMATICS
Objectives
1. To study the concepts like Boolean algebra, coding theory.
2. To introduce the different notions grammar.
Unit I Relations and Functions:
Binary relations, equivalence relations and partitions, partial order relations, inclusion
and exclusion principle, Hasse diagram, Pigeon hole principle. Functions, inverse
functions, compositions of functions, recursive functions.
Unit II Mathematical Logic:
Logic operators, Truth tables, Theory of inference and deduction, mathematical
calculus, predicate calculus, predicates and qualifiers.
Unit III Lattices:
Lattices as Partially Ordered Sets. Their Properties, Lattices as algebraic Systems, Sub
lattices, Direct Product and homomorphism. Some Special Lattices - Complete,
Complemented and Distributive Lattices, Isomorphic Lattices.
Unit IV Boolean algebra:
Various Boolean identities, the switching Algebra Example, Sub Algebras, Direct
Production and Homomorphism. Boolean Forms and their Equivalence, Midterm
Boolean forms, Sum of Products, Canonical Forms. Minimization of Boolean
Functions. The Karnuagh Map Method.
Coding Theory: Coding of binary information and error detection, Group codes,
decoding and error correction.
Unit V Grammar and Languages:
Phrase structure grammars, rewriting rules, derivation sentential forms, language
generated by grammar, regular, context free and context sensitive grammar and
languages.
TEXT BOOKS
1. Trembly. J.P & Manohar. P., “Discrete Mathematical Structures with Applications
to Computer Science” McGraw- Hill.
2. Liu, C.L., “Elements of Discrete Mathematics”, McGraw-Hill Book co.
3. K.D Joshi, “Foundations of Discrete Mathematics”, Wiley Eastern Limited.
REFERENCES
1. Kolman, Busy & Ross, “Discrete Mathematical Structures”, PHI.
2. Alan Doer: “Applied Discrete Structure for Computer Science”, Galgotia Publications
Pvt. Ltd.
3. Seymour Lipschutz, M. Lipson: “Discrete Mathematics”, McGraw-Hill Edition.
4. Kenneth G. Roden: “Discrete Mathematics and its Applications”, McGraw- Hill
international editions, Mathematics Series.
*****
21
ELECTIVE III (3)
AUTOMATA THEORY
Objectives
1. To make the students to understand the nuances of Automata and
Grammar.
2. To make them to understand the applications of these techniques in
computer science.
Unit I: - Finite Automata and Regular expressions:
*****
22
ELECTIVE IV (1)
(Any one)
FINANCIAL MATHEMATICS
Objectives
1. To study financial mathematics through various models.
2. To study the various aspects of financial mathematics.
UNIT I SINGLE PERIOD MODELS:
Definitions from Finance - Pricing a forward - One-step Binary Model - a ternary Model
- Characterization of no arbitrage - Risk-Neutral Probability Measure.
UNIT II BINOMIAL TREES AND DISCRETE PARAMETER MARTINGALES:
Multi-period Binary model - American Options - Discrete parameter martingales and
Markov processes - Martingale Theorems - Binomial Representation Theorem -
Overturn to Continuous models.
UNIT III BROWNIAN MOTION:
Definition of the process - Levy's Construction of Brownian Motion - The Reflection
Principle and Scaling - Martingales in Continuous time.
UNIT IV STOCHASTIC CALCULUS:
Non-differentiability of Stock prices - Stochastic Integration - Ito's formula -
Integration by parts and Stochastic Fubini Theorem - Girsanov Theorem - Brownian
Martingale Representation Theorem – Geometric Brownian Motion - The Feynman -
Kac Representation.
UNIT V BLOCK-SCHOLES MODEL:
Basic Block-Scholes Model - Block-Scholes price and hedge for European Options -
Foreign Exchange - Dividends - Bonds - Market price of risk.
TEXT BOOK
Alison Etheridge ,A Course in Financial Calculus, , Cambridge University Press,
Cambridge, 2002.
REFERENCES
1. Martin Boxter and Andrew Rennie, Financial Calculus: An Introduction to
Derivatives Pricing, Cambridge University Press, Cambridge, 1996.
2. Damien Lamberton and Bernard Lapeyre, (Translated by Nicolas Rabeau and
Farancois Mantion),
3. Introduction to Stochastic Calculus Applied to Finance, Chapman and Hall, 1996.
4. Marek Musiela and Marek Rutkowski, Martingale Methods in Financial Modeling,
Springer Verlag, New York, 1988.
5. Robert J.Elliott and P.Ekkehard Kopp, Mathematics of Financial Markets,
Springer Verlag, New York, 2001 (3rd Printing)
*****
23
ELECTIVE IV (2)
Objectives:
Unit I
Integer Programming.
Unit II
Unit III
Unit IV
Inventory Models.
Unit V
Non-linear Programming algorithms.
TEXT BOOK
REFERENCES
24
ELECTIVE IV (3)
COMBINATORICS
Objectives:
1. To introduce the notion of different types of distributions of objects and
generating functions.
2. To study the Polya’s enumeration theorems.
UNIT I
Permutations and combinations - distributions of distinct objects ~
distributions of non distinct objects - Stirlings formula.
UNIT II
Generating functions. - generating function for combinations - enumerators for
permutations - distributions of distinct objects into non-distinct cells -
partitions of integers – the Ferrer’s graphs - elementary relations.
UNIT III
Recurrence relation - linear recurrence relations with constant coefficients
solutions by the technique of generating functions - a special class of nonlinear
difference equations - recurrence relations with two indices.
UNIT IV
The principle of inclusion and exclusion - general formula - permutations with
restriction on relative positions - derangements - the rook polynomials -
permutations with forbidden positions.
UNIT V
Polya's theory of counting - equivalence classes under a permutation group
Burnside theorem - equivalence classes of functions - weights and inventories
of functions - Polya' s fundamental theorem – generation of Polya’s theorem.
TEXT BOOK
Introduction of Combinatorial Mathematics, C.L. Liu, McGraw Hill,1968.
Chapters 1 to 5.
REFERENCES
1. Combinatorial Theory, Marshall Hall Jr.,John Wiley & Sons, second edition.
2. Combinatorial Mathematics, H.J. Rayser, Carus Mathematical Monograph,
No.14.
*****
25
CORE COURSE XII
FUNCTIONAL ANALYSIS
Objectives
1. To study the three structure theorems of Functional Analysis viz., Hahn-Banach
theorem, Open mapping theorem and Uniform boundedness principle.
2. To introduce Hilbert spaces and operator theory leading to the spectral theory of
operators on a Hilbert space.
UNIT I
Algebraic Systems: Groups – Rings – The structure of rings – Linear spaces – The
dimension of a linear space – Linear transformations – Algebras – Banach Spaces : The
definition and some examples – Continuous linear transformations – The Hahn-
Banach theorem – The natural imbedding of N in N** - The open mapping theorem –
The conjugate of an operator
UNIT II
Hilbert Spaces: The definition and some simple properties – Orthogonal complements –
Orthonormal sets - The conjugate space H* - The adjoint of an operator – Self-adjoint
operators – Normal and unitary operators – Projections
UNIT III
Finite-Dimensional Spectral Theory: Matrices – Determinants and the spectrum of an
operator – The spectral theorem – A survey of the situation
UNIT IV
General Preliminaries on Banach Algebras: The definition and some examples –
Regular and singular elements – Topological divisors of zero – The spectrum – The
formula for the spectral radius – The radical and semi-simplicity
UNIT V
The Structure of Commutative Banach Algebras : The Gelfand mapping – Applications
of the formula r(x) = lim || xn ||1/n - Involutions in Banach Algebras – The Gelfand-
Neumark theorem.
TEXT BOOK
G.F.Simmons,Introduction to Topology and Modern Analysis, McGraw-Hill
International Ed. 1963.
UNIT – I Chapters 8 and 9
UNIT – II Chapter 10
UNIT – III Chapter 11
UNIT – IV Chapter 12
UNIT – V Chapter 13
REFERENCES
1 Walter Rudin, Functional Analysis, TMH Edition, 1974.
2 B.V. Limaye, Functional Analysis, Wiley Eastern Limited, Bombay, Second Print,
1985.
3 K.Yosida, Functional Analysis, Springer-Verlag, 1974.
4 Laurent Schwarz, Functional Analysis, Courant Institute of Mathematical Sciences,
New York University, 1964.
*****
26
CORE COURSE XIII
DIFFERENTIAL GEOMETRY
Objectives
1. To introduce the notion of surfaces and their properties.
2. To study geodesics and differential geometry of surfaces.
UNIT I SPACE CURVES:
Definition of a space curve - Arc length - tangent - normal and binormal - curvature
and torsion - contact between curves and surfaces- tangent surface- involutes and
evolutes- Intrinsic equations - Fundamental Existence Theorem for space curves-
Helics.
UNIT II INTRINSIC PROPERTIES OF A SURFACE:
Definition of a surface - curves on a surface - Surface of revolution - Helicoids -
Metric- Direction coefficients - families of curves- Isometric correspondence- Intrinsic
properties.
UNIT III GEODESICS:
Geodesics - Canonical geodesic equations - Normal property of geodesics- Existence
Theorems - Geodesic parallels - Geodesics curvature- Gauss- Bonnet Theorem -
Gaussian curvature- surface of constant curvature.
UNIT IV NON INTRINSIC PROPERTIES OF A SURFACE:
The second fundamental form- Principal curvature - Lines of curvature - Developable –
Developable associated with space curves and with curves on surface - Minimal
surfaces - Ruled surfaces.
UNIT V DIFFERENTIAL GEOMETRY OF SURFACES:
Compact surfaces whose points are umblics- Hilbert's lemma - Compact surface of
constant curvature - Complete surface and their characterization - Hilbert's Theorem -
Conjugate points on geodesics.
TEXT BOOK
T.J. Willmore, An Introduction to Differential Geometry, Oxford University Press,(17th
Impression) New Delhi 2002. (Indian Print).
UNIT – I Chapter I : Sections 1 to 9.
UNIT – II Chapter II: Sections 1 to 9.
UNIT – III Chapter II: Sections 10 to 18.
UNIT – IV Chapter III: Sections 1 to 8.
UNIT – V Chapter IV : Sections 1 to 8
REFERENCES
1. Struik, D.T. Lectures on Classical Differential Geometry, Addison - Wesley, Mass.
1950.
2. Kobayashi S. and Nomizu. K. Foundations of Differential Geometry, Interscience
Publishers, 1963.
3. Wihelm Klingenberg: A course in Differential Geometry, Graduate Texts in
Mathematics, Springer Verlag, 1978.
4. J.A. Thorpe Elementary topics in Differential Geometry, Under - graduate Texts in
Mathematics, Springer - Verlag 1979.
*****
27
CORE COURSE XIV
ADVANCED NUMERICAL ANALYSIS
Objectives.
1. To know the theory behind various numerical methods.
2. To apply these methods to solve mathematical problems.
Unit I
Transcendental and polynomial equations:Rate of convergence – Secant Method, Regula Falsi
Method, Newton Raphson Method, Muller Method and Chebyshev Method. Polynomial
equations: Descartes’ Rule of Signs - Iterative Methods: Birge-Vieta method, Bairstow’s method
Direct Method: Graeffe’s root squaring method.
Unit II
System of Linear Algebraic equations and Eigen Value Problems: Error Analysis of Direct
methods – Operational count of Gauss elimination, Vector norm, Matrix norm, Error Estimate.
Iteration methods - Jacobi iteration method, Gauss Seidel Iteration method, Successive Over
Relaxation method - Convergence analysis of iterative methods, Optimal Relaxation parameter
for the SOR method. Finding eigen values and eigen vectors – Jacobi method for symmetric
matrices and Power methods only.
Unit III
Interpolation and Approximation:- Hermite Interpolations, Piecewise and Spline Interpolation –
piecewise linear interpolation, piecewise quadratic interpolation, piecewise cubic interpolation,
spline interpolation-cubic Spline interpolation. Bivariate Interpolation- Lagrange Bivariate
interpolation. Least square approximation.
Unit IV
Differentiation and Integration: Numerical Differentiation – Optimum choice of Step length –
Extrapolation methods – Partial Differentiation. Numerical Integration: Methods based on
undetermined coefficients - Gauss Legendre Integration method and Lobatto Integration
Methods only.
Unit V
Ordinary differential equations – Singlestep Methods: Local truncation error or Discretization
Error, Order of a method, Taylor Series method, Runge-Kutta methods: Explicit Runge–Kutta
methods– Minimization of Local Truncation Error, System of Equations, Implicit Runge-Kutta
methods. Stability analysis of single step methods (RK methods only).
TEXT BOOKS
M.K. Jain, S.R.K. Iyengar and R.K. Jain, Numerical Methods for Scientific and Engineering
Computation, New Age International (p) Limited Publishers, New Delhi, Sixth Edition 2012.
Unit I Chapter 2 § 2.5 (Pages 41-52), 2.9 ( Pages 83-99)
Unit II Chapter 3 § 3.3( Pages 134-140), 3.4( Pages 146-164), 3.5(Pages 170-173),
3.7 ( Pages179-185) and 3.11 (Pages 196-198)
Unit III Chapter 4 § 4.5 - 4.7 & 4.9 (Pages 284-290)
Unit IV Chapter 5 § 5.2 - 5.5(Pages 320-345) and 5.8(pages 361 – 365 and 380-386)
Unit V Chapter 6 §6.4(Pages 434-459) and 6.5(Pages 468-475)
REFERENCES
1. Kendall E. Atkinson, An Introduction to Numerical Analysis, II Edn., John Wiley & Sons,
1988.
2. M.K. Jain, Numerical Solution of Differential Equations, II Edn., New Age International Pvt
Ltd., 1983.
3. Samuel. D. Conte, Carl. De Boor, Elementary Numerical Analysis, Mc Graw-Hill
International Edn., 1983.
*****
28
ELECTIVE V (1)
(Any one)
ALGEBRAIC TOPOLOGY
Objectives:
UNIT I
UNIT II
UNIT III
UNIT IV
UNIT V
TEXTBOOK
REFERENCE BOOKS
29
ELECTIVE V (2)
FLUID DYNAMICS
Objectives
UNIT I
Real Fluids and Ideal Fluids - Velocity of a Fluid at a point – Streamlines and
Path lines: Steady and Unsteady Flows – The Velocity potential – The Vorticity
vector – Local and Particle Rates of Change – The Equation of continuity –
Worked examples – Acceleration of a Fluid – Conditions at a rigid boundary –
General analysis of fluid motion – Pressure at a point in a Fluid at Rest –
Pressure at a point in Moving Fluid – Conditions at a Boundary of Two Inviscid
Immiscible Fluids – Euler's equation of motion – Bernoulli's equation – Worked
examples.
UNIT II
UNIT III
UNIT IV
30
UNIT V
TEXT BOOK
REFERENCE
31
ELECTIVE V (3)
Objectives
1. To expose the students to the charm, niceties and nuances in the world of
numbers.
2. To highlight some of the Applications of the Theory of Numbers.
UNIT I
UNIT II
UNIT III
Number theory from an Algebraic Viewpoint – Groups, rings and fields – Quadratic
Residues- The Legendre symbol (a/r) where r is an odd prime – Quadratic Reciprocity
– The Jacobi Symbol (P/q) where q is an odd positive integer.
UNIT IV
UNIT V
TEXT BOOK
REFERENCES