SCHOOL OF COMPUTING & INFORMATION TECHNOLOGY

DEPARTMENT OF INFORMATION TECHNOLOGY

BACHELOR OF TECHNOLOGY (Data Science and Engineering)

COURSE STRUCTURE & SYLLABI FOR FIRST, SECOND, THIRD & FOURTH YEARS

(From Batch 2020-24)

Department of Information Technology, School of Computing and IT, Manipal University Jaipur
Course Structure for B. Tech (Data Science and Engineering) Program from Academic Session
2020-2021

FIRST SEMESTER SECOND SEMESTER

Year
Sub. Sub.
Subject Name L T P C Subject Name L T P C
Code Code
MA11 Engineering 3 1 0 4 MA120 Engineering Mathematics-II 3 1 0 4
01 Mathematics-I 1
PY10 Engineering Physics 3 1 0 4 CY100 Engineering Chemistry 2 1 0 3
01 1
CV10 Basic Civil Engineering 2 1 0 3 EE100 Basic Electrical Technology 2 1 0 3
01 1
CY10 Environmental Studies 3 0 0 3 CS100 Problem Solving Using 2 1 0 3
02 1 Computers
EC Basic Electronics 2 1 0 3 ME100 Basic Mechanical 2 1 0 3
I 100 1 Engineering
1
ME10 Engineering Graphics 0 0 6 3 LN100 Communication Skills in 2 0 0 2
02 1 English
PY10 Engineering Physics Lab 0 0 2 1 CS103 Problem Solving Using 0 0 2 1
30 0 Computers Lab
ME10 Workshop Practice 0 0 2 1 CY103 Engineering Chemistry Lab 0 0 2 1
30 0
DA100 Experiential Learning 0 0 4 2
1
13 4 10 22 13 5 8 22
Total Contact Hours (L + T + P) 27 Total Contact Hours (L + T + P) 26
THIRD SEMESTER FOURTH SEMESTER
MA Mathematical Foundations Mathematical Foundations For
3 3 MA **** 3 3
**** for Data Science-I Data Science-II
HS
Finance & Econometrics 3 3 DS2201 Database Systems 3 1 4
****
DS21 Introduction to Data DS2202 Machine Learning
3 3 3 1 4
01 Analytics
DS21 Object Oriented DS2203 Design & Analysis of
3 1 4 3 1 4
02 Programing Algorithms
DS21 Data Structures DS2204 Data Communications and
II 3 1 4 3 3
03 Networks
DS21 Computer System **** Open Elective – I
3 3 3 3
04 Architecture
DS21 Data Analytics Lab DS2230 Database Lab
2 1 2 1
30
DS21 Object Oriented DS2231 Machine Learning Lab
2 1 2 1
31 Programming Lab
DS21 Data Structures Lab DS2232 Design & Analysis of
2 1 2 1
32 Algorithms Lab
18 2 6 23 18 3 6 24
Total Contact Hours (L + T + P) 26 Total Contact Hours (L + T + P) + OE 27
FIFTH SEMESTER SIXTH SEMESTER
MA*** Mathematical Foundations
3 3 HS **** Operations Research 3 3
* For Data Science-III
DS31 Deep Learning DS3201 Artificial Intelligence
3 1 4 3 1 4
01
DS31 Operating Systems 3 1 4
3 3 DS3202 Parallel Programming
02
DS31 Natural Language
3 3 DS3203 Big Data Analytics 3 1 4
III 03 Processing
DS31 DS3204 Data Privacy & Security
Cloud Computing 3 3 3 3
04
**** Open Elective – II 3 3 **** Open Elective – III 3 3
DS31 Deep Learning Lab DS3230 Artificial Intelligence lab
2 1 2 1
30
DS31 Operating Systems Lab DS3231 Parallel Programming Lab
2 1 2 1
31
DS31 DS3232 Big Data Analytics Lab
Web Technologies Lab 1 2 2 2 1
32
18 2 6 23 18 3 6 24
 Department of Information Technology, School of Computing and IT, Manipal University Jaipur
Course Structure for B. Tech (Data Science and Engineering) Program from Academic Session
2020-2021

Total Contact Hours (L+T+P) + 26 Total Contact Hours (L + T + P) + OE 27

OE

SEVENTH SEMESTER
EIGHTH SEMESTER
Sub. Sub.
Subject Name L T P C Subject Name L T P C
Code Code
DS41* Program Elective - I
3 3 DS4270 Project work/ Practice School 12
***
DS41* Program Elective - II
3 3
***
IV DS41* Program Elective - III
3 3
***
DS41* Program Elective - IV
3 3
***
DS41* Program Elective - V
3 3
***
DS41* Program Elective - VI
3 3
***
DS41 Industrial Training
1
70
18 19 12
Total Contact Hours (L + T + P) 18 Total Contact Hours (L + T + P) -

PROGRAM ELECTIVES:

Sub. Subject Name Sub. Subject Name

Code Code
DS4140 Advanced Data Structures and Algorithms DS4141 Software Engineering
DS4142 Block chain Technologies DS4143 Internet of Things
DS4144 Quantum Computing DS4145 Social Network Analysis
DS4146 Data Forensics DS4147 Information Retrieval
DS4148 Soft Computing Techniques DS4149 Enterprise Data Architecture
DS4150 Computer Vision DS4151 Robotics & Automation
DS4152 Finance & Accounting DS4153 Risk Analytics
DS4154 Financial Market Analytics DS4155 Business & Economic Analytics
DS4156 Fundamentals of Business Analytics DS4157 Digital Marketing
DS4158 Supply Chain Management DS4159 Health Informatics
DS4160 Bioinformatics DS4161 Medical Image Processing
DS4162 Biostatistics DS4163 Algorithmic Trading
DS4164 Applied Econometrics

PROGRAM ELECTIVE BASED MINOR SPECIALIZATION:

1. Finance & Security Analytics – DS4152, DS4153, DS4154, DS4155
2. Business Analytics – – DS4152, DS4156, DS4157, DS4158
3. Health Care Analytics – – DS4159, DS4160, DS4161, DS4162
 FIRST YEAR
FIRST SEMESTER

MA1101: ENGINEERING MATHEMATICS – I [3 1 0 4]

Matrices-inverse and rank, solution of linear system of equations, Eigen value problems. Vector
spaces, basis, linear transformations, inner product spaces and Orthogonalization. First and higher
order differential equations and their solutions; finite difference and interpolation for equal and unequal
intervals, Numerical differentiation and integration. Solution of algebraic and transcendental equations,
solutions of ordinary differential equations.

References:
1. Grewal B. S., Higher Engineering Mathematics, (42e), Khanna Publishers, 2013
2. Kreyszig E., Advanced Engineering Mathematics, (10e), Wiley Eastern, 2011
3. Lay David C., Linear Algebra and applications, (3e), Pearson Education, 2009
4. Sastry S. S., Introductory methods of Numerical analysis, (4e), PHI, 2007
5. Iyengar S.R.K. and Jain, Rajendra K. , Advance Engineering Mathematics (3e), Narosa book
distributors Pvt Ltd-New Delhi, 2007
6. Ramana B. V., Higher Engineering Mathematics (6th reprint), Tata Mcgraw-Hill, New Delhi,
2008

PY1001: ENGINEERING PHYSICS [3 1 0 4]

Optics: Two source interference, double slit interference, coherence, intensity in double slit interference,
thin film interference, air-wedge, Newton`s rings, Michelson`s interferometer, diffraction and wave
theory of light, single-slit diffraction, intensity in single-slit diffraction (using phasor method), diffraction
at a circular aperture, double-slit interference and diffraction, combined-intensity in double-slit diffraction
(qualitative approach), diffraction of light through multiples slits, diffraction gratings, dispersion and
resolving power of gratings, polarization of electromagnetic waves, polarizing sheets, polarization by
reflection, double refraction; Quantum Physics: Black body radiation and Planck`s hypothesis, Stefan`s
Law, Wein`s displacement law, Photoelectric effect, Compton effect, photons and electromagnetic
waves, wave properties of particles, de Broglie hypothesis, Davisson-Germer experiment, quantum
particle (wave packet, phase velocity, group velocity), the uncertainty principle; Quantum Mechanics:
An interpretation of quantum mechanics, wave function and its significance, Schrödinger equation,
particle in a box, particle in a well of finite height (qualitative), Tunneling through a potential barrier and
its applications, the simple harmonic oscillator (qualitative); Atomic Physics & Molecular Physics: Atomic
spectra of gases, energy states and spectra of molecules (rotational and vibrational energy levels), X-
rays spectrum, Moseley’s law, spontaneous and stimulated transitions, He-Ne and Ruby laser,
application of lasers; Solid State Physics: band theory of solids, electrical conduction in metals,
insulators and semiconductors, Superconductivity, type-I and type-II superconductors, Meisner effect,
BCS theory (Introductory) and applications of superconductivity.

References:

1. Halliday D., Resnick R., Krane K. S., Physics (5e), Wiley, 2016.
2. Beiser A., Mahajan S., Rai Chaudhary S., Concepts of Modern Physics, (7e), McGraw Hill
Education, 2017.
3. Serway R. A., Jewett J. W., Physics for Scientists and Engineers with Modern Physics,
Thomson, 2013.
Department of Information Technology, School of Computing and IT, Manipal University Jaipur
Course Structure for B. Tech (Data Science and Engineering) Program from Academic Session
2020-2021

CV1001: BASIC CIVIL ENGINEERING [2 1 0 3]

Introduction: Scope of Civil Engineering, Role of Civil Engineer in Society, Impact of infrastructural
development on economy of country. Buildings: Properties, uses of Stones, bricks, cement, timber,
steel, plastics and paints. Properties of concrete. Selection of site for Buildings, Layout of building Plan,
Types of buildings, Plinth Area, Carpet Area, Super built up area, floor space index, building bye laws,
ventilation, components of buildings and their functions, Functional design of buildings, basic concepts
of R.C.C., Type of foundations. Surveying:-Principles and types of surveying, Site plans, Linear
measurements, Angular measurements, Levelling, ordinary levels and total stations, Use of theodolite
and plane table, contouring, L- section and cross sections, Mechanics of Solids:- Forces and
Equilibrium, Graphical and analytical treatment of concurrent and non-concurrent co-planer forces, Free
body diagram, Analysis of plane truss, Method of joints, Method of sections, Frictional force in
equilibrium problems, Centroid and centre of gravity, Moment of inertia of simple and composite areas.
Normal stress and strain, Hooke’s law, modulus of elasticity, modulus of rigidity, allowable stress, shear
stress and shear strain. Estimation and Costing: Types of estimates and Contracts, Tenders, NIT, EMD
and Security deposits, Award of work, measurements, billing and payments.

References:

1. Ramamrutham S., Basic Civil Engineering (3e), Dhanpat Rai Publishing Company (P) Ltd,
2013.
2. Punamia B. C., Jain A. K., Jain A. K., Surveying Volume 1, (16e), S Chand, 2016.
3. Dutta B. N., Estimation and Costing in Civil Engineering, (28e), UBS Publishers Distributors
LTD., 2016.
4. Punamia B.C., Jain A. K., Jain A. K., Building Construction, (11e), S Chand, 2016.
5. Timoshenko S., Young D.H., Rao J.V., Pati S., Engineering Mechanics, (5e), McGraw Hill,
2013.
6. SP41 Handbook on Functional Design of Buildings, Bureau of Indian Standards 2013.

CY1002: ENVIRONMENTAL STUDIES [3 0 0 3]

Meaning, multidisciplinary nature of environmental science, applications in engineering disciplines,

environmental ethics, sustainable development, Natural (renewable and non-renewable) resources,
Resource consumption, Biodiversity and conservation methods, different types of energy, Conventional
sources & Non-Conventional sources of energy, Types and Structure of Ecosystem, Environmental
Pollution and control, Disaster Management meaning, natural disasters especially earthquakes &
Manmade disasters, Environmental Engineering:- Water demand, Water quality standards, basics of
water treatment, Conservation of water, Characteristics of sewage, treatment and disposal,
Environmental crisis & legislations, Environmental acts, Laws and Policies, EIA, Case studies of the
past related to environmental issues, crisis, disasters, hazard, pollution, climate change & its effects,
Practical activity related to environmental problems and its impacts on environment.

References:

1. Rajagopalan, R., Environmental Studies: From Crisis to Cure, (2e), Oxford University Press,
2016.
2. De, A. K. and De, A. K., Environmental Studies (2e), New Age Publishers, New Delhi, 2009.
3. Bharucha E., Text book of Environmental Studies for undergraduate courses, (4e), Universities
Press, Hyderabad, 2013.
Department of Information Technology, School of Computing and IT, Manipal University Jaipur
Course Structure for B. Tech (Data Science and Engineering) Program from Academic Session
2020-2021

EC1001: BASIC ELECTRONICS [2 1 0 3]

PN Junction: Formation of depletion region, Effect of forward and reverse bias on depletion region, I-V
characteristics and equivalent circuits of ideal and practical diode, Diode equation. Application of Diode:
Series and parallel combination of diodes circuits, Half Wave and Full Wave rectifiers, capacitor filter,
clipper, clamper circuits, Zener Diode; I-V Characteristics, Zener Regulators. BJT: Construction,
schematic diagram and characteristic of CE, CB Configuration, CC configuration w.r.t. CE, Relation
between α and β, transistor biasing, Q-point, load line, fixed bias, self-bias. Operational Amplifier: Ideal
characteristics of an Op. Amp., Inverting and Non-inverting, amplifiers, Linear Circuit applications as
voltage follower, integrator, differentiator, summing amplifier, subtractor. Digital Electronics: Number
systems, Boolean algebra, De Morgan’s Theorem, logic gates; Truth tables, SOP, POS form, K-map
for minimization of Boolean expressions, Implementation of Boolean expressions with logic gates,
Introduction to combinational & sequential circuits. Communication Systems: Elements of
communication systems, Analog modulation scheme.

References:

1. R. L. Boylestad, L. Nashelsky, Electronic Devices and Circuit Theory, (10e), Pearson, 2009.
2. S. Salivahanan, S. Arivazhagan, Digital circuits and Design, (5e), Oxford University Press,
2018.
3. G. Kennedy, B. Davis, S R M Prasanna, Electronic Communication systems, (6e), Mcgraw Hill,
2017.
4. V. K. Mehta, Rohit Mehta, Principles of Electronics, (10e), S. Chand Publication, 2006.
5. B. L. Thereja, Basic Electronics: Solid state, (5e), S. Chand Publication, 2005

ME1002: ENGINEERING GRAPHICS [0 0 6 3]

Introduction to Engineering Graphics. Principle of Orthographic Projections: Points, straight lines.

Straight lines inclined to both HP and VP and its traces. Projections of Planes. Projections of Solids
(right regular). Drawing sectional views and true shape of sections. Development of surfaces: Parallel
line development, Radial line development. Isometric projections: Plane surfaces and simple solids
(prisms & cylinders), Frustum and combination of solids, conversion of isometric to orthographic, Simple
machine elements. Introduction to Computer Aided Drafting.

References:

1. Bhatt N.D., Engineering Drawing, (53e), Charotar Publishing House, 2014.

2. Bhattacharyya Binoy and Bera S.C., Engineering Graphics, I K International Publishing
House, 2008.
3. Jolhe Dhananjay, Engineering Drawing with an Introduction to AutoCAD, (1e), McGraw Hill
Education, 2017.

PY1030: ENGINEERING PHYSICS LAB [0 0 2 1]

Experiments on interference, diffraction and dispersion, experiments on quantum theory of radiation,

Experiments on band theory of solids, semiconductors, Experiments on resonance circuits, Hall-effect.

References:

1. Jewett & Serway, PHYSICS for Scientists and Engineers with Modern Physics (7e), Cengage
Learning, 2008.
Department of Information Technology, School of Computing and IT, Manipal University Jaipur
Course Structure for B. Tech (Data Science and Engineering) Program from Academic Session
2020-2021

2. Worsnop & Flint, Advanced Practical Physics for Students (9e), Methuen & Co. Ltd, London
1987.

ME1030: WORKSHOP PRACTICE [0 0 2 1]

Mechanical Engineering Practices: Demonstration and working of Lathe machine with different
operations. Study of Arc welding and Spot welding with applications. Preparation of different types of
joints on Arc welding and spot welding. Study of two stroke and four stroke engines. Civil Engineering
Practices: Layout of a building plan on ground. Levelling by dumpy/tilting level. Measurement of tensile
strength of reinforcement bar using UTM. Measurement of compressive strength of Brick/Cement by
CTM. Electrical and Electronics Engineering Practices: Designing of residential wiring. Study of three
phase induction motor. Study of the working of fluorescent lamp and ceiling fan. Use of electronic
Instruments and tools. Building DC Regulated Power Supply.

References:

1. Hajra Choudhury S. K and Bose S. K, Elements of Workshop Technology, Vol I, Media

Promoters & Publishing Pvt. Ltd., Mumbai, 2012.
2. Raghuvanshi S.S, Workshop Technology, Dhanpat Rai and Sons, Delhi, 2002.
3. Punmia B. C, Surveying, Laxmi Publications, Bangalore, 2012.
4. Raina K. B., Electrical Design Estimating and Costing, New Age International Publishers, 2017.
5. R. L. Boylestad, L. Nashelsky, Electronic Devices and Circuit Theory, Tenth edition, Pearson,
2009.
Department of Information Technology, School of Computing and IT, Manipal University Jaipur
Course Structure for B. Tech (Data Science and Engineering) Program from Academic Session
2020-2021

SECOND SEMESTER
MA1201: ENGINEERING MATHEMATICS – II [3 1 0 4]

Differential calculus: curvatures, asymptotes, curve tracing; Partial differentiation, total derivatives,
errors and expansions, Taylor's theorem, maxima and minima, Lagrange's method. Infinite series, tests
for convergence of series with positive terms, alternating series, power series. Analytical solid
geometry- spheres. Cones and cylinders. Multiple integrals and their applications, beta and gamma
functions. Laplace transforms, periodic functions, step functions, inverse transforms, convolution,
solution of differential equations and applications.

References:

1. Grewal B. S., Higher Engineering Mathematics, (42e), Khanna Publishers, 2013

2. Rainville E. D. and Bedient P. E., A Short Course in Differential Equations (6e), Macmillan
Pub., Mumbai, 1981.
3. Kreyszig E., Advanced Engineering Mathematics, (10e), Wiley Eastern, 2011
4. Ramana B. V., Higher Engineering Mathematics (6th reprint), Tata Mcgraw-Hill, New Delhi,
2008
5. Iyengar S.R.K. and Jain, Rajendra K. Advance Engineering Mathematics (3e), Narosa book
distributors Pvt Ltd-New Delhi, 2007

CY1001: ENGINEERING CHEMISTRY [2 1 0 3]

Theory and application phase rule (up to two component system). Chemistry of primary and secondary
batteries. Working principles of fuels cells and their applications. Concept of corrosion and its
importance, types of corrosion, factors affecting corrosion, Corrosion control methods. General
methods of chemical analysis, Instrumental methods. Introduction to spectroscopic methods of
analysis: Electromagnetic radiation (EMR), Interaction of EMR with matter, Numerical Problems.
Concepts of rotational, vibrational and electronic spectra, Laws of spectrophotometry. Classification of
Fuels, Gross Calorific value and Net Calorific value. Solid, Liquid and Gaseous fuels. Water treatment
technology. Advanced materials and polymers: Liquid crystals, ceramics, composites, bio-materials,
nanomaterials, thin films and their properties and applications.

References:

1. Kuriacose J. C. and Rajaram J., Chemistry in Engineering and Technology, volume I/II (7e)
Tata McGraw - Hill, New Delhi, 2010.
2. Jain P. C. and Jain M., Engineering Chemistry, (16e), Dhanpat Rai and Sons, New Delhi, 2015.
3. Fischer T., Materials Science for Engineering Students, Academic Press, London, 2009.

EE1001: BASIC ELECTRICAL TECHNOLOGY [2 1 0 3]

DC circuits, Independent sources, Resistance, Network reduction techniques, Mesh and Node voltage
analysis, Superposition, Thevenin's and Maximum power transfer theorems, Transient behavior of
inductance and capacitance, Self and Mutual inductances, Coupled coils, Dot rule, Average and RMS
values of sinusoidal waves, Series and Parallel AC circuits, Phasor Analysis, Power factor
improvement, Series and Parallel resonance, Three phase star and delta connected loads,
Measurement of power in three phase circuits, Electrical power system, EMF Equation, Construction &
Department of Information Technology, School of Computing and IT, Manipal University Jaipur
Course Structure for B. Tech (Data Science and Engineering) Program from Academic Session
2020-2021

Types of Transformers, DC motors, BLDC motors, Induction motors, Synchronous motors, Stepper
motors, Fundamentals of Electrical Measuring Instruments.

References:

1. Hughes E., Electrical and Electronic Technology, (9e), Pearson Education, 2008
2. Kulshreshtha D. C., Basic Electrical Engineering, McGraw Hill, 2012.
3. Kothari D. P. and Nagarath I. J., Basic Electrical Engineering, (3e), McGraw Hill, 2016
4. Nagsarkar T. K. and Sukhija M. S., Basic Electrical Engineering, (3e), Oxford University Press,
2017

CS1001: PROBLEM SOLVING USING COMPUTERS [2 1 0 3]

Introduction to computing, Importance of Problem solving using computers, Algorithms and Flow charts,
Introduction to C language, Simple C programs, Syntax and Logical Errors in compilation, Object and
executable code, Variable names and declaration, Data types, Sizes and Constants, Various operators,
Type conversion and expressions, Precedence and order of evaluation, Statements and blocks,
Control, flow, Break and continue, 1-D and 2-D Arrays and Strings, Searching and Sorting,
Multidimensional Arrays and Matrices, Modular programming and Recursive functions, Structure and
Pointers, Defining Structures and Array of Structures, Pointer arithmetic, Pointer to Structures, File
Management.

References:

1. Dromey. R. G, How to solve it by computers, Pearson, 1982.

2. Brian W. Kernighan and Dennis M. Ritchie, The C Programming language (2e), Pearson
Education, 1988.
3. Deital. P. J and Deitel. H. M, C: How to program (7e), Pearson Education, 2010.
4. Balagurusamy, E, Computing fundamentals and C programming (1e), McGraw-Hill, 2008.

ME1001: BASIC MECHANICAL ENGINEERING [2 1 0 3]

Working Fluid: Properties of steam, Steam tables, Steam Generators, Classification, Construction and
working of Simple boiler. Laws of thermodynamics, Refrigeration and Air Conditioning: Definition,
concept, Vapour Compression cycle, C.O.P., working principles and schematic diagrams of
Refrigerator, Air Conditioner. Internal Combustion Engine: Classification, Otto and Diesel cycles ,
Construction and working of SI and CI engine, Two stroke and Four stroke engine, Calculation of
thermal efficiency of cycles. Power Transmission: Classification and applications of mechanical drives
like belts, ropes, chains and gear drives and their velocity ratios, length of belts, ratio of tensions in belts
and ropes, gear train. Machine Tools: Construction, Working and specification of Lathe, Drilling machine
and Milling machine. Foundry: Foundry tools and equipment’s, Procedure for moulding. Welding:
Definition, Gas and Arc welding, Soldering and Brazing. Forging: Definition, applications, tools, Different
Forging operations.

References:

1. Mathur, Mehta and Tiwari, Elements of Mechanical Engineering, (13e), Jain Brother, 2016.
2. Yunus A.Cengel and Michael A Boles, Thermodynamics: An Engineering Approach, (8e),
McGraw Hill Education, 2017.
3. Serope Kalpakjian and Steven Schmid, Manufacturing Engineering and Technology, (7e),
Prentice Hall, 2013.
Department of Information Technology, School of Computing and IT, Manipal University Jaipur
Course Structure for B. Tech (Data Science and Engineering) Program from Academic Session
2020-2021

4. Hajra Choudhury S. K., Hajra Choudhury A.K. and Roy Nirjhar, Elements of Workshop
Technology Vol I & II, Media Promoters, 2010

LN1001: COMMUNICATION SKILLS IN ENGLISH [2 0 0 2]

Communication: Definition, process, features, types, modes, and barriers; LSRW Skills- Listening:
Listening to groups and individuals- active listening, response, and feedback; comprehending
conversations and lectures; Reading: Analysis of passages; skimming and scanning; contextual
meaning; advanced vocabulary; Writing: Paragraph writing; Writing Creative and Critical responses;
Formal letters; Emails; Résumés; Statement of Purpose; Speaking: Presentation, Discussion, and
Debate on current affairs, scientific enquiry, philosophical attributions, literary sensibilities, socio-
political awareness, and cultural sensitivity; Telephonic Etiquettes; Role Play; Team Work; Time
Management; Grooming; Exploring multiple perspectives- critical reasoning, constructive feedback,
persuasive arguments, and effective interpersonal communication.

References:

1. Raman M. and Sharma S., Technical Communication: Principles and Practice, (2e), Oxford
University Press, 2013.
2. Krishnaswamy N., Modern English: A Book of Grammar Usage and Composition, Macmillan
India, 2018.
3. Kumar Sanjay and Pushplata, Communication Skills, Oxford University Press, 2016.
4. Mishra S. and Muralikrishna C., Communication Skills for Engineers, Pearson, 2014.

CS1030: PROBLEM SOLVING USING COMPUTERS [0 0 2 1]

Introduction to Computing, Simple C programming, Branching Control Structures, Looping Control

Structures, 1D and 2D Array programming, String programming, Modular and Recursive Function
Programming – Programs using Pointers, Structures and File manipulation.

References:

1. Brian W. Kernighan and Dennis M. Ritchie, The C Programming language, (2e), Pearson
Education, 1988.
2. Deital. P. J and Deitel. H. M, C: How to program, (7e), Pearson Education, 2010.
3. Balagurusamy. E, Computing fundamentals and C programming, (1e), McGraw-Hill, 2008.
4. Duane Hanselman and Bruce Littlefield, Mastering Matlab 7, Pearson Publication, 2008.
5. Stormy Attaway, Matlab: A practical Introduction to Programming and Problem Solving,
Elsevier, ISBN: 978-0-75-068762-1.

CY1030: ENGINEERING CHEMISTRY LABORATORY [0 0 2 1]

Alkalimetric titration; Redox titration; Estimation of total hardness of water; pK value of an acid by pH-
metric titration; Conductometric acid base titrations; pH Metric acid base titrations; Synthesis of a resin;
Determination of coefficient of viscosity of liquid; Determination cloud and pour point of a given sample
of lubricating oil using cloud and pour point apparatus; Determine the water equivalent of bomb
calorimeter using benzoic acid as fuel.

References:
Department of Information Technology, School of Computing and IT, Manipal University Jaipur
Course Structure for B. Tech (Data Science and Engineering) Program from Academic Session
2020-2021

1. Nad A. K., Mahapatra B., and Ghoshal A., An Advanced Course in Practical Chemistry (8e),
New Central Book Agency, 2017.
2. Mangla B., Sachdeva R., and Sethi B., Engineering Practical Chemistry, (2e), Manakin press,
2018.

DA1001: EXPERIENTIAL LEARNING [0 0 4 2]

The course will be conducted by various engineering departments and will facilitate branch specific
experience based learning for students.

SECOND YEAR
THIRD SEMESTER

MA****: MATHEMATICAL FOUNDATIONS FOR DATA SCIENCE-I [3 0 0 3]

Statistics: Measures of central tendency – mean, median, mode, measures of dispersion – mean
deviation, standard deviation, quartile deviation, skewness and kurtosis. Correlation coefficient,
regression, least squares principles of curve fitting. Probability: Introduction, finite sample spaces,
conditional probability and independence, Bayes’ theorem, one dimensional random variable, mean,
variance. Two and higher dimensional random variables: mean, variance, correlation coefficient.
Distributions: Binomial, Poisson, uniform, normal, gamma, Chi-square and exponential distributions,
simple problems. Moment generating function, Functions of one dimensional and two dimensional
random variables, Sampling theory, Central limit theorem and applications. Partial Differential
Equations: Numerical solutions of partial differential equations by finite difference methods, five-point
formula, Laplace Poisson Equations, Heat equation, Crank Nicolson’s method, Wave equation.
Application of Finite Difference technique.

References:

1. Meyer P.L. “Introduction to probability and statistical applications”, 2nd edn., American
Publishing Co.
2. Hogg and craig , Introduction to mathematical statistics, 6th Edn,2012, Pearson education, New
Delhi.
3. Ross Sheldon M, “Introduction to Probability and Statistics for Engineers and Scientists”,
Elseveir, 2010.
4. William J. Stewart, Probability, Markov Chains, Queues and Simulation.
5. S. Narayanan, T. K. Manicavachagom Pillay, G. Ramanaiah, Advanced mathematics for
engineering students, S. Viswanathan Pvt.. Ltd., 1985.

HS ****: FINANCE & ECONOMETRICS [3 0 0 3]

Basic Economics: Nature and significance, Micro & macro differences, Law of demand and supply,
Elasticity & equilibrium of demand & supply. Time value of money, Interest factors for discrete
compounding, Nominal & effective interest rates, basics of investment and consumption function.
Mathematics of Finance: Present and future worth of single, uniform gradient cash flow. Bases for
comparison of alternatives, Present worth amount, Capitalized equivalent amount, Annual equivalent
amount, Future worth amount, Capital recovery with the return, Rate of return method. Financial
Investment Companies: Mutual fund companies, types of mutual funds, Calculation of Net Asset Values,
Venture Capital Companies, Investment and Merchant Banking companies. Accounting: Concept of
Financial Accounting, Difference between financial, cost and management accounting, Depreciation of
Department of Information Technology, School of Computing and IT, Manipal University Jaipur
Course Structure for B. Tech (Data Science and Engineering) Program from Academic Session
2020-2021

fixed assets: Physical & functional depreciation, Straight-line depreciation, Declining balance method
of depreciation, Sum-of-the years digits method of depreciation, Sinking fund and service output
methods, basics of cost accounting methods – Job costing and Process costing, Cost sheet format and
its uses. Financial Statements: Introduction to balance sheet and profit & loss statement. Basic financial
ratios. Financial Econometrics: Nature of Econometrics and Economic Data. Regression Model,
General Linear Model, Auto-regressive and distributed Lag Models, Simultaneous Equation Models.
Multi-collinearity and Heteroscedasticity, autocorrelation, Qualitative and Limited Dependent Variables
Models, Simultaneous Equation Models: Estimation Methods, Panel Data Regression Models and Time
Series Econometrics.

References:

1. Prasanna Chandra., Fundamentals of Financial Management, Tata Mc-Graw Hill Companies,

New Delhi, 2005.
2. James L Riggs, David D Bedworth and Sabah U Randhawa., Engineering Economics, Tata
McGraw – Hill Publishing Company Ltd, New Delhi, 2004.
3. T. Ramachandran., Accounting and Financial Management, Scitech Publications Pvt. Ltd.
India, 2001.
4. Eugene F. B. & Joel F. H., Fundamentals of Financial Management, th 12 ed., Cengage
Learning Publisher, 2009.
5. Johnston,J, Econometric Methods, McGraw-Hill Book Co., New York.
6. Maddala, G.S, Econometrics, McGraw-Hill Book Co., New York, 3rd Rd.
7. Gujarathi, D.N, Basic Econometrics, Fourth Edition, Tata McGraw-Hill, New Delhi.

DS2101: INTRODUCTION TO DATA ANALYTICS [3 0 0 3]

Steps in Data Analytics Projects, Data Analytics tasks and methods, Data Gathering and Preparation:
Data Formats, Parsing and Transformation, Scalability and Real-time Issues; Data Cleaning:
Consistency Checking, Heterogeneous and Missing Data, Data Transformation and Segmentation;
Exploratory Analysis: Descriptive and comparative statistics, Hypothesis testing, Statistical Inference.
Association rule mining, Clustering. Visualization: Visual Representation of Data, Gestalt Principles,
Information Overloads; Creating Visual Representations: Visualization Reference Model, Visual
Mapping, Visual Analytics, Design of Visualization Applications; Classification of Visualization Systems:
Interaction and Visualization Techniques, Visualization of One, Two and Multi-Dimensional Data, Text
and Text Documents; Visualization of Groups: Trees, Graphs, Clusters, Networks, Software,
Metaphorical Visualization; Visualization of Volumetric Data: Vector Fields, Processes and Simulations,
Visualization of Maps, Geographic Information, GIS systems, Collaborative Visualizations, Evaluating
Visualizations; Recent Trends in Various Perception Techniques: Various Visualization Techniques,
Data Structures used in Data Visualization.

References:

1. Glenn J. Myatt, Wayne P. Johnson, Making Sense of Data I: A Practical Guide to Exploratory
Data Analysis and Data Mining, 2nd Edition, John Wiley & Sons Publication, 2014.
2. Glenn J. Myatt, Wayne P. Johnson, Making Sense of Data II: A Practical Guide to Data
Visualization, Advanced Data Mining Methods, and Applications, John Wiley & Sons
Publication, 2009.
3. E. Tufte. The Visual Display of Quantitative Information, (2e), Graphics Press, 2007.
4. Jules J., Berman D., Principles of Big Data: Preparing, Sharing, and Analyzing Complex
Information, (2e), 2013.
Department of Information Technology, School of Computing and IT, Manipal University Jaipur
Course Structure for B. Tech (Data Science and Engineering) Program from Academic Session
2020-2021

5. Matthew Ward and Georges Grinstein, Interactive Data Visualization: Foundations,

Techniques, and Applications, (2e), A K Peters/CRC Press, 2015.
6. Jurgen Kai-Uwe Brock, Data Design: The Visual Display of Qualitative and Quantitative
Information, (1e), Consulting Press, 2017.
7. Edward R. Tufte, The Visual Display of Quantitative Information, (2e), Graphics Press USA,
2001.
8. Cole Nussbaumer Knaflic, Storytelling With Data: A Data Visualization Guide for Business
Professionals, (1e), John Wiley and Sons, 2015.

DS2102: OBJECT-ORIENTED PROGRAMMING [3 1 0 4]

Introduction: Object-oriented Paradigm and Pillars such as Abstraction, Encapsulation, Inheritance and
Polymorphism; Java Basics: Compilation and Execution of a Java Program, Access Modifiers; Class
and Objects: Class Definition, Creating Objects, Role of Constructors, Method Overloading, Argument
Passing, Objects as Parameters, Access Control; I/O Basics: Reading Console Input, Writing Console
Output; Array and Strings: Arrays in Java, 1-D, 2-D and Dynamic Arrays, String Basics, String
Comparison and Manipulation; Inheritance: Inheritance and its Types, Abstract Class, Inner and Outer
Class, Super, Final, Static Keywords; Package and Interface: In-Built Packages and User Define
Packages, Role of Interface, Polymorphism via Inheritance; Collection Framework & Generics: List, Set,
Map, Generic Classes; Exception Handling: Errors and Exceptions, Types of Exceptions, Handling
Exceptions, Multithreading: Thread Class, Runnable, Thread Life Cycle, Synchronization, Thread
Priority; Event Handling and GUI Programming: Events, Action Listener, Important Swing Package
Classes.

References:

1. Schildt H, Java: The Complete Reference, (10e), Tata McGraw-Hill Education Group, 2017.
2. Balagurusamy E, Programming with Java, (5e), Tata McGraw Hill, 2017.
3. Daniel Liang Y, Introduction to Java Programming, (10e), Pearson Education, 2018.
4. Horstmann CS, Big Java: Early Objects, (5e), Wiley’s Interactive Edition, 2015.

DS2103: DATA STRUCTURES [3 1 0 4]

Introduction - Pointers and Pointer Application, Accessing variables through pointers, pointers to
pointers, pointer arithmetic and arrays, pointers and functions, Recursion- definition, recursive
programs, efficiency of recursion, Stacks, queues, evaluation of expressions, multiple stacks and
queues and its application, Linked lists representations- Singly, doubly, header node, circular along with
the applications, Trees-Binary trees, representation, recursive/ non recursive in order, preorder and
post order tree traversal, level order traversal, Binary search tree, creation, insertion deletion operations
on binary search tree, Additional Binary Tree Operations, Threaded Binary Tree and applications and
Introduction to the concepts of Optimal Binary Search Trees.

References:

1. Behrouz A. Forouzan, Richard F. Gilberg, A Structured Programming Approach Using C, (3e),

Cengage Learning India Pvt. Ltd, India, 2007
Department of Information Technology, School of Computing and IT, Manipal University Jaipur
Course Structure for B. Tech (Data Science and Engineering) Program from Academic Session
2020-2021

2. Ellis Horowitz, Sartaj Sahni, Susan Anderson and Freed, Fundamentals of Data Structures in
C, (2e), Silicon Press, 2007
3. Richard F. Gilberg, Behrouz A. Forouzan, Data structures, A Pseudocode Approach with C,
(2e), Cengage Learning India Pvt. Ltd, India , 2009
4. Tenenbaum Aaron M., Langsam Yedidyah, Augenstein Moshe J., Data structures using C,
Pearson Prentice Hall of India Ltd., 2007
5. Debasis Samanta, Classic Data Structures, (2e), PHI Learning Pvt. Ltd., India, 2010

DS2104: COMPUTER SYSTEM ARCHITECTURE [3 0 0 3]

Number Representation and Arithmetic Operations, Character Representation, Memory locations and
addresses, Memory operations, Addressing modes, CISC and RISC. Hardware for addition and
subtraction, Multiplication, Hardware implementation, Booth's algorithm, Division, Floating point
representation, IEEE standard floating point representation, Floating point arithmetic. Bus organization,
comparison of hardwired and micro-programmed approach, hardwired control design, Booths multiplier
design, Micro-programmed multiplier control unit. Internal organization of memory chips, Structure of
Larger Memories, Cache mapping functions, Replacement algorithms, and virtual memories. Accessing
I/O devices, Interrupts, Enabling and Disabling Interrupts, DMA. Pipeline Organization, Data
Dependencies, Handling Data Dependencies, Hardware Multithreading, SIMD Processing, Graphics
Processing Units (GPUs), Shared Memory Multiprocessors, Interconnection Networks, Cache
Coherence, Write-Through Protocol, Write-Back protocol, Directory-Based Cache Coherence.

References:

1. Carl Hamacher, ZvonkoVranesic and SafwatZaky, Computer Organization and Embedded

Systems, (6e), McGraw Hill Publication, 2012.
2. William Stallings, Computer Organization and Architecture – Designing for Performance, (9e),
PHI, 2015.
3. Mohammed Rafiquzzaman and Rajan Chandra, Modern Computer Architecture, Galgotia
Publications Pvt. Ltd., 2010.
4. D.A. Patterson and J.L.Hennessy, Computer Organization and Design-The Hardware/Software
Interface, (5e), Morgan Kaufmann, 2014.
5. J.P.Hayes, Computer Architecture and Organization, McGraw Hill Publication, 1998.

DS2130: DATA ANALYTICS LAB [0 0 2 1]

Tutorial on tools for Data Analytics & Visualization. Suggested tools are R, MATLAB, WEKA,
RapidMiner. Experiments with datasets to be defined in lab manual, to implement concepts of data
preprocessing, exploratory analysis, comparative statistics, statistical inference, Association and
clustering. Creating Visual Representations- Suggested tools are MSExcel, Power BI, Tableau.
MSExcel Pivot Tables and charts, Visualization of Groups, Volumetric Data, Case Studies in Various
Perception Techniques.

References:

1. Glenn J. Myatt., Making sense of Data: A practical Guide to Exploratory Data Analysis and Data
Mining, (2e), Wiley Press, 2006.
Department of Information Technology, School of Computing and IT, Manipal University Jaipur
Course Structure for B. Tech (Data Science and Engineering) Program from Academic Session
2020-2021

2. Gareth James, Daniela Witten, Trevor Hastie, Robert Tibshirani, “An Introduction to Statistical
Learning with Applications in R”, Springer Science, 2017
3. E. Tufte. The Visual Display of Quantitative Information, (2e), Graphics Press, 2007.
4. Cole Nussbaumer Knaflic, Storytelling with Data: A Data Visualization Guide for Business
Professionals, (1e), John Wiley and Sons, 2015.
5. Brian R. Hunt, Ronald L. Lipsman, Jonathan M. Rosenberg, Kevin R. Coombes, John E.
Osborn, Garrett J. Stuck , Guide to MATLAB: For Beginners and Experienced Users,(2e),
Cambridge University Press, 2011.

DS2131: OBJECT ORIENTED PROGRAMMING LAB [0 0 2 1]

Class and Objects: Class Definition, Creating Objects; Array and Strings: Programs Based Upon 1-D,
2-D and Dynamic Arrays, String Comparison and Manipulation; Inheritance: Inheritance and Its Types,
Abstract Class, Inner and Outer Class, Super, Final, Static Keywords; Collection Framework &
Generics: Using Collection Classes such as Array Lists and Linked Lists Writing Generic Classes;
Exception Handling: Errors and Exceptions, Types of Exceptions; Multithreading: Thread Class,
Runnable, Synchronization, Thread Priority; Event Handling and GUI Programming: Action Listener,
Swing Package.

References:

1. Schildt H, Java: The Complete Reference, (10e), Tata McGraw-Hill Education Group, 2017.
2. Balagurusamy E, Programming with Java, (5e), Tata McGraw Hill Education Group, 2017.
3. Daniel Liang Y, Introduction to Java Programming, (10e), Pearson Education India, 2018.
4. Horstmann CS, Big Java: Early Objects, (5e), Wiley’s Interactive Edition, 2015.

DS2132: DATA STRUCTURES LAB [0 0 2 1]

Reviewing the concepts of pointers, structures and recursion, Studying the operation of stacks and
queues and the associated application programs, Creating dynamic allocation of memory for linked list
and applying it to examples using singly, doubly and circular linked list and their applications, Creation
of binary trees and the application associated with the trees.

References:

1. Behrouz A. Forouzan, Richard F. Gilberg, A Structured Programming Approach Using C, (3e),

Cengage Learning India Pvt. Ltd, India, 2007
2. Ellis Horowitz, Sartaj Sahni, Susan Anderson and Freed, Fundamentals of Data Structures in
C, (2e), Silicon Press, 2007
3. Richard F. Gilberg, Behrouz A. Forouzan, Data structures, A Pseudocode Approach with C,
(2e), Cengage Learning India Pvt. Ltd, India, 2009
4. Tenenbaum Aaron M., Langsam Yedidyah, Augenstein Moshe J., Data structures using C,
Pearson Prentice Hall of India Ltd., 2007
5. Debasis Samanta, Classic Data Structures, (2e), PHI Learning Pvt. Ltd., India, 2010
Department of Information Technology, School of Computing and IT, Manipal University Jaipur
Course Structure for B. Tech (Data Science and Engineering) Program from Academic Session
2020-2021

FOURTH SEMESTER

MA***: MATHEMATICAL FOUNDATIONS FOR DATA SCIENCE-II [3 0 0 3]

Stochastic Process: Markov chains with stationary transition probabilities, properties of transition
functions, classification of states, Stationary distribution of a Markov chain, existence and uniqueness,
convergence to the stationary distribution. Methods based on Markov chains for simulation of random
vectors. MCMC algorithm. Random Walks, queueing processes, branching processes. Gambler’s ruin
problem, transient states. Multivariate Analysis: Multivariate distributions: multivariate normal
distribution and its properties, distributions of linear and quadratic forms, tests for partial and multiple
correlation coefficients and regression coefficients and their associated confidence regions. Data
analytic illustrations. Wishart distribution (definition, properties), construction of tests, union-intersection
and likelihood ratio principles, inference on mean vector, Hotelling's T2. MANOVA- Inference on
covariance matrices. Classification methods: Discriminant analysis, principal component analysis and
factor analysis, Canonical Correlation analysis, Correspondence Analysis, Multidimensional Scaling,
Cluster analysis. Nonparametric and robust methods of multivariate analysis. Graphical representation
of multivariate data.

References:

1. W. Feller: An Introduction to Probability Theory and its Applications, Vol.-II.

2. S. Karlin and H. M. Taylor, A First Course in Stochastic Processes.
3. William J. Stewart, Probability, Markov Chains, Queues and Simulation.
4. P. G. Hoel, S. C. Port and C. J. Stone, Introduction to Stochastic Processes.
5. S. Ross, Introduction to Probability Models.
6. T. W. Anderson, An Introduction to Multivariate Statistical Analysis.

DS2201: DATABASE SYSTEMS [3 1 0 4]

Introduction: Database System Applications, View of data, Database languages, Database users and
Administrator. Introduction to Relational Model: database schema, keys, schema diagrams, Relational
Query Languages, Relational Operations. Introduction to SQL: Data Definition, Basic structure of SQL
queries, Basic operations, Set operations, Null values, Aggregate Functions, Nested subqueries,
Modification of the database. Intermediate SQL: Join expressions, Views, Transactions, Integrity
Constraints, SQL Data types and schemas, Authorization, Advanced SQL-PL/SQL, Cursors, Functions,
Department of Information Technology, School of Computing and IT, Manipal University Jaipur
Course Structure for B. Tech (Data Science and Engineering) Program from Academic Session
2020-2021

Procedures, Triggers, recursive queries, advanced aggregation features. Database Design and Entity-
Relationship Model: Design Process, ER Model, Reduction to Relational schema. Relational Database
design: Functional dependencies, Normal forms, Closure, Canonical cover, Lossless joins ,
dependency preserving decomposition, Storage and File structure, Indexing & Hashing. Query
Processing, Overview, Measure of query cost, selection, Join operation, sorting, Evaluation of
expressions. Query Optimization: Overview, Estimating statistics of expression results, Materialized
Views. Transactions: Concepts, Simple transaction model, Transaction atomicity and durability,
Transaction Isolation, Serializability, Transaction Isolation Levels. Concurrency Control- Lock based
protocols, Deadlock Handling, Multiple granularity, Timestamp-based Protocols, Validation-based
Protocols. Recovery System: Failure classification, Storage, Recovery algorithm, Buffer Management.
Unstructured database: Introduction to NoSQL, Basics of document-oriented database, MongoDB.

References:

1. Abraham Silberschatz, Henry Korth, S. Sudarshan, Database System Concepts, 6th Edition,
McGraw Hill, 2010.
2. Ramez Elmasri, Shamkant Navathe, Fundamentals of Database System, 6th Edition, Addison
Wesley Publications Co., 2010.
3. Raghu Ramakrishnan, Johannes Gehrke, Database Management System, 3rd Edition,
WCB/McGraw Hill Publisher, 2014.
4. Ivan Bayross, SQL, PL/SQL-The Programming Language of Oracle, 4th Edition, BPB
Publications, 2010.
5. Shashank Tiwari, Professional NoSQL, Wiley, 2015.

DS2202: MACHINE LEARNING [3 1 0 4]

Machine Learning Basics: Types of Machine Learning, Supervised vs. Unsupervised Learning,
Parametric vs. non-parametric models. Learning theory-bias/variance tradeoff, union and Chernoff
bounds, VC dimensions, Underfitting, Overfitting, Model selection, Cost functions. Curse of
Dimensionality: Principal Component Analysis (PCA), Difference between PCAs and Latent Factors,
Factor Analysis, Introduction to gradient descent. Bayesian Models: Bayesian concept learning,
Bayesian Decision Theory, Naïve Bayesian, Zero Probability & Laplacian Correction, Bayesian Belief
Networks. Tree Models: information theory, decision tree construction, tuning tree size. ; Support Vector
Machines, kernel functions, k Nearest Neighbours. Regression Models: Linear Regression, Ridge and
Lasso Regression, Logistic Regression, Methods of threshold determination and performance
measures for classification score models. Bagging algorithm, Random Forests, Grid search and
randomized grid search, Partial dependence plots. Ensembling and Boosting Algorithms: Concept of
weak learners, Adaptive Boosting, Extreme Gradient Boosting (XGBoost). Unsupervised learning:
Partitioning , Hierarchical and Density based methods. Artificial Neural Networks: Perceptron,
activation functions, learning rate, Back propagation Algorithm.

References:

1. K. Murphy, Machine Learning: A Probabilistic Perspective, MIT Press, 2012.

2. G. James, D. Witten, T Hastie, R Tibshirani, An introduction to statistical learning with
applications in R, Springer, 2013.
3. J. Han, M. Kamber, J. Pei, Data Mining concepts and techniques, (2e), Morgan Kaufmann-
Elsevier, 2011.
4. T. Hastie, R. Tibshirani, J. Friedman, The Elements of Statistical Learning, (2e), Springer, 2009.
5. T. M. Mitchell, Machine Learning, (Indian Edition), MacGraw Hill, 2017.
6. C. Bishop, Neural Networks for Pattern Recognition, Oxford University Press, 2019.
Department of Information Technology, School of Computing and IT, Manipal University Jaipur
Course Structure for B. Tech (Data Science and Engineering) Program from Academic Session
2020-2021

DS2203: DESIGN & ANALYSIS OF ALGORITHMS [3 1 0 4]

Fundamentals of Algorithms, Important Problem Types, Analysis of algorithm efficiency. Analysis

Framework: Asymptotic Notations and Basic Efficiency Classes, Mathematical Analysis of Nonrecursive
and Recursive Algorithms. Brute force Techniques, Divide and Conquer, Decrease and Conquer:
Insertion Sort, Depth First Search, Breadth First Search, Topological Sorting. Transform and Conquer:
Presorting, BST, Heapsort. Space and Time tradeoffs: Input Enhancement in String Matching. Dynamic
Programming: Warshall's and Floyd's Algorithms, The Knapsack Problem. Greedy Techniques: Prim's,
Kruskal's and Dijkstra's Algorithm, Huffman Trees. Coping with limitations of algorithmic power, P,
NP,and NP-complete Problems, Backtracking: n–Queens problem, Hamiltonian Circuit Problem,
Subset–Sum Problem. Branch and Bound: Assignment Problem, Knapsack Problem, TSP.

References:

1. Anany Levitin, Introduction to the Design and Analysis of Algorithms, (3e), Pearson Education,
2011
2. Ellis Horowitz and Sartaj Sahni, Computer Algorithms/C++, (2e), University Press, 2007.
3. Thomas H. Cormen, Charles E. Leiserson, Ronal L, Rivest, Clifford Stein, Introduction to
Algorithms, (2e), PHI, 2006

DS2204: DATA COMMUNICATION AND NETWORKS [3 0 0 3]

Basic concepts of computer networks, Layered architecture and comparison between ISO/OSI, TCP/IP
layered models. Significance of Datalink layer and protocols. Network layer functionalities, classful,
classless IP addressing, address allocation and role of forwarding module in forwarding the packet
using routing table. Roles played by IP, ARP, RARP, ICMP & IGMP protocols in network layer. Inter-
domain and intra-domain routing algorithms for routing tables. Importance of transport layer in achieving
process-to-process communication. Insight of connection oriented protocol TCP and connectionless
protocol UDP. Features of TCP in achieving flow control, error control and congestion control.
Requirement of different timers in TCP. Drawbacks of IPv4 addressing and new IP addressing scheme
IPv6. Migrating from IPv4 to IPv6. Introduction to application layer, a client/server application program
and a case study. Client-server application program-Dynamic Host Configuration Protocol (DHCP).

References:

1. Behrouz A. Forouzan, TCP/IP Protocol Suite, 4th Edition, Tata McGraw Hill, 2010.
2. Tannenbaum, A.S, Computer Networks, 5th Edition, Prentice Hall of India EE Edition, 2011.
3. Behrouz A. Forouzan, Data Communications and Networking, 5th Edition, Tata McGraw Hill,
2013.
4. Leon Garcia and Widjala, Communication Networks, 5th Edition, Tata McGraw Hill, 2017.

DS2230: DATABASE LAB [0 0 2 1]

Introduction to SQL, Integrity Constraints in SQL, Simple and complex queries, PL/SQL Basics,
Exception Handling, Cursors, Transactions, Procedures, Functions and Packages, Triggers, Exercises
on NoSQL MongoDB, MsAccess. Mini Project.

References:

1. Silberschatz, Korth, Sudarshan, Database System Concepts, (6e), McGraw-Hill, 2011

2. Ivan Bayross, SQL, PL/SQL, (2e/3e), BPB Publications
3. G. Reese, Database Programming with JDBS and Java, (2e), O'Reilly, 2000
Department of Information Technology, School of Computing and IT, Manipal University Jaipur
Course Structure for B. Tech (Data Science and Engineering) Program from Academic Session
2020-2021

DS2231: MACHINE LEARNING LAB [0 0 2 1]

Tutorial on tools for Machine Learning. Python suggested. Experiments with datasets to be defined in
lab manual to perform preprocessing and deploy classifiers such as Bayesian, Decision Trees, Support
Vector Machines, k-nearest neighbor, Regression Models. Classification accuracy measures, improving
classifier performance through ensembling, boosting etc.

References:

1. Hans Peter Langtangen, Python Scripting for Computational Science, (3e), Springer
Publishers, 2014
2. Naomi R. Ceder, The Quick Python Book, (2e), Manning Publications Co., 2010
3. Wesley J. Chun, Core Python Applications Programming, (3e), Prentice Hall Publishers, 2012
4. G. James, D. Witten, T Hastie, R Tibshirani, An introduction to statistical learning with
applications in R, Springer, 2013.

DS2232: DESIGN & ANALYSIS OF ALGORITHMS LAB [0 0 2 1]

Exercises to implement doubly linked list & Binary Search Tree, GCD Techniques. Sorting algorithms.
String Matching, DFS, BFS, Topological sorting, AVL tree, 2-3 tree, Horspool algorithm, Open hash
table, Floyd's algorithm, Warshall's algorithm, Greedy Techniques, Dijkstra's algorithm, Backtracking.

References:

1. Anany Levitin, Introduction to the Design and Analysis of Algorithms, (3e), Pearson Education,
India, 2011.
2. Ellis Horowitz and Sartaj Sahni, Computer Algorithms/C++, (2e), University Press, 2007
3. Thomas H. Cormen, Charles E. Leiserson, Ronal L, Rivest, Clifford Stein, Introduction to
Algorithms, (2e), PHI, 2006.
Department of Information Technology, School of Computing and IT, Manipal University Jaipur
Course Structure for B. Tech (Data Science and Engineering) Program from Academic Session
2020-2021

THIRD YEAR
FIFTH SEMESTER

MA***: MATHEMATICAL FOUNDATIONS FOR DATA SCIENCE –III [3 0 0 3]

Propositional and predicate logic. Number Theory- Divisibility, Euclidean algorithm, prime numbers,
Fundamental Theorem of Arithmetic, greatest common divisors, Fermat’s little theorem, Congruence’s,
solution of congruence’s, Chinese remainder theorem, Euler’s phi function, Quadratic residues and
reciprocity, Jacobi Symbol, binary quadratic forms, equivalence and reduction of binary forms, sums of
two squares, greatest integer function, arithmetic functions, Combinatorial number theory, the inclusion-
exclusion principle, Techniques of numerical calculation, Public key Cryptography. Graph Theory-
Introduction to graphs. Order, size, degree. Walks, paths, cycles. Complements. Sub graphs, cliques.
Isomorphism. Connectedness and connected components. Trees and spanning trees. Distance, radius,
diameter, girth. Vertex connectivity, edge connectivity. Eulerian and Hamiltonian graphs. Measures of
centrality – degree centrality, closeness centrality, betweenness centrality. Matrices associated with
graphs – adjacency, incidence, Laplacian, and distance matrices. Eigenvalues and eigenvectors.
Directed graphs. Graph algorithms – spanning tree algorithm, Dijkstra’s algorithm, Floyd-Warshall
algorithm.

References:

1. Chartrand, Lesniak, and Zhang. Graphs and Digraphs, Fifth Edition. CRC Press. 2010.
2. D. Jungnickel. Graphs, Networks and Algorithms, Fourth Edition. Springer. 2013.
3. Douglas B. West. Introduction to Graph Theory, Second Edition. Prentice Hall. 2001.
4. I. Niven, H.S. Zuckerman, H. L. Montgomery, An Introduction to theory of numbers (fifth edition),
John Wiley & Sons, Inc.
5. Neal Koblitz, A course in Number theory and Cryptography (second edition), Springer-Verlag.

DS3101: DEEP LEARNING [3 0 0 3]

Department of Information Technology, School of Computing and IT, Manipal University Jaipur
Course Structure for B. Tech (Data Science and Engineering) Program from Academic Session
2020-2021

Neural Network Basics: Multi-layer perceptron, Back propagation algorithm, training procedures, Deep
Feed forward Networks: Hidden units, architecture design, Dimensionality reduction, learning time.
Regularization for Deep Learning: Parameter Norm Penalties, Regularization and Under-Constrained
Problems, Dataset Augmentation, Noise-Robustness, Bagging and Other Ensemble Methods, Dropout,
Adversarial Training. Optimization for Training Deep Models: Challenges in Neural Network
Optimization, Convolutional Networks, Recurrent and Recursive Networks, Practical Methodology:
Performance Metrics, Default Baseline Models, Selecting hyper parameters, Debugging Strategies.
Convolutional Networks, Recurrent and Recursive Networks. Hidden Markov models: evaluation
problem, finding the state sequence, HMM as graphical model. Clustering-Mixture densities, partitioning
methods, Expectation-Maximization Algorithms, Mixture of Latent Variable Models, Spectral clustering,
hierarchical clustering. Anomaly detection methods. Recommender systems.

References:

1. Ian Goodfellow, Yoshua Bengio and Aaron Courville, Deep Learning, MIT Press 2016.
2. Alpaydin Ethem, Introduction to Machine Learning, 3rd Edition, PHI Learning Private Limited,
2018.
3. Kevin P. Murphy, Machine Learning: A Probabilistic Perspective, MIT Press, 2012.
4. Simon Haykin, Neural Networks and Learning Machines, PHI, 2008
5. Andrew Ng's Notes on Machine Learning.
6. Rajasekaran S., and Pai G. A. V., Neural Networks, Fuzzy Logic and Genetic Algorithms, PHI
Learning, 2010.

DS3102: OPERATING SYSTEMS [3 1 0 4]

Operating System Structure and Operations, Process Management, Memory Management, Storage
Management, Operating System Services, User Operating System Interfaces, Types of System Calls,
System Programs, Operating System Structure, System Boot ,Overview, Process Scheduling,
Operations on Processes, Inter-process Communication, Multithreaded Models, Thread Libraries,
Scheduling Algorithms, Thread Scheduling, Linux scheduling, Critical Section Problem, Peterson’s
Solution, Synchronization Hardware, Semaphores, Logical Versus Physical Address Space,
Segmentation, Contiguous Memory Allocation, Paging, Structure of Page Table, Segmentation,
Demand Paging, Copy-On-Write, Page Replacement, Allocation of Frames, Thrashing, Disk
Scheduling, Swap-Space Management, System Model, Deadlock: Deadlock prevention, Avoidance,
Detection, Recovery, File Concept, Protection.

References:

1. Silberschatz, P. B. Galvin and G. Gagne, Operating System Concepts, (9e), Wiley and Sons
(Asia) Pvt Ltd, 2013.
2. Milan Milenkovic, Operating systems: Concepts and Design, McGraw Hill, New York, 1987
3. H. M. Dietel, An Introduction to Operating Systems, Addison Wesley, 1990.
4. Andrew S. Tannebaum, Operating System: Design and Implementation, (3e), Prentice Hall of
India, 2008
5. Maurice J Bach, Design of UNIX Operating System, Prentice Hall of India, 1988.

DS3103: NATURAL LANGUAGE PROCESSING [3 0 0 3]

Basics of Finite State Automata, Knowledge in Speech and Language Processing, Ambiguity, Models
and Algorithm. Survey of English Morphology, Finite-State Morphological Parsing, Building a Finite-
State Lexicon, FSTs for Morphological Parsing, Lexicon-Free FSTs. Words and sentence tokenization,
Department of Information Technology, School of Computing and IT, Manipal University Jaipur
Course Structure for B. Tech (Data Science and Engineering) Program from Academic Session
2020-2021

Detecting and Correcting Spelling Errors. Case study: Normalizing Text, Segmentation. N-Grams,
Unsmoothed N-Grams, Smoothing, Interpolation, and Backoff. English Word Classes, Tag-sets for
English, Part-of-Speech Tagging, The Noisy Channel Model for Spelling. Case study: Automatic
Tagging. Constituency, Some Grammar Rules for English, The Penn Treebank project, Dependency
Grammar. Parsing with Context Free Grammars, CKY algorithm, Statistical Parsing.

References:

1. J.E.Hopcroft, R.Motwani & J.D.Ullman , Introduction to Automata Theory Languages, and

Computation, (3rd Edition) , Pearson Education.
2. Daniel Jurafsky & James H. Martin, Speech and Language Processing, (2e), Pearson, 2009.
3. Steven Bird, Ewan Klein and Edward Loper, Natural Language Processing with Python, (1e),
O'Reilly Media, 2009
4. Akshar Bharati, Rajeev Sangal and Vineet Chaitanya, Natural Language Processing: A
Paninian Perspective, Prentice-Hall of India, New Delhi, 1995
5. Steven Bird, Ewan Klein, Edward Loper, Natural Language Processing with Python – Analysing
Text with natural language toolkit , O'Reilly Media, 2009
6. Chris Manning, Hinrich Schutze, Foundations of Statistical Natural Language Processing, MIT
Press, Cambridge, 1999.

DS3104: CLOUD COMPUTING [3 0 0 3]

Introduction to Cloud Computing, Virtualization and Infrastructure as a service, Hyper converged

Infrastructure, Virtual Machines Provisioning and Migration Services, Services and Service Oriented
Architectures, Message-Oriented Middleware, Portals and Science Gateways, Cloud Programming and
Software Environments: Features of Cloud and Grid Platforms, Parallel and Distributed Programming
Paradigms, Sla Management, SLA Management in Cloud, Automated Policy-based Management.
Cloud Security Fundamentals, Vulnerability Assessment, Security and Privacy, Cloud Computing
Security Architecture. AWS, AWS Solution, AWS Services (IAM, VPC, etc.).
References:

1. Rajkumar Buyya, James Broberg, Andrzej Goscinski, Cloud Computing Principles and
Paradigm, Wiley Publications, 2013.
2. Matthew Portnoy Virtualization Essentials, John Wiley and Sons Publication, 2012
3. Thomas Erl, Service oriented Architecture, Pearson publications, 2016
4. Scott D Lowe, Hyper converged Infrastructure implementation strategies, Actual Tech media,
2015.
5. George Reese, Cloud application architectures: building applications and infrastructure in the
cloud, O'Reilly Media, Inc., 2009.
6. Kai Hwang,Geoffrey Fox, JackDongarra,Todd Green, Distributed and Cloud Computing:
Clusters, Grids, Clouds and The Future Internet, Morgan Kaufmann Publishers, 2011

DS3130: DEEP LEARNING LAB [0 0 2 1]

Department of Information Technology, School of Computing and IT, Manipal University Jaipur
Course Structure for B. Tech (Data Science and Engineering) Program from Academic Session
2020-2021

Tutorial on tools for Machine Learning. Tensorflow, Python-Keras suggested. Experiments with
datasets to be defined in lab manual to deploy deep learning algorithms. Case studies or mini projects
in topics such as Sentiment Analysis, Anomaly Detection, Recommender Systems.
References:

1. Hans Peter Langtangen, Python Scripting for Computational Science, (3e), Springer
Publishers, 2014
2. Naomi R. Ceder, The Quick Python Book, (2e), Manning Publications Co., 2010
3. Ahmed Menshawy, Md. Rezaul Karim, Giancarlo Zaccone , Deep Learning with TensorFlow,
Packt Publishing, 2017.
4. Introduction to Tensorflow, https://www.tensorflow.org/learn.

DS3131: OPERATING SYSTEMS LAB [0 0 2 1]

Linux basic commands shell concepts and file filters, shell scripting-1,shell scripting-2, linux system
calls ,thread programming, inter-process communication, process synchronization, cpu scheduling
algorithms, deadlock algorithms, memory management schemes, page replacement algorithms, disk
scheduling algorithms.

References:

1. Maurice Bach, Design of Unix Operating System, Prentice Hall India Learning Private Limited,
2015.
2. Graham Glass, Unix for Programmers and Users- A complete guide, (3e), Prentice Hall India
Learning Private Limited , 2003
3. Sumitabha Das, Unix concepts and applications, (4e), McGraw Hill Education , 2017.
4. Neil Matthew, Richard Stones, Beginning Linux Programming, (4e),Wiley Publication, 2007.
5. A. Silberschatz, P. B. Galvin and G. Gagne, Operating System Concepts, (9e), Wiley and Sons
(Asia) Pte Ltd, 2013.
6. Rachel Morgan, Unix System, McGraw Hill Education, 2007.

DS3132: WEB TECHNOLOGIES LAB [0 1 2 2]

Introduction to HTML, CSS AND Javascript. Web applications using any technology stack or
frameworks. MVC Architecture, Web forms and web controls, State management, validation, themes
and master page. Working with databases, XML, AJAX. Content Management Systems. Developing
mini project using web concepts.
References:

1. Randy Connolly, Ricardo Hoar, Fundamentals of Web Development, 1st Edition, Pearson
Education India, 2015.
2. Luke Welling, Laura Thomson, PHP and MySQL Web Development, 5th Edition, Pearson
Education, 2016.
3. Nicholas C Zakas, Professional JavaScript for Web Developers, 3rd Edition, Wrox/Wiley India,
2012.
4. Danny Goodman, Michael Morrison, Paul Novitski, Tia Gustaff Rayl, JavaScript Bible, 7th
Edition, Wiley, 2010.
5. John Kocer, “Angular 7: By Example (Part One Book 1)”, 2019.
6. Nate Murray, Felipe Coury, Ari Lerner, Carlos Taborda, The Complete Book on Angular, 2019.
Department of Information Technology, School of Computing and IT, Manipal University Jaipur
Course Structure for B. Tech (Data Science and Engineering) Program from Academic Session
2020-2021

SIXTH SEMESTER

HS ****: OPERATIONS RESEARCH [3 0 0 3]

Introduction: Definition, Phases, Applications, Advantages and Limitations of Operations Research.

Linear Programming problems: Assumptions, Formulation of LPP for business and non-business
applications. Graphical solutions, Special cases – Degeneracy, Infeasible Solution, Unbalanced and
Multiple optimal solutions. Minimization and Maximization cases. Simplex algorithm, Concept of dual,
Sensitivity analysis with respect to objective function coefficients and R.H.S. values. Transportation
problem: Formulation, North-West Corner (NWC) Method, Least Cost (LC) Method, Vogel's
Approximation Method (VAM). Testing the solution by Stepping stone, Modified Distribution (MODI)
Method. Maximization, Multiple optimal solutions, Degeneracy and Unbalanced problems. Post
optimality analysis. Assignment problem: Solution algorithm for Assignment Problems. Unbalanced,
multiple optimal solutions, Maximization and Application problems. Travelling salesman / Job
sequencing problem: Solution algorithm for Travelling Salesman Problem, Application to job
sequencing problem Game theory: Introduction to game theory, Two person- zero sum games, Pure
and Mixed Strategies, Solution methods for 2 x 2 games, Graphical method (2 x n games; m x 2 games),
Simulation of queuing system - Steps in simulation, Application and Limitations, Monte- Carlo
technique-Problems involving Waiting line situations and Selection of crew members. Critical Path
Method (CPM): General frame work, Introduction to elements of network, conventions adapted in
drawing network, analysing the network. Calculation of event and Activity times, Total Float, Free Float,
Independent float, Critical path, Determination of project duration, Project Crashing. Applications and
Limitations of CPM. Project Evaluation and Review Technique (PERT): Calculation of
Probabilistic/Expected event and Activity times, Variance of activity duration, Determination of critical
path, probability/expectation of project completion.

References:
Department of Information Technology, School of Computing and IT, Manipal University Jaipur
Course Structure for B. Tech (Data Science and Engineering) Program from Academic Session
2020-2021

1. Taha H. A., Operations Research, Pearson Education (7e), 2002.

2. W.L. Winston, Operations Research, Thomson Asia, 2003.
3. Vohra N. D., Quantitative Techniques in Management, 2007.
4. Sharma S. D., Operations Research (14e), Kedar Nath Ramnath Publications, 2005
5. Kanthiswaroop, Gupta and Manmohan, Operations Research, Sultan Chand and Sons, 2003.

DS3201: ARTIFICIAL INTELLIGENCE [3 1 0 4]

Foundations of Artificial Intelligence: Intelligent Agents and Environments, The concept of Rationality,
Classification ,working of agents, Single and Multi-Agent System, Performance Evaluation of Agents,
Architecture of Intelligent Agents. AI Problems: Problem Space, Problem analysis. Problem Solving
Techniques: Heuristic search Techniques, Uninformed search strategies, Games: Optimal decision in
games, Alpha Beta Pruning Knowledge based agents, The Wumpus World. Logic: Propositional logic,
Propositional Theorem Proving. Representation, Syntax and semantics of First order logic, Using First
order logic, Knowledge engineering in First order. Ontological Engineering: Categories and objects,
Reasoning systems for categories, Acting under uncertainty. Semantic Web Vision, Layered approach.
RDF data models, RDFS. , Querying Semantic Web: SPARQL matching patterns, filters, Ontology and
Information Systems, Ontology Languanges : OWL, Ontology Reasoning: Monotonic rules, Rule
interchange format, Semantic web rules languages, RuleML, Ontology Design and Management,
Ontology Programming. Reinforcement learning: Markov Decision Process, Bellman equations, value
and policy iteration, Linear Quadratic Regulation, Linear Quadratic Guassian, Q-learning, policy search,
POMDPs.

References:

1. Russell S., and Norvig P., Artificial Intelligence A Modern Approach (3e), Pearson 2010.
2. Rich E., Knight K., Nair S.B., Artificial Intelligence (3e), Tata McGraw Hill, 2008.
3. Grigoris Antoniou, Paul Groth, Frank van vanHarmelen and Rinke Hoekstra, A Semantic Web
Primer, MIT Press, 2012.

DS3202: PARALLEL PROGRAMMING [3 1 0 4]

Introduction: Traditional Systems, Processor Architectures, Performance Metrics and enhancement,

Laws of Parallel Programming, Bottlenecks, Parallel Programming. Multicore Systems: Uniprocessor
Systems, Multiprocessor Systems, Introduction to OpenMP; Overview of OpenMP: Creating threads,
threads synchronization, performance considerations; OpenMP language features: Parallel Construct,
sharing work among threads, clauses to control parallel and work-sharing constructs If Clause,
Num_threads Clause, Ordered Clause, Reduction Clause, Copyin Clause, Copy private Clause,
Advanced OpenMP Constructs, Nested Parallelism, Flush Directive, Thread private Directive; Open MP
Case studies. Many Core Systems: Heterogeneous Parallel Computing, Introduction to Data
Parallelism; Data parallelism and CUDA C: Data Parallelism ,CUDA Program Structure , Device
Global Memory and Data Transfer, Kernel Functions and Threading; Data-Parallel Execution
Model: CUDA Thread Organization, Mapping Threads to Multidimensional Data, Matrix-Matrix
Multiplication, Synchronization and Transparent Scalability, Assigning Resources to Blocks, Thread
Scheduling and Latency Tolerance; CUDA Memories: Importance of Memory Access Efficiency,
CUDA Device Memory Types Strategy for Reducing Global Memory Traffic, Tiled Matrix, Memory
as a Limiting Factor to Parallelism; Performance Considerations: Warps and Thread Execution, Global
memory bandwidth, Dynamic partitioning of execution resources; CUDA Case Studies.
References:
Department of Information Technology, School of Computing and IT, Manipal University Jaipur
Course Structure for B. Tech (Data Science and Engineering) Program from Academic Session
2020-2021

1. D. Kirk, W. Hwu, “Programming Massively Parallel Processors”, 2nd Edition, Elsevier Inc. 2012.
2. A. Grama et al., “Introduction to Parallel Computing”, 2nd Edition, Addison Wesley 2003.
3. E. Stotzer, C. Terboven,” Using OpenMP – The Next Step”, 1st Edition, MIT Press, 20017.
4. S. Cook, “CUDA Programming: A Developer's Guide to Parallel Computing with GPUs”, 1st
edition, Morgan Kaufmann, 2012.
5. J. Sanders, E. Kandrot, “CUDA by example: an introduction to general-purpose GPU
programming”, Addison-Wesley Professional, 2010.

DS3203: BIG DATA ANALYTICS [3 1 0 4]

Introduction to Big Data: evolution, structuring, elements, big data analytics, distributed and parallel
computing for big data, Hadoop, Cloud computing and big data, in-memory computing technology for
big data, Big Data Stack, Virtualization and Big Data, Hadoop: ecosystem, Hadoop Distributed File
System (HDFS), MapReduce: MapReduce Framework, optimizing MapReduce jobs, MapReduce
Applications, Understanding YARN architecture, HBase, Exploring Hive, Analyzing data with Pig, Using
Oozie, Introduction to Mahout, role of HBase in Big Data Processing, RHadoop: Data Analysis Using
the MapReduce Technique in RHadoop, Spark: Core Concepts, Spark’s Python and Scala shells,
Programming with RDD: RDD Operations, Passing Functions to Spark, Common Transformations and
Actions, Mining Data Streams: Streams Concepts, stream Data Model and Architecture, stream
computing, filtering Streams, estimating Moments, decaying window, Real time Analytics Platform
(RTAP) Applications, Case studies: Real Time Sentiment Analysis, Stock Market Predictions.
References:

1. Vignesh Prajapathi, Big Data Analytics with R and Hadoop, Packt Publishing, 2013.
2. Holden Karau, Andy Konwinski , Patrick Wendell, Matei Zaharia, Learning Spark: Lightning-
Fast Big Data Analysis, 1st Edition, O’Reilley Media Inc, 2015.
3. Michael Minnelli, Michele Chambers, Big Data Big Analytics: Emerging Business Intelligence
and Analytic Trends for Today's Businesses, Wiley India Pvt. Ltd., 2013.
4. Arvind Sathi, Big Data Analytics, MC Press, LLC, 2012.

DS3204: DATA PRIVACY AND SECURITY [3 0 0 3]

Introduction to Data Privacy, types of privacy attacks, Data linking and profiling, access control models,
role based access control, privacy policies, their specifications, privacy policy languages, privacy in
different domains-medical, financial, etc. Mathematical model for comparing real-world data sharing
practices, computing privacy and risk measurements. Demographics and Uniqueness. Protection
Models-Null-map, k-map, Wrong map. Survey of techniques-Protection models (null-map, k-map,
wrong map), Disclosure control, Inferring entity identities, entry specific databases. Computation
systems for protecting delimited data-Min Gen, Datafly, Mu-Argus, k-Similar. Introduction to Security:
The OSI Security Architecture, Security Attacks, Services and Mechanisms, Model for Network
Security, Number theory, Cryptographic Hash Functions, Digital Signatures, System Security,
Symmetric Encryption and Message Confidentiality, Substitution ciphers, Stream ciphers, Public-key
cryptography and Message Authentication, Key Distribution and Authentication, Transport Layer
Security, Wireless Network Security, E-mail Security, IP Security, Security Management Systems,
Need for IT Security, Intrusion Prevention and Detection Systems, Cyber Security. Security metrics:
Design, Data sources, Analysis of security metrics data, Measuring security cost and value, Different
context for security process management. Acquisition and Duplication: Sterilizing Evidence Media,
Acquiring Forensics Images, Acquiring Live Volatile Data, Data Analysis, Metadata Extraction, and File
System Analysis.
References:
Department of Information Technology, School of Computing and IT, Manipal University Jaipur
Course Structure for B. Tech (Data Science and Engineering) Program from Academic Session
2020-2021

1. Ronald Leenes , Rosamunde van Brakel , Serge Gutwirth , De Hert, Paul, Data Protection and
Privacy: The Age of Intelligent Machines (Computers, Privacy and Data Protection), Hart
Publishing (December 28, 2017)
2. B. Raghunathan, The Complete Book of Data Anonymization: From Planning to
Implementation, Auerbach Pub, 2016.
3. L. Sweeney, Computational Disclosure Control: A Primer on Data Privacy Protection, MIT
Computer Science, 2017
4. William Stallings, Cryptography and Network Security: Principles and Practice, 7th Edition,
Pearson Education, 2017.
5. William Stallings, Network Security Essentials: Applications and Standards, 6th Edition,
Pearson Education, 2014.
6. Atul Kahate, Cryptography and Network Security, 3rd Edition, Tata McGraw-Hill Publishing
Company Limited, 2013.
7. Lance Hayden, IT Security Metrics, Tata McGraw Hill, 2016.

DS3230: ARTIFICIAL INTELLIGENCE LAB [0 0 2 1]

Intelligent Agents and case study, AI Problems- Problem Space: Heuristic search Techniques;
Constraint satisfaction problems, Semantic Networks, Propositional and Predicate Logic: Propositional
and Predicate calculus, semantics for predicate calculus, theorem prover, inference rules, unification,
Resolution, Refutation in predicate logic; Communicating, Perceiving, and Acting case study, Genetic
Algorithm and its use cases. Fuzzy Logic and its case study.
References:

1. E. Rich, K. Knight, and S.B. Nair, “Artificial Intelligence”, 3rd Ed., Tata McGraw Hill, 2009.
2. S. Russell, and P. Norvig, “Artificial Intelligence: A Modern Approach”, Prentice Hall, 2011.

DS3231: PARALLEL PROGRAMMING LAB [0 0 2 1]

Communications in MPI, Collective communications in MPI, Error Handling in MPI, OpenCL introduction
and programs on vectors, OpenCL programs on strings and to check the execution time in OpenCL,
OpenCL programs on matrix, OpenCL programs on sorting and searching, CUDA Programs on arrays
and matrices, CUDA programs on strings.
References:

1. D. Kirk, W. Hwu, “Programming Massively Parallel Processors”, 2nd Edition, Elsevier Inc. 2012.
2. A. Grama et al., “Introduction to Parallel Computing”, 2nd Edition, Addison Wesley 2003.
3. E. Stotzer, C. Terboven,” Using OpenMP – The Next Step”, 1st Edition, MIT Press, 20017.
4. S. Cook, “CUDA Programming: A Developer's Guide to Parallel Computing with GPUs”, 1st
edition, Morgan Kaufmann, 2012.
5. J. Sanders, E. Kandrot, “CUDA by example: an introduction to general-purpose GPU
programming”, Addison-Wesley Professional, 2010.

DS3232: BIG DATA ANALYTICS LAB [0 0 2 1]

Tutorial on tools for Big Data tools and technologies. Cloudera Distribution for Hadoop, Apache
Cassandra , MongoDB suggested. Experiments with big datasets to be defined in lab manual, to deploy
big data implementations of machine learning algorithms. Case studies or mini projects to be defined
for big data.
References:
Department of Information Technology, School of Computing and IT, Manipal University Jaipur
Course Structure for B. Tech (Data Science and Engineering) Program from Academic Session
2020-2021

1. Vignesh Prajapathi, Big Data Analytics with R and Hadoop, Packt Publishing, 2013.
2. Holden Karau, Andy Konwinski , Patrick Wendell, Matei Zaharia, Learning Spark: Lightning-
Fast Big Data Analysis, 1st Edition, O’Reilley Media Inc, 2015.
3. Michael Minnelli, Michele Chambers, Big Data Big Analytics: Emerging Business Intelligence
and Analytic Trends for Today's Businesses, Wiley India Pvt. Ltd., 2013.
4. Arvind Sathi, Big Data Analytics, MC Press, LLC, 2012.

FORTH YEAR
SEVENTH SEMESTER

DS4170: INDUSTRIAL TRAINING [0 0 0 1]

The students are required to undergo training/course/workshop during vacation in Industries, Software
firms as well as reputed academic institution (IIT, NIT etc.) which are beyond the scope of normal
curriculum in the field of Data Science. This is required to meet the industry needs and make students
employable Industrial Training.

EIGHTH SEMESTER

DS4270: PROJECT WORK/ PRACTICE SCHOOL [0 0 0 12]

Project Work targeting students who wish to pursue research & development in industries or higher
studies in field of Data Science and Engineering. The duration of B.Tech. final year project is one
Department of Information Technology, School of Computing and IT, Manipal University Jaipur
Course Structure for B. Tech (Data Science and Engineering) Program from Academic Session
2020-2021

Semester along with coursework of 8th semester. Students are required to undertake innovative and
research oriented projects, which not only reflect their knowledge gained in the earlier semesters but
also additional knowledge gained from their own effort. They must show the phase wise development
of their project submitting the appropriate documents at the end of each phase. The student must put
in effort to find answers to questions about the applications, which will also enhance the value of the
project report. There will be one interim and one final seminar for evaluation of the project.

➢ Design and model a system based on real life application.

➢ Plan and execute well defined objectives.
➢ Work in team at component level and system level, Integrate or reuse with-existing
components.
➢ Derive performance metrics and assess quantitatively the performance of system Report and
present the findings in standard formats.

PROGRAM ELECTIVES

DS4140: ADVANCED DATA STRUCTURES [3 0 0 3]

Advanced Search Trees: Review of Binary Search Trees, AVL Tree, R-B Trees and Splay Trees,
Advanced Search Data Structures Like- Treaps, Skip Lists, Finger Search Trees, Biased Search Trees;
Data Structures For External Storage: Review of 2-3-4 Trees and 2-3 Trees, B-Tree, B+ Trees, Priority
Queues and Concatenable Queues Using 2-3 Trees; Advanced Heaps: Review of Heaps, Binomial
Trees, Implementing Binomial Heaps and its Operations, Structure of Fibonacci Heaps, Mergeable
Heap Operations, Decreasing Key and Deleting a Node, Bounding the Maximum Degree, Amortized
Analysis of Fibonacci Heaps; Dictionaries and Hashing: Review of Dictionaries and Implementation,
Review of Hashing- The Bucket Approach, Index File Approach, Universal Hashing, Perfect Hashing,
Locality-Sensitive Hashing, Collision Resolution Techniques in Hashing, Separate Chaining, Open
Addressing, Quadratic Probing, Double Hashing, Rehashing, Extendible Hashing, Synopses,
Fingerprints, Fault Tolerant Data Structures; Graph Theory And Sorting Network: Review Of Graph
Representation and Basic Algorithms, Algorithms for Connectedness, Finding all Spanning Trees in a
Weighted Graph, Bipartite Graphs: Maximum Matching, the Hungarian Algorithm, Maximum Flow in a
Transport Network - the Ford–Fulkerson Algorithm; Sorting Network: Comparison Network, Zero-One
Principle, Bitonic Sorting and Merging Network Sorter.

References:
Department of Information Technology, School of Computing and IT, Manipal University Jaipur
Course Structure for B. Tech (Data Science and Engineering) Program from Academic Session
2020-2021

1. Cormen, T. H., Leiserson, C. E., Rivest, R.L., and Stein, C. Introduction to Algorithms, (3e),
MIT Press, 2009.
2. Aho, V., Hopcroft, J. E. and Ullman, J. D. The Design and Analysis of Computer Algorithms,
(1e), Fourth Impression, Pearson Education, 2009.
3. Horowitz, E., Sahni, S. and Rajasekaran, S, Computer Algorithms, (2e), University Press, 2007.
4. Weiss, M. A, Data Structures and Algorithm Analysis in C++, (2e), Pearson Education India,
2004.
5. Goodrich, M. T., Tamassia, R., Algorithm Design, (1e), John Wiley, 2002.

DS4141: SOFTWARE ENGINEERING [3 0 0 3]

Introduction: The software engineering discipline-evaluation and impact, Programs vs. software
products, Changes in software development practice, System engineering, handling complexity through
Abstraction and Decomposition. Software life cycle: Waterfall model, Iterative waterfall model,
Prototype model, Evolutionary model, Spiral model, RAD model, Agile models, comparison of different
life cycle models. Software project management: Responsibilities of project manager, Project planning,
Metrics for project size estimation techniques, Empirical estimation techniques, COCOMO, Halstead’s
software science, Staffing level estimation, Scheduling, Organization and team structure, Staffing, Risk
management, Software configuration management. Requirements analysis and specification:
Requirements gathering and analysis, Software requirement specification (SRS), Traceability,
Characteristics of a Good SRS Document, IEEE 830 guidelines, overview of formal system
development techniques. Software design: Good Software Design, Cohesion and coupling, Control
Hierarchy: Layering, Control Abstraction, Depth and width, Fan-out, Fan-in, Software design
approaches, object oriented vs. function oriented design. Function-oriented and Object Oriented
software design: Overview of SA/SD methodology, structured analysis, Data flow diagram, Extending
DFD technique to real life systems, Structured design, Detailed design, Design review. Unified Modeling
Language (UML), UML Diagrams: Static and Dynamic User interface design: Characteristics of a good
user interface, User Guidance and Online Help, Mode-based Vs Mode-less Interface, Types of user
interfaces, Component-based GUI development, User interface design methodology: GUI design
methodology, Task and object modeling, Selecting a metaphor, Interaction design and rough layout,
User interface inspection. Coding and testing: Coding, Code testing, Test driven development, testing
tools, Introduction to Agile software development and DevOps. Software reliability and quality
management: Software reliability, Statistical testing, Software quality and management, ISO 9000, SEI
capability maturity model, Personal software process (PSP), Six sigma, Software quality metrics
Computer aided software engineering: Case and its scope, Case environment, Case support in
software life cycle, Other characteristics of case tools, Towards second generation case tool,
Architecture of a case environment. Legal Aspects of Software Engineering, Business Aspects of
Software Engineering. Software maintenance and reuse: Characteristics of software maintenance,
Software reverse engineering, Software maintenance processes model, Estimation maintenance cost.
Basics issues in any reuse program, Reuse approach, Reuse at organization level.

References:

1. Rajib Mall, “Fundamentals of Software Engineering”, PHI, 2016.

2. Richard Fairley, “Software Engineering Concepts”, Tata McGraw Hill, 2015.
3. Jalote Pankaj, “An integrated approach to Software Engineering”, Narosa, 2016.
4. Pressman R, “Software Engineering- Practioner Approach”, McGraw Hill, 2016.

DS4142: BLOCK CHAIN TECHNOLOGIES [3 0 0 3]

Department of Information Technology, School of Computing and IT, Manipal University Jaipur
Course Structure for B. Tech (Data Science and Engineering) Program from Academic Session
2020-2021

Introduction, Structure of a Block, The Genesis Block, Linking Blocks in the Blockchain, Merkle Trees,
Simplified Payment Verification, Using hash functions to chain blocks, for Proof-of-Work, Digital
Signatures to sign transactions, Distributed Ledger, Byzantine Agreement, Eventual Consistency &
Bitcoin Consistency- Availability and Partitions, Bitcoin, Smart Contracts, Weak Consistency,
Distributed Storage, Consistent Hashing, Hypercubic Networks, Mining and Consensus: Decentralized
Consensus, Independent Verification of Transactions Mining Nodes, Aggregating Transactions into
Blocks, Constructing the Block Header, Successfully Mining the Block, Validating a New Block,
Assembling and Selecting Chains of Blocks, Consensus Attacks, Changing the Consensus Rules, Soft
Fork Signaling with Block Version, Consensus Software Development, Ethereum and Bitcoin, block
format, mining algorithm, proof-of-stake (PoS) algorithm, account management, contracts and
transactions, Solidity language, account management, contracts and transactions, Applications of
Blockchain :Case studies

References:

1. Andreas M. Antonopoulos, “Mastering Bitcoin: unlocking digital cryptocurrencies”, O'Reilly

Media, (1e) 2014
2. Roger Wattenhofer, “Distributed Ledger Technology, The science of the Blockchain”, Inverted
Forest Publishing, (2e), 2017.
3. Antonopoulos, Andreas M. and Wood, Gavin. “Mastering Ethereum”, O’Reilly Media, 2018.
4. George Icahn, “Blockchain:the complete guide to understanding blockchain technology”,
Amazon publishers, 2017.

DS4143: INTERNET OF THINGS [3 0 0 3]

Introduction to internet of things, IoT in global context, Design Principles, IoT Technology Fundamental-
Devices and gateways, Local and wide area networking, Data management, Business processes in
IoT, IoT reference Architecture, IoT Domain Model, Functional Model. Information Model,
Communication Model, Deployment and Operational View, IoT Prototyping- Prototyping Embedded
Devices, Electronics, Sensors, Actuator, Embedded Computing Basics, Arduino, Raspberry Pi,
BeagleBone Black, IoT Use Cases - Industrial Automation, Smart Home, Smart City, Commercial
Building Automation.

References:

1. McEwen A., Designing the Internet of Things, Wiley, 2014

2. Holler J., From Machine-to-Machine to the Internet of Things: Introduction to a New Age of
Intelligence, Academic Press, 2014.
3. Francis daCosta, Rethinking the Internet of Things: A Scalable Approach to Connecting
Everything, Apress Publications, 2013
4. Pethuru R., The Internet of Things: Enabling Technologies, Platforms, and Use Cases, CRC
Press, 2017
5. Vijay M., Internet of Things (A Hands-on-Approach), Universities Press, 2014
6. Daniel M., Building the Internet of Things with IPv6 and MIPv6: The Evolving World of M2M
Communications, Wiley, 2013.
Department of Information Technology, School of Computing and IT, Manipal University Jaipur
Course Structure for B. Tech (Data Science and Engineering) Program from Academic Session
2020-2021

DS4144: QUANTUM COMPUTING [3 0 0 3]

Introduction, Fundamental concepts. Quantum bits, Quantum computation, Quantum algorithms,

Quantum Information, Introduction to Quantum Mechanics, Liner algebra, Postulates of quantum
mechanics, Quantum Computation, Quantum circuits, Controlled operations, Measurement, Universal
quantum gates, The Quantum Fourier Transform, The quantum Fourier transform, Phase estimation,
Applications, Quantum Search Algorithms, Quantum counting, Speeding up the solution of NP-
Complete problems, Quantum Information, Classical noise and Markov processes, Quantum
Operations, Quantum Error Correction, The Shor code, Theory of quantum error correction, Entropy
and Information, Shannon entropy, Basic properties of entropy, Von Neumann entropy, Quantum
Information Theory, Distinguishing quantum states and the accessible information, Data compression,
Classical information versus noisy quantum channels, Quantum information versus noisy quantum
channels, Entanglement as a physical resource, Quantum cryptography.

References:

1. Michael A Nielsen, and Isaac L. Chuang “Quantum Computation & Quantum Information”,
(10e), Cambridge University Press, 2011.
2. F. Benatti, M. Fannes, R. Floreanini, and D. Petritis, “Quantum Information, Computation and
Cryptography” Springer, 2010.
3. Mika Hirvensalo, “Quantum Computing”, (2e), Springer-Verlag New York, 2004.
4. Jozef Gruska, “Quantum Computing”, McGraw Hill, 1999.
5. Phillip Kaye, Raymond Laflamme and Michele Mosca, “An Introduction to Quantum
Computing”, Qxford University Press, 2006.

DS4145: SOCIAL NETWORK ANALYSIS [3 0 0 3]

Introduction to Social Web, Nodes, Edges and Network Measures, Describing Nodes and Edges,
Describing Networks, Layouts, Visualizing network features, The role of Tie strength, Measuring Tie
strength and its network structures, network propagation, Link prediction, entity resolution, Case study,
Introduction to community discovery, communities in context, quality functions, The Kernighan-Lin
algorithm, Agglomerative algorithms, spectral algorithms, multi-level graph partitioning, Markov
clustering, Other approaches, Introduction to social influence, Influence related statistics, social
similarity and influence, Homophily, Existential Test for social influence, Influence and actions, Influence
and interactions, influence maximization in viral marketing.

References:

1. Jennifer Golbeck., Analysing the Social Web, Morgan Kaufmann publications, 2013
2. Charu C. Aggarwal, Social Network Data Analytics, Springer publications, 2011
3. John Scott, Social Network Analysis, (3e), Sage publications limited, 2013
4. Jay Goldman, Facebook Cookbook, O’Reilly, 2009
5. Shamanth Kumar, Fred Morstatter, Huan Liu, Twitter Data Analytics, Springer publications,
2013

DS4146: DATA FORENSICS [3 0 0 3]

Introduction, the history of forensics, the objectives of computer forensics, computer forensics flaws and
risks, computer forensics- rules, procedures and legal issues, computer forensics lab, essential
laboratory tools. Forensics investigation process: Introduction, investigating computer crime,
conducting a computer forensics investigation, Recovering Deleted Files and Deleted Partitions, Data
Department of Information Technology, School of Computing and IT, Manipal University Jaipur
Course Structure for B. Tech (Data Science and Engineering) Program from Academic Session
2020-2021

Acquisition and Duplication. Hard disk and file systems: Introduction, file systems and hard disks, digital
media devices, image file forensics, boot process-windows, linux and macintosh. Advanced forensics:
Operating system forensics, Network forensics, Database forensics, Mobile forensics; cloud forensics,
Malware forensics, investigating web and email attacks. Forensics analysis, validation and Report
writing: Determine what data to collect and analyze, validating forensics data, addressing data hiding
techniques, understanding the importance of reports, guidelines for writing reports, generating report
findings with forensics software tools.

References:

1. Nelson, Phillips Enfinger, Steuart, Computer Forensics and Investigations, CENGAGE

Learning, 2013.
2. Dave Kleiman, The official CHFI study guide , Syngress publishing, 2017
3. Chris Pogue, Unix and Linux forensic analysis DVD toolkit, Syngress publishing, 2008.
4. John R. Vacca, Charles, Computer Forensics, Computer Crime Investigation, River Media,
2005.
5. Eoghan Casey, Handbook of digital forensics and investigation, Elsevier Academic press,
2010.
6. Harlan Cavery, Windows forensic analysis DVD toolkit, Syngress Publishing, 2009.
7. Keith J. Jones, Richard Bejtiich, Curtis W. Rose, Real Digital Forensics, Addison
Wesley Pearson Education, 2005.

DS4147: INFORMATION RETRIEVAL [3 0 0 3]

Introduction to Information Retrieval: Mathematical Basics, Vector spaces and Similarity, Probabilities
and Statistics, Text Analysis; Pre-processing: Document processing, Stemming, String Matching, Basic
NLP tasks – POS Tagging Shallow Parsing; Overview of Text Retrieval Systems: System Architecture,
Boolean Models, Inverted Indexes, Document Ranking, IR Evaluation; Retrieval Models and
Implementation: Vector Space Models, TF-IDF Weighting, Retrieval Axioms, Implementation Issues,
Probabilistic Models; Statistical Language Models: Okapi/BM25, Language Models, KL-divergence,
Smoothing; Query Expansion and Feedback: Query Reformulation, Relevance feedback, Pseudo-
Relevance Feedback, Language Model Based, Feedback; Web Search Engines: Models of the Web,
Web Crawling; Static Ranking: Page Rank HITS, Query Log Analysis, Adversarial IR, Information
Filtering: Adaptive Filtering, Collaborative Filtering, User Interfaces, Text Classification, Naïve Bayes,
K-nearest neighbors, Feature selection, Semi-supervised Learning; Text Clustering: Vector-space
Clustering; K-means, EM algorithm, Text shingling; Graph-Based Methods: WordNet, Document and
Word Graphs, Network Analysis, Random Walks, Harmonic Functions.

References:

1. Christopher D. Manning, Prabhakar Raghavan and Hinrich Schütze, Introduction to Information

Retrieval”, (2e), Cambridge University Press, 2015.
2. B. Croft, D. Metzler, T. Strohman, Search Engines: Information Retrieval in Practice, (3e), MIT
Press, 2016.
3. Chengxiang Zhai, Statistical Language Models for Information Retrieval (Synthesis Lecture
Series on Human Language Technologies), (2e), Morgan & Claypool Publishers, 2017.

DS4148: SOFT COMPUTING TECHNIQUES [3 0 0 3]

Department of Information Technology, School of Computing and IT, Manipal University Jaipur
Course Structure for B. Tech (Data Science and Engineering) Program from Academic Session
2020-2021

Introduction to Soft Computing: Concept of Computing Systems, Soft Computing Versus Hard
Computing, Characteristics of Soft Computing, Some Applications of Soft Computing Techniques;
Fuzzy Logic: Introduction to Fuzzy Logic- Fuzzy Sets and Membership Functions, Operations on Fuzzy
Sets, Fuzzy Relations, Rules, Propositions, Implications and Inferences, Defuzzification Techniques -
Fuzzy Logic Controller Design, Some Applications of Fuzzy Logic; Artificial Neural Networks: Biological
Neurons and its Working, Simulation of Biological Neurons to Problem Solving, Different ANNs
Architectures, Training Techniques for ANNs, Applications of ANNs to Solve Some Real Life Problems;
Nature Inspired Algorithms: Genetic Algorithms, Concept of "Genetics" and "Evolution" and its
Application to Probabilistic Search Techniques, Basic GA Framework and Different GA Architectures,
GA Operators- Encoding, Crossover, Selection, Mutation, etc., Solving Single-Objective Optimization
Problems Using GAs, Particle Swarm Optimization- Implementation, Operators, Case Studies, Ant Bee
Colony Optimization- Implementation, Operators, Case Studies; Multi-Objective Optimization: Problem
Solving Concept of Multi-Objective Optimization Problems (MOOPs) and Issues of Solving Them. Multi-
Objective Evolutionary Algorithm (MOEA), Non-Pareto Approaches to Solve MOOPs, Pareto-Based
Approaches to Solve MOOPs, Some Applications with MOEAs.

References:

1. Martin, F., Neill, Mc. and Thro, E., Fuzzy Logic: A Practical approach, AP Professional, 2000.
2. Ross, T, J., Fuzzy Logic with Engineering Applications, (3e), Willey India, 2010.
3. Kasabov, N. K., Foundations of Neural Networks, Fuzzy Systems, and Knowledge Engineering,
MIT Press, 1998.
4. Ibrahim, A. M., Fuzzy Logic for Embedded Systems Applications, Elsevier Press, 2004.
5. Mitchell, M., An Introduction to Genetic Algorithms, MIT Press, 2000.
6. Goldberg, D. E., Genetic Algorithms In Search, Optimization And Machine Learning, Pearson
Education India, 2002.
7. Rajasekaran, S. and Vijayalakshmi Pai, G. A., Neural Networks, Fuzzy Logic and Genetic
Algorithms: Synthesis, and Applications, Prentice Hall India, 2007.
8. Pratihar, D. K., Soft Computing, (1e), Narosa Publishing, 2008.
9. Jang, J.-S. R., Sun, C.-T. and Mizutani, E., Neuro-Fuzzy and Soft Computing”, (1e), PHI
Learning, 2009.
10. Haykin, S., Neural Networks and Learning Machines, (3e), Prentice Hall India, 2011.

DS4149: ENTERPRISE DATA ARCHITECTURE [3 0 0 3]

Introduction to Enterprise Architecture , Overview, core elements , analysis and planning approaches,
Structure and culture of Enterprises, Enterprise data governance, Value and risk of creating an
Enterprise Architecture, Developing an Enterprise Architecture. Implementation methodology, Analysis
and Documentation Framework, Components and Artifacts, Developing Current Architect Views,
Developing an Enterprise Architecture Management Plan, Investment Planning and Project
Management, Role of Security and Privacy, Enterprise Architecture Repository and Support Tools.
Data Quality Management – Concepts and Implementation. Service Oriented Architecture (SOA) and
Virtualization. Data Warehousing, data modeling for data warehousing and business intelligence.
Enterprise Big Data Storage Models. Outsourcing and Vendor Management. Service Level Agreements
(SLAs), Performance testing and monitoring; Disaster Recovery strategies. Fault Tolerance and
Recovery. Effective Metadata modeling, design and management. Case Studies.

References:

1. Scott A. Bernard , An Introduction to Enterprise Architecture, Third Edition, , AuthorHouse .

Department of Information Technology, School of Computing and IT, Manipal University Jaipur
Course Structure for B. Tech (Data Science and Engineering) Program from Academic Session
2020-2021

2. Paul Clements, Felix Bachmann , Len Bass, David Garlan, James Ivers, Reed Little, Paulo
Merson , Robert Nord, Judith Stafford , Documenting Software Architectures: Views and
Beyond , (2nd Edition) Addison-Wesley Professional.
3. Jeanne W Ross, Peter Weill, David Robertson, Enterprise Architecture As Strategy: Creating
a Foundation for Business Execution. Harvard Business Review Press, 2006
4. Mario Godinez, Eberhard Hechler, Klaus Koenig, Steve Lockwood, Martin Oberhofer, and
Michael Schroeck , The Art of Enterprise Information Architecture: A Systems-Based Approach
for Unlocking Business Insight, IBM Press, 2010.
5. Stefan Bente, Uwe Bombosch, and Shailendra Langade, Collaborative Enterprise Architecture:
Enriching EA with Lean, Agile, and Enterprise 2.0 practices, Morgan Kaufmann, 2012.

DS4150: COMPUTER VISION [3 0 0 3]

Introduction : Image Processing, Components of Image processing system, Image formation and
digitization concepts, Neighbours of pixel adjacency connectivity, regions and boundaries, Distance
measures, Image processing operations, Arithmetic, Logical, Geometrical, Convolution and Correlation
Operations, Applications: Document Image Analysis, Biometrics, Object Recognition, Tracking, Medical
Image Analysis, Content-Based Image Retrieval, Video Data Processing, Multimedia, Virtual Reality
and Augmented Reality, Image Formation, Image representations (continuous and discrete) , Image
pre-processing Techniques, Feature Extraction-Point, Line and Edge Detection, Color, Texture, Shape
and structure Features in spatial and frequency domains, Corner Detection, Hough Transform , Image
Segmentation: Boundary detection based techniques, Point, line detection, Edge detection, Edge
linking, local processing, regional processing, Hough transform, Thresholding, Iterative thresholding,
Otsu's method, Moving averages, Multivariable thresholding, Region-based segmentation, Watershed
algorithm, Use of motion in segmentation, Computer Vision: Computer Vision, What is Computer Vision
- Low-level, Mid-level, High-level , Overview of Diverse Computer Vision Applications, Fundamentals of
object recognition, Low-level computer vision-Edges, contours, textures, shapes, and colors , Motion,
optical flow, and tracking Local features, invariance, bag-of-words models, Fisher vector, Middle-level
representations of objects: parts, attributes, embedding.

References:

1. David A forsyth & Jean ponce “Computer vision – A modern Approach, Prentice Hall, Pearson
Education India; Edition: Second, ISBN-13: 978-9332550117, 2015.
2. R. C. Gonzalez, R. E. Woods. “Digital Image Processing”. Pearson, Inc., Edition-Fourth, ISBN.
978-0131687288, 2017.
3. A. K. Jain. “Fundamentals of Digital Image Processing. Prentice-Hall, Pearson; Edition: First,
ISBN-13: 978-0133361650, 1994.
4. David A forsyth & Jean ponce , “Computer vision – A modern Approach” , Prentice Hall ,2002.
5. Bernd Jahne and Horst HauBecker, “Computer vision and Applications” Academic press, 2000.

DS4151: ROBOTICS AND AUTOMATION [3 0 0 3]

Introduction: Definition, Applications of mobile robotics, History of mobile robotics. Design of system
and navigation architecture: Reference control scheme of a mobile robotics environment, Temporal
decomposition of architecture, Control decomposition, Hybrid architecture, Mobile architecture,
Perception, Representation and the mapping process. Locomotion: Issues for locomotion, Legged
mobile robots, Wheeled mobile robots. Kinematics: Kinematics introduction, Forward and reverse
kinematics, Wheeled kinematics and its constraints, Mobile system locomotion, Human biped
locomotion as a rolling polygon, Representation of robot position through the reference frame. Power
Department of Information Technology, School of Computing and IT, Manipal University Jaipur
Course Structure for B. Tech (Data Science and Engineering) Program from Academic Session
2020-2021

Sources and Sensors: Hydraulic, pneumatic and electric drives, determination of HP of motor and
gearing ratio, variable speed arrangements, path determination, micro machines in robotics, machine
vision, ranging, laser, acoustic, magnetic, fiber optic and tactile sensors. Manipulators, Actuators and
Grippers: Construction of manipulators, manipulator dynamics and force control, electronic and
pneumatic manipulator control circuits, end effectors, U various types of grippers, design
considerations. Navigation: Localization overview, Path planning. Computational intelligence: Swarm
intelligence, Evolutionary computation, Artificial immune system, Ant algorithm. Mobile robot
programming.

References:

1. Ronald Siegwart, Illah R. Nourbakhsh, “Introduction to Autonomous Mobile Robots”, MIT Press,
2. Andries P. Engelbrecht , “Computational Intelligence: An Introduction”, Wiley 2nd Edition, 2007
3. Ronald C. Arkin , “Intelligent Robotics and Autonomous Agents”, MIT Press, 1997
4. Ulrich Nehmzow, “Mobile Robotics: A practical Introduction”, Springer-Verlag London, 2003
5. Robin R. Murphy, “Introduction to AI Robotics”, MIT Press, 2000
6. Leandro N. de Castro and Jonathan Timmis, “Artificial Immune system: A new
Computational Intelligence Approach”, Springer-Verlag, Germany 2002.

MINOR SPECIALIZATION IN FINANCE & SECURITY ANALYTICS

DS4152: FINANCE & ACCOUNTING [3 0 0 3]

Understanding the Financial Data: Financial Statements, Type of Accounting and finance data, Nature
and behavior of financial and accounting data. Preparation of financial statements in excel, Calculation,
projection of various reports with finance and accounting data, Understanding data in finance, sources
of data, cleaning and pre-processing data, Understanding stock price behaviour, Time series analysis
in finance . Review of Financial Statements: Sources for Financial Statement Information, Types of
financial statements: Income statement, Balance Sheet, Cash flow and funds flow statement, Ratio
Analysis, DuPont Analysis, Profitability and Turnover Ratios, Liquidity Ratios, Forecasting of ratios and
future financial statements, Preparation financial reports using MS Excel. Valuation of Equity and
Firm/Business: Free Cash Flow to Equity (FCFE), Free Cash Flow to the firm (FCFF), Discounted cash
Department of Information Technology, School of Computing and IT, Manipal University Jaipur
Course Structure for B. Tech (Data Science and Engineering) Program from Academic Session
2020-2021

flow approach to equity and business valuation, Relative Valuation approach to valuation, non-financial
performance metrics affecting company valuations. Investment Analysis: Capital Budgeting Techniques
– Pay Back Method, Discounted Pay Back Method, Accounting Rate of Return, Net Present Value
Method, Internal Rate of Return and Profitability Index. Risk Analysis in Capital Budgeting – Nature of
risk, Statistical Techniques for risk analysis, Conventional techniques of risk analysis and Sensitivity
Analysis. Capital Rationing. Capital Structure and Valuation: Meaning. Operating Leverage. Financial
Leverage, EBIT-EPS Analysis. Combined Leverage. Meaning of Capital Structure. Capital Structure
Theories – Definitions, Net Income Approach, Net Operating Income Approach, Modigliani Miller
Approach, and Traditional Approach. Practical Considerations in Determining Capital Structure.
Working Capital Analysis: Meaning, Need and Nature of Working Capital [Concept and Definitions].
Determinants of Working Capital. Trade-off between Profitability and Risk. Determining Financing Mix.
Computation/Estimation of Working Capital. Cash Management and Receivables and payables
management.

References:

1. Prasanna Chandra., Fundamentals of Financial Management, Tata Mc-Graw Hill Companies,

New Delhi, 2005.
2. James L Riggs, David D Bedworth and Sabah U Randhawa., Engineering Economics, Tata
McGraw – Hill Publishing Company Ltd, New Delhi, 2004.
3. T. Ramachandran., Accounting and Financial Management, Scitech Publications Pvt. Ltd.
India, 2001.
4. Eugene F. B. & Joel F. H., Fundamentals of Financial Management, 12th ed., Cengage
Learning Publisher, 2009.
5. Johnston,J, Econometric Methods, McGraw-Hill Book Co., New York.
6. Maddala, G.S, Econometrics, McGraw-Hill Book Co., New York, 3rd Rd.
7. Gujarathi, D.N, Basic Econometrics, Fourth Edition, Tata McGraw-Hill, New Delhi.

DS4153: RISK ANALYTICS [3 0 0 3]

Introduction to risk analysis: Nature of risk and uncertainty; Why do a risk analysis?; Management’s
responsibility with regard to risk; Discuss risk management; Upside and downside risk; Handling big
data; Cost and benefits associated with investing in information systems; Recommended techniques
for the Boards to manage risks. Quantification of risk: Quantification of risk using expected values,
standard deviations and probability tables; Calculating Beta & Capital Asset Pricing Model; Decision
trees; Decision models to deal with uncertainty in decision making-Max-min, Max-max, and Min-max
regret criteria; Payoff tables. Probability mathematics and simulation: Types of risks; Types of market
risks; Market risk measurement, Value at Risk (VaR); VaR as a key parameter to measure market risk;
Elements of VaR system; Stress testing; VaR Methods- An overview of VaR methods; VaR local and
full valuation; Delta normal methods; Historical simulation; Monte Carlo simulation; Examples of VaR
applications. Financial risk analysis modelling: Introduction to credit risk; Credit risk management;
Settlement risk; Measuring credit risk; Measuring Credit VaR; Types of credit derivatives. Forecasting
with uncertainty: Properties of a Time Series Forecast; Common Financial Time Series Models;
Autoregressive Models; Time Series Projection of Events Occurring Randomly in Time; Time Series
Models with Leading Indicators. Hedging Techniques: Hedging- Hedging linear risk; Optimal hedging;
Hedge ratio as regression coefficient; Duration hedging; Beta hedging; Non-linear risk hedging; Delta
and dynamic hedging.

References:

1. Vose David, Risk Analysis: A Quantitative Guide, John Wiley & Sons Inc, 2018.
2. Hull John C., Risk Management and Financial Institutions, John Wiley & Sons Inc, 2018.
Department of Information Technology, School of Computing and IT, Manipal University Jaipur
Course Structure for B. Tech (Data Science and Engineering) Program from Academic Session
2020-2021

DS4154: FINANCIAL MARKET ANALYTICS [3 0 0 3]

Money and Capital market, Fundamental Analysis: Economic analysis, Industry Analysis, Company
analysis. Technical Analysis, chart formations, Moving average analysis, Relative strength analysis,
Technical indicators. Merits and demerits of technical analysis. Random Walk Hypothesis: Efficient
market theory, weak form, semi-strong form, strong form, Implications for investment analysis. Equity
valuation: Balance sheet valuation, Dividend discount model, Earnings multiplier approach, Earnings to
price ratio, Expected return, and growth. Analysis and Valuation of debt: Bond pricing, Bond yield, Risk
in debt. Portfolio Analysis: Risk and Return analysis, Markowitz Theory. Portfolio Theories –CAPM.
Markowitz Theory, Single Index Model, Two Factor Model Theory, Arbitrage Pricing Theory.

References:

1. Donald Fischer and Jordan - Security Analysis and Portfolio Management - PHI, New Delhi,
2017.
2. William F. Sharpe - Investments

DS4155: BUSINESS & ECONOMIC ANALYTICS [3 0 0 3]

Consumers, producers & production: Consumer Behavior, Production, cost & revenue analysis. Price
and Output determination under different market structure: Perfect competition, Price and output
determination under Monopoly, monopolistic competition, oligopoly. National Income Accounting:
Circular flow of income model; methods and concepts in national income accounting and limitations,
Inflation: Types, causes, effects and control measures for Inflation. Macro policies: Meaning, objectives
and tools and effects of monetary and fiscal policies. External Sector: Economic openness, Balance of
Payments, BoP crisis, exchange rate concepts, foreign capital flow.

References:

1. Soumyen Sikdar., Principles of Macroeconomics, OXFORD University Press, 2017.

2. Robert Pindycik & Daniel Rubinfeld., Microeconomics, 8TH ed., Pearson India Education
services Pvt Ltd.
3. Gujarathi, D.N, Basic Econometrics, Fourth Edition, Tata McGraw-Hill, New Delhi, 2017.

MINOR SPECIALIZATION IN BUSINESS ANALYTICS

DS4156: FUNDAMENTALS OF BUSINESS ANALYTICS [3 0 0 3]

Data-Analytic Thinking for Business: The Ubiquity of Data Opportunities, Data Science as a strategic
asset, data analytic thinking, Business Enterprise and its functions, Enterprise Applications – ERP,
CRM, MIS. Difference between Business Intelligence and Business Analytics. Database systems for
Business: OLTP and OLAP systems for business overview and architecture overview. Business
Problems and Data Science Solutions using CRISP-DM Approach: Business Understanding,
preparation, modeling, evaluation, deployment. Performance Metrics in Analytics - Key performance
Department of Information Technology, School of Computing and IT, Manipal University Jaipur
Course Structure for B. Tech (Data Science and Engineering) Program from Academic Session
2020-2021

Indicators (KPIs), KPI based balanced score card, KPIs on Dashboards. Project Management - Project
Management, phases, tools, techniques and methodologies in project management, Agile Framework
and Scrum Approach. Quality Management - quality management philosophy, concepts and tools,
Statistical Quality Control methods, Lean and Six Sigma, SERVQUAL model of service quality. Case
studies – Human Capital Analytics, IT Analytics, Sales and Marketing Analytics, Analytics in telecom,
Retail, healthcare, financial markets, social media, sports and other related business fields.

References:

1. Prasad, R, N. and Acharya, Seema Fundamentals of Business Analytics. Wiley India Pvt, Ltd,
New Delhi, 2016.
2. Provost and Fawcett , Data Science for Business, O’Reilly,2013.
3. Shmueli, Patel, and Bruce, Data Mining for Business Intelligence, Concepts, Techniques and
Applications. Wiley, 2009.
4. Clifford F. Gray, Erik W. Larson, Gautam V. Desai - Project Management - Tata McGraw Hill,
2014.
5. Schwaber Ken Agile project management with scrum, WP Publishers and Distributors,
Bangalore, 2004.
6. Sridhar Bhatta, Total Quality Management, concepts and cases-Himalaya Publishing House,
2015.

DS4157: DIGITAL MARKETING [3 0 0 3]

Introduction: Online Market space- Opportunities for building Brand, Digital eco system and channels,
Market and customer segmentation, Digital Marketing Strategy Components, Combining digital and
traditional media. Search Engine Optimization: How Search Engine works, SEM components, PPC
advertising with Google ad words, Display Advertisement. Search Engine Optimization: SEO success
factors (On-Page and Off-Page Techniques), Google analytics. Display Advertising: Real time bidding,
executing display advertising, E-commerce Models. Social Media Marketing: Social Media Channels.
Facebook, Twitter, LinkedIn, Instagram, other Soc. Media channels. Leveraging Social media for brand
conversations and buzz, Successful /benchmark Social media campaigns. Social Media Marketing:
Promoting/advertising brand in Social media, Social Media Feedback, Measuring Social media impact.
E- Mail Marketing: Types of E- Mail Marketing, Email Automation, Lead Generation, Integrating Email
with Social Media and Mobile, Digital Marketing for B2B, Measuring and maximizing email campaign
effectiveness. Online Reputation Management: Combining digital and traditional media, Power of Social
Media, Monitoring SM, Proactive and reactive reputation management. Creating a Digital Marketing
Strategy: Elements of strategy, Operational aspects of strategy, Digital Marketing plans .Mobile
Marketing: Mobile Inventory/channels, Location based, Context based, Coupons and offers, Mobile
Apps, Mobile Commerce, SMS Campaigns ,Profiling and targeting. Web Analytics and Channel
Attribution Strategies: Social Media Analytics, Website Analytics, Channel attribution model.
References:

1. Maity, Moutusy, Internet Marketing: A Practical Approach in the Indian Context, Oxford
University Press, 2017.
2. Richard Gay, Alan Charlesworth and Rita Esen, Online Marketing- a customer led approach,
Oxford University Press, New York, 2013.
3. Alan Charlesworth, Digital Marketing: A Practical Approach, 2014.
4. Avinash Kaushik , Web Analytics 2.0: The Art of Online Accountability, 2009.
Department of Information Technology, School of Computing and IT, Manipal University Jaipur
Course Structure for B. Tech (Data Science and Engineering) Program from Academic Session
2020-2021

DS4158: SUPPLY CHAIN MANAGEMENT [3 0 0 3]

Introduction and objectives of supply chain, Decision phases in a supply chain, Purchasing tools and
techniques, Value analysis, Project planning and control techniques, Pricing and revenue management,
Costing fundamentals, Types of costing, Managing inventory in a supply chain, Economic order
quantity, EOQ determination with instantaneous delivery and without shortages, Effect of quantity
discount, safety stock, reorder level & lead time. Facility decisions in supply chain:, Factors influencing
network design in supply chain, Models for facility location and capacity allocation, Transportation
decisions in a supply chain, Routing and scheduling in transportation, Multistage transportation
problems, Truck allocation problem, Travelling salesman problem, Vehicle routing problems, Financial
evaluation of supply chain Decisions, The impact of financial factors on supply chain decisions,
Discounted cash flow analysis, Evaluating supply chain decisions using decision trees.
References:

1. Chopra and Meindl.,Supply Chain Management – Strategy, Planning and Operation, (3e),
Pearson Education, New Delhi, 2009.
2. Raghuram and Rangaraj, Logistics and Supply Chain Management: Cases and Concepts,
Macmillan, New Delhi, 2000.
3. Simchi-Levi and Kaminski, Designing and Managing the Supply Chain: Concepts, Strategies
and Case Studies , McGraw-Hill, 2003.
4. Shapiro J., Modelling the Supply Chain, Duxbury Thomson Learning, U.S.A., 2009.
5. Krajewski Lee J. and Ritzman Larry P., Operations Management, Pearson Education
(Singapore) Pte. Ltd., Delhi, 2005.
Department of Information Technology, School of Computing and IT, Manipal University Jaipur
Course Structure for B. Tech (Data Science and Engineering) Program from Academic Session
2020-2021

MINOR SPECIALIZATION IN HEALTH INFORMATICS

DS4159: HEALTH INFORMATICS [3 0 0 3]

Introduction to Health care and Information Technology-HealthCare Data – Types of HealthCare Data
– HealthCare Databases & Applications – Healthcare Informatics Vs Clinical Informatics-EMR, HER
and EPR. Interoperability Standards in Healthcare – Introduction to healthcare standards-need for such
standards-HL7-Digital Image Communication in Medicine (DICOM)- Picture Archival and
Communication System (PACS)- Clinical Document Architecture (CDA)- Integrating the Healthcare
Enterprise . Imaging Systems in Healthcare – Imaging Modalities- Xray, CT, MRI, US- Radiology
Information Systems-PACS. Ethics in Healthcare – Protected Healthcare Information-HIPPA-Mobile in
Healthcare. Telehealth-Telemedicine-Tele Radiology-Data Compression Techniques- IT for rural
healthcare.

References:

1. Ramona Nelson and Nancy Staggers, Health Informatics: An Interprofessional Approach, 2016.
2. WIlliam Hanson, Healthcare Informatics , McGraw-Hill Education, 2017.
3. K. Kirk Shung, Michael B. Smith, Benjamin M.W. Tsui Principles of Medical Imaging”.
4. Oleg S Pianykh, “Digital Imaging and Communication in Medicine(DICOM)”, Springer.
5. HIMSS, “HIMSS Dictionary of Healthcare Information Technology Terms, Acronyms and
Organizations”, Second Edition, 2016
6. Victor Lyuboslavsky, “Telemedicine and Telehealth 2.0: A Practical Guide for Medical Providers
and Patients” .
7. “Erich H. Loewy, M.D. , Roberta Springer Loewy, Textbook of Healthcare Ethics” 2nd Edition,
Kluwer Academic Publishers New York, 2017.

DS4160: BIOINFORMATICS [3 0 0 3]

Introduction to Bioinformatics, Central dogma of biology, Digital code of life, database sequence search
& Alignment, The evolutionary basis of sequence alignment, The modular nature of proteins, Optimal
alignment methods, Substitution scores and gap penalties, Statistical significance of alignments,
Structure file formats; Visualizing structural information, Motifs and Pattern, Protein structure prediction,
Searching for trees, Rooting trees, Evaluating trees and Data, Phylogenetic software, Phylogenetics on
the web, Some simple practical considerations, Genome annotation, Comparative genomics, Genome
compression.

References:

1. Arthur M. Lesk. Introduction to Bioinformatics. Oxford University Press, 2002

2. Stuart M. Brown. BIOINFORMATICS: A biologists guide to biocomputing and the internet. NYU
Medical Center, 2000.

DS4161: MEDICAL IMAGE PROCESSING [3 0 0 3]

Review of signals, systems & transforms; 2D signals & systems; Medical Imaging: Imaging modalities
and their applications; Computed tomography (CT): mathematical basis, the Radon transform & the
central slice theorem; Image reconstruction from projections: the Direct Fourier Method, convolution
back projection (CBP) algorithm, Algebraic Reconstruction Techniques (ART); reconstruction from fan-
beam projections; Extension to 3D – cone-beam CT, spiral CT. Tomosynthesis; X-rays: utility,
Department of Information Technology, School of Computing and IT, Manipal University Jaipur
Course Structure for B. Tech (Data Science and Engineering) Program from Academic Session
2020-2021

generation and detection; X-ray CT systems. Emission CT: principles, Positron emission tomography
(PET); attenuation correction in ECT; Ultrasound in clinic: benefits/risks, Basics of Ultrasound - review,
Ultrasound imaging; Contrast enhanced ultrasound imaging; Motion artifacts in ultrasound imaging.
Clutter filtering; elastography, plane wave imaging; Magnetic resonance imaging: Principles of data-
generation, resolving the tissues, resolving the spatial locations, and extension to 2D. Resolution &
Field of View; Data sampling and the concept of bandwidth.

References:

1. R.C Gonzalez and R.E. Woods, Digital Image Processing, (4e), Pearson Education Inc., 2017.
2. A.K. Jain, Fundamentals of Digital Image Processing, Prentice- Hall, Fourth Indian Reprint,
1989.
3. A.C. Kak and M. Slaney, Principles of Computerized Tomographic Imaging, SIAM's Classics in
Applied Mathematics, Philadelphia, SIAM, 2001.
4. Kline Jacob, Handbook of Biomedical Engineering, Academic Press, 1988.
5. Carol M. Rumack, Deborah Levine, Diagnostic Ultrasound, (5e), Elsevier, 2017

DS4162: BIOSTATISTICS [3 0 0 3]

Introduction, Summarizing Quantitative Data, Summarizing Categorical Data; Prevalence, Incidence,

Relative Risk, Risk Difference, Sampling Bias, Confidence Intervals, Study Design, Probability &
Screening; Probability distributions: Binomial & Normal Distributions, Sampling Distributions,
Confidence Intervals. Introduction to statistical design: Introduction to factorial designs, 2k factorial
design, main effects, interaction effects Screening designs: Fractional factorial designs, Plackett-
Burmann screening designs. Model reduction, model assumption checking, residual plots. Optimization
designs: Response surface methodology – concepts & methods, central composite designs and Box-
Behnken design.

References:

1. Sullivan, L.M., Essentials of biostatistics for the health sciences, (3e), Jones & Bartlett Learning,
2018.
2. Machin, Campbell and Walters, Medical Statistics, (4e)., Wiley, 2007.
3. Motulsky, H., Intuitive Biostatistics: A nonmathematical guide to statistical thinking, (3e), Oxford
University Press, New York, 2014.
4. Utts, J and Heckard, R., Mind on statistics, (5e), Cengage Learning, USA.

DS4163 ALGORITHMIC TRADING [3 0 0 3]

Basic Trading strategies- Discretionary, Algorithmic Trading, Hybrid. Algorithmic vs. High-
Frequency/Low Latency Trading. Industry Overview- Alternatives, Hedge Funds, Commodity Trading
Advisor Funds, Quant Funds. Tracking Funds, Tracking Benchmarks, Basic Portfolio Strategies.
Mathematics for algorithmic trading- Prediction of prices, Risk calculation, Capital Allocation, locking in
Options & Futures Review of Time Series, Capital Allocation, Momentum, Options and futures- trend,
seasonal, cyclical and irregular components, white noise, Brownian motion, Auto covariance,
autocorrelation and criteria. ARIMA models, Autoregressive Models, Moving Average Models, ARMA
Models. Box-Jenkins method, characteristic polynomials, Sharpes and Skewness , Stationary vs. Non-
Department of Information Technology, School of Computing and IT, Manipal University Jaipur
Course Structure for B. Tech (Data Science and Engineering) Program from Academic Session
2020-2021

stationary processes, criteria (AIC, BIC) for model choice, Cross Validation, Bootstrap and Stochastic
Differential Equations (SDE)s., Kalman Filters. Algorithmic Trading Basics- Back testing, Automated
Execution, Momentum, Mean Reversion, Carry, Value, Basic Portfolio Strategies, Over fitting. Mean
Reversion Strategies - Mean Reversion of Stocks, ETFs, Currencies and Futures, Timescales/horizons
associated with MR, Momentum and Value, Volume and Mean Reversion Liquidity, Unit Root Tests,
Augmented Dickey Fuller Tests. KPSS Tests, Variance Ratio Tests. Co-integration and Johansen Test.
Momentum/Trend Following- properties and tradeoffs, Inter-day and Intraday Momentum Strategies,
Risk Management. Skewness over horizon results, momentum modelling. Filters, Change points -
sequential binary segmentation, switching Kalman filters, Carry, Value, P vs. Q-measure. Over fitting-
p-hacking, lack of reproducibility, holdout over fitting. Adjusted Sharpe Ratios. Multiple Hypothesis
Testing – Holm-Bonferroni . BHY adjustments. ML for Algorithmic trading, pitfalls and future
opportunities. Case Studies: Introduction to Quantopian, Mini project using open source technologies
to build and test simple algorithmic models.

References:

1. Earnest Chan, Algorithmic Trading: Winning Strategies and Their Rationale, John Wiley & Sons ,
1st edition, 2013.
2. Ernie Chan, Quantitative Trading: How to Build Your Own Algorithmic Trading Business, John
Wiley & Sons;, 1 edition , 2008
3. Rishi K. Narang, Inside the Black Box: The Simple Truth about Quantitative Trading, John Wiley &
Sons , 1st edition, 2009.
4. Barry Johnson, Algorithmic Trading and DMA: An introduction to direct access trading strategies,
4Myeloma Press, 2010.
5. David J. Leinweber, Theodore R. Aronson, Nerds on Wall Street: Math, Machines and Wired
Markets , John Wiley & Sons, 1st edition, 2009.
6. Alex Kuznetsov, The Complete Guide to Capital Markets for Quantitative Professionals (McGraw-
Hill Library of Investment and Finance) . McGraw-Hill Education, 1 edition, 2006.

DS4164: APPLIED ECONOMETRICS [3 0 0 3]

Financial Econometrics: Nature of Econometrics and Economic Data. Time Series Econometrics. The
Experimental Ideal: selection problem, random assignment, regression analysis of experiments.
Regression Modeling: Linear regression modeling, properties of regression, omitted varaibles,
decomposition techniques, regression and causality, heterogeneity and nonlinearity. Logit and probit
models, problems of inference. Causal Modeling: Panel data, Instrumental variables. Instrumental
variables in action: Causality, asymptotic 2SLS Inference, Two sample, Split Sample Instrumental
variables, IV with heterogeneous potential outcomes. Individual Fixed Effects. Differences-in-
differences, Fixed effects versus lagged dependent variables. Regression discontinuity: designs, sharp
and fuzzy regression discontinuity. Quantile regression model: estimation of quantile treatment effects,
nonstandard standard error issues, bias of robust standard error estimates, clustering and serial
correlation in panels. Methods from Statistical Learning: Cross validation and k-fold, Shrinkage methods
(Ridge and LASSO), Basis functions, Tree models.

References:

1. Joshua D. Angrist and Jorn-Steffen Pischke, Mostly Harmless Econometrics- An Empircist’s

Companion, Princeton University Press, 1 edition, 2009.
2. Jeffrey M. Woolridge, Introductory Econometrics: A Modern Approach, CENGAGE Learning
Custom Publishing; 5th edition , 2012.
3. Maurice DeGroot, Mark J Schervish, Probability and Statistics, Pearson Publications, 4 edition
,2011.
4. Gareth James, Daniela Witten, Trevor Hastie, Robert Tibshirani, An Introduction to Statistical
Learning with Applications in R, Springer Science, 2017.