central university of rajasthan - curaj.ac.in · pdf filehindi, italian, russian, spanish) 2 1...

CENTRAL UNIVERSITY OF RAJASTHAN

M. Sc. Tech. Mathematics New scheme (started from Session 2016-17)

M.Sc. Tech. Mathematics is a three academic year spread in six semesters. The details of the

courses with code, title and the credits assign are as given below.

First Semester

S.

No

.

Subject

Code

Course Title C

r

e

d

it

Conta

ct

Hours

Exam.

Duration

(Hrs.)

Relative Weights %

L T P The

ory

Pra

ctic

al

C

WS

PR

S

M

TE

ET

E

PR

E

1. MTM

101

Abstract Algebra 4 3 1 0 3 0 20 0 30 50 0

2. MTM

102

Real Analysis 4 3 1 0 3 0 20 0 30 50 0

3. MTM

103

Probability and

Probability

Distribution

4 3 1 0 3 0 20 0 30 50 0

4. MTM

104

Qualitative Theory of

Ordinary Differential

Equations

4 3 1 0 3 0 20 0 30 50 0

5. MTM

105

Programming in C 4 3 1 0 3 0 20 0 30 50 0

6. MTM

106

Dynamics of

Communication

(Languages: English,

French, German,

Hindi, Italian,

Russian, Spanish)

2 1 1 0 3 0 20 0 30 50 0

7. MTM

107

Practical related to

MTM 105

2 0 0 4 0 4 50 0 0 0 50

TOTAL 2

4

1

6

6 4

Second Semester

S.

No

.

Subject

Code

Course Title Credit Contact

Hours

Exam.

Duration

(Hrs.)

Relative Weights %

L

T P The

ory

Pra

ctic

al

C

WS

PR

S

M

TE

ET

E

PR

E

1. MTM

201

Linear Algebra

4 3 1 0 3 0 20 30 50 50 0

2. MTM

202

Complex Analysis 4 3 1 0 3 0 20 30 50 50 0

3. MTM

203

Topology 4 3 1 0 3 0 20 30 50 50 0

4. MTM

204

Modeling and

Simulation

3 3 0 0 3 0 20 30 50 50 0

5. MTM

205

Data Structures in C

and Algorithms

4 3 1 0 3 0 20 30 50 50 0

6. MTM

206

Mathematical

Software Tools

3 2

1 0 3 4 20 30 50 50 0

7 MTM

207

Data Structures

Design Lab

2 0

0 4 3 4 50 0 0 0 50

TOTAL 24 1

7

5 04

Third Semester

S.

No

.

Subject

Code

Course Title Cr

edi

t

Contact

Hours

Exam.

Duration

(Hrs.)

Relative Weights %

L T P The

ory

Pra

ctic

al

C

WS

PR

S

M

TE

ET

E

PR

E

1. MTM

301

Functional Analysis 4 3 1 0 3 0 20 0 30 50 0

2. MTM

302

Partial Differential

Equations

4 3 1 0 3 0 20 0 30 50 0

3. MTM

303

Numerical Analysis 4 3 1 0 3 0 20 0 30 50 0

4 MTM

304

Differential

Geometry

4 3 1 0 3 0 20 0 30 50 0

5. MTM

305

Design & Analysis

of Algorithms

3 3 0 0 2 2 20 0 30 50 0

6. MTM

306

EM-1/EC-1 3 3 0 0 3 0 20 0 30 50 0

7. MTM

307

Lab related to MTM

305

2 0 0 4 0 4 50 0 0 0 50

TOTAL 24 18 4 4

Fourth Semester

S.

No

.

Subject

Code

Course Title Credit Contact

Hours

Exam.

Duration

(Hrs.)

Relative Weights %

L

T P The

ory

Pra

ctic

al

C

WS

PR

S

M

TE

ET

E

PR

E

1. MTM

401

Mathematical

Programming

4 3 1 0 3 0 20 0 30 50 0

2. MTM

402

Dynamics of Rigid

Body

4 3 1 0 3 0 20 0 30 50 0

3. MTM

403

EM-II 4 3 1 0 3 0 20 0 30 50 0

4. MTM

404

EM-III 4 3 1 0 3 0 20 0 30 50 0

5. MTM

405

Open Elective-I

3 3 0 0 3 0 20 0 30 50 0

6. MTM

406

Open Elective-II

3 3 0 0 3 4 20 0 30 50 0

7. MTM

407

Lab Work for MTM

405

2 0

0 4 3 4 50 0 0 0 50

24 1

8

4 4

Fifth Semester

Sixth Semester

S.

No

.

Subject

Code

Course Title Credi

t

Contact

Hours

EoS Exam.

Duration

(Hrs.)

Relative Weights

%

L

T P Theo

ry

Prac

tical

IA ST

s

EoSE

1. MTM

501

Elective M-IV 4 3 1 0 3 0 20 30 50

2. MTM

502

Open Elective – I 4 3 1 0 3 0 20 30 50

3. MTM

503

Elective C-III 4 3 1 0 3 0 20 30 50

4. MTM

504

Open Elective – II 4 3 1 0 3 0 20 30 50

MTM

505

Elective M-V 3 3 0 0 3 0 20 30 50

5. MTM

506

Elective M-VI 3 3 0 0 0 0 20 30 50

6 MTM

507

Computer Lab related

to MTM 503

2 0 0 4 50

24 1

8

4 4

S.

No

.

Subject

Code

Course Title Course

Category

Credit Contact

Hours

EoS Exam.

Duration

(Hrs.)

Relative Weights

%

L

T P Theo

ry

Pra

ctic

al

IA ST

s

EoSE

1. MTM

603

Project Work in

Industry Or Institution

PC 24 0 500 for project

report and

evalution+100

24

Details of revised courses

Note:

1. MTM:302(Mechanics) to be replaced by MTM:401(Dynamics of rigid body)

2. MTM:402 (Mathematical Programing-OLD) to be replaced by MTM:402

(Mathematical Programing-NEW)

3.

MTM 302: Mechanics (Detail Syllabus-OLD) LTP: 3+1+0

UNIT-I: Dynamics of a system of particles: Motion of system of particles, Principal of angular

momentum, motion of a rigid body, angular velocity, rigid body rotation about a fixed axis, rate of

change of a vector in a rotation frame. Moving frame of reference, frames of reference with

translational motion, motion of a particle relative to a rotating frame, uniformly rotating frames,

linear impulse and angular impulse. (15L)

UNIT-II: Kinematics and Dynamics of a rigid body: Moments and products of inertia, moment

of inertia of a body about a line through the origin, Momental ellipsoid, rotation of co-ordinate axes,

principal axes and principal moments. K.E. of rigid body rotating about a fixed points, angular

momentum of a rigid body, Eulerian angle, angular velocity, K.E. and angular momentum in terms

of Eulerian angle. Euler’s equations of motion for a rigid body, rotating about a fixed point, torque

free motion of a symmetrical rigid body (rotational motion of Earth). (15L)

UNIT-III: Lagrangian and Hamiltonian formulation of the dynamics: Classification of

dynamical systems, Generalized co-ordinates systems, geometrical equations, Lagrange’s equation

for a simple system using D’Alembert principle, Deduction of equation of energy, deduction of

Euler’s dynamical equations from Lagrange’s equations, Generalized momentum for a dynamical

system, Hamilton’s canonical equations of motion, Hamiltonian as a sum of K.E. and P.E., Phase

space and Hamiltonian’s variational principle, principle of least action, Canonical transformation,

Hamilton-Jacobi equation, Integral of Hamilton’s equations, Lagrange and passion brackets,

Poisson-Jacobi identity.(15L)

Recommended Readings:

Vectorial Mechanics by E. A. Milne; Methuen & Co. Ltd. London, 1965.

Dynamics (Part II) by A.S. Ramsey; CBS Publishers & Distributors, Delhi, 1985.

A treatise on Analytical Dynamics by L.A. Pars; Heinemann, London, 1968.

Classical mechanics by H. Goldstein; arosa Publishing House, New Delhi, 1990.

Generalized Motion of Rigid Body by N. Kumar; Narosa Publishing House, New Delhi, 2004.

Classical Mechanics by K. Sankara Rao; PHI learning Private Ltd., New Delhi, 2009

MTM 402: Dynamics of Rigid Body (Detail Syllabus- NEW) LTP: 3+1+0

UNIT-I: Moments and products of inertia, moment of inertia of a body about a line through the origin,

Momental ellipsoid, rotation of co-ordinate axes, principal axes and principal moments. K.E. of rigid body

rotating about a fixed points, angular momentum of a rigid body, Eulerian angle, angular velocity, K.E. and

angular momentum in terms of Eulerian angle. Euler’s equations of motion for a rigid body, rotating about a

fixed point, torque free motion of a symmetrical rigid body (rotational motion of Earth). (15L)

UNIT-II: Classification of dynamical systems, Generalized co-ordinates systems, geometrical equations,

Lagrange’s equation for a simple system using D’Alembert principle, Deduction of equation of energy,

deduction of Euler’s dynamical equations from Lagrange’s equations, Hamilton’s equations, Ignorable co-

ordinates, Routhian Function. (15L)

UNIT-III: Hamiltonian’s principle for a conservative system, principle of least action, Hamilton-Jacobi

equation, Phase space and Liouville’s Theorem, Canonical transformation and its properties, Lagrange and

passion brackets, Poisson-Jacobi identity. (15L)


1. Vectorial Mechanics by E. A. Milne; Methuen & Co. Ltd. London, 1965.

2. Dynamics (Part II) by A.S. Ramsey; CBS Publishers & Distributors, Delhi, 1985.

3. A treatise on Analytical Dynamics by L.A. Pars; Heinemann, London, 1968.

4. Classical mechanics by H. Goldstein; arosa Publishing House, New Delhi, 1990.

5. Generalized Motion of Rigid Body by N. Kumar; Narosa Publishing House, New Delhi, 2004.

6. Classical Mechanics by K. Sankara Rao; PHI learning Private Ltd., New Delhi, 2009

MTM 402: Mathematical Programming (Detail syllabus- OLD) LTP: 3+0+0

Unit I. Linear Programming, optimal solutions of linear programming problems. Duality in linear

programming. The dual simplex method. Integer programming; Importance of integer programming

problems. (15 Lectures)

Unit II. Dynamic programming, application of dynamic programming, Bellman’s principle of

optimality, solution of problems with a finite number of stages, Inventory control and solving linear

programming problems. Network Analysis: Shortest path problem. Minimum spanning tree

problem. Maximum flow problems. Network Simplex method. Project planning and control with

PERT-CPM.

(15 Lectures)

Unit III. Nonlinear programming problems: the general linear programming problems of

constrained maxima and minima. Quadratic programming: General quadratic programming problem,

Kuhn Tucker conditions of quadratic programming problems, examples based on Wolfe’s method

and Beale’s method. (15 Lectures)

Recommended Reading:

1. S. D. Sharma: Operations Research, Kedar Nath Ram Nath and Co.

2. Kanti Swarup, P. K. Gupta and Manmohan: Operations Research, S. Chand & Co.

3. Hamady Taha: Operations Research, Mac Millan Co.

4. S. D. Sharma: Nonlinear and Dynamic Programming, Kedar Nath Ram Nath & Co.

5. G. Hadley: Linear Programming, Oxford and IBH Publishing Co.

6. S. I. Gass: Linear Programming, Mc Graw Hill Book Co.

MTM 402 : Mathematical Programming (Detail Syllabus- NEW) LTP: 3+1+0

Unit I. Linear Programming, Theoretical foundation of Simplex Method, Revised Simplex Method,

Post Optimality Analysis, Computational Complexity of Simplex Algorithm, Karmarkar's

Algorithm for Linear programming, Linear Fractional programming problem.

(15 Lectures)

Unit II. Multi-Objective Optimization Theory, Goal Programming, Network Models- Minimum

Spanning Tree Problem, Maximum flow problem, Project planning and Control with PERT-CPM,

Deterministic Inventory Control.

(15 Lectures)

Unit III. Convex Programs and Duality, Quadratic programming and Complementarity Problem-

Wolfe's method, Beale's method, Fletcher's method. Nonlinear Programming Methods, Frank-Wolfe

Method, Gradient Projection Method, Penalty and Barrier Function Method.

(15 Lectures)


1. Operations Research: An Introduction, Hamady A. Taha, Prentice Hall of India, 8th ed.,

2006.

2. Numerical Optimization with Applications, S. Chandra, Jayadeva and A. Mehra, Narosa

Publishing House, 2009.

3. G. Hadley: Linear programming, Addison-Wesley Pub. Co., 1962.

4. Introduction to Operations Research, F.S. Hillier and G.J. Lieberman, 2001.

Detailed Syllabus for

M. Sc. Tech. Mathematics

Semester-I

MTM 101: Abstract Algebra LTP: 3+1+0

Unit I: Groups, subgroups, Cosets, Lagrange’s theorem, normal subgroups, quotient groups,

homomorphism, isomorphism theorems, Conjugacy, Class equation, simple groups. Sylow

theorems, Normal and subnormal series, composition series, Jordan holder theorem. Solvable

groups, simplicity of An ( n > 5). (15 Lectures)

Unit II: Rings, homomorphisms, ideals,Quotient rings, prime ideals, maximal ideals, field of

quotients of an integral domain,Euclidean rings, unique factorization domains, principal ideal

domain. Polynomial rings. Eisenstenin’s criterion of irreducibility.Chain conditions, on rings.

Noetherian and Artinian rings. Modules, Submodules. Quotient modules. (15 Lectures)

Unit III: Homomorphism and Isomorphism theorems. Extension fields, algebraic element and

transcendental elements, Simple extension, Algebraic extension, Roots of a polynomial and splitting

of a polynomial over fields. (15 Lecture)

Recommended Reading :

1. Topics in algebra by I. N. Herstein. Wiley Eastern Limited.

2. A first course in Abstract Algebra by John Fraleigh (3rd Edition), Narossa Publishing House.

3. Basic Abstract Algebra by Bhattacharya, Jain and Nagpal, 2nd Edition.

4. Algebra by S.Mclane and G.Birkhoff, 2nd Edition,

5. Basic Algebra by N.Jacbson, Hind.Pub.Corp.1984.

MTM 102: Real Analysis LTP: 3+1+0

Unit-I: Euclidian space ℝn: Open ball and open sets, closed sets, adherent points, accumulation

points, closure of sets, derived sets, Bolzano Weierstrass theorem. Cantor intersection theorem.

Lindeloff covering theorem, Heine Borel theorem, Compactness in ℝn. Metric spaces: open sets,

closed sets, compact subsets of a metric space. (15L)

Unit-II: Functions of bounded variations: Monotonic functions and its properties, types of

discontinuity functions of bounded variations and its properties, total variations. Functions of

several variables: continuity, partial derivatives, differentiability, derivatives of functions in an open

set of ℝn into ℝn as a linear transformations, chain rule, Taylor’s theorem, inverse function theorem,

implicit function theorem and explicit function theorem, Jacobians. (15L)

Unit-III: Riemann-Stieltjes integral: Definition and existence of R-S integration, conditions of R-

S integrability, properties of R-S integrals, integration and differentiation. Sequence and series of

functions: Pointwise and uniform convergence, Uniform convergence and continuity, Uniform

convergence and integration, Uniform convergence and differentiation, Uniform convergence and

R-S integration. (15L)


1. W. Rudin , Principles of Mathematical Analysis (3rd Ed.)McGraw Hill International Edition,

1976

2. Mathematical Analysis by T. M. Apostol( 2nd Ed.), Narosa Publishing House , 1985

3. Theory of Functions of a Real Variable, Volume 1 by I. P. Natanson, Frederick Pub. Co.,

1964

4. H.L. Royden, Real Analysis, McMillan Publication Co. Inc. New York

5. Malik, S.C. Mathematical Analysis, Wiley Eastern, New Delhi, 1984.

MTM 103: Probability and Probability Distributions LTP: 3+1+0

1. Exploratory data analysis: summary statistics, box and whisker plots, histogram, P-P and Q-Q

plots

2. Random Experiment and its sample space, probability as a set function on a collection of

events, stating basic axioms, random variables, c.d.f., p.d.f., p.m.f., absolutely continuous and

discrete distributions, Some common distributions (Negative Binomial, Pareto, lognormal,

beta, etc). Transformations, moments, m.g.f., p.g.f., quantiles and symmetry. Random vectors,

Joint distributions, copula, joint m.g.f. mixed moments, variance covariance matrix.

3. Independence, sums of independent random variables, conditional expectation and variances,

compound distributions, prior and posterior distribution, best predictors.

4. Sampling distributions of statistics from univariate normal random samples, chi-square, t and

F distributions

5. Order statistics and the distribution of rth order statistic, joint distribution of rth and sth order

statistics.

6. Statement and application of central limit theorem for a sequence of independent and

identically distributed random variables.

7. Simulation techniques such as Monte Carlo, Resampling techniques.


1. Ross, Sheldon M. (2003) Introductory Statistics

2. Hogg, R. V. and Craig, T. T. (1978) Introduction to Mathematical Statistics (Fourth Edition)

(Collier-McMillan)

3. Rohatgi, V. K. (1988) Introduction to Probability Theory and Mathematical Statistics (Wiley

Eastern)

4. C. R. Rao (1995) Linear Statistical Inference and Its Applications (Wiley Eastern) Second

Edition

5. H, Cramer (1946) Mathematical Methods of Statistics,( Prinecton).

6. J. D. Gibbons & S. Chakraborti (1992) Nonparametric statistical Inference (Third Edition)

Marcel Dekker, New York

MTM 104: Qualitative Theory of Ordinary Differential Equations LTP: 3+1+0

UNIT-I: Existence and uniqueness theorems-solution to non –homogeneous equations, Wronskian

and linear dependence, Reduction of the order of a homogeneous equation, Cauchy-Euler equation,

Pfaffian Differential equation, separation and comparison theorems, system of equations existence

theorems, Homogeneous linear systems, Non homogeneous Linear systems, Linear systems with

constant coefficients. (15 Lectures)

UNIT-II: Two-point boundary-value problem, Green's functions, Construction of Green's

functions, Non homogeneous boundary conditions, Orthogonal sets of function and Strum Liouville

problem, Eigen values and Eigen functions, Eigen function expansions convergence in the

Mean. (15 Lectures)

UNIT-III: Stability of autonomous system of differential equations, Stability for Linear systems with

constant coefficients, linear plane autonomous systems, perturbed systems, Method of Lyapunov for

nonlinear systems. Limit cycles of Poincare Bendixson Theorem. (15 Lectures)


1. Simmons: Ordinary Differential Equations.

2. Lakshmikantham, Deo and Raghavendra, Ordinary Differential Equations.

MTM 105: Programming in C LTP: 3+1+0

Unit I: Basic concepts of programming languages: Programming domains, language evaluation

criterion and language categories, Describing Syntax and Semantics, formal methods of describing

syntax, recursive descent parsing, attribute grammars, Dynamic semantics (operational semantics,

denotational semantics, axiomatic semantics) (10 Lectures)

Unit II: Names, Variables, Binding, Type checking, Scope and lifetime data types, array types,

record types, union types, set types and pointer types, arithmetic expressions, type conversions,

relational and Boolean expressions, assignment statements, mixed mode assignment. Statement

level control structures, compound statements, selection statement, iterative statements,

unconditional branching. (10 Lectures)

Unit III: Programming in C: Character set, variables and constants, keywords, Instructions,

assignment statements, arithmetic expression, comment statements, simple input and output,

Boolean expressions, Relational operators, logical operators, control structures, decision control

structure, loop control structure, case control structure, functions, subroutines, scope and lifetime of

identifiers, parameter passing mechanism, arrays and strings, Pointers, Pointers to Function,

Function returning Pointers. (25 Lectures)


Basic Reading:

1. Concepts of Programming Language by Robert W. Sebesta, Addison Wesley, pearson

Education Asia, 1999.

2. How to Program C by Deitel and Deitel, Addison Wesley, Pearson Education Asia.

Reference Books:

1. Introduction to Computer Science by Ramon A. Mata-Toledo and Pauline K. Cushman, Mc

Graw Hill International Edition.

2. Programming Languages by D. Appleby and JJ Vande Kopple, Tata McGraw Hill, India.

3. C Programming a Modern Approach by KN King, WW Norton & Co.

4. Programming in C by Yashwant Kanetkar, B.P.B Publications.

MTM 106: Dynamics of Communication (Languages) LTP: 1+1+0

MTM 107: Lab LTP: 0+0+2

Lab work based on paper MTM 105

Semester-II

MTM 201: Linear Algebra LTP: 3+1+0

Unit I: Review of Vector Spaces, The algebra of linear transformations, Isomorphism, Linear

functional, dual and double dual, Eigen values and eigen vectors, Annihilating polynomials,

diagonalization, Tringularization. (15 L)

Unit II: Determinants and its geometric properties, Laplace expansion, rational and Jacobian

canonical form, primary decomposition theorem, nilpotent matrices, canonical form for nilpotent

matrix, computation of invariant factors, non-negatives matrices, generalized inverse of a matrix,

diagonalization of symmetric bilinear forms. (15 L)

Unit III: The Adjoint of Linear Transformation, Unitary operators, Self Adjoints and Normal

Operators, spectral theorem of normal operators, Polar and Singular Value, Decomposition, spectral

theory of normal operators on finite dimensional vector space. ( 15 L)


1. Algebra by S. Mclane and G. Birkhoff

2. Linear algebra by S. Lang, Springer

3. Linear Algebra by Bisht and Sahai 4. Linear Algebra by Hoffman and Kunze, P.H.I 5. Matrix Analysis and Applied linear Algebra, by Carl D. Meyer 6. Linear Algebra by S. Lang. 7. Linear Algebra by P. Lax. 8. Linear Algebra: a geometric approach by S. Kumaresan.

MTM 202: Complex Analysis LTP: 3+1+0

Unit-I: Functions of a complex Variable, Differentiability and analyticity, Cauchy Riemann

Equations, Power series as an analytic function, properties of line integrals, Goursat Theorem,

Cauchy theorem, consequence of simply connectivity, index of a closed curve (15 Lectures)

Unit-II: Cauchy’s integral formula, Morera’s theorem, Liouville’s theorem, Fundamental theorem

of Algebra, Harmonic functions, Existence of Harmonic conjugate, Taylor’s theorem,

Zeros of Analytic functions, Laurent series, singularities, classification of singularities (15

Lectures)

Unit-III: Maximum modulus theorem, Minimum modulus theorem, Hadamard three circle

theorem, Schwarz’s Lemma, Rouche’s theorem, Calculation of residues, Residue theorem,

Evaluation of integrals of the form , , Conformal mappings.

(15 Lectures)


1. Complex Analysis ( Third edition) by L. V. Ahlfors, McGraw Hill Book Company, 1979

2. Complex Analysis by J. B. Conway, Narosa Publishing House,

3. Complex Analysis by Serg Lang, Addison Wesley

4. Foundations of Complex analysis ( Second Edition), S. Ponnusamy, Narosa Publishing

House.

5. Complex variables and Applications by Ruel V. Churchill,

MTM 203: Topology LTP: 3+1+0

Unit-I: Topological spaces. Open sets, closed sets. Interior points, Closure points. Limit points,

Boundary points, exterior points of a set, Closure of a set, Derived set, Dense subsets. Basis, sub

base, relative topology. (15 Lectures)

Unit-II: Continuous functions, open & closed functions, homeomorphism, Lindelof‘s, Separable

spaces, Connected Spaces, locally connectedness, Connectedness on the real line, Components,

Compact Spaces, one point compactification, compact sets, properties of Compactness and

Connectedness under a continuous functions, Compactness and finite intersection property,

Equivalence of Compactness. (15 Lectures)

Unit-III: Separation Axioms: T0 , T1, and T2 spaces, examples and basic properties, First and

Second Countable Spaces, Regular, normal, T3 & T4 spaces, Tychnoff spaces, Urysohn’s Lemma,

Tietze Extension Theorem, finite product topological spaces and some properties. (15 Lectures)


1. G.F.Simmons: Topology and Modern Analysis, McGraw Hill (1963)

2. W. J. Pervin, Foundations of General Topology

3. Willard, Topology, Academic press

4. Vicker , Topology via logic (School of Computing, Imperial College, London)

5. Topology, A First Course By: J. R. Munkers Prentice Hall of India Pvt. Ltd.

MTM 204 – Modeling and Simulation LTP: 3+0+0

Unit I: Introduction to modelling and simulation. Definition of System, classification of systems,

classification and limitations of mathematical models and its relation to simulation, Methodology of

model building Modelling through differential equation: linear growth and decay models, non linear

growth and decay models, Compartment models. (15 Lectures)

Unit II: Checking model validity, verification of models, Stability analysis, Basic model relevant

to population dynamics, Ecology, Environment Biology through ordinary differential equation,

Partial differential equation and Differential equations (15 Lectures)

Unit III: Basic concepts of simulation languages, overview of numerical methods used for

continuous simulation, Stochastic models, Monte Carlo methods. (15 Lectures)


1. D. N. P. Murthy, N. W. Page and E. Y. Rodin, Mathematical Modeling, Pergamon Press.

2. J. N. Kapoor, Mathematical Modeling, Wiley Estern Ltd.

3. P. Fishwick: Simulation Model Design and Execution, PHI, 1995, ISBN 0-13-098609-7

4. A. M. Law, W. D. Kelton: Simulation Modeling and Analysis, McGraw-Hill, 1991, ISBN

0-07-100803-9

5. J. A. Payne, Introduction to Simulation, Programming Techniques and Methods of

Analysis, Tata McGraw Hill Publishing Co. Ltd.

6. F. Charlton, Ordinary Differential and Differential equation, Van Nostarnd.

MTM 205: Data Structures in C and Algorithms LTP: 3+1+0

Unit I: Introduction to software design principle, modularity, abstract data types, data structures

and algorithm; Order Analysis: Objectives of time analysis of algorithms; Big-oh and Theta

notations. Elementary Data Structures: Arrays, Linked lists, Stacks (example: expression

evaluation), and Queues. Binary search trees. Red-Black trees. Hash tables. (15 Lectures)

Unit II: Sorting, Divide and Conquer Strategy: Merge-sort; D-and-C with Matrix Multiplication as

another example. Quick-sort with average case analysis. Heaps and heap-sort. Lower bound on

comparison-based sorting and Counting sort. Radix sort. (15 Lectures)

Unit III: B-trees. Dynamic Programming: methodology and examples (Fibonacci numbers, matrix

sequence multiplication, longest common subsequence, convex polygon triangulation). Greedy

Method: Methodology, examples (lecture scheduling, process scheduling).

(15 Lectures)


1. Data Structures Using C by Aaron M. Tenenbaum, PHI

2. The Algorithm Design Manual by Steven S. Skiena, Springer

3. Data Structures and Algorithm Analysis (2nd Edition) by Mark Allen Weiss, Addison

Wesley

4. Data Structures and Algorithms by Alfred V. Aho, Jeffrey D. Ullman, and John E. Hopcroft,

Addison-Wesley

5. Classical Data Structures by D. Samanta, PHI

6. An Introduction to Data Structures and Algorithms (Progress in Theoretical Computer

Science) by J.A. Storer and John C. Cherniavsky

7. Algorithms and Data Structures: The Basic Toolbox by Kurt Mehlhorn, Springer

8. Data Structures, Algorithms, and Software Principles in C by Thomas A. Standish,

Addison-Wesley

MTM 206 : Mathematical Tools and Software LTP: 3+0+0

Unit 1: MATLAB: Basic Introduction: Simple arithmetic calculations, Creating and working with

arrays, numbers and matrices, Creating and printing simple plots, Function files, Applications to

Ordinary differential equations: A first order ODE, A second order ODE, ode23, ode45, Basic 2-D

plots and 3-D plots. (15 Lectures)

Unit 2: Mathematica: Basic introduction: Arithmetic operations, functions, Graphics: 2-D plots, 3-

D plots, Plotting the graphs of different functions, Matrix operations, Finding roots of an equation,

Finding roots of a system of equations, Solving differential equations.

(15 Lectures)

Unit 3: LaTeX: Basic Introduction: Mathematical symbols and commands, Arrays, Formulas, and

Equations, Spacing, Borders and Colors, Using date and time option in LaTeX, To create

applications and Letters, PPT in LaTeX, Writing an article, Pictures and Graphics in LaTeX.

(15Lectures)

Reference books:

1. R. Pratap: Getting started with MATLAB, Oxford University Press, 2010.

2. S. Lynch, Dynamical Systems with Applications using MATLAB, Birkhäuser, 2014.

3. M. L. Abell, J.P. Braselton, Differential Equations with Mathematica, Elsevier Academic

Press, 2004.

4. I. P. Stavroulakis, S.A. Tersian, An Introduction with Mathematica and MAPLE, World

Scientific, 2004.

5. L.W. Lamport, LaTeX: A document Preparation Systems, Addison-Wesley Publishing

Company, 1994.

6. H. Kopka, P.W. Daly, Guide to LATEX, Fourth Edition, Addison Wesley, 2004

MTM 207: Data Structures Design Lab LTP: 0+0+2

Draft syllabus of third and fourth semester

III-SEMESTER

MTM 301: Functional Analysis LTP: 3+1+0

Unit-I. Inner product spaces, Normed linear spaces, Banach spaces, Quotient norm spaces,

continuous linear transformations, equivalent norms, the Hahn-Banach theorem and its

consequences. Conjugate space and separability, second conjugate space, Weak *topology on the

conjugate space (15 Lectures)

Unit-II. The natural embedding of the normed linear space in its second conjugate space, The open

mapping Theorem, The closed graph theorem, The conjugate of an operator, The uniform

boundedness principle, Definition and examples of a Hilbert space and simple properties,

orthogonal sets and complements (15 Lectures)

Unit -III. The projection theorem, separable Hilbert spaces. Bessel's inequality, the conjugate

space, Riesz's theorem, The adjoint of an operator, self adjoint operators, Normal and unitary

operators, Projections, Eigen values and eigenvectors of on operator on a Hilbert space, The

spectral theorem on a finite dimensional Hilbert space (15 Lectures)


1. G.F.Simmons: Topology and Modern Analysis, McGraw Hill (1963)

2. G.Bachman and Narici : Functional Analysis, Academic Press 1964

3. A.E.Taylor : Introduction to Functional analysis, John Wiley and sons (1958)

4. A.L.Brown and Page : Elements of Functional Analysis, Van-Nastrand Reinehold Com

5.B.V. Limaye: Functional Analysis, New age international.

6.Erwin Kreyszig, Introductory functional analysis with application, Willey.

MTM 302: Partial Differential Equation LTP: 3+1+0

UNIT-I: Formation of PDE, First order PDE in two independent variables, Derivation of PDE by

elimination method of arbitrary constants and arbitrary functions, Lagrange’s LPDE and Non Linear

PDE of first order. Charpit’s method, Monge’s method Jacobi’s method and Cauchy’s method.

(15 Lecture)

UNIT-II: PDE of second order with variable coefficients, Classification of second order PDEs, Cauchy

problem, Method of separation of variables, Canonical form, Elliptic, Qualitative behavior of solution to

Parabolic and Hyperbolic PDE, Eigen values and Eigen functions of BVP, Strum-Liouville boundary

value problem, Orthogonality of Eigen

function. (15 Lecture)

UNIT-III: Initial value problem and characteristics, Green,s function for IVP’s and BVP’s, Solution of

partial transform by Laplace, Solution of BVP in spherical and cylindrical coordinates, Variational

formulation of boundary value problem. (15 Lecture)


1. K, Sankara, Rao, Introduction to Partial Differential Equations, Phi Learning.

2. Ian N. Sneddon, Elements of Partial Differential Equations, Dover Publications.

3. Garrett Birkhoff and Gian-Carlo Rota, Ordinary Differential Equations.

MTM 303. Numerical Analysis LTP: 3+1+0

Unit I. Iterative solutions of nonlinear equation: bisection method. Fixed-point interation,

Newton's method, secant method, acceleration of convergence, Newton's method for two non linear

equations, polynomial equation methods. Linear systems of Equations: Gauss Elimination, Gauss-

Jordan method, LU decomposition, iterative methods, and Gauss- Seidel iteration. (15 Lecture)

Unit II., Polynomial interpolation: interpolation polynomial, divided difference, interpolation,

Aitken's formula, finite difference formulas, Hermite's interpolation, double interpolation.

Numerical Calculus: Numerical differentiation, Errors in numerical differentiation, Numerical

Integration, Trapezoidal rule, Simpson's 1/3 - rule, Simpson's 3/8 rule, error estimates for

Trapezoidal rule and Simpson's rule. (15 Lecture)

Unit III. Numerical Solution of Ordinary differential Equations: Solution by Taylor series,

Picard Method of successive approximations, Euler's Method, Modified Eular Method, Runge-

Kutta Methods, Predicator-Corrector Methods. Eigenvalue Problem: Power method, Jacobi

method, Householder method. (15 Lecture)

Recommended Reading: 1. K.E. Atkinson: An Introduction to Numerical Analysis.

2. J. I. Buchaman and P. R. Turner: Numerical Methods and Analysis..

3. S. S. Sastry, Introduction Methods of Numerical Analysis (4th Edition) Prentice-Hall.

MTM 304. Differential Geometry LTP: 3+1+0

Unit-I : Differential Calculus, Tangent space. Vector fields, Cotangent space and differentials on

Charts and atlases. Differential manifolds, Induced topology on manifolds, functions and maps,

some special functions of class Para compact manifolds and partition of unity. Pullback

functions, local coordinates systems and partial derivatives. (15 Lecturers)

Unit-II : Tangent vectors and Tangent space, differential of a map, the tangent bundle, pullback

vector fields, Lie bracket, the cotangent space, the cotangent bundle, the dual of the differential

map. One parameter group and vector fields. (15 Lectures)

Unit-III : Lie derivatives, tensors, tensor fields, connections, parallel translation, covariant

differentiation of tensor fields, torsion tensor, curvature tensor, Bianchi and Ricci identities ,

Geodesics, Riemannian manifolds. (15 Lecturers)

Recommended books:

1. K. S. Amur, D. J. Shetty, C. S. Bagewadi, An introduction to differential geometry, Narosa

Publishing house, 2010.

2. B. O’Neill, Elementary differential geometry, Academic Press , New York, 1966

3. J. A. Thorpe, Elementary topics in differential geometry, Undergraduate text in Mathematics,

Springer Verlag , 1979.

4. T. J. Willmore, An introduction to differential geometry, Oxford University Press, 1965.

5. U. C. De, A. A. Shaikh, Differential geometry of Manifolds, Narosa Pub. House, 2009

6. D. Somasundaram, Differential Geometry: a first course, Narosa Pub. House, 2010.

MTM 305: Design & Analysis of Algorithms LTP: 3+0+0

Unit I: Complexity: Algorithms Complexity, Concept, Notations, Classification, Recurrence

Relation and its solution, Complexity Analysis

DIVIDE AND CONQUER METHOD: Binary Search, Strassen's matrix multiplication algorithms.

GREEDY METHOD: Knapsack Problem, Job Sequencing, Optimal Merge Patterns and Minimal

Spanning Trees.

DYNAMIC PROGRAMMING: Matrix Chain Multiplication, 0/1 Knapsack Problem.

Unit II: BRANCH AND BOUND: Traveling Salesman Problem and Lower Bound Theory.

Backtracking Algorithms and queens problem.

PATTERN MATCHING ALGORITHMS: Naïve and Rabin Karp string matching algorithms, KMP

Matcher and Boyer Moore Algorithms.

ASSIGNMENT PROBLEMS: Formulation of Assignment and Quadratic Assignment Problem.

Unit III: PROBLEM CLASSES NP, NP-HARD AND NP-COMPLETE: Definitions of P, NP-

Hard and NP-Complete Problems. Decision Problems. Cook's Theorem. Proving NP-Complete

Problems - Satisfiability problem and Vertex Cover Problem. Approximation Algorithms for Vertex

Cover and Set Cover Problem. Introduction to RANDOMIZED ALGORITHMS.


1. Thomas H. Cormen, Charles E. Leiserson, Ronald L.Rivest: Introduction to algorithms

2. Ellis Horowitz, Sartaj Sahni, Sanguthevar Rajasekaran: Fundamentals of Computer

Algorithms

3. Aho A.V , J.D Ulman: Design and analysis of Algorithms, Addison Wesley

Brassard : Fundamental of Algorithmics, PHI.

MTM-306 : EM-I/EC-I LTP: 3+0+0

MTM-307 : Lab for MTM-305 LTP: 0+0+2

IV SEMESTER

MTM 402 : Mathematical Programming LTP: 3+1+0

Unit I. Linear Programming, Theoretical foundation of Simplex Method, Revised Simplex Method,

Post Optimality Analysis, Computational Complexity of Simplex Algorithm, Karmarkar's

Algorithm for Linear programming, Linear Fractional programming problem. (15 Lectures)

Unit II. Multi-Objective Optimization Theory, Goal Programming, Network Models- Minimum

Spanning Tree Problem, Maximum flow problem, Project planning and Control with PERT-CPM,

Deterministic Inventory Control. (15 Lectures)

Unit III. Convex Programs and Duality, Quadratic programming and Complementarity Problem-

Wolfe's method, Beale's method, Fletcher's method. Nonlinear Programming Methods, Frank-Wolfe

Method, Gradient Projection Method, Penalty and Barrier Function Method. (15 Lectures)


1. Operations Research: An Introduction, Hamady A. Taha, Prentice Hall of India, 8th ed.,

2006.





MTM 402: Dynamics of Rigid Body LTP: 3+1+0

UNIT-I: Moments and products of inertia, moment of inertia of a body about a line through the origin,

Momental ellipsoid, rotation of co-ordinate axes, principal axes and principal moments. K.E. of rigid body

rotating about a fixed points, angular momentum of a rigid body, Eulerian angle, angular velocity, K.E. and

angular momentum in terms of Eulerian angle. Euler’s equations of motion for a rigid body, rotating about a

fixed point, torque free motion of a symmetrical rigid body (rotational motion of Earth). (15L)

UNIT-II: Classification of dynamical systems, Generalized co-ordinates systems, geometrical equations,

Lagrange’s equation for a simple system using D’Alembert principle, Deduction of equation of energy,

deduction of Euler’s dynamical equations from Lagrange’s equations, Hamilton’s equations, Ignorable co-

ordinates, Routhian Function. (15L)

UNIT-III: Hamiltonian’s principle for a conservative system, principle of least action, Hamilton-Jacobi

equation, Phase space and Liouville’s Theorem, Canonical transformation and its properties, Lagrange and

passion brackets, Poisson-Jacobi identity. (15L)


1. Vectorial Mechanics by E. A. Milne; Methuen & Co. Ltd. London, 1965.

2. Dynamics (Part II) by A.S. Ramsey; CBS Publishers & Distributors, Delhi, 1985.

3. A treatise on Analytical Dynamics by L.A. Pars; Heinemann, London, 1968.

4. Classical mechanics by H. Goldstein; arosa Publishing House, New Delhi, 1990.

5. Generalized Motion of Rigid Body by N. Kumar; Narosa Publishing House, New Delhi, 2004.

6. Classical Mechanics by K. Sankara Rao; PHI learning Private Ltd., New Delhi, 2009

MTM 403: EM-II LTP: 3+1+0

MTM 404: EM-III LTP: 3+1+0

MTM 405: OE-I (C) LTP: 3+0+0

MTM 406: OE-II LTP: 3+0+0

MTM 407: Lab for MTM-405 LTP: 0+0+2

Semester-V

MTM 501: EM-IV LTP: 3+1+0

MTM 502: OE-I LTP: 3+1+0

MTM 503: EC-I LTP: 3+1+0

MTM 504: OE-II LTP: 3+1+0

MTM 505: EM-V LTP: 3+0+0

MTM 506: EM-VI LTP: 3+0+0

MTM 507: Lab for MTM-503 LTP: 0+0+2

Semester-VI

MTM 603: Project work in Industry or Institution LTP: 24+0+0

List of Elective/Open Elective Papers

Mathematics

Sr.

No.

Title of Course Credits

1 Advanced Numerical Method 4

2 Advanced Real Analysis 4

3 Celestial Mechanics 4

4 Computational ODE 4

5 Computational PDE 4

6 Complex Dynamics 4

7 Dynamical Systems 4

8 Fluid Dynamics 4

9 Integral Equations and calculus of variations 4

10 Linear and nonlinear programing 4

11 Measure Theory and Integration 4

12 Advance Complex Analysis 3

13 Automata Theory and Formal Languages 3

14 Bio-Mathematics 3

15 Financial Mathematics 3

16 Fractional Calculus and Geometric Function Theory 3

17 Fuzzy Logic and its Applications 3

18 Game Theory 3

19 Graph Theory 3

20 Number Theory-I 3

21 Number Theory-II 3

22 Nonlinear Dynamics and its application to Information Technology 3

23 Operation Research 3

24 Special Functions 3

25 Module Theory 3

Computer Sciences

1. Artificial cognitive systems

2. Cloud computing

3. Compiler design

4. Computational intelligence

5. Computational linguistic

6. Design of expert systems

7. Fractal theory

8 Human computer interaction

9 Image processing and pattern recognition

10 Intelligent hybrid systems

11 Intelligent Physical Agents

12 Knowledge Modelling and Management

13 Open Source Operating system

14 Parallel Programming

15 Robot Motion Planning

16 Social Network and Semantic Web

17 Software Agents and Swarm Intelligence

18 Web Technologies

Details Syllabus of Elective Papers (Mathematics)

1. Advanced Numerical Method LTP: 3+1+0

UNIT-I: Numerical solution of algebraic and transcendental equations: Introduction- iteration

method, Newton-Raphson method, Graeffe’s root square method, acceleration of convergence.

Numerical Solution of systems of nonlinear equations: iteration method, Newton-Raphson method.

Linear Systems of equations: Introduction- Gauss elimination method, LU decomposition, Solution

of tridiagonal system, Ill-conditioned linear systems and method for Ill-conditioned matrix. Eigen

Value problem: Power method, Jacobi Method, Householder method.

(15-Lectures)

UNIT-II: Polynomial Interpolation: introduction- finite difference formulas, divided difference

interpolation, Aitken’s formula, Hermite’s interpolation, double interpolation, Spline interpolation

(linear, quadratic and cubic spline), Error in cubic Spline. Numerical differentiation, Errors in

numerical differentiation, cubic spline method; Numerical Integration: introduction to trapezoidal,

Simpson’s rules and error estimates, use of cubic splines, numerical double integration.

(15-Lectures)

UNIT-III: Boundary value problem: Introduction, BVP governed by second order ordinary

differential equations, Finite difference method, shooting method, cubic splines method. IVP and

BVP in partial differential equations: classification of linear second order partial differential

equations, Finite difference methods for Laplace and Poisson equations - Jacobi method, Gauss-

Seidel method and ADI (alternating direction implicit) method , Finite difference method for heat

conduction equation - Bender- Schmidt recurrence relation, Crank-Nicolson formula, and Jacobi

Iteration formula, Finite difference method for wave equation.

(15-Lectures)


1. K. E. Atkinson: An Introduction to Numerical Analysis.

2. J. I. Buchaman and P. R. Turner: Numerical Methods and Analysis.

3. S. S. Sastry: Introductory Methods of Numerical Analysis.

4. S. R. K. Iyengar and P. K. Jain: Numerical Methods.

2. Advanced Real Analysis LTP: 3+1+0

Unit I: Metric spaces revisited; Baire Category theorem, completion of Metric spaces, Banach

contraction principle and some of its applications. Compactness, Total boundedness,

characterization of compactness for arbitrary Metric spaces; Arzella-Ascoli theorem, Stone

Weierstrass theorem.

Unit II: Integrations : Lebesgue’s criterion of Riemann integrability over a bounded closed interval

[a, b] and its consequence, length of a rectifiable curve in a plane, Riemann-Stieltjes integral over

[a, b] and its properties, Integrators of bounded variation, Integration by parts, Stieltjes integral as a

Riemann integral, Step function as integrator, Riesz theorem.

Unit III: Cesaro’s Method of Summability and Fourier Series: Cesaro’s method of summability of

order 1 and order 2, Some specific examples, Regularity of Cesaro’s method, Definition of Fourier

series and some examples, Dirichlet’s Kernel, Fejer’s Kernel, Fejer’s theorem, Dini’s and Jordan’s

tests for point wise convergence of Fourier series.

Recommended reading:

[1] A. M. Bruckner, J. Bruckner & B. Thomson : Real Analysis, Prentice-Hall, N.Y. 1997.

[2] R. R. Goldberg : Methods of Real Analysis, Oxford-IBH, New Delhi, 1970.

[3] I. P. Natanson : Theory of Functions of a Real Variable, Vol-I, F.Ungar, N.Y. 1955.

[4] E. Hewitt and K. Stromberg : Real and Abstract Analysis, John-Willey, N.Y. 1965.

[5] J. F. Randolph : Basic Real and Abstract Analysis. Academic Press, N.Y. 1968.

[6] P. K. Jain and K. Ahmad : Metric Spaces, Narosa Publishing House.

[7] G. Tolstov : Fourier Series, Dover Publication, N.Y. 1962.

3. Celestial Mechanics LTP: 3+1+0

UNIT-I: Introduction, Kepler’s Laws of Planetary Motion, Newton’s law of gravitation, Central

force motion, Integral of energy, Differential equation of orbit, Inverse square force, Geometry of

orbits, Two body problem, Motion of center of mass, Relative motion, Earth bound satellite circular

orbit, Classical orbital elements, Position in elliptic orbit, Position in parabolic orbit and Position in

hyperbolic orbit. (15 Lectures)

UNIT-II: N-body problem, Mathematical formulation of N-body problem, Integrals of motion,

The Virial theorem, Equation of relative motion, Three body problem, Stationary solution of three

body problem, Restricted three body problem- formulation and its solution, Restricted three body

problem, Stability of motion near Lagrangian points. (15 Lectures)

UNIT-III: Theory of perturbations, Variation of parameter, Properties of Lagrange’s brackets,

Evaluation of Lagrange’s brackets, Solution of the perturbation equations, Perturbation function,

Earth-Moon system, Potential due to an oblate spheroid, Perturbations due to oblate planet,

Perturbation due atmospheric drag, Perturbation due to solar radiation. (15 Lectures)


1. Introduction to Celestial Mechanics by S. W. McCuskey, Addison-Wesley Publishing

Company, 1963.

2. Solar System Dynamics by C. D. Murray and S. F. Dermott, Cambridge University

Press, 2000.

3. An Introduction to Celestial Mechanics by F. R. Moulton, the MacMillan Company,

1914.

4. Theory of orbits. The Restricted problem of three bodies by V. Szebehely, New York

Academic Press, 1967.

5. Classical Mechanics by K. Sankara Rao, PHI Learning Pvt. Ltd., 2009

4. Computational ODE LTP: 3+1+0

Unit-I

Numerical solutions of system of simultaneous first order differential equations and second order initial

value problems (IVP) by Euler and Runge-Kutta (IV order) explicit methods, Numerical solutions of second

order boundary value problems (BVP) of first, second and third types by shooting method.

Unit-II

Types Finite difference schemes of second order BVP based on difference operators (solutions of tri-

diagonal system of equations), Solutions of such BVP by Newton-Cotes and Gaussian integration rules,

Convergence and stability of finite difference schemes.

Unit-III

Variational principle, approximate solutions of second order BVP of first kind by Reyleigh-Ritz,

Galerkin, Collocation and finite difference methods, Finite Element methods for BVP-line segment,

triangular and rectangular elements, Ritz and Galerkin approximation over an element, assembly of

element equations and imposition of boundary conditions.

References:

1. M. K. Jain, S. R. K. Iyenger and R. K. Jain, Numerical Methods for Scientific and Engineering

Computations, New Age Publications, 2003.

2. M. K. Jain, Numerical Solution of Differential Equations, 2nd

edition, Wiley-Eastern.

3. S. S. Sastry, Introductory Methods of Numerical Analysis,

4. D.V. Griffiths and I. M. Smith, Numerical Methods for Engineers, Oxford University Press, 1993.

5. C. F. Gerald and P. O. Wheatley, Applied Numerical Analysis, Addison- Wesley, 1998.

6. A. S. Gupta, Text Book on Calculas of Variation, Prentice-Hall of India, 2002.

7. Naveen Kumar, An Elementary Course on Variational Problems in Calculus, Narosa, 2004.

5. Computational PDE LTP: 3+1+0

Unit-I

Numerical solutions of parabolic equations of second order in one space variable with constant

coefficients:- two and three levels explicit and implicit difference schemes, truncation errors and

stability, Difference schemes for diffusion convection equation, Numerical solution of parabolic

equations of second order in two space variable with constant coefficients-improved explicit schemes,

Implicit methods, alternating direction implicit (ADI) methods.

Unit-II

Numerical solution of hyperbolic equations of second order in one and two space variables with

constant and variable coefficients-explicit and implicit methods, alternating direction implicit (ADI)

methods.

Unit-III

Numerical solutions of elliptic equations, Solutions of Dirichlet, Neumann and mixed type problems

with Laplace and Poisson equations in rectangular, circular and triangular regions, Finite element

methods for Laplace, Poisson, heat flow and wave equations.

References:

1. M. K. Jain, S. R. K. Iyenger and R. K. Jain, Computational Methods for Partial Differential

Equations, Wiley Eastern, 1994.

2. M. K. Jain, Numerical Solution of Differential Equations, 2nd

edition, Wiley Eastern.

3. S. S. Sastry, Introductory Methods of Numerical Analysis, , Prentice-Hall of India, 2002.

4. D. V. Griffiths and I. M. Smith, Numerical Methods of Engineers, Oxford University Press, 1993.

5. C. F. General and P. O. Wheatley, Applied Numerical Analysis, Addison- Wesley, 1998.

6. K. J. Bathe and E. L. Wilson, Numerical Methods in Finite Element Analysis, Prentice-HalI,

1987.

7. A. S. Gupta, Text Book on Calculas of Variation, Prentice-Hall of India, 2002.

8. Naveen Kumar, An Elementary Course on Variational Problems in Calculus, Narosa, 2004.

6. Complex Dynamics LTP: 3+1+0

UNIT –I: Iteration of a Mobius transformation, attracting, repelling and indifferent fixed points.

Iterations of R(z) = z2, z2+c, z + . The extended complex plane, chordal metric, spherical metric,

rational maps, Lipschitz condition, conjugacy classes of rational maps, valency of a function, fixed

points, Critical points, Riemann Hurwitz relation. (15 Lectures)

UNIT –II: Equicontinuous functions, normality sets , Fatou sets and Julia sets, completely invariant

sets, Normal families and equicontinuity, Properties of Julia sets, exceptional points Backward

orbit, minimal property of Julia sets. (15 lectures)

UNIT -III : Julia sets of commuting rational functions, structure of Fatou set, Topology of the

Sphere, Completely invariant components of the Fatou set , The Euler characteristic, Riemann

Hurwitz formula for covering maps, maps between components of the Fatou sets, the number of

components of Fatou sets, components of Julia sets. (15 lectures)

Recommended Books:

1. A. F. Beardon, Iteration of rational functions, Springer Verlag , New York, 1991.

2. L. Carleson and T . W. Gamelin, Complex dynamics, Springer Verlag, 1993.

3. S. Morosawa, Y. Nishimura, M. Taniguchi, T. Ueda, Holomorphic dynamics,

Cambridge University Press, 2000.

4. X. H. Hua, C. C. Yang, Dynamics of transcendental functions, Gordan and Breach Science

Pub. 1998.

.

7. Dynamical System LTP: 3+1+0

Unit-I Linear Systems: Exponentials of operators, Linear systems in R2, Complex eigenvalues,

Multiple eigenvalues, Jordon forms, Stability theory, generalized eigenvectors and invariant

subspaces, Non-homogeneous linear systems.

(15 lectures)

Unit-II: Non-linear Systems: local analysis: the fundamental existence-uniqueness theorem, The

flow defined by a differential equation, Linearization, The stable manifold theorem, The Hartman-

Grobman theorem, Stability and Liapunov functions, Saddles, Nodes, Foci, and Centers.

(15 lectures)

Unit-III: Non-linear Systems: global analysis: Dynamical systems and global existence theorem,

Limit sets and Attractors, Periodic orbits, Limit Cycles, and Seperatrix cycles, the Poincare map,

the stable manifold theorem for periodic orbits, the Poincare-Bendixon theory in R2, Lineard

Systems, Bendixon’s Criteria.

(15 lectures)

Recommended reading:

1. Differential Equations and Dynamical Systems by Lawrence Perko, Springer-Verlag, 2006.

2. Differential Equations, Dynamical Systems and an Introduction to Chaos by Morris W.

Hirsch, Stephen Smale and Robert L. Devaney, Academic Press, 2013

3. Dynamical Systems and Numerical Analysis by A.M. Stuart and A.R. Humphries,

Cambridge University Press, 1998.

4. Dynamical Systems with Applications using MATLAB by S. Lynch, Birkhause press, 2004.

5. Nonlinear Dynamics and Chaos with Applications to Physics, Biology, Chemistry and

Engineering, by Steven H. Strogatz, Westview Press.

8. Fluid Dynamics LTP: 3+1+0

Unit I. Physical Properties of fluids. Concept of fluids, Continuum Hypothesis, density, specific

weight, specific volume, Kinematics of Fluids : Eulerian and Lagrangian methods of description of

fluids, Equivalence of Eulerian and Lagrangian method, General motion of fluid element,

integrability and compatibility conditions, strain rate tensor, stream line, path line, streak lines,

stream function¸ vortex lines, circulation,

Unit II. Stresses in Fluids : Stress tensor, symmetry of stress tensor, transformation of stress

components from one co-ordinate system to another, principle axes and principle values of stress

tensor Conservation Laws : Equation of conservation of mass, equation ofconservation of

momentum, Navier Stokes equation, equation of moments of momentum, Equation of energy, Basic

equations in different co-ordinate systems, boundary conditions.

Unit III. Irrotational and Rotational Flows : Bernoulli’s equation, Bernoulli’s equation for

irrotational flows, Two dimensional irrotational incompressible flows, Blasius theorm, Circle

theorem, sources and sinks, sources sinks and doublets in two dimensional flows, methods of

images.


1. An introduction to fluid dynamics, R.K. Rathy, Oxford and IBH Publishing Co. 1976.

2. Theoretical Hydrodynamics, L. N. Milne Thomson, Macmillan and Co. Ltd.

3. Textbook of fluid dynamics, F. Chorlton, CBS Publishers, Delhi.

4. Fluid Mechanics, L. D. Landau and E.N. Lipschitz, Pergamon Press, London, 1985.

9. Integral equation and Calculus of variation LTP: 3+1+0

Unit-I: The variation of a functional and its properties, Euler’s equations and application,

Geodesics, Variational problems for functional involving several dependent variables, Hamilton

principle, Variational problems with moving (or free) boundaries, Approximate solution of

boundary value problem by Rayleigh-Ritz method.

(15 Lectures)

Unit-II: Linear integral equation and classification of conditions, Volterra integral equation,

Relationship between linear differential equation and Volterra integral equation, Resolvent kernel of

Volterra integral equation, solution of integral equation by Resolvent kernel, The method of

successive approximations, Convolution type equation. (15

Lectures)

Unit-III Fredholm integral equation, Fredholm equation of the second kind, Fundamentals-iterated

kernels, constructing the resolvent kernel with the aid of iterated kernels, Integral equation with

degenerated kernels, solutions of homogeneous integral equation with degenerated kernel.

(15 Lectures)


1. Applied Mathematics for Engineers and Physicists by L. A. Pipe (McGraw Hill)

2. Introduction to Mathematical Physics by Charlie Harper, P.H.I. , New Delhi

3. Higher Engineering Mathematics by B.S. Grewal, Khanna Publications, Delhi

4. Mathematical Methods for Physicists by George Arfken (Academic Press)

5. Mathematical Methods by Potter and Goldberg (Prentice Hall of India)

6. Calculus of Variations by IM Gelfand, SV Fomin, and Richard A Silverman

7. Introduction to the Calculus of Variations by Bernard Dacorogna, World Scientific

8. Calculus of Variations with Applications to Physics and Engineering by Robert Weinstock,

Dover Publications.

9. Linear Integral equations By R. P. Kanwal, Academic Press, New- York.

10. Linear and Nonlinear programing LTP:3+1+0

Unit I. Linear Programming, Theoretical foundation of Simplex Method: Proof of Theorems,

Revised Simplex Method, Duality Theorems and Post Optimality Analysis, Computational

Complexity of Simplex Algorithm, Karmarkar's Algorithm for Linear programming.

(15 Lectures)

Unit II. Degeneracy in Transportation Problem, Unbalanced Transportation Problem, Duality in

Assignment problems, Integer Linear programming: Gomory's Cutting Plane Method, Multi-

Objective Optimization Theory, Goal Programming, Computer Programming for Simplex Method,

Dual simplex Method, Branch & Bound Method and Hungarian Method.

(15 Lectures)

Unit III. Convex Optimization Problems and Duality, Quadratic programming and

Complementarity Problem-Wolfe's method, Beale's method, Fletcher's method. Nonlinear

Programming Methods, Frank-Wolfe Method, Gradient Projection Method, Penalty and Barrier

Function Method.

(15 Lectures)


1. Operations Research: An Introduction, Hamady A. Taha, Prentice Hall of India, 8th ed., 2006.





11. MEASURE THEORY AND INTEGRATIONS LTP:3+1+0

UNIT-I: Countable and uncountable sets, cardinality and cardinal arithmetic, Schr der–Bernstein

theorem, the Canter’s ternary set, semi-algebras, algebras, monotone class,

algebras, measure and outer measures, Carathe dory extension process of extending a measure

on a semi-algebra to generated algebras, Borel sets (15 Lectures)

Unit-II: Lebesgue outer measure and Lebesgue measure on R, translation invariance of Lebesgue

measure, existence of a non-measurable set, characterizations of Lebesgue measurable sets, the

Cantor-Lebesgue function, measurable functions on a measure space and their properties, Borel and

Lebesgue measurable functions, Simple functions and their integrals, Littlewood’s three principle

(statement only) (15 Lectures)

UNIT-III: Lebesgue integral on R and its properties, bounded convergence theorem, Fatou’s

lemma, Lebesgue monotone convergence theorem, Lebesgue dominated convergence theorem,

L_p-spaces, Holder-Minkowski inequalities, parseval’s identity, Riesz Fisher’s theorem. (15

Lectures)

Books Recommended:

1. H. L. Royden amd P. M. Fitzpatrick, Real Analysis (Fourth edition), PHI 2010.

2. P. R. Halmos, Measure Theory, Springer, 1994.

3. E. Hewit and K. Stromberg, Real and Abstract Analysis, Springer, 1975.

4. K. R. Parthasarathy, Introduction to Probability and Measure, Hindustan Book Agency,

2005.

5. I. K. Rana, An Introduction to Measure and Integration (2nd Edition) Narosa Publishing

House, 2005.

12. Advanced Complex Analysis LTP: 3+0+0

Unit-I. Analytic Continuation, Analytic Continuation along Paths via Power Series, Monodromy Theorem,

Picard theorem, Poisson integral, Mean value theorem, Schwarz reflection principle, Analytic continuation

via reflexion. (15 Lectures)

Unit-II. Infinite sums and infinite product of complex numbers, Infinite product of analytic functions,

Factorization of entire functions, The Gamma functions, The Zeta functions.

(15 Lectures)

Unit-III. The Riemann mapping theorem (Statement only), Area Theorem, Biberbach Theorem and

conjecture, Distortion theorem, Koebe ¼ theorem, Starlike and convex functions. Coefficient estimates and

distortion theorem. (15 Lectures)

Recommended Books:

1. S. Ponnusamy, Foundation of Complex Analysis, 2nd edition, Narosa Publishing House.

2. L. R. Ahlofrs, Complex Analysis, McGraw Hill

13. Automata Theory and Formal Languages LTP:3+0+0

Unit-I: Theory of Computation: Finite automata, Deterministic and non-deterministic finite

automata, equivalence of deterministic and non-deterministic automata, Moore and Mealy

machines, Regular expressions, Grammars and Languages, Derivations, Language generated by a

grammar. (15L)

Unit-II: Regular Language and regular grammar, Regular and Context free grammar, Context

sensitive grammars and Languages, Pumping Lemma, Kleene’s theorem. (15L)

Unit-III: Turing Machines: Basic definitions, Turing machines as language acceptors, Universal

Turing machines, decidability, undecidability, Turing Machine halting problem. (15L)


1) D. Kelly, Automata and Formal Languages: An Introduction, Prentice-Hall, 1995.

2) J. E. Hopcroft, R. Motwani, and J. D. Ullman, Introduction to Automata, Languages, and

Computation

(2nd edition), Pearson Edition, 2001.

3) P. Linz, An Introduction to Formal Languages and Automata, 3rd Edition.

14. Bio- Mathematics LTP: 3+0+0

Unit 1: Introduction: Goals and Challenges of mathematical modeling in biology and ecology.

Idealization and general principle of model building, deterministic and stochastic models, different

types of mathematical models and differential and difference equations as relevant mathematical

techniques, complex network dynamics, biological and ecological examples.

(15 Lectures)

Unit 2: Continuous growth models for single species: The linear model, Logistic population model,

Stability of equilibrium states and bifurcation analysis, Constant Harvesting and bifurcations, Delay

models, Linear analysis of delay models: periodic solutions.

(15 Lectures)

Unit 3: Discrete population models for single species: Simple models, Discrete logistic-type model:

Chaos, stability, periodic solutions and bifurcations, discrete delay models. Models with interacting

populations: predator-prey interactions, Analysis of a predator-prey model with limit cycle periodic

behaviour, Harvesting in two species models.

(15 Lectures)

Reference books:

1. J.D. Murray, Mathematical biology: An introduction, Springer, 2007.

2. F. Brauer, C.C-Chavez, Mathematical Models in Population Biology and Epidemiology,

Springer, 2000.

3. N.F. Britton, Essential mathematical biology, Springer, 2004.

4. M. Kot, Elements of mathematical ecology, Cambridge University Press, 2001.

5. A. Okubo, S.A. Levin, Diffusion and ecological problems, Springer, 2002.

6. S.V. Petrovskii, B.L. Li, Exactly solvable models of biological invasions, CRC Press/

Chapman and Hall, 2005.

7. R.W. Sterner, J.J. Elser, Ecological stoichiometry: the biology of elements from molecules

to the biosphere, Princeton University Press, 2002.

8. H. Smith, An Introduction to Delay Differential Equations with Applications to Life

Sciences, Springer, 2010

15. Financial Mathematics LTP: 3+0+0

Unit I. Introduction to options and markets: types of options, interest rates and present values,

Black Sholes model : arbitrage, option values, pay offs and strategies, putcall parity, Black Scholes

equation, similarity solution and exact formulae for European options, American option, call and

put options, free boundary problem. (15L)

Unit II. Binomial methods: option valuation, dividend paying stock, general formulation and

implementation, Monte Carlo simulation : valuation by simulation, Lab component: implementation

of the option pricing algorithms and evaluations for Indian companies. (15L)

Unit III. Finite difference methods: explicit and implicit methods with stability and conversions

analysis methods for American options- constrained matrix problem, projected SOR, time stepping

algorithms with convergence and numerical examples. (15L)


1. D. G. Luenberger, Investment Science, Oxford University Press, 1998. 2. J. C. Hull , Options, Futures and Other Derivatives, 4th ed., Prentice- Hall ,New York, 2000.

3. J. C. Cox and M. Rubinstein, Option Market, Englewood Cliffs, N. J.: Prentice-Hall, 1985.

4. C.P. Jones. Investments, Analysis and Measurement, 5th ed., John Wiley and Sons, 1996.

16. Fractional Calculus and Geometric Function Theory LTP: 3+0+0

Unit I: Fractional derivatives and Integrals, application of fractional calculus, Laplace transforms of

fractional integrals and fractional derivatives, fractional ordinary differential equations, fractional

integral equations, Initial value problem of fractional differential equations. (15 Lectures)

Unit II: Univalence in Complex plane. Area theorem. Growth, covering and distortion results.

Starlike and Convex functions. Starlike and Convex functions of order α. Alpha convexity. Close

to convexity, spirallikeness and Φ-likeness in unit disk. (15 Lectures)

Unit III: Subordination. Application of subordination principle. First and second order differential

subordination. Briot-Bouquet differential subordinations. Briot-Bouquet application in Univalent

function theory. (15 Lectures)


1. Loknath Debnath and Dambaru Bhatta, Intgral Transforms and Special Functions, CRC

press, 2010.

2. I. Graham and G. Kohr, Geometric function theory in one and higher dimensions, Marcel

Dekker, 2003.

3. S. S. Miller and P. T. Mocanu, Differential Subordinations theory and Applications, Marcel

Dekker, 2000.

17. Fuzzy Logic and its Applications LTP:3+0+0

Unit–I: Classical sets vs Fuzzy Sets- Definition and Mathematical representations, Level Sets, Operations on

fuzzy sets, Compliment, Intersections, Unions, Combinations of Operations, Fuzzy negation, triangular

norms, t-conorms, Aggregation Operations, max-min principle, extension principle, Fuzzy Arithmetic, Fuzzy

Relations, Fuzzy Binary and n-ary relations, composition of fuzzy relations.

(15 Lectures)

Unit–II: Fuzzy Numbers, Linguistic Variables, Arithmetic Operations on intervals & Numbers, Classical

Logic, Multivalued Logics, Fuzzy Propositions, Fuzzy Qualifiers, Linguistic Hedges Fuzzy Measures,

Evidence Theory, Necessity and Belief Measures, Probability Measures vs Possibility Measures.

(15 Lectures)

UNIT-III: Fuzzy knowledge base, rule base, Data base for fuzzy, Inference rules, Fuzzification,

defuzzification, Fuzzy Decision Making-Individual, Multi Person, Multistage, Multi criterion Decision

Making, Fuzzy Linear Programming, Fuzzy Classification and Pattern Recognition. (15 Lectures)

Recommended Books:

1. G. J. Klir and B. Yuan, Fuzzy Sets and Fuzzy Logic: Theory and Applications, Prentice Hall,

1997.

2. Timothy J.Ross, “Fuzzy logic with engineering applications”, McGraw Hill, 1995.

Reference Books:

1. H. –J. Zimmermann, Fuzzy Set Theory and Its Application, 2nd ed., Kluwer, Boston, 1990.

K.H.Lee.. First Course on Fuzzy Theory and Applications, Springer-Verlag.

2. J. Yen and R. Langari.. Fuzzy Logic, Intelligence, Control and Information, Pearson Education.

18. GAME THEORY LTP: 3+0+0

UNIT-I

A General Introduction to Game Theory-its Origin, Representation of Games, Types of Game,

Static Games with Complete and Incomplete Information, Strategic Form Game with Illustrations,

Solution Concept- Pure and Mixed Strategies, Dominance and Best Response, Pareto Optimality,

Maxmin and Minmax Strategies, Pure and Mixed Strategies Nash Equilibrium, Correlated

Equilibrium, Bayesian Games, Market Equilibrium and Pricing: Cournot and Bertrand Game.

(15 Lectures)

UNIT-II

Existence and Properties of Nash Equilibrium, Two-person Zero-Sum Games-its Solution; Dynamic

Games of Perfect Information, Extensive Form Game, Nash Equilibrium, Sub-game Perfection,

Backward Induction (looking forward), Stackelberg Model of Duopoly.

(15 Lectures)

UNIT-III

Bargaining Problem, Dynamic Games with Imperfect Information, Finitely and Infinitely Repeated

Games, The Folk Theorem, Illustrations, Stochastic Games, Coalition Games, Core and Shapley

Value, Illustrations.

(15 Lectures)

Text Books:

1. M.J. Osborne, An Introduction in Game Theory, Indian Ed.

2. M. J. Osborne and A. Rubinstein, A course in Game Theory, MIT Press, 1994

3. D. Fudenberg and J. Tirole, Game Theory, MIT Press, 1991.

Reference Books:

1. J. Von Neumann and O. Morgenstern, Theory of Games and Economic Behaviour, New

York: John Wiley and Sons., 1944.

2. R.D. Luce and H. Raiffa, Games and Decisions, New York: John Wiley and Sons.,1957.

3. G. Owen, Game Theory, (Second Edition), New York: Academic Press, 1982.

19. Graph Theory LTP: 3+0+0

Unit I: Graphs and simple graphs, Vertex Degrees, Subgraphs, Graph Isomorphism, The

Incidence and Adjacency Matrices, Paths and Circuits, Trees, Cut Edges and Cut Vertices, Euler

and Hemilton circuits, Bipartite and Complete graphs. Spanning trees, Minimal spanning trees,

Kruskal’s Algorithm, Directed graphs, Weighted undirected graphs, Dijkstra’s algorithm,

Warshal’s Algorithm.

Unit II: Connectivity: Connectivity of graphs, Cut-sets, Edge Connectivity and Vertex

Connectivity, Planarity: Planar Graphs, Testing of Planarity, Euler’s formula for connected planar

graphs, Kuratowski Theorem for Planar graphs, Random Graphs.

Unit III: Coloring of graphs: Chromatic number and chromatic polynomial of graphs, Brook’s

Theorem, Five Color Theorem and Four Color Theorem.


1) F. Harary, Graph Theory, Narosa Publ.

2) R. Diestel, Graph Theory, Springer, 2000.

3) Narsingh Deo, Graph Theory with Applications to Engineering and Computer Science, Prentice-

Hall of India.

4) W. T. Tutte, Graph Theory, Cambridge University Press, 2001.

5) Kenneth H. Rosen, Discrete Mathematics and its Applications, 6th ed., Tata McGraw-Hill.

20. Module Theory LTP: 3+0+0

Unit I: Modules over a ring, submodules, Quotient Modules, module homomorphism and

isomorphism theorems for modules, cyclic modules, simple modules and semisimple modules and

rings, Schur’s lemma.

Unit II: Exact sequences, Products, Coproducts and their universal property, External and internal

direct sums, Free modules, Left exactness of Hom sequences and counter-examples for non-right

exactness.

Unit III: Noetherian and Artinian modules and rings. Hilbert basis theorem, Projective and

injective modules, Divisible groups, Example of injective modules.


1. I. N. Herstein, Topics in Algebra, Wiley Eastern, 1975.

2. P. B. Bhattacharya, S. K. Jain and S. R. Nagpaul, Basic Abstract Algebra (2nd Edition),

Cambridge

University Press, 1997.

3. D. S. Malik, J. N. Mordeson, and M. K. Sen, Fundamentals of Abstract Algebra, McGraw-Hill

International Edition, 1997.

4. D.S. Dummit and R.M. Foote, Abstract Algebra, John Wiley, 2003.

5. J.S. Golan, Modules & the Structures of Rings, Marcl Dekkar. Inc.

21. Number Theory-I LTP: 3+0+0

Unit I: Primes, Divisibility, Greatest common divisor, Euclidean algorithm, Fundamental theorem

of arithmetic, Perfect numbers, Mersenne primes and Fermat numbers, Farey sequences.

Unit II: Congruence and modular arithmetic, Residue classes and reduced residue classes, Chinese

remainder theorem, Fermat's little theorem, Wilson's theorem, Euler's theorem and its application to

cryptography, Arithmetic functions , Möbius inversion formula, Greatest

integer function.

Unit III: Primitive roots and indices, quadratic residues, Legendre symbol, Euler's criterion,

Gauss's lemma, Quadratic reciprocity law, Jacobi symbol, Representation of an integer as a sum of

two and four squares, Diophantine equations ax+by=c, x2+y2=z2, x4+y4=z4. Binary quadratic forms

and Equivalence of quadratic forms.


1) David M. Burton, Elementary Number Theory, Wm. C. Brown Publishers, Dubuque,

Iowa 1989.

2) G.A. Jones and J.M. Jones, Elementary Number Theory, Springer-Verlag, 1998.

3) W. Sierpinski, Elementary Theory of Numbers, North-Holland, Ireland, 1988.

4) Niven, S.H. Zuckerman and L.H. Montgomery, An Introduction to the Theory of

Numbers, John Wiley, 1991.

5) Joseph H. Silverman, A Friendly Introduction to Number Theory, 4th ed., Pearson.

6) Thomas Koshy, Elementary Number Theory with Applications, 2nd ed., Academic Press.

22. Number Theory – II LTP: 3+0+0

Unit-I: Continued fractions, Approximation of real numbers by rational numbers, Pell's equations,

Partitions, Ferrers graphs, Jacobi's triple product identity. (15L)

Unit-II: Congruence properties of p(n), Rogers-Ramanujan identities, Minkowski's theorem in

geometry of numbers and its applications to Diophantine inequalities, Order of magnitude and

average order of arithmetic functions. (15L)

Unit-III: Euler's summation formula, Abel's identity, Elementary results on distribution of primes,

Characters of finite Abelian groups, Dirichlet's theorem on primes in arithmetical progression.

(15L)


1. Thomas Koshy, Elementary Number Theory with Applications, 2nd ed., Academic Press.

2. Tom M. Apostol, Introduction to Analytic Number Theory, Springer-Verlag, 1976.

23. Non linear Dynamics and its applications to Information Technology LTP: 3+0+0

Unit I: Introduction to nonlinear Dynamics. Non linear Maps. Bass Model for technology Diffusion

(in both Differential and Difference form). (15 Lectures)

Unit II: Existence of chaos in Logistic and Base Models in Discrete forms. Effects of variable

externals and internal influence in Bass Model (in both continuous and discrete forms, conditions

for chaos). (15 Lectures)

Unit III: Modelling of two or more competing Technologies and their coexistence, Application to

markets. Models for Virus in Communication and Computer Networks. Network Crimes and

Control. (15 Lectures)


1. P. Glendenning, Stability, Instability and Chaos, Cambridge University Press (1994).

2. M. Laxshmanan and S. Rajsekher, Nonlinear Dynamics, Springer-Verlag, Heidelberg (2003)

24. Operations Research LTP: 3+0+0

Unit I: Nonlinear Programming: Unconstrained algorithms; direct search method, gradient method .

Constrained methods; Separable programming, quadratic programming.

General Inventory models, role of demand in the development of inventory; Static Economic-

Order-Quantity (EOQ) models; Dynamic EOQ models. Continuous review model, single period

models, multi period models. (15 Lecture)

Unit-II: Elements of Queuing models, role of exponential, pure birth and death models.

Generalized Poisson Queuing models, Specialized Poisson Queues: Steady state measures of

performance, single server model multi server models, machine servicing models-(M/M/R):

(GD/K/K), R< K.

Replacement and maintenance models; gradual failure, sudden failure, replacement due to

efficiency deteriorate with time, staffing problems, equipment renewal problems. (15 Lecture)

Unit-III: Project Scheduling by PERT-CPM

Simulation modelling: Monte Carle Simulation, Types of simulations, Elements of discrete-events

simulation, generation of random numbers. Mechanics of discrete simulation, Methods of gathering

statistical observations: subinterval method, replication method, regeneration method.

Sequencing Problems: notions, terminology, and assumptions, processing n jobs through m

machines. (15 Lecture)

Recommended Books:

1. Operations Research an Introduction –Hamady A. Taha, Prentice Hall.

2. Operations Research Theory and Applications-J.K.Sharma, Macmillan Publishers.

3. Non linear Programming –S.D. Sharma, Kedar Nath Ram Nath & Co.

4. Mathematical Programming Theory and Methods-S.M.Sinha.

5. Operations Research, - Kanti Swarup, P. K. Gupta and Man Mohan, Sultan Chand &

Sons

25. SPECIAL FUNCTIONS LTP:3+0+0

UNIT-I: Beta and Gamma Functions, Euler Reflection Formula, Stirling’s Asymptotic Formula,

Gauss’s Multiplication Formula, Ratio of two gamma functions, Integral Representations for

Logarithm of Gamma function and Beta functions.

(10 Lectures)

UNIT-II. Hypergeometric Differential Equations, Gauss Hypergeometric Function, Elementary

Properties, Conditions of convergence, Integral Representation, Gauss Theorem, Vandermonde’s

theorem, Kummer’s theorem, Linear transformation, Generalized Hypergeometric Functions,

Elementary Properties, Integral Representation.

(10 Lectures)

UNIT-III: Legendre polynomials and functions, Solution of Legendre’s differential equations,

Generating Functions, Rodrigue’s Formula, Orthogonality of Legendre polynomials, Recurrence

relations.

Bessel functions, Bessel differential equation and it’s solution, Recurrence relation, Generating

functions, Integral representation. (10 Lectures)

Recommended Books:

1. G. E. Andrews, R. Askey, Ranjan Roy, Special Functions, Encyclopedia of Mathematics

and its Applications, Cambridge University Press, 1999.

2. E. D. Rainville, Special Functions, Macmillan, New York, 1960.

********

Details Syllabus of Elective Papers (Mathematics)

(1) ARTIFICIAL COGNITIVE SYSTEMS

• An embodied logical model for cognition in artificial cognition system

• Modelling field theory of higher cognitive function

• Reconstructing Human Intelligence within computational science

• Stratified constraint satisfaction network in synergetic multi-agent simulation of

language evolution

• Making Meaning in computers; Synthetic ethology revisited

• Mimetic minds; Meaning Formation through epistemic mediators and external

representation.

Books

Artificial Cognation System by Angelo Loula, Ricardo Gudwin & Joao Queiroz, 2007, Idea

Group Inc.

(2) CLOUD COMPUTING

UNIT-I: Overview of Computing Paradigm, Recent trends in Computing Grid Computing, Cluster Computing, Distributed Computing, Utility Computing, Cloud Computing Evolution of cloud computing Business driver for adopting cloud computing.

Introduction to Cloud Computing. Cloud Computing (NIST Model) Introduction to Cloud Computing, History of Cloud Computing, Cloud service providers Properties, Characteristics & Disadvantages Pros and Cons of Cloud Computing, Benefits of Cloud Computing, Cloud computing vs. Cluster computing vs. Grid computing

UNIT-II Role of Open Standards ,Cloud Computing Architecture,Cloud computing stack ,Comparison with traditional computing architecture (client/server), Services provided at various levels, How Cloud Computing Works, Role of Networks in Cloud computing, protocols used, Role of Web services

UNIT-III Service Models (XaaS),Infrastructure as a Service(IaaS),Platform as a Service(PaaS), Software as a Service(SaaS),Deployment Models ,Public cloud,Private cloud,Hybrid cloud Community cloud,Infrastructure as a Service(IaaS),Introduction to IaaS IaaS definition, Introduction to virtualization, Different approaches to virtualization, Hypervisors, Machine Image, Virtual Machine(VM) Resource Virtualization,Server,Storage,Network, Virtual Machine(resource) provisioning and manageability, storage as a service, Data storage in cloud computing(storage as a service)

UNIT-IV Examples,Amazon EC2,Renting, EC2 Compute Unit, Platform and Storage, pricing, customers Eucalyptus,Platform as a Service(PaaS),Introduction to PaaS,What is PaaS, Service Oriented Architecture (SOA),Cloud Platform and Management,Computation ,Storage

Examples: Google App Engine,Microsoft Azure,SalesForce.com’s Force.com platform

Software as a Service(PaaS):Introduction to SaaS,Web services,Web 2.0,Web OS,Case Study on SaaS

Cloud Security:Infrastructure Security,Network level security, Host level security, Application level security,Data security and Storage,Data privacy and security Issues, Jurisdictional issues raised by Data location.Identity & Access Management,Access Control,Trust, Reputation, Risk, Authentication in cloud computing, Client access in cloud, Cloud contracting Model, Commercial and business considerations

Case Study on Open Source & Commercial Clouds

o Eucalyptus o Microsoft Azure o Amazon EC2

Book Cloud Computing Bible, Barrie Sosinsky, Wiley-India, 2010

(3) COMPILER DESIGN

Definition of Compiler, Translator, Interpreter, Phase of compiler , introduction to one

pass & Multipass compilers, Bootstrapping, Relationship between Finite automata and

lexical analyzer, Input, buffering, Recognition of tokens,

Role of parser, Relation between CFG and parsing. Bottom up parsing and Top down

parsing techniques. Shift reduce parsing, Operator precedence parsing, Recursive descent

parsing, predictive parsers. LL grammars.

Syntax directed definitions, Construction of syntax trees, L-attributed definitions, Top

down translation. Specification of a type checker, Intermediate code forms using three

address code,

Storage organization: Storage allocation Strategies, Activation records, Parameters

passing, Symbol table organization. Definition of basic block, DAG. Code generation from

DAG.

Recent Trends

BOOKS

1. Aho, Ullman and Sethi: Compilers, Addison Wesley.

2. Holub, Compiler Design in C, PHI.

: The Theory and Practice of Compiler Writing, BSP

(4) COMPUTATIONAL INTELLIGENCE

• Computational Intelligence and Knowledge,

• A Representation and Reasoning System

• Definite Knowledge

• Searching

• Knowledge Engineering

• Beyond Definite Knwoledge

• Actions and Planning

• Recent Trends

Book:

Computational Intelligence - A logical Approach by David Pool, Alan Mackworth &

Randy Goebel, Oxford University press New York

(5) COMPUTATIONAL LINGUISTIC

• Introduction

• The role of natural language processing

• Linguistics and its structure

• A Historical outline

• Product of computational linguistics: present and prospective

• Language as a meaning and text transformer

• Possible points of view on natural language

• Language as a bi directional transformer

• Linguistic models

• Recent Trends

Book

Computational Linguistics: Models Resources, Applications bylgor A. Bolshakov and

Alexander Gelbukh, IPN-UNAM-FCE, 2004.

(6) DESIGN OF EXPERT SYSTEMS

1. Fundamentals of Knowledge representations: Introduction, Meaning of knowledge,

knowledge representation and reasoning, procedural knowledge, declarative knowledge,

expressing knowledge in terms of Vovabulary, basic facts, complex facts,

terminological facts , Knowledge engineering

2. Knowledge representation techniques: Representation, mappings, approach and

issues, roductions, semantic net, PROLOG and semantic net, Difficulties with semantic

net, Schemata, frame, difficulties with frames,

3. Logic and sets & first order logic : predicate logic, propositional logic, first order

predicate logic, Universal quantifiers, Existential quantifiers, quantifiers and sets,

limitation of predicate logic

4. Introduction to expert system: what is an expert system, advantage of expert system,

general concept of expert system, characteristic of an expert system, the development of

expert system techniques, expert system techniques, applications & domain language,

shells & tools, elements of an expert system, production system, procedural and non-

procedural paradigm, connectionist expert system and inductive learning

5. Design of expert system: selection of appropriate problem, expert system components,

stage of the development of an expert system, development process, errors in

development stage, S/w and expert system, expert system life cycle, expert system

design examples, certainty factor, decision tree, backward chaining, monitoring problem.

Recent Trends

BOOKS 1. Artificial Intelligence, Modern Approach Second edition, by Russel, Norving,

Pub. By Prentice Hall.

2. Expert systems principle and programming, third edition, by Joseph Giarratano

& Gary Riley, PWS publishing.

3. Introduction to AI and expert system, By Dan W Patterson , PHI pub.

(7) FRACTAL THEORY

Unit I. The basic concepts of geometric iteration, principle of feedback processes

Fundamentals of Fractals, Typesof fractal (mathematical and nature), self-similarity,

fractal dimension, multiple reduction copy machines, the chaos game, fractals in nature, and

decoding fractals. Chaos wipes out every computer. Chaos in (nature and Math).

Unit II. Standard mathematical fractals(seirpinski carpet ,gasket, cantor dust , koch kurve

etc),limits and self simalirity,Fractal dimension,Types of fractal dimension, implementation

of standard fractal and calculating their dimensions.

Affine transformation, Transformations, composing simple transformations, classical

fractals by IFS, drawing the classical fractals using IFS .

Unit III. Deterministic Chaos, analysis of chaos, periodic ponts,sensitivity, fixed points,

logistic map, sensitivity dependence of initial condition, implementaion and detailed

analysis of logistic map (mathematically and in real life)

L- systems, turtle graphics (graphical interpretation of L-Systems), Networked MRCMs, L-

Systems tree and bushes, Growing classical fractals with L-Systems and their

implementation.

Unit IV. Julia set ( Fractal basin boundaries), complex numbers, escape nad prisoners set,

filled Julia set, Quaternion Julia set, exploring Julia sets by varying complex numbers.

Mandelbort set, geometric features and properties , study structure of Mandelbort set.

Implementation of Julia set and Mandelbort set.

Project: Students will complete a final creative project that involves researching an

application to fractals and chaos. Students will create something to go along with the

project, like artwork, a short story, or a computer generated image.

(8) HUMAN COMPUTER INTERACTION

The Human: input-output channels, Human memory, thinking, emotions, individual

differences, psychology and the design of interactive systems.

The Computer: Text entry devices with focus on the design of key boards, positioning,

pointing and drawing, display devices.

The Interaction: Models of interaction, ergonomics, interaction styles, elements of WIMP

interfaces, interactivity, experience, engagement and fun.Paradigms for Interaction.

Design Process: The process of design, user focus, scenarios, navigation design screen design

and layout, iteration & prototyping. Usability Engineering

Design rules: Principles to support usability, standards, guidelines, rules and heuristics, HCI

patterns.

Evaluation Techniques: Definition and goals of evaluation, evaluation through expert analysis

and user participation, choosing an evaluation method.

Cognitive methods: Goals and task hierarchies, linguistic models, challenges of display based

systems, physical and device models, cognitive architectures.

Communications and collaborations models: Face to Face communication, conversations, Text

based communication, group working.

BOOKS

Human Computer Interaction; Alan Dix et.al, 3rd ed., Pearson.

(9) IMAGE PROCESSING AND PATTERN RECOGNITION

The Digitized Image and its Properties: Applications of image processing, image

function, image representation, sampling, quantization, color images, metrics and

topological properties of digital images, histograms, image quality, noise image.

Image Pre-processing: Pixel brightness transformation, geometric transformation, local

pre-processing- image smoothening, scale in image processing, spatial operation, intensity

transformation and spatial filtering, color models, gray scale transformation.

Image Restoration: Image degradation and re-storage process.

Segmentation: Point, line and edge detection, Threshold detection methods, parametric

edge models, edges in multi spectral images, thresholding, Region based segmentation.

Morphological properties of image: Erosion and Dilation, opening and closing, basic

morphological algorithms.

Image representation and description: Representation, border following and chain codes,

boundary descriptors, regional descriptors.

Pattern Recognition Fundamentals: Basic concepts of pattern recognition, fundamental

problems in pattern recognition system, design concepts and methodologies, example of

automatic pattern recognition systems, a simple automatic pattern recognition model.

Text/References:

1. Digital Image Processing: Rafel C. Gonzalez Richard E. Woods, Second edition,

Addison-Wisley.

2. Digital Image Processing: A K Jain, PHI

3. R. M. Haralick, L. G. Shapiro. Computer and Robot Vision. Addison-Wesley, 1993.

4. A. Rosenfeld, A. C. Kak. Digital Picture Processing. Addison-Wesley, 1983

5. D. A. Forsyth, J. Ponce. Computer Vision: A Modern Approach. Prentice-Hall, 2003.

6.C. R. Giardina, E. R. Dougherty. Morphological Methods in Image and Signal Processing.

Prentice-Hall, Englewood Cliffs, New Jersey, 1988. 37

7. Pattern Recognition and Image Analysis: Earl Gose, Richard Johnsonbaugh, Prentice Hall

of India Private Limited, 1999.

8. Pattern Recognition principles: Julus T. Tou and Rafel C. Gonzalez, Addison –Wesley

publishing company.

(10) INTELLIGENT HYBRID SYSTEMS

• Introduction to Fuzzy system, Neural Network, and Genetic Algorithms

• A fuzzy Neural Network for Approximate fuzzy reasoning

• Novel Neural algorithms for solving fuzzy relation equations

• Methods for simplification of fuzzy models

• A new approach of neurofuzzy learning algorithm

• Neural networks in intelligent data analysis

• Data Driven identification of key variables

• Applications of intelligent techniques in process analysis

• Adaptive genetic programming for system identification

BOOK:

Intelligent hybrid systems: fuzzy logic, neural networks, and genetic algorithms, By Da

Ruan, Kluwer academic Publishers 1997.

(11) INTELLIGENT PHYSICAL AGENTS

Agents in the World, Introduction: What Are Agents and How Can They Be Built? :

Introduction of Artificial Intelligence and Agents, Agents Situated in Environments, Brief

introduction to s/w agent technology, brief introduction about Individual Agents and

Multiagent Systems, Agent Modelling

Agent Architectures and Hierarchical Control : Agents , Agent Systems , Hierarchical

Control, Embedded and Simulated Agents, Acting with Reasoning, Agent and Acquaintance

Models

Agent Programming Platforms and Languages: The BDI Agent Architecture and Execution

Model, Jason, 3APL, JACK, JADE.

Agent based framework: conceptual framework, Model-Driven Architecture, view point

framework,

Applications of agents in the real world: Industry related like Business-to-Business E-

Commerce, Intelligent Lifestyle Applications like intelligent homes and Smart Music Player

BOOKS:

1. Intelligent software agents: foundations and applications by Walter Brenner, Rüdiger

Zarnekow, Hartmut Wittig Springer, 1998.

2. Agent-based hybrid intelligent systems: an agent-based framework for complex

problem Solving By Zili Zhang (Ph.D.), Chengqi Zhang, Springer 2005.

(12) KNOWLEDGE MODELLING AND MANAGEMENT

• Knowledge modelling technology

• Industrial evolutions w r t knowledge management

• State of the art of enterprise modelling

• Enterprise knowledge architecture

• Knowledge modelling for industrial application

• Introduction and application domain

• Complexity: an emergent organizational paradigm in the knowledge based economy

• The epistemology of knowledge

• The complexity paradigm for a networked system

• Knowledge management and management learning: what computers can still do

• The influence of knowledge structures on the usability of knowledge systems

BOOK:

1. Active Knowledge Modeling of Enterprises By Frank M. Lillehagen, Frank Lillehagen,

John Krogstie, Springer 2008

2. Knowledge management and management learning: extending the horizon of knowledge

based management By Walter R.J. Baets, Springer 2005

http://www.google.co.in/search?tbo=p&tbm=bks&q=+inauthor:%22Walter+Brenner%22

http://www.google.co.in/search?tbo=p&tbm=bks&q=+inauthor:%22R%C3%BCdiger+Zarnekow%22

http://www.google.co.in/search?tbo=p&tbm=bks&q=+inauthor:%22R%C3%BCdiger+Zarnekow%22

http://www.google.co.in/search?tbo=p&tbm=bks&q=+inauthor:%22Hartmut+Wittig%22

(13) OPEN SOURCE OPERATING SYSTEM

Introduction: open Source, Free Software, Free Software vs. Open Source software, Public

Domain Software, FOSS does not mean any cost. History : BSD, The Free Software

Foundation and the GNU Project. Open Source Development Model Licences and Patents:

What Is A License, Important FOSS Licenses (Apache, BSD, GPL, LGPL).

Open source operating system: Overview of Open Source operating systems, Introduction

to Linux and Unix, Flavours of *NIX Operating systems.

Introduction to Linux: File system, Shell and Kernel,vi editor, shell variables, command line

programming.

Filters and commands: Pr, head,tail,cut,paste,sort,uniq,tr,join,etc,grep,egrep,fgrepetc.,

sed,awk etc.,granting and revoking rights.Any other relevant topic.

BOOKS:

1. Brian W. Kernighan, The Practice of Programming, Pearson Education.

2. Bach Maurice J, Design of the Unix Operating system, PHI.

3. Daniel P. Bovet, Understanding the Linux Kernel, Oreilly.

(14) PARALLEL PROCESSING

Pipeline and Vector Processing: Non linear and linear pipelining, Multiprocessor,

Multicomputer, Super computer. Array Processors. Scope and Application of Parallel

approach.

Paradigms of parallel computing: SIMD, Systolic; Asynchronous - MIMD, reduction

paradigm. Hardware taxonomy: Flynn's classifications, Handler's classifications.

PRAM model and its variants: EREW, ERCW, CRCW, PRAM algorithms, Sorting network,

Interconnection RAMs. Parallelism approaches - data parallelism, control parallelism.

Parallel Processors: Taxonomy and topology - shared memory mutliprocessors, distributed

memory networks. Processor organization - Static and dynamic interconnections.

Embeddings and simulations.

Performance Metrices: Laws governing performance measurements. Metrices - speedup,

efficiency, utilization, cost, communication overheads, single/multiple program

performances, bench marks.

Scheduling and Parallelization: Scheduling parallel programs. Loop scheduling.

Parallelization of sequential programs. Parallel programming support environments.

BOOKS:

1. M. J. Quinn.Parallel Computing: Theory and Practice, McGraw Hill, New York,

1994.

2. T. G. Lewis and H. El-Rewini. Introduction to Parallel Computing, Prentice Hall, New

Jersey, 1992.

3. T. G. Lewis.Parallel Programming: A Machine-Independent Approach, IEEE

Computer Society Press, Los Alamitos.

4. Sima and Fountain, Advanced Computer Architectures, Pearson Education.

5. Mehdi R. Zargham, Computer Architectures single and parallel systems, PHI.

6. Ghosh, Moona and Gupta, Foundations of parallel processing, Narosa publishing.

7. Ed. Afonso Ferreira and Jose’ D. P. Rolin, Parallel Algorithms for irregular

problems - State of the art, Kluwer Academic Publishers.

8. Selim G. Akl, The Design and Analysis of Parallel Algorithms, PH International.

(15) ROBOT MOTION PLANNING

Introduction to the field of robotics: fundamental ideas about robotics, types of robot,

Applications, limitations, mathematical position and orientation in 3-space.

Modelling and representation: 3D transformations and geometry, forward and inverse

kinematics, investigation of kinematics to velocities and static forces.

Control methods: Introduction to control theory, subsumption based architecture, linear

control method, non-linear control methods, methods of programming.

Optimal and model predictive control: markov decision processes, sensing, hidden markov

model, interpreting motion, kalman filtering and particle filtering.

BOOKS:

1. Robot motion planning By Jean-Claude Latombe, Kluwer Academic Publishers

2. Introduction to Robotics: Mechanics and Control (3rd Edition), John J. Craig (Author)

3. Introduction to Autonomous Mobile Robots, Roland Siegwart and Illah R. Nourbakhsh

(TheMITpress)

4."Control of Robot Manipulators" , Lewis, Abdallah, and Dawson

(16) SOCIAL NETWORKS AND SEMANTIC WEB

UNIT I

Web Intelligence

Introduction to Intelligent Web and its Applications, Information Age and World

Wide Web, Limitations of Today’s Web, The Next Generation Web, Machine Intelligence,

Artifical Intelligence, Ontology, Inference engines, Software Agents, Berners-Lee World

Wide Web, Semantic Web and Logic on the semantic Web.

Knowledge Representation for the Semantic Web

Introduction to KR, Ontologies and their role in the semantic web,

Ontologies Languages for the Semantic Web –Resource Description Framework(RDF) / RDF

Schema, Ontology Web Language (OWL), UML, XML/XML Schema

UNIT II

Ontology Engineering

Ontology Engineering, Constructing Ontology, Ontology Development Tools, Ontology

Methods, Ontology Sharing and Merging, Ontology Libraries and Ontology Mapping

Semantic Web Applications, Services and Technology

Semantic Web applications and services, Semantic Search, e-learning, Semantic

Bioinformatics, Knowledge Base, XML Based Web Services, Creating an OWL-S Ontology for

Web Services, Semantic Search Technology.

UNIT III

Social Network Analysis

What is networks analysis? Development of Social Networks Analysis, Key concepts and

measures in network analysis – The global structure of networks, Macro-structure of social

networks, Personal networks

Electronic Sources for Network Analysis

Electronic Discussion networks, Blogs and Online Communities, Web-based networks.

Modeling and aggregating social network data

UNIT IV

Developing social-semantic applications

Building Semantic Web Applications with social network features, Flink: the social

networks of the Semantic Web community, Evaluation of web-based social network

extraction.

TEXT BOOKS:

• Thinking on the Web - Berners Lee, Godel and Turing, Wiley interscience, 2008.

Social Networks and the Semantic Web, Peter Mika, Springer, 2007.

REFERENCES:

1. Semantic Web Technologies, Trends and Research in Ontology Based Systems, J.

Davies, Rudi Studer, Paul Warren, John Wiley & Sons.

2. Semantic Web and Semantic Web Services -Liyang Lu Chapman and Hall/CRC

Publishers, (Taylor & Francis Group)

3. Information sharing on the semantic Web - Heiner Stuckenschmidt; Frank Van

Harmelen, Springer Publications.

4. Programming the Semantic Web, T. Segaran, C.Evans, J.Taylor, O’Reilly, SPD.

(17) SOFTWARE AGENTS AND SWARM INTELLIGENCE

• Brief Introduction to S/W agent Technology

• Agent & AI

• Practical design of intelligent agent System

• Intelligent Agent application Area

• Biological Foundations of Swarm Intelligence

• Swarm Intelligence in Optimization

• Routing protocols for next-generation network Inspired by collective Behaviours of

insects societies: An overview

• An Agent based approach to self organised production

• Organic Computing and Swarm Intelligence

BOOKS:

1. Intelligent software agents: foundations and applications by Walter Brenner, Rudiger

Zarnekow, Hartmut Witting Springer, 1998.

2. Swarm intelligence: introduction and applications By Christian Blum, Daniel Merkle.,

Springer 2008.

(18) WEB TECHNOLOGY

Course Description: This course is an overview of the modern Web technologies used for the Web development. The purpose of this course is to give students the basic understanding of how things work in the Web world from the technology point of view as well as to give the basic overview of the different technologies. The topics include (although in some cases briefly): History of the Web, Hypertext Markup Language (HTML), Extensible HTML (XHTML), Cascading Style Sheets (CSS), JavaScript, and Extensible Markup Language (XML). We will follow the guidance of the World Wide Web Consortium (W3C) to create interoperable and functional websites. Overall Course Objectives: Upon completion of this course the student will be able to: 1. Describe and explain the relationship among HTML, XHTML, CSS, JavaScript, XML and other web technologies; 2. get familiar with W3C standards and recommendations; 3. create and publish a basic web page using HTML and its many tags; 4. describe limitations of creating interactivity including browser support and differences; 5. describe the difference between Java and JavaScript; 6. understand and use JavaScript variables, control structures, functions, arrays, and objects; 7. learn and modify CSS properties using JavaScript; 8. find out what are XML syntax, elements, attributes, validation etc. ; 9. utilize HTML, XHTML, CSS, XML, and JavaScript to develop an interactive web site.

central university of rajasthan - curaj.ac.in · pdf filehindi, italian, russian, spanish) 2 1...

Documents