MTE 451 Discrete Mathematics and Applications 3 Credits (36 hours)

Prerequisite: Basic Mathematics up to XII/PU.

Course Objectives

1. Understand the fundamentals of number theory and their applications to cryptography.

2. Master various counting techniques and their applications in combinatorics.
3. Comprehend the properties and structures of relations, including partially ordered sets and
Boolean algebras.
4. Develop problem-solving skills in number theory, combinatorics, and order relations.

Course Outcomes
1. Apply modular arithmetic and divisibility rules to solve complex problems in number
theory.
2. Utilize counting techniques, such as permutations, combinations, and recurrence relations,
in practical applications.
3. Analyze and interpret properties of relations, including extremal elements and lattice
structures.
4. Implement cryptographic algorithms and understand their mathematical foundations.
5. Design and optimize circuits using Boolean algebra and finite Boolean algebras.

Contents

Unit I – Basics of Number Theory and Introduction to Cryptography:

Divisibility and Modular Arithmetic, Integer Representations and Algorithms, Primes and Greatest
Common Divisors, Solving Congruences, Applications of Congruences, Introduction to
Cryptography. (12 Hours)

Unit II - Counting Techniques:

The Basics of Counting, The Pigeon-hole Principle, Permutations and Combinations, Binomial
Coefficients and Identities, Generalized Permutations and Combinations, Recurrence Relations,
Applications of Recurrence Relations, Solving Linear Recurrence Relations, Generating Functions.
Principle of Inclusion-Exclusion, Applications of Inclusion-Exclusion. (12 Hours)

Unit III - Order Relations and Structures:

Product Sets and Partitions, Relations, Properties of Relations, Partially Ordered Sets, Extremal
Elements of Partially Ordered Sets, Lattices, Finite Boolean Algebras, Functions on Boolean
Algebras, Circuit Designs. (12 Hours)

References
[1] Kenneth H. Rosen, Discrete Mathematics and Its Applications, 7th Ed., Tata Mc-Graw-Hill,
2012.
[2] Bernard Kolman, Robert C. Busby, Sharon Cutler Ross, Discrete Mathematical Structures, 3rd
Ed., Prentice Hall, 1996.
 [3] Grimaldi R, Discrete and Combinatorial Mathematics, 5th Ed., Pearson, Addison Wesley,
2004.

MTH 452 Algebra - II 4 Credits (48 hours)

Course Objectives
1. Understand Factoring Techniques: Study integer and polynomial factorization, including
unique factorization domains, Euclidean domains, and irreducibility tests.
2. Explore Field Extensions: Learn about field extensions, including the degree of extension,
algebraic vs. transcendental elements, and irreducible polynomials.
3. Examine Advanced Field Concepts: Understand field isomorphisms, splitting fields,
primitive elements, algebraically closed fields, and finite fields.
4. Apply Galois Theory: Explore automorphisms, fixed fields, Galois extensions, and the
main theorem of Galois theory, including its applications to polynomial equations.
Course Outcomes
Upon successful completion of this course, students will be able to:
1. Apply techniques for factoring integers and polynomials, including unique factorization and
irreducibility tests.
2. Understand and find the degree of field extensions, and differentiate between algebraic and
transcendental elements.
3. Determine isomorphisms between field extensions, and understand concepts like splitting
fields and primitive elements.
4. Use Galois theory to analyze automorphisms, fixed fields, and solve cubic, quadratic, and
quintic equations.
5. Explore the properties of finite fields and apply field extension concepts to solve related
problems.

Contents
Unit I - Factoring:
Factoring Integers, Unique Factorization Domains, Euclidean domains, Content of polynomials,
Primitive polynomials, Gauss lemma, Unique factorization in R[x], where R is a UFD, Factoring
Integer Polynomials, Irreducibility test mod p, Eisenstein’s criterion, Gauss primes.
(12 Hours)

Unit II – Fundamentals of Field Extensions

Definition and Examples, Characteristic of a Field, The Degree of Field Extension, Algebraic and
Transcendental Elements, Finding the irreducible Polynomial, Ruler and compass constructions.
(12 Hours)

Unit III –Field Extensions and Finite Fields

Isomorphism of field extensions, Adjoining roots, Splitting fields, Primitive elements,
Algebraically closed fields, The fundamental theorem of algebra, Finite fields and their properties.
(12 Hours)
Unit IV - Galois Theory:

Automorphisms and Fixed Fields, Galois Extensions, The Main Theorem of Galois Theory,
Illustrations of the Main theorem, Cubic Equations, Quadratic Equations, Roots of Unity, Quintic
Equations. (12 Hours)

References

[1] Michael Artin, Algebra, 2nd Ed., Prentice Hall of India, 2013.
[2] J. B. Fraleigh, A First Course in Abstract Algebra, 7th Ed., Addison Wesley, 2003.
[3] I. N. Herstein, Topics in Algebra, 2nd Ed., John Wiley & Sons, 2006.
[4] Joseph A. Gallian, Contemporary Abstract Algebra, 8th Ed., Cengage Learning India, 2013.
[5] Paul B. Garrett, Abstract Algebra, CRC press, 2007.
[6] Thomas W. Hungerford, Algebra, Springer, 2004.
[7] David S. Dummit and Richard M. Foote, Abstract Algebra, 3rd Ed., Wiley, 2004.
[8] Serge Lang, Algebra, 3rd Ed., Springer, 2005.

MTH 453 Real Analysis - II 4 Credits (48 hours)

Course Objectives
1. Understand Riemann-Stieltjes Integral: Learn definitions, existence, properties, and
applications of the Riemann-Stieltjes integral, including integration of vector-valued
functions and rectifiable curves.
2. Explore Sequences and Series of Functions: Analyze point-wise and uniform
convergence, Cauchy criterion for uniform convergence, and their implications for
continuity, integration, and differentiation.
3. Study Functions of Several Variables: Master differentiation techniques, partial
derivatives, directional derivatives, and key theorems such as the Contraction Principle,
Inverse Function Theorem, and Implicit Function Theorem.
4. Analyze Special functions and Function Spaces: Understand special functions like
exponential, trigonometric functions, gamma functions and their properties, and explore
spaces of continuous functions, equicontinuous families, and approximation theorems.
Course Outcomes
Upon successful completion of this course, students will be able to:
1. Compute and analyze Riemann-Stieltjes integrals, understanding their properties and
applications to vector-valued functions and rectifiable curves.
2. Assess point-wise and uniform convergence of function sequences, and understand their
effects on continuity, integration, and differentiation.
3. Use partial derivatives, directional derivatives, and apply the Inverse Function and Implicit
Function Theorems to functions of multiple variables.
4. Analyze and work with special functions, including exponential, logarithmic, and
trigonometric functions.
 5. Work with spaces of continuous functions, equicontinuous families, and apply Weierstrass
polynomial approximation to solve related problems.

Contents

Unit I - The Riemann-Stieltjes Integral:

Definition and existence of integrals, Properties of integral, Integration and differentiation,
Integration of vector-valued functions, Rectifiable curves. (12 Hours)
Unit II - Sequences and Series of Functions:
Discussion of main problem, Point-wise Convergence and Uniform convergence, Cauchy criterion
for Uniform Convergence, Uniform convergence and continuity, Uniform convergence and
integration, Uniform convergence and differentiation. (12 Hours)

Unit III – Special Functions and Weierstrass Theorem

The spaces C(X) and B(X), Equicontinuous families of functions, Weierstrass Polynomial
approximation theorem and its applications.
Some Special Functions: Power series, The exponential and logarithmic functions, The
trigonometric functions, The Gamma function. (12 Hours)

Unit IV - Functions of Several Variables:

Differentiation, Partial Derivatives, Directional derivatives, The Contraction Principle, The Inverse
Function Theorem, The Implicit Function Theorem. (12 Hours)

References

[1] Walter Rudin, Principles of Mathematical Analysis, 3rd Ed., McGraw Hill, 1976.
[2] Robert. G. Bartle, The Elements of Real Analysis, 2nd Ed., Wiley International Ed., New York,
1976.
[3] Ajith Kumar and S. Kumaresan, A Basic Course in Real Analysis, CRC Press, 2014.
[4] Serge Lang, Analysis I, Addison Wesley Publishing Company, 1968.
[5] T. M. Apostol, Mathematical Analysis, 2nd Ed., Narosa Publishers, 1985.
[6] R. R. Goldberg , Methods of Real Analysis, 2nd Ed., Oxford & I. B. H. Publishing Co., New
Delhi, 1970.
[7] N. L. Carothers, Real Analysis, Cambridge University Press, 2000.
[8] Russel A. Gordon, Real Analysis - A First Course, 2nd Ed., Pearson, 2011.

MTH 454 Topology 4 Credits (48 hours)

Course Objectives
 1. Understand Topological Spaces: Learn the definition of topological spaces, including
examples, elementary concepts, and open bases and subbases.
2. Explore Compactness: Study compact spaces, product spaces, and Tychonoff’s theorem in
the context of topology.
3. Analyze Separation Axioms: Investigate T1 and Hausdorff spaces, completely regular and
normal spaces, and understand Urysohn’s lemma, Tietze extension theorem, and Urysohn
imbedding theorem.
4. Examine Connectedness: Learn about connected spaces, components, totally disconnected
spaces, and locally connected spaces.

Course Outcomes

Upon successful completion of this course, students will be able to:

1. Identify and work with different types of topological spaces, open bases, and function
algebras.
2. Demonstrate understanding of compact spaces and apply Tychonoff’s theorem to problems
involving product spaces.
3. Distinguish between various separation properties, and apply Urysohn’s lemma, Tietze
extension theorem, and Urysohn imbedding theorem.
4. Identify and analyze connected, totally disconnected, and locally connected spaces, and
understand their components.
5. Use fundamental theorems and concepts to solve problems related to compactness,
separation, and connectedness in topological spaces.

Contents

Unit I - Topological Spaces:

The definition and some examples, Open sets, Elementary concepts - Closed sets, Closure of a set,
Kuratowski’s Closure Axioms, Open bases and open subbases, Lindelof Theorem, Weak
topologies, (12 Hours)
Unit II – Function algebras and Compact Spaces:
The function algebras C(X, R) and C(X, C). Compact Spaces, The Heine-Borel Theorem, Product
spaces, Tychonoff ’s theorem, The Generalized Heine-Borel Theorem, Compactness for
metric spaces. (12 Hours)

Unit III - Separation:

T1-Spaces and Hausdorff spaces, Completely regular spaces and Normal spaces, Urysohn’s lemma
and Tietze extension theorem, The Urysohn imbedding theorem. (12 Hours)

Unit IV - Connectedness:
Connected spaces, The components of a space, Totally disconnected spaces, Locally connected
spaces. (12 Hours)

References
[1] G. F. Simmons, Introduction to Topology and Modern Analysis, Tata McGraw-Hill, 2004.
[2] J. R. Munkres, Topology, 2nd Ed., Pearson Education, Inc, 2000. (Add first Chapter).
 [3] S. Willard, General Topology, Addison Wesley, New York, 1968.
[4] J. Dugundji, Topology, Allyn and Bacon, Boston, 1966.
[5] J. L. Kelley, General Topology, Van Nostrand Reinhold Co., New York, 1955.

MTS 456 Ordinary Differential Equations 4 Credits (48 hours)

Course Objectives
1. Study Linear Differential Equations: Understand linear dependence, the Wronskian, and
methods for solving linear differential equations, including variations of parameters and
equations with constant coefficients.
2. Explore Power Series Solutions: Analyze second-order linear equations with ordinary and
singular points, including Legendre and Bessel equations.
3. Examine Systems of Linear Differential Equations: Learn to solve systems of first-order
equations, apply the fundamental matrix, and address non-homogeneous systems and
systems with periodic coefficients.
4. Understand Existence and Uniqueness: Investigate the existence and uniqueness of
solutions for differential equations, including methods of approximation and Picard’s
theorem.
Course Outcomes
Upon successful completion of this course, students will be able to:
1. Apply methods like the Wronskian, variation of parameters, and handle equations with
constant coefficients.
2. Solve second-order linear equations using power series, and work with Legendre and Bessel
equations.
3. Solve first-order linear systems, apply the fundamental matrix, and manage systems with
periodic coefficients.
4. Use Picard’s theorem and methods of successive approximation to analyze solutions and
address non-uniqueness.
5. Apply techniques to determine the existence, uniqueness, and continuation of solutions to
differential equations.
Contents

Unit I - Linear Differential Equations of Higher Order:

Linear dependence and the Wronskian, Basic theory for linear equations, Method of variation of
parameters, Reduction of nth order linear homogeneous equation, Homogeneous and non-
homogeneous equations with constant coefficients.
(12 Hours)

Unit II - Solutions in Power Series:

Second order linear equations with ordinary points, Legendre equation and Legendre polynomials,
Second order equations with regular singular points, Bessel equation. (18 Hours)

Unit III - Systems of Linear Differential Equations:

Systems of first order equations, Existence and uniqueness theorem. The fundamental matrix, Non-
homogeneous linear systems, Linear systems with periodic coefficients. (12 Hours)

Unit IV - Existence and Uniqueness of solutions :

Equations of the form 𝑥 ′ = 𝑓(𝑡, 𝑥) , Method of successive approximation, Lipschitz condition,
Picard’s theorem, Non uniqueness of solutions, Continuation of solutions. (6 Hours)

References
[1] S. G. Deo and V. Raghavendra, Ordinary Differential Equations and Stability Theory, Tata
McGraw Hill, 1980.
[2] A. Coddington, An Introduction to Ordinary Differential Equations, Prentice Hall of India,
2013.
[3] A. Coddington and N. Levinson, Theory of Ordinary Differential Equations, Krieger, 1984.
[4] M. W. Hirsh and S. Smale, Differential Equations, Dynamical Systems and Linear Algebra,
Academic Press, New York, 1974. 5. V. I. Arnold, Ordinary Differential Equations, MIT
Press, Cambridge, 1981.
[5] Shepley L. Ross, Differential Equations, Wiley, 2004.

MTS 459 Graph Theory 4 Credits (48 hours)

Course Objectives
1. Understand Fundamental Graph Theory Concepts: Gain a thorough understanding of
the basic concepts in graph theory, including subgraphs, vertex degrees, paths,
connectedness, and various operations and products on graphs.
2. Explore Connectivity in Graphs: Develop knowledge of connectivity in graphs, including
vertex and edge cuts, blocks, and important theorems such as Menger's theorem.
3. Analyze Trees and Special Graphs: Study the properties and characterization of trees,
understand the concepts of centers and centroids, and learn methods for counting spanning
trees. Explore the properties of Eulerian and Hamiltonian graphs.
4. Learn Graph Colorability: Understand the principles of graph colorability, including the
chromatic number, and theorems related to coloring such as the Five Color Theorem and the
chromatic polynomial.
Course Outcomes
1. Ability to define and work with subgraphs, calculate degrees of vertices, identify paths and
connected components, and apply various operations and products on graphs.
2. Proficiency in analyzing graph connectivity, including identifying and utilizing vertex and
edge cuts, understanding the concept of blocks, and applying Menger's theorem to solve
problems.
3. Understanding the definition and characterization of trees, determining centers and
centroids, counting spanning trees, and analyzing the properties of Eulerian and
Hamiltonian graphs.
 4. Ability to determine the chromatic number of graphs, apply the Five Color Theorem, and
compute the chromatic polynomial, as well as understanding the implications of graph
colorability in various contexts.
5. Enhanced problem-solving skills in graph theory, enabling the application of theoretical
concepts to practical problems and the development of strategies for addressing complex
graph-related challenges.
Contents

Unit I - Basic Properties of Graphs

Introduction, Basic concepts, subgraphs, Degrees of Vertices, Paths and connectedness, The
problem of Ramsey, Extremal graphs, Intersection graphs, Operations on graphs, Graph products.
(12 Hours)
Unit II
Connectivity, Vertex cuts and Edge cuts, Connectivity and Edge connectivity, Blocks, Menger;s
theorem,.
(12 Hours)
Unit III
Trees - Definition, Characterization, and Simple properties, Centers and centroids, Counting the
number of Spanning trees.
Eulerian and Hamiltonian graphs - Eulerian graphs, Hamiltonian graphs and its properties,
(12 Hours)
Unit IV:
Colorability: The chromatic number, The Five Color Theorem, The chromatic polynomial.
Planar Graphs: Planar and non-planar graphs, Euler formula and its consequences, Dual of a plane
graph. (12 Hours)
References:
1. R.Balakrishnan and K.Ranganathan – A textbook of Graph Theory, Springer-Verlag, 2000.
2. F. Harary – Graph Theory, Addison-Wesley Series in Mathematics, 1969.
3. Narsingh Deo – Graph Theory with Applications to Engineering and Computer Science,
Prentice Hall of India, 1987.
4. Bela Bollabas – Modern Graph theory, Springer, 1998.
5. Douglass B. West – Introduction to Graph Theory, Prentice Hall of India, New Delhi, 1996.
6. O. Ore – Theory of Graphs, American Mathematical Society, Providence, Rhode Island,
1967.

MTL 457 Practical - II 2 Credits (2 hours lab /week)

Mathematics Practicals using Python Programming Language

Course Objectives

1. Visualize Mathematical Functions: Develop programs to plot labeled graphs of

elementary functions, plane curves, space curves, and surfaces using Python.
2. Manipulate Matrices: Write Python programs to compute matrix operations such as
transpose, trace, determinant, norm, and perform matrix addition, subtraction,
multiplication, and inversion.
 3. Solve Linear Systems: Implement methods to check the consistency of linear systems, and
solve systems using matrix inversion, Cramer’s rule, Gauss Elimination, and Gauss-Jordan
methods.
4. Apply Numerical Methods: Use iterative methods like Jacobi and Gauss-Seidel, and
numerical techniques like the Power Method to find eigenvalues and eigenvectors of
matrices.
Course Outcomes
Upon successful completion of this course, students will be able to:

1. Create clear, labeled graphs of elementary functions, plane curves, space curves, and
surfaces using Python libraries.
2. Calculate matrix transpose, trace, determinant, norm, and perform matrix arithmetic and
inversion using Python.
3. Check the consistency of linear systems and find solutions using methods like matrix
inversion, Cramer’s rule, Gauss Elimination, and Gauss-Jordan.
4. Solve systems of equations using Jacobi and Gauss-Seidel iterative methods.
5. Use the Power Method to numerically determine the largest/smallest eigenvalue and
corresponding eigenvector of a matrix.
List of Programs

1) Program to plot a neat labeled graph of elementary functions on the same plane.
2) Program to obtain the graph of plane curves - cycloid and astroid in separate figure on a single
run.
3) Program to obtain a neat labeled graph of space curves - elliptical helix and circular helix in
separate figure on a single run.
4) Program to obtain a neat labeled graph of surfaces - elliptic paraboloid and hyperbolic
paraboloid in separate figure on a single run.
5) Program to find the Transpose, Trace, Determinant and Norm of a matrix.
6) Program to find sum, difference and product and inverse (if exists) of matrices.
7) Program to check whether the given system of linear equations are consistent.
8) Program to find solution to a system of linear equations by matrix inversion method (check for
all conditions on input matrix).
9) Program to find solution to a system of linear equations by Cramer’s rule (check for all
conditions on input matrix).
10) Program to solve a system of equations using Gauss Elimination Method and Gauss Jordan
Method.
11) Program to find the solution of a system of equations using Jacobi Iterative Method/Gauss
Seidal Method.
12) Program to find the numerically largest/smallest eigenvalue and corresponding eigenvector of a
matrix by using Power Method.
Note: The above list may be changed annually with the approval of the PG BOS in Mathematics.

III Semester