Int. M. Sc.

In Mathematics & Computing Academic Regulation-2018

SYLLABUS
FOR

FIVE-YEAR INTEGRATED M.Sc. PROGRAMME

IN

MATHEMATICS & COMPUTING

NAAC – A Grade

DEPARTMENT OF MATHEMATICS
COLLEGE OF ENGINEERING & TECHNOLOGY
(An Autonomous and Constituent College of BPUT, Odisha)
Techno Campus, Mahalaxmi Vihar, Ghatikia,
Bhubaneswar-751029, Odisha, INDIA
www.cet.edu.in
Ph. No.: 0674-2386075 (Off.), Fax: 0674-2386182
Semester-1

1
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

Core 1: Discrete Mathematical Structures (IPCMH101)

Course Objectives:
1. Introduce different proof techniques and certain discrete structures and their theory
2. Introduce the role of discrete structure in Modelling applications.
3. Introduce the applications of discrete structures in computing.
4. Introduce computer representations of these discrete structures and designing algorithms on
these structures

Prerequisites: None.

Syllabus:
Module-I:
Propositional Logic: Propositions, connectives, well-formed formula, truth tables, logically
equivalent formulas, tautology, contradiction, contingency, concept of proof, inference rules and
natural deduction, completeness and soundness, predicate logic:existencetial and universal
quantifiers, laws of inference and natural deduction Proof techniques: Introduction to different
standard proof techniques such as trivial proofs, Vacuous proofs, Direct proofs, Proof by
Contrapositive (indirect proof), Proof by Contradiction (indirect proof, aka refutation) , Proof by
Cases (sometimes using WLOG), Proofs of equivalence, Existence Proofs (Constructive & Non-
constructive), Uniqueness Proofs, Mathematical Induction, Recursive definition and structural
induction

Module-II:
Set Theory: Review of Basic Set Operations, representation of set, finite and infinite set,
countability and uncountability, countability of rationals, uncountability of reals,
Relations: Relation and their properties, Partitions, Closure of Relations, Warshall’s Algorithm,
Equivalence relations, Partial orderings, lattice, topological ordering
Counting: sum and product rules, permutations and combinations, number of non-negative
integral solutions of a linear equation
Advanced counting techniques: Recurrence relation, Solution to recurrence relation, Generating
functions, pigeonhole principle and their applications, Principle of Inclusion and exclusion and
its application

Module-III:
Introduction to graph theory, Graph terminology, Representation of graphs: adjacency matrix,
incidence matrix, adjacency list, modeling applications using graphs, graph isomorphism,
connectivity, Eulerian graphs and their characterization, Hamiltonian graphs and sufficient
conditions for Hamiltonian, Shortest path problems, Planar graph, Graph coloring,
Introduction to trees, various characterizations of trees, Application of trees, Depth first search,
breadth first search, testing connectedness and acyclicity, Minimum Spanning tree: Kruskal’s
Algorithm, Prim’s Algorithm

Text Books:

2
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

1. Kenneth H. Rosen, “Discrete Mathematics and its Applications”, Sixth Edition, 2008,
Tata McGraw Hill Education, New Delhi. Chapters: 1, 2(2.4), 4, 6(6.1, 6.2, 6.4-6.6), 7,
8, 9
2. C. L. Liu and D. Mohapatra, “Elements of Discrete Mathematics”, Third Edition, 2008,
Tata McGraw Hill Education, New Delhi Chapters: 10 (10.1- 10.10), 11(11.1 – 11.7)
3. Douglas B. West, “Introduction to Graph Theory” 2e, PHI

Reference Books:
1. J. L. Mott, A. Kandel, T. P. Baker, “Discrete mathematics for Computer Scientists &
Mathematicians”, Second Edition, PHI.
2. Gosset “Discrete Mathematics “Second Edition, Wiley
3. NarsinghDeo, “Graph Theory with applications to engineering and computer science”,
PHI

Course Outcomes: After the successful completion of this course the students will be able to
1. Write an argument using logical notation and determine if the argument is or is not valid.
2. Apply counting principles to determine probabilities.
3. Demonstrate an understanding of relations and functions and be able to determine their
properties.
4. Model problems in Computer Science using graphs and trees.

3
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

Core 2: Calculus and Analytic Geometry (IPCMH102)

Course Objectives:
1. Understand the concept of asymptotes. Explain concepts of curve tracing, curvature which
forms the basis of many mathematical problems
2. Understanding the concept of partial derivatives and use it to compute the maxima and
minima of functions of two variables
3. Demonstrate the knowledge of solving integrals using Green’s theorem, Gauss theorem and
Stokes theorem
4. Demonstrate knowledge of geometrical figures such as sphere, cylinder, cone

Prerequisites: Understanding ofDifferentiation and Integration of functions.

Syllabus:
Module-I:
Asymptotes in Cartesian coordinates, intersection of curve and its asymptotes, asymptotes in
polar coordinates, curvature, radius of curvature for Cartesian curves, polar curves, Newton’s
method, centre of curvature, circle of curvature, chord of curvature. Cusp, Nodes & conjugate
points, Types of cusps, Tracing of curves in Cartesian, Parametric, and Polar coordinates, Trace
(Folium of Descartes, Strophoid, Astroid, Cycloid, Cardioids, Lemniscates of Bernoulli)

Module-II:
Functions of several variables, Limit and Continuity, Partial derivatives, Differentiability, Chain
rule, Directional derivatives, Gradient vectors, tangent planes, Extreme values and saddle points,
Lagrange multiplier,
Vector differential calculus: vector and scalar functions and fields, Derivatives, Curves, tangents
and arc length, double integral, triple integral, gradient, divergence, curl
Vector integral calculus: Line Integrals, Green Theorem, Surface integrals, Gauss theorem and
Stokes Theorem

Module-III:
General equation of the Sphere, intersection of a sphere and a plane, intersection of two spheres,
family of spheres, Intersection of a sphere and a line, Tangent plane, condition of tangency,
equation of a cone, Enveloping cone of a sphere, cylinder, Enveloping cylinder of a sphere,
Right circular cone & cylinder.

Text Books:
1. Differential Calculus by Shanti Narayan & P K Mittal, S. Chand Publication, Chapters 14
(14.1-14.6), 15, 16, 17
2. Calculus by M.J. Strauss, G.L. Bradley & K.J. Smith, 3rd edition, Pearson,Chapters 10
(10.1-10.2), 11 (11.1-11.8), 12, 13
3. Analytical Geometry of Quadratic Surfaces by B P Acharya & D C Sahu, Kalyani
publisher Chapters: 2, 3

Reference Books:
1. Analytical Solid Geometry by Shanti Narayan

4
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

2. Calculus and Analytic Geometry by G.B. Thomas and R.L. Finney, 9th edition, Addison-
Wesley Publishing Company.
3. Function of Several Variables by N C Bhattacharya

Course outcomes: After the successful completion of this course the students will be able to
1. draw the graph of some curves using curve tracing
2. compute partial differentiation of various functions and determine their maximum and
minimum values
3. apply gradient to solve problems involving steepest ascent and normal vectors to level
curves
4. apply Fundamental Theorem of Line Integrals, Green’s Theorem, Stokes’ Theorem, or
Divergence Theorem to evaluate integrals.

5
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

Core 3: Linear Algebra (IPCMH103)

Course Objectives:
1. Present basic concepts of matrices and matrix algebra.
2. Present methods of solving systems of linear equations.
3. Present basic concepts of vector spaces and of linear transformation.
4. Present methods of computing and using eigenvalues and eigenvectors.

Prerequisites:None

Syllabus:
Module-I:
Geometric interpretation of solution of system of equations in two and three variables; matrix
notation; solution by elimination and back substitution; interpretation in terms of matrices,
elimination using matrices; elementary matrices, properties of operations on matrices. Definition
and uniqueness; non-existence in general: singular matrices; calculation of inverse using Gauss-
Jordan elimination; existence of one sided inverse implies invertibility; decomposition of a
matrix as product of upper and lower triangular matrices. Vector spaces and Subspaces, Solving
Ax=0 and Ax=b, Linear Independence, Basis and Dimension, The four fundamental Subspaces,
graph and networks, Linear Transformations.

Module-II:
Orthogonal Vectors and Subspaces, Cosines and Projections onto Lines, Projections and Least
Squares, orthogonal Bases and Gram-Schmidt, The Faster Fourier Transform, Properties of the
determinant, formulas for the determinant, Expansion of determinant of a matrix in Cofactors,
Applications of Determinants.

Module-III:
Eigen values and eigenvectors, Diagonalisation of a Matrix, Difference equations and powers
A^k, Markov Matrices, Differential equations and e^At, stability of differential equation,
complex Matrices, unitary Matrices, similarity transformations, Jordan Form, minima, maxima
and saddle points, tests for positive definiteness, Test for positive definiteness, singular value
decomposition, minimum principles.

Text Book:
1. Strang, Introduction to Linear Algebra, 4th ed., Wellesley Cambridge Press.Chapters-1-5,
6.1,6.2,6.3,6.4.

Reference Books:
1. I.N. Herstein, Topics in algebra, 2nd edition, 1975.
2. M. Artin, Algebra, Prentice-Hall of India.
3. Hoffman and Kunze, Linear Algebra, 2nd ed., PHI.
4. S. Kumaresan, Linear Algebra, a geometric approach, PHI.
5. Dummit : Abstract Algebra , Wiley

6
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

Course outcomes: After the successful completion of this course the students will be able to
1. Use Gauss-Jordan elimination to solve systems of linear equations and to compute the
inverse of an invertible matrix.
2. Use the basic concepts of vector and matrix algebra, including linear dependence /
independence, basis and dimension of a subspace, rank and nullity, for analysis of
matrices and systems of linear equations.
3. Use the characteristic polynomial to compute the eigenvalues and eigenvectors of a square
matrix and use them to diagonalize matrices when this is possible; discriminate between
diagonalizable and non-diagonalizable matrices.
4. Orthogonally diagonalize symmetric matrices and quadratic forms.

7
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

GE 1: Physics-I (IOEPH101)

Course Objectives:
1. To know what central, conservative and central-conservative forces mathematically
understand the conservative theorems of energy, linear momentum and angular
Momentum.
2. To know the importance of concepts such as generalized coordinates and constrained
motion
3. To establish that Kepler’s laws are just consequences Newton’s laws of gravitation and that
of motion
4. To know about various types of oscillation undamped, damped and forced oscillations.

Syllabus:
Module-I
Motion of a system of particles: centre of mass, velocity, acceleration, momentum, Equation of
motion, Kinetic energy and angular momentum of centre of mass. Conservation of linear
momentum and angular momentum for system of particles, moment of inertia, parallel axis
theorem perpendicular axis theorem. Moment of inertia of cylinder and sphere. Rotational kinetic
energy and power, g by compound pendulum (bar pendulum). Gravitational force, field potential
energy and potential, gravitational potential and field at a point due to a thin spherical shell and a
solid sphere.

Module-II
Central force motion, reduction of two body problems into an equivalent one body problem,
general characteristics of central force motion. Derivation of Kepler’s laws of planetary motion
from gravitational force.
Relation between elastic constants. Torsion of a cylinder, bending of beams, expression for
bending moment, equation for bending, depression occurring at the free ends of a light, heavy
cantilever.
Viscosity of liquids, laminar flow through a narrow tube and Poisseuille’s formula surface
tension - pressure difference across curved membrane.

Module-III
Oscillation and Waves
Simple harmonic oscillator, damped harmonic oscillator, power loss, Q - factor, overdamped
motion, critical damping, forced vibration, resonance, sharpness of resonance. Mathematical
description of travelling waves, wave equation. Transverse waves in a stretched string
longitudinal waves in a gaseous medium.

Books:
1. Classical Mechanics -H Goldstein (Narosa)
2. Classical Mechanics - Rana AndJoag (TMH)
3. Introduction to Classical Mechanics -Takwale&Purnaik (TMH)
4. Mechanics -K R Simon (Addision Wesley)
5. Mechanics - D. S Mathur (S. Chand)
6. Properties of matter -Searle and Neaman (Arnold Publication)

8
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

7. Classical Mechanics -M. Das, P.K Jena (Sri krishna Publication)

8. Classical Mechanics -Kibble
Course Outcomes:
 State the conservation principles involving momentum, angular momentum and energy
and understand that they follow from the fundamental equations of motion
 Have a deep understanding of Newton’s laws, properties of matter.
 Solve for the solutions and describe the behavior of a damped and driven harmonic
oscillator in both time and frequency domains
 Describe the behavior of waves at interfaces (reflection, transmission, impedance) and
their behavior in dissipative media (damping)

9
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

SEC1: English for Communication(IOEMH102)

Course Objectives:
1. To introduce engineering students to the theory and practice of communication.
2. To equip them with both theoretical vocabulary and basic tools which will help them
develop as better communicators.
3. To initiate them to select literary texts and establish how these texts contribute to the afore-
mentioned objectives.

Syllabus
Module-I
Introduction to Communication:
1.1 Importance of Communication in English
1.2The process of communication and factors that influence the process of communication:
Sender, receiver, channel, code, topic, message, context, feedback, ‘noise’.
1.3 Principles of Communication.
1.4 Barriers to Communication & Communication Apprehension
1.5Verbal (Spoken and Written) and non-verbal communication, Body language and its
importance in communication.

Module-II
Phonetics and Functional Grammar
2.1 Sounds of English: Vowels (Monopthongs and Diphthongs), Consonants
2.2 Syllable division, stress (word, contrastive stress) & intonation
2.3 MTI and problem sounds
2.4Review of Parts of Speech
2.5 Subject and Predicate, Tense, Voice Change
2.6 Idioms and Phrasal Verbs

(Note:This unit should be taught in a simple, non-technical,application oriented manner,

avoiding technical terms as far as possible.)

Module-III
Reading Literature
Prose:
i) Stephen Leacock: My Financial Career
ii) Mahatma Gandhi: from My Experiments with Truth.
iii) O’Henry: The Last Leaf

Poetry:
i) Nissim Ezekiel: Professor
ii) Jack Prelutsky: Be glad your nose is on your face.
iii) Maya Angelou: Still I rise (Abridged)

REFERENCE BOOKS:
1. Paul V. Anderson, Technical Communication, Cengage Learning, 2014.

10
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

2. Leech, Geoffrey and Ian Swartik., A Communicative Grammar of English, Longman,

2003.
3. O’Connor, J.D., Better English Pronunciation, Cambridge University Press, 1980.
4. Wren & Martin, English Grammar and Composition, S. Chand,1995.

11
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

DSE 1: Fundamentals of computers & Programming in C (IOECS101)

Syllabus
Module-I:
Digital Logic Fundamentals: Logic Gates, Introduction to Multiplexer, De-multiplexer, Encoder,
Decoder & Flip-Flops.
Introduction to Computer Fundamentals: Basic architecture of computer, Functional units,
Operational concepts, Bus structures, Von Neumann Concept
Instruction code, Instruction set, Instruction sequencing, Instruction cycle, Instruction format,
addressing modes, Micro instruction, Data path, hardwired controlled unit, Micro programmed
controlled unit.
Generation of Programming languages, Compiler, Linker, Loader

Module-II:
C language fundamentals: Character set, Key words, Identifiers, data types, Constants and
variables, Statements, Expressions, Operators, Precedence and associativity of operators, Side
effects, Type conversion, Managing input and output
Control structures: Decision making, branching and looping.
Arrays: one dimensional, multidimensional array and their applications, Declaration, storage and
manipulation of arrays
Strings: String variable, String handling functions, Array of strings
Functions: Designing structured programs, Functions in C, Formal vs. actual arguments,
Function category, Function prototype, Parameter passing, Recursive functions.
Storage classes: Auto, Extern, register and static variables

Module-III:
Pointers: Pointer variable and its importance, pointer arithmetic and scale factor, Compatibility,
Dereferencing, L-value and R-value, Pointers and arrays, Pointer and character strings, Pointers
and functions, Array of pointers, pointers to pointers, Dynamic memory allocation
Structure and union: declaration and initialization of structures, Structure as function parameters,
Structure pointers, Unions.
File Management: Defining and opening a file, Closing a file, Input/output Operations in files,
Random Access to files, Error handling

Books:
1. William Stalling, “Computer Organization and Architecture” Pearson Education
2. Balagurusamy: “C Programming” Tata McGraw - Hill

Reference Books:
1. J. P. Hayes “Computer Architecture and Organization" McGraw Hill Education India.
2. H. Schildt – “C the complete Reference” McGraw - Hill
3. K.R. Venugopal, S.R. Prasad, “Mastering C, McGraw - Hill Education India

12
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

Lab 1 (GE Lab 1): Physics Lab-I (ILCPH101)

Course Objectives
• To introduce different experiments to test the basic understanding of physics
concepts.

List of Experiment
1. Determination of accurate weight of a body using balance by Gauss method.
2. Error analysis using Vernier caliper, screw gauge and spherometer.
3. Determination of velocity of sound by resonance column method.
4. To determine acceleration due to gravity by bar pendulum and study of the effect of
amplitude on time period.
5. To determine the acceleration due to gravity by Katter’s pendulum.
6. Verification of laws of vibration of string using sonometer.
7. Determination of Young’s modulus of wire by Searle’s method.
8. Determination of rigidity modulus of rod by static method.
9. Determination of surface tension of water by using capillary rise method.
10. Determination of viscosity of liquid by Poiseuille’s method.
11. Determination of specific heat of solid/liquid applying radiation correction.
12. To study the velocity of sound by Kundt’s tube.
13. Calculate surface tension of mercury by using capillary rise method.
14. To determine the moment of inertia of a flywheel about its axis of rotation.
15. To determine the Young’s modulus of a wire using optical lever method.

Course Outcomes
• The hands-on exercises undergone by the students will help them to apply physics
principles.

13
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

Lab 2 (SEC Lab 1): English for Communication Lab(ILCMH101)

Course Objectives:
1. The laboratory experience for this course aims at acquainting the learners with their
strength and weakness in expressing themselves, their interests and academic habits.
2. To improve their skills of LSRW (Listening, Speaking, Reading and Writing) through
mutual conversation and activities related to these skills.
3. To promote the creative and imaginative faculty of the students through practice
before the teacher-trainer.

There will be 10 sessions of 2 hours each. Lab sessions will give a platform for the students to
indulge in activities based on the first two modules of theory taught in the class room. All the lab
classes will be divided in such a manner that all the four aspects of language (LSRW) are
covered.

Ist session:
Speaking: Ice-breaking and Introducing each other (1 hour), Writing: Happiest and saddest
moment of my life (1 Hour)

IInd session:
Listening: Listening practice (ear-training): News clips, Movie clips, Presentation, Lecture or
speech by a speaker (1 Hour), Speaking: Debate (1 Hour)

IIIrd session:
Reading: Reading comprehension (1 Hour), Writing: Creative writing (Short story: Hints to be
given by the teacher) (1 Hour)

IVth session:
Reading: Topics of General awareness, Common errors in English usage (1 Hour), Writing:
Construction of different types of sentences (1 Hour)

Vth session:
Speaking: Practice of vowel and consonant sounds (1 Hour), Writing: Practice of syllable
division (1 Hour)

VIth session:
Speaking: My experience in the college/ or any other topic as per the convenience of the student
(1 Hour), Writing: Phonemic transcription practice (1 Hour).

VIIth session:
Listening: Practice of phonetics through ISIL system and also with the help of a dictionary
(1Hour), Speaking: Role-play in groups (1 Hour)

VIIIth session:

14
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

Speaking: Practice sessions on Stress and Intonation (1Hour), Writing: Practice sessions on
Grammar(Tense and voice change)(1 Hour)

IXth session:
Speaking: Extempore, (1 Hour),Writing: Framing sentences using phrasal verbs and idioms (1
Hour).

Xth session:
Watching a short English movie (1 Hour), Writing: Critical analysis of the movie (1 Hour).

REFERENCE BOOKS:
1. Lab Manual Cum Workbook, English Language CommunicationSkills, Cengage
Learning, 2014.

Note: 70 marks will be devoted for sessions, 10 marks for record submission, 10 marks for viva-
voce and 10 marks for project work.

End term assignment: Students are required to make a project report of at least5 pages on a
topic on the following broad streams: Technology, General awareness, Gender, Environment,
Cinema, Books and the like. The assignment should involve data collection, analysis and
reporting.

15
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

Lab 3 (DSE Lab 1): Programming in ‘C’ Lab (ILCCS101)

(Minimum 10 programs to be done covering 8 Experiments)

Experiment No. 1
a) Write a C program to find the sum of individual digits of a positive integer.
b) A Fibonacci sequence is defined as follows: the first and second terms in the sequence are
0 and 1. Subsequent terms are found by adding the preceding two terms in the sequence.
Write a C program to generate the first n terms of the sequence.
c) Write a C program to generate all the prime numbers between 1 and n, where n is a value
supplied by the user.

Experiment No. 2
a) Write a C program to calculate the following Sum:
Sum=1-x2
/2! +x4
/4!-x6
/6!+x8
/8!-x10/10!
b) Write a C program to find the roots of a quadratic equation.

Experiment No. 3
a) Write C programs that use both recursive and non-recursive functions
i) To find the factorial of a given integer.
ii) To find the GCD (greatest common divisor) of two given integers.
iii) To solve Towers of Hanoi problem.

Experiment No. 4
a) Write a C program to find both the larges and smallest number in a list of integers.
b) Write a C program that uses functions to perform the following:
i) Addition of Two Matrices
ii) Multiplication of Two Matrices

Experiment No. 5
a) Write a C program that uses functions to perform the following operations:
i) To insert a sub-string in to given main string from a given position.
ii) To delete n Characters from a given position in a given string.
b) Write a C program to determine if the given string is a palindrome or not

Experiment No. 6
a) Write a C program to construct a pyramid of numbers.
b) Write a C program to count the lines, words and characters in a given text.

Experiment No.7
a) Write a C program that uses functions to perform the following operations:
i) Reading a complex number
ii) Writing a complex number

16
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

iii) Addition of two complex numbers

iv) Multiplication of two complex numbers
(Note: represent complex number using a structure.)

Experiment No. 8
a) Write a C program which copies one file to another.
b) Write a C program to reverse the first n characters in a file.
(Note: The file name and n are specified on the command line.)

Book: - PVN. Varalakshmi, Project Using C Scitech Publish

17
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

Semester-2

Core 4: Algebra – I (IPCMH201)

Course Objectives:
1. Demonstrate knowledge and understanding of groups, subgroups, cosets of a subgroup,
normal subgroup, quotient groups.
2. To build concept of group homomorphism and isomorphism.
3. Demonstrate knowledge and understanding of permutation groups and their properties.
4. To understand basic concepts of ring, field and their special classes.

Prerequisites: Set, Relation, Mapping.

Syllabus:
Module-I:
Preliminary Notations, Group Theory: Algebraic structures, Groups, Some Examples of
Groups, Subgroups, A Counting Principle, Cosets, Normal Subgroups and Quotient Groups.

Module-II:
Group Homomorphisms, Isomorphisms, Automorphisms, Permutation Groups.
Ring Theory: Definition & Example of Rings, Some Special Classes of Rings. Unique
factorization domain, Principal ideal domain, Euclidean domains, polynomial rings over UFD.

Module-III:
Field, Pigeon Hole Principle, Homomorphisms, Ideals, Quotient Rings., More Ideals and
Quotient Rings, The Field of Quotients of an Integral Domain, Euclidean Rings, A particular
Euclidean Ring.

Text Books:
1. Topics in Algebra, by I. N. Herstein, Wiley Eastern.
Ch. 1, Ch. 2.1, 2.2, 2.3, 2.4, 2.5, 2.6, 2.7, 2.8, 2.10, Ch. 3.1, 3.2, 3.3, 3.4
2. P.B. Bhattacharya, S. K Jain and S.R.Nagpaul: Basic Abstact Algebra, Cambridge
University Press. Chapter: 5 (Art 2,3), 7(Art 1,2), 11 (Art 1-4)

Reference Books:
1. Modern Algebra by A. R. Vasishtha, Krishna PrakashanMandir, Meerut.
2. Topics in Algebra by P.N. Arora, Sultan Chand & Sons.

Course outcomes: After the successful completion of this course the students will be able to
1. use various canonical types of groups (including cyclic groups and groups of
permutations) and canonical types of rings (including polynomial rings and modular
rings),
2. analyze and demonstrate examples of subgroups, normal subgroups and quotient
groups,ideals and quotient rings,
3. use the concepts of isomorphism and homomorphism for groups, rings and fields,
4. produce rigorous proofs of propositions arising in the context of abstract algebra.

18
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

Core 5: Analysis – I (IPCMH202)

Course Objectives:
1. To understand concepts of real numbers, open sets and closed sets.
2. Demonstrate knowledge and understanding of sequences, their convergence
conditions, limits of sequences.
3. To understand basic concepts of infinite series and their convergence.
4. To gain knowledge on continuous and discontinuous functions.

Prerequisites: Set Theory

Syllabus:
Module-I:
Bounded and unbounded sets, Infimum and supremum of a set and their properties, Order
completeness property of R, Archimedian property of R, Density of rational and irrational
numbers in R, Dedekind form of completeness property, Equivalence between order
completeness property of R and Dedekind property. Order completeness in R, Neighbourhood,
Open set, Interior of a set, Limit point of a set, Closed set, Countable and uncountable sets,
Derived set, closure of a set, Bolzano- Weierstrass theorem for sets.

Module-II
Sequence of real numbers, Bounded sequence, limit points of a sequence, limit interior and limit
superior convergent and non-convergent sequences, Cauchy’s sequence, Cauchy’s general
principle of convergence, Algebra of sequences, Theorems on limits of sequences,
Subsequence’s, Monotone sequences, Monotone convergence Theorem. Infinite series and its
convergence, Test for convergence of positive term series, Comparison test, Ratio test, Cauchy’s
root test, Raabe’s test, Logarithmic test, Integral test, Alternating series, Leibnitz test, Absolute
and conditional convergence.

Module-III:
Continuous and discontinuous functions, Types of discontinuities, Theorems on continuity,
Uniform continuity, Relation between continuity and uniform continuity,

Text Books:
1. S.C. Malik and Savita Arora: Mathematical Analysis(4th Edition), New Age
International (P) Ltd. Publishers.Ch 1(1.3,1.4),Ch 2,Ch 3,Ch 4(4.1-4.8,4.10),Ch 5

Reference Books:
1. G. Das & S. Pattnaik: Fundamentals of Mathematical Analysis, TMH
2. R. G. Bartle and D.R. Sherbert, Introduction to Real Analysis (4th Edition), Wiley.
3. K. A. Ross, Elementary Analysis: The Theory of Calculus, Under graduate Texts in
Mathematics, Springer (SIE), Indian reprint, 2004.
4. Sudhir R Ghorpade and Balmohan V. Limaye, A course in Calculus and Real
Analysis, Undergraduate Text in Math., Springer (SIE). Indian reprint, 2004.

19
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

Course outcomes: After the successful completion of this course the students will be able to
1. determine if sets are open, closed. Recognize convergent, divergent, bounded,
Cauchy and monotone sequences.
2. calculate the limit superior, limit inferior, and the limit of a sequence.
3. recognize alternating, convergent, conditionally and absolutely convergent series.
4. determine if a function is discontinuous, continuous, or uniformly continuous.

20
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

Core 6: Probability Theory (IPCMH203)

Course Objectives:
1. To measure a recorded observation or a long history of collected data.
2. To determine the probability of a given outcome than subjective measurements.
3. Understand the concept of random variables
4. Demonstrate knowledge of probability distribution functions

Prerequisites: Permutation & Combination, Set Theory.

Syllabus:
Module-I
Sample space, events, Definitions of probability, Addition law of probability, Multiplication law
of probability, Conditional probability, Bayes theorem.
Random experiment, trial, sample point and sample space, events, operations of events, concepts
of equally likely, mutually exclusive and exhaustive events. Definition of probability: Classical,
relative frequency and axiomatic approaches. Discrete probability space, properties of
probability under set theoretic approach. Independence of events, Conditional probability, total
and compound probability theorems, Bayes theorem and its applications.

Module-II:
Random variables – discrete and continuous probability distributions, probability function and
probability density function (pdf), Cumulative distribution function (cdf). Joint distribution of
two random variables, marginal and conditional distributions. Independence of random variables.
Expectation of a random variable, Expectation of sum and product of random variables,
conditional expectation. Moment generating functions and their applications

Module-III:
Moments, moment generating function (m.g.f.) its properties,Probability distributions: Binomial,
Poisson, Hyper geometric, Geometric and Negative Binomial. Uniform (discrete & continuous),
Normal, Exponential. Normal and Poisson distributions as limiting case of binomial distribution.
Weak law of large numbers, Central limit theorem.

Text Books:
1. Fundamentals of Mathematical Statistics by S.C.Gupta&V.K.Kapoor, S Chand &
Sons.
2. Parzen, E.S.: Modern Probability Theory and its Applications.
3. Meyer, P.: Introductory Probability and Statistical Applications.
Reference Books:
1. StirzekarDavid:ElementryProbability, Cambridge University Press.
2. Mood A.M., Graybill F.A. and BoesD.C.:Introduction to the theory of Statistics,
McGraw Hill.
3. Mukhopadhyay, P: Mathematical Statistics, new central book agency.

Course outcomes: After the successful completion of this course the students will be able to

21
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

1. demonstrate basic probability axioms and rules and the moments of discrete and
continuous random variables as well as be familiar with common named discrete and
continuous random variables,
2. derive the probability density function of transformations of random variables and use
these techniques to generate data from various distributions,
3. translate real-world problems into probability models,
4. read and annotate an outline of a proof and be able to write a logical proof of a
statement.

22
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

GE 2: Physics -II (IOEPH201)

Course Objectives:
The major concepts covered are
1. The abstraction from forces to fields using the examples of the electric and magnetic
fields, with some applications
2. The connection between conservative forces and potential energy
3. The close connection between electricity and magnetism, leading to the discovery of
electromagnetic waves.
4. The integral form of Maxwell's Equations
5. The course will provide the students about the electronic Components diode,
transistor, Oscillators
6. It will give the knowledge of switching circuit.

Syllabus:
Module-I
Scalar and vector triple product, Differentiation of a vector, The gradient operator, The
divergence and curl of vector, Gauss divergence theorem, Strokes theorem. Gauss law in
electrostatics and application, Computation of field due to linear spherical and plane charge
distribution, Differential form of Gauss law, the energy of a point charge, discrete and
continuous distribution, energy density of electrostatic field.

Module-II
Magnetic field B, Lorentz force law, The Biot savart law B due to a straight, circular, and
solenoidal currents. The vector potential, Ampere circuital law & its differential form.
Differential form of electromagnetic induction.

Module-III
Maxwell equation and physical significance, Wave equation, Electromagnetic waves, Wave
properties, speed, growth and decay current in RC and LR circuits, impedance, Power in ac
circuit, power factor, series and parallel resonant circuits, Sharpness of resonance, Bandwidth
and Q - factor.

Module-IV
Rectifier:
Half wave & full wave rectifier (semiconductor devices) Principle, circuit, operation & theory.
Use of L & π filters in rectifier circuits (qualitative idea)
Amplifier:
Classification of amplifier, comparison, Voltage & power gain in CB, CE &CC configuration
and characteristics studies, RC coupled amplifier, Class B Push/pull amplifier (principle of
amplification circuit description operation, theory and frequency response curve), feedback
Amplifier: Basic circuit, operation, advantage of negative feedback.
Oscillator

23
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

Necessary of feedback, positive & negative feedback, criteria for sustained oscillation, Hartly
and colpitt’s oscillator (principle, circuit, operation, theory and use),
Modulation & demodulation:
Principle of modulation, A.M & F.M (Theory and differences between them), Principle of
demodulation.

Books:
1. Introduction to Electrodynamics -D. J Griffiths (PHI)
2. Foundation of electromagnetic theory -Ritz and Milford (Narosa)
3. Electricity and magnetism -E. Purcell (Berkely Physics Course)TMH
4. Electronics -Chattopadhyay &Rakshit (New Age)
5. Electronics - B. B Swain
6. Electricity and magnetism -D. C Tayal
7. Electricity and magnetism -Satyaprakash

Course Outcomes:
1. The use of Coulomb's law and Gauss' law for the electrostatic force
2. The relationship between electrostatic field and electrostatic potential
3. The use of the Lorentz force law for the magnetic force
4. The use of Ampere's law to calculate magnetic fields
5. The use of Faraday's law in induction problems
6. The basic laws that underlie the properties of electric circuit elements
7. The study of electronics devices makes the base of student in the electronic field.

24
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

AECC 1: Communication in Practice (IOEMH202)

Course Objectives:
1. To introduce students to various building blocks of communication, both within and
outside their formal articulations.
2. To train students in the basic science of writing and help them use the same in various
sites such as report, paragraph etc.
3. To create conditions in the classroom that encourages students to engage in
meaningful conversation.

Module - I
Basics of Communication in Practice
1.1 Types of Communication in an organization: Formal (internal and external) and
Informal (grapevine)
1.2 Communication Channels: Upward, Downward, Diagonal and Horizontal
1.3 Introduction to cross-cultural communication.
1.4 Bias-free communication & use of politically correct language in communication
1.5 Importance of reading and ethics of writing
1.6 Negotiation Skills, Argumentation & Consensus building.

Module-II
Business Writing
2.1 Skills of Writing: Coherence, Cohesion, Sentence Linkers, Clarity of Language and
stylisticvariation, process of writing.
2.2 Paragraph writing: Topic Sentence, Supporting sentence & Concluding sentence, Logical
structuring (Inductive approach and deductive approach)
2.3 Letters, Applications
2.4 Reports and Proposals
2.5 Memos, Notices, Summaries, Abstracts& e-mails
2.6 Writing a CV/Resumeˈ: Types of CV
2.7 Writing a Cover letter

Module -III
Speaking and Presentation
3.1 Oral Presentation: 4 P’s of presentation, PPT
3.2 Group Discussion: Structured and Un-structured, Various types of topics (abstract,
absurd, contemporary etc.)
3.3 Types of Interview: Preparing an Interview and techniques
3.4 Grooming and dress code, Personality development

REFERENCE BOOKS:
1. Carol M Lehman, Debbie D Dufrene and Mala Sinha., Business Communication,
Cengage Learning. 2nd Edition. 2016.
2. Anderson, Paul.V, Technical Communication, Cengage Learning, 2014.
3. Bovee, Courtland. L. et al., Business Communication Today, Pearson, 2011.
4. Jeff Butterfield, Soft Skills for Everyone, Cengage Learning, 2015

25
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

DSE 2: Data Structure Using C (IPECS201)

Course Objectives:
1. To impart the basic concepts of data structures and algorithms.
2. To understand concepts about searching and sorting techniques.
3. To understand basic concepts about stacks, queues, lists, trees and graphs.
4. To understanding about writing algorithms and step by step approach in solving
problems with the help of fundamental data structures.

Prerequisites: C-programming language.

Syllabus:
Module-I
Introduction to data structures: storage structure for arrays, sparse matrices, Stacks and Queues:
representation and application. Linked lists: Single linked lists, linked list representation of
stacks and Queues. Operations on polynomials, Double linked list, circular list.
Module-II
Dynamic storage management-garbage collection and compaction, infix to post fix conversion,
postfix expression evaluation. Trees: Tree terminology, Binary tree, Binary search tree, General
tree, B+ tree, AVL Tree, Complete Binary Tree representation, Tree traversals, operation on
Binary tree-expression Manipulation.
Module-III
Graphs: Graph terminology, Representation of graphs, path matrix, BFS (breadth first search),
DFS (depth first search), topological sorting, Warshall’s algorithm (shortest path algorithm.)
Sorting and Searching techniques – Bubble sort, selection sort, Insertion sort, Quick sort, merge
sort, Heap sort, Radix sort. Linear and binary search methods, Hashing techniques and hash
functions.

Text Books:
1. Gilberg and Forouzan: “Data Structure- A Pseudo code approach with C” by Thomson
publication
2. “Data structure in C” by Tanenbaum, PHI publication / Pearson publication.
3. Pai: “Data Structures & Algorithms; Concepts, Techniques & Algorithms”, Tata McGraw
Hill.

Reference Books:
1. “Fundamentals of data structure in C” Horowitz, Sahani& Freed, Computer Science
Press.
2. “Fundamental of Data Structure” ( Schaums Series) Tata-McGraw-Hill.

Course Outcomes: After the successful completion of this course the students will be able to
1. choose appropriate data structure as applied to specified problem definition.
2. handle operations like searching, insertion, deletion, traversing mechanism etc. on
various data structures.
3. apply concepts learned in various domains like DBMS, compiler construction etc.
4. use linear and non-linear data structures like stacks, queues , linked list etc.

26
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

Lab 4 (GE Lab 2): Physics Lab II (ILCPH201)

Course Objectives
• To introduce different experiments to test the basic understanding of physics
concepts.

Experiment Lists:
1. Determination of reduction factor of tangent Galvanometer.
2. Determination of figure of merit of a moving coil Galvanometer.
3. Measurement of high resistance with a Galvanometer.
4. Study the charging and discharging process of a capacitor through resistor.
5. Calibration of CRO.
6. Determination of the unknown resistance of a wire using Meter Bridge (applying end
correction method).
7. Comparison of emfs of cellsby stretched wire potentiometer.
8. LCR impedance apparatus.
9. Carry Foster’s bridge.
10. To determine self-inductance of a coil by Rayleigh’s method.
11. To determine the mutual inductance of two coils by absolute method.
12. To determine self-inductance of a coil by Anderson’s bridge.
13. Conversion of voltmeter to ammeter and vice-versa.
14. To study the force experienced by a current carrying conductor placed in a magnetic
field (Lorentz’s force) using a mechanical balance.

Course Outcomes
• The hands-on exercises undergone by the students will help them to apply physics
principles.

27
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

Lab 5 (AECC Lab 1): Communication in Practice Lab (ILCMH201)

Course Objectives:
1. To enable the students engage in polite, negotiating and argumentative conversation.
2. To train the learners in writing CV, Report, Minutes, Business Letters etc.
3. To give students an opportunity of power point presentation relating to topical issues.

There will be 10 lab sessions of 2 hours each. Lab sessions will be used to give the students an
in-hand experience of communication taking place in an organization. This will help the students
to understand the requirement of communication in the workplace. Students will be encouraged
to brush-up themselves in activities based on all the modules of theory taught in the class room.
Special emphasis will be given to speaking and writing business correspondences.

Ist session:
Speaking: Greeting an acquaintance/ friend, introducing oneself, introducing a third person to a
friend, breaking off a conversation politely, leave-taking, Describing people, objects, places,
processes etc. (1 Hour), Writing an application (1 Hour)

IInd session:
Speaking: making and responding to inquiries; expressing an opinion; expressing agreement/
disagreement, contradicting/ refuting an argument; expressing pleasure, sorrow, regret, anger,
surprise, wonder, admiration, disappointment etc (1 Hour), Writing an informal letter/Business
Letter (1 Hour)

IIIrd session:
Speaking: Narrating or reporting an event (1 Hour), Writing a Report (1 Hour)

IVth session:
Speaking: Ordering / directing someone to do something, Making requests; accepting / refusing a
request, Expressing gratitude; responding to expressions of gratitude, Asking for or offering
help; responding to a request for help, Asking for directions (e.g. how to reach a place, how to
operate a device etc.) and giving directions, Speaking: asking for and granting/ refusing
permission, prohibiting someone from doing something, suggesting, advising, persuading,
dissuading, making a proposal, praising, complimenting, felicitating, expressing sympathy (e.g.
condolence etc.), Complaining, criticizing, reprimanding etc., (1 Hour), Writing a proposal (1
Hour)

Vth Session:
Speaking: Understanding and interpreting graphs, flowcharts, pictograms, pictures, curves etc.,
(1 Hour), Writing: Describing, explaining and interpreting graphs, flowcharts, pictograms,
pictures, curves etc.

VIth session:
Speaking: Group discussion (1 Hour), Writing a memo, notice and circular (1 Hour)

VIIth session:

28
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

Speaking: In-house communication on work-related situations (1 Hour), Writing a CV (1 Hour)

VIIIth session:
Presentation 1 (Students will make and present a topic in power point on a pre-assigned topic) (1
Hour), Writing an e-mail (1 Hour)

IXth session:
Presentation 2 (Students will make and present a topic in power point on a pre-assigned topic) (1
Hour), Writing an abstract (1 Hour)

Xth session:
Presentation 3 (Students will make and present a topic in power point on a pre-assigned topic) (1
Hour), Writing a summary (1 Hour)
REFERENCE BOOKS:
1. Kumar, Sanjay &Lata, Pushp, Communication Skills A Workbook, OUP,2018

29
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

Lab 6 (DSE Lab 2): Data Structure Using C Lab (ILCCS201)

(Minimum 10 experiments to be done)
Experiment No. 1
Write a C program to perform matrix multiplication using array.
Experiment No. 2
(a) Write a C program to create a stack using an array and perform
(i) push operation
(ii) pop operation
(b) Write a C program to create a queue and perform
i) Push
ii) pop
iii) Traversal
Experiment No. 3
Write a C program that uses Stack operations to perform the following:
i) Converting infix expression into postfix expression
ii) Evaluating the postfix expression
Experiment No. 4
Write a C program that uses functions to perform the following operations on Single linked list:
i) Creation
ii) Insertion
iii) Deletion
iv) Traversal in both ways
Experiment No. 5
Write a C program that uses functions to perform the following operations on Double linked list:
i) Creation
ii) Insertion
iii) Deletion
Experiment No. 6
Write a C program that uses functions to perform the following operations on Binary Tree:
i) Creation
ii) Insertion
iii) Deletion
Experiment No. 7
Write C programs that use both recursive and non recursive functions to perform the Linear
search operation for a Key value in a given list of integers: Linear search
Experiment No. 8
Write C program that use both recursive and non recursive functions to perform the Binary
search operation for a Key value in a given list of integers:
Experiment No. 9
Write a C program that implement Bubble Sort method to sort a given list of integers in
descending order.
Experiment No. 10
Write a C program that implement Quick Sort method to sort a given list of integers in ascending
order:

Book: - “Data structure using C” by Sudipta Mukherjee, TMH Publication

30
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

Semester-3
Core 7: Ordinary Differential Equation (IPCMH301)

Course Objectives:
1. Identify essential characteristics of ordinary differential equations.
2. Explore the use of differential equations as models in various applications.
3. Explore the use of series methods to solve problems with variable coefficients.
4. Explore methods of solving initial value problems by transform methods.

Prerequisites: Differentiation and Integration.

Syllabus:
Module-I:
Basic Concepts of Differential Equation: Origin and Classification of Differential equation,
Solution of Differential Equation, Kinds of solution, Initial and Boundary value problem,
Existence and uniqueness of solution, Formation of Differential equation. First Order First
Degree Equation: Variable separable, Homogenous Equation, Exact Differential equation,
Integrating Factors, Linear equations, Equation reducible to linear form.
Equations of First order but of Higher Degree: Equations solvable for p, Equation solvable for y,
Equation solvable for x,

Module-II:
Linear Equations with Constant coefficient: Linear differential equation of nth order,
Homogenous Linear equation with constant coefficient, Non- Homogenous Linear equation with
constant coefficient, Operators and its use to solve linear differential equations with constant
coefficient, Method of Variation of Parameter, Linear Differential Equation with variable
coefficient: Method of reduction of order, method based on the removal of the first derivatives.
Existence and Uniqueness of solution: Picard’s method of successive Approximation,
Existence and uniqueness Theorem.

Module-III:
Series Solution and special function: Power series, Radius of convergence of power series,
Ordinary point, singular point and regular singular point (only definition), Series solution about
an ordinary point, Legendre equation and Legendre polynomial, Orthogonality, Power series
method about singular point, Bessel ‘s equation and Bessel’s function, Orthogonality in Bessel
function. Boundary value problem for Ordinary Differential Equation; Sturm –Liouville
Problems.

Text Books:
1. A Course on Ordinary and Partial Differential Equation by J. Sinha Roy, S Padhy,
Kalyani Publisher.Chapters: 1(1.1-1.4), 2(2.1-2.7), 3(3.1-3.4), 4(4.1-4.6), 6(6.1,-6.3),
7(7.1,7.2,7.3.1,7.4.1)), 10 (10.1,10.2).

Reference Books:
1. Ordinary Differential Equation by P C Biswal (Pub- PHI).

31
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

Course outcomes: After the successful completion of this course the students will be able to
1. Analyse real world scenarios to recognize when ordinary differential equations (ODEs)
or systems of ODEs are appropriate.
2. Formulate problems about the scenarios, creatively model these scenarios (using
technology, if appropriate) in order to solve the problems using multiple approaches,
judge if the results are reasonable, and then interpret and clearly communicate the results.
3. Select and apply series techniques to solve differential equations.
4. Select and apply appropriate methods to solve differential equations.

32
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

Core 8: Statistics (IPCMH302)

Course Objectives:
1. Frame problems using multiple mathematical and statistical representations of relevant
structures and relationships
2. Solve using standard techniques
3. Create quantitative models to solve real world problems in appropriate contexts
4. Effectively use professional level technology tools to support the study of mathematics and
statistics.

Prerequisites: Probability theory.

Syllabus:
Module-I
Primary and Secondary Data, Univariate data, Frequency distribution, Diagrammatic
representation, graphical representation and Tabulation of data. Measures of central tendency,
dispersion, skewness and kurtosis for data. Moments and quartiles.
SAMPLING AND SAMPLE DESIGNS: Theoretical Basis of sampling, Methods of sampling,
Restricted and unrestricted random sampling, Stratified sampling Systematic sampling,Cluster
sampling, Selection of appropriate method of sampling,Size of sample, merits and limitation of
sampling, Sampling and Non Sampling errors, Reliability of sampling.

Module-II
Theory of estimation: Consistency, efficiency, unbiasedness, sufficiency. Correlation and
regression analysis, Bivariate frequency distributions.

Module-III
t, F, and χ^2 – distributions, their derivation and properties. Testing of hypothesis on t, F, and
χ^2 – distributions, Acceptance sampling, Estimation of Parameters, Confidence Intervals.

Text Books:
1. Elementary Statistical Methods, S.P. Gupta, Sultan Chand & Sons.
2. Fundamentals of Mathematical Statistics, S C Gupta, V K Kapoor, S Chand and sons

Reference Books:
1. An Introduction to Probability and Statistics, V. K. Rohatgi, A.K. Md. E. Saleh, Wiley
Publication.
2. Fundamentals of Statistics:A.M. Gun, M.K. Gupta and B. Dasgupta.
3. Probability and Statistics for Engineers and Scientists 9th edition, Ronald E. Walpole,
Raymond H. Myers et. al, Pearson

Course outcomes: After the successful completion of this course the students will be able to
1. Utilize a comprehensive set of descriptive statistical methods in order to organize,
summarize, and display data in a meaningful way;

33
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

2. Apply discrete and continuous probability distributions in order to evaluate the

probability of real- world events;
3. Construct confidence interval estimates for population parameters, for single and multiple
populations, based on sample data;
4. Conduct hypotheses tests concerning population parameters, for single and multiple
populations, based on sample data;
5. Perform Correlation & Regression analysis, in order to estimate the linear relationship &
nature of the strength of the linear relationship exist between two variables of interest;

34
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

Core 9: Analysis II (IPCMH303)

Course Objectives:
1. Understand the concept of continuity and derivative of a function and Mean Value
Theorems.
2. Demonstrate knowledge of Riemann integrability.
3. Understand the concept of improper integrals.
4. Check the convergence of sequence and series of functions.

Prerequisites: Set Theory, Sequence, Series, Function, Limit, Continuity.

Syllabus:
Module-I:
Derivative of a function, Relation between continuity and differentiability, Increasing and
decreasing functions, Darboux theorem, Rolle’s theorem, Lagrange’s mean value theorem,
Cauchy’s mean value theorem, Taylor’s theorem with Cauchy’s and Lagrange’s form of
remainders.

Module-II:
Definition, existence and properties of Riemann integral of a bounded function, Darboux
theorem, Condition of integrability, Riemann integrability for continuous functions, bounded
functions, monotonic function and functions with finite or infinite number of discontinuities
(without proof). The integral as the limit of the sums, Properties of Riemann integral,
Fundamental theorem of calculus, First Mean value theorems, change of variables, Second mean
value theorem, Generalized mean value Theorems.

Module-III:
Definition of improper integrals, Convergence of improper integrals, Test for convergence of
improper integrals Comparison test, Cauchy’s test for convergence, Absolute convergence,
Abel’s Test, Dirichlet’s Test, Beta and Gamma functions and their properties and relations.
Definition of pointwise and uniform convergence of sequences and series of functions, Cauchy’s
criterion for uniform convergence, Weierstrass M-test, Uniform convergence and continuity,
Uniform convergence and differentiation, Uniform convergence and integration.

Text Books:
1. G Das and S Pattanaik: Fundamentals of Mathematical Analysis TataMcGraw-
HillPublishing Company Limited.

Reference Books:
1. S.C. Malik and Savita Arora: Mathematical Analysis, New Age International (P) Ltd.
Publishers, 1996.
2. R. G. Bartle and D.R. Sherbert, Introduction to Real Analysis (4th Edition), Wiley
3. K. A. Ross, Elementary Analysis: The Theory of Calculus, Under graduate Texts in
Mathematics, Springer (SIE), Indian reprint, 2004.
4. Sudhir R Ghorpade and Balmohan V. Limaye, a course in Calculus and Real Analysis,
Undergraduate Text in Math., Springer (SIE). Indian reprint, 2004.

35
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

Course outcomes: After the successful completion of this course the students will be able to
1. comprehend regions arguments developing the theory underpinning real analysis,
2. construct rigorous mathematical proofs of basic results in real analysis,
3. appreciate how abstract ideas and regions methods in mathematical analysis can be applied
to important practical problems,
4. demonstrate skills in communicating mathematics orally and in writing.

36
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

Core 10: Design & Analysis of Algorithms (IPCCS301)

Course Objectives:
1. Analyze the asymptotic performance of algorithms.
2. Demonstrate a familiarity with major algorithms and data structures.
3. Apply important algorithmic design paradigms and methods of analysis.
4. Synthesize efficient algorithms in common engineering design situations.

Prerequisites: Discrete Mathematics. Data Structure.

Syllabus:
Module- I:
Introduction to design and analysis of algorithms, Growth of Functions (Asymptotic notations,
standard notations and common functions), Recurrences, solution of recurrences by substitution,
recursion tree and Master methods, worst case analysis of Merge sort, Quick sort and Binary
search, Design & Analysis of Divide and conquer algorithms. Heapsort: Heaps, Building a heap,
The heapsort algorithm, Priority Queue, Lower bounds for sorting.
Module –II:
Dynamic programming algorithms (Matrix-chain multiplication, Elements of dynamic
programming, Longest common subsequence). Greedy Algorithms - (Assembly-line scheduling,
Achivity- selection Problem, Elements of Greedy strategy, Fractional knapsac problem, Huffman
codes). Data structure for disjoint sets:- Disjoint set operations, Linked list representation,
Disjoint set forests.
Module –III:
Graph Algorithms: Breadth first and depth-first search, Minimum Spanning Trees, Kruskal and
Prim's algorithms, single- source shortest paths (Bellman-ford and Dijkstra's algorithms), All-
pairs shortest paths (Floyd – Warshall Algorithm). Back tracking, Branch and Bound. Fast
Fourier Transform, string matching (Rabin-Karp algorithm), NP - Completeness (Polynomial
time, Polynomial time verification, NP - Completeness and reducibility, NP-Complete problems
(without Proofs), Approximation algorithms (Vertex-Cover Problem, Traveling Salesman
Problem).

Text Book:
1. T.H. Cormen, C.E. Leiserson, R.L. Rivest, C.Stein : Introduction to algorithms -2nd edition,
PHI,2002.
Chapters: 1,2,3,4 (excluding 4.4), 6, 7, (7.4.1), 8 (8.1) 15 (15.1 to 15.4), 16 (16.1, 16.2, 16.3),
21 (21.1,21.2,21.3), 22(22.2,22.3), 23, 24(24.1,24.2,24.3), 25 (25.2), 30,32 (32.1, 32.2) 34,
35(35.1, 35.2)

Reference Books:
1. Algorithms – Berman, Cengage Learning
2. Computer Algorithms: Introduction to Design & Analysis, 3rd edition-by Sara Baase, Allen
Van Gelder, Pearson Education
3. Fundamentals of Algorithm-by Horowitz &Sahani, 2nd Edition, Universities Press.
4. Algorithms By Sanjay Dasgupta, UmeshVazirani – McGraw-Hill Education
5. Algorithm Design – Goodrich, Tamassia, Wiley India.

37
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

SEC 2: Organizational Behaviour (IOEMH301)

Module-1
The study of Organizational Behaviour: Definition, Meaning, Why study OB; Learning –
Principles of learning and learning theories; Personality- Meaning, Determinants, Types,
Personality and OB; Perception- Perceptual Process, perceptual errors, Importance of perception
in organizations; Motivation-Nature and Importance, Theories of motivation (Herzberg, Maslow,
McGregor).

Module-2: Group level:

Groups in Organizations –Nature, Types, Reasons behind forming groups, Determinants, factors
contributing to Group Cohesiveness, Group Decision Making- Process, advantages and
disadvantages; Team- Effective Team Building; Types of Leadership- Effective Leadership,
Styles of leadership, Leadership Theories-Trait Theory and Contingency Theory, Leadership and
Followership; Conflict- Healthy Vs Unhealthy conflict, Conflict Resolution Techniques

Module- 3: Structural level:

Organizational Culture: culture and organizational effectiveness; Organizational Change: Types
of change, Reasons to change, Resistance to change and to manage resistance. Introduction to
organizational development.

Text Books:
1. Stephens P Robbins, OrganisationalBehaviour, PHI
2. K. Aswatthappa, OrganisationalBehaviour, HPH

Reference Books:
1. Kavita Singh, Organisational Behaviour, Pearson
2. D.K. Bhattacharya, Organisational Behaviour, OUP
3. Pradeep Khandelwal, Organisational Behaviour, TMH
4. Keith Davis, Organisational Behaviour, McGrawHillNelson Quick, ORGB, Cengage
Learning

38
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

GE 3: Physics-III (IOEPH301)

Module - I
Fermat’s principle, reflection and refraction at plane interference, cardinal points of a coaxial
optical system, cardinal points of combination of two thin lenses, elementary ideas of
monochromaticaberrations and remedies, chromatic aberration, achromatic combination,
Ramsden’s and Huygens’s eyepieces,

Module - II
Wave theory of light, Huygen’s principle, condition of interference, division of wave front,
biprism, colour of thin films, Newton’s ring, and determination of wave length of
monochromaticlight by Newton’s ring.
Diffraction of light, Fresnel and Fraunhoffer diffraction, Fresnel’s half period zones, Zone plate
act as a convex lens.Fraunhoffer diffraction by a single slit,
Electromagnetic nature of light, Polarized and unpolarized light. Plane polarized, circularly
polarized and elliptically polarized light. Polarization by reflection and refraction, Brewster’s
law, Malus’s law. Double refraction, ordinary and extraordinary rays, construction, working and
uses of Nicol prism. Half wave plate and quarter wave plate.

Module - III
Inadequacy of classical physics: review of black body radiation. Particle nature of wave,
photoelectric effect, Compton effect, dual nature of radiation. Wave nature of particle – De
Broglie hypothesis and wave - particle duality. Superposition of two waves, group velocity and
phase velocity, wave packet. Experimental confirmation of matter waves (Davisson –
Germerexperiment). Heisenberg’s uncertainty principle and applications (Ground state energy of
harmonic oscillator, Time dependent Schrodinger equation in one and three dimensions.The
wave function, equation of continuity, probability current density and probability density.
Normalization of the wave function, Expectation value of an observable

Books:
1. optics -A.K. Ghatak
2. Principle of optics – B.K.Mathur
3. Optics – P.K. Chakravarty
4. Physics for degree students – VOL III and IV (SrikrishnaPrakashan)
5. Introduction to Quantum mechanics – M. Das, P.K.Jena (SrikrishnaPrakashan)
6. Quantum mechanics –J.L. Powell, B. Crasemann

39
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

Lab 7 (GE Lab 3): Physics Lab-III (ILCPH351)

List of Experiments:
1. Angle of minimum deviation (I-D curve) using spectrometer.
2. Determination of resolving power of a telescope
3. Optical rotation of sugar solution by polarimeter.
4. Refractive index of glass slab using travelling microscope.
5. Refractive index of water using travelling microscope.
6. Determination of radius of curvature of a spherical mirror by Kohlrausch’s method.
7. Determination of dispersive power of the material of the prism.
8. To measure voltage and Frequency of a sinusoidal wave form using a CRO and to find
unknown frequency by producing Lissajous figure.
9. To study parallel resonant LCR circuit.
10. To study series resonant LCR circuit.

40
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

Lab 8 (Core Lab 1): Design & Analysis Algorithms Lab (ILCCS301)

List of Experiments:
1. Using a stack of characters, convert an infix string to postfix string.(1 class)
2. Implement insertion, deletion, searching of a BST. (1 class)
3. (a) Implement binary search and linear search in a program (b) Implement a heap sort
using a max heap.
4. (a) Implement DFS/ BFS for a connected graph. (b) Implement Dijkstra’s shortest path
algorithm using BFS.
5. (a) Write a program to implement Huffman’s algorithm. (b) Implement MST using
Kruskal/Prim algorithm.
6. (a) Write a program on Quick sort algorithm. (b) Write a program on merge sort
algorithm. Take different input instances for both the algorithm and show the running
time.
7. Implement Strassen’s matrix multiplication algorithm.
8. Write down a program to find out a solution for 0 / 1 Knapsack problem.
9. Using dynamic programming implement LCS.
10. (a) Find out the solution to the N-Queen problem. (b) Implement back tracking using
game trees.

41
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

Semester-4

Core 11: Geometry of Curves & Surfaces (IPCMH401)

Course Objectives:
1. To get introduced to the concept of a regular parameterized curve.
2. To be able to understand the fundamental theorem for plane curves.
3. To be able to compute the curvature and torsion of space curves.
4. To understand the normal curvature of a surface, its connection with the first and second
fundamental form and Euler’s theorem.

Prerequisites: Differential Calculus

Syllabus:
Module I:
Curves in two and three dimensions: Tangent, Principal normal, Binormal, Curvature, Torsion,
Serret-Frenet formula, unique determination of curve, Helices, Involute, Evolute Surfaces,
Tangent plane, normal, One parameter family of surfaces: Envelope, characteristics, Edge of
regression, Developable surface

Module II:
Curvilinear coordinates on a surface, First order magnitudes, Directions on a surface, Normal,
Second order magnitudes, Derivatives of normal, Curvature of normal section, Meunier’s
theorem.

Module III:
Curves on a surface, Lines of curvature, Principal Directions, First and second curvature, Euler’s
theorem, Surface of revolution, Conjugate directions

Text Books:
1. C.E. Weatherburn, Differential Geometry of Three Dimensions, Cambridge University
Press.

Reference Books:
1. A.N. Presley, Elementary Differential Geometry, Springer
2. DoCarmo, Differential Geometry, Academic Press

Course outcomes: After the successful completion of this course the students will be able to
1. compute quantities of geometric interest such as curvature, as well as develop a facility to
compute in various specialized systems, such as semi geodesic coordinates or ones
representing asymptotic lines or principal curvatures.
2. introduced to the method of the moving frame and overdetermined systems of differential
equations as they arise in surface theory.

42
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

3. develop arguments in the geometric description of curves and surfaces in order to

establish basic properties of geodesics, parallel transport, evolutes, minimal surfaces and
consequences of the index theory.

43
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

Core 12: Numerical Methods (IPCMH402)

Course Objectives:
1. Demonstrate understanding of common numerical methods and how they are used to
obtain approximate solutions to otherwise intractable mathematical problems.
2. Apply numerical methods to obtain approximate solutions to mathematical problems.
3. Derive numerical methods for various mathematical operations and tasks, such as
interpolation, differentiation, integration, the solution of linear and nonlinear equations,
and the solution of differential equations.
4. Analyze and evaluate the accuracy of common numerical methods.

Prerequisites: Differentiation. Integration.

Syllabus:
Module-I:
Errors, Algorithims and Convergence, Transcendental and polynomial equations:
Introduction, Bisection method, Regula-falsi method, Secant method, Fixed Point iteration,
Newton-Raphson method, Rate of convergence .Error Analysis for iterative methods,
System of Linear Algebraic Equations: Pivoting Strategies, Matrix inversion, LU-
Decomposition, Gauss Jacobi, Gauss –Seidel Method, Relaxation Techniques.

Module-II:
Interpolation and Approximations: Introduction, Langrages and Newton Interpolation, Least
Square Approximation, Uniform Approximation. Differentiation.

Module-III:
Numerical Integration: Newton Cotes Algorithm, Trapezoidal rule, Simpson’s rule, Gauss –
Legendre Integration Method, Ordinary Differential Equations: Euler’s Method, Euler Modified
Method, Runge -kutta Method.

Text Books:
1. Numerical Mathematics and Computing: by W. Cheney, David Kincaid, Cengage.
2. Numerical Methods by B.P. Acharya & R.N. Das.

Reference Books:
1. Numerical Methods for Scientific and Engineering Computation; M.K. Jain, S. R. K.
Iyengar, R.K. Jain.
2. A Introduction to Numerical Analysis by K. Aitkinson, Wiley.

Course outcomes: After the successful completion of this course the students will be able to
1. Devise an algorithm to solve it numerically;
2. Implement this algorithm;
3. Describe classic techniques and recognize common pitfalls in numerical analysis;
4. Analyze an algorithm’s accuracy, efficiency and convergence properties

44
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

Core 13: Mathematical Methods (IPCMH403)

Course Objectives:
1. Students learn mathematical methods adequate to solve basic application-oriented
problems.
2. Students learn algebraic problem solving skills useful in more advanced mathematics and
science courses.
3. Students learn Laplace Transform and its applications.
4. Students learn Fourier Transform and Z transform and their applications.

Prerequisites: Differentiation, Integration, Differential equation.

Syllabus:
Module-I:
Laplace Transform: Definition, Notation, Some simple transform, existence of Laplace
transforms, Inverse Laplace Transform. Laplace transform of Derivatives, Transform of
integrals, solution of differential equation using Laplace transforms, solution of simultaneous
differential equation using Laplace transforms. Unit step function and its LT, Heaviside step
function, 1st shifting theorem and 2nd shifting theorem, impulse function and its LT.
Convolution

Module-II:
Z Transform: Definition and Notation, Linearity property of z transform, 1st shift property, 2nd
shift property, Inverse z transform. Difference equation, Solution of Difference equation using Z
transforms. Z transform function, Impulse response, Stability, convolution, Relation between
Laplace transform and Z transform.

Module-III:
Fourier transform: Fourier integral, Fourier Transform, Linearity property, Differentiation, Time
Shift Frequency shift and symmetry property of Fourier Transform, Relation between LT and FT
Fourier transform of step and impulse function, Convolution. Fourier transform of sequence,
discrete FT, Estimation of the continuous FT, The fast Fourier Transform.

Text Books:
1. Advanced Modern Engineering Mathematics (3rd Edition) By Glyn James, (Pearson
Education)
Chapter 2.1,Ch-2.2.1 to 2.2.9, Ch-2.3.1 to 2.3.4, Ch-2.5.1 to2.5.4, 2.5.8 to 2.5.10,
Chapter-3.1, Ch-3.2.1 to 3.2.3, Ch-3.3.1 to 3.3.5, Ch-3.4.1, ch-3.5.1 to 3.5.3, Ch-3.6.1 to
3.6.5, ch-3.7
Chapter 5.1, Ch-5.2.1 to 5.2.4, Ch-5.3.1 to 5.3.6, Ch-5.4.1 to 5.4.3, Ch-5.5.1 to 5.5.3, Ch-
5.6.1 to 5.6.6
Reference Books:
1. Advanced Engineering Mathematics (10th Edition) By Erwin Kreszig (Willey)
2. Mathematical Methods by E Rukmangada Charu (Pearson)

Course outcomes: After the successful completion of this course the students will be able to

45
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

1. Implement basic operations in Fourier series and Laplace transforms and Z transform.
2. Apply mathematical and computational methods to a range of problems in science and
engineering
3. Solve differential equations and integral equations,
4. Solve problems of mechanics using Laplace, Fourier and Z transforms

46
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

GE 4: Physics IV (IOEPH401)

Module - I
Thermodynamic system and thermodynamic equilibrium, Reversible and irreversible process,
internal energy, first law of thermodynamics, difference between molar specific heat of an ideal
gas, Derivation of relation 〖PV〗^γ=constant for adiabatic process, work done in isothermal
and adiabatic process. Entropy changes in various processes. T - S diagram, Carnot cycle, Carnot
engine and its efficiency, Carnot theorem, second law of thermodynamics - Kelvin plank and
Clausius formulation, their equivalence, thermodynamic scale of temperature.

Module - II
Thermodynamic coordinates P.V.T and 1st Tds equation, 2nd Tds equation. Clausius -Clapeyron
equation, effect of pressure on melting point and boiling point, thermal conductivity, differential
equation of heat flow in one-dimension, experimental determination of thermal conductivity by
Ingen - Haus and Searl’s method. Vandewall’s equation of state for real gases, critical constants,
reduced equation of state.

Module - III
Black body radiation, Stefan’s law, energy distribution in the blackbody spectrum. Wien’
displacement law, Wein’s formula and Rayleigh –jeans formula (only statement and
discussion).Planck’ radiation formula, derivative of Rayleigh - jeans formula.Wein’s formula
and Stefan Boltzmann law using Planck’s formula.
Rutherford’s atomic model and its short coming, Bohr’s theory of hydrogen atom. Energy levels,
explanation of spectra, correction for nuclear motion, Bohr’s correspondence principal.Frank -
Hertz experiment, critical potential.

Module - IV
The atomic nucleus: its size, mass, charge, spin, magnetic moment, Mass defect, binding energy,
stability of nuclear force - its characteristics, Radioactive decay law, activity decay law, activity,
half - life, average life, elementary idea of nuclear fission and fusion. Linear accelerator,
cyclotron.

Books:
1. Heat and Thermodynamics - A.B. Gupta& H.B. Ray (New Central)
2. Sound - M. Ghosh (S. Chand)
3. Physics for degree students - vol - I, II, M. Das
4. Modern Physics - R. Murugeshan
5. Introduction to Modern physics - H.S. Mani, G.K. Mehta (Affiliated East West)
6. Atomic physics - G.P. Harnwerll & W.E. Stephens. McGraw - HILL Book company, Inc.
7. Atomic and nuclear physics - Satyapraksh
8. Atomic and nuclear physics - Shatendra Sharma (Pearson publication)
9. Atomic and nuclear physics –Gupta Ghosha

47
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

GE 5: Economics (IOEMH401)

Module-I:
Engineering Economics- Nature and Scope, General concepts on micro & macro economics.
The theory of demand, Demand function, Law of demand and its exceptions, Elasticity of
demand, Law of supply and elasticity of supply. Theory of production, Law of variable
proportion, Law of returns to scale.

Module-II:
Time value of money- Simple and compound Interest, Cash flow diagram, Principle of
Economic equivalence. Evaluation of engineering projects – Present worth method, Future worth
method , Annual worth method , internal rate of return method, Cost-benefit analysis in public
projects. Depreciation policy, Depreciation of capital assets, Causes of depreciation, straight line
method and declining balance method.

Module-III:
Cost concepts, Elements of costs, Preparation of cost sheet, Segregation of costs into fixed and
variable costs. Break-even analysis-Linear approach. (Simple numerical problems to be solved)
Banking: Meaning and functions of commercial banks; functions of Reserve Bank of India.
Overview of Indian Financial system.

Text Books:
1. Riggs, Bedworth and Randhwa, “Engineering Economics”, McGraw Hill Education
India.
2. M.D.Mithani, Principles of Economics.

Reference Books:
1. Sasmita Mishra, “Engineering Economics & Costing “, PHI
2. Sullivan and Wicks, “Engineering Economy”, Person
3. R. PaneerSelvam, “Engineering Economics”, PHI
4. Gupta,” Managerial Economics”, TMH
5. Lal and Srivastav, “Coast Accounting”,TMH

48
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

DSE 3: Operating System (IOECS401)

Course Objectives:
1. To learn the mechanisms of OS to handle processes and threads and their communication
and in memory management in contemporary OS.
2. To gain knowledge on distributed operating system concepts that includes architecture,
Mutual
3. Exclusion algorithms, deadlock detection algorithms and agreement protocols.
4. To learn programmatically to implement simple OS mechanisms.

Syllabus:
Module-I
Overview Operating System, Simple Batch Processing Systems, Multiprogramming and Time
Sharing systems. Personal Computer Systems, Parallel Systems, Distributed Systems and Real-
time Systems.
Operating System Structures: Operating System Services, System components, Protection
system, Operating System Services, system calls, Process Concept, Process Scheduling,
Operation on Processes, Inter-process communication, Examples of IPC Systems, Multithreading
Models, Threading Issues, Process Scheduling Basic concepts, scheduling criteria, scheduling
algorithms, Thread Scheduling.

Module-II
Process Coordination, Synchronization, Critical section problem, Synchronization hardware,
Semaphores, Classical problems of synchronization, Monitors. Deadlocks, System model,
Deadlock Characterization, Handling Deadlocks, Deadlock Prevention, Deadlock avoidance,
Deadlock Detection, recovery from Deadlock. Memory Management strategies, Logical versus
Physical Address space, swapping, contiguous Allocation, Paging, Segmentation. Virtual
Memory: Background, Demand paging, performance of Demand paging, Page Replacement,
Page Replacement Algorithms. Allocation of frames, Thrashing, Demand Segmentation.

Module-III
Recovery, Overview of Mass Storage Structure, Disk Structure, Disk Scheduling, Disk
Management, Swap-Space Management, I/O System Overview, I/O Hardware.
File system, file structure, Directory Structure, Allocation Methods, Basic concepts of Linux
system, administration requirements, VM ware and Hypervisor concepts.

Text Book:
1. Abraham Silberschatz, Peter Baer Galvin, Greg Gagne: Operating System Concepts, 8th
edition, Wiley-India, 2009.
2. Naresh Chouhan: Principles of Operating System, Oxford University Press.
3. Dhamdhare: Operating Systems: A Concept, 3rd Edition, Tata McGraw Hill Education,
India
Reference Book:
1. William Stallings: Operating Systems, PHI Learning Pvt. Ltd.
2. H.M. Deitel, P. J. Deitel, D. R. Choffnes: Operating Systems, 3rdEdition, Pearson
Education.
3. Andrew S. Tanenbaum: Mordern Operating Systems, 3rdEdition, PHI Learning Pvt. Ltd.

49
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

Lab 9 (GE Lab 4): Physics Lab–IV (ILCPH451)

List of Experiments:
Properties of Matter and Heat Laboratory
1. To determine the coefficient of viscosity by viscometer.
2. Determination of rigidity modulus of a wire by dynamic method.
3. Determination of surface tension of soap solution.
4. Determination of Young’s modulus, modulus of rigidity, and poissions ratio of material
of a wire using Searles method.
5. Calculation of Mechanical equivalent of heat by Joule’s calorimeter.
6. To find Specific heat of a liquid by method of cooling.
7. To determine the specific resistance of a given wire using Carey-Foster bridge.
8. Calculate thermal conductivity of a bad conductor by lee’s method.
9. Calculation of velocity of sound by resonance column method.
10. Determine Young’s modulus by bending of beam by cantilever.
11. Determination of thermal conductivity of metal by Searle’s apparatus.
12. Determination of latent heat of fusion of ice by applying radiation correction.
13. Determination of vapour density of a volatile liquid by Victor Meyer’s method.
14. To determine coefficient of viscosity of air by Rankin’s Method.

50
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

Lab 10 (DSE Lab 3): Operating System Lab (ILCCS401)

List of Experiments:
1. Basic UNIX Commands.
2. Linux Administrative commands.
3. UNIX Shell Programming.
4. Programs on process creation and synchronization, inter process communication
including shared memory, pipes and messages.(Dinning Philosopher problem / Cigarette
Smoker problem / Sleeping barber problem)
5. Programs on UNIX System calls.
6. Simulation of CPU Scheduling Algorithms. (FCFS, RR, SJF, Priority, Multilevel
Queuing)
7. Simulation of Banker’s Algorithm for Deadlock Avoidance, Prevention
8. Program for FIFO, LRU, and OPTIMAL page replacement algorithm.
9. Android Programming for mobile application.

51
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

Semester-5

Core 14: Advanced Calculus (IPCMH501)

Course Objectives:
1. Perform numeric and symbolic computations.
2. Construct and apply symbolic and graphical representations of functions.
3. Model real-life problems mathematically.
4. Use technology appropriately to analyze mathematical problems.

Prerequisites: Differentiation, Partial Differentiation, Integration, Differential Equation.

Syllabus:
Module –I:
Special Function: Some special functions: Bessel’s function, Legendre polynomial (function),
Gamma, Beta, error functions;
Integral transforms: Fourier transform, Z-transform

Module –II:
Calculus of variation: Variation of a functional, Euler-Lagrange equation. Variational problems
with fixed boundaries, variational problem with Moving boundaries, sufficient conditions for an
extremum, direct methods in variational problem. Variational methods for boundary value
problems in ordinary and partial differential equations.

Module –III:
Linear Integral Equations: Linear integral equation of the first and second kind of Fredholm
and Volterra type, Solutions with separable kernels. Characteristic numbers and eigen functions,
resolvent kernel.

Text Books:
1. Linear Integral Equation by Santi Swarup; Krishna publications
2. Calculus of variation by A.S. Gupta; PHI, Chapter-1 (1.1-1.6), 2 (2.1-2.3), 3 (3.1-3.6), 4
(4.1-4.2),6 (6.1-6.3)

Reference Book:
1. Calculus of variations: I.M. Gelfand, S.V. Fomin, Prentice Hall.

Course outcomes: After the successful completion of this course the students will be able to
1. Develop ability to solve problems in the geometry and analysis using in differential
forms,
2. Develop capacity to both prove results and solve problems,
3. Recognize the place of differential calculus in mathematics and the greater realm of
scientific thought,
4. Develop facility in reading and analyzing mathematical text,

52
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

Core 15: Mathematical Modelling and Simulation (IPCMH502)

Course Objectives:
1. Engineering problem modelling and solving through the relationship between theoretical,
mathematical, and computational modelling for predicting and optimizing performance
and objective.
2. Mathematical modelling real world situations related to engineering systems
development, prediction and evaluation of outcomes against design criteria.
3. Interpret the model and apply the results to resolve critical issues in a real-world
environment.
4. Develop different models to suit special characteristics of the system being modelled

Prerequisites: Differential Equation, Probability, Graph Theory.

Syllabus:
Module-I:
What is Modeling-Model and reality ,Properties of Models ,Building a Model, Elementary
Methods-Arguments from scales ,Dimension Analysis, Graphical methods –Mathematical
Modeling through Graphs: Solutions that can be Modeled Through Graphs – Mathematical
Modeling in Terms ofDirected Graphs, Signed Graphs, Weighted Digraphs and Un-oriented
Graphs.

Module-II:
Mathematical Modeling through Ordinary Differential Equations of First order: Linear
Growth and Decay Models – Non-Linear Growth and Decay Models – Compartment Models –
Dynamic problems – Geometrical problems.
Mathematical Modeling through Ordinary Differential Equations of Second Order: Planetary
Motions – Circular Motion and Motion of Satellites – Mathematical Modeling through Linear
Differential Equations of Second Order – Miscellaneous Mathematical Models

Module-III:
Mathematical Modeling through Difference Equations: Simple Models – Basic Theory of
Linear Difference Equations with Constant Coefficients – Economics and Finance – Population
Dynamics and Genetics – Probability Theory.

Text Books:
1. J.N. Kapur, Mathematical Modelling, Wiley Eastern Limited, New Delhi,Edward A.
Bender.. An Introduction to Mathematical Modeling, S.M. Ross .Simulation, India
Elsevier Publication.

Reference Books:
1. A. C. Fowler, Mathematical Models in Applied Sciences, Cambridge University Press.
2. A.M. Law and W.D. Kelton , Simulation Modeling and Analysis, T.M.H. Edition.
3. Sankar Sengupta, System Simulation and Modeling , Pearson

Course outcomes: After the successful completion of this course the students will be able to

53
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

1. Identify, formulate, and solve complex engineering problems by applying principles of

engineering, science, and mathematics.
2. Apply the engineering design process to produce solutions that meet specified needs with
consideration public health and safety and global, cultural, social, environmental,
economic, and other factors as appropriate to the discipline.
3. Model physical problems and solve them.

54
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

Core 16: Fuzzy and Rough Set Theory (IPCMH503)

Course Objectives:
1. Apply soft computing techniques to solve engineering problems.
2. Handle multi-objective optimization problems.
3. Apply advanced AI techniques of swarm intelligence, particle swarm optimization, ant-
colony optimization and petrinets.
4. Apply rough set theory and granular computing to solve process control applications.

Prerequisites: Set theory.

Syllabus:
Module-I:
Crisp sets and Fuzzy sets: Introduction – crisp sets an overview – the notion of fuzzy sets –basic
concepts of fuzzy sets – membership functions – methods of generating membership functions –
defuzzification methods- operations on fuzzy sets - fuzzy complement – fuzzy union – fuzzy
intersection – combinations of operations – General aggregation operations. Fuzzy arithmetic
and Fuzzy relations: Fuzzy numbers- arithmetic operations on intervals- arithmetic operations on
fuzzy numbers- fuzzy equations- crisp and fuzzy relations – binary relations – binary relations on
a single set – equivalence and similarity relations – compatibility or tolerance relations.

Module-II:
Fuzzy measures – belief and plausibility measures – probability measures – possibility and
necessity measures – possibility distribution - relationship among classes of fuzzy measures.
Fuzzy Logic and Applications: Classical logic: an overview – fuzzy logic – approximate
reasoning - other forms of implication operations - other forms of the composition operations –
fuzzy decision making –fuzzy logic in database and information systems - fuzzy pattern
recognition – fuzzy control systems.

Module-III:
Basic concept of rough sets: Approximation space and set approximation, rough membership
function
Rough set in data analysis: Information system, Indiscernibility relation, Set approximation,
rough sets and membership function, Dependency of attributes, Reduction of attributes, Reducts
and core, Discernibility matrices and functions, Decision rule synthesis.

Text Book:
1. George J Klir and Tina A Folger, Fuzzy sets, Uncertainty and Information, Prentice Hall
of India, 1988.
2. An introduction to rough set theory and application: A tutorial, by Z. Suraj
3. Rough sets: Mathematical Foundation by L. Polkowski, Spinger-Verlag, Berlin
4. H.J. Zimmerman, Fuzzy Set theory and its Applications, 4th Edition, Kluwer Academic
Publishers, 2001.

55
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

Reference Book:
1. George J Klir and Bo Yuan, Fuzzy sets and Fuzzy logic: Theory and Applications.
Prentice Hall of India, 1997.
2. Hung T Nguyen and Elbert A Walker, First Course in Fuzzy Logic, 2 nd Edition, Chapman
& Hall/CRC, 1999.
3. Jerry M Mendel, Uncertain Rule – Based Fuzzy Logic Systems; Introduction and New
Directions, PH PTR, 2000.
4. John Yen and Reza Langari, Fuzzy Logic: Intelligence Control and Information, Pearson
Education, 1999.
5. Timothy J Ross, Fuzzy Logic with Engineering Applications, McGraw Hill International
Editions, 1997.

Course Outcomes: After successful completion of the course, students will be able to:
1. decide the difference between crips set and fuzzy set theory
2. make calculation on fuzy set theory and gain the methods of fuzzy logic
3. recognize fuzzy logic membership function
4. recognize fuzzy logic fuzzy inference systemsmake applications on Fuzzy logic
membership function and fuzzy inference systems

56
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

DSE 4: Relational Database Management System (IPECS501)

Course Objectives:
1. To develop conceptual understanding of database management system.
2. To understand how a real world problem can be mapped to schemas.
3. Analyze database requirements and determine the entities involved in the system and
their relationship to one another.
4. Develop the logical design of the database using data modeling concepts such as entity-
relationship diagrams.
5. Manipulate a database using SQL.

Module I:
Introduction to database Systems, advantages of database system over traditional file system,
Basic concepts & Definitions, Database users, Database Language, Database System
Architecture, Schemas, Sub Schemas, & Instances, database constraints, 3-level database
architecture, Data Abstraction, Data Independence, Mappings, Structure, Components &
functions of DBMS, Data models.

Module II:
Entity relationship model, Components of ER model, Mapping E-R model to Relational schema,
Network and Object Oriented Data models, Storage Strategies: Detailed Storage Architecture,
RAID
Relational Algebra, Tuple & Domain Relational Calculus, Relational Query Languages: SQL
and QBE. Database Design:-Database development life cycle (DDLC), Automated design tools,
Functional dependency and Decomposition, Join strategies, Dependency Preservation & lossless
Design, Normalization, Normal forms:1NF, 2NF,3NF, and BCNF, Multi-valued Dependencies,
4NF & 5NF. Query processing and optimization: Evaluation of Relational Algebra Expressions,
Query optimization, Query cost estimation.

Module III:
Transaction processing and concurrency control: Transaction concepts, properties of transaction,
concurrency control, locking and Timestamp methods for concurrency control schemes.
Database Recovery System, Types of Data Base failure & Types of Database Recovery,
Recovery techniques. Fundamental concepts on Object-Oriented Database, Object relational
database, distributed database, Parallel Database, Data warehousing & Data Mining and Big data
and NoSQL.

Text Books:
1. Sudarshan, Korth: Database System Concepts, 6th edition, McGraw-Hill Education.

References Books:
1. Elmasari & Navathe: Fundamentals of Database System, Pearson Education.
2. Ramakrishnan: Database Management Systems, McGraw-Hill Education.
3. Andrew S. Tanenbaum: Modern Operating Systems, 3rd Edition, Pearson Education.
4. Terry Dawson, Olaf Kirch: Linux Network Administrator’s Guide, 3rd Edition, O’Reilly
Media

57
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

DSE 5: Java Programming (IPECS502)

Course Objectives:
1. To provide elaborate knowledge on standard Java language.
2. To provide knowledge on Object Oriented Approach to program design.
3. To introduce JavaFX for GUI Development

Module I
Features of Java, Data types, operators & expressions, control structures, arrays, Classes, objects
& methods, constructors, garbage collection, access qualifiers, Overloading, String Handling –
string operations, character extraction, string comparison, searching and modifying strings,
String Buffer, String Builder, Packages, Interfaces, Wrapper classes, Static variables and
methods.

Module II
Inheritance: single and multilevel inheritance, method overriding, abstract class, use of super
and final keywords. Exception Handling: Exception types, uncaught exceptions, multiple catch
clauses, nested try statements, built-in exceptions, creating your own exceptions. Multithreading:
Java thread model, creating multiple threads, thread priorities, synchronization, inter-thread
communication, suspending, resuming and stopping threads; Familiarity with Java Collection
Framework.
I/O Streams: Console I/O, Files I/O – Byte Streams, Character Streams, Object Serialization;
Socket Programming: TCP Socket, Datagram Socket.

Module III
DBC programming: JDBC Drivers, Creating connection, executing queries and stored
procedures, handling database transactions.
GUI Development: AWT Classes, Window fundamentals, working with graphics, working with
color& fonts. Event handling in Java, Delegation Event Model, Swing Package: JFrame, JPanel,
swing GUI controls, layout managers, working with menus, Introduction to JavaFX

Text Books:
1. Liang Y. Daniel, Introduction to Java Programming, Pearson Education.
2. Herbert Schildt, The Complete Reference Java 2, Tata McGraw Hill
Reference Books:
1. E. Balaguruswami, Programming with Java, Tata McGraw Hill.
2. Mughal K.A., Rasmussen R.W., A Programmer’s Guide to Java Certification, Addison-
Wesley

Course Outcomes:
On successful completion of the course, the students will be able to:
1. Develop skills to write Java programs to solve a variety of real-world problems.
2. Write programs using object oriented approach and standard Java
3. Develop client server applications using network sockets
4. Develop skills to write Desktop Applications involving GUI and Databases.
5. Design programs using readable, reusable and cohesive modules.

58
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

AECC 2: Environmental Science (IMCCH501)

Module – I:
Ecological Concepts: Biotic components, Ecosystem Process: Energy, Food Chain, Water cycle,
Oxygen cycle, Nitrogen cycle, carbon cycle, Environmental gradients, Tolerance levels of
environment factor, EU, US and Indian Environmental Law. Chemistry in Environmental
Engineering: Atmospheric chemistry, Soil chemistry. Noise pollution- Noise standards,
measurement and control. Water Treatment: water quality standards and parameters, Ground
water. Water treatment processes, Pre-treatment of water, Conventional process, Advanced
oxidation process.

Module – II:
(a)Waste Water Treatment: COD and BOD of Waste water treatment process, pretreatment,
primary and secondary treatment of waste water, Activated sludge treatment: Anaerobic
digestion, Reactor configurations and methane production.
(b)Air Pollution: Air pollution and pollutants, criteria of pollutants, Acid deposition, Global
climate change –greenhouse gases, air pollution meteorology, Atmospheric dispersion. Industrial
Air Emission Control. Flue gas desulphurization, NOx removal, Fugitive emissions.
(c)Solid waste, Hazardous waste management, Solid Waste Management, Source classification
and composition of MSW: Separation, storage and transportation, Reuse and recycling, zero
waste management, Hazardous Waste Management, Hazardous waste and their generation,
Transportation and treatment: Incinerators, super critical liquids, Inorganic waste treatment.
E.I.A., Environmental auditing,

Module – III:
Occupational Safety and Health Acts, Safety procedures, Type of Accidents, Chemical and Heat
Burns, Prevention of Accidents involving Hazardous substances, Human error and Hazard
Analysis. Hazard Control Measures in integrated steel industry, Petroleum Refinery, L.P.G.
Bottling, Pharmaceutical
Management- Safety Handling and Storage of Hazardous Materials, Corrosive Substances, Gas
Cylinders, Hydro Carbons and Wastes. Personal Protective Equipments.

Text Book:
1. Environmental Engineering Irwin/ McGraw Hill International Edition, 1997, G. Kiely,
2. Industrial Safety Management, L. M. Deshmukh, Tata McGraw Hill Publication.

Reference Books
1. Chemistry for Environmental Engineering and Science, Clair N. Sawyer, Perry L. Mc
Carty and Gene F. Parkin, 5th edition, Mc GrawHill
2. Environmental Engineering by Arcadio P. Sincero&Gergoria A. Sincero PHI Publication
3. Principles of Environmental Engineering and Science, M. L. Davis and S. J. Masen,
McGraw Hill International Edition, 2004
4. Environmental Science, Curringham&Saigo, TMH,
5. An Introduction to Environmental Engineering and Science by Gilbert M. Masters &
Wendell P. Ela - PHI Publication.
6. Industrial Safety Management and Technology, Colling. D A – Prentice Hall, New Delhi.

59
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

Lab 11 (DSE Lab 4): Relational Database Management System Lab (ILCCS501)

List of Experiments:
1. Use of SQL syntax: insertion, deletion, join, updation using SQL. (1 class)
2. Programs on join statements and SQL queries including where clause. (1 class)
3. Programs on procedures and functions. (1 class)
4. Programs on database triggers. (1 class)
5. Programs on packages. (1 class)
6. Programs on data recovery using check point technique. (1 class)
7. Concurrency control problem using lock operations. (1 class)
8. Programs on ODBC using either VB or VC++. (1 class)
9. Programs on JDBC. (1 class)
10. Programs on embedded SQL using C / C++ as host language. (1 class)

60
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

Lab 12 (DSE Lab 5): Java Programming Lab (ILCCS502)

Note: This course shares the objectives and outcomes of its associated theory course PPCCA202.
Suitable IDE will be used to carry out laboratory exercises. The programs will follow proper
object-oriented modeling. The exercises suggested below are illustrative in nature. Additionally,
suitable exercises may be suggested by the faculty concerned to meet the course objectives.

List of Exercises:
1. Develop an Object Oriented Program to find the area and perimeter of a circle.
2. Develop an interest calculator program to find simple interest payable monthly,
compound interest payable annually compounded quarterly. Use keyboard inputs for
interest rate and principal amount.
3. Define a class to calculate professional tax on a salary amount based on the following tax
rate. Use if and switch control structures.
Salary Slab Tax Rate
Up to Rs. 10000.00 Nil
Between Rs. 10001.00 – Rs. 25000.00 Rs. 100.00
Between Rs. 25001.00 – Rs. 50000.00 Rs. 200.00
Between Rs. 50001.00 – Rs. 75000.00 Rs. 300.00
Between Rs. 75001.00 – Rs. 100000.00 Rs. 450.00
Above Rs. 100000.00 Rs.650.00

4. Develop a text-menu based program to compute area and perimeter of a circle, rectangle,
square and a right angle triangle.
5. Develop a menu based program to perform operations in a bank account.
6. Develop a program to find the sum of even numbers and sum of odd numbers in a set of
numbers. Define a class with suitable methods to carry out the operations. Use array to
store numbers.
7. Modify the class defined in sl-6 to find largest and smallest numbers in a set of numbers.
8. A student scores marks in subjects in a semester. A semester has 5 or 6 subjects
depending of MCA course. Define a class called Score that contains subject code, name
and marks in that subject. Define a class called Student having an array of objects of
Score class in it following object composition. Process result of students in different
semesters.
9. Define a class called Simple Math with overloaded methods to carryout arithmetic
operations using it. Use static methods appropriately.
10. Redefine the Circle class in exercise 1 to use value of Pi as a constant and a variable to
count number of instances created as you go on creating objects.
11. Develop a class to perform the following tasks on a line of text
a. Count the number of words in the text
b. Searches a particular string in the text
c. Checks if the text is a palindrome
12. A library is a collection of books. Generally, a book is authored by one or more authors.
Develop a program to add books and display a list of books when searched by author
name. Consider title, ISBN number, publisher name, publication year for book;
designation, organization, and country for author.

61
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

13. In CET, two types of people are there: students and employees. As per Govt. of India,
everyone must have his or her AADHAR number for unique identification. Model these
objects appropriately using inheritance and create an array of people with several students
and employees in it. Write a program to search a student or an employee based on
AADHAR number and print its details.
14. There are different shapes such as circles, rectangles and squares and need to be kept
track of if they are painted or not with colors. Create a collection of shapes to be painted.
Consider some cost of a color per square unit of the shape area. Write a program to
calculate the painting cost of different shapes. Print the list of shapes which are not
painted. Also print the list of painted shapes with their color, painting cost and area.
15. A bank account maintains a minimum balance. If the account balance comes down below
this level due to some withdrawal, then it raises warning and disallows the operation.
Define a custom exception class called “Insufficient Fund Exception” which will be
raised when such event occurs. Also use the built-in exception class “Illegal Argument
Exception” which is to be raised when you try to either withdraw or deposit an amount
less than or equal to zero.
16. Write a multithreaded program to perform following parallel operations on a set of
numbers.
a) Find the largest number
b) Find the sum of the number
c) Sort the numbers
17. Write program using console I/O.
18. Write Programs using File I/O.
19. Write program using serialization.
20. Write client server programs using Java sockets.
21. Write JDBC programs to perform CRUD operations.
22. Write JDBC program to execute stored procedures.
23. Write GUI programs using basic swing classes
24. Write GUI program involving Menus
25. Write a GUI program using JavaFX

62
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

Semester-6

Core 17: Operations Research (IPCMH601)

Course Objectives:
1. Understand the concept of linear programming.
2. Demonstrate knowledge of transportation problems, assignment problems.
3. Understand the concept of non-linear programming.

Prerequisites: Linear Algebra.

Syllabus:
Module-I:
Modeling of problems and principle of modeling. Linear programming: Formulation of LPP,
Graphical solution, Simplex method, Big M method, II Phase method, Revised simplex method,
Duality theory and its application, Dual simplex method, Sensitivity analysis in linear
programming. Transportation problems: Finding an initial basic feasible solution by Northwest
Corner rule, Least Cost rule, Vogel’s approximation method, Degeneracy, Optimality test,
MODI method, Stepping stone method.

Module -II:
Assignment problems: Hungarian method for solution of Assignment problems. Integer
Programming: Branch and Bound algorithm for solution of integer Programming Problems.
Simulation and Modeling: Introduction to simulation and modeling. Markov analysis:
Introduction to markov processes, State and Transition Probabilities, Transition Diagram, n-step
transition probabilities.

Module -III
Queuing models: General characteristics, Markovian queuing model, M/M/1 model, Limited
queue capacity, Multiple server, Finite sources, Queue discipline. Non-linear programming:
Introduction to non-linear programming. Unconstraint optimization: Fibonacci and Golden
Section Search method. Constrained optimization with equality constraint: Lagrange multiplier,
Constrained optimization with inequality constraint: Kuhn-Tucker condition.

Text Books:
1. A. Ravindran, D. T. Philips, J. Solberg, “Operations Research- Principle and Practice”,
Second edition, Wiley India Pvt Ltd
2. Kalyanmoy Deb, “Optimization for Engineering Design”, PHI Learning Pvt Ltd

Reference Books:
1. Stephen G. Nash, A. Sofer, “ Linear and Non-linear Programming”, McGraw Hill
2. A. Ravindran, K.M. Ragsdell, G.V. Reklaitis,” Engineering Optimization”, Second
edition, Wiley India Pvt. Ltd
3. H.A. Taha, A.M. Natarajan, P. Balasubramanie, A. Tamilarasi, “Operations Research”,
Eighth Edition, Pearson Education

63
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

4. F.S. Hiller, G.J. Lieberman, “Operations Research”, Eighth Edition, Tata McGraw Hill
5. P.K. Gupta, D.S. Hira, “Operations Research”, S. Chand and Company Ltd.
6. Kanti Swarup, P. K. Gupta, Man Mohan, “Operations Research”, Sultan Chand and Sons.

Course outcomes: After the successful completion of this course the students will be able to
1. Identify and develop operational research models from the verbal description of the
2. real system.
3. Understand the mathematical tools that are needed to solve optimization problems.
4. Use mathematical software to solve the proposed models.
5. Develop a report that describes the model and the solving technique, analyze the results
and propose recommendations in language understandable to the decision-making
processes in Management Engineering.

64
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

Core 18: Complex Analysis (IPCMH602)

Course Objectives:
1. Determine whether a given function is differentiable, and if so find its derivative.
2. Find parametrizations of curves, and compute complex line integrals directly.
3. Identify the isolated singularities of a function and determine whether they are
removable, poles, or essential.
4. Use the residue theorem to compute complex line integrals and real integrals.

Prerequisites: Real Analysis.

Syllabus:
Module-I:
The complex number system: The real numbers, The field of complex numbers, the complex
plane, polar representation and roots of complex numbers, Line and half planes in the complex
plane. Power series and radius of convergence, analytic function, Power series representation of
analytic functions, Cauchy- Riemann equation, analytic function as mapping and its Mobius
transformation.

Module-II:
Complex integration: Zeros of analytic function, entire function, Liouville’s theorem,
fundamental theorem of algebra, maximum modulus theorem, Index of a closed curve, Cauchy’s
theorem and Cauchy’s integral formula, Morera’s theorem.

Module-III:
Classification of singularity, Poles, absolute convergence, Laurent series development, Residue
theorems, evaluation of integrals by using residue theorem, Argument principle, Rouche’s
theorem, Maximum Modulus theorem, Schwarz’s Lemma.

Text Book:
1. Functions of one Complex variable- J. B. Conway (Springer Verlag , International student
edition, Narosa Publishing house, Chapter-1(1.1-1.5), Chapter-3(3.1- 3.3), Chapter-4(4.2 -
4.5), Chapter-5(5.1-5.3), Chapter-6(6.1 - 6.2).

Reference Books:
1. Complex Analysis by Alhfors, TMH.
2. Complex Variable; Theory & Application: Kasana, PHI

Course Outcomes: After the successful completion of this course the students will be able to
1. Explain the fundamental concepts of complex analysis and their role in modern
mathematics and applied contexts.
2. Demonstrate accurate and efficient use of complex analysis techniques.
3. Demonstrate capacity for mathematical reasoning through analyzing, proving and
explaining concepts from complex analysis.
4. Apply problem-solving using complex analysis techniques applied to diverse situations in
physics, engineering and other mathematical contexts.

65
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

Core 19: Differential Equation –II (IPCMH603)

Course Objectives:
1. Identify the type of a given differential equation and select and apply the appropriate
analytical technique for finding the solution of first order and selected higher order
ordinary differential equations.
2. Evaluate first order differential equations including separable, homogeneous, exact, and
linear. Show existence and uniqueness of solutions.
3. Solve nonhomogeneous equations. Create and analyze mathematical models using higher
order differential equations to solve. application problems such as harmonic oscillator and
circuits. Solve differential equations using variation of parameters
4. Evaluate Laplace Transforms. Find series solutions. Solve linear systems of ordinary
differential equations.

Prerequisites: 1st Order O.D.E. and Higher Order O.D.E. with constant coefficients

Syllabus:
Module-I:
Boundary value problems for Ordinary Differential Equations; Sturm -Lioville Problems,
Orthogonalism of Eigen functions, Green’s functions, Self adjoint Equations of second order.
Ordinary Differential Equations in more than two variables, Simultaneous linear first order
equations in three variables, Methods of solution of Pfaffian differential Equations in three
variables

Module-II:
Partial Differential Equations of first order: Formulation of first order Partial Differential
Equation, Linear Partial Differential Equations of first order, Non-Linear Partial Differential
Equations of first order, Special types of Partial Differential Equations of first order, Solution of
Partial Differential Equations of first order satisfying given conditions (Charpit’s Methods)

Module-III:
Partial Differential Equations of second and higher order: Linear Partial Differential
Equations with constant coefficients, Equations reducible to linear Partial Differential Equations
with constant coefficients, Partial Differential Equations with variable coefficients. Some
standard forms of variable coefficients, Separation of variables (Product method), Non linear
equations of the second order (Mange’s Method).

Text Books:
1. A course on Ordinary and Partial Differential Equations: J Sinha Roy and Padhy
2. Ordinary and Partial Differential Equations: M D Raisinghania.

Course outcomes: After the successful completion of this course the students will be able to
1. Distinguish between linear, nonlinear, partial and ordinary differential equations
2. Use the existence theorem for boundary value problems to determine uniqueness of
solutions.

66
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

3. Use the Wronskian to determine if a set of functions is linearly independent

4. Apply the fundamental concepts of Ordinary Differential Equations and Partial
Differential Equations and the basic numerical methods for their resolution.
5. Understand the difficulty of solving problems analytically and the need to use numerical
approximations for their resolution

67
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

Core 20: Computer Networks (IPCMH604)

Course Objectives:
1. To provide students with broad concepts and fundamentals of computer networks.
2. To familiarize students with the layered approach to computer network.
3. To provide adequate knowledge on issues and protocols involved in different layers of
network.

Module I
Network architecture, Layers, Transmission Media, Data Link Layer, Issues in the data link
layer, Framing Error detection and correction, Link-level Flow Control, Medium access, CSMA,
Ethernet, Token ring, FDDI, Wired LAN, Wireless LAN

Module II
Connecting Devices, Bridges and Switches, Circuit switching vs. Packet switching, Packet
switched networks, Network Layer: Design issues, Logical Addressing, Subnetting, CIDR, IPV4,
IPV6, Address Mapping, ARP, RARP, DHCP, ICMP; Delivery, Forwarding, Routing
algorithms, RIP, OSPF, BGP-Multicasting-Congestion avoidance in network layer.

Module III
Transport layer: Process- to-process delivery, UDP, TCP Adaptive Flow Control, Adaptive
Retransmission, Congestion control, Congestion avoidance and QoS, Application Layer: Email
(SMTP, MMIME, IMAP, POP3), Remote Logging (Telnet), File Transfer(FTP), WWW and
HTTP, Domain Name System (DNS), Network management (SNMP)
Text Books:
1. Data Communications and Networking by Behrouz A. Forouzan. Third Edition, TMH.

Reference Books:
1. Computer Networks by Andrew S Tanenbaum, David. J. Wetherall, 5th Edition. Person
Education/PHI
2. Computer Networks: A System Approach by Larry L. Peterson, Bruce S. Davie, Morgan
Kauffmann Inc.,2003.
3. Computer and Communication Networks by Nader F. Mir, Person Education, 2007
4. Data and Computer Communication, William Stallings, Sixth Edition, Person
Education,2000

Course Outcomes:
On successful completion of the course, the students will be able to:
1. Understand the basic concepts of computer network and data communication.
2. Understand the functions of each layer in the OSI and TCP/IP reference model.
3. Understand the working of essential protocols of computer networks, and how they can
be applied in network design and implementation.

68
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

Core 21: Coding Theory (IPCMH605)

Course Objectives:
1. Understand basic concepts and techniques in coding theory.
2. Demonstrate knowledge of encoding and decoding procedure.
3. Learn important families of algebraic codes, graphical codes and convolutional codes.

Prerequisites: Abstract Algebra

Syllabus:
Module-I:
The communication channel, the coding problem, Block codes, Hamming metric, Nearest
neighbour decoding, Linear codes, Generator and Parity-check matrices, Dual code, Standard
array decoding, Syndrome decoding,
Hamming codes, Golay codes, Reed-Muller codes, Codes derived from Hadamard matrices

Module-II:
Bounds on codes: Sphere packing bound, Perfect codes, Gilbert-Varshamov bound, Singleton
bound, MDS codes, Plotkin bound, Weight distribution of codes, MacWilliams Identities
Algebra of polynomials, Residue class rings, Finite fields, Cyclic codes, Generator polynomial
and check polynomial, Defining set of a cyclic code, BCH bound, Encoding and decoding of
cyclic codes

Module-III
Hamming and Golay codes as cyclic codes, BCH codes, Reed-Solomon codes, Quadratic residue
codes, Graphical codes, Convolutional codes
Text books:
1. S. Ling and C. Xing: Coding Theory: A First Course, Cambridge University Press
2. F.J. MacWilliams and N.J.A. Sloane: The theory of error correcting codes, North Holland

Reference Books:
1. V. Pless: Introduction to the theory of error correcting codes, John Wiley
2. W.C. Huffman and V. Pless: Fundamentals of error correcting codes, Cambridge
University Press
3. R.M. Roth: Introduction to coding theory, Cambridge University Press

Course Outcomes: After completion of the course, the student is able to

1. Comprehend various error control code properties
2. Apply linear block codes for error detection and correction
3. Apply convolution codes for performance analysis & cyclic codes for error detection and
correction.
4. Design BCH & RS codes for Channel performance improvement against burst errors.

69
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

GE 6: Indian Society, Ethics & Culture (IOEMH601)

Module I:
Introduction to Ethics
1.1 Basic Terms-Morality, Ethics, Emotional Intelligence, Ethical Dilemma
1.2 View on ethics by Aristotle, Gandhian Principle
1.3 Moral development Theory by Kohlberg
1.4 Indian society’s origin and Composition
1.5 Secularisation and Democratisation.

Module II:
Ethics and religion-
2.1 Personal Ethics, Governing factors of an Individual’s value system, utilitarianism,
Deontology, Moral Absolutism
2.2 Protestant Religious movements in the 6th century B C - Gautama Buddha and
Buddhism, Mahavir Jain and Jainism
2.3 Cultural attainment with reference to the Gupta Golden age
2.4 Ethical Issues-IPR, CSR, Bioethics, Media Ethics.

Module III:
Roots of Indian Culture
3.1 Harappan Culture and Vedic culture
3.2 Cultural Expansion, Hellenistic impact on art and architecture
3.3 Impact of Islam on Indian life 3.4 Socio-religious Reform Movements- Bhakti
movement, Brahmo Samaj and Arya Samaj.

Text Books:
1. Indian Society and Culture- P.C Das, B.C Das, S.S Das-Kalyani Publisher.
2. Professional Ethics- R. Subramanian-Oxford university Press

Reference Books:
1. Business Ethics-Manuel Velasquez-Pearson Education
2. Ethics & Conduct of Business- John R Boatright, B. P. Patra- PEARSON Publication

70
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

Lab 13 (Core Lab 2): Operation Research Lab (ILCMH601)

List of Experiments:
1. Introduction to linear programming problem, solving lpp by mat lab(Introduction)
2. Solve various simplex problem using mat lab Function
3. Solve Transportation and assignment problem using, Any suitable simulator
4. Compare. between Transportation, Assignment problem by Using mat lab
5. Explore queuing theory for scheduling, resource allocation, and traffic flow applications
using MATLAB
6. Elementary concepts of Modelling and Simulation using MATLAB
7. Solve Various Decision Problem Using MATLAB
8. Introduction to Nonlinear Programming by any suitable simulator
9. Iterative methods for optimization problem by any suitable simulator
10. Application of nonlinear programming using MATLAB

71
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

Lab 14 (Core Lab 3): STATISTICA Lab (ILCMH602)

List of Experiment:
1. Introduction to statistical problem by STATISTICA.
2. Finding Correlation, Regression by the use of STATISTICA.
3. T- test, Chi square test by using STATISTICA.
4. Testing of hypothesis, confidence interval by using STATISTICA.
5. Statistical validation of various types of data by using STATISTICA.
6. Design and modelling of Binomial and Poisson distribution by STATISTICA.
7. Generation of random numbers, by any simulator.
8. Simple integration by random numbers, STATISTICA implementation.
9. Finding 1st,2nd moments by using STATISTICA.
10. General statistical application in validation of medical related data.

72
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

Semester-7

Core 22: Advanced Analysis (IPCMH701)

Course Objective:
1. The students will learn about measure theory random variables, independence,
expectations and conditional expectations, product measures.
2. Explain the concept of length, area, volume using Lebesgue’s theory.
3. Apply the general principles of measure theory and integration in such concrete subjects
as the theory of probability or financial mathematics.
4. They will develop a perspective on the broader impact of measure theory in ergodic
theory and have the ability to pursue further studies in this and related area.

Prerequisites: Basics of Real Analysis

Syllabus:
Module-I
Lebesgue Measure: Introduction, Lebesgue outer measure, The σ-algebra of Lebesgue
measurable sets, Outer and inner approximations of Lebesgue measurable sets. Countable
additivity, Continuity and the Borel-Cantelli lemma. Non-measurable sets, The Cantor set and
the Cantor-Lebesgue function.
Lebesgue Measurable Functions: Sums, Products and compositions, Sequential point-wise
limits and simple approximation, Littlewood’s three principles, Egoroff’s theorem and Lusin’s
theorem.

Module-II
Lebesgue Integration: The Riemann integral, The Lebesgue integral of a bounded measurable
function over a set of finite measure. The Lebesgue integral of a measurable non-negative
function, The general Lebesgue integral, Countable additivity and continuity of integration,
Uniform integrability: The Vitali convergence theorem.
Lebesgue Integration: Uniform integrability and Tightness: A general Vitali convergence
theorem, Convergence in measure, Characterization of Riemann and Lebesgue’s integrability.

Module-III
Differentiation and Integration: Continuity of monotone functions, Differentiability of
monotone functions: Lebesgue’s theorem, Functions of bounded variation: Jordon’s theorem,
Absolutely continuous functions, Integrating derivatives, Differentiating Indefinite integrals,
Convex functions. The L^p-spaces, completeness and approximation, Normed linear spaces, The
inequalities of Young, Ho ̈lder and Minkowski, L^p is complete, The Riesz-Fisher theorem,
Approximation and Separability.

Text Books:
1. Real Analysis by H.L. Royden (3rdedition) PHI.
Chapter 3(3.1 to 3.5), Chapter 4(4.1 to 4.4), Chapter 11, Chapter 12(12.1 to 12.7).

73
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

2. Mathematical analysis by Tom M. Apostol, 2nd Edition, Addison-Wesley publication

company Inc. New york, 1974.
Chapter 6(6.1 to 6.8), Chapter 7(7.1 to 7.11)

Reference Books:
1. Bartle, R.G. Real Analysis, Wiley.
2. Rudin, W. Principles of Mathematical Analysis, 3rd Edition. McGraw Hill Company,
New York, 1976.
3. Malik, S.C. and Savita Arora. Mathematical Analysis, Wiley Eastern Limited, New
Delhi, 1991.
4. Sanjay Arora and Bansi Lal, Introduction to Real Analysis, Satya Prakashan, New Delhi,
1991.
5. Gelbaum, B.R. and J. Olmsted, Counter Examples in Analysis, Holden day, San
Francisco, 1964.
6. A.L. Gupta and N.R. Gupta, Principles of Real Analysis, Pearson Education, (Indian
print) 2003.
7. Measure theory and integration by G. De. Barra (Wiley Eastern Limited)

Course outcomes: After the successful completion of this course the students will be able to
1. demonstrate a competence in formulating, analyzing and solving problems in several core
areas of mathematics at a detailed level, including analysis,
2. understand the fundamentals of measure theory and be acquainted with the proofs of the
fundamental theorems underlying the theory of integration,
3. learn about measure theory random variables, independence, expectations and conditional
expectations, product measures,
4. apply the general principles of measure theory and integration in such concrete subjects
as the theory of probability or financial mathematics.

74
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

Core 23: Advanced Linear Algebra (IPCMH702)

Course Objectives:
1. Use computational techniques and algebraic skills essential for the study of systems of
linear equations.
2. Use visualization, spatial reasoning, as well as geometric properties and strategies to
model, solve problems, and view solutions, especially in R2 and R3, as well as
conceptually extend these results to higher dimensions.
3. Critically analyze and construct mathematical arguments that relate to the study of
introductory linear algebra.
4. Work collaboratively with peers and instructors to acquire mathematical understanding
and to formulate and solve problems and present solutions.

Prerequisites: Linear Algebra.

Syllabus:
Module-I
Dual Spaces, Algebra of Linear transformations, Characteristics roots, Modules, Direct sums,
Cyclic modules, Vector spaces, Quotient modules, Homomorphisms, Simple modules, Semi
simple modules, Schur’s modules.

Module-II
Artinian & Notherian Modules & Rings, Hilbert basis theorem, Fundamental theorem of finitely
many generated modules over PID’s.

Module-III
Canonical forms: Similarity of linear transformations, Invariant spaces, Reduction to triangular
forms, Invariants of nilpotent transformation, Primary decomposition theorem. Jordan Canonical
form & Rational Canonical form.

Text Book
1. I.N. Herstein: Topics in Algebra, Vikas Publishing House Pvt. Ltd.
2. C. Musili: Introduction to Rings and Modules, Narosa Publishing House
3. I.S. Luthar and I.B.S Passi: Algebra (Vol-3- Modules) Narosa Publishing House

Course Outcomes: After the successful completion of this course the students will be able to
1. Demonstrate accurate and efficient use of advanced algebraic techniques
2. Demonstrate capacity for mathematical reasoning through analyzing, proving and
explaining concepts from advanced algebra
3. Apply problem-solving using advanced algebraic techniques applied to diverse situations
in physics, engineering and other mathematical contexts

75
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

Core 24: Advanced Differential Equation (IPCMH703)

Course Objectives:
1. Recognize the three basic types of partial differential equations.
2. Apply Fourier Series and Transforms for solution to partial differential equations.
3. Solve Strum-Liouville boundary value problems and Apply Green's Function to the
solution of boundary value problems.
4. Apply both analytic and numerical methods to the solution of hyperbolic, parabolic and
elliptic partial differential equations.

Prerequisites: Basics of Differential Equation.

Syllabus:
Module-I
Application of first order differential equation in Growth, decay, Chemical Reactions,
Elementary Mechanics, One dimensional heat flow, Orthogonal trajectories, Biological Sciences
(The oxygen debt), Mixing problems, Business and Economics. Application of Linear
differential equation in Escape velocity problem, Undamped simple harmonic vibrations,
Damped vibrations. Electric circuits problems. Hermite equations and Hermite Polynomials,
Hypergeometric equations, Hypergeometric functions, Elementary properties hypergeometric
functions.

Module-II:
System of Linear Differential Equations: Basic Theory of Linear Systems, Trial Solution
Method for Linear System with Constant coefficients, Operator method for linear system with
Constant coefficients, Martix method for linear system with Constant coefficients. Non-
Homogeneous Linear Systems. The Laplace Equation: Boundary value problem for Laplace’s
Equations, Fundamental Solution of Laplace’s Equation, Integral Representation of Harmonic
Functions, Mean Value Formula for Harmonic Functions, Green’s Functions for Laplace’s
Equation

Module-III:
The Wave equation: Derivation of One Dimensional Wave Equation, Solution of the wave
Equation (Method of separation of variables), D’Alembert’s solutions of the wave Equation,
Derivations of Two Dimensional Wave equation, Solutions of Two Dimensional Wave equation.
The Heat equation: The One Dimensional Heat Equation, Solution of One Dimensional Heat
Equation Derivation of two Dimensional Heat Equation, Solution of Two Dimensional Heat
Equation, Laplace Equations in Polar Coordinates.

Text Books:
1. A course on Ordinary and Partial Differential Equations by J. Sinha Roy and S. Padhy,
Kalyani Publishers. Chapters: 2(2.8), 4(4.8), 7(7.3.2,7.4.3,7.4.4), 8, 15(15.1-15.4),
16(16.1-16.4)
2. Higher Engineering Mathematics by B V Ramana, Chapter 19 (19.1-19.8).

Reference Book:

76
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

1. Ordinary and Partial Differential Equations by M. D. Raisinghania.

Course outcomes: After the successful completion of this course the students will be able to
1. have a broad overview of ordinary and partial differential equations as well as an
appreciation of the application of analysis and linear algebra in studying differential
equations.
2. have the skills to build mathematical models of relevant real-world problems based on
differential equations.
3. solve these differential equations using appropriate computer software if necessary, and
to interpret the solutions.
4. understand the concepts of accuracy, consistency, stability and convergence of numerical
schemes for solving differential equations.
5. predicts the world around us. They can describe exponential growth and decay population
growth of species or change in investment return over time.

77
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

OE 1: Software Engineering (IOECS701)

Course Objectives:
1. Graduates are effective team members, aware of cultural diversity, who conduct
themselves ethically and professionally.
2. Graduates use effective communication skills and technical skills to assure production of
quality software, on time and within budget.
3. Graduates build upon and adapt knowledge of science, mathematics, and engineering to
take on more expansive tasks that require an increased level of self-reliance, technical
expertise, and leadership.

Syllabus:
Module I:
Software Process Models:
Software Product, Software crisis, Handling complexity through Abstraction and Decomposition,
Overview of software development activities, Process Models, Classical waterfall model,
iterative waterfall model, prototyping mode, evolutionary model, spiral model, RAD model,
Agile models: Extreme Programming, and Scrum.
Software Requirements Engineering:
Requirement Gathering and Analysis, Functional and Non-functional requirements, Software
Requirement Specification (SRS), IEEE 830 guidelines, Decision tables and trees.

Module II:
Structured Analysis & Design:
Overview of design process: High-level and detailed design, Cohesion and coupling, Modularity
and layering, Function–Oriented software design: Structured Analysis using DFD Structured
Design using Structure Chart, Basic concepts of Object Oriented Analysis & Design. User
interface design, Command language, menu and iconic interfaces.
Coding and Software Testing Techniques:
Coding, Code Review, documentation. Testing: - Unit testing, Black-box Testing, Whitebox
testing, Cyclomatic complexity measure, coverage analysis, mutation testing, Debugging
techniques, Integration testing, System testing, Regression testing.

Module III:
Software Reliability and Software Maintenance:
Basic concepts in software reliability, reliability measures, reliability growth modelling, Quality
SEI CMM, Characteristics of software maintenance, software reverse engineering, software
reengineering, software reuse.
Emerging Topics:
Client-Server Software Engineering, Service-oriented Architecture (SOA), Software as a Service
(SaaS).

Text Book:
1. Software Engineering, A Practitioner’s Approach, Roger S. Pressman, TMG Hill.
2. Software Engineering, I. Sommerville, 9th Ed. , Pearson Education.

78
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

Reference Books:
1. Fundamentals of Software Engineering, Rajib Mall, PHI, 2014.
2. Pankaj Jalote, “An Integrated Approach to Software Engineering”, Narosa Publishing
House, Delhi, 2000.

Course outcomes: After the successful completion of this course the students will be able to
1. apply knowledge of mathematics, science, and engineering.
2. design and conduct experiments, as well as to analyze and interpret data.
3. design a system, component, or process to meet desired needs within realistic constraints
such as economic, environmental, social, political, ethical, health and safety,
manufacturability, and sustainability.
4. function on multi-disciplinary teams.
5. identify, formulate, and solve engineering problems.
6. understand professional and ethical responsibility.
7. communicate effectively.

79
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

PE 1: Algebraic Graph Theory (IPEMH701)

Course Objectives:
1. To introduce topics and techniques of discrete methods and combinatorial analysis.
2. To introduce a large variety of applications and, through some of them, the algorithmic
approach to the solution of problems.
3. To develop mathematical maturity.
4. To present a survey of essential topics for computer science students who will encounter
some of them again in more advanced courses

Prerequisites: Linear Algebra, Graph Theory.

Syllabus:
Module-I:
Linear Algebra in Graph Theory.
The spectrum of a graph, Regular graphs and Line graphs, Cycle & Cuts, Spanning trees and
associated structures, The tree number, Determinant expansions, Vertex partitions and the
spectrum.

Module-II:
Colouring Problems.
The chromatic polynomial, Subgraph expansions, The multiplicative expansion, The induced
subgraph expansion, The Tutte polynomial, Chromatic polynomial and spanning trees.

Module-III:
Symmetry and Regularity.
Automorphisms of graphs, Vertex transitive graphs, Symmetric graphs, Symmetric graphs of
degree three, The covering- graph construction, The Matching problem, Distance-transitive
graphs, Feasibility of intersection array, Imprimitivity, Minimal regular graphs with given girth.
TEXT BOOK –
1. ALGEBRAIC GRAPH THEORY by Norman Biggs, London School of Economics,
Cambridge University Press.
2. Graph Theory with applications to engineering and computer science by Narsingh Deo,
PHI.

REFERENCE BOOK –
1. ALGEBRAIC GRAPH THEORY, by C.D. Godsil, Gordan Royle, Springer.
2. Introduction to Graph Theory by Douglas B. West, 2nd edition, PHI.

Course outcomes: After the successful completion of this course the students will be able to
1. Write precise and accurate mathematical definitions of objects in algebraic graph theory;
2. Validate and critically assess a mathematical proof;
3. Use a combination of theoretical knowledge and independent mathematical thinking in
creative investigation of questions in graph theory;
4. Reason from definitions to construct mathematical proofs;

80
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

PE 1: Computational Finance (IPEMH702)

Course Objectives:
1. To demonstrate knowledge and understanding of the concepts underlying computational
finance, the mathematical tools and their computational implementations,
2. To demonstrate knowledge underlying the subject, theoretical foundation of Blockchain
technologies.
3. To provide an experience of formulating finance problems into computational problems
and bring a level of confidence to students to the finance field.
4. To introduce numerical techniques for valuation, pricing and hedging of financial
investment instruments such as options.

Prerequisites: Probability, Differential Equation.

Syllabus:
Module-I
Stochastic process: Markov process, Wiener process, Geometric Brownian Motion, Ito Integral,
Ito’s Lemma.
Basic concepts of financial- Stock options, Forward and Futures, Speculation, Hedging, put-call
parity, Principle of non-arbitrage pricing, Computation of volatility.

Module-II
Derivation of blacks-scholes differential equation and Black-scholes Option Pricing formula,
Greeks and Hedging strategies.

Module-III
Finite difference methods for partial differential equations-finite difference approximation to
derivatives, Explicit and implicit and methods for parabolic equations, Iterative methods for
solution of a system of linear algebraic equations, Two dimensional Parabolic equations-
alternating – direct implicit method, Convergence, Stability and Consistency of finite difference
schemes.

Text Book:
1. J. Bax and G. Chacko-Financial Derivatives: Pricing, Application and Mathematics-
Cambridge Univ. Press, 2004.
2. G. D. Smith: Numerical Solution of Partial Differential Equations, Oxford University
Press.

References Book:
1. P. Wilmott: Qualitative Finance-John Wiley, 2000.
2. P. Copinsui and T. Zastawrian: Mathematics for Finance-an Introduction to Financial
Engineering, Springer Verlag.
3. J. C. Hull: Options, Futures and others Derivatives-PHI, 2003

Course Outcomes: After successful completion of the course, students will be able to:
1. Understand the underlying concepts computational finance,

81
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

2. translate mathematical problems (well defined systems of mathematical equations) into

computational tasks,
3. process numerical results into a comprehensible form (including the use of standard
graphical plotting packages), for presentation in a report,
4. to be able to give a critical assessment of the integrity of numerical methods and results,
5. recall the advantages and limitations of different methods, assess / evaluate the
performance of several financial models

82
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

PE 2: Soft Computing (IPECS701)

Course Objectives:
1. To learn the basic concepts of Soft Computing
2. To become familiar with various techniques like neural networks, genetic algorithms and
fuzzy systems.
3. To apply soft computing techniques to solve problems.

Module - I
Introduction to Soft Computing, Artificial Neural Network(ANN): Fundamentals of ANN,
Basic Models of an artificial Neuron, Neural Network Architecture, Learning methods,
Terminologies of ANN, Hebb network, Supervised Learning Networks: Perceptron, MLP,
Architecture of a Back propagation Network : back propagation, Learning Effect of Tunning
parameters of the Back propagation, Adaline, Madaline, RBF Network, Associative memory:
Auto, hetero and linear associative memory, network, Adaptive Resonance Theory ART1,
ART2, Applications

Module –II
Fuzzy Logic Fuzzy set theory: crisp sets, fuzzy sets, crisp relations, fuzzy relations, Fuzzy
Systems: Crisp logic predicate logic, fuzzy logic, fuzzy Rule based system, Defuzzification
Methods, Fuzzy rule-based reasoning GENETIC ALGORITHMS Fundamentals of genetic
algorithms: Encoding, Fitness functions, Reproduction. Genetic Modeling: Cross cover,
Inversion and deletion, Mutation operator, Bit-wise operators, Bitwise operators used in GA.
Convergence of Genetic algorithm. Applications, Real life Problems

Module – III
Hybrid Soft Computing Techniques Hybrid system, neural Networks, fuzzy logic and Genetic
algorithms hybrids. Genetic Algorithm based Back propagation Networks: GA based weight
determination applications: Fuzzy logic controlled genetic Algorithms soft computing tools,
Applications.

Text Book:
1. Principles of Soft Computing- S.N. Sivanandan and S.N. Deepa, Wiley India, 2nd
Edition,2011

Reference Book:
1. Neuro Fuzzy and Soft Computing, J. S. R. Jang, C.T. Sun, E. Mitzutani, PHI
2. Neural Networks, Fuzzy Logic, and Genetic Algorithm (synthesis and Application) S.
Rajasekaran, G.A. Vijayalakshmi Pai, PHI

Course Outcomes: Upon completion of the course, the student should be able to:
1. Apply various soft computing frame works.
2. Design of various neural networks.
3. Use fuzzy logic.
4. Apply genetic programming.
5. Discuss hybrid soft computing.

83
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

PE 2: Mobile Computing (IPECS701)

Course Objectives:
1. Define Mobile Computing and look at current trends
2. Distinguish between types of Mobility
3. Examine Theory Research in Mobility
4. Examine Systems Research in Mobility.

Module –I
Introduction to Personal Communications Services (PCS): PCS Architecture, mobility
management, Networks signaling, Global System for Mobile Communication (GSM) System
overview: GSM Architecture, Mobility management, Network signaling. General Packet Radio
Services (GPRS): GPRS Architecture, GPRS Network Nodes, Mobile Data Communication;
WLANs (Wireless LANs) IEEE 802.II standard, Mobile IP.

Module-II:
Wireless Application Protocol (WAP): The Mobile Internet standard, WAP Gateway and
Protocols, wireless markup Languages (WML), Wireless Local Loop (WLL) : Introduction to
WLL Architecture, wireless Local Loop Technologies. Third Generation (3G) Mobile Services:
Introduction to International Mobile Telecommunications 2000 (IMT 2000) Vision, Wideband
Code Division Multiple Access (W-CDMA), and CDMA 2000

Module -III:
Global Mobile Satellite Systems; case studies of the IRIDIUM, ICO and GLOBALSTAR
systems.
Wireless Enterprise Networks: Introduction to Virtual Networks, Blue tooth technology, Blue
tooth Protocols. Server-side programming in Java, Pervasive web application architecture,
Device independent example application.

Text Book:
1. Mobile Communication: J. Schiller, Pearson Education
2. Mobile Computing: P.K. Patra, S.K. Dash, Scitech Publications.
3. Mobile Computing: Talukder, TMH, 2nd Edition.

Reference Books:
1. Pervasive Computing: Burkhardt, Pearson Education.
2. Principles of Mobile Computing: Hansmann, Merk, Springer, 2nd Edition.
3. Wireless Communication & Networking: Garg, Elsevier
4. Third Generation Mobile Telecommunication Systems: P. Stavronlakis, Springer.
5. The Wireless Application Protocol: Sandeep Singhal, Pearson Education.

84
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

Seminar: Seminar-I (ISEMH701)

[As to be decided by the department]

85
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

Semester-8

Core 25: Topology (IPCMH801)

Course Objectives:
1. Introduce students to the concepts of open and closed sets abstractly, not necessarily only
on the real line approach.
2. Introduce students how to generate new topologies from a given set with bases.
3. They would be familiar with separation axioms, compactness and completeness.
4. They would be able to determine whether a function defined on a metric or topological
space is continuous or not and what homeomorphisms are.

Prerequisites: Real Analysis

Syllabus:
Module –I:
Countable and uncountable set, Infinite sets and the Axiom of choice, Well-ordered sets.
Topological spaces, Basis and sub basis for a topology, The order, product and subspace
topology, closed sets and limit points. Continues function and homeomorphism, Metric topology,
Connected spaces, connected subspaces of the real line, Components and local connectedness.

Module –II:
Compact spaces, Basic properties of compactness, Compactness and finite intersection property,
Compact subspaces of the real line, Compactness in metric spaces, Limit point compactness,
Sequential compactness and their equivalence in metric spaces, Local compactness and one point
compactification.

Module –III:
First and second countable spaces, Product spaces, Lindelo’’f space, Separable spaces, separable
axioms, Hausdorff, Regular and normal spaces. The Urysohn lemma, completely regular spaces,
The Urysohnmetrization theorem, Imbedding theorem, Tietn extension Theorem, Tychonoff
theorem, Stone-Cechcompactification.

Text Book:
1. Topology, J.R. Munkres, 2e, Pearson Education, 2000.
Chapter: 1(7,9,10),2(excluding section 22), 3, 4 (excluding section 36), 5.

Reference Book:
1. Introduction to general Topology, by K.D.Joshi, Wiley Eastern Ltd., 1983.
2. Foundation of General Topology, by W.J. Pervin, Academic Press, 1964.
3. General Topology, by S.Nanda and S.Nanda, Macmillan India.

Course outcomes: After the successful completion of this course the students will be able to
1. The student will be familiar with basic notions of metric and topological spaces.

86
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

2. The student will be familiar with methods and techniques of proving basic theorems on
topological spaces and continuous mappings.
3. The student can check if a given function is metric, continuous.
4. The student can check if a given set is open, closed, dense, compact, connected.
5. The student is able to apply his or her knowledge of general topology to formulate and
solve problems of a topological nature in mathematics and other fields where topological
issues arise.

87
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

Core 26: Probability and Stochastic Processes (IPCMH802)

Course Objectives:
1. To provide the students with knowledge about the random variable, random process and
how to model the random processes in the communication system such as receiver
performance, interference, thermal noise, and multipath phenomenon.
2. To introduce the idea of a stochastic process, and to show how simple probability and
matrix theory can be used to build this notion into a beautiful and useful piece of applied
mathematics.
3. To understand the notion of a Markov chain, and how simple ideas of conditional
probability and matrices can be used to give a thorough and effective account of discrete-
time Markov chains;
4. To be able to apply these ideas to answer basic questions in several applied situations
including genetics, branching processes and random walks.

Prerequisites: Probability Distribution and Expectation of single random variable.

Syllabus:
Module-I:
Multiple random variables, Functions of several random variables, Covariance, Correlation and
Moments, Conditional expectation. Modes of convergence of a sequence of random variables,
Weak law of large numbers, Strong law of large numbers, Central limit theorem.

Module-II:
Introduction to Stochastic process, Specification of stochastic process, Markov chain, Transition
probability, Classification of states and chains, Determination of higher transition probability, ,
Markov chain with discrete and continuous space.

Module-III:
Poisson process with related distribution, Generalization of Poisson process: Pure birth process,
Birth and death process.

Text book
1. An Introduction of Probability and Statistics by V. K. Rohatgi and A. K. Md.E. Saleh, 2nd
Edition, Wiley Publication. (Chapter 4 and Chapter 6)
2. Stochastic Process by J. Medhi, New Age International Publication (2nd edition}
3. A first course in Stochastic process, S. Karlin & H. Taylor,2nd Edition, Academic Press.
Reference book
1. Fundamentals of Mathematical Statistics by S.C.Gupta&V.K.Kapoor, S Chand & Sons.
2. Stochastic Process by Sheldon M. Ross, Wiley & sons, (2nd edition)
3. Stochastic Process by D N Shanbhag, C R Rao, Gulf Publishing.
4. Stochastic Methods by Crispin Gardiner, Springer.
5. Probability, Random Variables and Stochastic Processes, 4thEdn., A. Papoulis and S. U.
Pillai, TMH Publication.

Course outcomes: After the successful completion of this course the students will be able to

88
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

1. Have a general overview of discrete and continuous random variables and their statistical
properties
2. Understand how random variables and stochastic processes can be described and analyzed
3. Know the law of large numbers and their application
4. Overview of Markov process and applications;

89
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

Core 27: Advanced Numerical Analysis (IPCMH803)

Course Objectives:
1. To bring out role of approximation theory in the process of developing a numerical recipe
for solving an engineering problem.
2. Introduce geometric ideas associated with the development of numerical schemes.
3. Familiarize the student with ideas of convergence analysis of numerical methods and other
analytical aspects associated with numerical computation.
4. It is shown that majority of problems can be converted to computable forms (discretized)
using three fundamental ideas in the approximation theory, namely Taylor series
expansion, polynomial interpolation and least square approximation.
5. In addition, the student is expected to clearly understand role of the following four
fundamental tools Linear Algebraic Equation Nonlinear Algebraic Equations Ordinary
Differential Equations- Initial Value Problem Optimization.

Prerequisites: Numerical Method.

Syllabus:
Module –I:
Solution of Equations: Zeros of Polynomials, Horner’s method, Muller’s method, Interpolation
& Polynomial Approximation: Lagrange polynomial, Data approximation Hermite, cubic spline
and piecewise interpolation (Natural cubic splines, clamped Splines)
Numerical differentiation: Numerical differentiation, Richardson Extrapolation.
Numerical Integration & Composite Integration (Newton Cotes & Gaussian Quadrature),
Romberg Integration, brief idea of Adaptive quadrature method, Asymptotic error formula.

Module -II:
Multiple Integrals,
Initial value problems for ODE: Taylor’s series method Runge-Kutta method, predictor-
corrector method, Convergence & stability
Numerical solution to ODE; Taylor’s series methods, Adaptive Runge - Kutta method, predictor-
corrector method, convergence and stability, multistep methods.
Boundary value problem for ODE: Shooting method for linear & non-linear problems, finite
difference methods for linear & non-linear problems.

Module –III:
Approximating Eigenvalue: power method, shifted power method, inverse power, Householder’s
method, QR-method, error and stability.
Numerical solution to partial differential equations: Solution of parabolic, elliptic, Hyperbolic
differential equations using finite difference method and stability considerations.

Text Book:
1. Numerical Analysis: Richard L. Burden & J.D. Faires. Cengage Learning 9th Edition
(chapter – 2(2.6), chapter-3(3.1,3.2,3.4-3.6), chapter4(4.1-4.8), chapter-5(5.1-5.8,5.10),
Chapter9(9.1-9.5), chapter-11(11.1-11.4), chapter12(12.1-12.3))

90
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

Reference Books:
1. Advanced numerical methods, L.V. Fusset
2. Numerical methods for Scientific and Engineering Computation, M.K. Jain, S.R.K.
Iyengar.
3. Numerical methods for Engineers by Chapra & Canale, TMH
4. An introduction to Numerical Analysis: by Kendall E. Atkinson, Wiley

Course outcomes:

91
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

Core 28: Abstract Algebra (IPCMH804)

Course Objectives:
1. Demonstrate knowledge and understanding of direct product of groups, finite abelian
groups.
2. To understand the concept of sylow p-subgroups
3. To understand the concepts of algebraic extension of fields, algebraically closed fields,
normal extension, separable extension
4. Demonstrate knowledge and understanding of finite fields
5. To understand the concept of Galois theory, cyclic extensions, symmetric functions
6. To use the method of ruler and compass constructions

Prerequisites: Basics of Group, Ring, Field

Syllabus:
Module-I:
Structure theorems for groups: Direct Product, finitely generated abelian group. Structure
theorem for groups: Invariants of a finite abelian group, Sylows theorem. Algebraic extension of
fields: Irreducible polynomials and Einstein criterion, Adjunction of roots.

Module-II:
Algebraic extension, Algebraically closed fields, Normal separable extensions: splitting fields,
normal extensions. Normal separable extension: Multiple roots, Finite fields, Separable
extensions.

Module-III:
Galois Theory: Automorphism groups and fixed fields, Fundamental theorem of Galois theory.
Application of Galois theory to classical problems: Roots of unity and Cyclotomic polynomials,
Cyclic extensions, Polynomials solvable by radicals, Symmetric functions, Ruler and compass
constructions.

Text Book
1. P.B. Bhattacharya, S.K. Jain and S.R. Nagpaul: Basic Abstact Algebra, Cambridge
University Press. Chapter: 8 (Art 1-4), 15(Art 1-4), 16(Art 1-5), 17 (Art 1,2), 18(1-5).

Reference Books:
1. Vivek Sahai and Vikas Bist: Algebra (Narosa publication House).
2. I.S. Luthar and I.B.S. Passi: Algebra Vol. 1 Groups (Narosa publication House).
3. I.N. Herstein: Topics in Algebra (Wiley Eastern Ltd.).
4. Surjit Singh and Quazi Zameeruddin: Modern Algebra (Vikas Publishing House).
5. S.K. Jain & S.R. Nagpal: Basic Abstract Algebra (Cambridge University Press, 1995).
6. Dummit: Abstract Algebra, Wiley
7. Modern Algebra by A. R. Vasishtha, Krishna Prakashan Mandir, Meerut.

Course Outcomes: After the successful completion of this course the students will be able to
1. apply algebraic ways of thinking.

92
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

2. demonstrate knowledge and understanding of fundamental concepts including groups,

subgroups, normal subgroups, homomorphisms and isomorphism.
3. demonstrate knowledge and understanding of rings, fields and their properties.
4. understand and prove fundamental results and solve algebraic problems using appropriate
techniques.

93
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

OE 2: Computer Graphics (IOECS801)

Course Objectives:
1. To provide students with a foundation in graphics applications programming.
2. To introduce students with fundamental concepts and theory of computer graphics.
3. To give basics of application programming interface (API) implementation based on
graphics pipeline approach.

Module – I
Overview of Graphics System: Video Display Units, Raster-Scan and Random Scan Systems,
Graphics Input and Output Devices.
Output Primitives: Line drawing Algorithms: DDA and Bresenham’s Line Algorithm, Circle
drawing Algorithms: Midpoint Circle Algorithm and Bresenham’s Circle drawing Algorithm.
Two Dimensional Geometric Transformation: Basic Transformation (Translation, Rotation,
Scaling) Matrix Representation, Composite Transformations, Reflection, Shear, Transformation
between coordinate systems.

Module – II
Two Dimensional Viewing: Window-to- View Port Coordinate Transformation. Line Clipping
(Cohen-Sutherland Algorithm) and Polygon Clipping (Sutherland-Hodgeman Algorithm)
Aliasing and Antialiasing, Half Toning, Thresholding, Dithering.
Polygon Filling: Seed Fill Algorithm, Scan line Algorithm.
Two Dimensional Object Representations: Spline Representation, Bezier Curves, B-Spline
Curves.
Fractal Geometry: Fractal Classification and Fractal Dimension.

Module – III
Three Dimensional Geometric and Modeling Transformations: Translation, Rotation, Scaling,
Reflections, shear, Composite Transformation.
Projections: Parallel Projection, Perspective Projection.
Visible Surface Detection Methods: Back-Face Detection, Depth Buffer, A- Buffer, Scan- Line
Algorithm, Painters Algorithm.

Module – IV
Illumination Models: Basic Models, Displaying Light Intensities.
Surface Rendering Methods: Polygon Rendering Methods: Gouraud Shading, Phong Shading.
Computer Animation: Types of Animation, Key frame Vs. Procedural Animation, Methods of
Controlling Animation, Morphing.

Text Book:
1. Computer Graphics, D. Hearn and M.P. Baker (C Version), Pearson Education.

Reference Books:
1. Computer Graphics Principle and Practice, J.D. Foley, A. Dam, S.K. Feiner, Addison
Wesley.
2. Procedural Elements of Computer Graphics, David Rogers, TMH.

94
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

3. Computer Graphics: Algorithms and Implementations, D.P Mukherjee, D. Jana, PHI.

4. Computer Graphics, Z. Xiang, R. A. Plastock, Schaum’s Outlines, McGrow Hill.
5. Computer Graphics, S. Bhattacharya, Oxford University Press.

95
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

OE 3: Data Mining (IOECS802)

Course Objectives:
1. To introduce the basic concepts of Data Warehouse and Data Mining techniques.
2. Examine the types of the data to be mined and apply pre-processing methods on raw data.
3. Discover interesting patterns, analyze supervised and unsupervised models and estimate
the accuracy of the algorithms.

Prerequisites: Statistics, MATLAB.

Module-I
Introduction to Data mining: - Role Data in Data Mining, Data Mining functionalities, patterns
in data mining, Type of patterns, Classification of Data Mining Systems, Major issues in Data
Mining. Data Preprocessing:- Why Preprocess the Data?, Descriptive Data Summarization, Data
Cleaning, Data Integration and Transformation, Data Reduction, Data Warehousing and OLAP
Technology for Data Mining: -What Is a Data Warehouse? A Multidimensional Data Model,
Data Warehouse Architecture, Data Warehouse Implementation, From Data Warehousing to
Data Mining, OLAP tools.

Module-II
Mining Association Rules in Large Databases: Association Rule Mining, Mining Single-
Dimensional Boolean Association Rules from Transactional Databases, Mining Multilevel
Association Rules from Transaction Databases, Mining Multidimensional Association Rules
from Relational Databases and Data Warehouses, From Association Mining to Correlation
Analysis, Constraint- Based Association Mining. Classification and Prediction: Issues Regarding
Classification and Prediction, Classification by Decision Tree Induction, Bayesian Classification,
Classification by Backpropagation, Classification Based on Concepts from Association Rule
Mining, Other Classification Methods, Prediction, and Classifier Accuracy.

Module-III
Cluster Analysis Introduction: Types of Data in Cluster Analysis, A Categorization of Major
Clustering Methods, Partitioning Methods, Hierarchical methods, Density-Based Methods, Grid-
Based Methods, Model-Based Clustering Methods, Outlier Analysis.
Mining Complex Data: Graph Mining, Social Network Analysis, Multirelational Data Mining,
Spatial data mining, Multimedia data mining, Text data mining, Mining the World Wide Web
OLAP tools, Tools for Data warehousing, WEKA tool.

TEXT BOOK
1. Data Mining – Concepts and Techniques – Jiawei Han, Michelinen Kamber, Morgan
Kaufmann Publishers, Elsevier, 2 Edition, 2006.
2. Pieter Adriaans, Dolf Zantinge, “Data Mining”, Addison Wesley, 1996.

Reference books:
1. Data Mining: Arun Pujari, University Press
2. Data Mining –a Tutorial based primer by R.J.Roiger, M.W.Geatz, Pearson Education.
3. Data Mining & Data Warehousing Using OLAP: Berson, TMH.

96
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

4. Data Warehousing: ReemaThareja, Oxford University Press

97
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

Lab 15 (OE Lab 1): Data Mining Lab Using MATLAB (ILCCS801)

List of Experiments:
1. Introduction to statistical problem by MATLAB.
2. Finding Correlation, Regression by the use of MATLAB.
3. T- test, Chi square test by using MATLAB.
4. Testing of hypothesis, confidence interval by using MATLAB.
5. Statistical validation of various types of data by using MATLAB.
6. Design and modeling of Binomial and Poisson distribution by MATLAB.
7. Generation of random numbers, by any simulator.
8. Simple integration by random numbers, MATLAB implementation.
9. Finding 1st,2nd moments by using MATLAB.
10. General statistical application in validation of medical related data.

98
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

Semester-9

Core 29: Functional Analysis (IPCMH901)

Course Objectives:
1. Explain the fundamental concepts of functional analysis and their role in modern
mathematics and applied contexts.
2. Demonstrate accurate and efficient use of functional analysis techniques.
3. Demonstrate capacity for mathematical reasoning through analyzing proving and
explaining concepts from functional analysis.
4. Apply problem-solving using functional analysis technique applied to diverse situations in
physics, engineering and other mathematical context.

Prerequisites: Real Analysis, Linear Algebra.

Module-I
Normed spaces, continuity of linear maps, Hahn-Banach theorems, Banach spaces.
Uniform bounded principle, Application-Divergence of Fourier Series of Continuous Functions,
closed graph theorem, open mapping theorem, bounded inverse theorem, Spectrum bounded
Operator.

Module-II
Duals and transposes, duals of L^p [a,b] and C[a,b].
Inner product spaces, orthonormal sets, approximation and optimization, projections, Riesz
representation theorem.

Module-III
Bounded operators and adjoints on a Hilbert space, normal, unitary and self-adjoint operators.

Text book:
1. B. V. Limaye: Functional Analysis (2nd Edition)- New Age International Limited.
Chapter-2 (5-8), chapter-3 (9-12), chapter-4 (13,14), chapter-6 (21-24), chapter-7 (25,26)
2. G. Bachman, L. Narici, Functional Analysis, Academic Press

Reference book:
1. Erwin Kreyszig, Introductory Functional Analysis with Applications, John Wiley and
Sons (Asia), pvt.ltd., 2006.
2. John B. Conway, A course in Functional Analysis, 2nd edition, Springer verlag, 2006

Course Outcomes: After the successful completion of this course the students will be able to
1. define and thoroughly explain Banach and Hilbert spaces and self-adjoint operators,
2. apply Hilbert space-theory,
3. to work with families of applications appearing in the course,
4. produce examples and counterexamples illustrating the mathematical concepts presented
in the course.

99
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

Core 30: Computational Statistics (IPCMH902)

Course Objectives:
1. To introduce students to state-of-the-art methods and modern programming tools for data
analysis.
2. To learn the principles and methods of statistical analysis and also put them into practice
using a range of real-world data sets.
3. To provide a basic understanding of data analysis using statistics and to use
computational tools on problems of applied nature.
4. To investigate and evaluate relative efficiency of different methods

Prerequisites: Probability, Statistics.

Syllabus:
Module-I:
Random variables, Expected Values, The Law of Large Numbers, Central Limit Theorem, x^2, t
and F distributions, The Sample Mean and the Sample Variance, Testing of hypothesis and
assessing goodness of fit, Acceptance sampling, Estimation of Parameters, Confidence Intervals.

Module-II:
Linear methods for Regression and Classification: Overview of supervised Learning, Linear
regression models and least squares, Multiple Regression, Subset selection, Ridge regression,
least angle regression and Lasso, Linear discriminant analysis, Logistic regression.
Additive Models, Trees and Boosting: Generalized additive models, Regression and
Classification trees, Boosting Methods- exponential loss and AdaBoost, Random forests and
analysis.

Module-III:
Support Vector Machines (SVM), and K-nearest Neighbour: Basis expansion and regularization,
Kernel smoothing methods, SVM for classification, Reproducing Kernels, SVM for regression,
K-nearest Neighbour classifiers.
Unsupervised Learning: Cluster analysis, Principal Components, Gaussian mixtures and
selection.

Text Books
1. Trevor Hastie, Robert Tibshirani , Jerome Friedman, The Elements of Statistical
Learning-Data Mining Inference and Prediction, Second Edition, Springer Verlag, 2009.
2. John A. Rice, “Mathematical Statistics and Data Analysis” third edition, Cengage
Learning.

References
1. 1.C.M. Bishop- Pattern Recognition and Machine Learning, Springer,2006.
2. L. Wasserman- All of statistics

Course Outcomes: - After the successful completion of this course the students will be able to

100
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

1. understand concepts of Large Numbers and different distributions in statistics and their
limitations;
2. understand modern notions in data analysis-oriented computing;
3. be capable of confidently applying common Supervised & Unsupervised Learning
algorithms in practice and implementing their own;
4. be capable of performing distributed computations;

101
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

Core 31: Optimization Theory (IPCMH903)

Course Objectives
1. The problem is considered to be single- objective if just one objective function is
optimized.
2. In contrast, multi-objective optimization problems require the simultaneous optimization
of several objective functions.
3. There are many methods traditionally available to solve optimization problems.

Prerequisites: Operation research.

Syllabus:
Module-I
Calculus on R and Rn, Convex Analysis, One Dimensional Optimization: Function
Comparison Methods, Polynomial Interpolation Methods, Iterative Methods, Two Point Equal
Interval Search, Method of Bisection, Fibonacci Method, Golden Section Search Method,
Quadratic Interpolation, Cubic Interpolation, Iterative Methods: Newton’s Method, Secant
Method.

Module-II
Unconstraint Optimization: Optimization without constraints, Conjugate Gradient method,
Fibonacci Search Method, Golden Section Search Method, Steepest Descent Method, Newton’s,
Quasi-Newton’s Method. Linear programming: Introduction to LPP, Simplex method, Big M
method, Two Phase method, Revised simplex method, Duality theory and Dual simplex method.

Module-III
Constraint Optimization: Lagrange Multiplier, Kuhn-Tucker conditions, Convex Optimization,
Penalty Function Techniques, Method of Multipliers, Linearly Constrained Problems and Cutting
Plane Method.

Text Books
1. Mohan C Joshi, Kannan M Moudgalya, “Optimization Theory and Practice”, Narosa
Publishing House Pvt. Ltd.
2. Ashok D Belegundu, A R Chandrupatla, Second Edition Cambridge University Press.

Reference Books
1. Kalyamoy Ded, “Optimization for Engineering Design”, PHI Learning Pvt Ltd
2. Stephen G. Nash, A. Sofer,” Linear and Non-Linear Programming”, McGraw Hill
3. H.A. Taha, A.M. Natarajan, P. Balasubramanie, A. Tamilarasi, ‘Operations Research” 8th
Edition Pearson Education.
Course Outcomes: After successful completion of the course, students will be able to
1. understand importance of optimization of industrial process management,
2. apply basic concepts of mathematics to formulate an optimization problem,
3. analyse and appreciate variety of performance measures for various optimization
problems,
4. apply optimization algorithms to model problems in engineering and natural sciences.

102
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

Core 32: Matrix Computation (IPCMH904)

Course Objectives:
1. To work with matrices and determine if a given square matrix is invertible.
2. Learn to solve systems of linear equations and application problems requiring them.
3. Learn to compute determinants and know their properties.
4. Learn about and work with vector spaces and subspaces.
5. Learn about and work with linear transformations.
6. Learn to find and use eigenvalues and eigenvectors of a matrix.
7. Learn about inner products and their uses.

Prerequisites: Determinant, Matrices, MATLAB.

Syllabus:
Module-I
Gaussian Elimination and Its Variants: Matrix Multiplication Systems of Linear Equations,
Triangular Systems, Positive Definite Systems; Cholesky Decomposition, Banded Positive
Definite Systems, Sparse Positive Definite Systems, Gaussian Elimination and the LU
Decomposition, Gaussian Elimination with Pivoting, Sparse Gaussian Elimination, Sensitivity of
Linear Systems: Vector and Matrix Norms, Condition Numbers.

Module-II
The Least Squares Problem, The Discrete Least Squares Problem, Orthogonal Matrices,
Rotators, and Reflectors, Solution of the Least Squares Problem, The Gram-Schmidt Process,
Geometric Approach, Updating the QR Decomposition, The Singular Value Decomposition,
Introduction, Some Basic Applications of Singular Values.

Module-III
Eigen values and Eigen vectors, Systems of Differential Equations, Basic Facts, The Power
Method and Some Simple Extensions, Similarity Transforms, Reduction to Hessenberg and
Tridiagonal Forms, The QR Algorithm, Implementation of the QR algorithm, Use of the QR
Algorithm to Calculate Eigenvectors, The SVD Revisited, Eigen values and Eigen vectors, Eigen
spaces and Invariant Subspaces, Subspace Iteration, Simultaneous Iteration, and the QR
Algorithm, Eigen values of Large, Sparse Matrices, Eigen values of Large, Sparse Matrices,
Sensitivity of Eigen values and Eigenvectors, Methods for the Symmetric Eigenvalue Problem,
The Generalized Eigenvalue Problem.

Text Book:
1. Fundamentals of Matrix Computation by David S Watkins
Ch1.Ch 2.1,2.2, Ch 3, Ch 4.1,4.2, Ch 5, Ch 6.

Reference Book:
1. Matrix Computations by Gene H. Golub, Charles F.Van Loan The Johns Hopkins
University Press, Baltimore.

Course Outcomes: After the successful completion of this course the students will be able to

103
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

1. use sophisticated scientific computing and visualization environments to solve

application problems involving matrix computation algorithms,
2. interpret the results produced by computer implementations of numerical algorithms,
3. explain the effects of errors in computation and how such errors affect solutions,
4. demonstrate the necessary analytical background for further studies leading to research in
applied mathematics or related disciplines,

104
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

PE 3: Multi Variate Analysis (IPEMH901)

Course Objectives:
1. Introduction to multivariate data analysis
2. Building theoretical foundations of properties of random vectors and their distributions
3. In-depth treatment of several important multivariate distributions
4. Identification and development of appropriate statistical tools to analyze real-world
problems involving multivariate datasets

Module-I
Multivariate Distributions: Distributions and Density Function, multivariate normal distribution
and its properties, Heavy- Tailed distributions, distributions of linear and quadratic forms, tests
for partial and multiple correlation coefficients and regression coefficients and their associated
confidence regions.

Module-II
Theory of the Multinormal: Wishart distribution (definition, properties), construction of tests,
union-intersection and likelihood ratio principles, inference on mean vector, Hotelling's
T2distribution, Spherical and Elliptical distribution. MANOVA. Inference on covariance
matrices.

Module-III
Discriminant analysis. principal component analysis, Standardized Linear Combination,
Interpretation of the PCs, Asymptotic Properties of the PCs. factor analysis, the orthogonal
factor model, Estimation of the factor model, Factor Scores and Strategies. Cluster Analysis,
cluster algorithm, Boston housing.

Text Book
1. W. Hardle, L. Simar, “Applied Multivariate Statistical Analysis” Second Edition,
Springer.

References Texts:
1. T. W. Anderson, An Introduction to Multivariate Statistical Analysis.
2. R. A. Johnson and D. W. Wichern, Applied Multivariate Statistical Analysis.
3. K. V. Mardia, J. T. Kent and J. M. Bibby, Multivariate Analysis.
4. M. S. Srivastava and C. G. Khatri, An Introduction to Multivariate Statistics.
5. C. R. Rao: Linear statistical inference and its applications.

Course Outcomes: After the successful completion of this course the students will be able to
1. appreciate the range of multivariate techniques available
2. summarize and interpret multivariate data,
3. understand the link between multivariate techniques and corresponding univariate
techniques,
4. use multivariate techniques appropriately, undertake multivariate hypothesis tests, and
draw appropriate conclusions.

105
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

PE 3: Numerical Optimization (IPEMH902)

Course Objectives:
1. To find acceptable approximate solutions when exact solutions are either impossible or so
arduous and time-consuming as to be impractical;
2. To devise alternate methods of solution better suited to the capabilities of computers;
3. To formulate problems in their fields of research as optimization problems by defining
the underlying independent variables, the proper cost function, and the governing
constraint functions;
4. To understand how to assess and check the feasibility and optimality of a particular
solution to a general constrained optimization problem.

Prerequisites: Optimization Theory.

Syllabus:
Module-I
Trust-Region Methods: The Cauchy Point and Related Algorithms, The Cauchy Point,
Improving on the Cauchy Point, The Dogleg Method, Two-Dimensional Subspace Minimization,
Steinhaug’s Approach,
Newton Methods: Inexact Newton Steps, Line Search Newton Methods, Line Search Newton–
CG Method, Modified Newton’s Method, Hessian Modifications, Eigenvalue Modification,
Adding a Multiple of the Identity, Modified Cholesky Factorization. Gershgorin Modification,
Modified Symmetric Indefinite Factorization, Trust-Region Newton Methods, Newton–Dogleg
and Subspace-Minimization Methods, Accurate Solution of the Trust-Region Problem, Trust-
Region Newton–CG Method, Preconditioning the Newton–CG Method, Local Convergence of
Trust-Region Newton Methods

Module-II
Quasi-Newton Methods: The BFGS Method, Properties of the BFGS Method, Implementation,
The SR1 Method, Properties of SR1 Updating, The Broyden Class, Properties of the Broyden
Class, Convergence Analysis, Global Convergence of the BFGS Method, Super linear
Convergence of BFGS, Convergence Analysis of the SR1Method, Large-Scale Quasi-Newton
and Partially Separable Optimization: Limited-Memory BFGS Relationship with Conjugate
Gradient Methods, General Limited-Memory Updating, Compact Representation of BFGS
Updating, SR1 Matrices, Unrolling the Update, Sparse Quasi-Newton Updates, Partially
Separable Functions, Internal Variables, Invariant Subspaces and Partial Separability, Sparsity
vs. Partial Separability, Group Partial Separability, Algorithms for Partially Separable Functions,
Exploiting Partial Separability in Newton’s Method, Quasi-Newton Methods for Partially
Separable Functions.

Module –III
Fundamentals of Algorithms for Nonlinear Constrained Optimization
Initial Study of a Problem, Categorizing Optimization Algorithms, Elimination of Variables,
Simple Elimination for Linear Constraints, General Reduction Strategies for Linear Constraints,
The Effect of Inequality Constraints, Measuring Progress: Merit Functions

106
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

Quadratic Programming: Portfolio Optimization, Equality–Constrained Quadratic Programs,

Properties of Equality-Constrained QPs, Solving the KKT System, Direct Solution of the KKT
System, Range-Space Method, Null-Space Method, Method Based on Conjugacy, Inequality-
Constrained Problems, Optimality Conditions for Inequality-Constrained Problems, Degeneracy,
Active-Set Methods for Convex QP, Specification of the Active-Set Method for Convex QP,
Finite Termination of the Convex QP Algorithm, Updating Factorizations, Active-Set Methods
for Indefinite QP, Choice of Starting Point .

Text books:
1. Numerical Optimization, Jorge Nocedal & Stephen J. Wright, Springer.

Reference books:
1. Linear and Nonlinear Programming, David G. Luenberger & Yinyu Ye, Springer
2. Numerical Optimization: Theoretical and Practical Approach, J. Frederic Bonnans, J.
Charles Gilbert, Claude Lemarechal, Claudia A. Sagas

Course Outcomes: After successful completion of the course, students will be able to
1. use sophisticated scientific computing and visualization environments to solve
application problems involving matrix computation algorithms,
2. analyze numerical algorithms, and understand the relationships between the
computational effort and the accuracy of these algorithms,
3. interpret the results produced by computer implementations of numerical algorithms,
4. explain the effects of errors in computation and how such errors affect solutions,

107
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

PE 3: Numerical Solution of Differential Equation (IPEMH903)

Course Objectives:
1. Learn basic scientific computing for solving differential equations
2. Understand mathematics–numeric interaction, and how to match numerical method to
mathematical properties
3. Understand correspondence between principles in physics and mathematical equations

Prerequisites: Numerical Method, Differential Equation, MATLAB.

Syllabus:
Module – I:
Finite Difference Methods for Parabolic Equations: stability, consistence and convergence, 1-
D parabolic equations, 2-D and 3-D parabolic equations. Finite Difference Methods for
Hyperbolic Equations: some basic difference scheme, dissipation and dispersion errors,
extensions to conservation laws, the second-order hyperbolic PDEs. Finite Difference Methods
for Elliptic Equations: numerical solution of linear systems, error analysis with a maximum
principle.

Module – II:
Finite Element Methods: Basic Theory: introduction to one-dimensional problems, introduction
to two-dimensional problems, abstract finite element theory, examples of conforming finite
element spaces, examples of nonconforming finite elements, finite element interpolation theory,
finite element analysis of elliptic problems, finite element analysis of time-dependent problems.

Module – III:
Finite Element Methods: Programming: FEM mesh generation. Forming FEM equations,
calculation of element matrices, assembly and implementation of boundary conditions, the
MATLAB code for P_1 element, the MATLAB code for Q_1 element.

Text Book:
1. Computational Partial Differential Equations using MATLAB by J. Li and Y-T Chen
CRC Press Chapman & Hall. Chapters: 2, 3, 4, 6, 7

Course Outcomes: After successful completion of the course, students will be able to
1. apply numerical methods to obtain approximate solutions to mathematical problems,
2. derive numerical methods for various mathematical operations and tasks,
3. analyse and evaluate the accuracy of common numerical methods,
4. write efficient, well-documented MATLAB code and present numerical results in an
informative way.

108
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

PE 4: Image Processing (IPECS901)

Course Objectives: The Student Should Be Made To:

1. Learn Digital Image Fundamentals.
2. Be Exposed to Simple Image Processing Techniques.
3. Be Familiar with Image Compression and Segmentation Techniques.
4. Learn to Represent Image in Form of Features.

Expected outcome: The students will be able to:

1. Distinguish / Analyse the various concepts and mathematical transforms necessary for
image processing
2. Differentiate and interpret the various image enhancement techniques
3. Illustrate image segmentation algorithm
4. Analyse basic image compression techniques

Module I:
Introduction – Origin – Steps in Digital Image Processing – Components – Elements Of Visual
Perception – Image Sensing And Acquisition – Image Sampling And Quantization –
Relationships Between Pixels – Color Models.
Image Enhancement: Spatial Domain: Gray Level Transformations – Histogram Processing –
Basics of Spatial Filtering–Smoothing and Sharpening Spatial Filtering – Frequency Domain:
Introduction To Fourier Transform – Smoothing And Sharpening Frequency Domain Filters –
Ideal, Butterworth And Gaussian Filters.

Module II:
Image Restoration and Segmentation Noise Models – Mean Filters – Order Statistics –
Adaptive Filters – Band Reject Filters – Band Pass Filters – Notch Filters – Optimum Notch
Filtering – Inverse Filtering – Wiener Filtering Segmentation: Detection of Discontinuities–Edge
Linking And Boundary Detection – Region Based Segmentation- Morphological Processing-
Erosion And Dilation.

Module III:
Wavelets and Image Compression
Wavelets – Subband Coding – Multiresolution Expansions – Compression: Fundamentals –
Image Compression Models – Error Free Compression – Variable Length Coding – Bit-Plane
Coding – Lossless Predictive Coding – Lossy Compression – Lossy Predictive Coding –
Compression Standards.
Image Representation and Recognition: Boundary Representation – Chain Code – Polygonal
Approximation, Signature, Boundary Segments – Boundary Description – Shape Number –
Fourier Descriptor, Moments- Regional Descriptors –Topological Feature, Texture – Patterns
and Pattern Classes – Recognition Based On Matching.

Text Books:
1. R.C. Gonzalez, R.E. Woods, Digital Image Processing, 3rd Edition, Pearson Education
2. R C Gonzalez, Woods and Eddins, Digital Image Processing using Matlab, 2nd Edition,
Tata McGraw Hill

109
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

Reference Books:
1. S. Sridhar, Digital Image Processing, Oxford University Press, 2011
2. Rafael C. Gonzalez, Richard E. Woods, Steven L. Eddins, “Digital Image Processing
Using MATLAB”, Third Edition Tata Mc Graw Hill Pvt. Ltd., 2011.
3. Anil Jain K. “Fundamentals of Digital Image Processing”, PHI Learning Pvt. Ltd., 2011.
4. William K Pratt, “Digital Image Processing”, John Willey, 2002.
5. Malay K. Pakhira, “Digital Image Processing and Pattern Recognition”, First Edition,
PHI Learning Pvt. Ltd., 2011.

110
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

PE 4: Fractal and Chaos Theory (IPECS902)

Course Objectives:
The primary objective of this course is to introduce the basic principles, techniques, and
applications of Fractals & Chaos. More specifically:
1. To introduce fractal & chaos concepts and its basic principles in solving nature-based
image problems.

Course Prerequisites:
This course requires basic knowledge of Euclidean geometry, algebra and probability.

Module-I
Fractal Geometry: Introduction, Self similar fractals, exact similarity; random fractals, fractal
dimension: The Euclidean and Topological Dimensions, Natural fractals, statistical self similar,
The Cantor Set, The Koch Curve, The Sierpinski Gasket, Randomizing the Cantor Set and Koch
Curve.

Module-II
The Box Counting Dimension and the Hausdorff Dimension, The Structured Walk Technique
and the Divider Dimension, The Perimeter-Area Relationship, Regular and Fractional Brownian
Motion, The Colour and Power of Noise, Power Spectra

Module-III
Chaos Dynamics: Deterministic Chaos, Population Growth and the Verhulst Model, The Effect
of Variation in the Control Parameter, Bifurcation, Stability and the Feigenbaum Number, Julia
Sets and the Mandelbrot Set.
The Duffing Oscillator, The Lorenz Model, The Rössler Systems, The Lyapunov Dimension

Text books:
1. Paul S Addition, “Fractals and Chaos”, IOP Publication.
Chapters: 1, 2, 3, 4, 5, 6, 7.

Reference books:
1. Heinz-Otto Peitgen, Hartmut Jürgens, Dietmar Saupe, “Chaos and Fractals”, Second
Edition, Springer., USA

Course Outcomes:
On successful completion of the course, the students will be able to:
1. Understand basic principles and techniques of fractional and chaotic theory
2. Demonstrate their proficiency in representation and reasoning of natural objects
3. Demonstrate understanding of basic dimensional measurement of similar and natural
objects.

111
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

Seminar 2: Seminar II (ISEMH901)

[Will be decided by the Department]

112
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

Lab 16 (Core Lab 4): Optimization Lab (ILCMH901)

List of Experiments:
1. Introduction to linear programming problem, solving LPP by MATLAB (Introduction)
2. Solve various simplex problem using MATLAB Function
3. Solve Transportation and assignment problem using any suitable simulator
4. Compare. between Transportation, Assignment problem by Using MATLAB
5. Explore queuing theory for scheduling, resource allocation, and traffic flow applications
using MATLAB.
6. Elementary concept of Modelling and Simulation using MATLAB.
7. Solve Various Decision Problem Using MATLAB.
8. Introduction to Nonlinear Programming by any suitable simulator
9. Iterative method for optimization problem by any suitable simulator
10. Application of nonlinear programming using MATLAB.

113
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

Lab 17 (Core Lab 5): Matrix Computation & Computational Statistics Lab Using R
Programming (ILCMH902)

Implementation of following methods using MATLAB/PYTHON / R Programming

Simple and multiple linear regression, Logistic regression, Linear discriminant analysis, Ridge
Regression, Cross validation and boot strap, Fitting Classification and Regression trees, K-
nearest neighbours, Principal component analysis, K-means clustering.

Reference (For R Programming)

1. G. James, D. Witten, T. Hastie, R. Tibshirani-An introduction to statistical learning with
applications in R, Springer,2013.

114
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

Semester-10

Core 33: Number Theory and Cryptography (IPCMH001)

Course Objectives:
1. To learn about representation of finite fields.
2. To identify how number theory is related to and used in cryptography.
3. To classify the symmetric encryption techniques.
4. To illustrate various Public key cryptographic techniques

Prerequisites: Set of Integers, Permutation & Combination, Programming language.

Syllabus
Module-I
Euclidean GCD Algorithm, Extended GCD Algorithm, Congruences and Modular Arithmetic:
Modular Exponentiation, Fast Modular Exponentiation, Linear Congruences: Chinese Remainder
Theorem, Polynomial Congruences: Hensel Lifting, Quadratic Congruences: Quadratic Residues
and Non-Residues, Legendre Symbol, Jacobi Symbol, Multiplicative Orders: Primitive Roots,
Computing Orders, Prime Number Theorem and Riemann Hypothesis
Polynomial-Basis Representation, Fermat’s Little Theorem for Finite Fields, Multiplicative
Orders of Elements in Finite Fields, Normal Elements, Minimal Polynomials,
Application to cryptography: The Shift Cipher, The Substitution Cipher, The Affine Cipher, The
Vigenere Cipher, The Hill Cipher, The Permutation Cipher, Stream Ciphers.

Module-II
Primality Testing: Fermat Test, Solovay-Strassen Test, Miller-Rabin Test, AKS Test, Integer
Factorization: Trial Division, Pollard’s Rho Method, Floyd’s Variant, Block GCD Calculation,
Brent’s Variant, Pollard’s p-1 Method: Large Prime Variation, Quadratic Sieve Method: Sieving,
Incomplete Sieving, Large Prime Variation, Multiple- Polynomial Quadratic Sieve Method
The RSA Cryptosystem: Introduction to Public-key Cryptography, Implementing RSA
Cryptosystem, Other Attacks on RSA: Computing ϕ(n) , The Decryption Exponent, Wiener’s
Low Decryption Exponent Attack, Cryptographic Hash Functions: Hash Functions and Data
Integrity, Security of Hash Functions : The Random Oracle Model, Algorithms in the Random
Oracle Model, Comparison of Security Criteria, Discrete Logarithms: The ElGamal
Cryptosystem, Algorithms for the Discrete Logarithm Problem: Shank’s Algorithm , The Pollard
Rho Discrete Logarithm Algorithm, Security of ElGamal Systems.

Module-III
Elliptic Curves: Elliptic Curves over the Reals, Elliptic Curves Modulo a Prime, Properties of
Elliptic Curves, Point Compression and the ECIES, Computing Point Multiples on Elliptic
Curves. Signature Schemes: Introduction, Security Requirements for Signature Schemes,
Signatures and Hash Functions, The ElGamal Signature Schemes, Security of the ElGamal
Signature Scheme, Variants of the ElGamal Signature Schemes: The Schnorr Signature Scheme,
The Digital Signature Algorithm, The Elliptic Curve DSA, Elliptic Curve Primality Test.

115
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

Text Books:
1. Computational Number Theory-Abhijit Das, CRC Press (First Indian Reprint,2015)
Chapter 1(1.2-1.7, 1.9) ,Chapter 2 (2.2.1,2.4.1,2.4.2, 2.4.3, 2.4.4), Chapter 5 (5.2.1,5.2.2,
5.2.3, 5.3.2) , Chapter 6(6.1-6.6, 6.8).
2. Cryptography Theory and Practice- Douglas R. Stinson, Chapman & Hall/ CRC (Third
Edition) Chapter 1, Chapter 4 (4.1 ,4.2), Chapter 5(5.1,5.3,5.7), Chapter 6
(6.1,6.2,6.5,6.7), Chapter 7(7.1-7.4)

Reference Books:
1. Neal Koblitz: A Course in number theory and Cryptography, Springer Veriag, Chapter
6(section 3)

Course Outcomes: After successful completion of the course, students will be able to:
1. solve problems in elementary number theory,
2. develop a deeper conceptual understanding of the theoretical basis of number theory and
cryptography.
3. apply elementary number theory to cryptography,
4. work effectively as part of a group to solve challenging problems in Number Theory and
Cryptography.

116
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

Core 34: Theory of Computation (IPCMH002)

Course Objectives:
1. Demonstrate knowledge of basic mathematical models of computation and describe how
they relate to formal languages.
2. Understand that there are limitations on what computers can do, and learn examples of
unsolvable problems.
3. Learn that certain problems do not admit efficient algorithms, and identify such problems.

Prerequisites: Discrete Mathematics.

Module-I
Alphabet, languages and grammars. Production rules and derivation of languages. Chomsky
hierarchy of languages. Regular grammars, regular expressions and finite automata
(deterministic and nondeterministic). Closure and decision properties of regular sets. Pumping
lemma of regular sets. Minimization of finite automata. Left and right linear grammars.

Module – II
Context free grammars and pushdown automata. Chomsky and Griebach normal forms. Parse
trees, Cook, Younger, Kasami, and Early's parsing algorithms.
Ambiguity and properties of context free languages. Pumping lemma, Ogden's lemma, Parikh's
theorem. Deterministic pushdown automata, closure properties of deterministic context free
languages.

Module – III:
Turing machines and variation of Turing machine model, Turing computability, Type 0
languages. Linear bounded automata and context sensitive languages. Primitive recursive
functions. Cantor and Godel numbering. Ackermann's function, mu- recursive functions,
recursiveness of Ackermann and Turing computable functions. Church Turing hypothesis.
Recursive and recursively enumerable sets. Universal Turing machine and undecidable
problems. Undecidability of Post correspondence problem. Valid and invalid computations of
Turing machines and some undecidable properties of context free language problems. Time
complexity class P, class NP, NP completeness.

Text Books:
1. Introduction to Automata Theory, Languages and Computation: J.E. Hopcroft and J.D
Ullman, Pearson Education, 3rd Edition.
2. Introduction to the theory of computation: Michael Sipser, Cengage Learning
3. Theory of computation by Saradhi Varma, Scitech Publication

Reference Books:
1. Introduction to Languages and the Theory of Computation: Martin, Tata McGraw Hill,
3rdEdition
2. Introduction to Formal Languages, Automata Theory and Computation: K. Kirthivasan,
Rama R, Pearson Education.

117
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

3. Theory of computer Science (Automata Language & computations) K.L. Mishra N.

Chandrashekhar, PHI.
4. Elements of Theory of Computation: Lewis, PHI
5. Theory of Automata and Formal Languages: Anand Sharma, Laxmi Publication
6. Automata Theory: Nasir and Srimani, Cambridge University Press.
7. Introduction to Computer Theory: Daniel I.A. Cohen, Willey India, 2nd Edition.

118
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

PE 5: Finite Element Method (IPEMH001)

Course Objectives:
1. To learn basic principles of finite element analysis procedure.
2. To learn the theory and characteristics of finite elements.
3. Learn to model complex geometry problems and solution techniques.
4. To develop proficiency in the application of the finite element method (modelling,
analysis, and interpretation of results) to realistic engineering problems using a major
commercial general-purpose finite element code.

Prerequisites: Real Analysis, Differential Equation. Linear Algebra.

Syllabus:
Module – I:
Direct Approach for Discrete Systems: Describing the behaviour of a single bar element,
Equations for a system, Applications to other linear systems, two-dimensional truss systems,
transformation law, three-dimensional truss systems. Strong and Weak Form in One-dimensional
problems: The strong form in one-dimensional problems, the weak form in one-dimension,
continuity, the equivalence between the weak and strong forms, one-dimensional stress analysis
with arbitrary boundary conditions, one-dimensional heat conduction with arbitrary boundary
conditions, two-point boundary value problems with generalized boundary conditions,
advection-diffusion, minimum potential energy.

Module – II:
Approximation of Trial Solutions, Weight Functions and Gauss Quadrature for One-
dimensional problems: two-node linear element, quadratic one-dimensional element, direct
construction of shape functions in one dimension, approximation of the weight functions, global
approximation and continuity, Gauss quadrature. Finite Element Formulation for one-
dimensional problems: development of discrete equation (simple case), element matrices for
two-node element, application to heat conduction and diffusion problems, development of
discrete equations for arbitrary boundary conditions, two-point boundary value problem with
generalized boundary conditions, convergence of the FEM, FEM for advection-diffusion
equation. Strong and Weak Forms for Multidimensional Scalar Field Problems: divergence
theorem and Green’s formula, strong form, weak form, the equivalence between weak and strong
forms, generalization to three-dimensional problems, Strong and weak forms of scalar steady-
state advection-diffusion in two-dimensions.

Module – III:
Approximations of Trial solutions, Weight Functions and Gauss quadrature for
Multidimensional problems: completeness and continuity, three-node triangular element, four-
node rectangular elements, four-node quadrilateral element, higher order quadrilateral elements,
triangular coordinates, completeness of isoparametric elements, Gauss quadrature in two-
dimensions, three dimensional elements. Finite Element Formulation for Multidimensional
Scalar Field Problems: finite element formulation for two-dimensional heat conduction
problems, verification and validation, advection-diffusion equation.

119
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

Text Book:
1. A First Course in Finite Elements by J. Fish and T. Belytschko, John Wiley & Sons
Chapters 2, 3, 4, 5, 6, 7, 8

Course Outcomes: After successful completion of this course students will be able to
1. understand the concepts behind variational methods and weighted residual methods in
FEM,
2. develop element characteristic equation procedure and generation of global stiffness
equation will be applied,
3. apply suitable boundary conditions to a global structural equation, and reduce it to a
solvable form,
4. able to identify how the finite element method expands beyond the structural domain, for
problems involving dynamics, heat transfer, and fluid flow.

120
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

PE 5: Machine Learning (IPEMH002)

Course Objectives:
1. Understanding of the fundamental issues and challenges of machine learning: data, model
selection, model complexity, etc.
2. Understanding of the strengths and weaknesses of many popular machine learning
approaches.
3. Appreciate the underlying mathematical relationships within and across Machine Learning
algorithms and the paradigms of supervised and un-supervised learning.
4. Be able to design and implement various machine learning algorithms in a range of real-
world applications.

Prerequisites: Statistics, Linear Algebra, Probability

Syllabus:
Module–I
Introduction generative models for discrete data (Bayesian concept learning, Naïve Bayes
Classifier), Gaussian discriminant analysis, Inference in jointly Gaussian distributions, Bayesian
statistics, Bayesian Linear and logistic regression.

Module-II
General liner models and exponential family, Mixture models and EM algorithm, Space linear
models. Graphical models-Directed Graphical models (Bayesian networks), Markov and Hidden
Markov Models, Markov Random fields, Conditional Random fields. Neural network:
Perceptron, multilayer network, back propagation, Methods of acceleration of convergence of
BPA, Introduction to deep learning.

Module -III:
Dimensionality reduction, Feature selection, Spectral clustering.
Reinforcement learning and control: MDP, Bellman equations, value iterations and policy
iteration, Linear quadratic regulation, LQG, Q-learning Value function approximation, Policy
search, Reinforce POMDP’s.

Text Book:
1. Machine Learning. Tom Mitchell. First Edition, McGraw- Hill, 1997.
2. Introduction to Machine Learning Edition 2, by Ethem Alpaydin.

Course Outcomes: Upon successful completion, students will be able to:

1. understand the fundamental issues and challenges of machine learning: data, model
selection, model complexity, etc
2. understand the strengths and weaknesses of many popular machine learning approaches,
3. appreciate the underlying mathematical relationships within and across Machine Learning
algorithms and the paradigms of supervised and un-supervised learning,
4. design and implement various machine learning algorithms in a range of real-world
applications.

121
Int. M. Sc. In Mathematics & Computing Academic Regulation-2018

Major Project: Project (IPRMH001)

[As to be decided by the Department]

122