Natiional Institute of Technology Agartala

Department of Mathematics
BT
TMT in Computational Mathematics

Proposeed Course Structure of Dual Degree course

On
BT
TMT in Computational Mathematics

Seemester – 1st 22 – Credits

Engineering Mathemattics-I 100 2 1 0 3
Engineering Physics – I 100 3 0 0 3
Engineering Chemistryy – I 100 3 0 0 3
Basic Electrical Engineeering (Gr.I) / Basic Electronics (Gr.II) 100 3 0 0 3
Engineering Mechanicss-I (Gr.I) / Disaster Management (Gr.II) 100 3/2 1/0 0/0 4/2
Communication in English (Gr.I) / Introduction to
100 3 0 0 3
Programming (Theory)) (Gr.II)
Chemistry Laboratory (Gr.I) / Engineering Physics Lab (Gr.II) 50 0 0 2 1
Workshop Practice (Grr.I) / Engineering Graphics (Gr.II) 50 0/1 0/0 2/2 1/2
Basic Electrical Labboratory (Gr.I) / Basic Electronics
50 0 0 2 1
Laboratory (Gr.II)
Computer Programmin ng Laboratory (Gr. II) 50 0 0 2 0/1
NSS / NCC - 0 0 3 0

emester – 2nd
Sem 21 – Credits

Engineering Mathemattics – II 100 2 1 0 3

Engineering Physics – II
I 100 3 0 0 3

Engineering Chemistryy – II 50 2 0 0 2

Basic Electronics(Gr.I)) / Basic Electrical Engineering (Gr.II) 100 3 0 0 3

Disaster Management (Gr.I)

( / Engineering Mechanics-I (Gr.II) 50 2/3 0/1 0/0 2/4
Introduction to P
Programming (Theory) (Gr.I) / 100 3 0 0 3
Communication in Eng glish (Gr.II)
Engineering Physics La
ab (Gr.I) / Chemistry Lab (Gr.II) 50 0 0 2 1

Engineering Graphics(G
Gr.I) / Workshop Practice (Gr.II) 50 1/0 0/0 2/2 2/1

Computer Programminng Laboratory (Gr. I) 50 0 0 2 1

Basic Electronics Laaboratory (Gr.I) / Basic Electrical 50 0 0 2 1/0
Laboratory (Gr.II)
NSS / NCC - 0 0 3 0

Page No. 1 of 4
 Natiional Institute of Technology Agartala
Department of Mathematics
BT
TMT in Computational Mathematics

Seemester – 3rd 22– Credits

Probability and Statistiics 100 3 1 0 4
Mathematical Analysis 100 3 1 0 4
Differential Equation 100 3 1 0 4
Discrete Mathematics aand Fuzzy set theory 100 3 1 0 4
Data Structure and Alggorithm (Theory) 100 3 1 0 4
Data Structure and Alggorithm (Practical) 50 0 0 2 2
Seemester – 4th 23 – Credits
Algebra 100 3 1 0 4
Numerical Analysis 100 3 1 0 4
LPP and Game Theory
y 100 3 1 0 4
Computer Organization
n 100 3 1 0 4
Object Oriented Prograamming (C++ and Python) (Theory) 100 3 1 0 4
Object Oriented Prograamming (C++ and Python) (Practical) 50 0 0 2 3
th
Seemester – 5 19 – Credits
Soft Computing 100 3 1 0 4
Integral Transform 100 3 1 0 4
Financial Mathematics 100 3 1 0 4
Statistical Inference 100 3 1 0 4
Scientific Computing (P
Practical) 100 0 0 3 3
(Student Activity – 1)
Industrial Training-1 / Internship-1 (during summer vacation minimum 15days)
Seemester – 6th 22 – Credits
Graph Theory 100 3 1 0 4
Number Theory and Crryptography 100 3 1 0 4
Design and Analysis of Algorithms 100 3 1 0 4
Machine Learning and Data Mining 100 3 1 0 4
Data Base Management
nt System (Theory) 100 3 1 0 4
Data Base Management
nt System (Practical) 50 0 0 2 2
th
Seemester – 7 16– Credits
Randomized Algorithm
m 100 3 1 0 4
Image Processing 100 3 1 0 4

Page No. 2 of 4
 Natiional Institute of Technology Agartala
Department of Mathematics
BT
TMT in Computational Mathematics

Optimization Techniqu
ues 100 3 1 0 4
Stochastic Processes 100 3 1 0 4
(Student Activity – 2)
Industrial Training-2 / Internship-2 (during summer vacation minimum 15days)

Seemester – 8th 25 – Credits

Formal Language and Automata
A Theory 100 3 1 0 4
Artificial Intelligence 100 3 1 0 4
Deep Learning 100 3 1 0 4
Elective – I 100 3 1 0 4
Engineering Economics and Accountancy
Computer Networks and Security (Theory)
Non stationary data analysis
Operations Research-I
Mathematical Modeling and Simulation-I
Compiler Design
Dissertation – I 100 0 3 0 3
Grand Viva-I 100 0 0 3 3
Seminar Presentation-II 100 0 0 3 3
th
Seemester – 9 18 – Credits
Complexity Theory and
d Approximation Algorithm 100 3 1 0 4
Social Media Data Anaalysis (Theory) 100 3 1 0 4
Big Data Analytics (Praactical) 50 0 0 2 2
Elective – II 100 3 1 0 4
Data Communication
Human Computer Interaction
Operations Research-II
Mathematical Modeling and Simulation-II
Elective –III 100 3 1 0 4
Operating system
Deecision Theory and Computational Statistics
Stochastic Calculus
Mobile Computing

Page No. 3 of 4
 Natiional Institute of Technology Agartala
Department of Mathematics
BT
TMT in Computational Mathematics

mester – 10th
Sem 17– Credits
Option – 1
Dissertation – II 200 0 10 0 10
Grand Viva-II 100 0 0 4 4
Seminar Presentation-III 100 0 0 3 3

Option – 2
Industrial Project 200 0 0 10 10
Project Seminar 100 0 0 3 3
Grand Viva-II 100 0 0 4 4

1st Semester = 222 – Credits

nd
2 Semester = 221 – Credits
3rd Semester = 222 – Credits
th
4 Semester = 223 – Credits
5th Semester = 119 – Credits
th
6 Semester = 222 – Credits
th
7 Semester = 116 – Credits
th
8 Semester = 225 – Credits
th
9 Semester = 118 – Credits
th
10 Semester = 117 – Credits
Total = 205
2 – Credits

BT -170 Credits
MT - 35 Credits

Page No. 4 of 4
NATIONAL IN
NSTITUTE OF TECHNOLOG
GY
AGARTALA

DEPARTM
MENT OF MATHEMATICS

SYLLABUS

FOR

BTMT

IN

COMPUTA
ATIONAL MATHEMATICS
 BTMT
COMPUTATIIONAL MATHEMA
ATICS
1sts SEMESTER

2
 Engineering Mathematics - I

1. Infinite series: Convergence of S

Sequence, Bounded Sequence, Monotonic Sequence, Convergent,
Divergent and Oscillatory Series, Geometric
G Series, Positive term series, p-series, Com
mparison Test,
D'Alembert's Ratio tests, Raabe's Test, Gauss's Test, Cauchy's Integral Test, Cauch hy's Root test,
Logarithmic Test.

2. Calculus of function of one varriable: Limit and continuity of functions, Uniform continuity and
differentiability, successive differen
ntiation, Leibnitz's theorem, Rolle's theorem, Mean Value
V theorems
and Taylor's theorem, expansion oof functions into Taylor's and Maclaurin's series, Indeterminate
forms, Curvature, Asymptotes, Con ncavity, Convexity and point of inflexion.

3. Function of Several Variables: Limit,

L Continuity, Partial Derivatives, Chain Rule, Differentiation
of Implicit functions, Exact Differeentials, Euler's theorem on homogeneous function an nd its converse,
Tangent planes and Normal planes,, Maxima, Minima and Saddle points, Simple probleems in extrema
of functions with constraints, Methood of Lagrangian Multipliers.

4. Ordinary Differential Equation:: First order ordinary differential equation, Linear equations and
Bernoulli's equation, Ordinary lineaar differential equation of nth order, Solution of hom
mogeneous and
non-homogeneous equations, Operaator method, method of undetermined coefficients aand variation of
parameters, Solution of simple ssimultaneous ordinary differential equation. Seriees solution of
differential equation.

5. Laplace Transform: Transforms of elementary functions, Inverse transforms, properrties of laplace

transform, Convolutions, Transform ms of periodic functions, unit step functions, shiffting theorems,
Solution of ODE's using transformss.

Text/Reference Books:-

a) M. D. Raisinghania. Ordin inary and Partial Differential Equation, S. Chandd, 19th Edition,
2017.
b) S. C. Malik and S. Aroraa, Mathematical Analysis, New Age International Publisher, 5th
Edition, 2017.
c) H. K. Das, Advanced Enginneering Mathematics, S. Chand, 1st Edition, 1988.
d) B. V. Ramana, Higher Engineering
En Mathematics, Tata McGraw Hill Edu ucation (India)
Private Limitd, 20th Editionn, 2013.
e) E. Kreyszig, Advanced Enginneering Mathematics, Wiley, 10th Edition, 2015.

Engineering Physics - I

1. Mathematical Preliminary: Vector Differentiation, Scalar and Vector Field ds, Directional
Derivatives, Vector Differential Operator,
O Gradient, Divergence, Curl, Line, Surfacee and Volume
integrals and their applications, Greeen’s theorem.

2. Electromagnetics: Gauss’s Theeorem of Electrostatics, Ampere’s law, Magneto statiics and laws of
Electromagnetic Induction, Self and
d Mutual induction, Concept of Displacement Curreent, Difference

3
between Conduction Current and d Displacement Current, Eddy Current, Maxwelll’s Equations,
Propagation of Electromagnetic Waves in Free Space, Solution of propagattion of Plane
Electromagnetic Wave in free spacce and medium, Eddy Current, Concept of Field Eneergy (Poynting
Vector)

3. Oscillations and Waves: Planne progressive wave, Energy of waves, Reverberaation, Sabine’s
law(derivation), Damped Vibrationn:-differential equation and solution, critical dampinng, logarithmic
decrement, analogy with electricaal circuit, Forced damped Vibration, Amplitude and Velocity
Resonance, sharpness of resonance and quality factor, applications of oscillatory motion
ns.

4. Interference: Coherence (tempooral and spatial), Fresnel’s Bi-prism, Conditions fo or interference,

Techniques of obtaining interferencce: Interference of Light due to division of wave fronnt, Interference
of Light due to division of amplitudde; Newton’s Ring, colour of thin film.

5. Diffraction: Types of Diffractioon; Fresnel and Fraunhofer, Difference between In nterference and
Diffraction, Zone plate; positive and
an Negative Zone plates, action of zone plate as a convex lens,
Fraunhofer Diffraction at a Single S
Slit and Double slit, Plane transmission diffraction grating
g spectra,
Comparison between Prism and Gra rating Spectra, Resolving Power and limit of resolutiion, Rayleigh’s
criterion, Resolving Power of Microoscope, Telescope and prism.

6. Polarization: Polarization, typess of polarized light, polarizer and analyzer, Effect oof polarizer on
natural light, Effect of analyser on plane polarized light-Malus Law, Nicol’s Prrism; Polaroid,
Anisotropic crystal; Birefringencee, calcite crystal; Huygens’ explanation of doub ble refraction;
Huygens’ construction of wave frronts; experimental determination of principal refrractive indices;
phase difference between o – ray and e – ray; superposition of waves linearly pollarized at right
angles; Conditions for obtaining llinearly polarized light, circularly polarized light and
a elliptically
polarized light, retarders or wave pllates; Babinet Compensator.

Reference Books

1. D. J. Griffith, Introductioon to Electrodynamics, PHI Pubs.

2. G. B. Arfken and H. J. Weber, Mathematical Methods for Physicists, Elseevier Academic
Press. 3. H. J. Pain, The Phhysics of Vibrations and Waves, John Wiley and Sonss Ltd.
4. A. Ghatak, Optics, Tata M Mc Graw Hill.
5. Optics, E. Hecht, Pearsonon.
6. F. A. Jenkins and H. E. White,
W Fundamentals of Optics, Tata Mc Graw Hill.

Engineering Chemistry - I

a) Chemical Bonding: - Ionic an nd Covalent bonds; Valence Bond Theory (V.B.T) of covalency-
atomic orbital and their overlap, hyybridization of orbitals definition types and associatted geometries,
VSEPR theory, shapes of simple mo molecules like-H2O, CO2, NH3, CH4,C2H6, C2H2 BF3, B PCl5, SF6
in the light of the hybridization state
s of the central atom and VSEPR effects; Molecular Orbital
Theory (M.O.T)- concept of mo molecular orbital, molecular orbital energy levell diagrams of
homonuclear diatomic molecules-H He2,O2, N2 and molecular ions, determination of bo ond order, bond
length and magnetic properties fro om M.O diagrams; Noncovalent interactions- van dder Waals and
hydrogen bonding and their effect over physical properties of different substances, m metallic bonds-
Electron sea model.
4
b) Fuels: - Definition and classifica
cation of fuels; Characteristics of a good fuel, compaarison between
solid, liquid and gaseous fuel; Callorific value of fuels- definition, units, higher and lower calorific
value, determination of the calorificc value of a solid fuel by bomb calorimeter; Solid fueel- coal, origin,
types, proximate and ultimate anaalysis of coal; Liquid fuel- petroleum, origin, refining of crude,
cracking, synthetic petrol, Fischeer-Tropsch and Bergius method for the synthesis of gasoline,
knocking

c) Water: Introduction; Hardness oof Water- cause, types, units, disadvantages of using hard water for
domestic and industrial purposes ( e.g., scale and sludge formation in boilers, causticcembitterment,
boiler corrosion etc.), softening off hard water ( lime-soda, permutit and ion exchan nge processes);
Chemical analysis of Waterestima mation of free chlorine, total alkalinity, hardness and dissolved
oxygen, numerical based on determ mination of hardness.

d) Pollution and its control:-- Pollution- introduction, air pollutants, particculates, smog,
photochemical smog, acid rain, grreen house effects, depletion of ozone layer, analyysis of gaseous
effluents-oxides of nitrogen, oxidess of sulphur and H2S, control of air pollution- particuulate emission,
gaseous pollutants, water pollution-- arsenic pollution and its remedies. Chemical analyysis of effluent
liquid streams, BOD, COD.

e) Electrochemistry: - Arrhenius theory of electrolytic dissociation, classification oof electrolytes;

degree of dissociation of acids, disssociation constant of weak acids, Debye-Huckel theoory, concept of
pH and pOH, buffer solutionss, solubility product, common ion effect, co onductance of
solutionsspecific, molar and equivaalent conductance, variation of molar conductance with
w dilution for
strong and weak electrolytes; Migrration of ions- Kohlrausch's law of independent miggration of ions,
Ostwald's dilution law; transport nu
umber, Nernst equation for single electrode, electroch
hemical cells.

f) Polymer Chemistry: - Introduct ction, types of polymerization, classification of polyymers based on

chain characteristics, source, meth hod of synthesis and molecular forces involved, mechanism of
polymerization reaction: cationic, anionic
an and catalytic polymerization; glass transition and crystalline
melting point temperatures, Facto tors influencing glass transition and crystalline melting point
temperatures. Preparation, propertiees and uses of the Polyethylene, PVC, Polystyrene,, PAN, Teflon,
Nylon- 6:6, polyester ; Rubber- moonomer, structure, compounding of rubber, vulcanizaation, synthetic
rubbers- Buna-S, Buna-N, neoprenee, butyl rubber and polyurethanes

Reference books:

1. Jain and Jain, Engineerinng Chemistry; 15th Edition,

2. Engineering Chemistry; Wiley
W - India.
3. S. S Dara, S chand Publissher, A Text Book of Engineering Practical Chemisttry .
4. Sashi Chawla, A text boo ok of Engineering Chemistry;
5. S. S Dara, S chand Publissher, A Text Book of Engineering Chemistry;
6. A. K Dey, Environmentaal Chemistry, John Wiley.

Basic Electrical Engineering

Basic circuit analysis methods:

Kirchhoff‟s laws, mesh and nodal aanalysis. Network Theorems: Superposition theorem,, Thevenin-
Norton theorem, maximum powertrransfer theorem, star-delta transformation.

5
AC circuit analysis:

AC fundamentals, phasor diagrams,, Power in ac circuits, Series AC circuit and parallel AC circuit,
Resonance, Network analysis methoods, Poly-phase circuit.

Basics of Electrical Machines:

Basic principle of generator and mootor, emf induced in a coil, concept of rotating magneetic field,
introduction to transformer.

Reference Books:

ngineering Fundamentals‟, Phi Learning, 2nd Editionn, 2014.

1. Vincent Del Toro, „Electrical Eng

2. D. P. Kothari and I. J. Nagrath, „B

„Basic Electrical Engineering‟, McGraw Higher Ed., 3rd Edition,
2009.

3. K.V.V. Murthy and M.S.Kamathh, „Basic Circuit Analysis‟, 1st Edition (reprinted witth corrections)
Jaico publishing, 1998.

4. W.H. Hayt and J.E. Kemmerley, „Engineering Circuit Analysis‟, Int. St. Ed.(4th) MccGraw Hill,
1986.

5. S.K.Bhattacharya, 'Electrical Maachines', Tata McGraw Hill Publishing company Ltd

d., second
Edition, 2007

6. I. J. Nagrath and D. P. Kothari, 'E

Electric Machines', Tata McGraw Hill, 1985

Engineering Mechanics -I

Force Systems and Equilibrium

Force moment and couple, princiiple of transmissibility, Varignon's theorem. Resu ultant of force
system- concurrent and nonconcurrrent coplanar forces, free body diagram, equilibrium
m equations and
their uses in solving elementary enggineering problems.

Plane trusses

Analysis of plane trusses and plan ne frames (Analytical and graphical methods). Meethod of joints,
methods of sections, graphical methhod.

Friction

action problems involving fraction related to practicall application.

Coulumb's laws of fraction, belt frac

Moment of Inertia and plane figu

ure:-

6
Moment of Inertia of a plane figuree with respect to an axis in its plane, Moment of Inerttia with respect
to an axis perpendicular to the planne of the figure. Parallel axis theorem, perpendicularr axis theorem.
Polar moment of inertia

Moment of inertia of material bod

dies:

Mass moment of inertia in case of ddisc cone cylinder sphere slender rod

Centre of gravity of rigid body

Centre of gravity of right circular coone, cylinder,hemisphere and composite rigid body.

Virtual work :

Work of a force principle of vi virtual work and itsapplication, Constriction of force

f polygon,
Raydiagram, Funicular polygon, Maxwelldiagrams. Mass moment of inertia in case of disc,
cone,cylinder, sphere slender rod.

Text/Reference Books:

1. Timoshenko and Young, Engineeering Mechanics.

2. R.S. Khurmi , A text Book of Eng

ngineering Mechanics.

3. R.K. Bansal , A text Book of Enggineering Mechanics.

Communication in English

Pronunciation, Vocabulary Extennsion, basic aspects of language skills, modees of writing,

comprehension, composition, wordd-order, structure of words etc. The fundamentalss of Grammar,
textual pieces for literary appreciattion, non-traditional materials, newspaper articles, advertisements,
a
notice writing, Soft Skills Developmment etc.
The following textual pieces from ""English for All" by Nilanjana Gupta, published by Mac M Millan:

Text/Reference Books: -

1. Shakespeare's Sister by Virginia W

Woolf

2. Scientific Research for Amateurs

rs by J.B.S. Haldane

3. When I Have Seen by William Sh

hakespeare

4. Lines Written in Early Spring byy William Wordsworth

5. On His Blindness by John Milton

n

6. Prospice by Robert Browning

7. After Twenty Years by O' Henry

8. The Adventures of the Blue Carbbuncle by Arthur Conan Doyle

7
 Basic Electrical Laboratory

List of Experiments:

urces.
1) Study of different Electrical sour

2) Verification of Thevenin‟s theore

rem.

3) Verification of Norton‟s theorem

m.

4) Verification of Maximum powerr transfer theorem.

5) Verification of Superposition theeorem.

6) Extension of meter range.

7) Study of characteristics of Fluoreescent lamp and Incandescent lamp.

8) Characteristics of R-L circuit, R--C circuit, R-L-C series circuit with AC source.

9) Determination of insulation resisstance by using Megger.

10) Study of different transformer cconnections.

11) Transformer testing

12) Starting of induction motor

9
 BTMT
COMPUTATIIONAL MATHEMA
ATICS
2nnd SEMESTER

10
 Engineering
E Mathematics - II

1. Matrices: Algebra of matricees, Vector spaces, linear dependence of vectors, basis, Linear
Transformations, Rank and inverrse of a matrix, Solution of algebraic equation ns, consistency
conditions, Hermitian, skew- Herm
mitian and Unitary matrices, by-linear form, eigen value
v and eigen
vectors. Cayley-Hamilton theorem.

2. Complex numbers: Exponentiaal complex numbers and logarithm of a complex nu

umber, circular,
hyperbolic and inverse circular funcctions of complex numbers.

3. Function of a Complex Varriable: Limit, continuity and differentiation, Anaalytic function,

Cauchy- Riemann equations, Conjuugate functions, Application to two dimensional probblems, Taylor's
and Laurent's expansions, Branch points, zeros, poles, residues, Cauchy's Integral th
heorem, simple
problems on Contour Integration.

4. Integral Calculus: Improper Inntegrals, Beta and Gamma function. Double and Triple Integrals,
Jacobians and transformation of co--ordinates.

5. Vectors: Scalar and vector trip ple product, space curves, Seret - Frenet formulaa, velocity and
acceleration simple problems, mom ment of force, work done, angular velocity, relative velocitysimple
applications. Vector function of one variable, vector differentiation and integraation, gradient,
divergence and curl ---Applicationns. Stoke's theorem, Green's theorem, Gauss divergeence theorem -
simple applications to areas, Volum
mes and center of Pressure.

Text/Reference Books:

1. Malik and Arora, Mathematical A

Analysis:

2. H.K.Dass., Advanced Engineerin

ng Mathematics

3. B.V.Ramana. Higher Engg. Mathhematics

4. E. Kreyszig , Advanced Engineerring Mathematics.

5. G.B.Thomas and R.L.Finney, Cal

alculus and Analytic Geometry:

6. M.L.Khanna , Vector Calculas

11
 Engineering Physics - II

1. Introduction to Quantum Meechanics: Blackbody Radiation, Planck’s Radiation Formula, de

Broglie’s hypothesis, Davisson Germer Experiment, Stern-Gerlach Experiment, Heisenberg’s
uncertainty principle and its applicaation, Wave packets, Phase velocity and group veloccity, probability
current density, Operators, Hermitiaan operators, expectation 1values, Interpretation of wave function,
Postulates of quantum mechanics, Orthogonal and orthonormal functions, Schröding ger equation in
one dimensional problems, Particlle in a box, Eigen values and Eigen function, staationary states,
Tunneling problems, Bound States.

2. Relativity: Reference Frames, Michelson - Morley Experiment and its consequeences, Lorentz
Transformation, Postulates of Rellativity, Relativistic Mass and Mass-Energy Equiivalence, Time
Dilation, Length Contraction, Relati
tivistic Kinematics, Principle of Simultaneity, Twin Paradox.
P

3. Concepts of Solids: Statisticaal distributions, M-B, B-E and F-D statistics and d their simple
applications, Planck’s radiation law
w, Degenerate Fermi Gas. Crystallographic planes, reeciprocal lattice
and miller indices, Inter-planer spaacing (cubic system only), Bragg’s diffraction, Lauee’s equation of
X-ray diffraction, Crystal structuree analysis, Lattice Vibration, Electrons in a crystalline solid, free
electron theory, electronic conductioon in solids, Band theory of solids, Kronig - Penny model.
m

4. Introduction to Laser and Opttical Fibre: Spontaneous and stimulated emission, Einstein’s A-B
coefficients, Meta - Stable states, population
p inversion, basic principle of laser (three aand four level),
optical cavity and resonator, Ruby and
a He-Ne laser, holography. Propagation of light in n fibre, step and
graded index fibre, numerical aperrture, attenuation in optical fibre, introduction of op ptical window,
application of laser and optical fibree.

Reference Books:

1. A. K. Ghatak and S. Lokanathan,, Quantum Mechanics, Macmillan India Ltd.

2. R. Eisberg and Resnick, Quanttum Physics of Atoms, Molecules, Solids, Nuclei and Particles,
Wiley India Pvt. Ltd.

3. Robert Resnick, Introduction to Special

S Relativity, John Wiley and Sons.

4. F. Reif, Statistical Mechanics, Mc Graw Hill.

5. B.K. Agarwal, Elements of Statisstical Mechanics

6. Kittel, Introduction solid State Ph

hysics, Willy Eastern Limited

7. K. Thyagrajan, A. Ghatak, Laserss, Fundamentals and Applications, Springer Pub.

8. D. J. Griffiths, Introduction to Q
Quantum Mechanics, Pearson

9. M. Ali Omar, Elementary Solid State

S Physics: Principles and Applications, Pearson Pub.
P

Engineering Chemistry –II

(a) Cement: - Introduction, classiffication; Portland Cement definition, raw materialss, manufacture,
ideal composition and physical reequirement according to I.S code, chemical constitution of the
12
finished product, setting and hardedening, heat of hydration; Special Cements- high-aalumina, white
portland, water-proof cements etc.

(b) Refractories: - Definition, objeective of using, classification based on chemical natuure; Properties-
refractoriness, strength, dimension onal stability, chemical inertness, thermal expan nsion, thermal
conductivity, porosity, spalling, elec
ectrical conductivity etc. and interrelations between tthem; selection
of good refractory; Common Refracctory Bricks- silica, fireclay, high alumina, magnesite and zirconia
bricks, properties and uses.

(c) Corrosion: - Introduction, definnition, classification; Dry Corrosion factors effectingg dry corrosion,
mechanism, types, oxidation corroosion, Pilling-Bedworth rule, corrosion by other gaases, hydrogen
related corrosion, liquid metal corro
rosion; Wet Corrosion- types, chemical corrosion, faactors affecting
chemical corrosion, mechanism off wet corrosion- electrochemical mechanism, evoluttion of H2 and
absorption of O2 types; Differentiaal aeration theory, passivity, pitting, waterline and sttress corrosion;
Corrosion Control purification, alloy
oying, application of protective coatings, cathodic prootection etc.

(d) Lubricants: - Introduction; MMechanism- thick-film, thin-film and extreme pressu ure lubrication;
Classification of Lubricantslubricaating oils, greases and solid lubricants, their propeerties, use and
additives required (e.g., anti-oxidaants, corrosion preventers etc.); Properties of Lub bricating Oils-
viscosity, flash and fire-point, clooud and pour point, oiliness, carbon residue, anilline point etc.;
Cutting fluids.

(e) Thermochemistry: - Differentt types of energy and other definitions; Endothermiic/ Exothermic
Reactions and Energy Diagrams; thermochemistry stoichiometry, enthalpy, standarrd enthalpy of
formation and reaction, Hess's Law,, heat of solution, heat of neutralization.

Text/Reference Books:

1. Jain and Jain, Engineering Chemi

mistry; 15th Edition.

2. Engineering Chemistry; Wiley - IIndia.

3. S.S Dara, S chand Publisher, A Text

T Book of Engineering Practical Chemistry.

4. Sashi Chawla, A text book of Eng

ngineering Chemistry

5. S.S Dara, S Chand Publisher, A Text

T Book of Engineering Chemistry.

6. A.K Dey, Environmental Chemisstry, John Wiley.

7. Ashim K Das, Environmental cheemistry with Green chemistry, Books and Allied Pvtt. Ltd.

8. Vanloon Duffy, Environmental Chemistry,

C 2/E, Oxford University Press.

9. O. G. Palanna, Engineering Chem

mistry, Tata Mc-Graw Hill Education Private Ltd. Neew Delhi.

13
 Basic Electronics

Elementary Physics of Semicondu

uctor Material

PN Junction Diode- Operation Characteristics and Modelling, Zener Diode- O Operation and
Application; Diode Rectifiers, Filteers, Clipper, Clamper. BJT Operation and Characterristic, NPN and
PNP transistor, BJT biasing, Diffeferent circuit configurations with Circuit Models. Introduction
I to
JFET Operation, Main Carriers in BJT
B and FET and Characteristics.

Operational Amplifiers

Inverting and Non inverting Conffiguration and its Common Applications IC-555 T Timer Circuit-
Astable, Monostable and Bistable O Operations. Cathode Ray Oscilloscope. Elementary
y Construction,
Connections for Viewing Signals,, Measuring Voltage, Frequency and Time Perio od. Elementary
Physics of Opto-electronic Devicess like LED, LCD Devices, Photo-Diode, PhotoTranssistor, LDR, 7-
segment Display, Opto isolators.

Text/Reference Books: -

1. Vladimir V.Mitin, Viatcheslav A

A. Kochelap, Michael A. Stroscio, Introduction to Naanoelectronics -
Science, Nanotechnology,Engineeriing and Application, Cambridge University Press.

2. D. De and K. P. Ghatak , Basic E

Electronics, Pearson Education.

3. R.F. Pierret, Semiconductor Deviice Fundamentals, Pearson Education.

4. Robert F Pierret and Gerold W

W.Neudeck , Modular Services on Solid State Deevice, Addison
Wesley Publishing Company

5. K. Sedra and Smith, Microelectrronic Circuits , Oxford

6. D. Carlo and Lin , Linear Circuitt Analysis, Oxford University Press

Disaster Management

Elements of Engineering Seismoloogy:- Earthquake occurrence in the world, causes of o Earthquake,

Plate tectonics, Earthquake mech hanism, seismic zoning map of India and its usse. Earthquake
phenomenon:- Focus, Epicenter, seeismic waves, magnitude, intensity scale its corelatiion assessment
and Do's and Don's for protection n of life and property during disaster. Landslides:- Geo-technical
aspects of landslides and control off Landslide Hazard. Flood:- Flood control as a measure of Disaster
Management and Mitigation Cycloone and Fire:- Cyclone Disaster Mitigation and ensu uring wind and
fire hazard safety during disaster.

Text/Reference Books:

1. A.K.Mukhopadhay, Crisis and

d Disaster Management Turbulence and Aftermaath, New Age
International Publishers.

2. H.N.Srivastava, S.N. Bhattachary

ya. G.D.Gupta, Earthquake Geography and Managem
ment, New Age
International Publishers.

14
3. Thomas D. Schneid, Larry Colllins, Disaster Management and Preparedness, Lew
wis Publishers,
2001.

4. C. V. R. Murty, IITK-BMTPC C Earthquake Tips: Learning Seismic Design and

d Construction,
National Information Centre of Eartthquake Engineering.

Introduction to Programming(Th
heory)

BASIC OF COMPUTERS:

Computer fundamentals: Bits and Bytes , CPU, Memory, Input and output devicess, I/O devices,
operating system, Application software's , Number system- Decimal, Binary, B Octal,
Hexadecimal.Need for high level lan
anguages, Program design using flow charts

C LANGUAGE PRELIMINARIE
ES:

C character set, Identifier and keyw

words, data types, declaration, expression, statementss and symbolic
constants.

Pre-processor commands: #includde, #define, #ifdef

Input-Output: getchar, putchar, sca

canf, printf, gets,puts.

Operators and expressions: Arrithmetic, unary,assignment, logical, conditional, and bit wise
operators.

Control statements: if else, for, whhile, do-while, switch, break, continue, nested loops.

Storage types: Automatic, externall, register andstatic variables.

Functions : Definiting and acccessing , Passing arguments, Function prototypees, Recursion,

Libraryfunctions, Static functions.

Arrays: Definiting and processing, Passing arrays to a function, Multi-dimension arrayss.

Pointers: Basic concepts, malloc, pointer

p and arrays, simple single linked list example.

Text/Reference Books:

1. Introduction to Computer Sciencee- ITL Education Solutions Limited , Pearson Educaation

2. Paul Deitel , C How to Program -5th Edition, PHI.

3. Dennis Ritchie and Brian Kernigh

ghan, The C Programming Language, PHI.

4. Behrouz A. Forouzan, Richarrd F. Gilberg, Computer Science: A Structured Programming

Approach Using C , Course Techno
ology

5. Gottfried, Byron S, Programming

g with C , TMH

Engineering Physics Lab

15
List of Experiments

1. To study the linear motion under virtually frictionless conditions using Linear Air Traack.

2. Determination of the Co-efficiennt of viscosity of a liquid from its rate of flow throu
ugh a capillary
tube.

3. Construction of one ohm coil.

4. Determination of the frequency of

o a tuning fork by Melde’s apparatus.

5. Determination of acceleration due to gravity (g) by a Kater’s pendulum. 6. Measurementof

M
unknown wavelength of a laser withh a diffraction grating

Engineering Graphics

Drawing instruments and their usees, lines, lettering and dimensioning, scales, plainss and diagonal
scale, curves used in engineeriing practice, ellipse, parabola, hyperbola, cycloid, involutes
orthographic projection, planes off projection, four quadrant, first angle projection, reference line,
convention employed. Projection oof points and lines, true length, true inclinations with reference
plane, traces of a line, end view, and illustrative problems. Projection of planes, traaces, end view
planes perpendicular to one inclinened to other reference planes. Projections of solid such as prism,
pyramid, cone, cylinder, cube etc.

Text/Reference Books:

1. N.D. Bhatt , Elementary Engineer

ering Drawing (Plane and solid geometry).

2. R.B Gupta , A text Book of Engin

neering Drawing.

3. K.Venugopal , A text Book of Enngineering Drawing.

4. N.D. Bhatt, Machine Drawing.

5. R. K. Dhawan , A text Book of Machine

M Drawing (In first angle projection)

Com
mputer Programming Laboratory

Programming simple problems exerrcising different features of C.

Basic Electronics Laboratory

Selected experiments based on Baasic Electronics.

1) Study of characteristics of transsistor indifferent modes i.e. common a emitter, com

mmon base and
common collector configuration.

2) Experiments on class-A, class-B

B and AB of transistor power amplifiers.

16
3) Experiment on uncontrolled Diodde-Bridge rectifier.

4) Determination of hybrid parametters of a transistor.

5) Characteristics of JFET, MOSFE

ET.

Mono-stable, Bistable and a-stable multi vibrators using bipolar

6) Study of characteristics of Mo
transistors.

7) Experiment on Schmitt Trigger C

Circuit.

8) Study of LED, photo-Diodes, Phhoto-Transistors, Light Development Resistors and OptoIsolators.

O

Text/Reference Books: -

1. Vladimir V.Mitin, Viatcheslav A.

A Kochelap, Michael A. Stroscio, Introduction to Naanoelectronics -
Science, Nanotechnology,Engineeriing and Application, Cambridge University Press.

2. D. De and K. P. Ghatak , Basic E

Electronics, Pearson Education.

3. R.F. Pierret, Semiconductor Deviice Fundamentals, Pearson Education.

4. Robert F Pierret and Gerold W

W.Neudeck , Modular Services on Solid State Deevice, Addison
Wesley Publishing Company

5. K. Sedra and Smith, Microelectro

onic Circuits , Oxford

6. D. Carlo and Lin , Linear Circuitt Analysis, Oxford University Press

17
 BTMT
COMPUTATIIONAL MATHEMA
ATICS
3rd
r
SEMESTER

18
 BTMT 3rd Semester
[Compulsory]

Probability and Statistics

Probability
Introduction

Random experiment, σ-field, samplle space, probability as a set function, probability ax

xioms, probability
space, finite sample spaces, condittional probability, Baye’s theorem, independence, random
r variables
(discrete and continuous), cumulaative distribution function, probability mass funcction, probability
density function, mathematical ex xpectation, moments, moment generating functioon, characteristic
function, function of two random vaariables.

Discrete Distribution

Uniform, binomial, Poisson, geomeetric, negative binomial, hyper geometric distributionn.

Continuous Distribution

Uniform, normal, exponential, gamm

mma distribution.

Joint Distribution Function

Joint cumulative distribution functio

ion and its properties, joint probability density functiion, marginal and
conditional distribution, expectatioion of function of two random variables, momeents, covariance,
correlation coefficient, independennt random variables, joint moment generating functtion (JMGF) and
calculation of covariance from JMG GF, characteristic function, conditional expectation, linear regression
for two variables, regression curvess, bivariate normal distribution.

Statistics
Introduction

Markov and Chebyshev’s inequalitty, convergence in probability, statement and interppretation of weak
law of large numbers and central limit theorem for independent and identically distributed random
variables with finite variance.

Sampling and Sampling Distributtion

Population and sample, random samample, distribution of the sample, simple random saampling with and
without replacement, sample characcteristics.

Sampling Distribution

Statistic, sample moments, sampl ple variance, sampling from the normal distributtion, Chi-square,
Student’s t distribution and F-distribbution.

19
Estimation of Parameters

Point estimation and interval eestimation, mean-squared error, properties of good

g estimators:
unbiasedness, consistency, suffici
ciency, Minimum Variance Unbiased Estimator (MVUE) (only
definition).

Method of Maximum Likelihood

Likelihood function, ML estimatorss for discrete and continuous models.

Bivariate Frequency Distribution

Bivariate data, scatter diagram, coorrelation, linear regression, principle of least squarres and fitting of
polynomials and exponential curvess.

Reference Books

a) W. Feller, An Introduction to Probability Theory and Its Application, Wiley, 3rd Edition, 1970.
b) R. V. Hogg, J. W. McKean and Allen T. Craig, Introduction to Mathematiical Statistics,
Pearson Education, Asia, 20000.
c) R. L. Berger and G. Casella,, Statistical Inference, Duxbury Thomson Learning, 2nd Edition,
2002.
d) Meyer and Meyer, Introduct ctory Probability and Statistical Applications, Oxfxford and IBH
nd
Publishing, 2 Edition, 20177.

e) N.G. Das, Statistical Methodss, Combined Edition (vol. I and II), Mc. Graw Hilll Education, 1st
Edition, 2017.

********

BTMT 3rd Semester

[Compulsory]

Mathematical Analysis

Point Set Topology

Limit points of a set and isolated ppoint of a set, closed sets, dense sets, countable and uncountable sets,
neighbourhood of a point, interiorr point, open set, union, intersection of open sets and closed sets,
Bolzano-Weierstrass theorem, seriies and sequence, Abel’s test, Dirichlet’s test, Mertens’
M theorem,
Abel’s theorem, limit of a function.

Metrics and Norms

Metric spaces, normed vector spacees, convergence in metric spaces, continuous functionns, completeness,
20
Baire Category theorem, contractiion mapping theorem, connectedness, intermediatee value theorem,
compactness, Heine-Borel theorem..

Integration

Function of bounded variation, Riem emann-Stieltjes integral and relation with Riemann inntegral, Darboux-
Stieltjes integral, mean value theoreems.

Sequence and Series of Functions

Sequence and series of functions, uniform

u convergence, power series, Fourier series, D
Dirichlet’s Kernel,
Riemann-Lebesgue theorem, pointw wise convergence of Fourier series of functions of bounded variation,
Weierstrass approximation theoremm, equicontinuity, Arzela-Ascoli theorem.

Reference Books

a) K. R. Stromberg, Introduction
n to Classical Real Analysis, Wadsworth Internationa
al, Springer, 1981.
b) J. M. Howie, A First Course in
i Real Analysis, Springer, 2001.
c) H. L. Royden, Real Analysis, Macmillan
M USA, 3rd Edition, 1988.
d) R. G. Bartle and D. R. Sherbeert, Introduction to Real Analysis, Wiley, 4th Edition, 2011.
e) S. C. Malik, Principles of Reaal Analysis, New Age International Publishers, 1st Eddition, 2017.
f) S. K. Mapa, Introduction to Reeal Analysis, Sarat Book Distributor, 8th Edition, 20119.
g) Shanti Narayan and M. D. Raiisinghania, Elements of Real Analysis, S. Chand, 19665.

********

BTMT 3rd Semester

[Compulsory]

Differential Equation

Ordiinary Differential Equation (ODE)

Introduction

Introduction, formation of ODE, significance of ODE, geometrical and physical consideration,

solution of ODE in separable form.

First Order ODE

Exact and non-exact differential equations, simultaneous equations, first order lin near equations,
Bernoulli’s equation, first order higgher degree equations solvable for x, y and p, Clairraut’s form and
singular solutions.

21
Second Order ODE

Linear differential equations with constant coefficients, homogeneous and non-homo

ogeneous linear
ordinary differential equations of higher order, complementary function, method off undetermined
coefficients, series solution.

Parrtial Differential Equation (PDE)

Introduction

Origin of PDE, order, degree, linear

ar, non-linear, surfaces and curves, classification of ffirst order PDE,
quasi-linear equations, derivation off PDE.

Linear PDE

Solutions of PDE of order one: Laggrange’s solution (type 1, type 2, type 3 and type 4), separation of
variables.

Non-linear PDE

Complete integral, particular integrral, singular integral, general integral, solution of non-linear
n PDE:
Charpit’s method.

Reference Books

a) W. E. Boyce and R. C. Dii Prima, Elementary Differential Equations and Boundary

B Value
Problems, Wiley India, 9th E
Edition, 2009.
b) E. A. Coddington, An Introdduction to Ordinary Differential Equations, PHI Learrning, 1999.
c) M. Braun, Differential Equaations and Their Applications, Springer-Verlag, 3rd E
Edition, 1983.
d) T. Amarnath, An Elementaryy Course in Partial Differential Equations, Alpha Science International
Ltd, 2nd Edition, 2003.
e) P. Hartman, Ordinary Differrential Equations, John Wiley and sons, New York, 1964.
1
f) M. Hirsch, S. Smale and R. DDeveney, Differential Equations, Dynamical System
ms and Introduction
to Chaos, Academic Press, 2nd Edition, 2004.
g) I. N. Sneddon, Elements of P
Partial Differential Equations, Dover, 2006.
ations, Wiley India, 3rd Edition, 1984.
h) S. L. Ross, Differential Equa
i) R. Haberman, Elementaryy Applied Partial Differential Equations with Fo ourier Series and
Boundary Value Problem, P Prentice Hall, 4th Edition, 1998.
j) L. C. Evans, Partial Differenntial Equations, American Mathematical Society, Rhhode Island, 1998.
k) F. John, Partial Differentiall Equations, Narosa Publishing House, New Delhi, 11979.
l) M. D. Raisinghania, Ordina
ary and Partial Differential Equation, S. Chand, 201
17.

********

22
 BTMT 3rd Semester
[Compulsory]

Discretee Mathematics and Fuzzy Set Theory

Set Theory

Sets and classes, relations and funcctions, recursive definitions, posets, lattice, Zorn’s leemma, cardinal
and ordinal numbers.

Logic

Propositional and predicate calculuus, well-formed formulae, tautology, equivalence, normal forms,
theory of inference.

Combinatorics

Permutation and combination, partition,

p Pigeonhole principle, Inclusion-Exclussion principle,
generating functions, recurrence rela
lations.

Fuzzy Sets

Fuzzy sets, support of fuzzy set, 𝛼--level sets, strong and weak 𝛼-cut, fuzzy point, convvex fuzzy sets,
basic set theoretic operations on fuuzzy sets, cartesian products, algebraic products, bou
unded sum and
difference, probabilistic sum of fuz
uzzy sets, t-norms and t-conorms, quasi-coincidencee of two fuzzy
subsets and fuzzy points, fuzzy nummbers, triangular and trapezoidal fuzzy numbers.

Reference Books

a) C. L. Liu, Elements of Discrette Mathematics, Tata McGraw-Hill, 2nd Edition, 20000.

b) G. Bojadzieve and M. Bojaadzieve, Fuzzy Sets, Fuzzy Logic Applications, Wo orld Scientific,
Illustrated Edition, 1996.
c) G. J. Klir, U. S. Clair and B.
B Yuan, Fuzzy Set Theory: Foundation and Applica ation, Prentice
Hall, 1997.
d) H. J. Zimmermann, Fuzzy Sett Theory and Its Applications, Kluwer Academic, 3rd Edition, 1992.
e) es, Logic and Computability, Jones and Bartlett, 3rd E
J. L. Hein, Discrete Structures Edition, 2010.
f) J. P. Tremblay and R. Maanohar, Discrete Mathematical Structures with Applications
A to
Computer Science, McGraw H Hill Education, 1st Edition, 2017.
g) K. H. Rosen, Discrete Mathem matics and Its Applications, Tata McGraw-Hill, 6th E Edition, 2007.
h) L. H. Tsoukalas and R. E. Uhhrig, Fuzzy and Neural Approaches in Engineering, JJohn Wiley and
Sons, 1997.
i) N. Deo, Graph Theory, Prenttice Hall of India, 1974.
j) V. K. Balakrishnan, Introducttory Discrete Mathematics, Dover Publication, 20100.

********

23
 BTMT 3rd Semester
[Compulsory]

Data Structure and Algorithm (Theory)

Basic concepts

Mathematical background, compleexity analysis. Arrays: one dimensional, multi-ddimensional, sparse

matrix, elementary operations, asym
mptotic notations- o, O, θ, Θ, ω, Ω and their propertiees.

Preliminaries

Growth of functions, recurrence relelation, generating functions, solution of difference equations, Master's
theorem (without proof), sorting annd order statistics: bubble sort, merge sort, heap sort, quick sort, sorting
in linear time, median and order stat
atistics.

Linear Data Structure

Stacks: representation, elementary operations

o and applications such as infix to postfix, postfix evaluation,
parenthesis matching. Queues: siimple queue, circular queue, dequeue, elementaary operations and
applications. Linked lists: linear, ciircular and doubly linked lists, elementary operations and applications
such as polynomial manipulation.

Non-Linear Data Structure

Trees: binary tree representation, tree traversal, complete binary tree, heap, binary search tree, height
balanced trees like AVL tree and trries, red-black tree, other operations and applicationns of trees. Graphs:
representation, adjacency list, graph
h traversal, path matrix, connected components, DA AG, topological sort,
spanning tree, radix sort. Searchingg: linear and binary search. Hashing: hash tables, haash functions, open
addressing.

File Structures

Introduction, data file types, file org

ganization, file access methods.

Reference Books

a) Alfred V. Aho, Jeffrey D. Ullman, John E. Hopcroft, Data Structures and Algorithms,
A Addison
Wesley, 1983.
b) M. A. Weiss, Data Structurees and Algorithm Analysis in CTT, Addison-Wiesley, 3rd Edition, 2013.
c) A. M. Tenenbaum, Y. Langs gsam, and M. J. Augenstein, Data Structures Using C, C PHI, New Delhi,
2009.
d) S. K. Srivastava, Data Strucctures Through C in Depth, BPB Publications, 2004..
e) T. H. Cormen, C. E. Leisers orithms, 3rd Edition,
rson, R.. L. Rivest and C. Stein, Introduction to Algo
PHI, 2009.
f) D. Samanta, Classical Data a Structure, PHI Pvt. Ltd., 2011.
********

24
 BTMT 3rd Semester
[Compulsory]

Data S
Structure and Algorithm (Practical)

1. Write a C-program for a treee DFS in matrix form.

2. Write a C-program for impllementation of linked list.
3. Write a C-program for impllementation of linked queue.
4. Write a C-program to displaay a single linked list.
5. Write a C-program to displaay a record in ascending and descending order using linked list.
6. Write a C-program to add and display records (name and enrolment no.) in a double linked
list.
7. Write a C-program to displaay a record using linked list.
8. Write a C-program to displaay all the operations in a stack.
9. Write a C-program to insertt, delete, peek and display elements in a queue.
10. Write a C-program to displaay the adjacency matrix of a graph.
11. Write a C-program to displaay the nth term of Fibonacci series by iteration and reecursion.
12. Write a C-program Tower of o Hanoi.
13. Write a C-program to insertt and delete node in a tree.
14. Write a C-program to consttruct an AVL tree.
15. Write a C-program to impleement the depth-first search algorithm.
16. Write a C-program to read and
a display a 2D matrix of integers, its transpose.
17. Write a C-program to multiiply two matrices.

Reference Books

a) T.H. Cormen, C.E. Leiserso on, R.L. Rivest and C. Stein, Introduction to Algorithhms, PHI, New
rd
Delhi, 3 Edition, 2009.
b) D. Samanta, Classical Data Structure, PHI Pvt. Ltd., 2011.
c) Alfred V. Aho, Jeffrey D. Ulllman, John E. Hopcroft, Data Structures and Algorrithms, Addison
Wesley, 1983.
d) M.A. Weiss, Data Structurees and Algorithm Analysis in CTT, Addison-Wesleey, 3rd Edition,
2013.

********

25
 BTMT 4th Semester
[Compulsory]

Algebra

Abstract Algebra

Groups, permutation group, symm metric group, subgroups, coset, normal subgroup p, centralizers,
normalizers, stabilizers, kernels, cy
yclic groups, subgroups generated by a subset of a group,
g quotient
groups, Lagrange’s theorem, homomorphisms,
h isomorphism theorems, compo osition series,
epimorphism, endomorphism, auto tomorphisms, rings, ring homomorphisms, Booleaan ring, ideal,
quotient ring, ring embeddings, inttegral domain, properties, fields with examples, chaaracteristic of a
field, properties of field.

Linear Algebra

Vector spaces, bases and dimennsions, change of bases and change of coordinat ates, sums and
direct sums, spanning sets and iindependence, the dimension of a vector space, e, existence of
eigen values, eigen vectors, eigen
n space, generalized eigenvectors, the complexifiication of a real
vector space, quotient space, linearr transformations, the kernel and image of a linear ttransformation,
the rank and nullity theorem, channge of bases for linear transformations, solvabilityy of system of
linear equations.

Reference Books

a) S. Axler, Linear Algebra Done RRight, Springer International Student Edition, 2nd Edition, 1997.
b) K. Hoffman and R. Kunze, Lineear Algebra, Prentice Hall Int. Inc., Englewood Cliff ffs, 2nd Edition,
1971.
c) S. Lang, Algebra, Addison-Wesl sley, 3rd Edition, 1999.
d) J. A. Gallian, Contemporary Ab bstract Algebra, Narosa, 4th Edition, 1999.
e) M. Artin, Algebra, Prentice Halll inc., 1994.
f) I. N. Herstein, Topics in Algebrra, John-Wiley, 1995.
g) M. T. Nair and A. Singh, Linearr Algebra, Springer, 2018.
h) D. S. Dummit and R. M. Foote, Abstract Algebra, John-Wiley, 2nd Edition, 1999.

********

BTMT 4th Semester

[Compulsory]

Numerical Analysis

Error Analysis

Definition and sources of errors, propagation of errors, backward error analysis, sensitivity
s and
conditioning, stability and accuracy
y, floating-point arithmetic and round-off error.

27
Algebraic and Transcendental Eq
quation

Nonlinear equations, bisection meth hod, secant method, Newton's method and its varian
nts, fixed point
iterations, convergence analysis, Neewton's method for non-linear systems.

Interpolation

Finite differences, polynomial inteerpolation, Hermite interpolation, spline interpolattion, b-splines,

numerical differentiation.

Numerical Integration

Trapezoidal and Simpson's rulees, Newton-Cotes formula, Gaussian quadraturee, Richardson

extrapolation.

Ordinary Differential Equation

Taylor series method, Picard’s iter

erative method, Euler and modified Euler methodss, Runge-Kutta
methods, multistep methods, pred dictor-corrector methods, accuracy and stability, finite element
method, finite difference method.

Reference Books
a) James L. Buchanan and Peter
P R. Turner, Numerical Methods and Analysis, McGraw-Hill,
M 1992.
b) John H. Mathews, Numer erical Methods for Mathematics, Science and Engiineering, Prentice-
Hall, 2nd edition, 1992.
c) Kendall E. Atkinson, An Inntroduction to Numerical Analysis, John Wiley and Sons,
S 1989.
d) M. K. Jain, S. R. K. Iyen ngar, R. K. Jain, Numerical Methods for Scientificc and Engineering
Competition, Wiley Easterrn, 1985.
e) Methods of Numerical Analysis, PHI, 5th Edition, 201
S. S. Sastry, Introductory M 12.

********

BTMT 4th Semester

[Compulsory]

LPP and Game Theory

Linear Programming

Lines and hyperplanes, convex sets, convex hull and their properties. formulaation of a linear
programming problem, theorems dealingd with vertices of feasible regions and opttimality, graphical
solution, simplex method (includinng Big-M method and two phase method), infeasibble and unbounded
LPPs, alternate optima, dual probleem and duality theorems, dual simplex method and d its application in
post optimality analysis, revised sim
mplex method, sensitivity analysis, parametric progrramming.

28
Transportation Problem

Introduction, existence of solution

on, degeneracy, MODI method (including the theory), assignment
problem, Hungarian method for solvving assignment problems, travelling salesman probllem.

Introduction to Game Theory

Introduction, minimax (maximin), criterion and optimal strategy, solution of games with
w saddle points,
rectangular games without saddle ppoints – 2 × 2 games – dominance principle – m × 2 and 2 × n games
–graphical method.

Reference Books

a) K. Swarup, Operations Reesearch, Sultan Chand and Co., 2014.

b) S. D. Sharma ,Operations Research, Kedarnath, Ramnath and Co., 2002.
c) J. K. Sharma, Operation R
Research, MacMilan, 2006.
d) Hiller and Libermann, Intr
troduction to Operation Research, TMH, 2017.
e) Wayne L.Winston, Operati
tion Research, Thomson BrooCole, 2003.
f) H. A. Taha, An Introductioon to Operations Research, PHI, 2010.
g) J. G. Chakravorty and P.. R. Ghosh, Linear Programming and Game theoryy, Moulik Library,
2012.

********
BTMT 4th Semester
[Compulsory]

Computer Organization

Digital Logic

Boolean algebra, logic gates.

Computing and Computer

Evolution of computer: mechani nical era, electronic computers, integrated circu

uits, processor
architecture, system architecture.

Design Methodology

System design: system representaation, design process, gate level, register level: register level
components, programmable logic devices,
d register level design, the processor level: processor
p level
components, processor level designn.

29
Introduction to C++

Basic components of a C++, proogram and program structure, compiling and exxecuting C++
Program.

Tokens, Expressions and Controll Structures

Tokens, keywords, identifiers and constants, basic data types, user-defined and deriv ved, data types,
type compatibility, reference, variaables, scope resolution operator, type casting, implicit conversion,
operator precedence, control structuures, structure and function.

Classes and Objects Initialization

n

Class specification, class objects, accessing class members, data hiding, pointers within
w a class,
passing objects as arguments, friennd functions and friend classes, constant parameterrs and member
functions, structures and classes, sstatic members, constructors, destructor, constructo
or overloading,
order of construction and destructtion, constructors with default arguments, dynamic initialization
through constructors, constructors with dynamic operations, constant objects and con nstructor, static
data members with constructors and d destructors, nested classes.

Operator Overloading and Type C

Conversion

Defining operator overloading, oveerloading unary operators, manipulation of strings using

u operators,
rules for overloading operators, typee conversions.

Inheritance and Polymorphism

Deriving derived classes, single, m multilevel, multiple, hierarchical, hybrid inheritance, constructors
and destructors in derived classes,, constructors invocation and data members, initiallization, virtual
base classes, abstract classes, delegaation, pointers to derived classes, virtual functions, implementation
of run-time polymorphism, pure virrtual functions.

n
Fundamental Concepts of Python

Introduction to Python, history, uniqque features of Python, literals, variables and identiffiers, operators,
expressions and data types.

Control Structures

Selection control, iterative control.

Lists
List structures, lists (sequences), iteerating over lists.

31
Functions

turning functions, calling non value-returning functiions, parameter

Program routines, calling value-retu
passing, variable scope, dictionariess and sets, recursion, Python built in function, Pytho
on user defined
functions, Python packages functio ons, defining and calling function, the anonymous fuunctions, loops
and statement in Python, yield and ggenerators, Python modules and packages.

Text Files

Using text files, string passing, Pyt

ython exceptions handling, handling an exception try y, except, else,
try-finally clause, argument of an eexception, Python standard exceptions, raising an ex
xceptions, user-
defined exceptions.

Python Regular Expressions

Regular expressions, the match fuunction, the search function, matching vs searchinng, search and
replace, extended regular expressionns.

Reference Books

a) K. R. Venugopal, Rajkumar ar, T. Ravishankar, Mastering C++, TMH, 2006.

b) Lip man and Lajole, C++ P Primer, Addison Wesley, 5th Edition, 2012.
c) Bjarne Stroustrup, The C++ + Programming Language, Addition-Wesley, 4th Ediition, 2013.
d) Robert Leffore, Object Orie
iented Programming in C++, Galgotia Publications Pvt Ltd, 1999.
e) Balaguruswamy, Object Orriented Programming with C++, TMH, 7th Edition, 22017.
f) Timthy Budd, An Introductition to Object Oriented Programming with C++, Adddition-Wesley,
3rd Edition, 1991.
g) Kip R. Irvine, C++ and Objbject-Oriented Programming, Prentice Hall, 1st Editio
on 1996.
h) Kenneth A. Lambert, The Fundamentals
F of Python: First Programs, Course T Technology Inc,
2nd Edition , 2017.
i) Eric Matthes, Python C Crash Course: A Hands-On Project-Based Inntroduction to
Programming, No Starch P Press, 2nd Edition, 2019.
j) Paul Barry, Head-First Pytthon: A Brain-Friendly Guide, Shroff/O'Reilly, 2nd Ed
dition, 2016.
k) Zed Shaw, Learn Python thehe Hard Way, Addison-Wesley, 1st Edition, 2017.
l) Charles Dierbach, Introducction to Computer Science using Python a Computattional Problem
Solving Focus, John-Wiley and Sons, 2013.

*********

32
 BTMT 4th Semester
[Compulsory]

Object Orienteed Programming (C++ and Python) (Practical)

Programming in C++

Accessing class members, data hhiding, friend functions and friend classes, mem mber functions,
structures and classes, constructo ors, destructor, constructor overloading, dynamicc initialization
through constructors, operator ooverloading, overloading unary operators, overlooading binary
operators, manipulation of strings uusing operators, rules for overloading operators, typ
pe conversions,
single, multilevel, multiple, hieraarchical, hybrid inheritance, constructors invocattion and data
members, virtual base classes, abbstract classes, delegation, pointers to derived classes,
c virtual
functions, implementation of run-timme polymorphism, pure virtual functions.

Programming in Python

Literals, variables and identifiers, operators, expressions and data types, selection co ontrol, iterative
control, list structures, lists (sequennces), iterating over lists, program routines, calling value-returning
v
functions, calling non value-returni ning functions, parameter passing, variable scope, dictionaries
d and
sets, recursion, yield and generatorss, using text files, string passing, exception handling..

Reference Book

a) K. R. Venugopal, Rajkumarar, T. Ravishankar, Mastering C++, TMH, 2006.

b) Lip man and Lajole, C++ P Primer, Addison Wesley, 5th Edition, 2012.
c) Bjarne Stroustrup, The C++ + Programming Language, Addition-Wesley, 4th Ediition, 2013.
d) Robert Leffore, Object Orie
iented Programming in C++, Galgotia Publications Pvt Ltd, 1999.
e) Balaguruswamy, Object Orriented Programming with C++, TMH, 7th Edition, 22017.
f) Timthy Budd, An Introductition to Object Oriented Programming with C++, Ad ddition-Wesley,
rd
3 Edition, 1991.
g) Kip R. Irvine, C++ and Objbject-Oriented Programming, Prentice Hall, 1st Editio
on 1996.
h) Kenneth A. Lambert, The Fundamentals
F of Python: First Programs, Course T Technology Inc,
2nd Edition, 2017.
i) Eric Matthes, Python C Crash Course: A Hands-On Project-Based Inntroduction to
Programming, No Starch P Press, 2nd Edition, 2019.
j) Paul Barry, Head-First Pytthon: A Brain-Friendly Guide, Shroff/O'Reilly, 2nd Ed
dition, 2016.
st
k) Zed Shaw, Learn Python thehe Hard Way, Addison-Wesley, 1 Edition , 2017.
l) Charles Dierbach, Introducction to Computer Science using Python a Computattional Problem
Solving Focus, John-Wiley and Sons, 2013.

**********

33
 BTMT
COMPUTATIIONAL MATHEMA
ATICS
5tth SEMESTER

34
 BTMT 5th Semester
[Compulsory]

Soft Computing

Artificial Neural Networks

Neural networks: overview of bio iological neuro-system, mathematical models of neurons,

n ANN
architecture, learning rules, learningg paradigms: supervised, unsupervised and reinforceement learning.
ANN training algorithms: percep ptions, training rules, delta, multilayer perception n model, back
propagation algorithm, competitivee learning networks, Kohonen self organizing netw works, Hebbian
learning, Hopfield networks, associa iative memories, applications of artificial neural netw
works.

Fuzzy Logic

Introduction to fuzzy logic, linguiistic variables, linguistic modifiers, propositions of

o fuzzy logic,
measures of fuzziness, fuzzy infereence rules and fuzzy reasoning, fuzzification and defuzzification,
d
Mamdani- Sugeno inference rule, ap pproximate reasoning.

Population Based Optimization A

Algorithms

Genetic algorithms, evolution sstrategies, evolutionary programming, genetic programming,

differential evolution, selection, croossover, mutation, schema analysis, analysis of seleection, Markov
and other stochastic models, simulaated annealing, particle swarm optimization.

Reference books

a) J. S. R Jang, C.T. Sun and M

Mizutani E. Neuro, Fuzzy and Soft Computing, Pearrson Education
India, 1st Edition, 2015.
b) S. Haykin, Neural Networkks and Learning Machines, Pearson Education Ltd d., 3rd Edition,
2008.
c) Melani Mitchel, An Introduuction to Genetic Algorithm, MIT Press, 1996.
d) David Goldberg, Genetic Algorithm
A in Search, Optimization and Machine Learning, Addison
th
Wesley, 13 Edition, 1989.

e) Klir and Yuan, Fuzzy Sets aand Fuzzy Logic, Pearson, 1st Edition, 1995.

f) A. Das Bhattacharjee, Artif

ificial Intelligence and Soft Computing for Beginneers, Shroff/X-
Team, 3rd Edition, 2018.

g) H. J. Zimmermann, Fuzzyy Set Theory and Its Applications, Allied Publissher’s Limited,
Springer, 2nd Edition, 19911.
h) George Klir, Fuzzy Sets andd Fuzzy Logic: Theory and Applications, Pearson, 19995.

********

35
 BTMT 5th Semester
[Compulsory]

Integral Transform
Integral Transform

Basic concepts and definitions, integ

egral transform operator, kernel of the transformation
n.

Fourier Transform

Definition and properties of Foururier transform, Fourier sine and cosine transform m, convolution
theorem for Fourier transform, Parsseval’s identity, finite Fourier sine and cosine transfo
orm, inversion.

Laplace Transform

Laplace transform and its applicatioons.

Hankel Transform

Definition and properties of Hankekel transform with examples, inversion formula, baasic concept of
Bessel’s equation and Bessel’s ffunction, recurrence relations of Bessel’s functio on, operational
properties of Hankel transform, Parrseval’s theorem, Hankel transform of derivatives, ap
pplications.

Mellin Transform

Definition of Mellin transform andnd examples, Mellin transform of some special fun nctions, Mellin
transform of derivatives and integraals, Parseval’s theorem, convolution theorem, applicaations.

Z-Transform

Definition and properties of Z-trannsform, inverse Z-transform (using partial fraction and residues),
convolution theorem, formation off difference equations, solution of difference equations using Z -
transform.

Reference Books

a) I. N. Sneddon, The Uses of Integral

I Transforms, McGraw-Hill Inc., US, 1972.
b) C. J. Tranter, Integral Trannsforms in Mathematical Physics, Methuen and Co., 1959.
c) I. N. Sneddon, Fourier Trannsform, McGraw-Hill Book Company, 1951.
d) W.V. Lovitt, Linear Integrall Equations, Dover Publications Inc., Reissue Edition, 2005.
e) F.G. Tricomi, Integral Equaations, Dover Publications, 1985.
f) L.C. Andrews and B. K. Shhivamoggi, Integral Transforms for Engineers, Prentice Hall India
Learning Private Limited, 2003.
2
g) Dr. G. S. Sandhu, Integraal Transforms and Their Applications, First Worldd Publications,
2015.

36
 h) L. Debnath and D. Bhattta, Integral Transforms and Their Applications, Chapman and
Hall/CRC, 2nd Edition, 20066.

********

BTMT 5th Semester

[Compulsory]

Financial Mathematics

Introduction

Some basic definitions and terminollogy.

Basic Theory of Option Pricing

Single and multi-period binomial pricing models, Cox-Ross Rubinstein (CRR) moodel, Black-
Scholes formula for option pricing aas a limit of CRR model.

Stochastic Calculus

Brownian and geometric Brownian n motion, theory of martingales, stochastic calculus, stochastic
differential equations, Ito’s formulla to solve SDE’s, applications of stochastic calculus in option
pricing.

Mean-Variance Portfolio Theory

Markowitz model of portfolio optim

mization and Capital Asset Pricing Model (CAPM)), limitations
of Markowitz model and new measu ures of risk.

Interest Rates and Interest Rate Derivatives

D

Binomial lattice model, vasicek, hul

ull and white models for bond pricing.

Reference Books

a) Thomas Mikosch, Elemenntary Stochastic Calculus with Finance in vieew, World

Scientific, 1998.
b) Suresh Chandra, S. Dha armaraja, Aparna Mehra, R. Khemchandani, Financial
Mathematics: An Introducttion, Narosa Publishing House, Illustrated Editionn ,2013.
c) S. E. Shreve, Stochastic Caalculus for Finance, Vol. I and Vol. II, Springer, 1st Edition,
2004 .
d) Sean Dineen, Probability Theory in Finance: A Mathematical Guide to the t Black-
Scholes Formula, American n Mathematical Society, New Edition, 2006.
e) D. G. Luenberger, Investmeent Science, Oxford University Press, 2nd Edition, 2013.
f) M. Capińsky and T. Zasstawniak, Mathematics for Finance: An Introd duction to

37
 Financial Engineering, Sprringer, 2nd Edition, 2011.

********

BTMT 5th Semester

[Compulsory]

Statistical Inference

Parametric models, parameters, ranndom sample and its likelihood function, statistic an nd its sampling
distributions, problems of inferencce, overview of Bernoulli, binomial, Poisson, negaative binomial,
normal, exponential, gamma, Wei eibull, Pareto etc., concept of sufficiency, minim mal sufficiency,
Neyman factorization criterion, F Fisher information, maximum likelihood estimators, method of
moment estimators, percentile eestimators, least squares estimators, minimum mean squares
estimators, uniformly minimum vvariance unbiased estimators, Cramer-Rao lowerr bound, Rao-
Blackwell theorem, different exam mples, expectation maximization, statistical hypotheses-simple and
composite, statistical tests, critical regions,
r type-I and type-II errors, size and power of a test, Neyman
Pearson lemma and its different aapplications, most powerful test, uniformly most powerful test,
unbiased test and uniformly most uunbiased test, likelihood ratio test, interval estimation, confidence
intervals, construction of confiden nce intervals, shortest expected length, confidence interval, most
accurate one sided confidence intervval and its relation to uniformly most powerful test.

References Books

a) R. L. Berger and G. Casellaa, Statistical Inference, Cengage, 1st Edition, 2006.

b) E. L. Lehmann, G. Casella, Theory of Point Estimation Springer, 2nd Edition, 19998, (Corr. 4th
printing 2003 Edition, 2003 3).
c) T. S. Ferguson, Statistical D
Decision Theory, Academic Press, 2014.
d) E. L. Lehmann, Testing of SStatistical Hypotheses, Wiley–Blackwell, 1966.
e) P. J. Bickel and K. A. Doksusum, Mathematical Statistics, Chapman and Hall/CR RC, 2nd Edition,
2015.
f) J. O. Berger, Statistical DDecision Theory, Springer; 2nd Edition, 1985. (Corrr. 3rd printing
1993 Edition, 1993).

********

BTMT 5th Semester

[Compulsory]

Sccientific Computing (Practical)

Starting with MATLAB

MATLAB windows, arithmetic operations,

o elementary built-in-functions, elemennt by element
operations, scalar variables, compleex number, floating point arithmetic.

38
Array and Array Operations

Simple array, array addressing oor indexing, array construction, array orientation n, scalar array
Mathematics, array manipulation, array
a sorting, sub array searching, array size, array
y and memory
utilization, multidimensional array construction and its manipulation, numeric data typpe: integer data
type, floating point data types.

Script M file

Creating and saving script file, inpu

ut to a script file, running a script file.

Function and Function File

Creating a function file, structure off a function file, comparison between script and funcction file.

Cell Array and Structure

Cell array creation and its manipu ulation, retrieving cell array content, comma sepaarated list, cell
functions, cell array of strings, structure creation, structure manipulation, structture functions,
character string: string constructionn, string evaluation, string functions, cell array of strinngs.

Relational and Logical Operatorss

Relational and logical functions, opperator precedence. Control flow: for loops, while looops, if else end
construction, switch case constructiion, nested loop, break and continue command.

Application to Numerical Analysiis

Iterative method, bisection methodd, Newton Raphson method, Regula Falsi method, Graffe’s root
squaring method, power method, L.U. decomposition method, Romberg method, Muller M method,
Adams Moulton method, Newton’ss interpolation (forward and backward), Lagrange’ss interpolation,
divided difference method, numeriical differentiation (1st and 2nd Order), numerical integration, least
square method, Gauss eliminationn method, Gauss Seidal method, Jacobi iteration method,
m Runge
Kutta method, Euler method, Milnee’s method, Adams Bashforth method.

Reference Books

a) A. Gilat, MATLAB: An Introducction with Applications, John Wiley and Sons, 6th Eddition, 2016.
b) L.V . Fausett, Applied Numericaal Analysis Using MATLAB, Pearson Education, 2ndd Edition, 2016.
c) S. C. Chapra and R. P. Cana nale, Numerical Methods for Engineers, McGraw Hill,H 6th Edition,
2005.
d) R. Pratab, Getting Started with Matlab: A Quick Introduction for Scientists and Enggineers,
OUP USA, 7th Edition, 2016.
e) S. C. Chapra, Applied Numer erical Methods with Matlab for Engineers and Scientists,
S Tata
McGraw Hill, 2008.

********

39
 BTMT
COMPUTATIIONAL MATHEMA
ATICS
6tth SEMESTER

40
 BTMT 6th Semester
[Compulsory]

Graph Theory

Introduction to Graphs

The concept of a graph, paths in ggraphs, graph models, graph terminology and special types of graphs,
bipartite graphs, complete graphss, external graphs, intersection graphs, operationss on graph, graph
isomorphism.

Blocks

Cutpoints, bridges and blocks, blockk graphs and cutpoint graphs.

Trees

Introduction to trees and characterizzations, applications of trees, spanning trees, minim

mum spanning trees,
trees in computer science, centres and centroids, block cutpoint trees, independent cy ycles and cocycles,
matroids.

Connectivity

Connectivity and line-connectivityy, graphical version of Menger's theorem, traverssability : Eulerian

graphs, Hamiltonian graphs.

Coverings and Matching

Coverings and independence, criticcal points and lines, matching, maximum matching problem,
p minimum
covering problems.

Representing Graphs

Adjacency matrix, incidence matrixx, cycle matrix.

Planarity

Plane and planar graphs, outerplaanar graphs, Kuratowski's theorem, other characterrizations of planar
graphs.

Colorability

Vertex coloring, chromatic numbeer, edge coloring, five color theorem, four color conjecture, unique
colorable graphs.

41
Directed Graphs

Basic definitions, types of connecteedness, covers and bases, distance concepts and mattrices, connectivity,
acyclic digraphs, cycles and traversaability, orientations and tournaments.

Network Flows

Max flow - min cut theorem, Mengeer's theorem, Ford-Fulkerson algorithm.

Reference Books

a) F. Harary, Graph Theoryy, Narosa Publishing House, 7th Edition, 2001.

b) Ltd., 2nd Edition,
Douglas B. West, Introduuction to Graph Theory, Prentice-Hall of India Pvt. L
1999.
c) Narsingh Deo, Graph Thheory with Applications to Engineering and Computeer Science,
Prentice-Hall of India Pvvt. Ltd., New Edition, 1979.
d) K.R. Parthasarathi, Basicc Graph Theory, Tata McGraw-Hill Publ. Co. Ltd., 1994.
1
e) Bondy and Murty, Graphh Theory with Applications, Elsevier Science Ltd, 19776.

********

BTMT 6th Semester

[Compulsory]

Nu
umber Theory and Cryptography

Number Theory

Basis Representation

Principles of Mathematical inductioion, the basis representation theorem, the fundamen

ntal theorem of
arithmetic, Euclid’s division lemmaa, divisibility, the linear Diophantine equation.

Combinatorial and Computationaal Number Theory

Fermat’s little theorem, Wilson’s theorem, generating functions, the use of computters in number
theory, fundamentals of congruencees, basic properties of congruences, residue systems, riffling.

Solving Congruences

Linear congruences, the theorems of Fermat and Wilson revisited, the Chinese remaainder theorem,
polynomial congruences.

42
Arithmatic Functions

Combinatorial study of ∅(n), form

mulae for d(n) and ∅(n), multiplicative arithmetic functions, the
Mobius inversion formula, primitiive roots, properties of reduced residue systems, primitive root
modulo p.

Cryptography

Introduction

Basic objects of cryptography, secrcret-key and public-key cryptography, one-way andd trapdoor one-
way functions, cryptanalysis attack models, classical cryptography.

Block and Stream Ciphers

Modes of operation, DES and its variants,

v RCS, IDEA, SAFER, FEAL, BlowFish, AES,
A linear and
differential cryptanalysis, stream
m ciphers based on linear feedback shift reg
gisters, SEAL,
unconditional security.

Message Digest

Properties of hash function, MD2, M

MD5 and SHA-1, keyed hash function, attack on hash function.

Public Key Parameters

Modular arithmetic, GCD, primalityy testing, modular square root, finite fields.

Intractable Problems

Integer factorization problem, RS

SA problem, modular square root problem, discrete logarithm
problem, Diffie-Hellman problem, kknown algorithm for solving the intractable problem
ms.

Public Key Encryption

RSA, Rabin and EIGamalscemes, side channel attacks. Key exchange: Diffie-Hellm
man and MQV
algorithms.

Reference Books

ography, Theory and Practice, CRC Press, 2nd Edition, 2002.

a) Douglas R. Stinson, Cryptog
b) Alfred J. Menezes, Paul C C. Van Oorschot and Scott A. Vanstone, Handbo ook of Applied
Cryptography, CRC Press, 2001.
c) Johannes. A. Buchmann, In ntroduction to Cryptography, Springer, 1st Edition, 20
001.
d) Steven D. Galbraith, Matheematics of Public Key Cryptography, Cambridge Unniversity Press,
2012.
e) Jonathan Katz, Yehuda Lindell,
L Introduction to Modern Cryptography, Chapman and
Hall/CRC, 1st Edition, 20077.

43
 f) Jay R Goldman, The Queeen of Mathematics: A Historically Motivated Guiide to Number
Theory, A K Peters Ltd., 1st Edition, 1997.
g) Saban Alaca, Kenneth S W Williams, Introduction to Algebraic Number Theorry, Cambridge
st
University Press, 1 Editionn, 2004.
h) Richard A Mollin, Advanceed Number Theory with Applications, CRC Press, A Chapman and
Hall Book,1st Edition , 20177.
i) Kenneth. H. Rosen, Elemen on, 6th Edition,
entary Number Theory and Its Applications, Pearso
2011.
j) Kenneth Ireland and Michhael Rosen, A Classical Introduction to Modern Nu Number Theory,
Springer-Verlag, 5th Editionn, 1998.

******

BTMT 6th Semester

[Compulsory]

Deesign and Analysis of Algorithms

Introduction

Definition, asymptotic notations annd complexity analysis (best, worst, and average caase), notions of
optimality, amortize analysis.

Algorithm Design Techniques

Greedy, divide and conquer, dynaamic programming with examples, fractional knap psack and 0-1
knapsack problems, integer, matrix
x and polynomial multiplication, convex hull, closeest pairs, string
matching, FFT, extended Euclid's al
algorithm.

Graphs and Graph Algorithms

Definition, representations of graphphs, depth first search, breadth first search, Kruskaal’s and Prim’s
algorithm for minimum spanningg tree, Dijkstra’s single source shortest path algoorithm, Floyd-
Warshall all-pairs shortest path algo
orithm.

Computational Complexity

Introduction to NP completeness, the classes P and NP, polynomial reduction, NP P hard and NP
complete problems, introduction to branch-and-bound, backtracking and approximation
n algorithms.

Reference Books

a) Thomas. H. Corman, Chaarles E. Leiserson, Ronald L. Rivest and C. Stein, IIntroduction to

Algorithms, PHI Learningg Pvt. Ltd., 3rd Edition, 2010.
b) G. Brassard and P. Brattley, Fundamentals of Algorithms, Prentice Hall IIndia Learning
Private Limited, 2nd Editioon, 1996.
c) Alfred V. Aho, Jhon E. HoHopcroft and J. D. Ullman, The Design and Analysiis of Computer
Algorithms, Addison -Weslley Publishing Company, 1974.
d) E. Horowitz, S. Sahni andd S. Rajsekaran, Fundamentals of Computer Algorithms, Golgotia
Publications (P) Ltd , 2nd E
Edition , 2008.
********

44
 BTMT 6th Semester
[Compulsory]

Mach
hine Learning and Data Mining

Machine Learning

Introduction

Introduction to machine learnin ng. Supervised learning: regression and classifi

fication, linear
regression, logistic regression. Classification
C algorithms: minimum distance classsifier, nearest
neighbour, Baye’s classifier, neural
n classifier. Support vector machine, decision
de trees,
random forest.

Evaluation Measures

Precision, recall, F-measure, RO

OC curve.

Unsupervised Learning

K-means clustering, DBSCAN, hierarchical clustering, graph based clustering.

Learnability

Reinforcement learning, statistica

cal relational learning.

Dimensionality Reduction

Sequential forward and backwarrd search, singular value decomposition, principa

pal component
analysis.

Data Mining

Basic concepts on data mining aand knowledge discovery in data bases, relation n to statistics,
databases, steps in data mining ng process, architecture of a typical data minning systems,
classification of data mining g systems, overview of data mining tech hniques, data
preprocessing, data cleaning, daata integration, data transformation and data reeduction, data
generalization and summarizatio ion based characterization, a statistical perspec
ective on data
mining, association rules in largee databases, web mining, spatial mining, tempora
ral mining.

Reference books:

a) T.M. Mitchell, Machine Leaarning, Mc Graw Hill, 1st Edition,2017.

b) Kevin Murphy, Machine Learning: A Probabilistic Perspective, MIT Preess, Illustrated
Edition, 2012.
Adriaans, Data Mining, Addison-Wesley, 1st Edition, 1996.
c) Dolf Zantinge and Pieter A

45
 d) M.H. Dunham, Data Miniing Introductory and Advanced Topics, Pearson Education, 1st
Edition, 2006.
e) Jiawei Han and Michelin ne Kamber, Data Mining: Concepts and Techniiques, Morgan
rd
Kaufmann, 3 Edition , 201
11.
f) Charu C Agarwal, Data Miining- The Text Book, Springer, 2015.

********

BTMT 6th Semester

[Compulsory]

Datab
base Management System (Theory)

An Overview of Database

Database, database system, DBMS S components, data independence, data abstractionn, DDL, DML,
data dictionary, data integration, dat
atabase access method, advantages of using a DBMS..

Database System Architecture

Data models, schemas and instancees, DBMS architecture, data independence, database languages and
interfaces, database system environm
nment, classification of database management system
ms.

Data Model Using E-R Model and

d Object Model

High-level conceptual, data modeels, entity types, entity sets, attributes and keys,, relationships,
relationship types, roles and structtural constraints, weak entity types, refining the ERE design, ER
diagrams, naming conventions and design
d issues, subclasses, super classes, inheritance.

File Organization

Secondary storage devices, paralleelizing disk access using RAID technology, bufferring of blocks,
placing file records on disk, operatio
ions on files, files of unordered records (heap files), files
f of ordered
records (sorted files), hashing tecchniques, other primary file organizations, types of single-level
ordered index, multilevel indexes, dynamic multilevel indexes using B-Trees and B+ Trees, indexes
on multiple keys, other types of inde
dexes.

Relational Model

Relational model concepts, relationnal constraints and relational database schemas, upddate operations
and dealing with constraint violaations, basic relational algebra operations, additio onal relational
operations, relational calculus, tuplee calculus, domain calculus.

46
Relational Database Standard

Data definition, constraints, schemaa changes in SQL, basic queries in SQL, insert, dellete and update
statements in SQL, views (virtuaal tables) in SQL, specifying general constraintss as assertion,
additional features of SQL.

abase
Normalization for Relational Data

Functional dependencies, normal foorms based on primary keys: 1NF, 2NF, 3NF, Boycee-Codd normal
form, normalization through syntheesis, normalization using join dependency.

Database Design and Tuning

Database design process, physicaal database design in relational databases, databbase tuning in
relational systems.

Database Recovery and Security

Transactions, recovery concepts, transaction

tr recovery, system recovery, media recovery, recovery
technique, recovery in multi databaase systems, database security issues, access controll for multilevel
security, data encryption.

Advanced Topics

Object-oriented and object relatiional databases, logical databases, web databasees, distributed
databases, data warehousing and dat
ata mining, no SQL.

Reference Books

a) Ramez Elmasri and Shaamkant B. Navathe, Fundamentals of Database Systtems, Pearson

Education, 7th Edition , 2017.
b) Henry F. Korth, Databasase System Concepts, McGraw-Hill Publication, 6th E
Edition, 2013.
c) Raghu Ramakrishnan, JJohannes Gehrke, Data Base Management System,, McGraw Hill
Education, 3rd Edition, 22014.

********

BTMT 6th Semester

[Compulsory]

Databasse Management System (Practical)

SQL query programming, designing

g databases and accessing them for reasonably large applications.

Reference Books

a) R. Elmasri and S. Navathee, Fundamentals of Database Systems, Pearson, 6th E

Edition, 2010.

47
b) Abraham Silberschatz, H Henry Korth, and S. Sudarshan, Database Systtem Concepts,
th
McGraw-Hill, 6 Editionn, 2013.
c) Raghu Ramakrishnan, Da Database Management Systems, WCB/McGraw-Hilll, 3rd Edition,
2014.
d) Bipin Desai, An Introductiion to Database Systems, Galgotia Publications PVT
T LTD, 2012.
e) Serge Abiteboul, Richardd Hull and Victor Vianu, Foundations of Databaases., Pearson,
Facsimile Edition , 1994.

***********

48
 BTMT
COMPUTATIIONAL MATHEMA
ATICS
7tth SEMESTER

49
 BTMT 7th Semester
[Compulsory]

Randomized Algorithms

Introduction: what randomized allgorithms are, motivation for the design and use of
o randomized
algorithms, types of randomized algorithms (Las Vegas and Monte Carlo), polyn nomial identity
testing.

Events and probability, axioms off probability, the union bound, inclusion-exclusionn principle, the
balls and bins problem, conditionaal events, Bayes Law, Karger's randomized min-cu ut algorithm.

Discrete random variables (B Bernoulli, Binomial, Geometric), expectation, linearity of

expectation, coupon collector's problem, analysis of randomized quick sortt, conditional
expectation.

Markov's inequality, variance andd Chebyshev's inequality, randomized selection.

Chernoff-Hoeffding (CH) Boundss: derivation and different versions, load balancing, randomized
quicksort, packet routing in netwo
orks, skip lists.

The probabilistic method, the exp

pectation argument, max-cut, maxSAT, the samplle and modify
method, independent sets, secon nd moment method, threshold behavior in ran ndom graphs.
Derandomization: method of condditional expectations.

Lovasz local lemma, derivation an

nd the two versions, edge disjoint paths, satisfiability.

Algorithmic versions of the Lovaasz local lemma: Beck's algorithm, the algorithm of Moser and
Tardos. Distributed Maximal Indeependent Set (MIS) algorithms and the use of Beck's algorithm
in this context.

Randomized rounding to solve pr

problems in combinatorial optimization, maxSAT T, max-cut, set
cover. Randomized rounding of ssemi definite programs, introduction to semi definnite programs,
the Goemans-Williamson algorithm
hm for finding large cuts.

Markov Chains, applications to 2--SAT and 3-SAT, random walks on graphs, electrrical networks,
cover time, hitting time, s-t connecctivity algorithm.

Reference Books:

a) Rajeev Motwani, Prabhaka kar Raghavan, Randomized Algorithms, Cambridge University

st
Press, 1 Edition, 2004.
b) David Williamson, David Shmoys,
S The Design of Approximation Algorithmss, Cambridge
University Press, Illustratted Edition, 2011.
c) Devdatt Dubhashi, Alessan ndro Panconesi, Concentration Of Measure For The
T Analysis
ms, Cambridge University Press, New Edition, 20099.
Of Randomized Algorithms
********
50
 BTMT 7th Semester
[Compulsory]

Image Processing

Introduction

Image definition and its representaation, neighborhood. Orthogonal transformations lik

ke DFT, DCT,
wavelet.

Enhancement and Restoration

Contrast enhancement, smoothing aand sharpening, filtering and restoration.

Segmentation

Pixel classification, global/local graay level thresholding, region growing, split/merge techniques, edge
detection operators, Hough transforrm. Image feature/primitive extraction, component laabeling, medial
axis transform, skeletonization/thinnning, shape properties, textural features-moments, gray level co-
occurrence matrix, structural featurees. Fourier descriptor, polygonal approximation.

Compression

Coding, quantization, spatial and traansform domain based compression. Color image proocessing: color
model, enhancement, and segmentat ation.

Mathematical Morphology

Basic concepts, erosion, dilation, opening, closing. Advanced applications like biom
medical image
processing, digital watermarking, ettc.

Reference Books:

s, Digital Image Processing, Pearson, 4th Edition, 2018.

a) R. C. Gonzalez and R. E. Woods,
b) B. Chanda and D. Dutta Majuumder, Digital Image Processing and Analysis, Prrentice Hall of
India, 2nd Edition, 2011.
c) Azriel Rosenfel and Avinash C. Kak , Digital Picture Processing, Vol. 1 and 2, Accademic Press,
2nd Edition, 1982.
d) T. Y. Young and K. S. Fu, Handdbook of Pattern Recognition and Image Processingg, Vols. 1and 2,
Academic Press, New York, 1986 6.
e) A. Jain, Fundamentals of Digital
al Image Processing, Prentice Hall of India, 1989.
f) K. R. Castleman, Digital Image Processing,
P Pearson, 4th Edition, 1995.

********

51
 BTMT 7th Semester
[Compulsory]

Optimization Techniques

Mathematical Foundations and Basic

B Definitions

Concepts from linear algebra, geom

metry and multivariable calculus.

Revised Simplex Method (with aand without artificial variables) Parametric and Post Optimal
Analysis

Overview of Simplex method, chaange in the objective function, change in the requiirement vector,
addition of a variable, addition of a constraint, parametric analysis of cost and requirement vector.

Search Method

Fibonacci and Goldsen section methhod.

Gradient Method

Method of conjugate directions forr quadratic function, steepest descent and Devidon-F
Fletcher-Powell
method.

Constrained Optimization

Method of feasible direction, cuttingg hyperplane method.

Non-linear Optimization

Unconstrained and constrained optiimization of several variables, Lagranges multiplierss, Khun-Tucker

theory. Numerical methods for optimmization.

Quadratic Optimization

Quadratic programming method due to Beale, Wolf and Vandepanne duality

y in quadratic
programming. Self -duality.

Integer Programming

nch and bound

Gomory’s cutting plane algorithm,, Gomory’s mixed integer problem algorithm. Bran
algorithm.

Numerical Optimization Techniqu

ques

Line search methods, gradient m methods, Newton's method, conjugate direction methods,
m quasi-
Newton methods, projected gradien
nt methods, penalty methods.

52
Software

Introduction to software for optimizzation techniques (LINGO/LINDO).

Reference Books

a) E.K.P. Chong and S.H. Zakk, An Introduction to Optimization, 2nd Edition, Wileyy, 2010.
b) R. Fletcher, Practical Methhods of Optimization, John Wiley, 2nd Edition, 2009.
c) D. G. Luenberger and Y. YeYe, Linear and Nonlinear Programming, Springer Ind dia, 3rd Edition,
2010.
d) M. S. Bazarra, J.J. Jarvis, aand H.D. Sherali, Linear Programming and Networrk Flows, Wiley
India, 3rd Edition, 2008.
e) U. Faigle, W. Kern, and G. Still, Algorithmic Principles of Mathematical Programming,
Kluwe, 2002.
f) N. S. Kambo, Mathematicall Programming Techniques, East West Press, 1997.
g) D.P. Bertsekas, Nonlinear P Programming, Athena Scientific, 2nd Edition, 1999.
h) M. S. Bazarra, H.D. Sheerali, and C. M. Shetty, Nonlinear Programming g: Theory and
Algorithms, Wiley, 3rd Editiion, 2006.

********
BTMT 7th Semester
[Compulsory]

Stochastic Processes

Stochastic Processes

Definition and examples of stoch hastic processes, classifications of stochastic processes, Markov
chains: definition and examples, trransition probability matrices, classification of statees of a Markov
chain, determination of higher orrder transition probabilities, stability of a Markov v chain, graph
theoretic approach, Markov chainss with denumerable number of states, reducible Markov M chains,
Markov Chains with continuous state spaces, non-homogeneous Markov Chainss, Martingales,
Markov chains in continuous time: general pure birth and death processes, birth and death d processes
with absorbing states, Renewal proocesses: renewal processes in continuous time, ren newal equation,
renewal theorems, residual and ex excess lifetime, renewal reward processes, regenerative renewal
processes, regenerative inventory systems,
s generalization of the classical renewal theeory, stochastic
processes in queuing and reliabilityy: general concepts of queuing systems, steady state and transient
behavior, birth and death processs in queuing theory, network of Markovian queeuing systems,
reliability, introduction to Browniaan motion: Wiener processes, differential equationss for a Wiener
process, Kolmogorov’s equations, the first passage time distribution for a Wiener process,p recent
developments.

Reference Books :

a) J. Medhi, Stochastic Processses, New Age Publishers, 2nd Edition, Reprint 2007.
b) S.Karlin and H. M. Taylor, A First Course in Stochastic Processes, Academic P Press,
1975.
********
53
 BTMT
COMPUTATIIONAL MATHEMA
ATICS
8tth SEMESTER

54
 BTMT 8th Semester
[Compulsory]

Forma
mal Language and Automata Theory

Introduction

Introduction to language theory, alp

lphabets, definition of phrase structure grammar, production rules,
sentences, sentential forms, languagge, derivation. Chomsky Hierarchy of languages.

Regular Languages

Regular grammars, regular langu guage models, finite state machines (determinisstic and non-
deterministic), regular expressions,, equivalence of regular expressions, closure propeerties. Pumping
lemma of regular sets.

Finite Automata

Finite automaton, deterministic andd non-deterministic finite automata and their equivaleence.

Context -Free Languages

Context free grammar, derivation trrees, ambiguity simplification, normal forms, applicaations.

Pushdown Automata

Pushdown automata, definitions, cconstruction of PDA for simple CFLs, linear boun
nded automata,
closure properties. Pumping Lemmaa for CFL.

Turing Machines

Turing machines, deterministic andd non-deterministic Turing machines, Multi-tape Tu

uring machines,
Universal Turing machines, techniiques for construction of Turing machines, unrestriicted grammar,
Chomsky Hierarchy, computable fu unctions, computably enumerable languages, decidaable languages,
algorithmic solvable problems. Altlternative models of computation such as post macchine. Lambda
Calculus.

Reference Books

a) J. E. Hopcropt and J.D. Ullma an, Introduction to Automata Theory, Language an nd Computing,
Norasa Publishing, 2000.
b) M. Sipser, Introduction to theoryy of computation, Cengage Learning, 3rd Edition, 2014.
c) A. Singh, Elements of Computatiion theory, Springer Nature, 2011.
anguage and automata, Jones and Bartlett, 6thEditio
d) P. Linz, Introduction to formal la on, 2016.

********

55
 BTMT 8th Semester
[Compulsory]

Artificial Intelligence

Introduction

The foundation of AI. Importance oof AI and related fields.

Logic

Review of clausal form in propoositional logic, resolution principle, review of predicate logic,
Skolemization, unification, resolutio
on principle for predicate logic.

Rules

Working memory, rule base, connflict set, conflict resolution strategies, backward
d and forward
chaining and meta rules.

Reasoning under Uncertainty

Probabilistic reasoning, Bayesian neetworks, certainty factor methods, Dampster-Shafer theory.

Structure Representation

Semantic networks, frames, concept

ptual dependency, scripts, inheritance, default values.

General Issues in Knowledge Rep

presentation and Interference

Logical agents, reasoning and resol

olution, adequacy, richness, granularity, ease of reprresentation and
use, modeling uncertainty, the famee problem, declarative and procedural representation..

Problem Solving by Searching

State space representation, heuristiccs, heuristic evaluation function and problem reducttion. Searching
for solutions. Informed and uninform
rmed search strategies.

Search Methods

Generate and test, hill climbing, m

means-ends analysis, depth-first, breadth-first, best first,
f exploiting
domain constraints, dependency-ddirected back tracking, minimax, alpha- beta pruuning, iterative
deepening, A*, AO*.

Planning

Planning by forward and backward reasoning, nonlinear planning, scheduling.

56
Ethical Issues of AI

Reference Books

a) E. Rich and K. Knight, Artificiaal Intelligence, McGraw Hill Education, 3rd Edition, 2017.
b) Russell, Peter Norvig, Artificiial Intelligence a Modern Approach-Stuart, Pearsson, 3rdEdition,
2010.
c) gence, Addison- Wesley, 3rd Edition, 1994.
P.H.Winston, Artificial Intellig
d) D.W. Patterson, Introduction of Artificial Intelligence and expert systems, PHI, 3rdd Edition, 1990.

********

BTMT 8th Semester

[Compulsory]

Deep Learning

Introduction

Historical context and motivation forf deep learning, basic supervised classification taask, optimizing
logistic classifier using gradient deescent, stochastic gradient descent, momentum andd adaptive sub-
gradient method. Back propagationn. Vanishing gradient problem.

Neural Networks

Feed forward neural networks, deeep networks, regularizing a deep network, model exploration
e and
hyper-parameter tuning.

Convolution Neural Networks

Introduction to convolution neuraal networks, stacking, striding and pooling, CNN N architectures,
applications like image and text classsification. Advanced CNNs for computer vision.

Sequence Modeling

Recurrent Nets, unfolding computaational graphs, Recurrent Neural Networks (RNNs)), bidirectional
RNNs, encoder-decoder sequence too sequence architectures, deep recurrent networks, aadvanced RNN:
LSTM, GRU.

Advanced Deep architectures

Generative Adversarial Networks (G

GANs). Advanced GANs.

57
Auto Encoders

Under complete auto encoders, reegularized auto encoders, sparse auto encoders, denoising
d auto
encoders, representational power, layer, size and depth of auto encoders, stochasticc encoders and
decoders.

Structuring Machine Learning Prrojects

Orthogonalization, evaluation metrtrics, size of the training, validation and test setss, cleaning up
incorrectly labeled data, bias and variance with mismatched data distributions, tran nsfer learning,
multi-task learning.

Reference Books

a) Ian Goodfellow, Deep Learning

ng, MIT Press, Illustrated Edition, 2017.
b) Jeff Heaton, Deep Learning annd Neural Networks, Heaton Research Inc, 1 st Editionn, 2015.
c) Mindy L Hall, Deep Learning, VDM Verlag, 2011
d) Li Deng, Dong Yu, Deep Learnning: Methods and Applications , Foundations and T Trends in
Signal Processing, Now Publisshers Inc, 2014. https://doi.org/10.1561/200000003 39

********

BTMT 8th Semester

[Elective – I]

Engine
neering Economics and Accountancy

Engineering Economics

Meaning, nature, scope and subject matter.

Utility

Definition, total, marginal and averaage, cardinal utility theory, indifference curves theorry.

Demand

Factors effecting demand, elasticity

ty of demand, different types of elasticity, classification of goods
based on various elasticity of demannd.

Production

Production function, Iso-quant, retuurns to scale, total, average and marginal product, llaw of variable
proportions, Cobb-Douglas produc uction function, ISO-cost curve, derivation of cost curve from
production function, production opttimization, expansion path.

58
Cost

Short run and long run cost (the ‘E

Envelope Curve’), shape of different types of cost cu urves, revenue,
total revenue and marginal revenue,, relation between marginal revenue and price elasticcity of demand.

Firm

Different types of firm and its charaacteristics, traditional theory of firm, objectives of firrm.

Introduction to Accounting

Definition of accounting and accou

untancy, objectives of accounting, users of accountin
ng information,
double entry system of Book-Keepiing, Journal and Ledger, cash book, trial balance.

Final Accounts

Basic concepts, uses and preparatio ion of trading account, profit and loss account and balance sheet.
issue and forfeiture of share and re-iissue of company.

Introduction to Costing

Elements of cost, direct materials,, direct labor, direct expenses, overheads, productiion, office and
administration, selling and distribuution, allocation of overhead, machine hour rate, laabor hour rate,
practical problems.

Reference Books

a) A. Koutsoyiannis, Modern Miccroeconomics, Macmillan, 2nd Edition, 1979.

b) A. Sen, Microeconomics: Theoory and Applications, Oxford University Press, Indiann Branch,
2000.
c) eld, Microeconomics, Prentice-Hall, 8th Edition, 20177.
R.S. Pindyck and D.L. Rubinfel
d) Hal Varian, Microeconomic An nalysis,Viva Books, 3rd Revised Edition, 2019.
e) Mukherjee and Haniff, Modernn Accountancy, Volume I, McGraw Hill Education, 3rd Edition,
2018.
f) Basu and Das, Theory and Praactice of Costing, Rabindra Library, 9th Edition,20011.

********

59
 BTMT 8th Semester
[Elective – I]

Compu
uter Networks and Security (Theory)

Introduction

Network criteria, physical structuure (type of connection, topology), categories of network

n (LAN,
MAN, WAN), internet, brief hisstory, protocols and standards, reference models: OSI reference
model, TCP/IP reference model. DDesign issues of layers.

Physical Level

Overview of data, signal, transm mission and transmission media (guided and ungguided), circuit
switching and packet switching, tel
elephone network.

Data Link Layer

Types of errors, framing (characteer and bit stuffing), error detection and correction methods, flow
control. Protocols: stop and wait A ARQ, Go-Back- N ARQ, selective repeat ARQ, HDLC, H medium
access sublayer: point to point prootocol, LCP, NCP, token ring, reservation, polling. Multiple
M access
protocols: pure ALOHA, slotted ALOHA, CSMA, CSMA/CD, CSMA/CA. Traditiional Ethernet.
Fast Ethernet.

Network Layer

Internetworking and devices: reppeaters, hubs, bridges, switches, router, gateway. A Addressing: IP
addressing, sub netting. Routing: techniques, static vs. dynamic routing. Unicast rouuting protocols:
RIP, OSPF, BGP. Other protocols:: ARP, IP, ICMP, IPV6. Congestion Control algorith hms. Quality of
service: Leaky bucket algorithm, T
Token bucket algorithm.

Transport Layer

Process to process delivery, sockett address, UDP, TCP.

Application Layer

Introduction to DNS, SMTP, SNM

MP, FTP, HTTP and WWW.

Security

IDPS and firewalls, cryptography basics,

b symmetric and asymmetric cryptography: DE
ES, AES, RSA,
hashing, digital signature, digital Certificates.
C

60
 Reference Books

a) J. Kurose and K. Ross, Com mputer Networking: A Top-Down Approach, Pearsoon, 7th Edition,
2016.
b) A. S. Tanenbaum , Computer NNetworks, Pearson Education India, 5th Edition , 20113.
c) L.L. Peterson and B.S. Davie, Computer Networks: A Systems Approach, Morgann Kaufman, 6th
Edition, 2020.
d) S. William, Cryptography andd Network Security - Principles and Practice, Pearsoon, 6th Edition,
2013.
e) Forouzan and Mukhopadhyayy, Cryptography and Network Security, Mc Graw Hill India, 3rd
Edition, 2015.

********

BTMT 8th Semester

[Elective – I]

Non
N Stationary Data Analysis

Exploratory Analysis of Time Serries

Introduction, examples, simple deescriptive techniques, trend, seasonality, stochasticc and deterministic
approaches, numerical and experi rimental data sets, challenges in data analysis and a data graphical
representation, interpretation, statisistical tests, significance and power of a test, cho oice of the critical
region, constructing test statistics: tthe fisher discriminate, mean and variance test, testing goodness-of-fit,
stationary time series process (ARM MA Processes), ARIMA Process, GARCH Process/M Model.
Analysis of Stochastic Series
Model identification and non-statioonary time series models, forecasting with classical regression models,
forecasting with lagged dependent variable, forecast error statistics and
forecasting with autocorrelations, fo
evaluation, singularity detection, spectral density function, the period gram, spectral analysis,
correlogram, wavelet cross-correlati
tion, multi-resolution analysis, examples and applicattions.

Clustering and Classification of Nonn stationary data.

Reference Books

a) Box and Jenkins, Time Serieies Analysis, Prentice-Hall, 5th Edition, 1991.
Brooks/Cole , 7th
b) Peck and Devore, Statisticss: The Exploration and Analysis of Data, Thomson-B
Edition,2012.
c) D. Montgomery, C.L. Jen nnings and M. Kulahci, Introduction to Time Serries Analysis and
st
Forecasting, Wiley, 1 Edit
ition 2008.
d) C. Chatfield, The Analysis oof Time Series, Chapman and. Hall/CRC , 6th Editio
on, 2004.
e) Petre Stoica and L. Mosees Randolph, Introduction to Spectral Analysis, Prentice
P Hall, 6th
Edition,1997.
f) H. Robert, Shumway and SS. Stoffer David, Time Series Analysis and Its App
pplications with R
61
 Examples, Springer Texts inn Statistics , 3rd Edition, 2006.
on Education, 1st
g) M. Rao Raghuveer and Ajit S. Bopardikar, Wavelet Transform, Pearso
Edition,1998.

********
BTMT 8th Semester
[Elective – I]

Operation Research – I

Goal Programming

Introduction, difference between liinear programming and goal programming approacch, concept of goal
programming, graphical solution-m method of goal programming, modified simplexx method of goal
programming.

Dynamic Programming

Introduction, nature of dynamicc programming, deterministic processes, non-ssequential discrete

optimization, allocation problems,, assortment problems, sequential discrete optim
mization, long-term
planning problem, multi-stage deccision process, application of dynamic programm ming in production
scheduling and routine problems.

Inventory Control

cluding price breaks and multi-item with constraints. Probabilistic (with

Inventory control, deterministic incl
and without lead time). Fuzzy and ddynamic inventory models.

Queuing Theory

Basic structure of queuing models. Poisson queues, M/M/I, M/M/C or finite and inffinite queue length,
Non-Poisson queue- M/G/I, Machinne-Maintenance (steady state).

Replacement and Maintenance M

Models

Introduction. Failure Mechanism off items, replacement of items deteriorates with time, replacement policy
for equipment when value of moneey changes with constant rate during the period. Rep placement of items
that fail completely individual repplacement policy and group replacement policy. Other replacement
problems staffing problem. Equipmment renewal problem.

Simulation

Introduction. Steps of simulation

n process, advantages and disadvantages of simuulation. Stochastic
simulation and random numbers. Monte–Carlo
M simulation. Random number. Generattion. Simulation of

62
inventory problems, simulation off Queuing problems, role of computers in simulation. Application of
simulations.

Reference Books
Operations Research, S.K. Kataria and Sons, 3rd Edittion 2014.
a) A.P. Verma, Introduction to O
b) A. Taha Hamdy, Operations Research:
R An Introduction, Pearson Education India,, 10th Edition, 2017.
c) P K Gupta, Operations Researrch, S Chand, 5th Edition, 1976.
d, 3rd Edition,2006.
d) J K Sharma, Operations Reseaarch, Theory and Applications, Macmillan India Ltd
e) D.S Hira and P K Gupta, Opeerations Research, S Chand,4th Edition, 2015.

********

BTMT 8th Semester

[Elective – I]

Mathem
matical Modelling and Simulation – I

Mathematical Models

Deterministic and stochastic. Sinngle species population models. P-V Logistic equation.
Population growth model-an age strructured model.

Interactions Between Two Speciess

Host-Parasite type of interactions, competitive type of interactions. Trajectories of intteractions

of H-P and competitive types betw ween two species. Effect of migration on H-P inteeractions.
Some consequences of Lotka-Vol olterra equations. Generalized L-V equations. Connstant of
motion in the dynamical system.

Stochastic Processes and Need of Stochastic Models

Pure birth process, pure death proce

cess, birth and death process. Linear birth-death-imm
migration-
emigration processes. Effects off both immigration and emigration on the dynaamics of
population.

Biological Mechanisms Responsib

ble for "Time-Delay"

Discrete and continuous time-delayy. The single species logistic model with the effectt of time-
delay. Stability of equilibrium po osition for the logistic model with general delay function.
Stability of logistic model for disccrete time lag. Time-delayed H-P model together with
w their
stability analysis.

63
Mathematical Theory of Epidemiics

Some basic definitions. Simple epid

demic model, general epidemic model. Kermack-M McKendrik
threshold theorem. Recurring epidem
mic model. A comparative study of these models.

Control of an Epidemic

Stochastic epidemic model withou out removal. Models having multiple infections. E Epidemic
model with multiple infections. Sto
ochastic epidemic model with removal. Stochastic epidemic
model with removal, immigration aand emigration. Special discussion on the stochastic epidemic
model with carriers.

Simple Extensions of SIR Model

Different case studies - (i) loss of immunity,

i (ii) inclusion of immigration and emigraation, (iii)
immunization. SIR endemic diseasee model.

Reference Books

a) X. Q. Zhao, Dynamical Sysstems in Population Biology, Canadian Mathemaatical Society, 3rd

Edition,2003.
b) R M Andersson and R M May,, Infectious Diseases of Humans. Oxford University Press, Revised ed.
Edition , 1992.
c) J. N. Kapur, Mathematical Models
Mo in Biology and Medicine, East West Press Pvt Ltd ,1st Edition,
1985.
d) R. Habermann, Mathematicall Models: Mechanical Vibrations, Population Dynaamics, and Traffic
plied Mathematics, Prentice Hall, 1st Edition 1977.
Flow : An Introduction to Appl
e) E. C. Pielou, An Introduction tto Mathematical Ecology, Wiley, 1st Edition, 1970.
f) R. Rosen, Foundation of Maathematical Biology (vol. Iand II): Supercellular Systems,
S Academic
Press. 2013.
g) Mark Kot, Elements of Mathem matical Ecology, Cambridge University Press, 2001.
h) J. D. Murray, Mathematical BBiology, Springer-Verlag, Berlin 1989.

********

BTMT 8th Semester

[Elective – I]

Compiler Design

Introductory Concepts

Analysis-synthesis model of coompilation, various phases of a compiler, cro

oss compilers,
bootstrapping.

Lexical Analysis

64
Interface with input, parser and symbol
s table, token, lexeme and patterns, difficullties in lexical
analysis, error reporting and implem
mentation. Regular definition, transition diagram and
d LEX.

Syntax Analysis

Context free grammars, ambiguityy, associativity, precedence, top down parsing, reccursive descent
parsing, transformation on the gram mmars, predictive parsing, bottom up parsing, operaator precedence
grammars, LR parsers (SLR,LALR R, LR), YACC. SYNTAX DIRECTED TRANSLAT TION: inherited
and synthesized attributes, dependenency graph, evaluation order, bottom up and top downn evaluation of
attributes, L- and S-attributed definiitions.

Type Checking

Type system, type expressions, stru

uctural and name equivalence of types, type conversiion, overloaded
functions and operators, polymorphhic functions.

Run Time System

Storage organization, activation tre

ree, activation record, parameter passing, symbol table,
t dynamic
storage allocation.

Intermediate Code Generation

Intermediate representations, tran nslation of declarations, assignments and interrmediate code

generation for control flow. Booleann expressions and procedure calls, implementation isssues.

n Selection
Code Generation and Instruction

Issues, basic blocks and flow grapphs, register allocation, code generation, DAG rep
presentation of
programs, code generation from m dags, peep hole optimization, code generato or generators,
specifications of machine.

Code Optimization

Source of optimizations, optimizattion of basic blocks, loops, global dataflow analyssis, solution to
iterative dataflow equations, code improving
im transformations, dealing with aliases, dataa flow analysis
of structured flow graphs.

Reference Books

a) Aho Ullman, Shetty, Compiilers: Principles, Techniques and Tools, Pearson ,2ndd Edition,2008.
b) Kenneth C. Louden, Compil iler Construction: Principles and Practice,Thomson Books Course
Technology Inc, Internation
nal Edition, 1997.

********

65
 BTMT
COMPUTATIIONAL MATHEMA
ATICS
9tth SEMESTER

66
 BTMT 9th Semester
[Compulsory]

Complexityy Theory and Approximation Algorithms

Computability

Review of decidability, acceptancce problem, halting problem, problem reduction, Rice theorem.
Undecidable problems: about finiite automata, about pushdown automata, post’s correspondence
c
problem. Undecidable logical theorries, recursion theorem.

Complexity Theory

Complexity classes, space compllexity, time complexity, classes P and NP, polynomial time
reductions, NP-completeness, Cookk-Levin theorem, vertex cover problems, Hamilton path problem.
Subset sum problem, Hierarchy theo
orems, circuit complexity.

Approximation Algorithms

Set cover, max-SAT, knapsack, bin b packing, scheduling, spanners, steiner trees, cu uts, clustering,
facility location, traveling salesmaan tour, network design, metric embeddings. Design techniques:
greedy, local search, dynamic prog gramming, linear program formulations, dual fittin
ng, primal-dual
method, rounding of linear/semi defefinite programs, random sampling, derandomizationn, power of two
solutions. Lower bounds on approxiimations and the relevant complexity classes.

Reference Books

theory of computation, Cengage Learning, 3rd Editioon, 2014.

a) M. Sipser, Introduction to th
b) A. Singh, Elements of Compputation Theory, Springer, 2009.
c) David P. Williamson and David
D B. Shmoys, The Design of Approximation Algorrithms,
Cambridge University Presss, Illustrated edition , 2011.
d) Vijay V. Vazirani, Approximmation Algorithms, Springer, Illustrated Edition, 201
10.
e) Dorit S. Hochbaum , Approoximation Algorithms for NP-hard Problems edited, Course
C
Technology, 1996.
f) Sariel Har-Peled, Geometriic Approximation Algorithms, American Mathematiccal Society,
2011.

********

67
 BTMT 9th Semester
[Compulsory]

Sociial Media Data Analysis (Theory)

Online Social Networks (OSNs)

Introduction, types of social networrks (e.g. Twitter, Facebook), measurement and colleection of social
network data, social networks-basicc structure and measures, basics of text processing ovver social data,
entity linking and entity resolution ffor social data.

Studying Characteristics of OSNss

Information diffusion, experimentall studies over OSNs, sampling.

Fundamentals of Social Data Anaalytics

Topic models, random walks, heteroogeneous information networks.

Applied Social Data Analytics

Recommendation systems, communnity identification and link prediction.

Other Advanced Topics

Online experiments for computationnal social science, big data sampling.

Reference Books

a) Matthew A. Russell, Mining the Social

S Web: Data Mining Facebook, Twitter, Linkeddin, Google+,
Github and More, O'Reilly Media, 2nd Edition 2013.
b) Jennifer Golbeck, Analyzing the social web, Morgan Kaufmann, 1st Edition, 2013.
c) Charu Aggarwal, Social Networkrk Data Analytics, Springer, 2011.

********

BTMT 9th Semester

[Compulsory]

B
Big Data Analytics (Practical)

Identification of Spam and non-sspam (ham) mails from your mail account, moviie reviews for
recommendation (IMdb data sets arre available), share market values prediction (Yahooo Finance, BSE
and many other data sheets are available), text analysis and search (in different languages)-an
assignments could be search based on
o “context”, image analysis and search.

*********

68
 BTMT 9th Semester
[Elective-II]

Data Communication

Introduction

Basic goals of communication, signals

si for communication: time-domain and freqquency domain
representation of signals. Analog/ddigital/sampled, periodic/a periodic, deterministic/raandom signals.
Fourier series, Fourier transform frequency
fr spectrum, filtering and bandwidth. Messaage transducers
and signal converters. Communic ication channel: important characteristics of a communication
c
channel. Available communicatiion channels (media) and their properties. B Baseband data
communication: basic concepts oof analog and digital communication in the baseeband. Various
encoding formats for data. Attenuattion and distortion problems and remedies. Maximum m data rate of a
channel. Analog modulation and ddemodulation techniques: AM/FM/PM, principle off demodulating
various kinds of modulated sig gnals. Coherent and incoherent receiver digitaal modulation-
ASK/FSK/PSK, Binary and M-arraay data modulation, continuous phase modulation-binary and M-
array CPFSK, MSK, partial responnse CPM. Pulse modulation and pulse coded modulaation schemes-
PAM/PWM/PPM, PCM/DPCM/A ADPCM/DM etc. Reliable and efficient asynchronous and
synchronous data communication:: block error handling and channel coding. Bit and character
oriented framing. Transparent dat ata communication. Error detection and correctio on in a frame
LRC/VRC/Checksum/ CRC and Haamming code.

Protocols for Data Communicatio

on

Stop and wait protocol and its effiiciency, sliding window protocols-go-back-n and seelective repeat.
Modem technologies: QAM/MSK/C CPFSK/ADSL/Cable Modem.

Wireless Communication

Data communication over radio/m

microwave/satellite/infrared links. Principles of sppread spectrum
communication- DSSS, FHSS.

Optical Communication Technolo

ogy

Basic principles and components fo

for point-to-point communication. Multimedia comm
munication and
data compression.

Reference Books

a) S. Haykin, Communication Sysstems, John Wiley, 3rd Edition, 1994.

b) H 3rd Edition,
H. Taub and D. Schilling, Prinnciples of Communication Systems, Tata McGraw Hill,
2007.
c) W. Stallings, Data and Compuuter Communications, Pearson education Asia (IPE E), 6th Edition,
2000.

69
d) F. Halshall, Data Communicaations, Computer networks and Open Systems, Pearrson Education
Asia (IPE),4th Edition, 1996.
e) B. A. Forouzan, Data Communnications and Networking, Tata McGraw Hill, 3rd Eddition, 2003.
f) D. Bertrekas and R. Gallagar, Data Networks, Prentice Hall (EEE), 2nd Edition, 19
992.
g) Communication System Engineering, Pearson, 2nd Ediition, 2002.
J. G. Proakis and M. Salehi, Co
h) Schiller, Mobile Communicatioons, Pearson Education Asia, 2nd Edition, 2000.

********

BTMT 9th Semester

[Elective –II]

H
Human Computer Interaction

Introduction to HCI methods. Inte teraction styles and general design. Various user interfaces and
interaction strategies. Programmin ng usable interfaces, software architectures for user
u interface.
Cognitive models, communication and collaboration models, collaborative systems. Screen design.
Task analysis. Usability evaluationn, groupware and coordination technologies, HCI an
nd World Wide
Web.

Reference Books

a) Alan Dix, Janet Finley, Gregory

G Abowd, Russell Beale, Human Computeer Interaction,
rd
Pearson, 3 Edition, 2004..
b) B. Shneiderma., Designingg the User Interface, Addison Wesley (Indian Rep eprint), A joint
venture by IIS, 2000.
c) Wickens, Lee, Liu and Gorddon-Becker, Introduction to Human Factors Engineeering, Pearson,
2nd Edition, 2004.
d) Shneiderman, Plaisant, Coohen and Jacobs, Designing the User Interface: Strategies for
Effective Human-Computerr Interaction, Addison Wesley, 5th Edition, 2009.

********

BTMT 9th Semester

[Elective – II]

Operation Research – II

Stochastic Programming

Chance constraint programming tecchniques.

Geometric Programming

Geometric programming (both uncoonstrained and constrained), fuzzy geometric program

mming.

70
Games

Preliminaries concepts of continuo ous game, bimatrix games, nash equilibrium, solution of bimatrix
games through quadratic programm ming (relation with non-linear programming). Multioobjective linear
and non-linear programming, comp plete optimal solution, Pareto and Weak Pareto opptimal solution,
utility function method, global criteerion method, fuzzy programming technique.

Optimal Control

Performance indices, methods off calculus of variation, transversally conditions, simple

s optimal
problems of mechanics, Pontryaggin’s principle (with proof assuming smooth con ndition), linear
regulator, application of dynamic prrogramming in proving Pontryagin’s Principle, Bang
g-Bang control.

Sequencing

Problem with n jobs two machines, n jobs three machines and n jobs m machines.

Reliability
Concepts, reliability definition, syystem reliability, system failure rate, reliability of
o the systems
connected in series or/ and parallel.

Information Theory

Introduction, communication proces

ess-memory less channel, the channel matrix, probability relation in
a channel, noiseless channel. Measuure of information, properties of entropy function, measure
m of other
information quantities, marginal and joint entropies, conditional entropies, exppected mutual
information, axiom for an entrop py function, properties of entropy function. Chaannel capacity,
efficiency and redundancy.

Encoding

Objectives of encoding, Shannon--Fano encoding procedure, necessary and sufficieent condition for
noiseless encoding.

Reference Books
a) A.P. Verma, Introduction to Opperations Research, S.K. Kataria and Sons, 3rd Editio
on 2014.

b) A. Taha Hamdy, Operations Reesearch: An Introduction, Pearson Education India, 10th Edition, 2017.

c) P K Gupta, Operations Researcch, S Chand, 5th Edition, 1976.

d) J K Sharma, Operations Researrch, Theory and Applications, Macmillan India Ltd, 1997.

e) D.S Hira and P K Gupta, Opera

rations Research, S Chand, 2015.

********

71
 BTMT 9th Semester
[Elective – II]

Mathem
matical Modelling and Simulation – II

Some Mathematical Aspects of Osscillations of the Biological Systems

Introduction, biological clock, moddel for the circadian oscillator. Pharmacokinetics. Maathematical models
in pharmacokinetics, compartm mental analysis. Technique. Two compartmennt model-clinical
bromsulphalein (BSP) Test. Basic equations for an n-compartment system. Distributiions of drugs in n-
compartment model for (i) given innitial dose, (ii) repeated medication, (iii) constant raate of infusion and
(iv) truncated infusion. Compartmeent model for diabetes mellitus. Stochastic compartm ment models. Drug
action. Some general principles forfo real biological oscillations. Cellular mechanissm and genesis of
Atherosclerosis.

Arterial Biomechanics

Importance of studies on the mecchanics of blood vessels. Structure and functions of blood vessels.
Mechanical properties. Viscoelastiicity, linear discrete viscoelastic (spring-dashpot) models: Maxwell
fluid, Kelvin solid, Kelvin chainns and Maxwell models. Creep compliance, reelaxation modulus.
grals. Constituents of blood. Structure and functions of the constituents
Hereditary integrals, Stieltjes Integr
of blood. Mechanical properties off blood. Equations of motion applicable to blood flow w. Non-Newtonian
fluids-Power law, Bingham plasticc, Herschel-Bulkley and Casson fluids. Steady non n- Newtonian fluid
flow in a rigid circular tube. Fahrraeus-Lindqvist effect. Pulsatile flow in both rigid d and elastic tubes.
Blood flow through arteries with mild
m stenosis. Shear stress on surface of the stenosis.. Two-layered flow
in a tube with mild stenosis. Large ddeformation theory. Various forms of strain energy ffunctions. The base
vectors and metric tensors. Green en's deformation and Lagrangian strain tensors. C Cylindrical model,
Constitutive equations for blood vesssels. Equations of motion for the vascular wall.

Biological Diffusion and Diffusion

n-Reaction Models

Fick’s laws of diffusion, one-dim mensional diffusion model and its solution, some solutions of two-
dimensional diffusion equation, varrious modifications of diffusion equation to diffusioon-reaction models
arising in pharmacokinetics and eecology. Hemodialyser and dialysis of blood, basic equations for a
circular-duct and a parallel-plate di
dialyser, Pecletnumber, sherwood number. Solutionss of basic equation
for a circular-duct dialyser by (i) sseparation of variables method and (ii) Galerki’s meethod. Solution for
parallel-plate dialyser.

Reference Books

a) D. A. MacDonald, Blood F Flow in Arteries, The Williams and Wilkins Compaany, Baltimore, 2nd
Edition, 1974.
b) Y. C. Fung, Biomechanics off Soft Biological Tissues, Springer Verlag, 1st Editionn, 1981.
c) R. Habermann, Mathematiccal models : mechanical vibrations, population dynnamics, and traffic
flow : an introduction to appplied mathematics, Prentice Hall, 1977.
d) R. W. Poole, An Introduction n to Quantitative Ecology, McGraw- Hill, 1974.
e) E. C. Pielou, An Introductionn to Mathematical Ecology, Wiley, New York , 1977..

72
 f) R. Rosen, Foundation of Matathematical Biology (vol. Iand II), Academic Press, 2013.
2
nd
g) W Flugge, Visco elasticity, SSpringer-Verlag, 2 Edition, 1975.
h) M. Zamir and E. L. Ritman, The Physics of Pulsatile Flow. Springer, 2012.
i) J. N. Kapur, Mathematical M Models in Biology and Medicine, East West Press Pvvt Ltd ,1985.

********

BTMT 9th Semester

[Elective – III]

Operating System

Introduction

What is an operating system, funnction of operating system, operating system stru

ucture: system
components, operating system serviices, system calls.

Processes

Process concept, process state andd state transitions, process control block, suspend and resume of
process, interrupt processing, contexxt switching.

Process Synchronization and Inteer Process Communication

The critical-section problem, Dekkker’s algorithm, semaphores, synchronization hardw

ware: test-and-
set, compare-and-swap, solution of producer-consumer problem.

Deadlocks

System model, deadlock charactererization, methods for handling deadlocks, deadlock prevention,
deadlock avoidance and banker’s allgorithm, deadlock detection, deadlock recovery.

Threads

Single and multithreading models, tthreading issues, P threads, solaris 2 threads, window
w 2000 threads,
linux threads, java threads.

CPU Scheduling

Basic concepts, scheduling levels, scheduling criteria, pre-emptive and non-preemptiive scheduling,
scheduling algorithms, multi-processsor scheduling.

Memory Management

Memory organization, storage hierrarchy, storage management strategies, swapping, ccontiguous and
non contiguous memory allocation,, virtual memory: paging, segmentation, segmentatio
on with paging,
notion of locality and working sets, thrashing, page replacement algorithms.

73
File-System Interface

File concepts, file organization, aaccess methods, directory structure, file-system mounting, file
sharing, protection.

File-System Implementation

mplementation, directory implementation, allocation methods, free-

File-system structure, file system im
space management, efficiency and pperformance, recovery.

Disk Scheduling

Disk structure, disk caching, diskk scheduling, disk management, swap-space manag
gement, RAID
structure, disk attachment, stable-stoorage implementation.

Protection

Goals of protection, domain of prrotection, implementation of access matrix, revocaation of access

rights, capability-based systems, lannguage-based protection.

Security

The security problem, user authenntication, program threats, system threats, securing
g systems and
facilities, intrusion detection, cryptoography, computer-security classifications.

Reference Books

a) Abraham Silberschatz, Peteer Baer Galvin and Greg Gagne, Operating System Concepts,
C John
Wiley and Sons, Inc., 9th Eddition, 2018.
b) H. M. Deitel, Operating Sysstem, Pearson Education, 3rd Edition, 2004.
c) Pramod Chandra P. Bhatt, An Introduction to Operating System Concepts andd Practice, PHI
Pvt Ltd, 2nd revised Edition,, 2007.

********

BTMT 9th Semester

[Elective – III]

Decision Theory and Computational Statistics

Decision Theory

Games and statistical games, Statiistical decision problem, decision function, risk fu
unction, prior and
posterior distribution, Baye’s risk and Baye’s rules.

Least favourable prior, minimaxixity, admissibility and complete classes, admissiibility of Baye’s
rules, existence of minimal comple
lete class and Baye’s rules.

74
The supporting and separating hyperplane theorems, essential completeness of the class of
nonrandomized rules, minimax an
nd complete class theorems.

Solving for minimax rules, essenntial completeness of class of rules based on suffficient statistics,
continuity of risk function, Invariaant decision problems, admissible and minimax innvariant decision
rules.

Computational Statistics

Analysis of variance, one- way annd two – way classification, concept of design of eexperiment, some
standard design: completely randdomized design, randomized block design, latin squares, Graeco
latin squares and factorial design confounding and blocking in factorial design, fraactional factorial
design.

Simple and multiple regression models, classical techniques of time series anaalysis, ANOVA,
MANOVA, multivariate analyysis of covariance model (MANCOVA), smoothing and
decomposition, factor analysis.

Reference Books

a) James O Berger, SStatistical Decision Theory and Bayesian Analyssis, Springer series,
2nd Edition, 2010
b) James O. Berger, Statistical Decision Theory, Foundation, Conccepts and Methods,
Springer series in Statistics,
S 1st Edition 1980
c) James E. Gentle and Wolfgang Karl Hardle and Yuichi Mori, M Handbook of
st
computational statiistics: Concepts and methods, Springer, 1 Editio
on. 2004.

********

BTMT 9th Semester

[Elective – III]

Stochastic Calculus

Review of Brownian motion and sto ochastic integration with respect to Brownian motion, extension of
stochastic integral for a larger class of integrands, stopping times, local martingales.

Stochastic integration with respect

ct to right continuous with left limits (RCLL) squuare integrable
martingales, Doob Meyer decompoosition, Ito's formula for martingales, continuous m martingales, the
representation theorem for martiingales, stochastic differential equations, diffusiion processes,
Girsanov's representation theorem, local
l time, Tanaka's formula, multiple Weiner-Ito in
ntegrals.

75
References Books

ms, Introduction to Stochastic Integration, Birkhäusser; 2nd Edition,

a) K.L.Chung and R.J.William
2013.
b) Hui-Hsiung Kuo, Introducttion to Stochastic Integration, Springer; 6th Edition, 2005.
c) N. Ikeda and S. Watana abe, Stochastic Differential Equations and Diffusiion Processes,
nd
Elsevier, 2 Edition, 20144.

********

BTMT 9th Semester

[Elective – III]

Mobile Computing

Introduction to Personal Commun

nications Services (PCS)

PCS architecture, mobility managem

ement, networks signaling.

Global System for Mobile Commu

unication (GSM) Overview

GSM architecture, mobility manage

gement, network signaling.

General Packet Radio Services (G

GPRS)

GPRS architecture, GPRS network nodes.

Mobile Data Communication

WLANs (Wireless LANs), IEEE 8002.11 standard, mobile IP, Bluetooth, routing algorith
hms for mobile
ad -hoc networks.

Wireless Application Protocol (W

WAP)

The mobile internet standard, WAP

P gateway and protocols, wireless mark-up languagess (WML).

Third Generation (3G) Mobile Seervices

Introduction to international mobille telecommunications 2000 (IMT 2000) vision, wideb

w and code
division multiple access (W-CDMA A), and CDMA 2000, quality of services in 3G.

Wireless Local Loop (WLL)

Introduction to WLL architecture, wireless local loop technologies, global mobile sattellite systems,
case studies of the IRIDIUM and GL
GLOBALSTAR systems.

References Books

a) Yi-Bing Lin and Imrich Chhlamtac, Wireless and Mobile Networks Architectuures, Wiley, 1st
Edition, 2008.

76
b) Raj Pandya, Mobile and Personal
P Communication Systems and Services, Prrentice Hall of
India, 2001.
c) U. Hansmann, Lothar Merk,
M Martin Nicklous, Thomas Stober, Principlles of Mobile
nd
Computing, Dreamtech Preess, 2 Edition, 2006.

********

77
 BTMT
COMPUTATIIONAL MATHEMA
ATICS
0th SEMESTER
10

mester – 10th
Sem 17– Credits
Option – 1
Dissertation – II 200 0 0 10 10
Grand Viva-II 100 0 0 4 4
Seminar Presentation-III 100 0 0 3 3

Option – 2
Industrial Project 200 0 0 0 10
Project Seminar 100 0 0 3 3
Grand Viva-II 100 0 0 4 4

78