Department of Mathematics
Department of Mathematics
Semester II
Paper I: Advanced Abstract Algebra (II) Paper II: Real Analysis (II)
Paper III: General and Algebraic Topology Paper IV: Complex Analysis (II)
Semester III
Paper II: Partial Differential Equations
Semester IV
Paper I: Functional Analysis (II)
Paper II : Mechanics
Paper III: Programming in C(with ANSI features) Paper IV : Operations Research (II)
(II)
Paper V: Fuzzy Sets and Their Applications (II) Lab Course/Practical : Programming in C
The Syllabus for M.Sc. Mathematics is hereby approved for the sessions 2020 - 21 and 2021 - 22.
PO No. Program outcomes upon completion of the M. Sc. Degree program, the
studentwill be able to
PO No. - 1 Persue as higher studies in mathematics in reputed institute of our country like IITs,
IESER and central university etc.
PO No. – 2 To appear in several competitive examination like CGPSC, UPSC, MAT, Railways,
SSC etc.
PO No. – 3 To explain the core ideas and the techniques of mathematics at the college and school.
1. The candidate has to obtain minimum 20% marks in each theory paper and internal assessment
separately.
2. The candidate has to secure minimum 36% marks as an aggregate in order to pass that
semester examination.
3. The internal assessment shall include class test, home assignment and seminar presentation.
4. Internal Assessment Examination will be as follows :
i. Internal Test in each paper (20 marks)
ii. Seminar (Power point presentation ) in any one of the paper (20 marks)
iii. Assignment in each of the remaining papers (excluding the paper of Seminar.
(20 marks)
iv. Average of marks obtained in internal test + seminar in any one paper and marks
obtained in internal test + assignment in rest of the papers will be calculated and
taken into consideration.
5. There shall be one seminar in each semester. In each semester, the paper in which seminar
has to be presented will be allotted randomly .The marking of seminar shall be in terms of
hard copy submission (10 marks) and presentation and open discussion 10 marks. In seminar
the marks taken in to consideration will be the average marks given by two examiners.
Note:
4 The students are required to study the content mentioned in the curriculum exhaustively.
Learning Outcomes:
Upon completion of this course student should be able to learn various types of partial differential
equations in different fields.
CO No.- 3 To understand the modeling assumptions and derivations that leads to PDEs.
Learning outcomes :
Application of computers using ‘C’- Language and different fields of mathematical problem.
CO No.- 3 To learn the main function Complex declaration, Conditional Compilation, Line
Control etc.
CO No - 4 To learn Input and output streams, Buffering, closing and opening files. The
slandered library for input \ output.
CO No - 5 To address of an objects and pointers.
CO No - 6 To learn Control flow conditional branching various types of loop.
CO No. – 2 To Formulate real world problems to linear programming problems. Solve this
problem with various methods.
CO No.- 3 Get acquired with various algorithm and techniques of above used methods.
CO No - 4 To understand mathematical formulation and solution of assignment problems and
transportation problems.
CO No - 5 Know network analysis and methods to solve it.
CO No - 6 To understand the use of dynamic programming in various fields.
CO No. - 7 To understand Game theory, apply theory of queveing system and Inventory
control to particle problems.
CO No. - 8 Develop understanding of nonlinear programming.
Learning outcomes:
After thestudy of this paper, students are familiar with the new branch of which is nearer to the real
world.
CO No. – 2 To designed an expert system, this unit gives basic propositional rules.
CO No.- 3 To learn the application of fuzzy set theory in the topic decision making, which is
some what vague in nature.
CO No - 4 Introduction and operation between fuzzy sets and fuzzy numbers.
CO No - 5 To understand the difference between probability and possibility theory is
explained through fuzzy sets.
Marks Allotted in
Marks Allotted in
Internal
Paper Theory
Title of the Paper Assessment Credits
No.
Max Min Max. Min.
Partial Differential
II 80 16 20 04 05
Equations
Programming in C(with
III 80 16 20 04 05
ANSI features) (I)
Functional Analysis
Unit-II Normed linear spaces. Banach spaces and examples. Quotient space of normed linear
spaces and its completeness. equivalent norms. Riesz Lemma. basic properties of finite
dimensional normed linear spaces and compactness.
Unit- III Weak convergence and bounded linear transformations, normed linear spaces of
bounded linear transformations, dual spaces with examples.
Unit- IV Contraction mapping theorem and its application. Banach fixed point theorem.
Picard’s theorem. Banach fixed point theorem as a source of existence and uniqueness
theorem for integral equations. Nonlinear operator, examples convex function,
epigraph, monotone mapping, α-monotone, coercive mapping duality maps.
Recommended Books:
1. H.L. Royden, Real Analysis, Macmillan Publishing Co. Inc., New York, 4th Edition, 1993.
2. B.Choudhary and Sudarsan Nanda, Functional Analysis with Applications Wiley Eastern Ltd.,
1989.
References:
1. J.H. Williamson, Lebesgue Integration, Holt Rinehart and Winston, Inc. New York. 1962
2. P.R. Halmos, Measure Theory, Van Nostrand, Princeton, 1950. T.G. Hawkins, Lebesgue’s
Theory of Integration: Its Origins and Development, Chelsea, New York,1979.
3. J.H. Williamson, Lebesgue Integration, Holt Rinehart and Winston, Inc. New York. 1962
4. P.R. Halmos, Measure Theory, Van Nostrand, Princeton, 1950.
5. T.G. Hawkins, Lebesgue’s Theory of Integration: Its Origins and Development, Chelsea, New
York, 1979.
6. K.R. Parthasarathy, Introduction to Probability and Measure, Macmillan Company of India
Ltd., Delhi, 1977.
7. R.G. Bartle, The Elements of Integration, John Wiley & Sons, Inc. New York, 1966.
References:
1. L.C. Evans, Partial Differential Equations, Graduate Studies in Mathematics, Volume 19,
AMS, 1998.
2. Books with the above title by I. N. Sneddon, F. John, P. Prasad and R. Ravindran, Amarnath
etc.
Faculty members-
Chairperson / H.O.D - Dr. M.A. Siddiqui
Dr. Padmavati
Subject Expert - Dr. C.L. Dewangan
Dr. Rakesh Tiwari
Subject Expert - Dr. B. S. Thakur
Dr. (Smt.) Prachi Singh
Subject Expert - Dr. S. K. Bhatt
PAPER –III
Programming in C (with ANSI features) Theory and Practical
Max. Marks. 80 (Theory-50 + Practical-30)
Unit-II Scalar Data Types-Declarations. Different Types of Integers. Different kinds of Integer
Constants. Floating-Point Types. Initialization. Mixing Types. Explicit Conversions-Casts.
Enumeration Types. The Void Data Type. Typedefs. Finding the Address of an object.
Pointers.
Unit-III Control Flow-Conditional Branching. The Switch Statement. Looping. Nested Loops. The
break and continue Statements. The goto statement. Infinite Loops. Operators and
Expressions-Precedence and Associability. Unary Plus and Minus operators. Binary
Arithmetic Operators. Arithmetic Assignment Operators. Increment and Decrement
Operators. Comma Operator. Relational Operators. Logical Operators. Bit - Manipulation
Operators. Bitwise Assignment Operators. Cast Operator. Size of Operators. Conditional
Operator. Memory Operators.
Unit-IV Arrays -Declaring an Array. Arrays and Memory. Initializing Arrays. Encryption and
Decryption.
References:
1. Peter A. Darnell and Philip E. Margolis, C: A Software Engineering
Approach, Narosa Publishing House (Springer International Student Edition)
1993.
2. Samuel P. Harkison and Gly L. Steele Jr., C : A Reference Manual, 2nd Edition,
Prentice Hall, 1984.
2021 – 2022
PAPER –IV
Unit-I Operations Research and its Scope. Necessity of Operations Research in Industry. Linear
Programming-graphical method of solutions, Simplex Method. Theory of the Simplex
Method. Two phase method. Big M method of solution to an LPP.
Unit-II Duality in linear programming. Duality theorems, Dual Simplex method. Other Algorithms
for Linear Programming-Dual Simplex Method. Parametric Linear Programming. Upper
Bound Technique.
Unit-III Transportation problems. Formulation of transportation problems. Solutions of
Transportation problems, North-West corner method. Least cost method. Assignment
Problems. It’s mathematical formulation, Solution of assignment problems. Optimality test.
Unit-IV Network Analysis-Shortest Path Problem. Minimum Spanning Tree Problem. Maximum
Flow Problem. Minimum Cost Flow Problem. Network Simplex Method. Project Planning
and Control with PERT-CPM.
References:
1. F.S. Hillier and G.J. Ueberman. Introduction to Operations ResBareft (Sixth Edition), McGraw
Hill International Edition, Industrial Engineering Series, 1995. (This book comes with a CD
containing tutorial software Techniques, Affiliated East-West Press Pvt. Ltd., New Delhi,
Madras.
2. G. Hadley, Linear Programming, Narosa Publishing House, 1995.
3. G. Hadly, Nonlinear and Dynamic Programming, Addison-Wesley, Reading Mass.
4. Mokhtar S. Bazaraa, John J. Jarvis and Hanif D. Sherali, Linear Programming and Network
flows, John Wiley I & Sons, New York, 1990.
5. H.A. Taha, Operations Researc~-An introduction, Macmillan Publishing Co., Inc., New Yark.
6. K. Swarup, P.K. Gupta and M. Mohan, Operations Research, Sultan Chand & Sons, N.Delhi.
7. S.S. Rao, Optimization Theory and Applications, Wiley Eastern Ltd., New Delhi.
Max. Marks. 80
Unit-I Fuzzy sets. Basic definitions. -level sets. Convex fuzzy sets. Basic operations on fuzzy sets.
Types of fuzzy sets. The Extension principle-the Zadeh’s extension Principle. Cartesian
Product. Algebraic products. Bounded sum and difference,t- norms and t- conorms. ,Image
and inverse image of fuzzy sets.
Unit-II Fuzzy numbers. Elements of fuzzy arithmetic. Fuzzy Relations and Fuzzy Graphs.
Fuzzy relations on fuzzy sets. Composition of fuzzy relations.
Unit-III Min-max Composition and its properties. Fuzzy equivalence. Relations. Fuzzy compatibility.
Relations. Fuzzy relation equation. Fuzzy graphs. Similarity relation.
Unit-IV Possibility Theory. Fuzzy measures. Evidence theory. Necessity measure. Possibility
measure. Possibility distribution. Possibility theory and fuzzy sets. Possibility theory versus
probability theory.
References:
1. Fuzzy sets and fuzzy logic by G.K. Klir and B. Yuan, Prentice-Hall of, New Delhi, 1995.
2. Fuzzy set theory and its Applictions , By H.J.Zimmermann , Allied Publishers Ltd., New
Delhi , 1991.
Faculty members-
Chairperson / H.O.D - Dr. M.A. Siddiqui
Subject Expert - Dr. C.L. Dewangan Dr. Padmavati
Subject Expert - Dr. B. S. Thakur Dr. Rakesh Tiwari
Subject Expert - Dr. S. K. Bhatt
Dr. (Smt.) Prachi Singh
Representative Members -
Smt. Shobha Rani
(1) Dr. Jagjeet Kaur -
(2) Shri A. K. Pandey -
(3) Dr. Sapna Thakur -
WAVELET (I)
Max.marks.80
UNIT–III The Construction of compactly supported wavelets. Better estimates for the smoothness
of compactly supported wavelets.
Recommended Books:
1. Eugenio Hernandez and Guido Weiss . A First course on Wavelets , CRC Press, New York ,
1996.
References:
1. C. K . Chui, An Introduction to Wavelets , Academic Press , 1992.
2. I. Daubechies ,Ten Lectures on Wavelets, CBS-NSF Regional Conferences in Applied
Mahtematics , 61,SIAM , 1992.
3. Y. Meyer , Wavelets , Algorithms and applications ( Translated by R. D. Rayan ), SIAM ,
1993.
Marks Allotted in
Marks Allotted in
Internal
Paper Theory
Title of the Paper Assessment Credits
No.
I Functional analysis 80 16 20 04 05
II Mechanics 80 16 20 04 05
Programming in C(with
III 80 16 20 04 05
ANSI features) (II)
Unit-I Uniform boundedness theorem and some of its consequences. Open mapping and closed graph
theorems. Hahn-Banach theorem for real linear spaces, complex linear spaces and normed linear
spaces.
Unit-II Reflexive spaces. Weak Sequential Compactness. Compact Operators. Solvability of linear
equations in Banach spaces (Fredholm alternatives). The closed Range Theorem. Inner product
spaces. Hilbert spaces. Orthonormal Sets. Bessel’s inequality. Complete orthonormal sets and
Parseval’s identity.
Unit-III Structure of Hilbert spaces. Projection theorem. Riesz representation theorem. Adjoint of an
operator on a Hilbert space. Reflexivity of Hilbert spaces.
Unit-IV Self-adjoint operators, Positive, projection, normal and unitary operators. Abstract variational
boundary-value problem. The generalized Lax-Milgram theorem.
Recommended Books:
1. B.Choudhary and Sudarsan Nanda, Functional Analysis with Applications Wiley Eastern
Ltd., 1989.
References:
1. S.K. Berberian, Measure and integration, Chelsea Publishing Company, New York, 1965.
2. G. de Barra, Measure Theory and Integration, Wiley Eastern Limited, 1981.
3. P.K. Jain and V.P. Gupta, Lebesgue Measure and Integration, New Age International (P)
Limited, New Delhi, 2000.
4. Richard L. Wheeden and Antoni Zygmund, Measure and Integral : An Introduction to Real
Analysis, Marcel Dekker Inc. 1977.
5. J.H. Williamson, Lebesgue Integration, Holt Rinehart and Winston, Inc. New York. 1962.
6. P.R. Halmos, Measure Theory, Van Nostrand, Princeton, 1950.
7. T.G. Hawkins, Lebesgue’s Theory of Integration: Its Origins and Development, Chelsea,
New York, 1979.
8. K.R. Parthasarathy, Introduction to Probability and Measure, Macmillan Company of India
Ltd., Delhi, 1977.
2021 – 2022
PAPER -II
Mechanics
Max.Marks. 80
Analytical Dynamics:
Unit-III Whittaker’s equations. Jacobi’s equations. Statement of Lee Hwa Chung’s theorem.
Hamilton-Jacobi equation. Jacobi theorem. Method of separation of variables. Lagrange
Brackets. Condition of canonical character of a transformation in terms of Lagrange
brackets and Poisson brackets, invariance of Lagrange brackets and Poisson brackets under
canonical transformations.
Gravitational :
Unit-IV Attraction of rod, disc, spherical shells and sphere. Surface integral of normal attraction
(application & Gauss’ theorem). Potential of rod, disc, spherical shells and sphere. Laplace
and Poisson equations. Work done by self attracting systems. Distributions for a given
potential. Equipotential surfaces. Surface and solid harmonics. Surface density in terms of
surface harmonics.
1. A.S. Ramsey, Dynamics Part II, The English Language Book Society and Cambridge
University Press, 1972.
2. F. Gantmacher, Lectures in Analytic Mechanics, MIR Publishers, Moscow, 1975.
3. H. Goldstein, Classical Mechanics (2nd edition), Narosa Publishing House, New Delhi.
4. I.M. Gelfand and S.V. Fomin, Calculus of Variations, Prentice Hall.
5. S.L. Loney, An Elementary Treatise on Statics, Kalyani Publishers, New Delhi, 1979.
6. A.S. Ramsey, Newtonian Gravitation, The English Language Book Society and the Cambridge
University Press.
7. Narayan Chandra Rana & Pramod Sharad Chandra Joag, Classical Mechanics, Tata McGraw
Hill, 1991.
8. Louis N. Hand and Janet D. Finch., Analytical Mechanics, Cambridge University Press, 1998.
WAVELETS (II)
Max.marks.80
UNIT -I Orthonormal bases of piecewise linear continuous function for L2(T). Orthonormal bases
of periodic splines. Periodization of wavelets defined on the real line.
UNIT -II Characterizations in the theory of wavelets-The basic equation and some of its application.
The characterization of MRA wavelets .
UNIT -III A characterization of Low-pass filters and scaling function. Non-existence of smooth
wavelets in H2(R).
UNIT –IV Frames - The reconstruction formula and the Balian - Low theorem for frames. Frames
From translations and dilations. Smooth frames for H2(R). Discrete Transforms and
algorithms -The discrete and the fast Fourier transforms. The discrete and the fast cosine
transforms. The discrete version of the local sine and cosine bases. and reconstruction
algorithm for wavelets.
Recommended Books :
1. Eugenio Hernandez and Guido Weiss . A First course on Wavelets , CRC Press, New York ,
1996.
2021 – 2022
PAPER -IV
Max.Marks. 80
Unit-II Game Theory-Two-Person, Zero-Sum Games. Games with Mixed Strategies. Graphical,
Solution. Solution by Linear Programming.
References:
1. F.S. Hillier and G.J. Ueberman. Introduction to Operations ResBareft (Sixth Edition), McGraw
Hill International Edition, Industrial Engineering Series, 1995. (This book comes with a CD
containing tutorial software).
2. G. Hadley, Linear Programming, Narosa Publishing House, 1995.
3. G. Hadly, Nonlinear and Dynamic Programming, Addison-Wesley, Reading Mass.
4. Mokhtar S. Bazaraa, John J. Jarvis and Hanif D. Sherali, Linear Programming and Network
flows, John Wiley & Sons, New York, 1990.
5. H.A. Taha, Operations Researc~-An introduction, Macmillan Publishing Co., Inc., New Yark.
6. K. Swarup, P.K. Gupta and Man Mohan, Operations Research, S. Chand & Sons, N.Delhi.
7. S.S. Rao, Optimization Theory and Applications, Wiley Eastern Ltd., New Delhi.
8. P. K. Gupla and D.S. Hira, O. R.- An Introduction. S. Chand & Co.y Ltd., N.Delhi.
PAPER-III
Programming in C (with ANSI features) Theory and Practical (II)
Max. Marks. 80
(Theory-50 + Practical-30)
Unit-I Storage Classes-Fixed vs. Automatic Duration. Scope. Global variables. The register
Specifier. ANSI rules for the syntax and Semantics of the storage-class keywords. Dynamic
Memory Allocation
Unit-II Pointers- Pointer Arithmetic. Passing Pointers as Function Arguments. Accessing Array
Elements through Pointers. Passing Arrays as Function Arguments. Sorting Algorithms.
Strings. Multidimensional Arrays. Arrays of Pointers. Pointers to Pointers.
Unit-IV Structures and Unions-Structures.Linked Lists. Unions, enum Declarations. Input and
Output-Streams, Buffering. The <Stdio.h> Header File. Error Handling. Opening and
Closing a File. Reading and Writing Data. Selecting an I/O Method. Unbuffered I/O
Random Access. The standard library for Input/Output.
References:
1. Peter A. Darnell and Philip E. Margolis, C: A Software Engineering Approach, Narosa
Publishing House (Springer International Student Edition) 1993.
2. Samuel P. Harkison and Gly L. Steele Jr., C : A Reference Manual, 2nd Edition, Prentice Hall,
1984.
3. Brian W. Kernighan & Dennis M. Ritohie, The C Programme Language, 2nd Edition (ANSI
Features), Prentice Hall 1989
4. Yashwant Kanetkar, Let Us C, 8th Edison, B P B Publications 2007.
5. E. Balagurusamy, Programming in C (ANSI), 4 th Edison, Tata Mac Graw Hill.
Max.marks.80
Unit-I Fuzzy Logic - An overview of classical logic. Multivalued logics. Fuzzy propositions.
Fuzzy Quantifiers. Linguistic variable and hedges. Inference from conditional fuzzy
proposition. The compositional rule of inference.
Unit-II Approximate Reasoning. An overview of fuzzy expert system. Fuzzy implications and their
selection. Multiconditional approximate reasoning. The role of fuzzy relation equation.
Unit-III An introduction to Fuzzy Control - Fuzzy Controllers. Fuzzy Rule base. Fuzzy inference
engine. Fuzzification. Defuzzification and various defuzzification method.
References:
1. Sets and fuzzy logic by G.J. Klir and B. Yuan, Prentice-Hall of, New Delhi, 1995.
2. Fuzzy set theory and its Applictions , By H.J.Zimmermann , Allied Publishers Ltd., New
Delhi, 1991.
This course introduces the basic concepts of LaTeX. Participants will be able to
Handle different types of documents, Organize documents into different sections,
subsections, Formatting pages (margins, header, footer, orientation), Formatting text,
Write complex mathematical formulae, Include tables and images, Cross-referencing,
bibliography.
Introduction- How to install LaTeX. creates the first document using LaTeX,
organizes content into sections using article and book class of LaTeX.
Styling Pages- Reviewing different paper sizes, examines packages, formats the page
by setting margins, customizing header and footer, changing the page orientation,
dividing the document into multiple columns. The topic ends with reading different
types of error messages.
Formatting Content- Formatting text (styles, size, alignment), adding colors to text
and entire page, and adding bullets and numbered items. It concludes by explaining the
process of writing complex mathematics.
Tables and Images- Create basic tables, adding simple and dashed borders, merging
rows and columns, and handling situations where a table exceeds the size of a page. To
add an image, explore different properties like rotate, scale, etc…
Referencing and Indexing- Cross-referencing (refer to sections, table, images), add
bibliography (references), and create back index.
1. The Not so short Introduction to LaTeX, Tobias Oetiker Hubert Partl, Irene Hyna
and Elisabeth Schlegl.
2. More math Intro Latex, G. Gratzer, Springer publications.
3. The LATEX Companion, Frank Mittelbach and Michel Goossens.