Integrated M. Tech.

[Mathematics & Computing] – Course Structure

COURSE STRUCTURE
Integrated M.Tech. in Mathematics & Computing

SEMESTER: 3
Course Course Credit
Name of the Courses L T P
Type Code Hrs.
DC1 MCC201 Modern Algebra 3 0 0 9
Computer Organization and 3 0 0 9
DC2 MCC202
Architecture
DC3 MCC203 Real Analysis 3 0 0 9
E/SO1 MCC505 Probability & Statistics 3 0 0 9
E/SO2 XXX000 Data Structures and Algorithms 3 0 0 9
Computer Organization and
DP1 MCC204 0 0 2 2
Architecture Lab
Total 47
Contact Hrs. 15 0 2 17

SEMESTER: 4
Course Course Credit
Name of the Courses L T P
Type Code Hrs.
E/SO3 XXX000 3 0 0 9
DC4 MCO501 Discrete Mathematics 3 0 0 9
DC5 MCC205 Linear Algebra 3 0 0 9
DC6 MCC509 Statistical Inference 3 0 0 9
DC7 MCC510 Operating Systems 3 0 0 9
DP2 MCC512 Operating Systems Lab 0 0 3 3
48
Contact Hrs. 15 0 3 18

SEMESTER: 5
Course Course Credit
Name of the Courses L T P
Type Code Hrs.
DC8 MCD541 GPU Computing 3 0 0 9
DC9 MCC502 Differential Equations 3 0 0 9
DC10 MCC301 Number Theory and Cryptography 3 0 0 9
HSS1/M
XXX000 3 0 0 9
S1
E/SO4 XXX000 3 0 0 9
DP3 MCC302 GPU Computing Lab 0 0 2 2
47
Contact Hrs. 15 0 2 17

1
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

SEMESTER: 6
Course Course Credit
Name of the Courses L T P
Type Code Hrs.

DC11 MCD508 Theory of Computation 3 0 0 9

DC12 MCC511 Database Management Systems 3 0 0 9
DE1 XXX000 [Applied Mathematics] 3 0 0 9
HSS2/MS
XXX000 3 0 0 9
2
OE1/DE2 XXX000 [DE: Computer Science] 3 0 0 9
DP4 MCC513 Database Management Systems Lab 0 0 2 2
47
Contact Hrs. 15 0 2 17

SEMESTER: 7
Course Course Credit
Name of the Courses L T P
Type Code Hrs.
DC13 MCO502 Optimization Techniques 3 0 0 9
DC14 MCC503 Numerical Methods 3 0 0 9
DE3 XXX000 [Pure Mathematics] 3 0 0 9
OE2 XXX000 3 0 0 9
OE3/DE4 XXX000 [DE: Statistics] 3 0 0 9
DP5 MCC 506 Numerical Methods Lab 0 0 3 3
48
Contact Hrs. 15 0 3 18

SEMESTER: 8
Course Course Credit
Name of the Courses L T P
Type Code Hrs.
DC15 MCC 401 Software Engineering 3 0 0 9
DC16 MCD510 Complex Analysis 3 0 0 9
DE5 XXX000 [Pure Mathematics] 3 0 0 9
OE4 XXX000 3 0 0 9
OE5/DE6 XXX000 [DE: Applied Mathematics] 3 0 0 9
DP6 MCC 402 Software Engineering Lab 0 0 2 2
47
Contact Hrs. 15 0 2 17

2
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

SEMESTER: 9
Course Course Credit
Name of the Courses L T P
Type Code Hrs.
DC17 MCC551 Thesis Unit 1 3 0 0 9
DC18 MCC 552 Thesis Unit 2 3 0 0 9
DC19 MCC553 Thesis Unit 3 3 0 0 9
DC20 MCC 554 Thesis Unit 4 3 0 0 9
DC21 Internship/Training/Seminar/Field-
MCC555 0 0 0 S/X
Excursion
36
Contact Hrs. 12 0 0 12

SEMESTER: 10
Course Course Credi
Name of the Courses L T P
Type Code t Hrs.
DE7/OE6 XXX000 [DE: Statistics] 3 0 0 9
DE8/OE7 XXX000 [DE: Computer Science] 3 0 0 9
DC19 MCC 556 Thesis Unit 5 3 0 0 9
DC20 MCC 557 Thesis Unit 6 3 0 0 9
36
Contact Hrs. 12 0 0 12

Elective Groups

PROPOSED DEPARTMENTAL ELECTIVE (DE)

Computer Science Pure Mathematics
Course
Name Course No. Name
No.
MCC531 Advanced Data Structures & Algorithms MCD504 Measure Theory
MCC532 Fundamentals of Machine Learning MCD507 Representation Theory
of Finite Groups
MCC535 Soft Computing Techniques MCD509 Algebraic Coding
Theory
MCC539 Advanced DBMS MCC501 Analysis
MCC540 Neural Networks and Deep Learning MCC514 Functional Analysis
MCD532 Data Mining MCC515 Topology
MCD401 Computer Graphics MCD502 Graph Theory
MCD539 Big data
MCD542 Video Analytics
MCD544 Software Testing

3
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

MCD506 Parallel Computing

MCD535 Bioinformatics

Applied Mathematics Statistics

Course
Name Course No. Name
No.
MCC516 Computational Fluid Dynamics MCD537 Design of Experiments
MCD501 Classical Mechanics MCD538 Time Series Analysis
MCD503 Integral Equations and Calculus of Variations MCD514 Sampling Theory

MCD511 Mathematical Ecology MCD516 Industrial Statistics

MCD512 Non-Linear Dynamics and Chaos MCD540 Biostatistics

LIST OF DEPARTMENTAL ELECTIVES (DE)

DEPARTMENTAL ELECTIVE (DE)

Course No. Name Course No. Name
MCC531 Advanced Data Structures & MCD501 Classical Mechanics
Algorithms
MCC532 Fundamentals of Machine MCD503 Integral Equations and Calculus
Learning of Variations
MCC535 Soft Computing Techniques MCD504 Measure Theory

MCD535 Bioinformatics MCD506 Parallel Computing

MCD537 Design of Experiments MCD507 Representation Theory of Finite
Groups
MCD538 Time Series Analysis MCD509 Algebraic Coding Theory
MCD540 Biostatistics MCD511 Mathematical Ecology
MCD514 Sampling Theory MCD512 Non-Linear Dynamics and Chaos

MCD516 Industrial Statistics MCC501 Analysis

MCC539 Advanced DBMS MCC514 Functional Analysis
MCC540 Neural Networks and Deep MCC515 Topology
Learning
MCD532 Data Mining MCC516 Computational Fluid Dynamics
MCD401 Computer Graphics MCD502 Graph Theory
MCD539 Big data MCD544 Software Testing
MCD542 Video Analytics

4
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

LIST OF SO/ESO COURSES

SUBJECTS PROPOSED TO OFFER UNDER SO/ESO
Course No. Name Offering Mandatory for Departmental
Semester Students
MCC505 Probability & Statistics Monsoon YES
MCE301 Operations Research Winter NO

LIST OF OPEN ELECTIVES (OE)

OPEN ELECTIVE (OE) COURSES

Course No. Name
MCO401 Partial Differential Equations
MCO402 Modelling and Simulation
MCO403 Graph algorithms
MCD540 Biostatistics

Theory
Course No. Name
MCC201 Modern Algebra
MCC202 Computer Organization and Architecture
MCC203 Real Analysis
MCC205 Linear Algebra
MCC301 Number Theory and Cryptography
MCC401 Software Engineering
MCC502 Differential Equations
MCC503 Numerical Methods
MCC509 Statistical Inference
MCC510 Operating Systems
MCC511 Database Management Systems
MCD508 Theory of Computation
MCD510 Complex Analysis
MCD541 GPU Computing
MCO501 Discrete Mathematics
MCO502 Optimization Techniques
Practical
MCC204 Computer Organization and Architecture Lab
MCC302 GPU Computing Lab

5
Integrated M. Tech. [Mathematics & Computing] – Course Structure

MCC 402 Software Engineering Lab

MCC 506 Numerical Methods Lab
MCC512 Operating Systems Lab
MCC513 Database Management Systems Lab
Others
MCC551 Thesis Unit 1
MCC552 Thesis Unit 2
MCC553 Thesis Unit 3
MCC554 Thesis Unit 4
MCC555 Internship/Training/Seminar/Field-Excursion
MCC556 Thesis Unit 5
MCC557 Thesis Unit 6

6
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

DEPARTMENTAL ELECTIVES
Course No. Name
MCC501 Analysis
MCC514 Functional Analysis
MCC515 Topology
MCC516 Computational Fluid Dynamics
MCC531 Advanced Data Structures & Algorithms
MCC532 Fundamentals of Machine Learning
MCC535 Soft Computing
MCC539 Advanced DBMS
MCC540 Neural Networks and Deep Learning
MCD401 Computer Graphics
MCD501 Classical Mechanics
MCD502 Graph Theory
MCD503 Integral Equations and Calculus of Variations
MCD504 Measure Theory
MCD506 Parallel Computing
MCD507 Representation Theory of Finite Groups
MCD509 Algebraic Coding Theory
MCD511 Mathematical Ecology
MCD512 Non-Linear Dynamics and Chaos
MCD514 Sampling Theory
MCD516 Industrial Statistics
MCD532 Data Mining
MCD535 Bioinformatics
MCD537 Design of Experiments
MCD538 Time Series Analysis
MCD539 Big data
MCD540 Biostatistics
MCD542 Video Analytics
MCD544 Software Testing

OPEN ELECTIVES
Course No. Name
MCD540 Biostatistics
MCO401 Partial Differential Equations
MCO402 Modelling and Simulation
MCO403 Graph algorithms
ENGINEERING SCIENCE OPTIONS
MCC505 Probability and Statistics
MCE301 Operations Research

7
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

Course Course Name of Course L T P Credit

Type Code
DC MCC201 Modern Algebra 3 0 0 9

Course Objective
Modern Algebra plays an important role in the Computer science and Electrical
Communications as well as in mathematics itself. Consequently, it becomes more and more
desirable to introduce the student to the group theory and ring theory at an early stage of
study.

Learning Outcomes
Algebra is an abstract branch of mathematics that originated from set theory. The main
outcome of this course is to develop the capacity for mathematical reasoning through
analyzing, proving and explaining concepts from groups and rings.

Unit Topics to be Covered Lecture Learning Outcome

No. Hours
1 Binary operation, and its properties, 4 Understanding of basic properties
Definition of a group, Examples and of group theory.
basic properties.
2 Subgroups, Coset of a subgroup, 4 Study of subgroups and their
Lagrange’s theorem. properties.
3 Cyclic groups, Order of a group. 4 Study of cyclic groups.
Normal subgroups, Quotient group
4 Homomorphisms, Kernel Image of a 5 Discussion on relation between
homomorphism, Isomorphism structures of any two groups.
theorems.
5 Permutation groups, Cayley’s 4 Study of properties of symmetric
theorems. Direct product of groups groups.
6 Group action on a set, Semi-direct 4 Study of Sylow’s theorem.
product. Sylow’s theorems. Structure
of finite abelian groups.
7 Definition, Examples and basic 4 Discussion on zero divisors and
properties. Zero divisors, Integral their properties
domains.
8 Fields, Characteristic of a ring, 4 Study of fields and Ideals of rings.
Quotient field of an integral domain.
Subrings, Ideals, Quotient rings.

8
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

9 Isomorphism theorems. Ring of 5 Study of isomorphism theorems

polynomlals. Prime, Irreducible on rings.
elements and their properties.
10 UFD, PID and Euclidean domains. 4 Discussion on factorizations of
Prime ideal, Maximal ideals. polynomials and their different
Ideal structures.

Text Books

1. D.S. Dummit and R. M. Foote, Abstract Algebra, 2nd Edition, John Wiley, 2002.

Reference Books

1. M. Artin, Algebra, Prentice Hall of India, 1994.

2. J.A. Gallian, Contemporary Abstract Algebra, 4th Edition, Narosa, 1999.
3. N. Jacobson, Basic Algebra I, 2nd Edition, Hindustan Publishing Co., 1984, W.H.
Freeman, 1985.

9
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

Course Course Name of Course L T P Credit

Type Code

DC MCC202 Computer Organization and 3 0 0 9

Architecture

Course Objective

To impart an understanding of the internal organization and operations of a computer how it

works, and how it interfaces to software etc. To introduce the concepts of processor logic
design and control logic design.

Learning Outcomes

Upon successful completion of this course, students will:

● Identify the basic structure and functional units of a digital computer
● Analyze the effect of addressing modes on the execution time of a program
● Design processing unit using the concepts of ALU and control logic design
● Identify the pros and cons of different types of control logic design in processors
● Select appropriate interfacing standards for I/O device
● Identify the roles of various functional units of a computer in instruction execution

Unit Topics to be Covered Lecture Learning Outcome

No. Hours

1 Basic functional blocks of a computer: CPU, 7 These lectures will

memory, input-output subsystems, control unit. provide the students a
Instruction set architecture of a CPU - registers, sound understanding of
instruction execution cycle, RTL interpretation basic principles and
of instructions, addressing modes, instruction fundamentals of the
set. Case study - instruction sets of some functional blocks of a
common CPUs. computer.
2 Data representation: signed number 9 The lectures will help
representation, fixed and floating-point students learn the basics
representations, character representation. of
Computer arithmetic - integer addition and data representation and
subtraction, ripple carry adder, carry look-ahead enable them to perform
adder, etc. multiplication - shift-and-add, Booth computer arithmetic.
multiplier, carry save multiplier, etc. Division -
non-restoring and restoring techniques, floating
point arithmetic.

1
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

3 CPU control unit design: hardwired and micro- 13 The lectures will enable
programmed design approaches, Case study - the students to
design of a simple hypothetical CPU. Memory understand the concepts
system design: semiconductor memory of CPU control unit
technologies, memory organization: Memory design and Memory
interleaving, concept of hierarchical memory system design.
organization, cache memory, cache size vs block
size, mapping functions, replacement
algorithms, write policy.
4 Peripheral devices and their characteristics: 6 The students will have a
Input-output subsystems, I/O transfers - program sound knowledge of
controlled, interrupt driven and DMA, peripheral devices and
privileged and non-privileged instructions, their characteristics.
software interrupts and exceptions. Programs
and processes - role of interrupts in process state
transitions.
5 Performance enhancement techniques, 4 Successful conduction of
Pipelining: Basic concepts of pipelining, these lectures will impart
throughput and speedup, pipeline hazards. the students the
knowledge of
performance
enhancement techniques
and concepts of
pipelining.

Text Books:
1. D. A. Patterson and J. L. Hennessy, Computer Organization and Design, 5/e, Morgan Kaufmann,
2013.
2. Behrooz Parhami, Computer Architecture, Oxford University Press, 2005.
3. Jean-Loup Baer, Microprocessor Architecture, Cambridge University Press, 2012.
Reference Books:

1. Carl Hamacher, Zvonko Vranesic and Safwat Zaky, Computer Organization, 5/e, McGraw Hill,
2011.
2. M. Morris Mano, Digital Logic & Computer Design, 4/e, Pearson Education, 2013.
3. William Stallings, Computer Organization and Architecture: Designing for Performance, Pearson,
9/e, 2013.
4. D. V. Hall, Microprocessors and Interfacing, 2/e, McGraw Hall, 2006.
5. Hans-Peter Messmer, The Indispensable PC Hardware Book, 4/e, Addison-Wesley, 2001

2
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

Course Course Name of Course L T P Credit

Type Code

DC MCC203 Real Analysis 3 0 0 9

Prerequisite: Basic Calculus

Course Objective

(i) To introduce concepts related to metric spaces, such as continuity, compactness,

completeness and connectedness (ii) To introduce the basics of Riemann integrals (iii) To
study Sequences and series of functions.

Learning Outcomes

The students will be able to understand (i) the basic properties of real numbers, finite
dimensional Euclidean space and Metric spaces (ii) the basic idea of continuity, uniform
continuity and differentiability and its applications in Geometry (iii) Riemann integration,
convergence and uniform convergence of sequence and series of functions and their
applications.

Unit Topics to be Covered Lecture Learning Outcome

No. Hours

1 Review of basic concepts of real 10 The students will be able to

numbers and set theory: Archimedean understand the basic properties of
property, Completeness; Denseness of real numbers and Metric spaces
rationals and irrationals, Countable
and uncountable sets. Metric spaces,
compactness, connectedness.

2 Continuity, uniform continuity, 09 The students will learn continuity,

Monotonic functions, Functions of uniform continuity and
bounded variation; Absolutely differentiability in Metric spaces.
continuous functions, Derivatives of
functions, Mean value theorem and
Taylor's theorem.

3 Riemann integral and its properties, 09 Students will get the idea of
characterization of Riemann integrable Riemann integral and Improper
functions, Fundamental theorem of integrals.
integral calculus. Improper integrals,
Gamma functions.

3
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

4 Sequences and series of functions, 11 The students will be able to

uniform convergence and its relation to understand convergence and
continuity, differentiation and uniform convergence of sequence
integration. Pointwise convergence, and series of functions.
Fejer's theorem, Weierstrass
approximation theorem.
Text Books:

1. T. M. Apostol, Mathematical Analysis, 2nd Edition, Narosa, 2002.

Reference Books:

1. K. Ross, Elementary Analysis: The Theory of Calculus, Springer Int. Edition, 2004.
2. W. Rudin, Principles of Mathematical Analysis, 3 rd Edition, McGraw-Hill, 2017.

4
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

Course Course Name of Course L T P Credit

Type Code

DC MCC205 Linear Algebra 3 0 0 9

Prerequisite: None
Course Objective

To introduce the basic ideas and techniques of linear algebra and to provide a basis for further
studies in other pure and applied courses.

Learning Outcomes

The student will be able (i) to understand the concepts of vectors spaces, inner product spaces,
bases and dimensions and their geometric properties (ii) to understand computational
techniques and algebraic skills essential for the study of linear transformations, eigenvalues,
eigenvectors and diagonalization and apply them to solve related problems (iii) to understand
bilinear forms and quadratic forms and their geometric properties.

Unit Topics to be Covered Lecture Learning Outcome

No. Hours

1 Fields, Systems of linear equations, 10 Students will learn to solve the

matrices, rank, Gaussian elimination, system of linear equations and
Vector spaces, subspaces, bases and will understand the concepts of
dimension, Quotient space. vectors spaces.

2 Linear transformations, representation 14 Students will understand

of linear transformations by matrices, computational techniques and
rank-nullity theorem, duality and algebraic skills essential for the
transpose, Determinants. Eigenvalues study of linear transformations,
and eigenvectors, characteristic eigenvalues, eigenvectors and
polynomials, minimal polynomials, diagonalization and apply them to
Cayley-Hamilton Theorem, solve related problems
triangulation, diagonalization and
some applications.

3 Inner product spaces, orthogonal 09 Students will learn the algebraic

projections, Gram-Schmidt, and geometric properties of inner
orthonormalization, linear functionals product spaces and also learn
and adjoints, Hermitian, self-adjoint, about the different operators and
unitary and normal operators, Spectral their properties.
Theorem for normal operators.

5
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

4 Bilinear forms, symmetric and skew- 06 Students will understand bilinear

symmetric bilinear forms, real forms and quadratic forms and
quadratic forms, Sylvester's law of their geometric properties.
inertia, positive definiteness.

Text Books:

1. K. Hoffman and R. Kunze, Linear Algebra, 2nd Edition, Pearson (India), 2015.

Reference Books:

1. S. Lang, Linear Algebra, 2nd Edition, Springer, 1989.

2. P. Lax, Linear Algebra and its Applications, 2nd Edition, Wiley, 2007.
3. H.E. Rose, Linear Algebra, Birkhauser, 2002.

6
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

Course
Course Code Name of Course L T P Credit
Type
DC MCC301 Number Theory and Cryptography 3 0 0 9

Course Objective
To understand (i) the basics of number theory and (ii) classical and modern cryptosystems for
secure encryption and decryption.
Learning Outcomes

Upon successful completion of this course, students will:

1. be able to understands basics of number theory and their different applications.
2. be able to understand the basic idea of encryption and decryption schemes.

Unit Lecture
Topics to be Covered Learning Outcome
No. Hours
Time estimates, Divisibility and the Euclidean Students will be able to
5
algorithm compute to time complexity
Congruences, Fermat's Little Theorem, Euler's of an algorithm. This unit
1
Theorem and Chinese Remainder Theorem, will also help students to
6
some applications to factoring understands basics of
number theory
Finite fields 3 This unit will help students to
Quadratic residues and reciprocity understand the basic idea of
2
3 finite fields and quadratic
residues.
Some simple cryptosystems. Enciphering Students will be able to
matrices understand classical
3 4
encryption and decryption
techniques.
The idea of public key cryptography, Classical This unit will help students to
4
versus public key, Hash functions, RSA. understand public key
Discrete log, Diffie-Hellmann key exchange cryptosystems and
4
system, Massey-Omura cryptosystem for 6 cryptosystems based on
message transmission, ElGamal cryptosystem. discrete log and their
Digital signature standard. Knapsack problems. 3 securities.
Introduction to elliptic curves, Elliptic curve Students will be able to
cryptosystems, Elliptic curve primality test. understand basics of elliptic
5 5 curves and their applications
in designing cryptosystems
and primality testing,

Text Books:

7
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

1. Neal Koblitz, A Course in Number Theory and Cryptography (Second edition), Springer, 1994.

Reference Books:
1. D. M. Burton, Elementary Number Theory (Seventh edition), McGraw Hill Education, 2017.
2. J. Hoffstein, J. Pipher, J.H. Silverman, An Introduction to Mathematical Cryptography (First edition),
Springer, 2008.

8
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

Course Course
Name of Course L T P Credit
Type Code
DC MCC401 Software Engineering 3 0 0 9

Course Objective
Objective of this course is to impart knowledge of Software Engineering
Learning Outcomes
Students will learn how the concept of Software Engineering.

Unit Lecture
Topics to be Covered Learning Outcome
No. Hours
Introduction to Software Engineering, Software This unit will help students to
Life Cycle, Software Life Cycle Models. understand basics of
1 3
Software Engineering,
Software Process Models.
Planning a project: Metrics for Effort This unit will help students to
Estimation. Cost Estimation, Project understand the process of
Scheduling, Staffing and Personal Planning, cost estimation, development
2 6
Project Monitoring, Risk Management. time estimation, manpower
scheduling, Project
Management, etc.
Software Requirements Analysis: Introduction, This unit will help students to
Problem Analysis, Data Flow Diagram, understand the process of
Requirement Specifications Techniques with Requirement gathering and
3 6
Applications. analysis, different formal and
informal techniques for
writing requirements
Design a Project: Introduction, Function This unit will help students to
Oriented Design, Different Methods of understand the different
Function Oriented Design with Applications, methods of architecture
Detailed Design. design in functional
4 10
approach and Object
Object Oriented Modeling & Design: UML Oriented approach.
Design Techniques and Its Applications.

Coding: Coding Process, Guidelines, Common This unit will help students to
Programming Errors, Code Walkthrough. understand Coding
Testing: Testing Fundamentals, Types of methodology.
Testing, Levels of Testing, Test Plans, Test- Also, this unit give a
Cases with Applications. exhaustive idea to students
5 14
Software Quality Assurance. about how to carryout
Software Maintenance, Software Re- testing, different approaches
engineering for generating test suites.
Students will get a
knowledge about software

9
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

maintenance and
reengineering.

Text Books:

1. Software Engineering: A Practitioner’s Approach by R.S. PressMan, McGraw Hill.

Reference Books:

1. Fundamentals of Software Engineering by R. Mall, Prentice Hall of India.

2. An Integrated Approach to Software Engineering by P. Jalote, Narosa.

10
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

Course Course
Name of Course L T P Credit
Type Code
DC MCC502 Differential Equations 3 0 0 9

Course Objective
The objective of the course is to understand the theory of ordinary and partial differential equations
and their utility in solving real-world problems arising in mathematical physics and engineering.
Learning Outcomes
Upon successful completion of this course, students will:
 have a broad understanding of formulation and solution of ODEs & IVP.
 It also provides idea of solving different classes of second order diff. eqs.
 It helps students in understanding how the equations with analytic coeffs. are treated with
Bessel and Legendre equations presented as examples of practical importance.
 Develop understanding both rigorousskills in the theory and applications of partial differential
equations anda deeper insight into the subject.
 To understand different classes of PDEs arising in real-world situations & how to use them.

Unit Lecture
Topics to be Covered Learning Outcome
No. Hours
ODEs: Basic concept and Introduction,Initial Understand the formulation
value problems, Existence and uniqueness and and solution of ODEs & IVP.
continuity theorems, Series solution around an Also know whether solution
ordinary point and a regular singular point, the exist and unique, whether
method of Frobenius.. such solution exists on a
1 5
larger interval or not. It also
provides idea of solving
second order diff. eqs. using
series solution and Frobenius
method.
Bessel differential equation, Bessel functions It helps students in
properties, Generating function, Legendre understanding howthe
differential equation, Legendre function, equations with analytic coeffs.
2 Orthogonal property of Legendre polynomials, 7 are treated with Bessel and
Generating function. Legendre equations presented
as examples of practical
importance.
Two-point boundary value problems, Green’s This will help inhandling
functions, Self-adjoint Eigen value problems, Boundary and Eigen value
3 7
Sturm-Liouville systems. problems arise in physical and
engineering systems.
PDEs:Linear and Quasi linear equations, Develop understanding both
Partial Differential Equations of second order rigorousskills in the theory
4 with constant and variable coefficients, 6 and applications of partial
differential equations anda
deeper insight into the subject.

11
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

Classification and reduction of second order To understand different

equations to canonical form, Cauchy, Neumann classes of PDEs arising in real-
5 6
and Dirichlet problems. world situations & how to use
them.
Solution of Laplace, wave and unsteady heat Studentswilllearn how to use
equations by variable-separable method, different methods for solving
6 8
solution of wave and unsteady heat equations in the real physical problems
non-homogeneous cases.

Text Books:

1. T. Myint-U, Ordinary Differential Equations, North-Holland, New York (1978).

2. T. Myint-U, Lokenath Debnath, Linear Partial Differential Equations for Scientists & Engineers.
4th Edition Birkhauser.

Reference Books:

1. G. F. Simmons, Differential Equations with Applications and Historical Notes, Tata McGraw-Hill
Edition, Delhi (2003).
2. S. Ahmad and M.R.M. Rao, Theory of ODEs with Applications to Biology & Engineering
3. W.W. Bell, Special Functions for Scientists and Engineers, Van Nostrand Ltd. (1968).

12
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

Course Course Name of Course L T P Credit

Type Code

DC MCC509 Statistical Inference 3 0 0 9

Course Objective

Statistical Inference is one of the fundamental course which requires in higher studies for
anyone who intends to practices statistical tools and methodologies for data analysis. Keeping
these points in view, the course structure of statistical inference has been finalized.

Learning Outcomes
After completion of this course, students will be equipped with the knowledge of estimation
techniques for population parameters and different statistical tests required in data analysis.

Unit Topics to be Covered Lecture Learning Outcome

No. Hours
1 Estimation: Criteria of a good 12 Introduces the features of good
estimator, related theorems and results, estimators and provides the idea
uniformly minimum variance unbiased and applications of important
estimation, Cramer Rao inequality, theorems useful in statistical
Rao-Blackwell theorem. inference.
2 Methods of estimation: method of 6 Introduces different methods to
maximum likelihood, method of find good estimators.
moments, method of least squares;
Interval Estimation
3 Test of Hypothesis: Definition of 12 Provides the concept of
various terms, Neyman-Pearson’s hypothesis testing and introduces
Lemma, Likelihood ratio test. Tests for various tests required in data
mean and variance in normal analysis.
distribution (one and two population
case), tests for correlation co-efficient
and regression coefficient, pair t-test,
Chi-square test for goodness of fit,
contingency table, Large sample tests
through normal approximations, test of
independence of attributes.
4 Sequential analysis, Non-parametric 4 Gives the concepts of sequential
tests for non-normal population: run analysis where sample size is a
random variable and also

13
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

test, sign test, Mann-Whitney introduces the non-parametric

Wilcoxon U-tests. tests applicable where normality
assumption does not holds good.
5 Analysis of variance: One-way and 5 Give the idea about analyzing the
Two-ways with their applications. variations creep in the data due to
various factors.

Text Books:

1. Lehmann, E.L and Casella G., Theory of Point Estimation, 2nd Ed, Springer, 1998.
2. Lehmann, E.L and Joseph P. Romano, Testing Statistical Hypotheses, 3rd Ed, Springer, 2005.

Reference Books:

1. Gupta S.C. and Kapoor,V. K., Fundamentals of Mathematical Statistics, Sultan Chand and Sons.
2. Mood M., Graybill F.A. and Boes D.C. Introduction to the Theory of Statistics, Tata McGraw-Hill,
New Delhi.
3. Gupta S.C. and Kapoor,V. K., Fundamentals of Applied Statistics, Sultan Chand and Sons.

14
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

Course Course
Name of Course L T P Credit
Type Code
DC MCC510 Operating Systems 3 0 0 9

Course Objective
The objective of the course is to inculcate the fundamental ideas from where the computing
resources belong
Learning Outcomes
Upon successful completion of this course, students will:
 able to know the fact and figures of computing resources available with system, dynamics of
the system and computing resources

Unit Lecture
Topics to be Covered Learning Outcome
No. Hours
Introduction to Operating System: Understanding of
Introduction and Role and Goal of Operating fundamentals of Operating
systems (OS), Categories of OS, Computer Systems and its advantages
System Architecture, Interrupts, common and disadvantages
function of interrupt, Interrupt handling,
1 Operating System Structures, operations and 9
services, Protection and security, system calls,
implementation and parameter passing,
Operating system design and Implementation,
Virtual machines, advantages and its
disadvantages.
Processes and Threads: Process Concept, This unit will help student in
Process Sate, Process Control Block (PCB), understanding concept of
Process Scheduling, Schedulers, Process process creation and
Creation, Process Termination, Co-operating termination and their
Process, Producer Consumer Problem, Inter- advantages. Also, student will
process Communication, Threads, Types of come to know about the thread
Threads (User level Thread, Kernel level creation and management for
2 10
Thread), Advantages and disadvantages, multithreading models
Multithreading models (One to One, Many to
One and Many to Many Models), Thread
library, Threading issues: Thread Cancellation,
Signal handling, Thread Pools.

CPU Scheduling and Process This will help in

Synchronization: CPU Scheduler, Scheduling understanding about the
Criteria, Scheduling Algorithms: First Come scheduling of processes and its
3 First Serve Scheduling (FCFS), Shortest Job 10 synchronization
First Scheduling (SJF), Priority Scheduling,
Round Robin Scheduling, Race condition,
Critical Section, Busy Waiting, Critical Section
15
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

Problem, Semaphores, Types of Semaphore,

Semaphore with and without busy waiting,
Reader’s Writer’s Problem, Dining
Philosopher’s Problem.
Deadlock and Memory Management: This will help in
Deadlock and its characterization, Resource understanding about managing
Allocation Graph Algorithm applicable for the resources and memory
single instance of resource type, Deadlock available in the system.
Prevention and Avoidance, Bankers Algorithm
applicable for multiple instance of resource
type, Deadlock Detection and Recovery,
4 Memory and its Types, Address Binding, 10
Logical and Physical Addresses, Dynamic
Loading and Linking, Swapping, Contiguous
and Non-contiguous Memory allocations,
Fragmentation (Internal and External) and
Segmentation, Virtual Memory, Paging,
Demand Paging, Page Replacement
Algorithms, Thrashing.

Text Books:

1. Abraham Silberschatz, Peter Baer Galvin and Greg Gagne, Operating Systems Principles, John Wiley
and Sons, 2005.

Reference Books:

1. J. Archer Harris, Operating Systems, Mc Graw Hill, 2002.

2. Y P Kanetkar, Unix Shell Programming, BPB Publication, New Delhi,1996.

16
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

Course Course Name of Course L T P Credit

Type Code
DC MCC511 Database Management System 3 0 0 9

Course Objective
The course will provide an understanding of data storage, manipulation and retrieval of
data. The objective of course is to provide fundamentals of DBMS to enable students with
Query optimization through DBMS and to learn about Database implementation and file
management concepts.

Learning Outcomes
Upon successful completion of this course, students will:
● have a broad understanding of database concepts and database management system
software.
● have understanding of major DBMS components and their function.
● be able to model an application’s data requirements using conceptual modeling tools
like ER diagrams and design database schemas based on the conceptual model.
● be able to write SQL commands to create tables and indexes, insert/update/delete data,
and query data in a relational DBMS.

Unit Topics to be Covered Lecture Learning Outcome

No. Hours

1 Introduction to DBMS, Advantages, 4 Understanding of DBMS and what

Database applications, purpose, it provides. Advantages of using
accessing and modifying databases, DBMS. It provides idea of DBMS
architecture - users and Architecture.
administrators.

2 Data Modelling, Database concepts, 6 It provides understanding the steps

E-R data model, network and to prepare a data model. One will
hierarchical data models, Relational learn the fundamentals of
Model (database schema, keys, relational data model its structure,
integrity constraints) and advantages. This will help in
designing the relation model, and
to conceptualize data using the
relational model.
3 Query Languages, Relational Algebra 15 This enables to express queries
(Fundamental and derived operators), using relational algebra, relational
Relational calculus (tuple and domain calculus and SQL.
calculus), SQL (Basic SQL structure,
view, set operations, nested sub-
queries, aggregation, null values,
17
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

database modification, join

expressions, triggers). Query facility
and query optimization.

4 Functional and multi-valued 6 This will help students in further

dependency, data description implementation of database for
languages, Introduction to distributed efficient management & outcomes.
databases implementation issues.
5 Storage media and storage structure, 8 Help in understanding the
file organization. Indexing (concepts, organization of files for keeping
clustered and non-clustered indices. databases and how to optimize the
Hash and Tree indexing), Heap file, data base queries for fast response.
indexed file, B+ tree file, file with
variable length records, performance
and evaluation.

Text Books:

1. R. Ramakrishnan and J. Gehrke, Database Management Systems, 3rd Edition, McGraw Hill, 2003.

Reference Books:

1. A. Silberschatz, H.F. Korth and S. Sudarshan, Database System Concepts, 5th Edition, McGraw Hill,
2006.
2. Elmasri and Navathe, “Fundamentals of Database Systems”, 5thEdition, PEARSON Education.
3. Peter Rob and Carlos Coronel, “Database Systems Design, Implementation and Management”, Thomson
Learning, 5th Edition.

18
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

Course Course Name of Course L T P Credit

Type Code

DC MCD508 Theory of Computation 3 0 0 9

Course Objective

Objective: To explore and understand the challenges for Theoretical Computer Science and
its contribution to other sciences.

Learning Outcomes

After the course, a student will be able to model, compare and analyse different models of
computation, and can identify limitations of some computational models and possible
methods of proving them.

Unit Topics to be Covered Lecture Learning Outcome

No. Hours
1 Deterministic finite automaton (DFA), 12 To study the basic mathematical
Non-deterministic finite automaton model of a computing device.
(NFA), Equivalence between DFA and Such models will be linked
NFA, States minimization of DFA, through generators and grammars.
Regular languages and their
acceptance, Regular Grammar, NFA
with epsilon transitions, Regular
expressions, Pumping lemma for
regular languages Myhill-Nerode
theorem as characterization of regular
languages.
2 Context free grammars, Context free 12 This will help to understand the
languages, Ambiguity, Pushdown concepts of Pushdown automaton
automaton (PDA), Instantaneous and their languages.
descriptions of PDA, Language
acceptance by final states and by
empty stack, Equivalence of these two,
Pumping lemma for Context free
languages.
3 Turing machine (TM), their 10 This will help to study general
instantaneous descriptions, Language mathematical model of a
acceptance by a TM, Church-Turing computing device including
hypothesis, Code for TM, Recursively Church Turing hypothesis.
enumerable and recursive languages,

19
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

Existence of non- recursive

enumerable languages, Notion of
undecidable problems, Universal
language and universal TM.
4 Decidability and Undecidability; 05 This will help to develop the
Introduction to Computational understanding of computability
Complexity. and complexity theory.

Text Books:

1. M. Sipser, Introduction to the Theory of Computation, Thomson, 2005.

Reference Books:

1. P. Linz, An Introduction to Formal Languages and Automata, Narosa Publishing House, 2011.
2. J Hopcroft, J.D. Ullman, R Motwani, Introduction to Automata Theory, Languages and Computation,
Pearson, 2008.

20
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

Course Course Name of course L T P Credit

Type Code
DC MCD510 Complex Analysis 3 0 0 9

Prerequisite:
Construction of the field of real numbers, Review of sets, Sequences and series. Definitions and Basic
Theorems of Limit, Continuity and Differentiability on the real line. Mean Value Theorem. Uniform
convergence, Weierstrass Approximation Theorem. Partial derivatives, Characterization of continuously-
differentiable functions. Higher-order derivatives,Complex Numbers, Function of complex arguments and
Hyperbolic functions.
Course Objective:
The objective of this course is to introduce the fundamental ideas of the functions of complex variables and
developing a clear understanding of the fundamental concepts of Complex Analysis such as analytic functions,
complex integrals and a range of skills which will allow students to work effectively with the concepts.
Learning Outcome
After completing this course, students should demonstrate competency in the following skills: 1. Becoming
familiar with the concepts Complex numbers and their properties and operations with Complex number. 2.
Evaluating limits and checking the continuity of complex function. 3. Checking differentiability and Analyticity
of functions. 4. Evaluate Complex integrals and applying Cauchy integral.

Unit Topics to be covered Lecture Learning Outcome

No. Hours
1 Limits and continuity, differentiability of 8 To introduce fundamental results concerning
complex functions, Analytic functions, limits, continuity and careful treatment of
analytic branches of inverse of functions, analytic functions of complex variable.
branches of logarithm, Cauchy-Riemann
equations, and harmonic conjugates.
2 Complex integration, Cauchy's theorem, 8 To study the technical machinery that is
integral formula,Morera’s Theorem, required to introduce the complex line integral,
Liouville’s theorem,Cauchy’s inequality. also called the contour integral.
3 Series of complex functions, Taylor series, 6 To study the power series expansions for
Laurent series. analytic functions.
4 Zeros of an analytic function, Singularities 8 Zeros of an analytic function, Singularities and
and their classification, residue at a their classification, residue at a singularity,
singularity, residue at infinity and residue residue at infinity and residue theorem,
theorem, contour integrals. contour integrals.
5 Bilinear transformation: Bilinear 9 To study bilinear transformation, its various
transformation, conformal mapping, types and properties. Also, how the number of
elementary properties of the mapping of zeros of analytic functions remains constant
exponential, sine and cosine functions, under small perturbations have been studied.
fundamental theorem of algebra, Identity
Theorem Rouche’s Theorem.

Text Books:

1. R.V Churchill & J.W. Brown: Complex Variables and Applications, Mc-Graw Hill,

21
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

1990.
2. Alan Jaffery, Complex Analysis and Applications, Chapman and Hall/CRC, 2005.

Reference Books:

1. J. H. Mathews and R. W. Howell, Complex Analysis for Mathematics and

Engineering, Narosa, 1998
2. E. Kreyszig, Advanced Engineering Mathematics, 10th Ed., John Willey & Sons,
2010.

22
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

Course Course Name of Course L T P Credit

Type Code

DC MCD541 GPU Computing 3 0 0 9

Course Objective

Objective: Understand GPU Architecture: CUDA Device, Grid, Blocks,threads, Steaming

Multiprocessors (SMs), Warps and Memory organization, Multi-GPU progaming

Learning Outcomes

Upon successful completion of this course, students will:

 Skill of developing data-parallel programming for High Performance Computing
(HPC)
 Optimize CUDA Application Programmes
 Can use GPU Computing to analyse mathematical models

Unit Topics to be Covered Lecture Learning Outcome

No. Hours

1 GPU and CUDA programming 8 To understand GPU and CUDA

Architectures: Understanding programming Architectures
Parallelism with GPU, device Parallelism
memories and data transfer, kernel To understand thread
functions. Threads, Blocks, Grid, organization, synchronization
Warps: thread organization,
synchronization and transparent
scalability, thread assignment, thread
scheduling and latency tolerance.

2 Memories: Importance of Memory 8 To know the concept of Memories

Access Efficiency, Shared Memory, and their Importance as a
Global Memory, Constant Memory Limiting Factor to Parallelism
and Texture Memory, a Strategy for To understand Performance
Reducing Global Memory Traffic, concepts
Memory as a Limiting Factor to
Parallelism, Concepts of tiling.
Performance Considerations: More on
Thread Execution, Global Memory
Bandwidth, Dynamic Partitioning of
SM Resources

23
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

3 Floating Point Considerations: 8 To learn the basics of Floating-

Floating-Point Format, Representable Point Format, Representable
Numbers, Special Bit Patterns and Numbers
Precision, Arithmetic Accuracy and To understand the Arithmetic
Rounding, Algorithm Considerations. Accuracy and Rounding concepts
Streams and Multi GPU Solutions: To know the Streams and Multi
Atomic Operations, Single Stream, GPU Solutions concepts
Multiple Streams, GPU Work
Scheduling, Zero-Copy Host
Memory, Portable Pinned Memory

4 General purpose GPU computing with 7 To learn General purpose GPU

PyCUDA and PyOpenCL: An computing with PyCUDA and
overview of OpenCL,Important PyOpenCL
OpenCL concepts and Basic Program
Structure, NumbaPro

5 GPU Computing Applications- A Case 8 To apply the GPU Computing for

Study in Machine Learning in Case Study in Machine
Convolution Neural Networks, Learning
Convolution Layer, Reduction of
Convolution Layer to Matrix
Multiplication, cuDNN Library

Text Books:

1. Jason Sanders: CUDA by Example: An Introduction to General-Purpose GPU Programming, Edward

Kandrot, publisher Addison-Wesley Professional, 2010
2. David B. Kirk: Programming Massively Parallel Processors: A Hands-on Approac, Wen-mei W. Hwu,
Elsevier, 2016

Reference Books:

1. John Cheng, Max Grossman, Ty McKercher: Professional CUDA C Programming,John Wiley & Sons,
2014
2. Shane Cook: CUDA Programming: A Developer's Guide to Parallel Computing with GPUs
Applications of GPU computing series Morgan Kaufmann,Newnes, 2012
3. Dr. Brian Tuomanen:Hands-On GPU Programming with Python and CUDA: Explore high-performance
parallel computing with CUDA, Packt Publishing Ltd, 2018.

24
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

Course Course Name of Course L T P Credit

Type Code
DC MCO501 Discrete Mathematics 3 0 0 9

Course Objective
The objective of the course is to provide a background of mathematics that will be used in
theoretical computer science.

Learning Outcomes
Upon successful completion of this course, students will:
● learn about proof techniques;
● learn about combinatorics and graph theory;
● be able to relate the computer science problems using discrete mathematical
structures.

Unit Topics to be Covered Lecture Learning Outcome

No. Hours
1 Logic: Propositional and predicate 09 Students will learn predicate
logic, well-formed formulas, calculus which will help them in
tautologies, equivalences, normal converting statements as
forms, rules of inference, Proof mathematical statements. They
Techniques, will also learn several proof
techniques.
2 Boolean Algebra: Boolean Algebra, 03 Students will learn the algebra
Boolean Expressions, Optimization of behind the optimization of
Boolean Expressions, CNF, DNF, circuits.
Karnaugh Map, Quine McKluskey
Method
3 Set Theory: Sets and classes, Relations 05 Students will learn the concepts of
and functions, Recursive definitions, set theory and their uses.
Posets, Lattices, Zorn’s lemma,
Cardinal and Ordinal numbers
4 Combinatorics: Permutation and 08 Students will learn combinatorics
Combinations, Pigeonhole principle, from this unit.
Inclusion-Exclusion Principle,
Recurrence relations, Methods for
solving recurrence relations,
25
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

Generating Functions., Master

Theorem (without proof), Partitions
(Stirling and Bell Numbers),

5 Number theory: Modular Arithmetic, 07 This unit will help students in

Euclid's Algorithm, primes, Chinese learning basic modular arithmetic
Remainder, Public Key Cryptography, which can be used in theoretical
RSA algorithm. computer science.

6 Graph Structures: Graphs and 07 Students will learn about graph

Digraphs, Adjacency and Incidence structures and their uses in
matrices, Eulerian cycle and computer science.
Hamiltonian cycle, Trees, Counting
Spanning Trees

Text Books:

1. K. H. Rosen, Discrete Mathematics and its Applications, 6 thEdition, Tata McGraw Hill, 2007
2. J. L. Hein, Discrete Structures, Logic, and Computability, 3rdEdition, Jones & Bartlett Learning, 2009.

Reference Books:

1. R. P. Grimaldi, Discrete and Combinatorial Mathematics, 5 th Edition, Pearson Education, 2002.

2. J. P. Tremblay, R. Manohar, Discrete Mathematical Structures with Application to Computer Science,
McGraw Hill, 1975.

26
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

Course Course
Name of Course L T P Credit
Type Code
DC MCO502 Optimization Techniques 3 0 0 9

Course Objective
The course deals with the basic idea of mathematical programming (Linear and Nonlinear). We
shall see how simple mathematics plays a significance role in the development of these ideas.
Further, explore the different approaches to find the solution for the various Linear and Nonlinear
Programming Problems.
Learning Outcomes
Upon successful completion of this course, students will:
 have the basic nature of the convex set and its solution set.
 Known how we can optimize the path with the help of available resource.
 be able to solve the nonlinear and linear programming problem with different approaches.
 learn the different types of Queuing system according to service, time, etc.

Unit Lecture
Topics to be Covered Learning Outcome
No. Hours
Convex Analysis: Convex Set, Convex Understanding the fundamental
functions, Local and Global Extrema, concept of the convex set and its
1 Convex Hull, Supporting and Separating 4 solution set.
Hyperplane, Convex Cone, Differentiable
Convex function.
Network Analysis: Basic Concepts, Critical Student will be able to construct
Path Analysis, Program Evaluation Review the network diagrams with single
2 8
Techniques. and three time estimates of
activities involving in a project.
Dynamic Programming: Recursive Student will learn the new
Equation Approach, Dynamic approach to solve the linear
3 Programming Algorithm, Solution of 6 programming problem and their
Discreate D.P.P., Solution of L.P.P. by applications in solving a decision-
Dynamic Programming. problem.
Queuing Theory: Probability Distributions This unit will help student to
in Queuing Systems, Classification of identify and examine all possible
4 Queuing Models, Poisson Queuing 9 queuing system and description of
Systems:-{(M/M/1): (∞/FIFO)}, {(M/M/1) each of them.
:(∞/SIRO)}, {(M/M/1) :(N/FIFO)}.
Nonlinear Programming: General Student will be able to drive the
Nonlinear Programming Problem, optimality conditions for obtaining
Constrained Optimization with Equality an optimal solution for nonlinear
5 12
and Inequality Constraints, Saddle Point Optimization with Equality and
Problems, Kuhn-Tucker Conditions with Inequality Constraints.
Nonnegative Constraints.

27
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

Text Books:

1. Kwanti Swarup, P. K. Gupta and Man Mohan: “Operations Research”, Sultan Chand & Sons, 2017.

Reference Books:

1. Hamdy A. Taha: “Operations Research-An Introduction”, Pearson, 2016.

2. Hadley G..: “Linear Programming”, Narosa, 2002.
3. Frederick S. Hillier and Gerald J. Lieberman: “Introduction to Operations Research”, McGraw Hill,
2009.

28
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

Course Course
Name of Course L T P Credit
Type Code
DP MCC204 Computer Organization and Architecture Lab 0 0 2 2

Course Objective
To impart an understanding of the basic building blocks of the computer design. Enabling the
learner to understand the hardware design to carry out certain basic operations used for
computation. The understanding of the basic hardware design along with operations will help the
students to visualize the actual computer design along with the operations carried by it.
Learning Outcomes
After successful completion of the course, the students should be able to
1. Design circuits for the basic arithmetic operations, viz. addition, subtraction, multiplication etc.
2. Design circuits for converting BCD to different codes, viz. Gray code, Excess-3 code.
3. Design for Programmable Logic Array Implementation of a function
4. Design flip-flops: the basic memory element (RS, JK, D and T Flip-flops) with help of universal
gates.
5. Design Arithmetic and Logic Unit.

Sl. No. Name of Experiment/Lab Learning Outcomes

1. Realisation of Half Adder, Half Enable the students to design
Subtractor, Full Adder, Full Subtractor fundamental adder and subtractor
using basic gate ICs. circuits.
2. Realisation of 1-Bit and 2-Bit Comparator. The students will gain knowledge of
designing both 1-Bit and 2-Bit
comparator.
3. Realisation of Full Adder using 8×1 MUX. To understand how a Full Adder can be
implemented using multiplexer.
4. Realisation of Half Adder using 4×1 Dual Enable to design a Half Adder using
MUX. multiplexer.
5. Realisation of 1-Bit ALU using 4×1 Dual To develop the understanding and design
MUX and Realisation of 2×4 Line of arithmetic unit for performing some
Decoder using basic gate ICs. basic operations and design a decoder.
6. Realisation of 4-Bit ALU using IC 74181 This experiment will provide students the
and Realisation of RS, JK, D and T Flip- knowledge of designing ALU and flip
flops using NOR and NAND gate ICs. flops.

7. Realisation of 4-Bit Full Adder using IC The students will gain knowledge of
74283. designing 4-Bit Full Adder.

8. Realisation of 2-Bit Multiplier using basic This experiment will enable students to
gate ICs. design a multiplier.
9. Realisation of 1’s and 2’s compliment of To gain understanding of designing a
4-Bit binary number. circuit to obtain 1’s and 2’s compliment
of 4-Bit binary number.

29
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

10. Realisation of BCD to Grey code converter This topic will lead students to design and
and Grey to BCD code converter. understand the conversion of BCD code
to Grey code and vice-versa.
11. Realisation of BCD to Excess – 3 code The experiment will develop the design
converter and Excess – 3 to BCD code and understanding of BCD to Excess – 3
converter. code conversion and vice-versa.

12. Programmable Logic Array The students will gain the knowledge to
Implementation for a function. implement programmable logic array of a
function.

Text Books:

1. M. Morris Mano, Computer System Architecture. Dorling Kindesley Pearson, 2005.

2. Hamacher VC, Vranesic ZG, Zaky SG, Vransic Z, Zakay S. Computer Organization. New York et al.:
McGraw-Hill; 1984 Dec.

Reference Books:

1. M. Morris Mano, Digital Logic & Computer Design, 4/e, Pearson Education, 2013.
2. D. A. Patterson and J. L. Hennessy, Computer Organization and Design, 5/e, Morgan Kaufmann, 2013.

30
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

Course
Course Code Name of Course L T P Credit
Type
DP MCC302 GPU Computing Lab 0 0 2 2

Course Objective
To understand the concepts of General-Purpose GPU Programming
To understand GPU Architecture and Performance
To learn parallel programming on Single and Multiple GPUs
Learning Outcomes
Upon successful completion of this course, students will: Parallel programming skills on the GPU with
CUDA

Sl. No. Name of Experiment/Lab Learning Outcomes

1. Basic Programming and CUDA To write basic CUDA Programs

implementation

2. Programs -Hello world, a Kernel Call To write program to understand host, device
and Passing Parameters and global functions
3. Vector Sum and Dot Product To write CUDA program for vector addition and
Dot Product
4. Matrix-Matrix Multiplication To develop skill for writing Matrix-Matrix
Multiplication
5. Use of shared memory to reduce To write tiled Matrix-Matrix Multiplication and
Global Memory Traffic understand memory management

6. Programme on warp divergence issue To understand warp divergence through CUDA

program
7. Implementation of Min/Max/Sum To write CUDA porgramme for reduction
reduction algorithm algorithm and warp divergence

8. General purpose GPU computing with To understand CUDA pyCUDA, OpenCL

PyCUDA and PyOpenCL programming structure

9. An overview of OpenCL,Important To Write basic OpenCL program and use

OpenCL concepts and Basic Program of NumbaPro
Structure, NumbaPro
10. GPU Computing Applications- A Case Case study using GPU programming
Study in Machine Learning

Text Books:

1. Programming Massively Parallel Processors: A Hands-on Approach by David B. Kirk, Wen-mei W. Hwu,
Elsevier, 2010.
31
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

Reference Books:

1. Shane Cook: CUDA Programming: A Developer's Guide to Parallel Computing with GPUs
Applications of GPU computing series Morgan Kaufmann,Newnes, 2012.
2. Dr. Brian Tuomanen:Hands-On GPU Programming with Python and CUDA: Explore high-
performance parallel computing with CUDA, Packt Publishing Ltd, 2018.

32
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

Course Course
Name of Course L T P Credit
Type Code
DP MCC402 Software Engineering 0 0 2 2

Course Objective
Software Engineering is the core course of Computer Science which gives the Idea about Software
development process. The practical will impart a knowledge about how to implement the software
engineering principals in software development process.
Learning Outcomes
Students will learn about the implementation of various software development process.

Sl. Name of Experiment/Lab Learning Outcomes

No.
1. Implementation of COCOMO Model for Students will know about the implementation
cost estimation of COCOMO for cost estimation.
2. Implementation of COCOMO Model for Students will know about the implementation
time estimation of COCOMO for schedule estimation.
3. Implementation of Halstead metric. Students will get the idea about the
implementation of Halstead method.
4. Implementation of CPM. Students will get the idea about the
implementation CPM in project planning.
5. Implementation of PART. Students will get the idea about the
implementation PART in project planning.
6. Preparation of SRS for some defined Students will implement the SRS
project. development techniques for some real
project.
7. Development of structural design for some Students will implement the Structural
defined project. Design techniques for development of
Structure for some real software
development project.
8. Development of object model using UML Students will implement the UML design
techniques for some defined project techniques for some real project and they will
get an idea for developing UMLS in OOD
environment.
9. Design of Test suits for Black Box Testing. Students will get an idea how to develop test
suit using Black Box techniques
10. Design of Test Suits for White Box Students will get an idea how to develop test
Testing. suit using White Box techniques
11. Lab Exam Practical Examination will be conducted
after completion of the experiments and the
projects. The marks will be distributed
accordingly.

33
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

Text Books:

1. Software Engineering: A Practitioner’s Approach by R.S. PressMan, McGraw Hill.

Reference Books:

1. Fundamentals of Software Engineering by R. Mall, Prentice Hall of India.

2. An Integrated Approach to Software Engineering by P. Jalote, Narosa.

34
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

Course Course
Name of Course L T P Credit
Type Code
DP MCC506 Numerical Methods Lab 0 0 3 3

Course Objective
Due to immense development in the computational technology, numerical methods are more popular as
a tool for scientists and engineers. This branch of Mathematics dealt with to find approximation solution
of difficult problems such as finding roots of non-linear equations, numerical integration, numerical
solutions of the ordinary differential equations and partial differential equations with initial or boundary
conditions.
Learning Outcomes
It is expected that students will learn many algorithms to solve mathematical model with real data and
also enhance their programming skills.

Sl. No. Name of Experiment/Lab Learning Outcomes

1. Solution of tridiagonal system They will come to know to solve tridiagonal

system using C programming.
2. Solution of simultaneous non-linear They will come to know how to use Newton-
equations. Raphson method to solve system of
simultaneous non-linear equations using C
programming.
3. Numerical evaluation of double and triple They will come to know to evaluate definite
integrals with constant and variable limits. integrals by Trapezoidal, Simpson’s 1/3rd,
Simpson’s 3/8th and Weddle’s rule using C
programming.
4. Solution of linear and non-linear initial and They will learn to use Euler’s, Modified Euler’s,
boundary-value problems Milne’s, Runge-Kutta and finite difference
methods to solve IVP and BVP using C
programming.
5. Solution of Laplace and Poisson equations They will come to know to solve Laplace and
in two variables by five point formula. Poisson equation by finite difference method
using C programming.
6. Solution of Laplace equation in two They will Come to Know solution of Laplace
variables by ADI method, Solution of equation by ADI method using C programming.
mixed boundary value problem

7. Solution of parabolic partial differential They will Come to Know solution of parabolic
equation in two variables by explicit and partial differential equation by explicit and
implicit methods implicit method using C programming.

8. Solution of parabolic equation in three They will Come to Know how to solve parabolic
variables by ADE and ADI methods equation by ADE & ADI method using C
programming.

35
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

9. Solution of hyperbolic equation in two and They will Come to Know solution of hyperbolic
three variables by explicit and implicit partial differential equation by explicit and
methods implicit method using C programming.
10. Algorithm for hyperbolic equation in three They will Come to Know to solve hyperbolic
variables. partial differential equation in three variables
using C programming.

Text Books:

1. Numerical Mathematics and Computing, by Ward Cheney and David Kincaid, International Thomson
Publishing Company, (2013).
2. Analysis of Numerical Methods, by E. Isaacson & H. B. Keller, John Wiley & Sons. Dover
Publications, Inc., New York, 1966.

Reference Books:

1. Applied Numerical Analysis, by Curtis Gerald and Patrick Wheatley, Addison-Wesley. Pearson
Education India; 7 editions (2007).
2. Numerical Solution of Partial Differential Equations: Finite Difference Methods,
by G. D. Smith, Oxford University Press, 1985.

36
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

Course Course
Name of Course L T P Credit
Type Code
DP MCC512 Operating Systems Lab 0 0 3 3

Course Objective
To inculcate the Shell programming skill and its application.
To understand the concept of processes, threads, Scheduling and Deadlocks via programming

Learning Outcomes
Upon successful completion of this course, students will:
 able to know the fact and figures of computing programming with exposure of Shell
Programming with special reference to Process and thread creations, CPU Scheduling
Algorithms, Deadlock.

Sl. No. Name of Experiment/Lab Learning Outcomes

1. Introduction to Shell Programming: Students will Come to Know about the basics
Syntax, various commands etc. of shell Programming
2. Algorithm and coding for Shell They will Come to Know about the logic and
Programming coding skill of Shell programming
3. Execution of Shell Programming They will Come to Know about the execution
of Shell programming
4. Shell Programming continued Finally, They will Come to Know about Shell
programming skill
5. Programming based on Processes They will Come to Know about the
programming for process creation
6. Programming based on Threads They will Come to Know about the
programming for Threads creation
7. CPU Scheduling algorithms-FCFS They will Come to Know about the
programming for FCFS
8. CPU Scheduling algorithms-SJF They will Come to Know about the
programming for SJF
9. CPU Scheduling algorithms-RR They will Come to Know about the
programming for RR
10. CPU Scheduling algorithms- Priority They will Come to Know about the
programming for Priority
11. Programming based on Deadlock They will Come to Know about the
programming for Deadlock
12 Lab Exam

Text Books:
1. Abraham Silberschatz, Peter Baer Galvin and Greg Gagne, Operating Systems Principles, John Wiley and
Sons, 2005
Reference Books:
1. J. Archer Harris, Operating Systems, Mc Graw Hill,2002.
37
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

2. Y P Kanetkar, Unix Shell Programming, BPB Publication, New Delhi,1996.

Course Course Name of Course L T P Credit
Type Code

DP MCC513 Database Management Systems 0 0 2 2

Lab

Course Objective

The course will provide an understanding of data storage, manipulation and retrieval of
data. The objective of course is to provide fundamentals of DBMS to enable students with
Query optimization through DBMS (using Structured Query Language) and to learn about
Database implementation.

Learning Outcomes

Upon successful completion of this course, students will:

● have a broad understanding of database concepts and database management system
software and Structured Query Language (SQL).
● be able to model an application’s data requirements and to design database schemas
based on the conceptual model.
● be able to write SQL commands to create tables, triggers and indexes,
insert/update/delete data, and query data in a relational DBMS.

Lab Topics to be Covered Learning Outcome

No.

1 Introduction to MySQL. Database  Knowledge of MySQL software.

creation, Table creation, constraints.  Students will learn how to create database.
Logical and physical schema of
Database.
2 Data insertion, update/modification/ This will help students to learn how to
Delete and retrieval through implement basic queries in Database through
MySQL. MySQL.
Basic SQL structure. Query
implementation.
3 Enforcing integrity constraints This topic will help the students to understand
(Domain, Key constraints different integrity constraints and how to
(Primary/Foreign keys), NOT implement them through MySQL.

38
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

NULL, UNIQUE, DEFAULT,

Check).

4 Creating and updating View. Query Students will learn about the concept of view
implementation using View. through MySQL.

5 Use of aggregate functions (AVG, It provides understanding and use of different

COUNT, MIN, MAX, SUM) aggregate functions through MySQL.

6 Use of Join operator (Natural join, This topic will help the students to use
Outer join (left, right and full) different Join operators.

7 Query optimization through Nested Students will get the idea of optimization of
Query (Use of logical connectives, MySQL queries through nested query
set comparison operators, Union, structure.
Intersect, Except, Exists clauses)
8 Use of Group By and Having This will enable students to use some special
clause, Trigger creation clauses like: Group by, Having and will also
enable to enforce Trigger.
9 Index creation through SQL. Students will learn how to create index
through MySQL.

10-12 Mini-projects implementation in Mini-projects carried out by the students will

RDBMS environment. enable them to handle real world problems
using DBMS in RDBMS environment. This
component will enhance the creativity of
students and their understanding of DBMS.

Text Books:

1. Silberschatz, H.F. Korth and S. Sudarshan, Database System Concepts, 5th Edition,
McGraw Hill, 2006.

Reference Books:

1. Elmasri and Navathe, “Fundamentals of Database Systems”, 5thEdition,

PEARSON Education.
2. Peter Rob and Carlos Coronel, “Database Systems Design, Implementation and Management”,
Thomson Learning, 5th Edition.

39
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

Course Course Name of Course L T P Credit

Type Code

DE MCC501 Analysis 3 0 0 9

Prerequisite: Real Analysis (Functions of one variable: Limit, Continuity, Differentiability and Riemann
Integral) and Linear Algebra.

Course Objective

1. To introduce Calculus in several variables (concept of Limit, Continuity, Differentiability

in several variables). 2. To introduce the basics of Riemann Stieltjes and Lebesgue integrals.

Learning Outcomes

The students will be able to understand (i) the basic idea of Limit, Continuity, and
Differentiability in several variables and its applications in Geometry (ii) the basics of
Lebesgue integrals which extends the integral to a larger class of functions and also extends
the domains on which these functions can be defined.

Unit Topics to be Covered Lecture Learning Outcome

No. Hours

1 12 This unit will help students to

Functions of two or three variables, understand the concept of limit
Limit, Continuity, Differentiability, and continuity in several variables
Directional derivatives, Partial and to get Taylors expansion.
derivatives, Total derivative, Gradient, Students will also learn to find
Tangent Plane, Mixed derivative maxima and minima of a function.
Theorem, Mean value Theorem,
Extended Mean value Theorem,
Taylor’s Theorem, Chain Rule,
Maxima and minima, Saddle point,
Method of Lagrange's multipliers.

40
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

2 Unit II 09 Students will be able to

Functions of several variables: understand differentiation in
Differentiation, derivative as a linear several variables and their
Transformation, Jacobians, applications.
Contraction mapping principle,
Inverse and Implicit function
theorems.

3 Unit III 09 Students will get the idea of

Review of Riemann integral, Riemann Riemann Stieltjes integral and
Stieltjes integral, existence and its Improper integrals.
properties, Improper integrals.

4 Unit IV 09 Students will learn the basics of

Lebesgue measure, Measurable Lebesgue integrals
functions, Lebesgue integral.

Text Books
1. T. M. Apostol, Mathematical Analysis, 2nd Edition, Narosa, 2002.
2. H.L. Royden, Real Analysis, 4th Edition, Prentice Hall India, 2011.

Reference Books
1. S. R. Ghorpade and B. V. Limaye, A Course in Multivariable Calculus and Analysis, Springer, 2010.
2. T. M. Apostol, Calculus, Volume 2, 2nd Edition, Wiley, 2007.
3. W. Rudin, Principles of Mathematical Analysis, 3 rd Edition, McGraw-Hill, 2017.
4. I. K. Rana, An Introduction to Measure and Integration, 2nd Edition, Narosa, 2004.

41
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

Course Course Code Name of course L T P Credit

Type
DE MCC514 Functional Analysis 3 0 0 9

Prerequisite:
Construction of the field of real numbers, Linear Spaces, Algebra of linear transformations, Dual spaces,
Review of sets, countable & uncountable sets and Metric Spaces.
Course Objective:
Functional Analysis plays an important role in the applied sciences as well as in mathematics itself.
Consequently, it becomes more and more desirable to introduce the student to the field at an early stage of
study.
Learning Outcome
Functional analysis is an abstract branch of mathematics that originated from classical analysis. The impetus
came from applications: problems related to ordinary and partial differential equations, numerical analysis,
calculus of variations, approximation theory, integral equations, and so on.

Unit Topics to be covered Lecture Learning Outcome

No. Hours
1 Normed linear spaces and Banach 8 To study algebraic operations on linear space and the
spaces. concept of norm, metric of desired type.
2 Bounded linear operators, Bounded 8 In this unit the study and classification of linear
linear functionals, dual spaces. operators over the same scalar field has been
emphasized.
3 Hahn-Banach theorem, Uniform 7 To study the existence of non-zero bounded linear
boundedness principle, Open functionals on arbitrary non-zero normed space.
mapping theorem, Closed graph Some basic theorems for the development of general
theorem. theory of normed spaces has been discussed.
4 Strong and Weak convergence, Inner 9 To study mutual correspondence between Hilbert
product spaces, Hilbert spaces, space and its dual. To investigate the special theory
orthonormal sets, Riesz develop around the idea of mutually orthogonal sets.
representation theorem.
5 Adjoint operators, Self adjoint 7 To design and study the notion of several operators.
operators, Normal, Unitary operators
on Hilbert Spaces

Text Books:

1. E-Kreysing, Introductory Functional Analysis with Applications, John Wiley and Sons, 2019.
2. B. V. Limaye, Functional Analysis, 2nd edition, New Age International Publishers, 1996.

Reference Books:

1. G. F. Simmons, Introduction to Topology & Modern Analysis, Robert E. Krieger Publishing Company
Malabar, Florida 1983.

42
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

2. W Rudin, Functional Analysis Tata McGraw Hill, 1974.

Course Course
Name of Course L T P Credit
Type Code
DE MCC515 Topology 3 0 0 9

Course Objective
To explore the foundations of mathematics at a level and at depth for someone ambitious to study
the higher mathematics.
Learning Outcomes
After completion of the course, a student will able to realise what it means to do mathematics,
instead of only learning it or to do some computational exercises.

Unit Lecture
Topics to be Covered Learning Outcome
No. Hours
Basic Concepts of Topology, The Metric 11 To learn the foundations of
Topology, Basis, Sub-basis, Interior Points, topology.
1
Limit Points, Boundary Points, Closure of a Set,
Subspace topology.
First and Second Countable Topological 08 To know the concepts of
Spaces, Continuous Maps, Open Maps, Closed countable axioms alogwith
Maps, Homeomorphisms, Product Topology. continuity in topological
2
spaces. One can realize the
difference between geometry
and topology.
Connected Spaces, Path Connectedness, 06 To learn the concept of
3 Components and its properties, Quotient connected spaces alongwith
Topology. quotient topology.
Compact spaces and its properties, Local 08 To learn the concept of
4 compactness, One point compactification of a compact topological spaces.
topological Space, Tychonoff theorem.
Separation Axioms: Hausdorff Spaces, Regular 06 To learn the concept of
5 Spaces and Normal Spaces. separation axioms in
topological spaces.

Text Books:
1. J. R. Munkres: Topology, Prentice-Hall, 2015.
Reference Books:
1. G. F. Simmons: Introduction to Topology and Modern Analysis, Tata McGraw-Hill, 2017.
2. M.A. Armstrong, Basic Topology, Springer, 1983.

43
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

Course Course Name of Course L T P Credit

Type Code
DE MCC516 Computational Fluid Dynamics 3 0 0 9

Prerequisite:
Basics of continuum mechanics is desirable. Knowledge of computer algorithms such as Newton Raphson
Method, shooting method, finite difference methods etc. would be an added advantage.

Course Objective:
This course would intend the audience to learn fluid flow problems of realistic systems such
as flow through channels, heat engines, piston rings, heat transfer analysis using mathematical
techniques such as finite difference method, finite element method and so on.

Learning Objective:

After crediting this course, a student would be able to simulate real life systems in CFD such
as food processing, oil recovery, heat engines, structural mechanics and so on. Also, the
student would be able to do mathematical formulation and their relevance to convergence,
stability of numerical scheme thereby improving the space and time complexity.

Unit Topics to be covered No. of Learning Objective

No. Lectures

1 Introduction to Numerical Methods: 6 Understanding of basic principles

Finite Approximations, Discretization of numerical computing and
Approaches: Finite Difference procedures for solution of partial
Method, Finite Volume Method, Finite differential equations for real life
Element Method. Solution of Linear systems such as flow through
Systems, Solution of IVP &BVP, channels, porous media,
Shooting Method, Tridiagonal lubrication and so on.
Systems, LU decomposition,
Multigrid Methods, Coupled
Equations and their solutions.

44
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

2 Basic Concepts of Fluid Flow: 10 Motion of fluid flows and

conservation principles, Mass associated flow interactions and
Conservation, Momentum mathematics associated with
Conservation, Dimensional Forms of various type of geometrical
Equations, Mathematical properties.
Classification of Flows: Hyperbolic,
Parabolic, Elliptic and Mixed Type.

3 Methods for Unsteady Problems: 6 Applying numerical procedures to

Two level Methods, P-C and time dependent flows and to learn
Multipoint Methods, Application to associated nature of solutions.
the Transport Equation.

4 Finite Volume Methods: 8 To solve complex boundaries

Approximation of Surface and Volume with suitable modification of
Integrals, Boundary Conditions, numerical schemes.
Upwind Interpolation, QUICK
Scheme.

5 Stability, Convergences of 9 To know the efficiency of the

Numerical Schemes: numerical schemes.
Complex Geometries, Efficient,
Accuracy and convergency, Stability
criterion of Numerical Schemes.

Text Book:
1. J.H. Ferziger and M. Peric: Computational Methods for Fluid Dynamics, Springer (South Asian 2003
Reprint).
Reference Books:
1. P. Niyogi, S.K. Chakrabarty, M.K. Laha: Introduction to Computational Fluid Dynamics, Pearson
Education Asia, 2005.
2. John D. Anderson Jr.: Computational Fluid Dynamics, CRC Press, 2019 (Reprint).

45
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

Course Course Name of Course L T P Credit

Type Code

DE MCC531 Advanced Data Structures and 3 0 0 9

Algorithms

Course Objective

The objective of the course is to present the advanced data structures and algorithms in practice.

Learning Outcomes

Upon successful completion of this course, students will:

● have the practical implementation of algorithms using efficient data structures.
● be capable of analyzing, design and implementing advanced algorithms
● be exposed to the various methods of designing techniques

Unit Topics to be Covered Lecture Learning Outcome

No. Hours

1 Review of Basic Concepts, Asymptotic 04 Understanding of asymptotic

Analysis of Recurrences. notations and basic
mathematical preliminaries
used in analyzing algorithms.
2 Randomized Algorithms. Randomized 06 This unit will help the students
Quicksort, Analysis of Hashing algorithms. in understanding the
Algorithm Analysis Techniques - Amortized randomized algorithms and
Analysis. Application to Splay Trees. amortized analysis of running
time.
3 External Memory ADT - B-Trees. Priority 06 This will help in understanding
Queues and Their Extensions: Binomial heaps, the concepts and use of B-trees
Fibonacci heaps, applications to Shortest Path and various heaps.
Algorithms.
4 Partition ADT: Weighted union, path 05 Understanding of union and
compression, Applications to MST. path data structures and their
applications to MST.

5 Algorithm Analysis and Design Techniques. 05 To understand different

Dynamic Programming-Bellman-Ford, algorithm designing
Greedy Algorithms. techniques.

46
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

6 Network Flows-Max flow, min-cut theorem, 06 This will help students in

Ford-Fulkerson, Edmonds-Karp algorithm, knowing the concepts of
Bipartite Matching. network flows and their use in
designing various graph
algorithms.
7 NP-Completeness and Reductions, Cook’s 04 To know the concept of NP-
theorem, Satisfiability, completeness.

8 Beyond NP-completeness, Introduction to 03 Help the students in

different algorithms paradigms understanding what can be
done beyond NP-completeness.

Text Books:
1. T. H. Cormen, C. E. Leiserson, R. L. Rivest, C. Stein: Introduction to algorithms, PHI, 3rd Edition, 2010.

Reference Books:
1. M. A. Weiss, Data Structures and Algorithm Analysis, Addison-Wesley, 2nd Edition, 2013.
2. A. V. Aho, J. E. Hopcroft, J. D. Ullman, Data Structures and Algorithms, Addison-Wesley, 1st Edition,
1982.
3. S. S. Skiena: The Algorithm Design Manual, Springer, 2nd Edition, 2008.
4. J. Kleinberg, E. Tardos, Algorithm Design, Addison-Wesley, 1st Edition, 2005.

47
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

Course Course
Name of Course L T P Credit
Type Code
DE MCC532 Fundamentals of Machine Learning 3 0 0 09

Course Objective
To provide exposure to theory application of Machine Learning Techniques.

Learning Outcomes
This course will provide the students an exposure about how to use machine learning techniques
in Data Analytics.

Unit Lecture
Topics to be Covered Learning Outcome
No. Hours
Classification/Regression techniques such as This unit will help students to
Naive Bayes', decision trees, SVMs understand different
1 8 classification techniques
like: Naive Bayes', decision
trees, SVMs.
Boosting/Bagging and linear and non-linear This unit will help students to
regression, logistic regression, maximum understand the Application
2 likelihood estimates, regularization, basics of 9 of different regression
statistical learning theory techniques in Machine
learning.
Perceptron rule, multi-layer perceptron, This unit will help students to
backpropagation, brief introduction to deep get the concept of supervised
learning models learning like: ANN and their
3 9 different application in
classification, prediction and
other areas of Machine
Learning.
Dimensionality reduction techniques like PCA, This unit will help students to
ICA and LDA get the concept of different
4 6 dimensionality reduction
techniques which will be
useful for Big data analysis.
Unsupervised learning: Clustering, Gaussian This unit will help students to
5 mixture models, Some case studies 7 get the concept of different
unsupervised learning.

Text Book:
48
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

1. Andreas C. Müller and Sarah Guido, Introduction to Machine Learning with Python: A Guide for Data
Scientists.
Reference Books:
1. Kevin P. Murphy and Francis Bach, Machine Learning: A Probabilistic Perspective (Adaptive
Computation and Machine Learning series).
2. Shai Shalev-Shwartz and Shai Ben-David, Understanding Machine Learning: From Theory to Algorithms.

49
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

Course Course
Name of Course L T P Credit
Type Code
DE MCC535 Soft Computing 3 0 0 09

Course Objective
To provide exposure to theory application of soft computing techniques in Data Analytics.

Learning Outcomes
This course will provide the students an exposure about how to use computing techniques in
Data Analytics.

Unit Lecture
Topics to be Covered Learning Outcome
No. Hours
Fuzzy sets: Membership functions. This unit will help students
Basic operations, Fuzzy relations to understand Fuzzy logics.
1 11
Defuzzification, Fuzzy inference,
Fuzzy rule based system.
Genetic Algorithm: Working principle This unit will help students
Cross over mutation, roulette wheel selection, to understand the
tournament selection Application of Genetic
Population, binary encoding and decoding for algorithm.
2 11
any optimization problem
Multi objective GAs, Concepts on non-
domination, Tournament selection
Crowding distance operator, Ranking
Rough Sets: Lower and upper approximations,. This unit will help students
Discernibility matrix, Accuracy of to apply the concept of
3 9
Approximations rough sets and they will
learn to handle big data.
Hybridization of soft computing tools like Students will be able to
Neuro-fuzzy, apply different soft
4 Rough fuzzy, Rough-Fuzzy -GA, 8 computing techniques in
Ant Colony based optimization this unit.

Text Books:
1. G.J. Kl i r and B. Yuan, Fuzzy Sets and Fuzzy Logic: Theory and Applications, Prentice-Hall, 1995.

Reference Books:
1. M. Mi tchell, An Introduction to Genetic Algorithms, MIT Press, 2000.
2. R. L. Ha upt and S.E. Haupt, Practical Genetic Algorithms, John Willey & Sons, 2002.

50
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

Course Course Name of Course L T P Credit

Type Code

DE MCC539 Advanced DBMS 3 0 0 9

Course Objective

The course provides an introduction to the management of database systems. The course
emphasizes the understanding of the fundamentals of relational systems including data
models, database architectures, and database manipulations. The course also provides an
understanding of new developments and trends such as Internet database environment and
data warehousing.

Learning Outcomes

At the end of the course, the student will be able to:

 Understand terms related to database design and management
 Understand the objectives of data and information management
 Construct conceptual data models
 Implement relational databases using a RDBMS
 Retrieve data using SQL
 Understand the basics of data management and administration
 Understand the basics of data warehousing

Unit Topics to be Covered Lecture Learning Outcome

No. Hours

1 Object oriented model: Nested 9 At the end of this unit, students

relations, modelling nested relations as will be able to write complex data
object model, extension of SQL, object querries in SQL on relational
definition and query language (ODL, database models, set triggers, and
OQL), object relational database learn about data storage ance
model, storage and access methods. access methods.
Active databases, Advanced trigger
structures, SQL extensions.

51
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

2 Security and Integrity: Discretionary 11 At the end of this unit, students

and mandatory access control; will be able to write their first web
Facilities in SQL, access control application based on a distributed
models for RDBMS and OODBMS. database.
Distributed Database: Basic Structure,
fragmentation algorithms, trade-offs
for replication, query processing,
recovery and concurrency control;
Multi-database systems; Design of
Web Databases.
3 Data Mining and Warehousing: 11 At the end of this unit, students
Association Rule algorithms, will be able store and access data
algorithms for sequential patterns; from various database storage
Clustering and classification in data systems and mine ana analyze
mining; Basic structure of a data databases for making business
warehouse; Extension of ER Model, decisions.
materialistic view creation.
4 Online analytical processing and data 4 At the end of this unit, students
cube. Deductive databases, recursive will be able design deductive and
query construction, logical database logical databases and write
design and data log. recursive queries.

5 One or more of the following topics: 4 At the end of this unit, students
(i) Temporal database, (ii) Multimedia will gain in-depth understanding
database, (iii) Text retrieval and of the selected topic.
mining, (iv) Web mining, and (v) Any
topic of current interest.

Text Books:

1. Database System Concepts, Korth, Silberschatz and Sudarshan, McGraw Hill.

Reference Books:

1. Database: Principles, Programming, Performance, P. O'Neil, Morgan Koffman

2. Principles of Database and Knowledge-Base Systems, J.D. Ullman, Computer Science.

52
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

Course Course
Name of Course L T P Credit
Type Code
DE MCC540 Neural Network & Deep Learning 3 0 0 09

Course Objective
To provide exposure to theory application of ANN and Deep learning in Data Analytics

Learning Outcomes
This course will provide the students an exposure about how to use Neural Network and Deep
Learning in Data Analytics.

Unit Lecture
Topics to be Covered Learning Outcome
No. Hours
Introduction: Various paradigms of earning This unit will help students to
problems, Perspectives and Issues in deep understand deep learning.
1 8
learning framework, review of fundamental
learning techniques.
Feedforward neural network: Artificial Neural This unit will help students to
Network, activation function, multi-layer neural understand the concept of
2 8
network. ANN.

Training Neural Network: Risk minimization, This unit will help students to
loss function, backpropagation, regularization, get the concept different
model selection, and optimization. Conditional training methods of ANN.
3 Random 11
Fields: Linear chain, partition function, Markov
network, Belief propagation, Training CRFs,
Hidden Markov Model, Entropy.
Deep Learning: Deep Feed Forward network, This unit will help students to
regularizations, training deep models, dropouts, get the concept of different
4 Convolutional Neural Network, Recurrent 6 Deep Learning techniques.
Neural Network, Deep Belief Network.

Probabilistic Neural Network: Hopfield Net, This unit will help students to
Boltzman machine, RBMs, Sigmoid net, get the concept of different
Autoencoders. Deep Learning research: Object types of ANN..
5 7
recognition, sparse coding, computer vision,
natural language processing. Deep Learning
Tools: Caffe, Theano, Torch.

53
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

Text Book:

1. M. Nielsen, Neural Networks and Deep Learning, Determination Press, 2015.

Reference Books:

1. Charu C. Aggarwal, Neural Networks and Deep Learning: A Textbook, Springer, 2018.

54
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

Course Course Name of Course L T P Credit

Type Code

DE MCD401 Computer Graphics 3 0 0 9

Course Objective

Objective: The objective of the course is to present an introduction to Computer Graphics,

with an emphasis on how to develop realistic graphics model including games

Learning Outcomes

Upon successful completion of this course, students will:

 Upon successful completion of this course, students will:
 Have a broad understanding of Computer Graphics
 Programming of Graphics Models

Unit Topics to be Covered Lecture Learning Outcome

No. Hours

1 Graphics hardware and display 2 Understanding graphics hardware

devices; and display devices;

2 Graphics primitives- drawing lines and 5 Learn graphics primitives-

curves; drawing algorithms

3 2d and 3d transformations; segments 6 Help to understand 2D/3D

and their applications; transformations and geometric
projections

4 Generating curves, surfaces and 6 This will help design various

volumes in 3d, wire-frame models, objects using Cubic Spline, Bezier
Bezier and spline curves and surfaces; and spline curves and surfaces;

55
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

5 Geometric modeling- elementary 4 To understand elementary

geometric algorithms for polygons, modeling, constructive solid
boundary representations, constructive geometry and spatial data
solid geometry, spatial data structures; structures;

6 Hidden surface and line elimination; 5 To understand how to remove

hidden surfaces

7 Rendering- shading, light models, 5 This will help student in designing

realistic image synthesis techniques, more realistic models using
shading and liting

8 Textures and image-based rendering; 6 To understand textures-based

video games and computer animation. rendering, animation and how to
develop a video game using
OpenGL

Text Books:
1. Procedural Elements for Computer Graphics, by David Rogers, Tata McGraw-Hill, 2012
2. Mathematical Elements for Computer Graphics, by David F. Rogers and J. Alam Adams, 2 nd Ed. Tata
McGraw-Hill, 2011

Reference Books:
1. Computer Graphics Through OpenGL: From Theory to experiments, 2 nd Ed. By Sumanta Guha, CRC
Press, Taylor & Francis Group, 2014.
2. Computer Graphics with OpenGL, by Donald D. Hearn, M. Pauline Baker and Warren Carithers, Pearson
2011.

56
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

Course Course Name of Course L T P Credit

Type Code

DE MCD501 Classical Mechanics 3 0 0 9

Course Objective

Objective: To develop ability to understand concepts of classical mechanics to apply methods

used in the study to solve real world models

Learning Outcomes

Upon successful completion of this course, students will:

 Mastery of the Lagrangian theory, Kinematics of Rigid Body Motion, Hamilton-
Jacobi Theory,
 To understand Classical Chaos and Canonical Perturbation Theory

Unit Topics to be Covered Lecture Learning Outcome

No. Hours

1 Survey of the Elementary Principles, 8 To understand the Variational

Variational Principles and Lagrange's Principles and Lagrange's
Equations, The Central Force Problem. Equations, and The Central Force
Problem.

2 The Kinematics of Rigid Body Motion, 8 Be able to understand the

The Rigid Body Equations of Motion, Kinematics of Rigid Body Motion
Oscillations. and Oscillations.

3 The Classical Mechanics of the Special 7 To learn the Classical Mechanics

Theory of Relativity. of the Special Theory of
Relativity.

57
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

4 The Hamiltonian Equations of Motion, 8 To derive the Hamiltonian

Canonical Transformations, Hamilton- Equations of Motion
Jacobi Theory and Action Angle
Variables. To understand the Canonical
Transformations and Hamilton-
Jacobi Theory

5 Classical Chaos, Canonical 8 Be able to understand the concept

Perturbation Theory, Introduction to of classical Chaos
Lagrangian and Hamiltonian To understand the canonical
Formulations for Continuous Systems perturbation theory
and Fields. To learn the Lagrangian and
Hamiltonian Formulations for
Continuous Systems and Fields

Text Books:

1. Classical Mechanics (Third Edition) by Goldstein, Poole & Safko; Addison-Wesley, 2002.
2. Classical Mechanics, by John R. Taylor (University Science Books, 2005).

Reference Books:
1. Classical Dynamics by Jose & Saletan ; Cambridge University Press, 1998.
2. Classical Mechanics By John R. Taylor, University Science Books, 2005.
3. Classical Mechanics, By Matthew J. Benacquista, Joseph D. Romano, Springer, 2018.

58
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

Course Course
Name of Course L T P Credit
Type Code
DE MCD502 Graph Theory 3 0 0 9

Course Objective
The objective of the course is to introduce the concepts of graph theory in depth and different
structural parameters of graphs.
Learning Outcomes
Upon successful completion of this course, students will:
 have a broad understanding of the concepts, applications of graph theory in detail.
 have an ability to think and model different practical problems as graph theoretic problems.

Unit Lecture
Topics to be Covered Learning Outcome
No. Hours
Introduction to graphs, trees and their 10 Students will learn the basic
properties: Graphs, Representation of Graphs, definitions and concepts on
Various Special Graphs, Walk, Path, Trail, graphs such as graphs, graph
Degree Sequence of Graphs, Graph isomorphism, and trees.
1
Isomorphism, Trees and its characterizations,
Spanning Trees, Counting Spanning trees,
Algorithms for minimum weighted spanning
trees.
Matching and Cycles in Graphs: Matching, 08 This unit will help the students
Perfect matching, Augmenting path, Bipartite in understanding the graph
matching, Hall Marriage Theorem, Matching in parameters such as matching,
general graphs, Tutte’s Theorem, Min-Max Hamiltonian cycles, Eulerian
2 Theorems, Konig-Egervary Theorem, Eulerian cycles with their necessary and
tour and Seven Bridges problem, Hamiltonian sufficient conditions.
cycles and Travelling Salesman Problem,
Necessary Conditions for Hamiltonian Graphs,
Sufficient Conditions for Hamiltonian Graphs.
Coloring and Connectivity in graphs: Vertex 08 This will help in
Coloring, Edge Coloring, Brook’s theorem, understanding coloring,
Vizing Conjecture. Vertex and Edge connectivity, and important
3 Connectivity, Vertex- and edge-disjoint paths, theorems such as Tutte’s
testing connectivity, decomposing connected theorem and Menger’s
graph into blocks, Tutte's decomposition, edge- theorem.
connectivity, Menger’s Theorem.
Network Flows: Basic concepts on flows and 07 Students will learn the
4 networks, max-flow min-cut theorem, Ford- concepts of network flows.
Fulkerson algorithm.

59
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

Planarity in graphs: Planar graphs, Euler’s 06 Students will learn the famous
Formula, Outer Planar Graphs, Kuratowski Four Color Theorem along
5
Theorem, Four Color Theorem. with the concepts used in Four
Color Theorem.

Text Books:

1. D. B. West, Introduction to graph theory, 2nd Edition, Pearson Education, 2015.

Reference:

1. Bondy and U. S. R. Murthy, Graph Theory, Graduate Texts In Mathematics, Springer, 2008
2. R. Diestal, Graph Theory, Springer-Verlag, New York, 2000

60
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

Course Course Name of Course L T P Credit

Type Code
DE MCD503 Integral Equations and Calculus 3 0 0 9
of Variations

Course Objective

This course offers mathematical methods such as Integral Equations and Calculus of Variations and
highlights advantages over other methods in literature. Students will learn the utility of these methods
in solving real-world problems arising in mathematical physics and engineering.

Learning Outcomes

Upon successful completion of this course, students will:

 be able to formulate initial and boundary value problems arising in in mathematical physics
and engineering by using integral equations and variational calculus.
 be able to solve mathematical problems employing the techniques of integral equations and
variational calculus.
get strong foundation to understand Finite Element Method which uses variational calculus,
in higher studies.

Unit Lectu
No. Topics to be Covered re Learning Outcome
Hours
Volterra integral equations: Basic concepts, This topic helps student to
relationship between linear differential equations formulate initial value
and Volterra integral equations- resolvent kernel problems in terms of Volterra
1 7
of Volterra integral equations, solution of integral equations. It enables
integral equations by resolvent kernel. student to solve it by resolvent
kernel.
The method of successive approximations, Student will understand the
convolution type equations, Solution of Integro- approximate technique for the
Differential equation with the aid of Laplace solution of integral equation.
transformation. Volterra integral equations of Further, student will
first kind; Fredholm equations of the second understand the application of
2 7
kind: fundamentals, iterated kernels, Laplace transform as a method
constructing the resolvent kernel with the aid of of solution. Student will learn
iterated kernels. another kind of integral
equation and its methods of
solution.
61
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

Integral equations with degenerate kernels, This topic will help student to Text
characteristic numbers and eigenfunctions, find solutions through Books:
solution of homogeneous integral equations with characteristic numbers and 1. M. L.
3 degenerate kernel, nonhomogeneous symmetric 7 eigenfunctons. Moreover, Krasnov,
equations. Fredholm Alternative. student will investigate G. I.
solvability of the integral
equations.
Extrema of functionals: The variation of a Student will understand the
functional and its properties, Euler's equation, relation between a boundary
Field of extremals, sufficient and necessary value problem and equivalent
4 9
conditions for the extremum of a functional both functional. Further, student will
for weak and strong extrema. Legendre and learn certain conditions of
Weierstrass conditions. extremums for functional.
Hilbert invariant integral theorem, conditional Student will understand
extremum, moving boundary problems, problems with moving
discontinuous problems, one sided variations, boundaries and their variational
5 Direct methods: Euler’s finite difference method 9 formulation. Moreover, student
and Ritz method. will learn approximate
techniques to get extremum of
functional.
Makarenko and A. I. Kiselev, “Problems and Exercises in Integral Equations”, translated from the Russian
by George Yankovsky, 1975.
2. M. L. Krasnov, G. I. Makarenko and A. I. Kiselev, “Problems and Exercises in the Calculus of Variations”,
translated from the Russian by George Yankovsky, 1975.

Reference Books:
1. R. P. Kanwal, “Linear Integral Equations”, second edition, Birkhauser, Boston, Inc., Boston, MA, 1997.
2. L. Elsgoltz, “Differential Equations and the Calculus of Variations”, Mir Pub. Moscow, 1977.
3. M. Mesterton-Gibbons, “A Primer on the Calculus of Variations and Optimal Control Theory” AMS,
2009.

62
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

Course Course Name of Course L T P Credit

Type Code

DE MCD504 Measure Theory 3 0 0 9

Prerequisite: Real Analysis (Functions of one variable: Limit, Continuity, Differentiability and Riemann
Integral)

Course Objective

The modern notion of measure, developed in the late 19th century, is an extension of the
notions of length, area or volume. The objective of this course is to introduce the concepts of
measure and integral with respect to a measure, to show their basic properties, and to provide
a basis for further studies in Analysis, Probability, and Dynamical Systems.

Learning Outcomes

The student will be able (i) to understand the abstract measure theory and definition and main
properties of the integral (ii) to construct Lebesgue's measure on the real line and in n-
dimensional Euclidean space. (iii) use the concept of measure theory to solve the problems
related to probability theory, stochastic calculus and functional analysis.

Unit Topics to be Covered Lecture Learning Outcome

No. Hours

1 Semi-algebra, Algebra, Monotone 08 Students will be be able to

class, Sigma-algebra, Monotone class understand outer measure,
theorem, Outer measures, measures Lebesgue measure and Borel
and measurable sets, Outline of Measure and their properties.
extension of measures from algebras to
the generated sigma-algebras:
Measurable sets; Review of Lebesgue
Measure and its properties, Borel
measure.

2 Measurable functions, simple 09 This unit will help student to

functions, Egoroff’s theorem, Review understand Lebesgue integrals
of Lebesgue integral and its properties, and different convergence
monotone convergence theorem, thorem.
Fatou’s Lemma, Dominated

63
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

convergence theorem, various modes

of convergence and their relations.

3 Signed measures, Hahn and Jordan 09 Students will learn signed

decomposition theorems, Lebesgue- measures and the different
Radon-Nikodym theorem, Lebesgue decomposition theorems.
decomposition theorem, the
representation of positive linear
functionals on Cc(X).

4 Introduction to Lp-spaces, Riesz- 07 Students will be able to

Fischer theorem; Riesz Representation understand the basics of Lp-spaces
theorem for L2-spaces. Absolute and absolute continuity od
continuity of measures, Dual of L2- measures.
spaces.

5 Product measure spaces, iterated 06

integrals, Fubini’s and Tonelli’s Students will get the idea of
theorems, Outline of fundamental products measures spaces and
theorem of calculus for Lebesgue iterated integrals
integrals.

Text Books :
1. H.L. Royden, Real Analysis, 4th Edition, Prentice Hall India, 2011.

Reference Books:
1. I. K. Rana, An Introduction to Measure and Integration, 2nd Edition, Narosa, 2004.
2. G. D. Barra, Measure Theory and Integration, 2nd Edition, Woodhead Publishing, 2003.

64
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

Course Course Name of Course L T P Credit

Type Code
DE MCD506 Parallel Computing 3 0 0 9

Prerequisite: Basics of computer algorithms, data structures, Discrete Mathematics with C or

C++ or Python is desirable.
Course Objective:
This course would intend the audience to learn fluid flow problems of realistic systems such
as flow through channels, heat engines, piston rings, heat transfer analysis using mathematical
techniques such as finite difference method, finite element method and so on.

Learning Objective:

After crediting this course, a student would be able to simulate real life systems in CFD such
as food processing, oil recovery, heat engines, structural mechanics and so on. Also, the
student would be able to do mathematical formulation and their relevance to convergence,
stability of numerical scheme thereby improving the space and time complexity.

Unit Topics to be covered No. of Learning Objective

No. Lectures

1 Parallel Algorithms, MPI collective 9 The students will learn algorithms

communications algorithms, prefix using C, C++. Python for parallel
computations, Sorting, graph computing of simple algorithms
algorithms, list ranking, pre-order tree such as sorting and graph
traversal. algorithms.
2 Processor Arrays, Multiprocessors, 10 The student will be able to learn
and Multicomputer, speedup, scaled Architecture of parallel
speedup and parallelizability, Flynn’s computing issues
Taxonomy, Parallel Programming
Languages

3 Mapping and Scheduling, Elementary 10 The student will be in a position to

Parallel Algorithms, Matrix do matrix computation in parallel
Computations. programming

65
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

4 The Fast Fourier Transforms, Solving 10 Application of Mathematical

Linear Systems, Graph Algorithms, methods for real life systems with
Applications of Parallel Algorithms use of parallel computing
for real life systems such as Numerical
weather prediction, CFD, Image
Processing.

Text Book:
1. Michael J Quinn: Parallel Computing Theory and Practice, Tata McGraw-Hill, India, 2002.
Reference Books:
1. Ananth Grama et al: Introduction to Parallel Computing, Addison Wisely, 2003.

66
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

Course Course Name of Course L T P Credit

Type Code

DE MCD507 Representation Theory of Finite 3 0 0 9

Groups

Prerequisite: Group Theory and Linear Algebra

Course Objective

(i) To represent abstract algebraic objects like groups as subobjects of matrix groups and study
linear representations of finite groups. (ii) To classify all the irreducible representations of a
finite group, up to isomorphism.

Learning Outcomes

(i) Representation theory is used in many parts of mathematics, as well as in quantum physics.
After the course the students will be able to understand that. (ii) The students will be able to
use tools from linear algebra to solve abstract algebraic problems.

Unit Topics to be Covered Lecture Learning Outcome

No. Hours

1 Revision of basic group theory, 07 This unit will help students to

Representations, Subrepresentations, represent abstract algebraic
Sum and tensor product of objects like groups as subobjects
representations, Symmetric and of matrix groups and learn their
Alternating Squares representations, properties.
Irreducible representations

2 Characters, Schur's lemma, Maschke’s 10 Students will learn the basic idea
theorem, Orthogonality relations, of characters and irreducible
Decomposition of regular representations
representation, Number of irreducible
representations, canonical

67
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

decomposition and explicit

decompositions.

3 Representation of subgroups and 08 This unit will help students to

Product groups, Induced understand the representation of
representations. Examples of subgroups and product groups and
Representations for Cyclic groups, to classify all representations of
alternating and symmetric groups cyclic and symmetric groups.

4 Integrality properties of characters, 14 Students will be able undertand

Burnside's paqb theorem. The character irreducibility criterion and
of induced representation, Frobenius different applications of
Reciprocity Theorem, Meckey's representation theory.
irreducibility criterion, Examples of
induced representations,
Representations of supersolvable
groups.

Text Books :
1. J. P. Serre, Linear Representation of Finite Groups, Springer-Verlag, 1977.

Reference Books:
1. M. Burrow, Representation Theory of Finite Groups, Dover Publications, 2011.
2. N. Jacobson, Basic Algebra 2nd Edition, Dover Publications, 2009.
3. S. Lang, Algebra, 3rd Edition, Springer, 2005.

68
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

Course Course Name of Course L T P Credit

Type Code

DE MCD509 Algebraic Coding Theory 3 0 0 9

Course Objective

Objective: The objective of this course is to introduce the fundamental idea of the Coding
Theory

Learning Outcomes

The main outcome of this course is to develop the study of applications in Information and
Communication theory

Unit Topics to be Covered Lecture Learning Outcome

No. Hours

1 Basic Concepts: Idea behind use of 8 The main outcome of this unit is
codes, block codes and linear codes, to develop the idea of Linear
repetition codes, nearest neighbour codes and repetition codes and
decoding, syndrome decoding, their applications in decoding.
requisite basic ideas in probability,
Shannon’s theorem
(without proof)
2 Good linear and nonlinear codes: 8 The main outcome of this unit to
Binary Hamming codes, dual of a develop the idea of different kind
code, constructing codes by various of linear and nonlinear codes and
operations, simplex codes, Hadamard their corresponding bounds.
matrices and codes constructed from
Hadamard and conference matrices,
Plotkin bound and various other
bounds, Gilbert-Varshamov bound.

3 Reed-Muller and related codes: First 8 The main outcome of this unite to
order Reed-Muller codes, RM code of develop the idea of Reed Muller
order r, Decoding and Encoding using codes which is very useful in
the algebra of finite field with study of public key cryptosystem.
characteristic two.

69
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

4 Perfect codes: Weight enumerators, 8 The main outcome of this unit is

Kratchouwk polynomials, Lloyd’s to develop the idea of some
theorem, Binary and ternary Golay important codes like Golay codes,
codes, connections with Steiner and Perfect codes which are use
systems. full in decoding

5 Cyclic codes: The generator and the 10 The main outcome of this unit is
check polynomial, zeros of a cyclic discuss the different codes like
code, the idempotent generators, BCH BCH, Reed Soloman codes which
codes, Reed Solomon codes, Quadratic are very useful in Study of public
residue codes, generalized RM codes. key cryptosystem.

Text Books:
1. S. Ling and C. Xing, Coding Theory: A First Course, Cambridge University Press, 2004.

Reference Books:
1. J. H. van Lint, Introduction to Coding Theory, Springer, 1999.
2. W. C. Huffman and V. Pless, Fundamentals of Error Correcting Codes, Cambridge University Press, 2003.
3. J. MacWilliams and N. J. A. Sloane, The Theory of Error Correcting Codes, NorthHolland, 1977.

70
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

Course Course
Name of Course L T P Credit
Type Code
DE MCD511 Mathematical Ecology 3 0 0 9

Course Objective
Mathematical models are used extensively in many areas of the Biological/Ecological Sciences.
This course aims to give an ample knowledge of the constructions/formulations and analysis of
such models in Population Ecology/epidemiology.
Learning Outcomes
Upon successful completion of this course, students will:
 have a broad understanding of how to model the real life situations for a single population.
 It also provides broad idea about continuous, discrete and delay situations.
 It helps students in understanding the concept of formulating the model of two, three and
many interacting populations.
 It helps to understand how to effectively analyze the evolutionary trend of such models and
its stability behaviour.
 It helps students in formulating the spatial and spatiotemporal dynamics.
 It gives broad idea about well-known Lotka integral equations and its real applications.

Unit Lecture
Topics to be Covered Learning Outcome
No. Hours
Single species models, Exponential, logistic, It provides idea about how to
Gompertz growth, Harvest model, Delay model model the real life situations
1 and Discrete-time model. 8 for a single population. It gives
broad Idea about continuous,
discrete and delay situations.
Interacting population model, prey-predator, It provides idea of formulating
competition, mutualism models and the model of two, three and
Chemostate model. Kolmogorov Analysis. many interacting populations.
2 Equilibria and Stability Analysis. 9 How to effectively analyze the
evolutionary trend of such
models and its stability
behaviour.
Spatially structured models, Reaction–diffusion It helps students in formulating
systems, Dynamics of exploited populations. the spatial and spatiotemporal
3 9 dynamics. Also in
understanding the dynamics of
exploited populations.
Age-structured models, models of spread, sex- It helps to understand the
4 structured models, two sex models, Leslie 7 modeling and dynamics of age
matrix. and sex structured model.
It gives broad idea about well-
The Lokta integral equation, The McKendrick- known Lotka integral
5 6
von Foerster PDE. Gender-Structured Models. equations and its real
applications

71
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

Text Books:

1. M. Kot, Elements of Mathematical Ecology. Cambridge University Press, 2001.

2. J. D. Murray, Mathematical Biology I: An Introduction, Springer-Verlag, 1989.

Reference Books:

1. R.K. Upadhyay, S.R. K. Iyengar, Introduction to mathematical modeling and chaotic dynamics.
Chapman and Hall/CRC, 2013.
2. H. Malchow, S.V. Petrovskii, E. Venturino Spatiotemporal Patterns in Ecology & Epidemiology:
Theory, models and Simulation. Chapman and Hall/CRC, 2008.

Course Course
Name of Course L T P Credit
Type Code
72
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

DE MCD512 Nonlinear Dynamics and Chaos 3 0 0 9

Course Objective
The objective of the course is to foster the knowledge of dynamical system Theory and its wide
range of Applications to the students. It will help the students to visualize the various interesting
dynamics in real world scenario.
Learning Outcomes
Upon successful completion of this course, students will:
 have a broad understanding of the concepts Dynamical System Theory and their real world
applications.
 It also provides idea of analyzing the bifurcation scenario of different continuous and
discrete dynamical systems.
 It helps students in understanding the concept of chaotic dynamics and its visualization.
Also the concept of fractal dynamics in real life situations.
 It helps to understand the different types of extreme dynamics including crisis, transient
state, intermittency. Also idea about synchronization and control of chaos.
 Different approaches to solve nonlinear dynamical systems either by reducing the
dimensionality or removing the nonlinearity.

Unit Lecture
Topics to be Covered Learning Outcome
No. Hours
Dynamical systems- Attractors, SIC, 1D map, Broad understand of the
Logistic map, Poincare’ maps, generalized concepts of Dynamical
1 8
Baker’s map, Circle map. System Theory and their real-
world applications
Bifurcations - Saddle-node bifurcation, It provides idea of analyzing
Transcritical bifurcation, Pitchfork bifurcation, the bifurcation scenario of
PD bifurcation, Hopf-bifurcation, Global different continuous and
2 bifurcations of cycles, Melnikov’s method for 9 discrete dynamical systems.
homoclinic orbits. How to handle the extreme
situation when dynamics
changes?
Strange attractors and fractals dimentions, It helps students in
Henon map and Rossler system, Box-counting, understanding the concept of
pointwise and correlation, Hausdorff chaotic dynamics and its
3 9
dimensions, Lyapunov exponent, Horseshoe visualization. Also the concept
map and symbolic dynamics. of fractal dynamics in real life
situations.
Chaotic transitions, intermittency, crisis, It helps to understand the
quasiperiodicity, controlling and different types of extreme
synchronization of chaos. situation/dynamics including
4 7 crisis, transient state,
intermittency. Also idea about
synchronization and control of
chaos.
73
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

Central manifold theory and Normal form Different approaches to solve

theory and its Applications. nonlinear dynamical systems
5 6 either by reducing the
dimensionality or removing
the nonlinearity.

Text Books:
1. S. Wiggins, Introduction to applied nonlinear dynamical systems and chaos (Vol. 2). Springer Science &
Business Media, 2003.
2. S.H. Strogatz, Nonlinear Dynamics and Chaos with Applications to Physics, Biology, Chemistry, and
Engineering, 1994.

Reference Books:

1. R.K. Upadhyay, S.R. K. Iyengar, Introduction to mathematical modeling and chaotic dynamics. Chapman
and Hall/CRC, 2013.
2. L. Perko, Differential equations and dynamical systems, Springer Science & Business Media, 1991.

Course Course Name of Course L T P Credit

Type Code

DE MCD514 Sampling Theory 3 0 0 9

74
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

Course Objective

Government organizations and industries in private and public sectors need reliable data for
precise planning and its implementations. Sampling theory deals with the techniques for
collecting such required data in economical way.

Learning Outcomes

After completion of this course, students will be equipped with the knowledge of different
survey methodologies and data collection techniques required for planning and generation of
reliable estimates.

Unit Topics to be Covered Lecture Learning Outcome

No. Hours

1 Basic principles of sample surveys, 6 Gives the idea about

simple random sampling with and fundamentals of survey sampling
without replacement and related and some basic sampling
results. schemes.

2 Probability proportional to size 8 Gives the idea and exposure about

sampling, Horvitz-Thompson advance sampling schemes.
estimator, ordered and unordered
estimates, stratified random sampling,
allocation problems, post-
stratification.
3 Use of auxiliary information at 10 Gives the methods and techniques
estimation stage: Ratio, regression and for using the auxiliary
product methods of estimation for information at estimation stage in
population mean, two-phase (double) survey sampling.
sampling, cost consideration under
double sampling.

75
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

4 Cluster sampling, two-stage sampling 9 Gives the idea and exposure of

and systematic sampling. sampling schemes applicable in
more practicable situations.

5 Non-sampling errors, non-response 6 Tackles the situations of non-

problems, Warner’s randomized sampling errors arise due to non-
response technique for sensitive response and measurement errors.
characteristics, measurement errors in
sample surveys.

Text Books:
1. Cochran, W.G, Sampling Techniques, (1977) 3rd Ed, Wiley Eastern Ltd.
2. Mukhopadhyay, P.: Theory and Methods of Survey Sampling, 2nd Ed (2014), PHI Learning Pvt. Limitrd,
Delhi.

Reference Books:
1. Sukhatme P V., Sukhatme B. V. and Sukhatme S., and Ashok C.:Sampling Theory of Surveys with
Applications, IASRI New Delhi, 1984 Ed.
2. Murthy, M.N.: Sampling Theory and Methods, Statistical Publishing Society (1967),
Calcutta.
3. Des Raj and Chandhok P: Sampling Theory, Narosa Publications (1998), New Delhi.

76
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

Course Course Name of Course L T P Credit

Type Code

DE MCD516 Industrial Statistics 3 0 0 9

Course Objective

The objective of the course is to discover flaws or variations in the raw materials and the
manufacturing processes in order to ensure smooth and uninterrupted production. The course
focuses on the methods and processes of production and suggest further improvements in
their functioning. It will also help to study and determine the extent of quality deviation in a
product during the manufacturing process and to analyze in detail the causes responsible for
such deviation.

Learning Outcomes

Upon successful completion of this course, students will:

● Understand the philosophy and basic concepts of quality improvement and describe
the DMAIC process (define, measure, analyze, improve, and control).
● Students will be able to use the methods of statistical process control and able to
design, use, and interpret control charts for variables and attributes.
● Perform analysis of process capability and measurement system capability.
● Design, use and interpret exponentially weighted moving average and moving average
control charts.

Unit Topics to be Covered Lecture Learning Outcome

No. Hours

1 Quality assurance: Quality and 4 Understanding of basic principles

quality assurance, Methods of quality of quality assurance.
assurance, Introduction to TQM and
ISO 9000 standards
2 Control charts: Introduction to 12 Knowledge on different kind of
statistical quality control, chance and control charts. Ability to construct
assignable causes of variation, Choice different kind of control charts
of Control Charts, Rational Subgroups, and make decisions based on
Control Charts for Variables: 𝑥̅ and R them.
Chart, 𝑥̅ and S Chart, Control Chart for
Attributes: Control Chart for Fraction
Defectives, Control Chart for Defects,
Choice between Variable and Attribute

77
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

Control Charts, Shewhart Control

Chart, Modified Control Charts,
Process Capability Analysis- using
Histogram, Probability Plot.

3 Sampling plans: Acceptance 12 Idea about different sampling

Sampling Plan, Single-sampling for plans and their uses in industrial
Attributes, OC curve, Double, multiple problems.
and sequential sampling plans, Dodge-
Romig sampling plan, Acceptance
sampling by variables, Designing a
sampling plan with a specified OC
curve, sequential sampling by
variables, continuous sampling plans.
4 Advanced control charts: Process 11 Use of different advance methods
capability studies, Statistical aspect of for quality control.
six sigma philosophy, Control charts
with memory: CUSUM charts,
EWMA-mean charts, OC and ARL for
control charts; The Taguchi Method:
The Taguchi philosophy of quality,
Loss functions, SN ratios,
Performance measures.

Text Books:
1. D.C. Montgomery (2012). Introduction to Statistical Quality Control, 7th Ed., Wiley.
2. J.T. Rabbit and PA Bergle, The ISO 9000 book, 2nd Ed., Quality resources, Chapter-I.
Reference Books:
1. H.J. Mittag and H. Rinne (1993) Statistical Methods for Quality Assurance, Chapman & Hall, Chapters
1, 3 and 4.
2. E.G. Schilling, (1982) Acceptance Sampling in Quality Control, Marcel Dekker.
3. A.J. Duncan (1986) Quality Control and Industrial Statistics, 5th Ed., Irwin.
4. E.L. Grant and R.S. Leaven Worth (1980) Statistical Quality Control, McGraw-Hill.

78
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

Course Course
Name of Course L T P Credit
Type Code
DE MCD532 Data Mining 3 0 0 09

Course Objective
To provide exposure to theory of Data Mining.
Learning Outcomes
Students will get an idea about how to apply Data Mining techniques in Data Analytics.

Unit Lecture
Topics to be Covered Learning Outcome
No. Hours
Introduction: Introduction to data mining and This unit will help students to
knowledge discovery from databases. understand basics of Data
1 8
Scalability issues of data mining algorithms. Mining and Scalability issues
of data mining algorithms.
Introduction to Data warehousing: General This unit will help students to
principles, modelling, design, understand the concept of
2 implementation, and optimization. 11 Data warehousing.

Data preparation: Pre-processing, sub-sampling, This unit will help students to

feature selection. Associations, dependence understand the concept of
3 9
analysis, correlation, rule generation— a priori Data preparation techniques.
algorithm, FP Trees etc. and evaluation.
Cluster analysis and Outlier Detection, This unit will help students to
Temporal and spatial data mining: Mining understand the concept of
complex types of data. Advanced topics: High Cluster analysis and Outlier
performance computing for data mining, Detection, Temporal and
distributed data mining. spatial data mining: Mining
4 11
complex types of data.
Advanced topics: High
performance computing for
data mining, distributed data
mining.

Text Books:

1. J. Han, M.Kamber and J. Pie, Data Mining: Concepts and Techniques, Elsevier, 2012.

Reference Books:
79
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

1. M. J. Zaki and W. Meira, Data Mining and Analysis: Fundamental Concepts and Algorithms,
Cambridge University Press, 2014.
2. E. Frank, I. H. Witten and M. Hall, Data Mining: Practical Machine Learning Tools and
Techniques, Elsevier, 2017.

1. Course Course
Name of Course L T P Credit
Type Code
DE MCD535 Bioinformatics 3 0 0 09
80
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

Course Objective
This course will provide knowledge on Bioinformatics

Learning Outcomes
Students will learn about the application of Bioinformatics in Data Analytics.

Unit Lecture
Topics to be Covered Learning Outcome
No. Hours
Biological Databases: Organisation, searching This unit will help students to
and retrieval of information, accessing global understand how to Organize
1 bioinformatics resources using internet links. 9 searching and retrieval of
information, from Biological
Database.
Nucleic acids sequence assembly, restriction This unit will help students to
mapping, finding simple sites and understand about Nucleic
transcriptional signals, coding region acids sequence assembly,
identification, RNA secondary structure restriction mapping, finding
prediction simple sites and
2 10
transcriptional signals,
coding region identification,
RNA secondary structure
prediction

Similarity and Homology, dotmatrix methods, This unit will help students to
dynamic programming methods, scoring understand the concept of
systems, multiple sequence alignments, evolutionary relationships,
3 10
evolutionary relationships, genome analysis genome analysis.

Protein physical properties, structural properties This unit will help students to
– secondary structure prediction, understand the concept of
hydrophobicity patterns, detection of motifs, detection and prediction of
4 10
structural database (PDB). Genome databases, different Protein Database
Cambridge structure database, data mining tools and Genome Database.
and techniques, Structural Bioinformatics.

Text Books:

1. Gribkov, M., and Devereux, J. (Eds), Sequence Analysis Primer, Stockton Press, 1991.

Reference Books:
81
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

1. Mount, D.W., Bioinformatics: Sequence and Genome Analysis, Cold. Spring Harbor Laboratory Press,
2001.
2. Baxevanis, A.D., and Ouellette, B.F.F. (Eds), Bioinformatics: A practical guide to the analysis of the genes
and proteins, Wiley-Interscience, 1998.

Course Course Name of Course L T P Credit

Type Code

82
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

DE MCD537 Design of Experiments 3 0 0 9

Course Objective

In statistics, designing of an experiment means to decide about the methods and layout for
taking measurements during scientific, agricultural and industrial etc. experiments for
appropriate statistical analysis. The objective of this paper is to train the students for such
described activities.

Learning Outcomes

After completion of this course, students will be equipped with the knowledge of various
kinds of designing the experiment and analyzing the data generated from such activities.

Unit Topics to be Covered Lecture Learning Outcome

No. Hours

1 Analysis of variance one way and two- 5 Gives the idea about analyzing the
way (with m observations per cell) variations creep in the data due to
classifications various factors for complicated
situations.

2 Basic principles of design of 11 Gives the idea about

experiments, CRD, RBD and LSD and fundamentals of design of
their analysis, estimation of missing experiments and some basic
observations. designs.

3 Factorial experiments: 22, 23, 32 and 33 11 Gives the idea about factorial
experiments, confounding in 23 experiments, where different
factorial experiment. factors are considered at different
levels.

4 Balanced Incomplete Block Design 7 Gives the idea about incomplete

(BIBD), relation between their block designs arises in many
parameters. Intra and Inter block practical situations.
analysis of BIBD.

83
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

5 Split plot and simple lattice designs. 5 Gives the idea about split plots
and lattice designs when some
factors are harder to vary than
other factors.

Text Books
1. Das, M. N. & Giri, N. C.: Design and Analysis of experiments, 1986, 2nd Ed. (Wiley Eastern Ltd. New
Delhi).
2. Montgomery, D. C.: Design and Analysis of Experiments (1984, 2nd Ed.) (John Wiley & Sons, New
York).

Reference Books
1. Gupta, S. C. and Kapoor, V. K.: Fundamentals of Applied Statistics (1993, 3rd Ed.) (Sultan Chand, New
Delhi).
2. Cox, Gertrude M.: Experimental Designs, (1992 2nd Ed.), (Wiley).

Course Course
Name of Course L T P Credit
Type Code
DE MCD538 Time Series Analysis 3 0 0 09

Course Objective
84
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

To Provide idea about Time Series Analysis.

Learning Outcomes
This course will be useful for analysis of different financial market data, Business data.

Unit Lecture
Topics to be Covered Learning Outcome
No. Hours
Discrete parameter stochastic processes, strong This unit will help students to
and weak stationary, autocovariance and understand basics of Time
autocorrelation. Periodogram and correlogram Series, techniques for
1 analysis. Linear Time Series Models: 12 identifying different Time
Stationary and Non Stationary Models, model Series models.
identifications, parameter estimation and
forecasting.
Conditional Heteroscedastic models and their This unit will help students to
applications understand Heteroscedastic
2 9
models and their
applications.
Multivariate Time Series Analysis and their This unit will help students to
Applications get the concept Multivariate
3 8
Time Series Analysis and
their Applications
PCA and Factor Models and their applications This unit will help students to
get the concept of PCA and
4 6
factor models and their use in
Data Analytics.
Transfer Function models: identification, fitting This unit will help students to
and application. get the concept of Transfer
5 4 Function models with its
application in Data
Analytics.

Text Book:

1. Time Series Analysis, Forecasting and Control by Box and Jenkins, Pearson Education.

Reference Books:

1. Time Series Analysis and Its Applications with R Examples by R.H. Shumway & D.S. Stoffer.
2. Analysis of Financial Time Series by Ruey S. Tsay.
85
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

3. Time Series Analysis and Its Applications with R Examples by R.H. Shumway & D.S. Stoffer.

Course Course
Name of Course L T P Credit
Type Code
DE MCD539 Big data 3 0 0 09

Course Objective

86
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

To provide exposure to theory of Big data.

Learning Outcomes
Students will able to use Big data analysis in Data Analytics.

Unit Lecture
Topics to be Covered Learning Outcome
No. Hours
Basic Statistics and R, basic statistical concepts This unit will help students
1 with a brief review of R. 8 to understand of R and its use
in Statistical Analysis.
Relationships and Representations, Graph This unit will help students
Databases. Introduction to Spark 2.0 and to understand Relationships
2 9
Hadoop. and Representations, Graph
Databases.
Language processing, Analysis of Streaming This unit will help students
Data, Applications of ML Library, Basic Neural to get the concept Language
Network and Tensor Flow, Advance Tensor processing, Analysis of
Flow Streaming Data,
3 9
Applications of ML Library,
Basic Neural Network and
Tensor Flow, Advance
Tensor Flow.
Assessing Quality of Big Data Analysis, This unit will help students
Analysis of Images, OCR Applications, Analysis to get the idea about the
of Speech Signal, Page Rank like Search applications of Big data in
4 systems, Analysis of Streaming Data with Tensor 13 various areas like: Image
Flow, VoltDB, Data Flow Engines and other analysis, Speech and Signal
memory databases. analysis, analysis of Data
flow engine, etc. .

Text Book:

1. H. Karau, Learning Spark: Lightning-Fast Big Data Analysis, O’ Rielly Media Inc., 2015.

Reference Books:

1. EMC Education Services, Data Science and Big Data Analytics: Discovering, Analyzing, Visualizing and
Presenting Data, John Willey & Sons, 2015.
2. T. Harkness, Big Data: Does Size Matter? Bloomsbury Publication, 2015.

87
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

Course Course Name of Course L T P Credit

Type Code

DE MCD540 Biostatistics 3 0 0 9

88
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

Course Objective

During the process of life sciences, medicinal and clinical experiments, precious data are
being generated, which need careful and valid statistical analysis for drawing the meaningful
conclusions.

Learning Outcomes

The course content of this paper has been finalized so that it may be helpful to the students
who are intending to join the health sector or pharmaceutical industries.

Unit Topics to be Covered Lecture Learning Outcome

No. Hours

1 Statistical Methods in Clinical Trials: 7 Gives the exposure of statistical

Introduction and its phases I, II, III and tools applicable in clinical trials
IV, statistical designs-fixed sample of medical statistics.
trials design and Sequential design,
Randomization, Blinding.

2 Biological Assays, Feller’s theorem. 6 Gives the idea of biological

Dose-response relationships- testing procedures for estimating
qualitative and quantitative response. the concentration of a
pharmaceutically active
substance.

3 Data editing and transformations, 11 Gives the idea of various

Transformation in general: transformations and statistical
logarithmic, square root and power tests mostly applicable in life
transformations; transformations for sciences experiments.
proportions: angular, probit and logit
transformations. Outlying
observations: box plot, M- estimators.
Test for normality - p-p plot and q-q
plot and Kolmogorov-Smirnov test

89
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

4 Categorical Data Analysis: 7 Gives the exposure of regression

Categorical response data, logistic analysis in life sciences problems.
regression-odds ratio, Wald’s statistic,
logistic regression and its diagnostics
memory databases.

5 Repeated Measures ANOVA: One 8 Gives the idea of applications of

Way and Two Classified Data, analysis of variance and basic
Epidemiological study designs and its designs in life sciences.
analysis

Text Book:

1. Rastogi, V.B.: Fundamentals of Biostatistics, ANE Books, India.

Reference Books:

1. Jerrold H. Zar.: Biostatistical Analysis, Pearson.

2. Daniel W. W and CrossL. C.: Biostatistics: A Foundation for Analysis in the Health Sciences, 10th
Edition.
3. Sylvia Wasserthial and Smoller. Biostatistics and Epidemiology – A Primer for Health and Biomedical
professionals, 3rd Ed, Springer.

Course
Course Name of Course L T P Credit
Code
Type
DE MCD542 Video Analytics 3 0 0 09

Course Objective
To provide exposure to theory as well as practical systems used in Video Analytics.
Learning Outcomes

90
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

The students will learn the how to use Video Analytics to analyse Image data.

Unit Lecture
Topics to be Covered Learning Outcome
No. Hours
Introduction to Digital Image and Video This unit will help students to
1 Processing, Background Modeling. 8 understand basics Video
processing.
Object Detection and Recognition, Image and This unit will help students to
Motion Features, Multi Object Tracking. understand Object Detection
2 9 and Recognition, Image and
Motion Features, Multi Object
Tracking.
Trajectory Analysis, Activities and Events, This unit will help students to
Anomaly Detection, Compressed Domain get the concept Trajectory
Video Analytics, Multi Camera Surveillance, Analysis, Activities and
Camera Coordination, Video Indexing Events, Anomaly Detection,
3 11
Compressed Domain Video
Analytics, Multi Camera
Surveillance, Camera
Coordination, Video Indexing
Mining and Retrieval. Deep learning for Vision This unit will help students to
and Image Processing: CNN, RNN, Vision and get the concept of Mining and
Language: Image captioning, Visual Q & A. Retrieval. Deep learning for
4 11 Vision and Image Processing:
CNN, RNN, Vision and
Language: Image captioning,
Visual Q & A.

Text Book:

1. Richard Szeliski, Computer Vision: Algorithms and Applications, Springer 2010.

Reference Books:
1. Forsyth, D.A., and Ponce, J., Computer Vision: A Modern Approach, Pearson Education, 2003.

91
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

Course Course
Name of Course L T P Credit
Type Code
DE MCD544 Software Testing 3 0 0 09

Course Objective
To provide exposure to art of software testing
Learning Outcomes
Student will get an idea about how to generate test tools and how to automate the testing strategies.

Unit Lecture
Topics to be Covered Learning Outcome
No. Hours

92
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

Introduction to Software Testing: This unit will help students to

Fundamentals of Verification and Testing, understand fundamentals of
Review of software development models, Test Software Testing, concept of
Metrics, Software Testing Principles, Testing Software Quality, different
1 11
and Debugging, Software Quality, metrics related to software
Requirement Behaviour and Correctness, testing.
Fundamentals of Test Process, The Tester’s
Role in a Software Development Organization
Static Testing: Structured examination, Control This unit will help students to
flow & Data flow, Determining Metrics. understand about Static
2 6
testing techniques of
Software.
Dynamic Testing: Black Box Testing, Black This unit will help students to
Box Testing, Gray Box Testing, Intuitive and understand about Dynamic
3 6
Experience Based Testing. testing techniques of
Software.
Test Management: Test Organization, Test This unit will help students to
Planning, Test Strategies, Levels of Testing, get the concept of Test
Testing Tools Automation, Test Execution: Management: Test
4 Types of test Tools, Selection and Introduction 9 Organization, Test Planning,
of Test Tools. Test Strategies, Levels of
Testing, Testing Tools
Automation.
Testing Object Oriented Software: Introduction This unit will help students
to Object Oriented testing concepts, will learn about different
5 7
Differences in Object Oriented testing, testing methods about testing of
Object Oriented systems. Object Oriented Software.

Text Book:

1. G. J. Myers, C. Sandler and T. Badgett, The Art of Software Testing, John Willey & Sons, 2015.

Reference Books:

1. E. Dustin, T. Garrett and B. Gauf, Implementing Automated Software Testing: How to Save Time and
Lower Costs While Raising Quality, Pearson, 2009.
2. L. Tamres, Introducing Software Testing, Pearson, 2002.

93
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

Course Course Name of Course L T P Credit

Type Code

OE MCD540 Biostatistics 3 0 0 9

Course Objective

94
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

During the process of life sciences, medicinal and clinical experiments, precious data are
being generated, which need careful and valid statistical analysis for drawing the meaningful
conclusions.

Learning Outcomes

The course content of this paper has been finalized so that it may be helpful to the students
who are intending to join the health sector or pharmaceutical industries.

Unit Topics to be Covered Lecture Learning Outcome

No. Hours

1 Statistical Methods in Clinical Trials: 7 Gives the exposure of statistical

Introduction and its phases I, II, III and tools applicable in clinical trials
IV, statistical designs-fixed sample of medical statistics.
trials design and Sequential design,
Randomization, Blinding.

2 Biological Assays, Feller’s theorem. 6 Gives the idea of biological

Dose-response relationships- testing procedures for estimating
qualitative and quantitative response. the concentration of a
pharmaceutically active
substance.

3 Data editing and transformations, 11 Gives the idea of various

Transformation in general: transformations and statistical
logarithmic, square root and power tests mostly applicable in life
transformations; transformations for sciences experiments.
proportions: angular, probit and logit
transformations. Outlying
observations: box plot, M- estimators.
Test for normality - p-p plot and q-q
plot and Kolmogorov-Smirnov test

95
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

4 Categorical Data Analysis: 7 Gives the exposure of regression

Categorical response data, logistic analysis in life sciences problems.
regression-odds ratio, Wald’s statistic,
logistic regression and its diagnostics
memory databases.

5 Repeated Measures ANOVA: One 8 Gives the idea of applications of

Way and Two Classified Data, analysis of variance and basic
Epidemiological study designs and its designs in life sciences.
analysis

Text Books
1. Rastogi, V.B.: Fundamentals of Biostatistics, ANE Books, India.
Reference Books
1. Jerrold H. Zar.: Biostatistical Analysis, Pearson.
2. Daniel W. W and CrossL. C.: Biostatistics: A Foundation for Analysis in the Health Sciences, 10th
Edition.
3. Sylvia Wasserthial and Smoller. Biostatistics and Epidemiology – A Primer for Health and Biomedical
professionals, 3rd Ed, Springer.

Course Course Name of Course L T P Credit

Type Code

OE MCO401 Partial Differential Equations 3 0 0 9

Course Objective

96
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

This course will present a wide-ranging survey of many important topics in the theory of
partial differential equations (PDE), with particular emphasis on various modern approaches.
Students will learn about four important linear PDEs, nonlinear first order PDEs in higher
dimensions. This course will also cover conservation laws of PDEs which can be useful to
get a solution.

Learning Outcomes

Upon successful completion of this course, students will:

 understand the basic concepts such as diffusion and convection.

 be able to solve higher dimensional PDEs.
 learn about various techniques of solving linear and nonlinear PDEs.

Unit Topics to be Covered Lecture Learning Outcome

No. Hours

1 Introduction: Examples and well- 3 Common examples and typical

posedness, weak solutions. difficulties in solving PDEs.

2 Linear PDEs: Transport, Laplace, 9 Learn four basic linear PDEs

Heat, Wave equations. Solution which are underlying many
strategies. physical phenomenon.

3 Nonlinear first-order PDE: Method 9 Learn about various solution

of characteristics, Hamilton-Jacobi methods for nonlinear PDEs.
equations, conservation laws

4 Solution representation: Separation 9 Learn traditional and modern

of variables, similarity solutions, methods for solving PDEs in
transform methods, nonlinear to linear higher dimensions.
PDE, asymptotics, power series.

97
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

5 Sobolev spaces: Sobolev and Hoelder 6 Learn about the theory of linear
spaces, approximation by smooth partial differential equations
functions, inequalities, compactness

6 Second-order elliptic equations: 4 Learn weak solution structure,

Existence of weak solutions, existence principle, and
regularity, weak and strong maximum eigenvalues.
principles, eigenvalues of elliptic
operators

Text Books

1. Partial Differential Equations, Lawrence C. Evans, American Mathematical Society

Reference Books
2. An Introduction to Partial Differential Equations, Renardy M., and Rogers R., Springer

Course Course
Name of Course L T P Credit
Type Code
OE MCO402 Modeling and Simulation 3 0 0 9

Course Objective
The objective of the course is to understand why, what and how modeling. It will help the students
to apply Mathematical Modeling concepts to understand the real life problem and its real solutions
with the help of simulations.
Learning Outcomes
98
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

Upon successful completion of this course, students will:

 To apply Mathematical Modeling concepts to understand the real life problem and its
solutions.
 It also provides idea of analyzing the different continuous and discrete model systems.
 It helps students in understanding the concept of virus dynamics and its application in the
formulation of the models related to epidemic and eco-epidemic systems.
 It helps students in understanding the formulation and analysis of different models related
to Physical, atmospheric and mining systems.
 It helps to understand the formulation and analysis of different types of models in
Engineering and Neural systems.
 Also helps to understand the dynamics by performing the simulations.

Unit Lecture
Topics to be Covered Learning Outcome
No. Hours
Deterministic and stochastic models, To apply Mathematical
Continuous and Discrete models, Formulations, Modeling concepts to
Characteristics, Classifications, tools, understand the real life
1 11
techniques, modeling approaches, Modeling problem and its solutions.
diagram. Compartmental models, Dynamical
systems and its mathematical models.
Models from systems of natural sciences: It helps students in
single and interacting populations, prey- understanding the concept of
predator, competition, Epidemic models and its virus dynamics and its
Virus dynamics, Eco-epidemic models. Spatial application in the formulation
2 and spatiotemporal Models related models with 9 of the models related to
natural sciences, Epidemic and eco-epidemic epidemic and eco-epidemic
models. systems.

Modeling of physical, Atmospheric and It helps students in

mining systems: Models of Heating and understanding the formulation
Cooling, Henon-Heiles System, Models for and analysis of different
traffic flow, Models for vehicle dynamics, models related to Physical,
3 9
Lorenz’s model for global atmospheric atmospheric and mining
circulation, Model for detecting land mines, systems.
Crimes model. Arm race models, models of
Love affairs.
Modeling Engineering and Neural systems: It helps to understand the
Models from Mechanical and Electronics formulation and analysis of
systems. Hunt’s oscillator, Neural models of different types of models in
4 single neuron, Models with delay and fractional 10 Engineering and Neural
order dynamics, Matlab programs to study the systems. Also helps to
dynamics of the developed model systems. understand the dynamics by
performing the simulations.

99
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

Text Books:

1. R.K. Upadhyay, S.R. K. Iyengar, Introduction to mathematical modeling and chaotic dynamics. Chapman
and Hall/CRC, 2013.
2. S. Banerjee, Mathematical Modeling: Models, Analysis and Applications, 2004.

Reference Books:

1. E. Allman, J.A. Rhodes, Mathematical models in Biology: An introduction. Cambridge University Press
2004.
2. W. Gerstner, W.M. Kistler, R. Naud. L. Paninski, Neuronal Dynamics. Cambridge University Press2014.

Course Course Name of Course L T P Credit

Type Code

OE MCO403 Graph algorithms 3 0 0 9

Course Objective

100
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

The objective of the course is to give a rigorous introduction to graph algorithms and to
emphasize the role of graph theory in modeling applications and solving these applications
using graph algorithms.

Learning Outcomes

Upon successful completion of this course, students will:

● have a broad understanding of graph theory and corresponding algorithms.
● have an ability to think and model different practical problems as graph theoretic
problems and the difficulty in solving those in polynomial time.

Unit Topics to be Covered Lecture Learning Outcome

No. Hours

1 Basic definitions, Graph 02 Students will learn the basic

representations: Introduction to definitions on graphs and its
Graphs: Definitions of some basic representation on a computer.
terms, representation of graphs.

2 Graph Searching: BFS, DFS and 05 This unit will help the students in
their applications MST: Kruskal’s and understanding the searching
Prim’s algorithms, Implementation of problem and connectivity
these algorithms using advanced data problem in graphs.
structures
3 Paths in Graphs: Single source and 07 This unit will help the students in
all pair shortest path problem, Greedy understanding the various shortest
based solution, Dynamic path problems and the efficient
Programming based solution to All algorithms associated with those
Pairs shortest path problem

4 Planar Graphs: Basic properties, 06 Students will learn the planarity

Planarity testing algorithm and the algorithm on testing
planarity of a given graph

5 Networks: The Max-flow min-cut 07 This will help in various basic

theorem, max-flow algorithm algorithms in network flows.
Matching: Algorithm for Matching in Students will also learn the
Bipartite Graphs, Algorithm for concepts of matching in graphs
Matching in General Graphs,
Traveling Salesman problem:

101
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

and efficient algorithms to

compute the matching in a graph.

6 NP-Complete Graph Problems: 06 Students will learn the NP-

proving NP-Completeness, Methods complete graph problems and
to tackle NP-Hard Graph Problems methods to tackle these problems.

Approximation Algorithms for NP- 06 Students will learn approximation

7 Hard Graph Problems, Some Special algorithms for NP-hard graph
Graph Classes problems.

Text Books:
1. D. B. West: Introduction to graph theory, 2nd Edition, PHI, 2002.
2. M. C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Annals of Discrete Maths. 57, Elsevier,
2nd Edition, 2004.

Reference Books:
1. T. H. Cormen, C. E. Leiserson, R. L. Rivest, C. Stein: Introduction to algorithms, PHI, 3rd Edition, 2010.

Course Course
Name of Course L T P Credit
Type Code
E/SO1 MCC505 Probability and Statistics 3 0 0 9

Course Objective

102
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

To offer a foundation in probability theory and statistical inference in order to solve applied
problems and to prepare for more advanced courses in probability and statistics.
Learning Outcomes
This course provides a solid undergraduate foundation in both probability theory and mathematical
statistics and at the same time provides an indication of the relevance and importance of the theory
in solving practical problems in the real world.

Unit Lecture
Topics to be Covered Learning Outcome
No. Hours
1 Evaluation, interpretation of descriptive 5 To understand the nature and
statistics and assessing the behaviors of data. deviation of data.
2 Concept of probability and related theorems, 10 To understand the logic of
Random variables and probability distributions, probability. To find the
mathematical expectation, Moment generating descriptive statistics of
and characteristic functions. distribution through moment
generation function.
3 Inequalities; Markov and Chebyshev 6 To obtain the different
inequalities, law of large numbers and the probability bounds of data.
central limit theorem. Distribution of order
statistics and range
4 Probability Distributions: Discrete; uniform, 12 To Understand the concepts
bernoulli, binomial, negative binomial, of a random variable and
geometric, hyper geometric, Poisson, analyze the ideal patterns of
continuous; uniform, normal, lognormal, data.
cauchy, exponential, gamma, beta, weibull,
Sampling distributions: chi-square, t and F.
5 Correlation and regression; rank correlation, 6 To know the relationship
simple, multiple and partial correlation, plane of between variables and predict
regression, estimation of parameters of plan of (estimate) the value of
regression using method of least square. dependent variable.

Text Books:

1. Sheldon M. Ross, First Course in Probability, A, 9th Edition, Pearson, Boston, 2014.
2. V.K. Rohatgi and A.K. Md. Ehsanes Saleh, An Introduction to Probability and Statistics,
John Wiley & Sons, 3rd Edition, 2015
103
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

Reference Books:

1. Hogg, R.V., McKean, J.W. and Craig, A.T., Introduction to Mathematical Statistics. 7 th Edition,
Pearson, Boston, 2013.
2. S.C. Gupta and V.K. Kapoor, Fundamentals of Mathematical Statistics (A Modern Approach) 10 th
Edition, Sultan Chand & Sons, 2002.

Course Course
Name of Course L T P Credit
Type Code
E/SO2 MCE301 Operations Research 3 0 0 9

Course Objective

104
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

The course deals with the basic idea of linear programming. We shall see how simple mathematics
plays a significance role in the development of these ideas. Further, explore the different
approaches to find the solution for the various Linear Programming Problems.
Learning Outcomes
Upon successful completion of this course, students will:
 have different ways to solve the linear programming problem by graphically and analytically.
 Understand the nature of integer programming.
 be able learn various different ways to solve the Transportation and Sequencing Problem.
 be able to apply several strategies to win the game and Maximin and Minimax Principle for it..

Unit Lecture
Topics to be Covered Learning Outcome
No. Hours
Linear Programming Problem: Definition This unit helps to understand the
of various terms related to LPP, Statement fundamental concept and general
1 and proof of related theorems, Graphical 15 mathematical structure and solution
method, Simplex Method, Big M Method, technique of a linear programming
Degenerate LP problem, Duality in LPP. problem.
Integer Programming: Pure and Mixed This unit will help students to apply
Integer, Gomory’s cut, Gomory’s cutting plane methods to obtain
2 constraints, Fractional cut method. 6 optimal integer solution value of the
variable in a linear programming
problem.
Transportation Problem: NWCR, Matrix Students will recognize and solve
Minima and Vogel’s Approximation the transportation problem involving
Methods, Test for Optimality (MODI a large number of shipping routes.
Method), Assignment problem. Handle the problem of degenerate
3 Sequencing Problem: Processing n jobs 12 and unbalanced transportation
through 2 machines, Processing n jobs problem.
through k machines, Processing 2 jobs They can also solve some specific
through k machines. problem of scheduling n jobs on k
machines.
Theory of Games: Saddle points, Two- Students will be able to apply
person zero sum games with and without various methods to select and
saddle-points, Maximin and Minimax execute various optimal strategies to
Principle, Pure and mixed strategies, win the game. Minimax and
4 6
Graphical solution of 2 x n and m x 2 maximin principle to compute the
games, Dominance Property, Simplex value of the game, when there is a
method of solving m x n rectangular saddle-point.
games.

Text Books:
Kwanti Swarup, P. K. Gupta and Man Mohan: “Operations Research”, Sultan Chand & Sons, 2017.

Reference Books:
105
 Integrated M. Tech. [Mathematics & Computing] – Course Structure

1. Hamdy A. Taha: “Operations Research-An Introduction”, Pearson, 2016.

2. Hadley G..: “Linear Programming”, Narosa, 2002.
3. Frederick S. Hillier and Gerald J. Lieberman: “Introduction to Operations Research”, McGraw Hill,
2009.

106