Curriculum for B.Tech.

in Data Science

G H Raisoni College of Engineering

(An Autonomous Institute affiliated to RTM Nagpur University Nagpur)

Department of Data Science, IoT and Cyber Security

B. Tech. in Data Science

Scheme - 2020-21

P age |1
 Curriculum for B.Tech.in Data Science

Institute Vision
To achieve excellent standards of quality education by keeping pace with rapidly
changing technologies and to create technical manpower of global standards with
capabilities of accepting new challenges.

Institute Mission
Our efforts are dedicated to impart quality and value based education to raise
satisfaction level of all stake-holders. Our strength is directed to create competent
professionals. Our Endeavour is to provide all possible support to promote research
and development activities

Department Vision

To achieve excellent standards of quality-education by creating AI Engineers

who are empowered with latest tools and technologies to provide customer
oriented innovations to industry towards serving the greater cause of society.

Department Mission

To develop professionals who are skilled in the area of Artificial Intelligence.

To impart quality and value based education and contribute towards the
innovation of computing, expert system, Data Science to raise satisfaction level
of all stakeholders. Our effort is to apply new advancements in high
performance computing hardware and software.

P age |2
 Curriculum for B.Tech.in Data Science

B. Tech. in Data Science

Program Educational Objectives

PEO1 Apply data analysis, statistical modeling, optimization to

formulate and solve complex statistical and multidisciplinary
problems
PEO2 Take up higher studies, research & development and other
creative efforts in the area of Data Science.
PEO3 Use their skills in an ethical & professional manner to raise the
satisfaction level of stake holders.

Program Specific Outcomes

PSO1 Visualize, curate, and prepare data for use with a variety of
statistical/AI methods and models and recognize how the quality of
the data and the means of data collection may affect conclusions
PSO2 Use and adapt modern software packages and scalable computing
infrastructure to formulate problems, identify and gather relevant
existing data, and analyze the data to provide insights.
PSO3 Utilize contemporary computing technologies, such as machine
learning, AI, parallel and distributed computing, to solve practical
problems characterized by large-scale data

Program Outcomes

PO1 Engineering knowledge: Apply the knowledge of mathematics, science,

engineering fundamentals, and an engineering specialization to the
solution of complex engineering problems.
PO2 Problem analysis: Identify, formulate, review research literature, and
analyze complex engineering problems reaching substantiated
conclusions using first principles of mathematics, natural sciences, and
engineering sciences
PO3 Design/development of solutions: Design solutions for complex
engineering problems and design system components or processes that
meet the specified needs with appropriate consideration for the public
health and safety, and the cultural, societal, and environmental
considerations.
PO4 Conduct investigations of complex problems: Use research-based
knowledge and research methods including design of experiments,
analysis and interpretation of data, and synthesis of the information to
provide valid conclusions.
P age |3
 Curriculum for B.Tech.in Data Science

PO5 Modern tool usage: Create, select, and apply appropriate techniques,
resources, and modern engineering and IT tools including prediction and
modeling to complex engineering activities with an understanding of the
limitations.
PO6 The engineer and society: Apply reasoning informed by the contextual
knowledge to assess societal, health, safety, legal and cultural issues
and the consequent responsibilities relevant to the professional
engineering practice.
PO7 Environment and sustainability: Understand the impact of the
professional engineering solutions in societal and environmental
contexts, and demonstrate the knowledge of, and the need for
sustainable development
PO8 Ethics: Apply ethical principles and commit to professional ethics and
responsibilities and norms of the engineering practice.
PO9 Individual and team work: Function effectively as an individual, and as a
member or leader in diverse teams, and in multidisciplinary settings.
PO10 Communication: Communicate effectively on complex engineering
activities with the engineering community and with society at large, such
as being able to comprehend and write effective reports and design
documentation, make effective presentations, and give and receive clear
instructions.
PO11 Project management and finance: Demonstrate knowledge and
understanding of the engineering and management principles and apply
these to one’s own work, as a member and leader in a team, to manage
projects and in multidisciplinary environments.
PO12 Life-long learning: Recognize the need for, and have the preparation and
ability to engage in independent and life-long learning in the broadest
context of technological change

P age |4
 Curriculum for B.Tech.in Data Science

Scheme of B. Tech. in Data Science

Evaluation Scheme
Teaching Scheme
Course Course Theory Practical
Name of Course Credits Total
Code Category L T P Total TAE CAE ESE INT EXTMarks
Hours
SEMESTER-I
UBSL151 Matrices and Differential
BS1 2 1 - 3 3 10 15 50 - - 75
Calculus
UBSL101
Engineering Physics BS2 1 1 2 4 3 10 15 50 25 - 100
UBSP101
UCSL101
Computer Programming C1 2 - 4 6 4 10 15 50 50 - 125
UCSP101
UCSL102 Foundation of Data
C2 1 - 2 3 2 10 15 50 25 - 100
UCSP102 Analytics
UECL103 Introduction to Discrete
C3 2 - 2 4 3 10 15 50 25 - 100
UECP103 Devices and Circuits
Problem Identification and
UITP101 A1 - - 2 2 1 - - - 25 - 25
Design Thinking
UISP101 Introduction to Drones A2 - - 2 2 1 - - - 25 - 25
UISP101 Biomedical Engineering A3 - - 2 2 1 - - - 25 - 25
TOTAL 8 2 16 26 18 50 75 250 200 575

Teaching Evaluation Scheme

Course Course Scheme Theory Practical
Name of Course Credits Total
Code Category
L T P Total TAE CAE ESE INT EXT Marks
Hours
SEMESTER-II
Integral Calculus and
UBSL152 BS3 2 1 - 3 3 10 15 50 - - 75
Differential Equations
UBSL153
Linear Algebra and -
BS4 2 1 3 3 10 15 50 - - 75
Statistics
UBSL131
Environmental Chemistry BS5 1 2 3 2 10 15 50 25 - 100
UBSP131
UHUL101
Communication Skills H1 2 - 2 4 3 10 15 50 25 - 100
UHUP101
Programming for
UITP102 C4 - - 4 4 2 - - - 50 - 50
Problem Solving
UECL104 Modeling of Digital
C5 3 - 2 5 4 10 15 50 25 - 100
UECP104 Circuits
UECP105 Internet of Things A4 - - 2 2 1 - - - 25 - 25
UHUP102 Foreign Language A5 - - 2 2 1 - - - 25 - 25
TOTAL 10 2 14 26 19 50 75 250 175 550

P age |5
 Curriculum for B.Tech.in Data Science

Teaching Evaluation Scheme

Course Course Scheme Credi Theory Practical TOTAL
Name of Courses Category ts
Code Total MARK
L T P Hours TAE CAE ESE INT EXT S
SEMESTER-III
Discrete Mathematics
UBSL255 BS 3 1 4 4 10 15 50 75
and Graph Theory
UCSL206 Operating System C 3 3 3 10 15 50 75
Database
UCSL301
Management C 3 2 5 4 10 15 50 25 100
UCSP301
Systems
UAIL205/ Introduction To Data
C 3 2 5 4 10 15 50 25 100
UAIP205 Science
UCSL201 Data Structures and
C 3 2 5 4 10 15 50 25 100
UCSP201 Algorithms
Software Engineering
UITL301 and Project C 3 3 3 10 15 50 75
Management
UAIP203 Data Preprocessing A 4 4 2 25 25
TOTAL 18 1 10 29 24 60 90 300 100 550

Evaluation Scheme
Teaching Scheme
Course Name of Course Theory Practical
Credits TOTAL
Code Courses Category Total
L T P TAE CAE ESE INT EXT MARKS
Hours
SEMESTER-IV
Probability
UBSL258 BS 3 1 4 4 10 15 50 75
Theory
Object
UITP201 Oriented C 4 4 2 25 25 50
Programming
Formal
Languages
UCSL203 C 3 3 3 10 15 50 75
and
Automata
Computer
UITL202 C 3 3 3 10 15 50 75
Network
Machine
UAIL202
Learning C 3 2 5 4 10 15 50 25 100
UAIP202
Algorithms
Open
UISL2XX OE 2 2 2 10 15 50 75
elective-I
UAIP204 Mini Project P 2 2 1 25 25
UAIL2 XX Elective I EL 3 3 3 10 15 50 75
Data
UITP203 Analysis A9-A10 4 4 2 25 25
Using R
17 1 12 30 24 60 90 300 100 25 575
TOTAL

P age |6
 Curriculum for B.Tech.in Data Science

Evaluation Scheme
Teaching Scheme
Course Name of Course Theory Practical
Credits TOTAL
Code Courses Category Total
L T P TAE CAE ESE INT EXT MARKS
Hours
SEMESTER-V
Cloud
UCSP303 C 4 4 2 25 25 50
Computing
Information
UAIL304/ Retrieval
C 3 2 5 4 10 15 50 25 100
UAIP304 and Text
Mining
Design and
UCSL205
Analysis of C 3 2 5 4 10 15 50 25 100
UCSP205
Algorithm
Statistics for
UBSL351 C 3 3 3 10 15 50 75
Management
UAIL3XX Elective II EL 3 3 3 10 15 50 75
UHUP305 Aptitude A 2 2 1 25 25
Minor
UDIP305 P 4 4 2 25 25
Project
Engineering
Economics
UHUL303 and H 2 2 2 10 15 50 75
Industrial
Management
12 16 28 21 50 75 250 125 25 525
TOTAL

P age |7
 Curriculum for B.Tech.in Data Science

Teaching Evaluation Scheme

Course Name of Course Scheme Theory Practical
Credits TOTAL
Code Courses Category Total
L T P Hours
TAE CAE ESE INT EXT MARKS

SEMESTER-VI
Next
UAIL421/
Generation C 3 2 5 4 10 15 50 25 100
UAIP421
Databases
Computer
UAIL303 Vision and
C 3 2 5 4 10 15 50 25 100
UAIP303 Deep
Learning
UITL305 Big Data
C 3 2 5 4 10 15 50 25 25 125
UITP305 Computing
Open Elective
UISL XXX OE 2 2 2 10 15 50 75
II
Universal
Human
UHUL304 Values 2: H 3 3 3 10 15 50 75
Understanding
Harmony
Humanities
UHUL3XX H 2 2 2 10 15 50 75
Elective
Employability
UHUP302 A 2 2 1 25 25
Skills
Campus
UHUP301 Recruitment A 2 2 1 25 25
Training
16 0 10 26 21 60 90 300 125 25 600
TOTAL

Evaluation Scheme
Teaching Scheme
Course Name of Course Theory Practical
Credits TOTAL
Code Courses Category Total
L T P TAE CAE ESE INT EXT MARKS
Hours
SEMESTER-VII
Department
UAIL XXX EL 3 3 3 10 15 50 75
Elective III
Department
UAIL XXX EL 3 3 3 10 15 50 75
Elective IV
Department
UAIL XXX EL 3 2 5 4 10 15 50 25 100
Elective-V
Department
UAIL XXX EL 3 2 5 4 10 15 50 25 100
Elective-VI
UAIP419 Project P 8 8 4 100 100 200
12 0 12 24 18 40 60 200 150 100 550
TOTAL

P age |8
 Curriculum for B.Tech.in Data Science

Teaching Evaluation Scheme

Scheme Theory Practical
Course Name of Course
Credits TOTAL
Code Courses Category Total
L T P TAE CAE ESE INT EXT MARKS
Hours

SEMESTER-VIII
UAIP420 Internship P 24 24 12 250 250 500
MOOCs
UISL4XX based Open OE 3 3 3 10 15 50 75
Elective
TOTAL 3 0 24 27 15 10 15 50 250 250 575
First Year
First Year Credits 37 1125
Marks

Total Credits SE-BE 123 Total Marks 3375

SE-BE
Grand
Grand Total Credits 160 4500
Total Marks

P age |9
 Curriculum for B.Tech.in Data Science

SEMESTER-I
Course Title: Matrices & Differential Calculus
Teaching Scheme Evaluation Scheme
Semester I
Theory Practical
Term ODD Th Tu Pr Credits TAE CAE ESE INT EXT
Course
BS 2 1
Category NA 10 15 50 NA NA
Hrs. Hr. 3
Course UBSL151
Code
Teaching Offline 75 _
Mode
3 Hrs Total
Duration of
2 Hrs. 75
ESE

To introduce concepts of matrices in the field of Engineering.

To develop skills in student to solve engineering problems based on
Matrices.
Course
To introduce concepts of Differential Calculus & Vector Calculus in the
Objectives
field of Engineering.
To develop skills in students to solve applications based problems on
Differential Calculus.
Upon successful completion of this course, student will be able to:
CO1:Understand and use the theory of Matrices to solve the system of
linear equations and engineering problems in respective disciplines.
CO2:Determine the Eigen values and Eigen vectors of a matrix and apply
Course to various engineering problems in respective disciplines.
Outcomes CO3:Apply concepts of differentiation in solving engineering problems.
CO4:Use applications of partial differentiation to solve various problems in
engineering.
CO5:Apply the Knowledge of vector differentiation to solve various
problems in engineering.

Mapping of Course Outcomes with Program Outcomes and Program Specific

Outcomes:

Course Program Outcomes and Program Specific Outcomes

Outcomes PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO
1 2 3
1 2 3 4 5 6 7 8 9 10 11 12
CO1 3 3 2 1 3
CO2 3 3 2 1 3
CO3 3 3 2 1 3
CO4 3 3 2 1 3
CO5 3 3 2 1 3

P a g e | 10
 Curriculum for B.Tech.in Data Science

Course Contents:

Unit Contents Hours

Matrices:Adjoint of Matrix, Inverse of matrix by adjoint method, Solution
of simultaneous equations by adjoint method. Inverse of matrix by
I 8
Partitioning method. Rank of matrix, Consistency for system of linear
equations, Linear dependence.

Characteristics equation, Eigen values and its properties. Eigen vectors.

Reduction to diagonal form, Cayley Hamilton theorem (statement &
II 10
verification). Sylvester’s theorem, Association of matrices with linear
differential equations of second order with constant coefficient.
Differential Calculus of single variable function: Review of limits,
continuity, differentiability and Mean value theorem. Successive
III 7
differentiation, Leibnitz’s Theorem, Taylor’s series and Maclaurin series
for single variable function.
Differential Calculus of function of several variables: Functions of
several variables, First and higher order partial derivatives, Euler’s
IV theorem, Chain rules. Jacobian, Properties of Jacobian, Maxima and 9
minima of function of two variables, Lagrange’s method of undetermined
multipliers.
Vector Calculus: Differentiation of vectors, Gradient of a scalar point
V function, Directional derivatives. Divergence and Curl of vector point 8
function. Solenoidal&Irrotational vector field.

Higher Engineering Mathematics: B. S. Grewal, Khanna Publishers,

1.
Text 2013, Forty Third Edition
Books Advanced Engineering Mathematics: Erwin Kreyszig John Wiley &
2.
Sons, 2013, Tenth Edition
Advanced Engineering Mathematics: Jain, R.K. and Iyengar, S.R.K,
1. Narosa Publishers; Alpha Science International, Ltd, 2007, Third
Reference
Edition
Books
Advanced Mathematics for Engineers and Scientists: Spiegel, M. R,
2.
McGraw-Hill, 2010, Second Edition

P a g e | 11
 Curriculum for B.Tech.in Data Science

Course Title: Engineering Physics

Evaluation Scheme
Semester I /II Teaching Scheme
Theory Practical
Term Odd/ Even Th Tu Pr Credits TAE CAE ESE INT EXT
Course
BS
Category 1 1 2
3 10 15 50 25 -
Course UBSL101 Hr. Hr. Hrs.
Code UBSP101
Teaching
Offline 75 25
Mode
4 Hrs Total
Duration
2 Hrs 100
of ESE

Demonstration of the fundamentals of uniform and non-uniform electric and

magnetic fields and working of related devices.
Familiarization and demonstration of the concepts of interference, laser
Course and their applications.
Objectives
Explanation of working of various optoelectronic devices.
Demonstration of the fundamentals of Quantum Mechanics and its related
applications.
Upon successful completion of this course, student will be able to:
CO1: Identify the trajectories of electron in uniform Electric and Magnetic
fields and operate related devices.
CO2: Describe the phenomenon of interference & implement it for finding
Course related parameters.
Outcomes CO3: Explain the working of Laser & use it for different applications.
CO4:Identify various optoelectronic devices and use them for
variousapplications.
CO5: Apply the knowledge of Quantum Mechanics to solverelated
problems.

Mapping of Course Outcomes with Program Outcomes and Program Specific

Outcomes:

Course Program Outcomes and Program Specific Outcomes

Outcomes PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO
1 2 3
1 2 3 4 5 6 7 8 9 10 11 12
CO1 3 2 1
CO2 3 2 1
CO3 3 2 1
CO4 3 2 1
CO5 3 2 1
CO6
P a g e | 12
 Curriculum for B.Tech.in Data Science

Course Contents:

Unit Contents Hours

Electron Ballistics and Optics: Trajectories of electron in uniform
I Electric and Magnetic field (Qualitative), Bethe’s law, Electron Lens, 4
Devices- Electron microscope (Theoretical), CRO
Optics: Interference-Interference in uniform & non-uniform thin films,
II 4
AR Coatings, Surface Testing, Branch specific applications.
LASER: Characteristics, Spatial and Temporal Coherence, Einstein
III Coefficient & its significance, Basic requirements of Laser, Components 6
of laser, He-Ne, Semiconductor laser and Branch Specific applications.
Semiconductor Physics:Review of basic Semiconductor physics, Hall
Effect, Review of working of PN junction diode with reference to energy
level diagrams.
IV Optoelectronic Devices:-Types of optoelectronic devices, LED-Types & 6
working principle, OLED, properties & comparisons, OLED
applications, PIN Photodiode, Solar Cell, Branch specific applications
as sensors and detectors
Quantum Physics:Blackbody Radiation, Compton Effect, Wave
particle duality: De Broglie wavelength, Group and Phase velocity,
Heisenberg’s Uncertainty principle & its applications, Schrödinger’s
V Mechanics: Physical interpretation of Wave Function, Elementary Idea 6
of Operators, Solution of Schrodinger equation for simple boundary
value problems, Tunneling, Applications-TEM,SEM, Effect of Quantum
constriction on properties of nano materials

Text Physics for Engineering, Dr. Bhavana P Butey, Oxford University

1.
Books Press, 2017, First Edition
EBooks 1. https://www.phindia.com/Books/EBooks
Fundamentals of Physics, David Halliday and Robert Resnik, New Age,
Reference 1.
1994
Books
2. Nanotechnology, Dr. Sulbha K Kulkarni, Capital Publishing Co., 2011
Online TL
1. https://nptel.ac.in/courses/104/104/104104085/
Material

Sr.
Name of Experiments
No.
Application of CRO: To measure amplitude of AC voltage and determine
1
unknown frequency using CRO
2 Determination of diameter of thin wire using interference by using Air Wedge
3 Determination of Wavelength of Laser source by Newton’s ring.
4 Determination of Hall Coefficient of an Extrinsic Semiconductor by arranging it

P a g e | 13
 Curriculum for B.Tech.in Data Science

in a Hall Effect. Experiment.

Determination of Band gap of an Intrinsic semiconductor by using PN junction
5
diode
6 PN junction diode as a rectifier-Find efficiency & ripple factor by using CRO
7 Application of diode: Voltage regulation by Zener diode.
8 Study of various Photo detectors as sensors
Application of interference: Determination of radius of curvature of plano-
9
convex lens using Newton’s ring set up.
Application of interference: Determination of refractive index using Newton’s
10
ring set up.
11 Laser: Determination of Birefringence of double image prism.
12 Determination of Band gap by four probe method.
13 Application of Diode: Determination of Planks Constant by using LEDs.
14 Comparison of V-I characteristics of various diodes.
Application of CRO: Determination of phase difference between two AC
15
signals.

Course Title: Computer Programming

Teaching Scheme Evaluation Scheme
Semester I
Theory Practical
Term Odd Th Tu Pr Credits TAE CAE ESE INT EXT
Course
C
Category 2 4Hr
-- 4 10 15 50 50 --
Course UCSL101 Hrs s
Code UCSP101
Teaching
Online 75 50
Mode
6 Hrs Total
Duration of
2 Hrs. 125
ESE

To introduce the basics of components of programming language and also

Course develop logical thinking
Objectives To implement concepts of mathematics into programming.
To help students understand how to model real-world problems into the
software and develop practical programming skills
CO1: Design algorithms and flowcharts for solving Mathematical and
Engineering Problems
CO2: Apply the suitable Control structures to solve the given problem
Course CO3: Investigate the problems and Identify the use of Pointers and
Outcomes Functions in it.
CO4: Assess the programming structure and recommend the type of array
to be useful to find a solution for applications.
CO5: Synthesize various problems to develop logical thinking

P a g e | 14
 Curriculum for B.Tech.in Data Science

Mapping of Course Outcomes with Program Outcomes and Program Specific

Outcomes:

Course Program Outcomes and Program Specific Outcomes

Outcomes PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO
1 2 3
1 2 3 4 5 6 7 8 9 10 11 12
CO1 3
CO2 3
CO3 3
CO4 3
CO5 3

Course Contents:

Unit Contents Hours

Introduction to Programming: Evolution, Programming Paradigms,
I Features, Algorithm, Flow charts, Data types and storage classes, 8
Strings, Scope of variables, Tokens, Type Casting, Operators
Control Statements:
Decision Making Statements: if, if-else, nested if, nested if-else, switch,
II go-to. 7
Loop Control Statements: Entry control, Exit Control, while, do-while, for,
break, continue
III Arrays: Definition, Declarations, Initialization, Accessing, Types of 7
Arrays: 2D,3D
Pointers: Definitions, Declarations, Applications
IV Functions: Definitions, Declarations, Types, Calling, Function 6
arguments: Call by Value, Call by Reference, Recursion
Structure: Definition, Accessing Structure Members, Structures as
V Function Arguments, Pointers to Structures 7
Union: Definition, Accessing Union Members
Advance Topic: (As per the instructor)

Kernighan and Ritchie, C programming language Prentice Hall of

1.
India,
Balguruswamy, “Programming in ANSI C”, Tata Mcgraw Hill
Text 2.
Publishing
Books Kakde and Deshpande, “C and Data Structure”, Charles River
3.
Media Publisher
4. YashwantKanetkar, Let's C, BPB Publishers
Herbert Schildt, C: The Complete Reference, Mcgraw Hill
Reference 1.
Publishing
Books
2. Expert C Programming, Deep C Secrets by Peter van der Linden.
On-line TL https://spoken-tutorial.org/tutorial-
1.
Material search/?search_foss=C+and+Cpp
P a g e | 15
 Curriculum for B.Tech.in Data Science

Sr. No. Name of Experiments

1 Implement syntax of C with algorithm and flowchart
2 Implement Data Types and Type casting
3 Implement the Branch control statements in C
4 Implement the Loop control statements in C
5 Implement the concept of Pointers using C
6 Implement the Functions in C
7 Implement recursive functions in C
8 Implement the Linear Array Operations.
9 Implement the Matrix Array Operations Array for addition and multiplication
10 Implement Structures in C
Open Ended Experiments
1 Student Record Management System
2 Simple CPP
Details of Online Laboratory Resource Material Instruction / Operating Manuals
1. https://spoken-tutorial.org/tutorial-search/?search_foss=C+and+Cpp
2 https://cse02-iiith.vlabs.ac.in/

Course Title: Foundation of Data Analytics

Teaching Scheme Evaluation Scheme
Semester I/II
Theory Practical
Term Odd/Even Th Tu Pr Credits TAE CAE ESE INT EXT
Course
C
Category 1 2
-- 2 10 15 50 25 --
Course UCSL102 Hr. Hrs.
Code UCSP102
Teaching
Online 75 25
Mode
3Hrs. Total
Duration of
2 Hrs. 100
ESE

To perform descriptive statistics on the given dataset

Course To perform inferential statistics on the given dataset
Objectives Apply linear regression and logistic regression and perform data
visualization on the given dataset with Tableau.
CO1:Analyze the dataset and perform Descriptive Statistics
CO2:Analyze the dataset and perform an Inferential Statistics
Course
CO3: Apply linear regression on the given dataset
Outcomes
CO4: Apply the logistic regression on the given dataset
CO5: Create an interactive data visualization

P a g e | 16
 Curriculum for B.Tech.in Data Science

Mapping of Course Outcomes with Program Outcomes and Program Specific

Outcomes:

Course Program Outcomes and Program Specific Outcomes

Outcomes PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO
1 2 3
1 2 3 4 5 6 7 8 9 10 11 12
CO1 3
CO2 3
CO3 3
CO4 3
CO5 3

Course Contents:

Unit Contents Hours

Buzzwords of Data Science, Info-graphic representation of
I 3
terminologies, Difference between Analysis and Analytics, Applications
Descriptive Statistics: Population and Sample, Types of Data,
Measurement Levels, Representation of categorical variables, Measures
II of Central Tendency (Mean, Median, Mode), Skewness, Variance, 3
Standard Deviation, Coefficient of Variation, Covariance, Correlation.
Histogram Analysis.
Inferential Statistics: Distribution, Normal Distribution, Standard Normal
III Distribution, Central Limit Theorem, Standard Error, Estimators and 3
Estimates, Confidence Interval, Students T Distribution, Margin of Error
Linear Regression: Introduction to Regression, Simple and Multiple
Linear Regression, Correlation vs. Regression, SST (Sum of Squares
IV Total), SSR (Sum of Squares Regression), SSE (Sum of Squares Error) 3
R-Square, Adjusted R-Squared. Multiple Linear Regression,
Significance of p-value
Logistic Regression: Logistic regression, Logitvs logistic, Applications of
logistic regression
V 3
Introduction to data visualization and various graphical ways of data
representation

The Art of Statistics: Learning from Data (Pelican Books), by David

1.
Spiegelhalter
Text 2. Principles of Statisticsby M. G. Bulmer, Dover Publications Inc.
Books Statistics 101: From Data Analysis and Predictive Modeling to
3. Measuring Distribution and Determining Probability, Your Essential
Guide to StatisticsBy David Borman, Adams Media
An Introduction to the Science of Statistics: From Theory to
1. Implementation, by Joseph C. Watkins
EBooks
https://www.math.arizona.edu/~jwatkins/statbook.pdf
2. Introduction to Statistics, by David M. Lane

P a g e | 17
 Curriculum for B.Tech.in Data Science

http://onlinestatbook.com/Online_Statistics_Education.pdf
Information Dashboard Design: Displaying Data for At-a-glance
1.
Monitoring by Stephen Few, Analytics Press
Reference
Beautiful Visualization, by Noah Iliinsky, Julie Steele
Books
2. Publisher(s): O'Reilly Media, Inc.
ISBN: 9781449379865
The Business Intelligence Analyst Course 2020
1. https://www.udemy.com/course/the-business-intelligence-analyst-
Online TL course-2018/
Material The Data Science Course 2020: Complete Data Science Bootcamp
2. https://www.udemy.com/course/the-data-science-course-complete-
data-science-bootcamp/

Sr. No. Name of Experiments

1 Apply pivot table of Excel to perform data analysis
2 Perform Descriptive statistics of given dataset using Data Analysis Toolbox of
Excel
3 Perform the Histogram Analysis of given dataset using Data Analysis Toolbox
of Excel
4 Perform Simple Linear Regression using Data Analysis Toolbox of Excel or
with Python and Interpret the regression table
5 Perform Multiple Linear Regression using Data Analysis Toolbox of Excel or
with Python and Interpret the regression table
6 Perform the Logistic Regression and given dataset and Interpret the
regression table
7 Install Tableau, Understand User Interface, Dimensions, Measures, Pages,
Filters, Marks and Show Me, Dataset Connections and Create a visualization
8 Various graphs in Tableau, Integration of Map and geo-locations, Creating
Interactive Dashboard and Publishing your Dashboard to Tableau Public Site
9 Scatter Plots, Data Highlighter, Pages and Cards, Annotations Creating Story
and publishing on Tableau Public
10 Given a case study: Perform Interactive Data Visualization with Tableau
Open Ended Experiments
1 Perform Data Visualization with Microsoft Power BI
2 Perform Data Visualization with R
Details of Online Laboratory Resource Material Instruction / Operating Manuals
1. Google classroom on ‘Business Intelligence Analyst’ – Code: udsf4px

P a g e | 18
 Curriculum for B.Tech.in Data Science

Course Title: Introduction To Discrete Devices And Circuits

Teaching Scheme Evaluation Scheme
Semester I/II
Theory Practical
Term Odd/Even Th Tu Pr Credits TAE CAE ESE INT EXT
Course
C
Category 2Hr 2Hr
- 3 10 15 50 25 -
Course UECL103 s. s.
Code UECP103
Teaching
Offline 75 25
Mode
4 Hrs. Total
Duration of
2 Hrs. 100
ESE

To give understanding on how current flows through the p-n junction and
relating this phenomena to the characteristics and operation of the diodes,
bipolar and field-effect transistors.
Course
To expose students to the function and application of the diodes, bipolar
Objectives
junction and field effect transistors in electronic circuits.
To use appropriate experimentation techniques to evaluate circuit
performance.
Up on successful completion of this course, student will be able to:
CO1:Relate operation of diodes, types of diodes and their role in design of
simple electronic applications.
CO2: Develop the capability to analyze and design simple circuits
containing non-linear elements such as transistors using the concepts of
Course load lines, operating points for various biasing methods.
Outcomes CO3:Classify Power amplifiers, Oscillators & Display Devices
CO4: Interpret the operation of the Field Effect Transistor (FET), Metal
Oxide Semiconductor Field Effect Transistor (MOSFET) and design FET
circuits
CO5: Demonstrate familiarity with basic electronic components and use
them to design simple electronic circuits

Mapping of Course Outcomes with Program Outcomes and Program Specific

Outcomes:

Course Program Outcomes and Program Specific Outcomes

Outcomes PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO
1 2 3
1 2 3 4 5 6 7 8 9 10 11 12
CO1 3 2 3 3 3 2 1 1 1 1 2 3
CO2 3 3 3 3 3 2 1 1 1 1 2 3
CO3 3 3 3 3 3 2 1 1 1 1 2 3
CO4 3 3 3 3 3 1 1 1 1 1 2 3
CO5 3 3 3 3 3 1 1 1 1 1 2 3

P a g e | 19
 Curriculum for B.Tech.in Data Science

Course Contents:

Unit Contents Hours

Semiconductor Devices:
I PN junction diode review, Half and full wave rectifiers, Zener Diode, 6
Varactor Diode, Tunnel Diodes, Clippers and Clampers circuits
BJT Transistors- structure, Operations & characteristics, voltages and 6
II
currents equations, CE, CB, CC configurations, Early Effect
BJT Circuits
III DC load line, Biasing circuits, Stability factor, thermal runaway, 6
Compensation methods, h-parameters, Feedback Amplifiers,
Field Effect Transistor: FETs – Drain and Transfer characteristics,- 6
IV
Current equations-Pinch off voltage and its significance, MOSFETs,
Active and Passive sensors: Temperature, humidity, light sensors, 6
V
Piezo electrical Transducers, Relay

1. Electronics Devices and Circuits, S. Salivahanan, N Suresh Kumar,

Tata McGraw-Hill 2008, Third Edition
Text
2. Integrated Electronics Jacob Millman, Tata McGraw-Hill, 2009, Second
Books Edition
3. Electronics devices and Circuits and Theory Robert L. Boylestad, Louis
Nashelsky, Pearson India, 2009, Tenth Edition
1. Electronics Devices and Circuits, S. Salivahanan
E--Books
2. Solid State Electronic Devices, 6th Edition, Ben G.Streetman&Sanjiv
Kumar Banerjee
1. Electronic Devices & Circuits, Sanjiv Gupta
Reference
2. Microelectronics Circuits A. S. Sedra& K. C. Smith, Oxford University
Books Press, 2013, Seventh Edition
3. Electronics Devices and Circuits, Nagrath I J Phi Learning Pvt Ltd,
2009, Third Edition.
Online TL
1. Virtual Lab,Electronic Devices & Circuits,IIT Bombay
Material http://vlabs.iitb.ac.in/vlab/electrical/index.html

*: Every practical will be performed on Bread Board

Sr. No. Name of Experiments / Mini Projects

0 Study of different electronic components
1 Observe and draw V-I Characteristics of PN Diode & LED Diode.
Observe and draw the V-I characteristics and Regulation characteristics of a
2
Zener diode.
3 Design Clipper circuit using Diode.
4 Design Clamper circuit using Diode.
Obtain ripple factor of Half Wave/Full wave Rectifier circuit with & without
5
filter
P a g e | 20
 Curriculum for B.Tech.in Data Science

Sr. No. Name of Experiments / Mini Projects

Draw the input and output characteristics of transistor connected in
6
CE/CB/CC any one Configuration
7 Design bipolar junction transistor as a switch
8 Design Audio oscillator using BJT
9 Design Radio Oscillator using BJT
10 Design Oscillator for Laptop.
Draw the Drain and Transfer characteristics of a given FET in CS
11
Configuration.
Draw the Drain and Transfer characteristics of a given MOSFET in CS
12
Configuration.
Open Ended Experiments
Design of Class B push pull power amplifier and observe cross over
1
distortion.
2 Design Zener regulator circuits for Processor Motherboard.
3 Design of Simple analog application circuits.

Course Title: Problem Identification and Design Thinking

Teaching Scheme Evaluation Scheme
Semester I
Theory Practical
Term Odd Th Tu Pr Credits TAE CAE ESE INT EXT
Course
A
Category 2
-- -- 2 -- -- -- 25 --
Course Hrs.
UITP101
Code
Teaching
Offline -- 25
Mode
2Hrs Total
Duration of
NA 25
ESE

Learn to illustrate the problem definition, significance of stakeholders and

Course
information gathering
Objectives Conduct the brainstorming to generate ideas and refining of ideas
Select the potential ideas and design potential solution
Up on successful completion of this course, student will be able to:
CO1: Identify the problem definition and stakeholders
Course
CO2: Conduct primary and secondary research for problem
Outcomes CO3: Analyze the gathered information
CO4: Identify potential ideas.
CO5: Design a suitable prototype and evolve it.

P a g e | 21
 Curriculum for B.Tech.in Data Science

Mapping of Course Outcomes with Program Outcomes and Program Specific

Outcomes:

Course Program Outcomes and Program Specific Outcomes

Outcomes PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO
1 2 3
1 2 3 4 5 6 7 8 9 10 11 12
CO1 3
CO2 3
CO3 3
CO4
CO5 3 3
CO6 3 3 3 3 3

Sr. No. Name of Experiments

1 Define: Identify the problem definition and define it and identify the
stakeholders. Enlist the constraints associated with Problem Definition and
formulate the objectives.
2 Research: Conduct primary and secondary research in identified problem
definition. Identify GAP and scope for improvement.
3 Information Gathering: Gather the information in the form of qualitative,
quantitative and through surveys
4 Ideate: Perform brainstorming which can leads to generation of potential ideas
5 Refinement: Refine the ideas and increase the effectiveness
6 Prototype: Design a suitable prototypes for ideas generated in Ideate Phase.
7 Selection: Identify the proposed design solution for implementation or
development phase
8 Implementation: Implement the solution or Deliver the solution to stakeholders
9 Evolve: Identify what worked well and where in the scope for improvement.
10 Report Writing: Write a detailed report for all the phases of design thinking.
Open Ended Experiments
1 Define the Industry based problem and conduct the primary and secondary
research and information gathering
2 Ideate the potentials ideas and design a prototype for industry based problem.

Basics Design 08: Design Thinking, By: Gavin Ambrose, Paul Harris,
1.
Text AVA Publishing
Books Jeanne Liedtka and Tim Ogilvie Designing for Growth: A Design
2.
Thinking Tool Kit for Managers (Columbia University Press, 2011)
The Design Thinking: Guidebook by Mr Lee Chong Hwa (Lead
EBooks 1.
Facilitator)
Reference Tim Brown, Change by Design: How Design Thinking Transforms
1.
Books Organizations and Inspires Innovation(HarperBusiness, 2009)
P a g e | 22
 Curriculum for B.Tech.in Data Science

Course Title: Introduction to Drones

Teaching Scheme Evaluation Scheme
Semester I/II
Theory Practical
Odd/
Term Th Tu Pr Credits TAE CAE ESE INT EXT
Even
Course
A
Category 2
-- -- 1 -- -- -- 25 --
Course Hrs.
UISP102
Code
Teaching
Offline -- 25
Mode
2 Hrs Total
Duration of
NA 25
ESE

Be able to describe common components of drone

Course
Be able to define acronyms related to drone
Objectives
Be able to design the application oriented dron
Up on successful completion of this course, student will be able to:
CO1:Recognize and describe the role of drone in present, past and future
society
Course
CO2: Comprehend basic components of drone.
Outcomes
CO3: Explain the impact of various payloads of drone.
CO4: Interpret the aspects of legal issues
CO5: Implement and design application oriented drone.

Mapping of Course Outcomes with Program Outcomes and Program Specific

Outcomes:

Course Program Outcomes and Program Specific Outcomes

Outcomes PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO
1 2 3
1 2 3 4 5 6 7 8 9 10 11 12
CO1 3 3 1 2 2 3 3 3 2 3 1
CO2 3 3 1 2 2 3 3 3 2 3 1
CO3 3 3 1 2 2 3 3 3 2 3 1
CO4 3 3 1 2 2 3 3 3 2 3 1
CO5 3 3 1 2 2 3 3 3 2 3 1

Course Contents:

Unit Contents Hours

Introduction to Drone Technology
Types of Drones and Their Technical Characteristics, Main Existing
I 4
Drone Types, Level of Autonomy, Size and Weight, Differences in Energy
Source, Widely Used Drone models,

P a g e | 23
 Curriculum for B.Tech.in Data Science

Assembly of Drone
Parts of a Drone, Motor, Propellers, Flight Controllers, Electronic
II 4
Speed Controllers, Safe Assembly of Drone and Drone air Flight
for aerial Photos. Battery management systems
Impact of Payloads
III Types of Payloads and their application sensors, other payloads and 4
frequency spectrum issues.
Legal Aspects
IV Legal issues on the use of frequency spectrum and electronic 4
equipment, surveillance and compliance. Flight zones
Case studies
V Future Developments in Drone Technology. Advance topic 4

1. The future of Drone Use Opportunities and Threats from Ethical

Text
& Legal Perspectives
Books 2. DIY Drones for the Evil Genius: Design, Build, and Customize
Your Own Drones
E--Books 1. Quad copters and Drones: A Beginner's Guide to Successfully
Flying and Choosing the Right Drone
1. Build a Drone: A Step-by-Step Guide to Designing, Constructing,
Reference
and Flying Your Very Own Drone Barry Davies
Books 2. Drones: An Illustrated Guide to the Unmanned Aircraft that are
Filling our Skies

Sr. No. Name of Experiments / Mini Project

1 Experimental study of customized drone components interfacing
2 Study of mAH battery capacity with flight time calculation and battery
connection
3 Study of type of motors and ESC with connection in adopter
4 Experimental study of propeller blade rotation CC & CCL & it’s role in control
5 Installation of Pluto X controller App & it’s setting
6 Study of throttle control in quad copter and its controlling
7 Experimental study of role of yaw control in quad copter
8 Experimental study of role of roll control in balancing
9 Experimental study of role of pitch control in quad copter balance and its
control
10 Study of sensor board X breakout and sensor interfacing to quad copter
Open Ended Experiments / New Experiments
1 Chuck to ARM
2 Open Sesame: Drone take-off due to change in ambient pressure

P a g e | 24
 Curriculum for B.Tech.in Data Science

3 Turn the Drone upright from it's flipped position

Details of Online Laboratory Resource Material Instruction / Operating Manuals
1. Cygnus software
2. Pluto X operating manuals
3. Transmitter & Receiver console

Course Title: Biomedical Engineering

Teaching Scheme Evaluation Scheme
Semester I/II
Theory Practical
Term Odd/Even Th Tu Pr Credits TAE CAE ESE INT EXT
Course
A
Category 2
--- --- 1 --- --- --- 25 ---
Course Hrs.
UISP101
Code
Teaching
Offline --- 25
Mode
2 Hrs. Total
Duration of
2 Hrs. 25
ESE

It helps students to understand importance of biological concepts in

Course
engineering fields.
Objectives To understand application of engineering concepts in medical
instrumentation.
CO1: Understand Human anatomy
Course
CO2: Relate various applications of sensors for Biomedical
Outcomes applicationswith safety standards.
CO3: Analyses and apply various biomedical diagnostic methods.

Mapping of Course Outcomes with Program Outcomes and Program Specific

Outcomes:

Course Program Outcomes and Program Specific Outcomes

Outcomes PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO
1 2 3
1 2 3 4 5 6 7 8 9 10 11 12
CO1 3 2 2 2 2 2 1 2 3 2 2 2
CO2 2 2 2 2 3 2 1 2 3 2 2 3
CO3 3 2 2 2 3 2 1 2 3 2 2 3
CO4
CO5

P a g e | 25
 Curriculum for B.Tech.in Data Science

Course Contents:

Unit Contents Hours

I Human Physiology and Anatomy: Introduction to Human Physiology, 4

Nervous system, Cardiovascular system,
Biomedical Instrumentation: Bio-electric Signals, Types of Electrodes,
Electrodes for ECG, EMG, EEG, Transducers and sensors related to
II biomedical measurements, ECG Machine, B. P, Heart Rate, Heart 8
Sound, Blood Flow Measurements. Electrocardiography, Pacemakers,
Defibrillators, Biomedical Standards.
Diagnostic Medical instruments: X-ray, CT Scan, MRI, Ultrasonic
III Doppler Machine, Diathermy, Lasers in medical application, Robotics in 8
medical application, Case studies, Advance topics in biomedical
Engineering. Introduction to BCI. Application of AI in Biomedical.

Text 1. Cromwell, “Biomedical Instrumentation and Measurement”, PHI.

Books 2. R. S. Khandpur, “Biomedical Instrumentation”.
Reference 1. Carr and Brown, “Biomedical Instrumentation”.
Books 2. Webster, “Application and Design of Medical Instruments".

Sr. Name of Experiments / Mini Projects/ Case Studies

No.
1 Study of Human Physiology by Skeleton model
2 Design and perform Heart Rate Detection System using Arduino
3 To study and measure the EEG signals
4 To study and measure the ECG signals
5 To study and measure the EMG signals
6 Mini project
7 Open Ended Experiments

P a g e | 26
 Curriculum for B.Tech.in Data Science

SEMESTER-II
Course Title: Integral Calculus and Differential Equations
Teaching Scheme Evaluation Scheme
Semester II
Theory Practical
TA
Term Even Th Tu Pr Credits CAE ESE INT EXT
E
Course
BS 2 1
Category NA 10 15 50 NA NA
Hrs. Hr. 3
Course UBSL152
Code
Teaching Offline 75 _
Mode
3 Hrs Total
Duration of
2 Hrs. 75
ESE

To introduce the concepts of Integral calculus & Vector integration in the

field of Engineering.
Course To develop skills in student to apply the concepts of integrals in various
Objectives engineering problems.
To develop skills in student to solve problems of Ordinary Differential
Equations and its applications in field of engineering.
Upon successful completion of this course, student will be able to:
CO1:Understand and use concept of definite integral & solve engineering
problems.
CO2:Evaluate the multiple integrals using different techniques and apply it
Course to solve engineering problems.
Outcomes CO3:Understand vector integration and its applications related to real life
problems.
CO4:Solve first order, first degree & higher order differential equations.
CO5:Form differential equations for simple engineering systems and find
its solution.

Mapping of Course Outcomes with Program Outcomes and Program Specific

Outcomes:

Course Program Outcomes and Program Specific Outcomes

Outcomes PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO
1 2 3
1 2 3 4 5 6 7 8 9 10 11 12
CO1 3 3 2 1 3
CO2 3 3 2 1 3
CO3 3 3 2 1 3
CO4 3 3 2 1 3
CO5 3 3 2 1 3
P a g e | 27
 Curriculum for B.Tech.in Data Science

Course Contents:

Unit Contents Hours

Integral Calculus: Curve tracing (Cartesian Form), Gamma function,
Beta function, Relation between beta and gamma function,
I 8
Differentiation under integral sign. (Self-study: Area, Volume, Length,
Surface area using simple integration.)
Multiple Integral: Double integral, Change of variables, Change of order
II of integration, Triple integral, Applications of multiple integral: Area, 10
mass, volume.
Vector Integration: Line integral, Surface integral, Volume integral,
III Statement of Gauss theorem, Greens theorem and Stokes theorem and 8
its applications.
Differential Equations: Linear, Reducible to linear and exact differential
IV equations of first order. Higher order linear differential equations with 8
constant coefficients (Cases of CF & PI).
Method of variation of parameters, Cauchy's and Legendre
V homogeneous differential equations. Applications of Differential 8
equations.

Higher Engineering Mathematics: B. S. Grewal, Khanna Publishers,

1.
Text 2013, Forty Third
Books Advanced Engineering Mathematics: Erwin Kreyszig John Wiley &
2.
Sons, 2013, Tenth Edition
Advanced Engineering Mathematics: Jain, R.K. and Iyengar, S.R.K,
1. Narosa Publishers; Alpha Science International, Ltd, 2007, Third
Reference
Edition
Books
Advanced Mathematics for Engineers and Scientists: Spiegel, M. R,
2.
McGraw-Hill, 2010, Second Edition

Course Title: Linear Algebra and Statistics

Teaching Scheme Evaluation Scheme
Semester I/II
Theory Practical
Odd/
Term Th Tu Pr Credits TAE CAE ESE INT EXT
Even
Course BS 2 1
Category NA 10 15 50 NA NA
Hrs. Hrs. 3
Course UBSL153
Code
Teaching Offline
75 _
Mode
3 Hrs Total
Duration of
2 Hrs. 75
ESE

P a g e | 28
 Curriculum for B.Tech.in Data Science

Course Analyze problems, recognize appropriate methods to find the solution.

Objectives Apply principles from mathematics to solve applied problems in
engineering.
Upon successful completion of this course, student will be able to:
CO1:Apply simple operations like adding, multiplying, inverting,
transposing, etc. in matrices and vectors.
CO2: Apply the concepts of Linear Algebra in programming languages.
Course CO3:Apply the concepts of least squares methods and linear regression
Outcomes analysis in engineering.
CO4:Apply the knowledge of Random variables.
CO5:Apply the knowledge of Probability distributions to solve engineering
problems.

Mapping of Course Outcomes with Program Outcomes and Program Specific

Outcomes:

Course Program Outcomes and Program Specific Outcomes

Outcomes PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO
1 2 3
1 2 3 4 5 6 7 8 9 10 11 12
CO1 3 3 2 1 3
CO2 3 3 2 1 3
CO3 3 3 2 1 3
CO4 3 3 2 1 3
CO5 3 3 2 1 3

Course Contents:

Unit Contents Hours

Elimination with matrices, Inverse matrices, Factorization, Vector space,
Column space and null space, Pivot variables, Row reduced form,
I 10
Independence, Subspaces, Bases and dimensions, Four fundamental
subspaces, Graphs, Networks, Incidence matrix.
Eigenvalues and eigenvectors, Diagonalization of a matrix, Symmetric
II matrices, Linear transformations, Singular Value Decomposition 8

Statistics: Introduction to measures of central tendency, Least Square

III method, Correlation and Regression. 7
Random Variables, Distribution functions of continuous & discrete
IV random variables, Mathematical expectations. 9
Special probability distributions: Binomial, Poisson’s and Normal
V distributions. 8

P a g e | 29
 Curriculum for B.Tech.in Data Science

Text 1. Linear Algebra and Matrix Analysis for Statistics, Chapman &Hall, CRC
Texts in Statistical Science
Books 2. Linear Algebra and Its Applications, Gilbert Strang, Cengage
Learning,2006,Fourth
1. https://faculty.atu.edu/mfinan/algebra2.pdf
EBooks 2 https://sites.math.northwestern.edu/~len/LinAlg/
3. https://faculty.atu.edu/mfinan/LINENG.pdf

Course Title: Environmental Chemistry

Teaching Scheme Evaluation Scheme
Semester I/II
Theory Practical
Term Odd/Even Th Tu Pr Credits TAE CAE ESE INT EXT
Course Category BS 1
2
UBSL131 Hrs NA. 2 10 15 50 25 NA
Course Code Hrs.
UBSP131 .
Teaching Mode Offline 75 25
3 Hrs Total
Duration of ESE 2 Hrs 100

Demonstrate various methods of water treatment for domestic and industrial

purpose.
Course
Explanation of different types of batteries and its commercial applications
Objectives
Demonstration and familiarization of impact of waste on environmental
degradation.
Upon successful completion of this course, student will be able to:
CO1: Explain various methods of water treatment for domestic and
industrial use
Course CO2:Differentiate various categories of waste and its disposal techniques
Outcomes CO3: Identify various batteries and recognize its commercial applications
CO4: Classify the different types of Energy and its future scope
CO5: Apply the knowledge of environmental pollution and degradation to
solve related problems

Mapping of Course Outcomes with Program Outcomes and Program Specific

Outcomes:
Course Program Outcomes and Program Specific Outcomes
Outcomes PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO
1 2 3
1 2 3 4 5 6 7 8 9 10 11 12
CO1 1 2 1
CO2 1 3 1
CO3 1 2 1
CO4 1 2 1
CO5 1 3 1
P a g e | 30
 Curriculum for B.Tech.in Data Science

Course Contents:

Unit Contents Hours

Water Technology: Purification of Domestic water, Boiler troubles,
I 6
softening methods of industrial water.
Solid Waste Management and treatment Technology: Introduction to
II E-Waste, Biomedical waste and Solid waste. Treatment: Collection, 4
segregation, transportation and its disposal techniques
Battery Technology: Introduction to Battery, reversible and irreversible
III 4
batteries. Examples: Lead-acid battery, Lithium ion battery and fuel cell
Energy Management: Fuel- Characteristics, composition and
IV determination of Solid, Liquid and gaseous fuel. Alternative forms of 4
energy-Conventional and Non-Conventional sources – Hydroelectricity,
Nuclear, Solar, Biomass and Geothermal energy and Bio-gas.
Upcoming Technology for pollution control: Air pollution- Urban air
V quality standards as per WHO, its sources and controlling methods. 4
Water pollution- water quality index as per WHO, its sources and
controlling methods

Text Book of Engineering Chemistry,S.S.Dara, S.Chand&

1.
company,2013, Eleventh Edition
Text Engineering Chemistry,Jain &Jain, Dhanpatrai&Dhanpatrai,2015,
2.
Books sixteenth edition
A Test Book of Environmental Chemistry &Pollution Control, S.S. Dara
3.
,S. Chand & Co.,2006,eleventh edition
1 Water purification,AlexandruGrumezescu,First edition
E books 2 Solid waste management by Stephen Burnley ,willey publication,2014
3 Air Pollution,S. K. Agarwal,APH Publishing, 2005
Environmental Chemistry , B.K. Sharma & H. Kaur, Goel Publishing
1.
Reference House,2014,fourteen edition,
Books Environmental Studies, R. Rajgopalan, Oxford Publication,2016,Thirdrd
2.
edition
Introduction to Household Water Treatment and Safe
1
Storage,https://www.coursera.org/learn/water-treatment/home/welcome
Electronic waste Management-Issues and challenges by Dr. Brajesh
2.
Online TL Kumar Dubey,http://nptel.ac.in/courses/120108005/
Material Integrated Waste Management for a Smart
3
City,https://onlinecourses.nptel.ac.in/noc19_ce31/course
Air pollution-Global threat to our Health
4
https://www.coursera.org/learn/air-pollution-health-threat/home/welcome

P a g e | 31
 Curriculum for B.Tech.in Data Science

Sr. No. Name of Experiments / Case Studies

1 Physical parameters of water- Determination of PH, turbidity and
conductivity of given water sample.

2 Chemical parameters of water- Determination of Hardness by

Complexometric method and Alkalinity by Warders Method.

3 Demonstration on different types of cells and batteries.

4 Determination of Moisture present in given Solid waste
5 Case study on current scenario of region specific waste generation.
6 Determination of Proximate analysis of Solid fuel as Coal.

7 Determination of Acid value of Liquid fuel.

8 Demonstration on measuring air quality by using Air Quality Tester.
9 Determination of chloride ions from given water sample by Argentometric
Method

10 Determination of DO of given water sample by Iodometric titration

11 Preparation of Biodiesel from edible oil
12 Determination of saponification value of liquid fuel

Course Title: Communication Skills

Teaching Scheme Evaluation Scheme
Semester I/II
Theory Practical
Credit
Term Odd/ Even Th Tu Pr TAE CAE ESE INT EXT
s
Course
H
Category 2 2
- 3 10 15 50 25 -
Course UHUL101 Hrs. Hrs.
Code UHUP101
Teaching
Offline 75 25
Mode
4 Hrs. Total
Duration of
2 Hrs. 100
ESE

P a g e | 32
 Curriculum for B.Tech.in Data Science

To Introduce the students on the importance of communication in

Engineering
To build up the listening, speaking, reading and writing skills
Course To carve the students on their body language through practical approach
Objectives
To augment the presentation skills of the students for their technical
Proficiency
To enhance their higher order thinking skills through review activity
Upon successful completion of this course, student will be able to:
CO1: Students shall realize the value and relevance of communication
functionalities.
CO2: Students shall coordinate, collaborate and corroborate through
LSRW Skills
Course CO3: Students shall attribute their Impactful communication through power
Outcomes
body language
CO4: Students shall confidently exhibit their technical proficiencies through
effectual PPTs and Professional Conduct
CO5: Students shall be strongly opinionated and thoughtful about the
contents they are introduced to.

Mapping of Course Outcomes with Program Outcomes and Program Specific

Outcomes:

Course Program Outcomes and Program Specific Outcomes

Outcomes PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO
1 2 3
1 2 3 4 5 6 7 8 9 10 11 12
CO1 3
CO2 3
CO3 3
CO4 3
CO5 3 3

Course Contents:

Unit Contents Hours

Course Foundation :
Ice-Breaker- Activity on Group Introduction (Circle Activity)
I Self- Realization – Review on SWOC Analysis and self- Introspection 4
SMART Goals- Preparation and presentation of Individual goal charts
Pre-Training Module: Assessment on prior knowledge of the students
Communication for Engineering :
Introduction, process, barriers, Types of Communication--Talk on
Emerging trends and importance of communication skills in
II 4
Engineering- Overview of Listening, Speaking, Reading and Writing
skills (LSRW)- The techniques and usage of the interrelated LSRW
skills- The practical execution of LSRW Skills in Classroom and Lab
P a g e | 33
 Curriculum for B.Tech.in Data Science

Formal Correspondence and Content Framing:

Introduction to formal Writing techniques- Difference between Formal
and Informal Writing- Formats of Letter and Email Writing- Practice of
letter and email writing with real time situations- The Art of framing
III 4
communication with effective content- Implementation of High order
thinking skills with Critical thinking to explore Creativity. Review Activity
with Moral Case studies/Case Letters (Stereo Type/ Gender Bias)/
Abstract Writing/Newspaper article/Extempore
Presentation skills:
Structure of Presentations-Use of aids like Power point- Do’s and
IV Don’ts of presentation-Types of presentation- Body Language during 4
presentation- The practical execution of Presentation skills (Individual
and Technical) along with review and feedback
Non-verbal Communication
Difference between Verbal and Non-verbal Communication-Physical
Appearance-“Do Looks really Matter?”- Body Language Practice with
V 4
Storytelling activity- Tips for improving Nonverbal communication
(Gesture/Posture/Facial Expression/Personal Appearance/ Eye
contact)

Text
1. Communication Book – Global Education Ltd ( In Progress)
Books
E--Books 1. Bridging the Soft Skills Gap- Bruce Tulgan
Soft Skills for enhancing Employability( Connecting Campus to
Reference 1.
Corporate) – M S Rao
Books
2. Communication Skills for Technical Students-Mr. Farahatulla
Online TL Online Lectures/Exercises/Assessment/Evaluation/Quizzes shall be
1.
Material made available with extended learning

Sr. No. Name of Activities

1 Reading Skills: Read Aloud
2 Writing Skills :Abstract Writing
3 Read- Write Activity: Activity on Comprehension
4 Read-Speak Activity: Case Letters
5 Speak- Speak Activity: Turn Court
6 Write- Write: Triggering Mind
7 Presentation Skills: Practical of Creating PPTs

P a g e | 34
 Curriculum for B.Tech.in Data Science

Course Title: Programming for Problem Solving

Teaching Scheme Evaluation Scheme
Semester II
Theory Practical
Term Even Th Tu Pr Credits TAE CAE ESE INT EXT
Course
C
Category 4
-- -- 2 -- -- -- 50 --
Course Hrs.
UITP102
Code
Teaching
Online -- 50
Mode
4 Hrs Total
Duration of
NA 50
ESE

Course This Course introduces basic idea of how to solve given problem.
Focuses of paradigms of programming language.
Objectives
Aims at learning python as programming language.
Up on successful completion of this course, student will be able to:
CO1:Analyze and understand the behavior of fundamental programming
constructs.
Course CO2:Develop & Analyze Algorithms for solving problems.
CO3:Demonstrate the knowledge of various concepts of Python
Outcomes Language.
CO4: Demonstrate knowledge of advanced concepts of Python
Programming
CO5: Develop solutions using functions & recursion

Mapping of Course Outcomes with Program Outcomes and Program Specific

Outcomes:

Course Program Outcomes and Program Specific Outcomes

Outcomes PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO
1 2 3
1 2 3 4 5 6 7 8 9 10 11 12
CO1 3
CO2 3
CO3 3
CO4 3
CO5 3 3

Course Contents:
Unit Contents Hours
ALGORITHMIC PROBLEM SOLVING:
Algorithms, building blocks of algorithms (statements, state, control
I flow, functions), notation (pseudo code, flow chart, programming 8
language), algorithmic problem solving, simple strategies for
developing algorithms (iteration, recursion).

P a g e | 35
 Curriculum for B.Tech.in Data Science

DATA, EXPRESSIONS, STATEMENTS

Python interpreter and interactive mode; values and types: int, float,
Boolean, string, and list; variables, expressions, statements, Tuple
II 8
assignment, precedence of operators, comments; modules and
functions, function definition and use, flow of execution, parameters
and arguments;
CONTROL FLOW, FUNCTIONS
Conditionals: Boolean values and operators, conditional (if), alternative
(if-else), chained conditional (if-elif-else); Iteration: state, while, for,
III 8
break, continue, pass; Fruitful functions: return values, parameters,
local and global scope, function composition, recursion; Strings: string
slices,
DICTIONARIES
Dictionaries: operations and methods; advanced list processing – list
IV comprehension; 8
Object Oriented Programming: Classes and objects-inheritance-
polymorphism
FILE HANDLING & EXCEPTION HANDLING
V Overview of exception classes and Types: try, except, finally: File 8
processing: reading and Writing files, Recent Trends in Python

Sr. No. List of Experiment

1 Implementing if else in Python
2 Implementing loop in Python
3 Implementing Functions in Python
4 Implementing Set, Tuple & Dictionary in Python
Project Using Python
5
Module 1: Algorithms, Expression, Variables & I/O
6 Module 2: Control Structures
7 Module 3: List, Strings, Tuples & Dictionary
8 Module 4: Functions
9 Module 5: Object Oriented Programming
10 Module 6: Expression Handling & File Handling

Python Programming using problem solving Approach, By

Text 1.
ReemaTheraja, First Edition, 2017.
Books
2. A Byte of Python By C. H. Swaroop, Edition 2.1

P a g e | 36
 Curriculum for B.Tech.in Data Science

Course Title: Modeling of Digital Circuits

Teaching Scheme Evaluation Scheme
Semester II
Theory Practical
Term Even Th Tu Pr Credits TAE CAE ESE INT EXT
Course
C
Category 3 2
-- 4 10 15 50 25 --
Course UECL104 Hrs. Hrs.
Code UECP104
Teaching
Offline 75 25
Mode
5Hrs Total
Duration of
2 Hrs. 100
ESE

To understand number system and optimization laws

Course Objectives To apply knowledge on VHDL program in Combinational &
Sequential
To interpret complex problem in the field of digital system design
Up on successful completion of this course, student will be able to:
CO1: Solve the problems on Number system codes and their
Course Outcomes conversions.
CO2: Create and design canonical logic forms
CO3: To demonstrate basic knowledge VHDL fundamentals
CO4: Design VHDL Programs
CO5: Design real time digital applications

Mapping of Course Outcomes with Program Outcomes and Program Specific

Outcomes:

Course Program Outcomes and Program Specific Outcomes

Outcomes PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO
1 2 3
1 2 3 4 5 6 7 8 9 10 11 12
CO1 3 3 3 2 1 3
CO2 3 3 3 2 1 3
CO3 3 3 3 2 1 3
CO4 3 3 3 2 1 3
CO5 3 3 3 2 1 3

Course Contents:

Unit Contents Hs
D.C. Circuits:
I Circuits Elements (R, L, C), Kirchhoffs Laws, Voltage source, Current 05
Source (definition, characteristics of practical source, equivalent)
II Number Systems & Boolean Algebra: 08
Number system, Decimal, binary, octal, hexadecimal number system, 1s

P a g e | 37
 Curriculum for B.Tech.in Data Science

and 2s complement codes, Boolean algebra, De-Morgan’s theorems,

Logic Gates, canonical logic forms, sum of product & product of sums,
Karnaugh maps.
Combinational & Sequential circuits:
Introduction to combinational circuits, code conversions, decoder,
III encoder, multiplexers & De-multiplexer, binary adder, Subtractor, BCD 11
adder, Latches, Flip-flops, counters, Shift Registers, Finite state
Machine.
Introduction to VHDL:
IV Introduction to VHDL, Methodologies, design units, data objects, VHDL 08
data types, Attributes, Concurrent and sequential, Structural statements,
inertial and transport delays, delta delay, signal drivers.
Combination Logic design:
Gates, decoder, encoder, multiplexer, De-mux, adder, Subtractor,
V Latches, SR latch, Flip-Flops, Shift Registers, counters Subprograms – 08
Functions, Procedures, generic, generate, package, IEEE standard logic
library.

1. Digital Electronics R P Jain McGraw Hill 2017 Second Edition

Text Digital Logic and Computer Design Morris Mano PHI 2017
2.
Books review Second Edition
3. VHDL Primer – J Bhasker – Pearson Education
EBooks 1. Free Range VHDL-Bryan Mealy, FabrizioTappero
Reference 1. Digital Electronic Principles-Malvino PHI 2011-13 Seventh Edition
Books 2. Digital System Design – John Wakerley
Online TL
1. IIT’s NPTEL lectures
Material

Sr. No. Name of Experiments / Mini Projects/ Case Studies

1 Design 4:1 multiplexer and write a VHDL code for same using data flow style
of modeling.
2 Design Arithmetic and Logic Unit for 16 bit operation
(Addition,Subtraction,Multiplication,Division,ORing,ANDing,XORing,XNORing)
3 Design BCD to seven segment decoder & display “GHRCE”.
4 Design half adder and full adder and write a VHDL code for same using
dataflow style of modeling.
5 Design & write Test bench for an 8 bit adder having range 0 to 255 decimal.
6 Design 4-to-16 decoder by combining two 3-to-8 decoders and write a VHDL
code for Same using structural style of modeling.
7 Write a VHDL code for to design Flip-Flop (D, T, and SR) using behavioral
style of modeling.
8 Write a VHDL code for 3-bit up-down counter using sequential style of
modeling.
9 Write a VHDL code for high speed two-pole switch for power controlling on
FPGA using sensitivity list.
P a g e | 38
 Curriculum for B.Tech.in Data Science

10 Design of Finite state machine to detect a sequence “1011”using Mealy model

and write VHDL code for the same.
Open Ended Experiments
1 Write a VHDL code for to divide clock frequency of 50 Mhz.
2 Write a code for 8 Bit RAM Module
Details of Online Laboratory Resource Material Instruction / Operating Manuals
1. Virtual Lab
8 Write a VHDL code for 3-bit up-down counter using sequential style of
modeling.
9 Write a VHDL code for high speed two-pole switch for power controlling on
FPGA using sensitivity list.
10 Design of Finite state machine to detect a sequence “1011”using Mealy model
and write VHDL code for the same.
Open Ended Experiments
1 Write a VHDL code for to divide clock frequency of 50 Mhz.
2 Write a code for 8 Bit RAM Module
Details of Online Laboratory Resource Material Instruction / Operating Manuals
1. Virtual Lab

Course Title: Internet of Things

Teaching Scheme Evaluation Scheme
Semester II
Theory Practical
Term Odd/ Even Th Tu Pr Credits TAE CAE ESE INT EXT
Course
A
Category 02
- - 01 - - - 25 -
Course Hrs.
UECP105
Code
Teaching
Offline - 25
Mode
02 Hrs. Total
Duration of
NA 25
ESE

To enable students to understand scope of Internet of things in Industry

Course To introduce the concept of Internet of things
Objectives To develop and apply Advance method for Implementation of Internet of
Things
CO1: Analyze various IoT devices and its technology.
CO2: Select and use of appropriate IoT technologies & Gateways protocols
Course
for application development.
Outcomes
CO3: Design and development of IoT application with the use of different
cloud technology.

P a g e | 39
 Curriculum for B.Tech.in Data Science

Mapping of Course Outcomes with Program Outcomes and Program Specific

Outcomes:

Course Program Outcomes and Program Specific Outcomes

Outcomes PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO
1 2 3
1 2 3 4 5 6 7 8 9 10 11 12
CO1 2 1 3 2 3 3
CO2 2 1 3 2 3 3
CO3 2 2 3 2 3 2 3
CO4
CO5

Course Contents:

Unit Contents Hours

Architecture of IoT
I Introduction of IoT, Introduction Industry 4.0, Need of IoT for Industry 4.0, 6
Block Diagrams of IoT System, Virtual Private server and IoT Cloud,
Application Programming Interface(API)
Development of Things using Arduino Platform:
Introduction of IoT Node with Sensor and Actuator, Interface sensors
&devices, NodeMCU and ESP 32 wifi Microcontroller, Network: LORA,
II NRF, Xbee, IoT Gateway. 6
Communication protocol :
Introduction of Internet Protocol , Internet Layer: IP
Transport layer-TCP,UDP , Application Layer- HTTP, MQTT, FTP, CoAP,
SPDY.
IoT Platform and Application :
III Customized IoT Platform using Virtual Private Server, Amazon Alexa, 8
Google API, Blynk, Cayenne, Thingsboard, Thigspeak. Case Study of
applications.

1. Samuel Greengard ,The Internet of Things” by Samuel Greengard

Text
2. Klaus Schwab ,The Fourth Industrial Revolution” by Klaus Schwab
Books Author:
3. CunoPfister Author: CunoPfister ,Getting started with Internet of Things
1. IoT and Smart Building Data – by Senseware.
EBooks
2.
 SkyHook, Everything You Need to Know About LPWAN Location

Reference 1. CunoPfister, Getting Started with the Internet of Things: Connecting

Sensors and Microcontrollers to the Cloud (Make: Projects) 2018
Books 2. Adrian McEwen , Designing the Internet of Things Kindle Edition

P a g e | 40
 Curriculum for B.Tech.in Data Science

Sr.No.
Name of Experiments
1 To perform programming for Interfacing NodeMCU to Cloud Thingsboard

2 To perform programming for sending DHT Temperature sensor data to cloud.

3 To perform programming for control home appliance using NodeMCU

controller and cloud.
4 Design and interface Water level indicator using NodeMCU controller
Perform Raspberry PI program to interface of network device [wifi, GSM,
5
GPRS] for device communication

6 Design and Perform digital Notice Board Application Using Raspberry pi3
Mega Board using NodeMCU.
7 Design and Perform smart Garbage indication system using
NodeMCUcontroller and GLCD.
8 Design and Perform IOT Based Agriculture monitoring system using Wifi
ESP8266 [Thinkspeak Cloud]
9 Project Module 6: Perform Automatic Plant Irrigation controlling System using
NodeMCU and Cloud
10 Open Ended Experiment:

P a g e | 41
 Curriculum for B.Tech.in Data Science

SEMESTER-III

Course Title: Discrete Mathematics and Graph Theory

Teaching Scheme Evaluation Scheme
Semester III
Theory Practical
Term ODD Th Tu Pr Credits TAE CAE ESE INT EXT
Course
BS
Category
3 1 -- 4 10 15 50 -- --
Course
UBSL255
Code
Teaching
75 --
Mode
4 Total
Duration of
3 Hrs 75
ESE

This course introduces size and kind of objects.

It also skills to analyze objects meeting the criteria, finding "largest",
Course
"smallest", or "optimal" objects.
Objectives
It also introduces combinatorial structures and apply algebraic techniques
to combinatorial problems
CO1: Know grouping of objects and operation, Relation, ordering of
objects.
CO2: Know Groups, their types and Applications.
Course CO3: Know Rings, their types and Applications.
Outcomes
CO4: Solve different kinds Graph, Trees.
CO5: Know the basics of combinatorial structure
CO6: Solve number theory applications.
Mapping of Course Outcomes with Program Outcomes and Program Specific
Outcomes:

Course Program Outcomes and Program Specific Outcomes

Outcomes PO PO PO PO PO PO PO PO PO PO PO PO1 PS PSO PSO
O1 2 3
1 2 3 4 5 6 7 8 9 10 11 2
CO1 3 3 3 2
CO2 3 3 3 2
CO3 3 3 3 2
CO4 3 3 3 2
CO5 3 3 3 2
CO6 3 3 3 2

Course Contents:

Unit Contents Hours

P a g e | 42
 Curriculum for B.Tech.in Data Science

Set Theory
Operations on sets, Laws of algebra of sets, Representation of sets on
computer in terms of 0’s & 1’s. Partition & covering of a set, ordered
pair, Product set, Relation–Different types of relations, Graph of
I 7
relation, Matrix of relation, Transitive closure of relation, Properties of
relations, Compatible relation. Functions, Partial ordering & partially
ordered set, Hasse diagram of Poset, Totally ordered set, Peano
axioms & Mathematical Induction.
Group
Algebra or Algebraic systems like semigroup, monoid and examples.
Homomorphism, Isomorphism of semigroup&monoid. Groups,
II properties of algebraic groups. Permutations groups, Subgroups, 8
Cosets, Lagrange’s theorem, properties of cyclic groups, generator of
group, kernel of Homorphism, quotient group, fundamental theorems &
Homomorphism of groups, Residue classes &Fermats theorem.
Rings
Rings, types of rings, Fields, subring, Integral domain. Simple
properties of rings. Lattice as Poset& as algebraic system, Types of
lattices, Hasse diagrams, Sublattice, direct product of Lattices, Lattice
III 8
Homomorphism, complement of elements of lattices, Various lattices,
composition tables, Lattice , Boolean algebra; Boolean Expressions,
Equivalence of Boolean Expression by tables, Simplification of circuit &
equivalent circuit by truth tables.
Graph Theory
Graphs and its types, Sub graph, Quotient graph, Euler path, complete
path, indegree, outdegree, reachability, cycle, matrix representation of
IV 8
graph. Transitive closure of graph, Adjacency matrix, Trees, Venn
diagram, Representation of trees, binary trees, spanning trees, Prim’s
algorithm.
Combinatorics
Definition of generating functions and examples, proof of simple
combinatorial identities. Recursive relations: definitions & examples,
explicitly formula for sequence, back tracking to find explicit formula of
V sequence, solving recurrence relations. Counting Theorem and 8
application,multiplication principle of counting. Permutation &
Combination with examples. The pigeon hole principle & extended
pigeon hole principle and application of pigeon hole principle in solving
simple problems.
Number Theory
Continued fractions, The study of continued fractions. Alpha has
Infinite continued fraction if alpha is irrational. Alpha has periodic
VI 8
continued fractions if alpha is quadratic irrational. Application to
approximation of irrationals by rationals. Hurwitz’s theorem, Advanced
topic on Combinatorial Theory.

Text Discrete Mathematical structure with application to computer science

1.
Books by Trembley&Manohar (Mc. Graw Hill)

P a g e | 43
 Curriculum for B.Tech.in Data Science

2. Discrete Mathematical Structure by Kolmann , Busby & Ross (PHI)

3. Discrete mathematics by Lipschutz& Lipson , Schaum’s outline, TMH
1.
1. Discrete Mathematics by Liu
2. Discrete Mathematics by John Truss (Addison Wesley, 2000)
Reference 3. Foundations of Discrete Mathematical by K. D. Joshi (Willey Eastern).
Books 4. Set Theory by Lipschutz (Schaum Series, Asian Student Edition).
Modern Algebra by M. L. Khanna (Jai Prakash Nath& Company
5.
Meerut).
on line TL
1. https://onlinecourses.nptel.ac.in/noc20_cs37/unit?unit=41&lesson=42
Material

Course Title: OPERATING SYSTEM

Teaching Scheme Evaluation Scheme
Semester III
Theory Practical
Term Odd Th Tu Pr Credits TAE CAE ESE INT EXT
Course
C
Category
3 -- -- 3 10 15 50 -- --
Course
UCSL206
Code

Teaching
Online 75 --
Mode
3 Total
Duration of
3 Hrs. 75
ESE

Course Introduces general idea, structure and functions of operating system

Making students aware of basic mechanisms used to handle processes,
Objectives
memory, storage devices and files.
1.Identify basic structure and purpose of operating system.
2. Interpret the concepts of process and illustrate various CPU
Course scheduling algorithms.
3. Interpret the concepts of inter process communication.
Outcomes
4. Schematize Deadlock & security mechanisms in operating systems.
5. Analyze different memory management techniques with advantages
and disadvantages.

Mapping of Course Outcomes with Program Outcomes and Program Specific

Outcomes:

Course Program Outcomes and Program Specific Outcomes

P a g e | 44
 Curriculum for B.Tech.in Data Science

Outcomes PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO

1 2 3
1 2 3 4 5 6 7 8 9 10 11 12
CO1 2 3 1
CO2 2 3 2
CO3 3 3 2
CO4 3 2 2
CO5 3 2 3

Course Contents:

Unit Contents Hours

Evolution of OS, Types of OS, Basic h/w support necessary for modern
I operating systems, services provided by OS, system programs and 6
system calls, system design and implementation.
Process & Its Scheduling
II Process concept, process control block, Types of scheduler, context 4
switch, threads, multithreading model, goals of scheduling and different
scheduling algorithms,
Process management and synchronization: Concurrency conditions,
III Critical section problem, software and hardware solution, semaphores, 4
conditional critical regions and monitors, classical inter process
communication problems
IV Deadlock definitions, Prevention, Avoidance, detection and Recovery, 8
Goals of Protection, access matrix, Deadlock implementation
File systems: File concept, Access methods space allocation strategies,
disk arm scheduling strategies. Contiguous allocation, Relocation,
V Paging, Segmentation, Segmentation with paging, demand paging, 8
Virtual Memory Concepts, page faults and instruction restart , page
replacement algorithms, working sets, Locality of reference, Thrashing,
Garbage Collection.

Text 1. Operating System concepts – Silberchatz; Galvin, Addison Wesley, 6

thEdn.
Books 2. Modern Operating Systems – Tanenbaum, Pearson Edn. 2 ndedn
3. Operating Systems: Internals and Design Principles -- William Stallings
1. Operating Systems – S R Sathe, Macmillan Publishers, India, 2008
Reference
2. Operating System –Milan Milenkovik, McGraw-Hill, 1987
Books
3. Operating Systems - 3 rd Edition by Gary Nutt, Pearson Education.
on line TL
1. https://nptel.ac.in/courses/106/108/106108101/
Material

P a g e | 45
 Curriculum for B.Tech.in Data Science

Course Title: Database Management System

Teaching Scheme Evaluation Scheme
Semester III
Theory Practical
Term ODD Th Tu Pr Credits TAE CAE ESE INT EXT
Course
C
Category
3 -- 2 4 10 15 50 10 15
Course UCSL301
Code UCSP301
Teaching
Online 75 25
Mode
5 Total
Duration of
2 Hrs 100
ESE

This course introduces general idea of database management system

It is aimed at developing skills to design databases using data modeling and
design techniques.
Course
It is also aimed to developing skills to implement real life applications which
Objectives
involve database handling.
This course also provide carrier opportunities in subject areas of designing,
storage techniques and data handling and managing techniques
CO1:Analyze an information storage problem and derive an information
model expression in the form of Entity relation diagram and design
appropriate data model for it.
CO2: Demonstrate SQL queries to perform CRUD (Create, Retrieve,
Update, Delete) operations on database and perform inferential analysis of
data model
Course
CO3: Identify features of database management systems and Relational
Outcomes
database and Understand functional dependencies and various
normalization forms
CO4: Perform basic transaction processing and management and ensure
database security, integrity and concurrency control
CO5: Analyze the management of structured and unstructured data
management with recent tools and technologies

Mapping of Course Outcomes with Program Outcomes and Program Specific

Outcomes:

Course Program Outcomes and Program Specific Outcomes

Outcomes PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO
1 2 3
1 2 3 4 5 6 7 8 9 10 11 12
CO1 3 3 2
CO2 3 3 3
CO3 2 3 3
CO4 3 2 2
CO5 2 3 2

P a g e | 46
 Curriculum for B.Tech.in Data Science

Course Contents:

Unit Contents Hours

Introduction to DBMS, DBMS Architecture, Data Models, Relational
I 6
Database design:
SQL Concepts : Basics of SQL, DDL, DML, DCL, structure – creation,
alteration, defining constraints, Functions - aggregate functions, Built-in
II functions –numeric, date, string functions, set operations, sub-queries, 8
correlated sub-queries, Use of group by, having, order by, join and its
types, Exist, Any, All , view and its types.
Functional Dependency (FD) – Basic concepts, closure of set of FD,
III closure of attribute set, Decomposition, Normalization – 1NF, 2NF, 6
3NF, BCNF, 4NF
Transaction control commands – Commit, Rollback, Save point.
Cursors, Stored Procedures, Stored Function, Database Triggers.
IV Transaction Management: Transaction concepts, properties of 6
transactions, serializability of transactions, Two- Phase Commit
protocol, Deadlock, two-phase locking protocol
NoSQL Databases - Introduction, CRUD Operations, Data Mining
V 4

Abraham Silberschatz, Henry F. Korth and S. Sudarshan, Database

1.
System Concepts 4th Ed, McGraw Hill, 2002.
Text Jeff Ullman, and Jennifer Widom, A First Course in Database systems,
2.
Books 2nd Ed.
RamezElmasri and ShamkantNavathe, Fundamentals of Database
3.
Systems 2nd Ed, Benjamin Cummings, 1994.
1. G. K. Gupta :”Database Management Systems”, McGraw – Hill.
Regina Obe, Leo Hsu, PostgreSQL: Up and Running, 3rd Ed, O'Reilly
Reference 2.
Media 2017.
Books
Kristina Chodorow, Shannon Bradshaw, MongoDB: The Definitive
3.
Guide, 3rd Ed, O'Reilly Media 2018.
on line TL
1. https://nptel.ac.in/courses/106/105/106105175/
Material

P a g e | 47
 Curriculum for B.Tech.in Data Science

Course Title: Introduction To Data Science

Teaching Scheme Evaluation Scheme
Semester III
Theory Practical
Term ODD Th Tu Pr Credits TAE CAE ESE INT EXT
Course
C
Category
3 -- 2 4 10 15 50 25 --
Course UAIL205
Code UAIP205
Teaching
Offline 75 25
Mode
5Hrs Total
Duration of
2 Hrs 100
ESE

An understanding of problems solvable with data science and an ability to

Course attack them from a statistical perspective.
Objectives
The ability to create data analytical pipelines and applications in Python
CO1 : To be able to understand basic concepts of data science and key
issues
Course CO2: To be able to understand data collection and pre-processing
Outcomes CO3: To be able to apply statistical analytics on datasets
C04: To be able to implement regression models
CO5: To be able to implement model evaluation and validation

Mapping of Course Outcomes with Program Outcomes:

Program Outcomes
Course
Outcome P P
P
P
P
PO
P P P
PO PO PO
PS PS
s O O O O O O O1 O2
O2 O4 6 10 11 12
1 3 5 7 8 9
CO1 3 2 2 2
CO2 3 2 3 3
CO3 3 3 2 3
CO4 3 3 3 3
CO5 3 3 2

P a g e | 48
 Curriculum for B.Tech.in Data Science

Course Contents:

Unit Contents Hours

Introduction to Data Science
Evolution of Data Science, Data Science Roles, Stages in a Data
I 8
Science Project, Applications of Data Science in various fields, Data
Security Issues.
Data Collection and Data Pre-Processing
Data Collection Strategies, Data Pre-Processing Overview, Data
II 8
Cleaning, Data Integration and Transformation, Data Reduction, Data
Discretization.
Exploratory Data Analytics
Descriptive Statistics, Mean, Standard Deviation, Skewness and
III 8
Kurtosis, Box Plots, Pivot Table, Heat Map, Correlation Statistics,
ANOVA
Model Development
Simple and Multiple Regression, Model Evaluation using Visualization,
IV Residual Plot, Distribution Plot, Polynomial Regression and Pipelines, 8
Measures for In-sample Evaluation, Prediction and Decision Making,
Feature Engineering
Model Evaluation
Generalization Error, Out-of-Sample Evaluation Metrics, Cross
V Validation, Overfitting, Under Fitting and Model Selection, Prediction by 8
using Ridge Regression, Testing Multiple Parameters by using Grid
Search

1 JojoMoolayil, “Smarter Decisions : The Intersection of IoT and Data

. Science”, PACKT, 2016.
Text 2
Cathy O’Neil and Rachel Schutt , “Doing Data Science”, O'Reilly, 2015
Books .
David Dietrich, Barry Heller, Beibei Yang, “Data Science and Big data
3
Analytics”, EMC 2013
Raj, Pethuru, “Handbook of Research on Cloud Infrastructures for Big
4
Data Analytics”, IGI Global.

P a g e | 49
 Curriculum for B.Tech.in Data Science

Course Title: Data Structure and Algorithms

Semester III Teaching Scheme Evaluation Scheme
Theory Practical
Term ODD Th Tu Pr Credits TAE CAE ESE INT EXT
Course C
Category 3 -- 2 4
10 15 50 25 --
Course UCSL201
Code UCSP201
Teaching Online 75 25
Mode 5 Total
Duration of 3 Hrs. 100
ESE

This course introduces basic idea of data structure while making aware of
methods and structure used to organize large amount of data.
Course
It’s also aimed at developing skill to implement methods to solve specific
Objectives problems using basic data structures.
The course also provides career opportunities in design of data,
implementation of data, technique to sort and searching the data.
CO1:Identify essential data structures and understand when it is
appropriate to use..
CO2: Explain use of Abstractdata types & ways in which ADTs can
Course be stored, accessed and manipulated
Outcomes CO3:Apply linear data structures to solve various real world
computing problems using programming language.
CO4: Analyze standard algorithms for searching and sorting
CO5: Implementation of linear data structure to find solution for given
engineering applications.

Mapping of Course Outcomes with Program Outcomes and Program Specific

Outcomes:

Course Program Outcomes and Program Specific Outcomes

Outcomes PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO
1 2 3
1 2 3 4 5 6 7 8 9 10 11 12
CO1 3 2 3 1
CO2 2 3 3 2
CO3 3 3 3 1 3
CO4 3 3 3 2 3
P a g e | 50
 Curriculum for B.Tech.in Data Science

Course Contents:

Unit Hours
Contents
Introduction –Common operations on data structures, Types of data
structures, Data structures & Programming, Program Design,
Complexities, Time Complexity, order of Growth, Asymptotic Notation.
I 9
Sorting and Searching
Introduction, Sorting, Insertion Sort, Selection Sort, Merging, Merge-
Sort, Shell Sort, Radix Sort, Searching and Data Modification, Hashing
Arrays :Introduction, Linear Arrays, Arrays as ADT, Representation of
Linear array in Memory, Traversing Linear Arrays, Inserting and
deleting, Sorting; Bubble Sort, Searching; Linear Search, Binary
Search, : Linked List
II 9
Introduction, Linked Lists, Representation of Linked Lists in Memory,
Traversing a Linked List, Searching a Linked List, Memory Allocation;
Garbage Collection, Insertion into a Linked List, Deletion from a Linked
List, Header Linked List, Circularly Linked Lists, Two-Way Lists (or
Doubly Linked Lists).
Stacks, Queue and Recursion-Introduction, Stacks ,Array
Representation of Stacks ,Linked Representation of Stacks, Stack as
III ADT, Arithmetic Expression; Polish Notation, Application of Stacks, 9
Recursion, Towers of Hanoi, Implementation of Recursive Procedures
by Stacks, Queue, Linked Representation of Queues, Queues as ADT,
Circular Queues, Deques, Priority Queues, Applications of Queues
.Trees and Binary Trees -Binary Trees • Representation, Operations:
Insert, Delete, Traversal: Preorder, Inorder, Postorder,Traversal
Algorithms Using Stacks,Header Nodes; Threads,Threaded Binary
Trees,Binary Search Trees ,Searching and Inserting in Binary Search
IV 10
Trees,Deleting in a Binary Search Tree,Balanced Binary Trees,AVL
Search Trees,Insertion in an AVL Search Tree, Deletion in an AVL
Search Tree,m-way Search Trees ,Searching, Insertion and Deletion in
an m-way Search tree,B-Trees ,Searching, Insertion and Deletion in a
B-tree,B+-Trees Graph Algorithms
Graphs and their Applications -) Introduction, Graph Theory
V Terminology, Sequential Representation of Graphs, Adjacency Matrix; 8
Path Matrix, Linked Representation of a Graph, Operations on Graphs,
Traversing a Graph,Posets; Topological Sorting,Spanning Trees

1. AVAho, J Hopcroft, JD Ullman, Data Structures and Algorithms,

Text Addison- Wesley, 1983.
2. THCormen, CF Leiserson, RL Rivest, C Stein, Introduction to
Books Algorithms, 3rd Ed., MIT Press, 2009.
3. Sahni, S., “Data Structures, Algorithms, and Applications in C++”,
WCB/McGraw-Hill.
P a g e | 51
 Curriculum for B.Tech.in Data Science

E--Books 1. https://apps2.mdp.ac.id/perpustakaan/ebook/Karya%20Umum/Dsa.pdf

1. Data Structures & Algorithms, 1e, Alfred V.Aho, Jeffery D. Ullman ,

Person.
Reference
2. MT Goodrich, R Tamassia, DM Mount, Data Structures and Algorithms
Books in Java, 5th Ed., Wiley, 2010. (Equivalent book in C also exists.)
3. Wirth, N., “Algorithms and Data Structures”, Prentice-Hall of India.

1. https://nptel.ac.in/courses/106/102/106102064/
online TL
Material 2. http://cse01-iiith.vlabs.ac.in/
3. https://ds2-iiith.vlabs.ac.in/data-structures-2/

Course Title: Software Engineering

Teaching Scheme Evaluation Scheme
Semester III
Theory Practical
Term ODD Th Tu Pr Credits TAE CAE ESE INT EXT
Course
C
Category
3 -- -- 3 10 15 50 - -
Course
UITL301
Code
Teaching
Offline 75 -
Mode
3 Total
Duration of
3 Hrs. 75
ESE

 Understand the phases in a software project

 Understand fundamental concepts of requirements engineering and
Course Analysis Modelling.
Objectives Understand the major considerations for enterprise integration and
deployment.
 Learn various testing and maintenance measures

 CO1:Identify the key activities in managing a software project

 CO2:Compare different process models.

Course  CO3:Implement the Concepts of requirements engineering and Analysis
Outcomes Modeling.
 CO4:Apply systematic procedure for software design and deployment.

 CO5:Compare and contrast the various testing and maintenance

Mapping of Course Outcomes with Program Outcomes and Program Specific

Outcomes:

P a g e | 52
 Curriculum for B.Tech.in Data Science

Course PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO

Outcomes 1 2 3 4 5 6 7 8 9 10 11 12 1 2

CO1 - 2 3 2 - 3 - -
CO2 - 2 3 3 - 3 - -
CO3 - 3 3 2 1 3 3 2
CO4 - 3 3 3 - 3 3 3
CO5 - - 3 1 - 3 - 3

Course Contents:

Unit Contents Hours

SOFTWAREPROCESS
Introduction to Software Engineering, Software Process, Perspective
and Specialized Process Models – Software Project Management:
I 6
Estimation – LOC and FP Based Estimation, COCOMO Model –
Project Scheduling – Scheduling, Earned Value Analysis – Risk
Management.
REQUIREMENTS ANALYSIS AND SPECIFICATION
Software Requirements: Functional and Non-Functional, User
requirements, System requirements, Software Requirements Document
II – Requirement Engineering Process: Feasibility Studies, Requirements 6
elicitation and analysis, requirements validation, requirements
management-Classical analysis: Structured system Analysis, Petri
Nets- Data Dictionary.
SOFTWARE DESIGN
Design process – Design Concepts-Design Model– Design Heuristic –
Architectural Design – Architectural styles, Architectural Design,
III 6
Architectural Mapping using Data Flow- User Interface Design:
Interface analysis, Interface Design –Component level Design:
Designing Class based components, traditional Components.
TESTING AND
Software testing fundamentals-Internal and external views of Testing-
IV 7
white box testing – basis path testing-control structure testing-black box
testing Debugging
PROJECT MANAGEMENT
Estimation – FP Based, LOC Based, Make/Buy Decision, COCOMO II
V 7
– Planning – Project Plan, Planning Process, RFP Risk Management –
Identification, Projection, RMMM – Scheduling and Tracking –

 Roger S. Pressman, “Software Engineering – A Practitioner‟s

1.
Approach”, Seventh Edition, McGraw-Hill International Edition, 2010.
Text
Books Ian Sommerville, “Software Engineering”, 9th Edition, Pearson
2.
Education Asia, 2011.
3. Rajib Mall, “Fundamentals of Software Engineering”, Third Edition, PHI
P a g e | 53
 Curriculum for B.Tech.in Data Science

Learning Private Limited, 2009.

PankajJalote, “Software Engineering, A Precise Approach”, Wiley India,
1.
2010.
Reference Kelkar S.A., “Software Engineering”, Prentice Hall of India Pvt Ltd,
2.
Books 2007.
Stephen R.Schach, “Software Engineering”, Tata McGraw-Hill
3.
Publishing Company Limited, 2007.

Course Title: Data Preprocessing

Evaluation Scheme
Semester III Teaching Scheme
Theory Practical
Term ODD Th Tu Pr Credits TAE CAE ESE INT EXT

Course
C
Category - -- 4 2 - - - 50
Course Code UAIP203

Teaching
Online 50
Mode 4 Total

Duration of 3 Hrs. 50
ESE

To learn the applicability of the techniques in data pre-processing

Course
To understand the necessity of datapre-processing
Objectives
To relate the pre-processing techniques to real-world applications.

CO1: Understand data using Statistical tools and techniques

CO2: Apply appropriate techniques for Data Cleaning

Course
CO3: Apply Feature Scaling , Data Labeling techniques
Outcomes
CO4: Visualize data through graph plots

CO5: Apply the data pre-processing techniques on real world datasets.

Mapping of Course Outcomes with Program Outcomes and Program Specific Outcomes:

Course
P a g e | 54
 Curriculum for B.Tech.in Data Science

Outcomes PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO

1 2 3 4 2
5 6 7 8 9 10 11 12 1

CO1 3 3 3

CO2 3 3

CO3 3 2 3

CO4 3 3

CO5 3 3 3 3 2 3

Course Contents:

Unit Contents Hours

Introduction , Definitions, need of data preprocessing , understanding data

I 4
preprocessing

Step and type of Data preprocessing , missing , noise data, data integration ,
II 4
data transformation

Data Reductions , Dimensionality Reduction,Clustering, data Sampling, Data

III 6
Discretization

Categorical Data, Feature Scaling, Encoding categorical features,

Normalization and its type, Binarization, Data Labeling, Data Feature
IV 8
Selection, Principal Component Analysis (PCA),Correlation Matrix with
Heatmap

*Note- Atleast 2 practicals should be performed over large datasets (big data).

1. Data pre-processing The Ultimate Step-By-Step Guide, GerardusBlokdyk

Text

Books M. Shron, O’Reilly, Thinking with Data: How to Turn Information into
2.
Insights, Publisher: O’Reilly Media, 2014

P a g e | 55
 Curriculum for B.Tech.in Data Science

T. Fawcett andF. Provost , Data Science for Business: What you Need to
3. Know about Data Mining and Data Analytic Thinking, Publisher: O’Reilly
Media, 2013

Ralph Kimball, Margy Ross, The Data Warehouse Toolkit, 3rd edition,
1.
Publisher: Wiley, 2013

J. Han, M. Kamber and J.Pei, Morgan Kaufmann, Data Mining, Concepts and
Reference 2.
Techniques, Publisher: Elsevier, 2006
Books
Ramesh Sharda, DursunDelen,EfraimTurban,Business Intelligence and
3. Analytics: Systemsfor Decision Support, Publisher: Pearson/Prentice Hall,
2014

on line TL http://www.prolearninghub.com/courses/data-warehouse-concepts-design-
1.
Material data-integration/

Sr. No. Name of Experiments

1 Implementation of Basic Python Libraries

2 Find out missing data in dataset

P a g e | 56
 Curriculum for B.Tech.in Data Science

3 Perform the Categorization of dataset

4 Execute feature scaling on given dataset

5 Implement normalization on dataset

6 Perform proper data labeling operation on dataset

7 Implement principal component analysis algorithm

8 Perform Encoding categorical features on given dataset

Open Ended Experiments / New Experiments

1 Apply the appropriate Binarizationmethods on given dataset

2 Perform the Standardizationoperation on dataset

Semester-IV

Course Title: Probability Theory

Teaching Scheme Evaluation Scheme
Semester IV
Theory Practical
Term EVEN Th Tu Pr Credits TAE CAE ESE INT EXT
Course
BS
Category
3 1 -- 4 10 15 50 -- --
Course
UBSL258
Code
Teaching
75 --
Mode
4 Total
Duration of
3 Hrs. 75
ESE

To learn basic of probability and random variables.

Course
To learn about joint and Conditions of Statistical Dependence
Objectives
To understand the random process and Decision Making.
Course CO1: Use statistical methodology and tools in the engineering problem-

P a g e | 57
 Curriculum for B.Tech.in Data Science

Outcomes solving process.

CO2: Analyze the given probabilistic model of the problem.
CO3: Use correlation and regression tests for hypothesis testing.
CO4: Solve problems related to stochastic processes.
CO5: Apply best probability techniques on real life data set

Mapping of Course Outcomes with Program Outcomes and Program Specific

Outcomes:

Course Program Outcomes and Program Specific Outcomes

Outcomes PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO
1 2 3
1 2 3 4 5 6 7 8 9 10 11 12
CO1 3 3 2
CO2 3 3 2
CO3 3 3 2
CO4 3 3 2
C05 3 3 2

Course Contents:

Unit Contents Hours

Probability: Classical, relative frequency and axiomatic definitions of
I probability, addition rule and conditional probability, multiplication rule, 6
total probability, Bayes’ Theorem and independence, problems.
Random variables: Definition and examples, random vectors,
II distribution function, discrete and continuous random variables, pmf 6
and pdf of random variables.
Joint Distributions: Joint, marginal and conditional distributions, product
III moments, correlation and regression, independence of random 6
variables, bivariate normal distribution, problems
Probability : Introductory Ideas Probability: The Study of Odds and
Ends , Basic Terminology in Probability ,Three Types of Probability
IV , Probability Rules ,Probabilities Under Conditions of Statistical 6
Independence ,Probabilities Under Conditions of Statistical
Dependence
Probability Distributions ,What is a Probability Distribution,Random
Variables, Use of Expected Value in Decision Making,The Binomial
V Distribution, The Poisson Distribution, The Normal Distribution: A 4
Distribution of a Continuous Random Variable,Choosing the Correct
Probability Distribution

Hoel, P. G., Port, S. C. and Stone, C. J, Introduction to Probability

1.
Theory,Universal Book Stall, New Delhi, Reprint 2003.
Text Statistics For Management - Richard I. Levin, David S. Rubin, Sanjay
2.
Books Rastogi, Masood Husain Siddiqui.
An Introduction to Probability and Statistics by V.K.
3.
Rohatgi& A.K. Md. E. Saleh.

P a g e | 58
 Curriculum for B.Tech.in Data Science

Course Title: Object Oriented Programming

Teaching Scheme Evaluation Scheme
Semester IV
Theory Practical
Term EVEN Th Tu Pr Credits TAE CAE ESE INT EXT
Course
C
Category
- - 4 2 - - - 25 25
Course
UITP201
Code
Teaching
Online - 50
Mode
4 Total
Duration of
3 Hrs. 50
ESE

This course introduced features of object oriented programming.

Course The course provide carrier opportunities in implementation of various
Objectives applications as object oriented concepts plays dominant role in software
development.
CO1:Articulate the principles of object oriented programming using C++
CO2:Understand function overloading, constructor overloading, operator
overloading, polymorphism & its uses in programming.
Course CO3:Implement inheritance concepts and its use for application
Outcomes development
CO4:Analyze of dynamic memory allocation and its use for software
development
CO5:Implement concept of file handling in real life problems
Mapping of Course Outcomes with Program Outcomes and Program Specific
Outcomes:

Program Outcomes and Program Specific Outcomes

Course
Outcomes PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3

CO1 1 2 2 3 - - - 2
CO2 - 3 3 2 - 1 2 2
CO3 - 3 3 2
CO4 - 3 1 3
CO5 - 3 3 2

Course Contents:

Unit Contents Hours

P a g e | 59
 Curriculum for B.Tech.in Data Science

Principles of Object Oriented Programming -

Introduction to OOPS: Differences between C and C++.A look at
I 8
procedure Oriented programming, object oriented programming
paradigm, basic concepts of OOP, Headers & Name Spaces
Functions & Polymorphism -
Functions, Types of Functions, Constructor, Destructor, Function
II 8
overloading & Ambiguity, Operator Overloading, Function Overriding,
Friend Function
Inheritance & Virtual Functions -
III Inheritance and the access specifies, Types of Inheritance, Pointers 8
and references to derived types, Virtual Functions
Pointers & Dynamic allocations -
IV Static & Dynamic allocation using new and delete,* and ->* operators, 8
Creating conversion functions, this pointer.

Object Oriented Programming in C++ -Robert Lafore, edition, Galgotia

Text 1.
publications
Books
2. The Complete Reference C++, Herbert Schildt, 4th Edition, TMH\
1. Let’s C++ by Y. Kanetkar, BPB publications
Object oriented programming with C++, E Balagurusamy, 4th edition,
Reference 2.
TMH
Books
Object-Oriented Programming with C++, SouravSahay, Oxford
3.
University Press
on line TL
1. https://nptel.ac.in/courses/106/105/106105151/
Material

Course Title: Formal Language And Automata

Teaching Scheme Evaluation Scheme
Semester IV
Theory Practical
Term EVEN Th Tu Pr Credits TAE CAE ESE INT EXT
Course
C
Category
3 -- -- 3 10 15 50 -- --
Course
UCSL203
Code
Teaching
Offline 75 --
Mode
3 Total
Duration of
3 Hrs. 75
ESE

To provide introduction to some of the central ideas of theoretical

computer science from the perspective of formal languages.
Course To introduce the fundamental concepts of formal languages, grammars
Objectives and automata theory.
Classify machines by their power to recognize languages.
P a g e | 60
 Curriculum for B.Tech.in Data Science

Employ finite state machines to solve problems in computing.

To understand deterministic and non-deterministic machines.
To understand the differences between decidability and un-decidability.
CO1:Able to understand the concept of abstract machines and their power
to recognize the languages.
CO2:Able to employ finite state machines for modeling and solving
Course computing problems.
Outcomes CO2:Able to design context free grammars for formal languages.
CO3:Able to distinguish between decidability and un-decidability.
CO4:Able to gain proficiency with mathematical tools and formal methods.

Mapping of Course Outcomes with Program Outcomes and Program Specific

Outcomes:

Course Program Outcomes and Program Specific Outcomes

Outcomes PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO
1 2 3
1 2 3 4 5 6 7 8 9 10 11 12
CO1 3 2
CO2 3 2
CO3 3 2
CO4 3 2
CO5 3 2

Course Contents:

Unit Contents Hours

Introduction- Basic Mathematical Notation and techniques- Finite State
systems – Basic Definitions – Finite Automaton – DFA & NDFA – Finite
I Automaton with €- moves – Regular Languages- Regular Expression – 8
Equivalence of NFA and DFA – Equivalence of NDFA‟s with and
without €-moves – Equivalence of finite Automaton.
Regular Expressions, Finite Automata and Regular Expressions,
Applications of Regular Expressions, Algebraic Laws for Regular
Expressions, Properties of Regular Languages Pumping Lemma for
II 8
Regular Languages, Applications of the Pumping Lemma,
Closure Properties of Regular Languages, Decision Properties of
Regular Languages.
Context-Free Grammars: Chomsky hierarchy of languages.Definition of
Context-Free Grammars, Derivations Using a Grammar, Leftmost and
Rightmost Derivations, the Language of a Grammar, Sentential Forms,
III 8
Parse Tress, Applications of Context-Free Grammars, Ambiguity in
Grammars and Languages. Push Down Automata,: Definition of the
Pushdown Automaton, the Languages of a PDA, Equivalence of PDA’s
P a g e | 61
 Curriculum for B.Tech.in Data Science

and CFG’s, Deterministic Pushdown Automata.

Definitions of Turing machines – Models – Computable languages and

functions –Techniques for Turing machine construction – Multi head
IV 8
and Multi tape Turing Machines – The Halting problem – Partial
Solvability – Problems about Turing machine
Un-decidability: A Language that is Not Recursively Enumerable, An
Undecidable Problem
V That is RE, Undecidable Problems about Turing Machines, Post’s 8
Correspondence Problem, Other Undecidable Problems, Intractable
Problems: The Classes P and NP, An NP-Complete Problem.

 Introduction to Automata Theory, Languages, and Computation,

1. 3nd Edition, John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman,
Text
Pearson Education.
Books
 Introduction to the Theory of Computation, Michael Sipser, 3rd
2.
edition, Cengage Learning.
1.
E--Books
2.
 Introduction to Languages and The Theory of Computation, John
1.
C Martin, TMH.

2. Introduction to Computer Theory, Daniel I.A. Cohen, John Wiley.
 A Text book on Automata Theory, P. K. Srimani, Nasir S. F. B,
Reference 3.
Cambridge University Press.
Books
 Introduction to Formal languages Automata Theory and
4.
Computation Kamala Krithivasan, Rama R, Pearson.
 Theory of Computer Science – Automata languages and
5.
computation, Mishra and Chandrashekaran, 2nd edition, PHI.

Course Title: Computer Network

Teaching Scheme Evaluation Scheme
Semester 4
Theory Practical
Term EVEN Th Tu Pr Credits TAE CAE ESE INT EXT
Course
C
Category
3 -- - 3 10 15 50 -- --
Course
UITL202
Code
Teaching
Offline 75 --
Mode
3 Total
Duration of
3 Hrs. 75
ESE

To understand the computer network architectures.

Course
To make aware of design and performance perspective of network
Objectives
architectures.
P a g e | 62
 Curriculum for B.Tech.in Data Science

To discuss current trends in communication

Up on successful completion of this course, student will be able to:
CO1:Analyze the need for OSI reference model in computer networking
CO2:Studying the various transmission medium used in physical layer
Course CO3:Analyzing different Elementary protocols for communication and
Outcomes Identify IEEE standards employed in computer networking
CO4:Solve and apply various Routing Algorithm and Protocols
CO5:Use techniques involved in developing transport and application
layer of computer networking.

Mapping of Course Outcomes with Program Outcomes and Program Specific

Outcomes:

Program Outcomes and Program Specific Outcomes

Course
PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO
Outcomes 1 2 3
1 2 3 4 5 6 7 8 9 10 11 12
CO1 3 2 3
CO2 3 3
CO3 3 3 2
CO4 3 2 3
CO5 3 3 2

Course Contents:
Unit Contents Hours
Unit-I:Introduction
The use of computer networks. Network hardware. LAN’s, Man’s,
WAN’s, internet works, Network software, protocol hierarchies, design
I issues for layers, interfaces and services, Connectionless oriented and 8
connectionless services, service primitives, relationship of
Services to protocols, the OSI reference model, TCP/IP reference
model, comparison of OSI And TCP/IP reference model.
Unit-lI: Physical Layer
The theoretical basis for data communication-Fourier analysis,
bandwidth-limited signals, Maximum data rate of a channel,
transmission media-magnetic media, and twisted pair coaxial Cable,
II fiber optics. Wireless transmission, microwave transmission. 8
Multiplexing, switching, Narrow and ISDN - services, architecture,
interface, perspective on N-ISDN, broadband ISDN & ATM-virtual
circuits versus circuit switching, transmission in ATM networks, ATM
Switches.
Unit-Ill: Data Link Layer
Design issues - services provided to the network Layer, framing, error
control, flow control, Error correcting & detecting codes, elementary
data link protocols, simplex stop and wait Simplex protocols for noisy
III channel, sliding window protocols-one bit protocol, go back Protocol, 8
selective repeat protocol. The medium access sub layer - static and
dynamic channel Allocation in LANs and MANs, Multiple access
protocols - ALOHA. CSMA, collision free Protocols, limited contention
protocols, IEEE 802.11 wireless LAN protocols, IEEE Standards 802
P a g e | 63
 Curriculum for B.Tech.in Data Science

for LAN and MANs-802.3 & Ethernet, token bus. Token ring,

Unit-IV: The Network Layer

Design issues, services provided to the transport layer, internal
organization, comparison of Virtual circuit and datagram subnets,
routing algorithms. Optimality principle, shortest path Routing, flooding,
flow-based routing, distance vector routing, link state routing,
IV 8
hierarchical Routing, broadcast &multicast routing, congestion control
algorithms, general principles Prevention policies, traffic shaping. flow
specifications, congestion control in virtual circuit Subnets. choke
packets, load shedding, jitter control. IP protocol, IP address. Subnets,
internet Control protocols, OSPF. BGP.
Unit V: Transport and Application Layer
Transport and Application Layer - services provided to the upper layer,
V Quality of Service, Transport service primitives, elements of transport 8
protocols, addressing, establishing a Connection, releasing a
connection, flow control & buffering, multiplexing, crash recovery,

1. Computer Networks, Andrew S. Tanenbaum, David J. Wetherall, Fifth

Edition, Pearson
Text 2. Data Communication And Networking, Behrouz A. Forouzam, Fourth
Books Edition, McGraw Hill
An Engineering Approach to Computer Networks-S.Keshav, 2nd
3.
Edition, Pearson Education
1. Fayez Gebali, Analysis of Computer and Communication Networks,
First Edition, Springer
An Introduction to Computer Networks,Peter L Dordal,Department of
E--Books
2. Computer Science, Loyola University
Chicago(http://intronetworks.cs.luc.edu/current/ComputerNetworks.pdf)
3. TCP/IP Network Administration, Craig Hunt
1. Jean Walrand , PravinVaraiya, High-Performance Communication
Networks (The Morgan Kaufmann Series in Networking), Second
Edition, Morgan Kaufmann Publishers
Reference
2. V. S. Bagad, I. A. Dhotre, Computer Communication Networks, Third
Books
Edition, Technical Publications, Illustrated
3. Norman Abramson, Franklin F. Kuo, Computer-communication
networks, Fourth Edition, Prentice-Hall, 1973, Illustrated
1. Coursera – “Data communication Network Services” by Cisco
on line TL
2. NPTEL – “Data Communication” by IIT Kharagpur
Material
3. Swayam – “Computer Networks” by Anand More,

Course Title: Machine Learning Algorithms

Teaching Scheme Evaluation Scheme
Semester IV
Theory Practical

P a g e | 64
 Curriculum for B.Tech.in Data Science

Term EVEN Th Tu Pr Credits TAE CAE ESE INT EXT

Course
C
Category
3 - 2 4 10 15 50 25 -
Course UAIL301
Code UAIP301
Teaching
75 25
Mode
5 Total
Duration of
3 hrs 100
ESE

1. The objectives of the course is to introduce students to the basic

machine learning algorithms.
Course
2. To develop skills of using recent machine learning software for
Objectives
solving practical problems.
3. To gain experience of doing independent study and research.
1. Recognize the characteristics of machine learning that make it
useful to real-world problems.
2. Characterize machine learning algorithms as supervised, semi-
Course supervised, and unsupervised.
Outcomes 3. Design and implement machine learning solutions to classification,
regression, and clustering problems;.
4. Be able to evaluate and interpret the results of the algorithms
5. Effectively use machine learning toolboxes.

Mapping of Course Outcomes with Program Outcomes and Program Specific

Outcomes:

Course Program Outcomes and Program Specific Outcomes

Outcomes PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO
1 2 3
1 2 3 4 5 6 7 8 9 10 11 12
CO1 3 3 3 2 2
CO2 3 2 1
CO3 3 3 3 2 1
CO4 3 3 2 2
CO5 3 2 2

Course Contents:

Unit Contents Hours

P a g e | 65
 Curriculum for B.Tech.in Data Science

Introduction: Basic definitions, types of learning, hypothesis space and

I 4
inductive bias, evaluation, cross-validation
Linear regression, Decision trees, over fitting, Instance based learning,
II 6
Feature reduction, Collaborative filtering based recommendation
Probability and Bayes learning,Logistic Regression, Support Vector
III 8
Machine, Kernel function and Kernel SVM
Neural network: Perceptron, multilayer network, backpropagation,
IV 8
introduction to deep neural network
Computational learning theory, PAC learning model, Sample
V 6
complexity, VC Dimension, Ensemble learning
Clustering: k-means, adaptive hierarchical clustering, Gaussian mixture
VI model 4

1. Mitchell Tom, Machine Learning. McGraw Hill, 1997.

Text Introduction to machine learning, EthemAlpaydin. —2nd ed., The MIT

2.
Books Press, Cambridge, Massachusetts, London, England.
3. Chris Bishop, Pattern Recognition and Machine Learning
Dr. NileshShelke, Dr. GopalSakarkar, Dr N V Choudhari, Introduction to
4
Machine Learning, GanuPrakashan
Trevor Hastie, Robert Tibshirani, Jerome Friedman, The Elements of
1.
Statistical Learning Data Mining,Inference,and Prediction
Reference Richard O. Duda, Peter E. Hart, David G. Stork. Pattern classification,
2.
Books Wiley, New York, 2001.
Machine Learning: The Art and Science of Algorithms that Make Sense
3.
of Data (1st Edition) – Peter Falch
1 https://www.coursera.org/learn/machine-learning
On line TL
2 https://www.udemy.com/course/machinelearning/
Material
3 https://nptel.ac.in/courses/106/105/106105152/

Course Title: Data Analysis Using R

Teaching Scheme Evaluation Scheme
Semester IV
Theory Practical
Term EVEN Th Tu Pr Credits TAE CAE ESE INT EXT
Course
C
Category
-- -- 4 2 -- -- -- 25 --
Course
UITP203
Code
Teaching
-- 25
Mode
4 Total
Duration of
3 hrs. 25
ESE

Course  To understand the basics of data, Big data and Data Science.
P a g e | 66
 Curriculum for B.Tech.in Data Science

Objectives To understand the financial value of big data analytics and usage of data
in solving real time problem.
 To explore fundamental concepts of big data analytics and data
visualization.
To explore tools and practices for working with R
Up on successful completion of this course, student will be able to:
CO1:Apply the concepts of big data analytics for a domain.
Course CO2: Understand and apply the data analytics technique for visualization
Outcomes CO3:Understand pull data from different sources (small dataset and large
datasets),clean and manipulate data
CO4:Analyze and design data analytics Framework.
CO5:Use rich visualization libraries to deliver your findings as reports

Mapping of Course Outcomes with Program Outcomes and Program Specific

Outcomes:

Program Outcomes and Program Specific Outcomes

Course
Outcomes P P
PO PO PO PO PO PO PO PO PO PO PSO PSO PSO
O O
3 4 5 6 7 8 9 10 11 12 1 2 3
1 2
CO1 - 3 3 - 3 - - - - - - - - - -
CO2 - 3 3 - 3 - - - - - - - - - 2
CO3 - 3 3 2 3 - - - - - - - 3 2 3
CO4 - 3 3 - 3 - - - - - - - 3 3 3
CO5 - 3 3 1 3 - - - - - - - - 3 -

Course Contents:

Unit Contents Hours

Introduction to big data analytics: big data overview, data pre-
processing, concepts of supervised and unsupervised learning. Basic
I 7Hrs
statistics: mean, median, standard deviation, variance, correlation,
covariance.
Linear regression: simple linear regression, introduction to multiple
II 7Hrs
linear regressions.
III Classification: logistic regression, decision trees, SVM. 7Hrs
Ensemble methods: bagging, random forests, boosting.Clustering: K-
IV 7Hrs
means, K-methods, Hierarchical clustering, X-means
Evaluation and validation: cross-validation, assessing the statistical
significance of data mining results.Selection of advanced topics such
V 7Hrs
as: scalable machine learning, big data related techniques, mining
stream data, social networks. Tools: R.
P a g e | 67
 Curriculum for B.Tech.in Data Science

1. Hands-on Programming with R, Garrett Grolemund.

Text 2. R for Everyone: Advanced Analytics and Graphics, Jared Lander
Books
Data Analytics: The Complete Beginner's Guide: the Black Book,Byron
3.
Francis, CreateSpace Independent Publishing Platform, 2016
1. R in Nutshell, Joseph Adler, O’Reilly Publications
Introduction to Statistical learning with R, Gareth James, Daniela
E--Books 2.
Written, Trevor Hastie, Robert Tibshivani, Springer Publications
3. Data Analytics for Beginner: Paul Kinley
1. Applied predictive modeling by Max Kuhn and Kejell Johnson
Reference
2. Introduction to statistical learning by Trevor Hastie
Books
3. Data Manipulation with R, Springer Publications
1. NPTEL Course: https://nptel.ac.in/courses/110/106/110106072/
On line TL
Material 2. Coursera Course: https://www.coursera.org/specializations/statistics
3. Swayam Course: https://swayam.gov.in/nd1_noc20_ma53/preview

P a g e | 68
 Curriculum for B.Tech.in Data Science

Course Title: Data Warehousing & ETL

Teaching Scheme Evaluation Scheme
Semester IV
Theory Practical
Term IV Th Tu Pr Credits TAE CAE ESE INT EXT
Course
E
Category
3 Hrs - - 3 10 15 50 - --
Course
UAIL203
Code
Teaching
Online 75 --
Mode
3 Hrs Total
Duration
2 Hrs. 75
of ESE

1.To understand the various concepts needed to design, develop, and maintain a data
Course warehouse.
Objectives 2.To provides an introduction to end user access tools like OLAP and reporting.
3.To expose students to the research issues in Data Warehousing.
CO1: Understand the need, definition, applications, components, processes &
Architecture of a Data Warehouse.
CO2:Learn business requirements, dimensional modeling for designing database
schemas for a Data Warehouse.
Course CO3: Make use of advanced Dimensional Modeling concepts, role of Data Marts &
Outcomes ODS in Data Warehousing.
CO4:Analyze the ETL Process, OLAP, Metadata, Multidimensional Databases in
Data Warehousing.
CO5:Implement various techniques used to reduce the query response time for Real
Time Data Warehousing.

Mapping of Course Outcomes with Program Outcomes and Program Specific Outcomes:

Course Program Outcomes and Program Specific Outcomes

Outcomes
PO1 PO1
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PSO 1 PSO 2 PSO3
1 2
CO1
-- 2 3 3 -- -- -- -- -- -- -- -- -- -- --
CO2 -- -- 3 3 -- -- -- -- -- -- -- -- 3 3
CO3 -- -- -- 3 3 -- -- -- -- -- -- -- -- 3 --
CO4 -- -- -- 3 3 -- -- -- -- -- -- -- -- -- --
CO5 -- -- -- 3 3 -- -- -- -- -- -- -- -- -- --

Course Contents:

Unit Contents Hours

Introduction to Data Warehousing, Applications of Data Warehouse, Data
I 7
Warehouse Components & Processes.
P a g e | 69
 Curriculum for B.Tech.in Data Science

Data Warehouse Architecture, Collecting Business Requirements Data

II 8
Warehouse Data Design, Data Marts & Operational Data Store (ODS).
Advanced Dimensional Modeling, Extraction, Data Extraction, Data
III Transformation, Data Loading, ETL Data Structures, ETL 7
Tools(Spark,Scala).,Data Pipelines..
Online Analytical Processing (OLAP), ROLAP, MOLAP, HOLAP, &
IV DOLAP, OLAP Implementation, OLAP Tools, Multidimensional Databases 8
(MDDBs), SQL Features for DW.
Cube Computation, Optimization Techniques (ROLAP & MOLAP),
V Performance Enhancing Techniques, Metadata, Real-Time Data Warehousing, 8
Data Warehousing Research Trends.

PonniahPaulraj, “Data Warehousing Fundamentals for IT Professionals”, WSE,

1.
2ed., 2010.
Text
Books 2. Kimball Ralph & M Ross, “The Data Warehouse Toolkit”, WSE, 2ed., 2002.
Anahory S, & Dennis M, “Data Warehousing in the Real World”, Addison-
3.
Wesley, 2000.
https://cdn.ttgtmedia.com/searchDataManagement/downloads/Data_Warehouse
1.
_Design.pdf
E--Books
https://aatinegar.com/wp-content/uploads/2016/05/Kimball_The-Data-
2.
Warehouse-Toolkit-3rd-Edition.pdf
https://aatinegar.com/wp-content/uploads/2016/05/Kimball_The-Data-
1.
Warehouse-Toolkit-3rd-Edition.pdf
Reference Adamson C, & Venerable M, “Data Warehouse Design Solutions”, John Wiley,
2.
Books 1998.
3. Inmon, WH, “Building the Data Warehouse”, John Wiley, 2002.
https://www.coursera.org/learn/business-intelligence-data-
1.
On line TL warehousing#syllabus
Material 2. https://freevideolectures.com/course/2668/database-management-system/32
3. https://www.edureka.co/data-warehousing-and-etl-certification-courses

P a g e | 70
 Curriculum for B.Tech.in Data Science

Course Title: Optimization Technique

Teaching Scheme Evaluation Scheme
Semester VI
Theory Practical
Term EVEN Th Tu Pr Credits TAE CAE ESE INT EXT
Course
Category 3Hr - - 10 15 25 NA NA
3
Course Code UDIL215
Teaching Offline 50 _
Mode
3Hrs Total
Duration of
3 Hrs. 50
ESE

To introduce the basic methods of optimization in engineering.

Course
Objectives To develop analytical skills to provide solution to simple transportation problems
in the field of engineering.

Upon successful completion of this course, student will be able to:

CO1: understand basic concepts of Optimization Techniques in real life.

Course CO2: Use algorithms of linear programming problem.

Outcomes
CO3: Use the knowledge of duality to solve optimization problems.

CO4 : Analyze game theory models.

CO5: Apply the various techniques to solve Transportation problems.

Mapping of Course Outcomes with Program Outcomes:

Course Program Outcomes & PSO
Outcom
es PO PO PO PO PO PO PO PO PO PO PO PO PS PS
O O
1 2 3 4 5 6 7 8 9 10 11 12
1 2

CO1 3 3 2 1 3 3

CO2 3 3 2 1 3 3 2

CO3 3 3 2 1 3 2

CO4 3 3 2 1 3 3 2

CO5 3 3 2 1 3 2

P a g e | 71
 Curriculum for B.Tech.in Data Science

Course Contents:

Unit Contents Hours

Introduction to Optimization Techniques: 8hrs

I Linear programming, Mathematical model formulation, Solutions by
Graphical method,
II Linear Programming Problems: Simplex method, Big M method, Two 8hrs
phase method.
III Dual problem: Duality theory, Dual simplex method, revised simplex 8hrs
method.
Game Theory: Two person zero sum game, Maximum-min max principle, 8hrs
IV
Saddle point, genetic algorithms and concepts of operational research

Transportation problem: General transportation problem Basic feasible 8hrs

V solution, optimization of transportation problems by NW corner method,
least cost method, Vogel’s approximation method, test for optimality.

Higher engineering Mathematics by B S Grewal, 43rd edition, Khanna

1.
Publication.

2. Linear Programming: methods and application by Saul I Gass.

Text
3. Linear Programming: theory and application by Catherine Lewis.
Books
Operation Research By KantiSwarup, PK Gupta, Man Mohan, Sultan
4
Chand,2010, Forty Third

5 Operation Research By H.S. Anitha, Excel Books,2012

Reference Introduction to Optimization (Operation Research) by J.C. Pant, 7 th Edition,

1.
Book 2008.

P a g e | 72
 Curriculum for B.Tech.in Data Science

Course Title: Computer Architecture and Organization

Teaching Scheme Evaluation Scheme

Semester IV
Theory Practical

Term ODD Th Tu Pr Credits TAE CAE ESE INT EXT

Course Category C7
3
NA NA 3 10 15 50 NA NA
Course Code UCSL202 Hrs.

Teaching Mode Offline 75 -

3 Hrs Total
Duration of ESE 2 Hrs. 75

To understand the design principles of digital computing systems

To provide essential understanding of different subsystems of modern computer
Course
system and design aspects these subsystems3
Objectives
To provide overview on performance enhancement methods in instruction
execution
Upon successful completion of this course, student will be able to:
CO1: To describe the basic components and design of a computer system
CO2: To examine the issues involved in the instruction execution and various
Course
stages of instruction life stage
Outcomes
CO3: To apply the concept of various memories and interfacing technologies
CO4: To analyze the different parallel processing technique
CO5: To design different high performance computing architecture

Mapping of Course Outcomes with Program Outcomes and Program Specific Outcomes:

Course Program Outcomes and Program Specific Outcomes

Outco PO PO PO PO PO PO PO PO PO PO PO PO PSO 1 PSO 2
mes 1 2 3 4 5 6 7 8 9 10 11 12

CO1 1 -- -- -- -- -- -- -- -- -- -- -- 3 --

CO2 -- 2 -- -- -- -- -- -- -- -- -- -- 2 --
CO3 -- 3 -- -- -- -- -- -- -- -- -- -- 2 --
CO4 -- -- 3 -- -- -- -- -- -- -- -- -- 3 --
CO5 -- -- 3 -- -- -- -- -- -- -- -- -- -- 3

Course Contents:
Unit Contents Hours
Basic functional blocks of a computer: CPU, memory, input-output
I 8
subsystems, control unit. Instruction set architecture of a CPU –registers,
P a g e | 73
 Curriculum for B.Tech.in Data Science

instruction execution cycle, RTL interpretation of instructions, addressing

modes, instruction set, Instruction set architecture CISC, RISC, Case study –
instruction sets of common CPUs
Fixed point Addition, Subtraction, Multiplication and Division. Floating
Point arithmetic, High performance arithmetic, Booth’s algorithm, integer
division
II 8
Data representation method
Booths multiplication, division algorithm and example
IEEE standard single and double precision format and examples
Memory hierarchy, Memory Chip Organization, Cache memory, Virtual
memory. Parallel Bus Architectures, Internal Communication Methodologies,
III 8
Serial Bus Architectures, Mass storage, Input and Output Devices,
Segmentation, TLB, Page replacement algorithms
Pipelining: Basic concepts of pipelining, Arithmetic and Instruction Pipeline,
throughput and speedup, pipeline hazards, Introduction, Logic Design
Conventions, Building a Datapath – A Simple Implementation scheme – An
IV 8
Overview of Pipelining – Pipelined Datapath and Control. Data Hazards:
Forwarding versus Stalling, Control Hazards, Exceptions, Parallelism via
Instructions.
CPU control unit design: hardwired and micro-programmed design
V approaches, Case study - design of a simple hypothetical CPU. 8
Multicore processors architecture , Advanced topics & its Application.

1. Computer Organization and Architecture by Carl Hamacher 4th Edition

Advance computer Architecture by Kai Hwang under Tata McGraw Hill
Text 2.
publications
Books
Introduction to Parallel Processing: Algorithms & Architectures,
3.
BehroozParhami in Springer Shop
Computer Architecture and Organization by William Stalling
EBooks 1. http://home.ustc.edu.cn/~leedsong/reference_books_tools/Computer%20Orga
nization%20and%20Architecture%2010th%20-%20William%20Stallings.pdf
Introduction to Parallel Processing by P. Ravi Prakash, M. Sasikumar, Dinesh
1.
Shikhare By PHI Publications
Fundamentals of Parallel Processing by Jordan Harry, Alaghband Gita, PHI
Reference 2.
Publication
Books
Parallel Computers – Architecture and Programming by V. Rajaraman And C.
3
Siva Ram Murthy.
4. Introduction to Parallel Programming by Steven Brawer
on line TL
1. NPTL https://nptel.ac.in/courses/106/105/106105163/
Material

P a g e | 74
 Curriculum for B.Tech.in Data Science

Course Title: User Interface Design and User Experience

Teaching Scheme Evaluation Scheme

Semester IV
Theory Practical

Term ODD Th Tu Pr Credits TAE CAE ESE INT EXT

Course
EL1
Category
3 Hrs. NA NA 3 10 15 50 NA NA
UCSL
Course Code
324

Teaching
Online 75 --
Mode
3 Hrs Total
Duration of
2 Hrs. 75
ESE

To analyze and prepare design ideas in a constructive manner.

To analyze an interaction design problem and propose a user-centered process,

Course
justifying the process and identifying the trade-offs.
Objectives
To create a high quality, professional documentation and artifacts relating to the
design process for preparation for a professional portfolio.

Up on successful completion of this course, student will be able to:

CO1: Describe the Characteristics of User Interface design and its Principles

CO2: Discuss the issues and challenges for achieving a user-centered design
process, especially with regard to prototyping and evaluation techniques.

CO3: Use, adapt and extend design standards, design components, guidelines, and
patterns focusing on user experience.

CO4: Identify best practices of web color management, principles of designing

APP, and web usability in designing responsive web pages.

CO5: Create storyboards, video scenarios, and experience prototypes for a small
system and plan and perform a real world deployment study of a user
experience.

Mapping of Course Outcomes with Program Outcomes and Program Specific Outcomes:
P a g e | 75
 Curriculum for B.Tech.in Data Science

Course Program Outcomes and Program Specific Outcomes

Outcomes
PO PO PO PO PO PO PO PO PO PO PO PO PSO PS
9 10 11 12 1 O2
1 2 3 4 5 6 7 8

CO1 3 -- -- -- -- -- -- -- 1 -- -- 1 2 1

CO2 -- 3 -- -- -- -- -- -- 1 -- -- 2 2 1

CO3 -- -- 3 -- -- -- -- -- 2 -- -- 2 3 2

CO4 -- -- 3 -- -- -- -- -- 2 -- -- 2 3 3

CO5 -- -- -- -- 3 -- -- -- 3 -- -- 3 2 3

Course Contents:
Unit Contents Hours

Introduction: - Introduction to User Interface Design (UI), Brief History of UI

Design. Human Computer Interface, Characteristics of Graphics Interface,
I 6
Direct Manipulation Graphical System, Web User Interface: Popularity,
Characteristic & Principles.

User Design Process: - Introduction to design process, User centered design

process, Usability Engineering and Task centered Approaches. Introduction to
II Design centered Approaches, Design Centered Methods. Prototyping in 6
practice- Design rationale and Evaluation techniques, Model View Controller
Framework(MVC).

User Experience design component in Interface Design, Visual

Communication design component in Interface Design. System menus and
navigation schemes, Structures of menus, Functions and contents of menus,
Formatting, Phrasing, Navigating, Selecting menu choices, and kinds of
III 8
graphical menus. Windows: Characteristics components presentation styles
Type’s Management’s organizations operations. Web systems device based
controls, characteristics Screen -based controls, operate control - text boxes-
selection control combination control-custom and control-presentation control.

Web Design, Design techniques such as scenarios, personas, storyboards, wire

framing, and information architecture. App Design and its principles.
IV Prototyping tools, both low-fidelity and high-fidelity. Design for small screens, 7
responsive design. Non-GUI design (e.g., auditory interfaces, gesture
interfaces). Understanding the Designing language of Desktop, Web and
Mobile. Flow & Layout & Organizational structures. Swing Programming

P a g e | 76
 Curriculum for B.Tech.in Data Science

Intro & Widgets. UI Widgets & Input Devices.

Case Studies and Best Practices based on advance and recent technology for
V 3
designing UI/UX.

Wilbent. O. Galitz ,“The Essential Guide to User Interface Design”, John

Text 1.
Wiley& Sons, 2001.
Books
2. Ben Sheiderman, “Design The User Interface”, Pearson Education, 1998.

https://www.uxpin.com/studio/ebooks/ux-design-definitive-beginner-guide-
1.
E--Books signup/

2. https://www.userfocus.co.uk/fable/index.html

Greenberg, S., Carpendale, S., Marquart, N., and Buxton, B. (2011) Sketching
1.
User Experiences: The Workbook. San Francisco: Morgan

Reference Alan Cooper, “The Essential Of User Interface Design”, Wiley – Dream Tech
2.
Books Ltd.,2002.

Buxton, B. (2007) Sketching User Experiences. Sketching User Experiences.

3.
San Francisco: Morgan Kaufmann. (Amazon)

Introduction to UI Design
1.
on line TL https://www.coursera.org/learn/ui-design?
Material 2. Introduction to User Experience Design

https://www.coursera.org/learn/user-experience-design

P a g e | 77
 Curriculum for B.Tech.in Data Science

Course Title: DIGITAL IMAGE PROCESSING

Teaching Scheme Evaluation Scheme

Semester VI
Theory Practical
Term EVEN Th Tu Pr Credits TAE CAE ESE INT EXT
Course
EL2
Category
3
DIGITAL
Hrs NA NA 3 10 15 50 NA NA
Course IMAGE
Code PROCESS
ING
Teaching
Offline 75 --
Mode
3 Hrs Total
Duration of
2 Hrs 75
ESE

Understand fundamentals and applications of Digital image processing

Course
Understand Digital image processing techniques
Objectives
Understand applying Image Processing algorithms to real problems
Upon successful completion of this course, student will be able to:

CO1: Interpret the need for image transforms and their properties
CO2: Apply Image enhancement & restoration techniques to digital image
processing
Course
CO3: Apply Image segmentation techniques to digital image processing
Outcomes
application
CO4: Develop algorithm for image compression and coding for real-time image
transmission
CO5: Make use of techniques, skills and modern engineering tools necessary for
engineering application to real time applications

Mapping of Course Outcomes with Program Outcomes and Program Specific Outcomes:

Course Program Outcomes and Program Specific Outcomes

Outcomes
P P PO PO PO PO PO PO PO PO PO PO PSO PSO 2
O O 3 4 5 6 7 8 9 10 11 12 1
1 2
CO1 3 3 3 2 2 -- -- -- -- -- 1 1 3 1
CO2 3 3 3 2 2 -- -- -- -- -- 1 1 3 1
CO3 3 3 3 2 2 -- -- -- -- -- 1 1 3 1
CO4 3 3 3 2 2 -- -- -- -- -- 1 1 3 1
CO5 3 3 3 2 2 -- -- -- -- -- 1 1 3 1

Course Contents:

Unit Contents Hours

P a g e | 78
 Curriculum for B.Tech.in Data Science

INTRODUCTION: Digital image representation, Fundamental steps in image

processing, Components of Digital Image processing systems, Elements of
I visual perception, Image Formation model, Image Sampling and quantization, 9
Relationship between pixels – neighbourhood, adjacency connectivity, regions,
boundaries and distance measures, Color Image Processing.
IMAGE ENHANCEMENT: Enhancement by point processing, Sample
intensity transformation, Histogram processing, Image subtraction, Image
II averaging, Spatial filtering- Smoothing Spatial filters, Sharpening Spatial 9
filters, Frequency domain- Fourier Transform, Low-Pass, High-Pass,
Laplacian, Homomorphic filtering.
IMAGE SEGMENTATION: Detection of discontinuities - point, line and
edge detection, Edge linking and boundary detection, Thresholding, Region-
based segmentation - region growing, region splitting and merging, Use of
III 9
motion in segmentation- Spatial techniques and Frequency domain techniques,
Color Transformations, Smoothing and sharpening, Image Segmentation based
on color.
IMAGE COMPRESSION: Coding redundancy, Interpixel redundancy,
fidelity criteria, Image compression models, Error-free compression, Variable
IV length coding, Bit-plane coding, Lossless predictive coding, Lossy 9
compression, Image compression standards, Real-Time image transmission,
JPEG and MPEG, CODEC.
WAVELET TRANSFORM: Continuous Wavelet transform(CWT), Discrete
Wavelet transform(DWT), Multi-resolution Analysis, Sub-band coding,
V Scaling and wavelet functions, Implementation of 1D and 2D DWT, 9
application to real problems, Application of DIP using AI & CNN , Advance
topics based on the course

Digital Image Processing, Gonzalez, Rafael C. and Richard E. Woods, (4th

Text 1.
Edition, 1992), Pearson Education, London
Books
2. Multirate Systems and Filter-banks, P. P. Vaidyanathan, Prentice Hall, 1992.
E--Books 1. kupdf.net_fundamentals-of-digital-image-processing-anil-k-jainpdf
Digital Image Processing Using MATLAB, Rafael C. Gonzalez, Richard E.
1.
Woods, Steven L. , Tata McGraw Hill Pvt. Ltd., 3 rd Edition , 2011
Fundamental of Digital Image Processing, Anil K Jain, Prentice-Hall, Engle-
2.
Reference wood Cliffs, NJ, 1989
Books Wavelet and Subband Coding, M. Vetterli and J. Kovacevic, Prentice Hall,
3.
1995.
A wavelet Tour of Signal Processing, Stephane Mallat, 3 rd Academic Press,
4.
Dec. 2008
on line TL
1. http://www.vssut.ac.in/lecture_notes/lecture1423722885.pdf
Material

Sr. No. Name of Experiments / Mini Projects/ Case Studies

1 Histogram display and histogram equalization
2 Kernel processing on images leading to image enhancement
3 Display of 2D filters frequency responses and processing the images using these
P a g e | 79
 Curriculum for B.Tech.in Data Science

filters
4 Implementation of Arithmetic Coding for images
5 Basic JPEG algorithm implementation
6 DPCM encoding and decoding of images
7 Simple image watermarking algorithms using LSB substitution
8 Simple content based image retrieval using various distance metrics
Open Ended Experiments / New Experiments
1 Image segmentation algorithms using Snakes
2 Color images manipulations, reading and writing of color images
3 Color image enhancements
4 Color image histogram manipulation
5 LOG Masks implementation for gray and color images
6 Special effects implementation on grey and color images
7 Simple video reading and writing .avi formats and manipulation of video frames

P a g e | 80
 Curriculum for B.Tech.in Data Science

Semester-V

Course Title: Cloud Computing

Teaching Scheme Evaluation Scheme
Semester V
Theory Practical
Term ODD Th Tu Pr Credits TAE CAE ESE INT EXT
Course
C
Category
- - 4 2 -- -- -- 25 25
Course
UCSP303
Code
Teaching
Online -- 25
Mode
4 Total
Duration of
3 Hrs. 25
ESE

Understand the new technologies for resources sharing

Explain classification of Cloud deployment
Course Discuss capacity planning for cloud configuration
Objectives Understand Cloud service model
Cloud Security and privacy issue
Cloud business model for cost effectiveness
CO1: State the basics of distributed computing and cloud computing.
CO2: Summarize the technical capabilities and business benefits cloud
Course technology.
Outcomes CO3: Develop cloud-based application demonstrating its implications
CO4: Develop cost effective solution using cloud technology
CO5 : Develop solution for Society with minimized resources

Mapping of Course Outcomes with Program Outcomes and Program Specific

Outcomes:

Course Program Outcomes and Program Specific Outcomes

Outcomes PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO
1 2 3
1 2 3 4 5 6 7 8 9 10 11 12
CO1 3 3 -
CO2 3 3 2 2
CO3 3 3 3 2
CO4 3 3 3 2
CO5 2 3 3 2

P a g e | 81
 Curriculum for B.Tech.in Data Science

Course Contents:

Unit Contents Hours

Introduction to Cloud Computing
Virtualization Concepts, Cloud Computing Fundamental: Overview of
Computing Paradigm,Evolution of cloud computing, Defining cloud
computing, Components of a computing cloud,Essential Characteristics
I 7
of Cloud Computing, Cloud Taxonomy. Cloud Deployment
ModelsInfrastructure as a Service(IaaS), Platform as a Service(PaaS),
Software as a Service(SaaS), Hardware-as-a-service: (HaaS), Oriented
Architecture (SOA)
Cloud Computing Architectural Framework
Cloud architectural principles, Role of Web services, Benefitsand
challenges to Cloud architecture, Cloud Service Models, cloud
II 6
computing vendors. Cloud Services, Management, Performance and
scalability of services, tools and technologies used to managecloud
services deployment.SLA
Cloud Application Development
Role of business analyst, Technical architecture considerations,
Service creation environments to
III develop cloud based applications, Technologies and the processes 8
required when deploying web
services; Deploying a web service from inside and outside a cloud
architecture, advantages anddisadvantages, Cloud Economics,
Cloud Security and Risk Management
Cloud Security: Understanding cloud based security issues and threats,
IV Data security and Storage, Identity& Access Management, Risk 8
Management in cloud, Governance and Enterprise Risk
Management.
Open source & Commercial Cloud:
Service Oriented Architecture, Case Study on Open source Cloud
V Open stack, Case Study on Commercial Cloud Microsoft Azure,
Google Cloud Platform , AWS ,Sales force. Mobile Cloud Computing,
Docker Container ,Fog Computing, IoT Clouds

Kai Hwang, Geoffrey C. Fox and Jack J. Dongarra, “Distributed and

1. cloud computing from Parallel Processing to the Internet of Things”,
Morgan Kaufmann, Elsevier – 2012
2. Cloud Computing Bible, Barrie Sosinsky, Wiley-India, 2010
Text
Cloud Computing: Principles and Paradigms, Editors: RajkumarBuyya,
Books 3.
James Broberg,
4. Andrzej M. Goscinski, Wile, 2011
Cloud Computing: Principles, Systems and Applications, Editors: Nikos
5.
Antonopoulos,LeeGillam, Springer, 2012
P a g e | 82
 Curriculum for B.Tech.in Data Science

http://index-of.co.uk/Cloud-Computing-
1.
Books/Essentials%20of%20cloud%20computing%20(2015).pdf
E--Books
http://eddiejackson.net/web_documents/The_Definitive_Guide_to_Cloud
2.
_Computing.pdf
Cloud Security: A Comprehensive Guide to Secure Cloud Computing,
Reference 1. Ronald L. Krutz, Russell Dean Vines, Wiley-India, 2010
Books
GautamShroff, Enterprise Cloud Computing Technology Architecture
2.
Applications [ISBN:978-0521137355]
3. Dimitris N. Chorafas, Cloud Computing Strategies [ISBN: 1439834539]
4. Barrie Sosinsky, “ Cloud Computing Bible” John Wiley & Sons, 2010
Tim Mather, SubraKumaraswamy, and ShahedLatif, Cloud Security and
5. Privacy An Enterprise Perspective on Risks and Compliance, O'Reilly
2009

Course Title: Information Retrieval and Text Mining

Teaching Scheme Evaluation Scheme
Semester V
Theory Practical
Term ODD Th Tu Pr Credits TAE CAE ESE INT EXT
Course
C
Category
3 -- 2 4 10 15 50 25 --
Course UAIL304/
Code UAIP304
Teaching
Online 75 25
Mode
5 Total
Duration of
3 Hrs. 100
ESE

To understand how to independently obtain, parse, and analyze textual

information for organization.
Course
Objectives Identify Text Mining Problems
To introduce the basic concepts and techniques of Information Retrieval
and Text Mining
CO1:Analysisof optimization, unstructured and semi-structured text.
CO2:Implement text encoding and techniques.
Course CO3:Analysis of index compression using advance mechanisms.
Outcomes CO4:Design and implement a fully functional text-based retrieval system.
CO5:Implement methods and techniques used to extract useful
knowledge from text to support decision making.

Mapping of Course Outcomes with Program Outcomes and Program Specific

Outcomes:

Course Program Outcomes and Program Specific Outcomes

Outcomes PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO
1 2 3
1 2 3 4 5 6 7 8 9 10 11 12
CO1 2 3 1 1
CO2 3 2 1 2 1
P a g e | 83
 Curriculum for B.Tech.in Data Science

CO3 2 3 2 3 1
CO4 2 3 2 2 3 2
CO5 3 1 3 2 1 1 3 2 2 3

Course Contents:

Unit Contents Hours

Introduction to Information Retrieval. Inverted indices and boolean queries.
I Query optimization. The nature of unstructured and semi-structured text. 6
Course administrivia.
Text encoding: tokenization, stemming, lemmatization, stop words, phrases.
Further optimizing indices for query processing. Proximity and phrase queries.
II 8
Positional indices, Introduction to text classification. Naive Bayes models.
Spam filtering.
Index compression: lexicon compression and postings lists compression. Gap
III 6
encoding, gamma codes, Zipf's Law. Blocking. Extreme compression.
Query expansion: spelling correction and synonyms. Wild-card queries,
IV permuterm indices, n-gram indices. Edit distance, soundex, language 6
detection
Link analysis, Text classification and mining,Naive Bayes Vector space
classification, Sentiment analysis on the Web. Text classification. Exploiting
V 8
text-specific features. Feature selection. Evaluation of classification. Micro-
and macro-averaging. Comparative results.

Information Storage and Retrieval, by Robert R. Korfhage, Publisher: John

1.
Wiley & Sons (ISBN: 0471143383)
Document Warehousing and Text Mining: Techniques for Improving Business
Text
2. Operations, Marketing, and Sales, by Dan Sullivan, Publisher: Wiley, 2001
Books (ISBN: 0471399590)
Introduction to Information Retrieval by Christopher D. Manning,
3.
PrabhakarRaghavan and HinrichSchutze. Cambridge University Press, 2008
Information Retrieval: Searching in the 21st Century, by Dr. AyseGoker, Dr
1.
John Davies, Publisher: John Wiley & Sons (ISBN: 9780470033647)
Information Retrieval: Implementing and Evaluating Search Engines, by
Reference
2. Charles L. A. Clarke, Gordon Cormack, and Stefan Buttcher, Publisher:The
Books MIT Press,Cambridge, Massachusetts.
Readings in Information Retrieval, by Karen Sparck Jones, Publisher:The
3.
Morgan Kaufmann Series (ISBN: 9781558604544)

S. Contents Hours
1 Implement a program to demonstrate bitwise operation. 2
2 Implement Page Rank Algorithm 2
3 Write a program to Compute Similarity between two text documents. 2
Implement a map-reduce program to count the number of occurrences of
4 each alphabetic character in the given dataset. The count for each letter 2
should be case-insensitive
5 Write a program to Compute Similarity between two text documents. 2
Implement a program for Pre-processing of a Text Document: stop word
6 2
removal.
7 Write a program to implement web crawler. 2
P a g e | 84
 Curriculum for B.Tech.in Data Science

Implement a program to parse XML text, generate Web graph and compute
8 2
topic specific page rank.

Course Title: Design And Analysis Of Algorithms

Teaching Scheme Evaluation Scheme
Semester V
Theory Practical
Term ODD Th Tu Pr Credits TAE CAE ESE INT EXT
Course
C
Category
3 -- 2 4 10 15 50 25 -
Course UCSL205
Code UCSP205
Teaching
Online 75 25
Mode
5 Total
Duration of
3 Hrs. 100
ESE

Analyse the asymptotic performance of algorithms.

Course Demonstrate a familiarity with major algorithms and data structures
Objectives Apply important algorithmic design paradigms and methods of analysis.
Synthesize efficient algorithms in common engineering design situations
CO1:Analyse worst-case running times of algorithms using asymptotic
analysis.
CO2:Describe the divide-and-conquer, greedy, dynamic programming,
backtracking paradigms and explain when an algorithmic design situation
Course calls for it. Recite algorithms that employ this paradigm. Synthesize
Outcomes algorithm and analyse them.
CO3:Explain what competitive analysis is and to which situations it applies.
Perform competitive analysis.
CO4:Compare between different data structures. Pick an appropriate data
structure for a design situation.

Mapping of Course Outcomes with Program Outcomes and Program Specific

Outcomes:

Course Program Outcomes and Program Specific Outcomes

Outcomes
PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO
1 2 3
1 2 3 4 5 6 7 8 9 10 11 12
CO1
2 3 3 - - 2 3
CO2 - 3 3 3 - 2 3
CO3 - - 3 3 - 3 2
CO4 - - 2 2 - 2 3

P a g e | 85
 Curriculum for B.Tech.in Data Science

Course Contents:

Unit Content Hrs

I Introduction to algorithm, analysing control structures, space and time 8
complexities of an algorithm, worst case and average case analysis,
Asymptotic notations, mathematical foundations, summation of arithmetic
and geometric series, recurrence relations, solutions of recurrence
relations using technique of characteristic equation and generating
functions.
II Divide and conquer basic strategy, quick sort, merge sort etc. Graphs: 8
representation of graphs, BFS, DFS, connected components, topological
sorting of DAGs, biconnected components, and strongly connected
components in directed graphs.
III Greedy method – basic strategy, application to job sequencing with 7
deadlines problem, minimum cost spanning trees, shortest path problems,
fractional knapsack problem
IV Dynamic Programming basic strategy, multistage graphs, all pair shortest 7
path, optimal binary search trees, Matrix-chain Multiplication, traveling
salesman problem.
V Branch and bound, Backtracking basic strategy, 8 – Queen’s problem, 8
graph coloring, Hamiltonian cycles etc.NP-hard and NP-complete
problems, basic concepts, non-deterministic algorithms, NP-hard and NP-
complete, decision and optimization problems, polynomial reduction

Text Introduction to Algorithms, by Cormen, Leiserson, Rivest, and Stein,

1.
Books MIT Press, Third Edition, 2009
Algorithms, by Dasgupta, Papadimitrou and Vazirani, McGraw-Hill
1.
Education, 2006.
Computer Algorithms, by Horowitz, Sahni, and Rajasekaran, Silicon
2.
Reference Press, 2007.
Books 3. Algorithm Design, by Kleinberg and Tardos, Pearson, 2005.
4. Algorithm Design, by Goodrich and Tamassia, Wiley, 2001.
Sara Baase, Allen van Gelder: "Computer Algorithms: Introduction To
5.
Design & Analysis", 3/E, Pearson Education, 2000

LIST OF PRACTICALS

Sr.
No Name of Practical

1 Analysis of algorithms:Analyse selection sort (or bubble sort) and insertion

sort algorithms on different input size. Analyse best case and worst-case
performance. Use random number generator function to generate an input
sequence. Measure time complexity empirically and theoretically.

P a g e | 86
 Curriculum for B.Tech.in Data Science

2 Analysis of algorithms: write recursive and non-recursive version of binary

search, factorial, Fibonacci series and GCD. Measure time complexity
empirically and theoretically.
3 Divide and conquer basic strategy:Analyse Merge sort (or Quick sort)
algorithm on different input size. Use random number generator function to
generate an input sequence. Measure time complexity empirically and
theoretically.
4 Basic graph search algorithms: Breadth First Search (BFS) or Depth First
Search (DFS). Extend experiment to check whether the graph is connected or
not
5 Greedy algorithm: Minimum cost Spanning Tree using Kruskal’s Algorithm (or
Prim’s algorithm)
6 Dynamic Programming: All pair shortest path -- Floyd-Warshall Algorithm,
Multi-stage graph (forward and backward approach)
7 Backtracking: 8 – Queen’s problem
8 Backtracking: Graph Coloring problem
9 Mini Project (Solve a real-life problem by using algorithm design techniques).
Progress evaluation before every MSPA.
Case studies
1. Optimal binary search tree
2. Travelling salesperson problem
3. Fibonacci series: top-down, Bottom-up and dynamic programming

4. Hamiltonian cycle and Eluer’s walk

5. Clique and vertex cover problem

Course Title: Statistics for Management

Teaching Scheme Evaluation Scheme
Semester V
Theory Practical
Term ODD Th Tu Pr Credits TAE CAE ESE INT EXT
Course
C
Category
3 -- - 3 10 15 50 - --
Course
UBSL351
Code
Teaching
Online 75 -
Mode
3 Total
Duration of
NIL 75
ESE

To learn basic of statistics and Sampling Distributions .

Course
To learn about Hypotheses and Standard Deviation
Objectives
To understand the Simple Regression and Correlation .
Upon successful completion of this course, student will be able to:
Course CO1:Use statistical methodology and tools for Arranging Data to Convey
Outcomes Meaning
CO2:Analyze the given Testing Hypotheses.

P a g e | 87
 Curriculum for B.Tech.in Data Science

CO3:UsemultipleRegression and Modeling.

CO4:Solve problems using Flow Chart.
CO5: Implement Regression and Correlation problem using real life
problems
Mapping of Course Outcomes with Program Outcomes and Program Specific
Outcomes:

Course Program Outcomes and Program Specific Outcomes

Outcomes PO PO PO PO PO PO PO PO PO PO PO PO PS PSO PSO
1 2 3 4 5 6 7 8 9 10 11 12 O1 2 3
CO1 3 3 1 2 2 2 3 2
CO2 3 3 1 2 2 2 3 2
CO3 3 3 1 3 2 3 3 2 3
CO4 3 3 1 2 2 3 2 3 3
C05 3 3 3 3

Course Contents:

Unit Contents Hours

Introduction, Grouping and Displaying Data to Convey Meaning:
Tables and Graphs , How Can We Arrange Data, Examples of Raw
Data,
I 6
Arranging Data Using the Data Array and the Frequency, Distribution ,
Constructing a Frequency Distribution, Graphing Frequency
Distributions, Statistics at Work , Arranging Data to Convey Meaning
Sampling and Sampling Distributions, Introduction to
Sampling,Random Sampling ,Non-random Sampling, Design of
Experiments, Introduction to Sampling Distributions, Sampling
Distributions in More Detail,
II 6
An Operational Consideration in Sampling: The Relationship
Between Sample Size and Standard Error, Statistics at Work,
Chapter Review,Flow Chart: Sampling and Sampling, Estimation,
Introduction , Point Estimates
Testing Hypotheses: One-sample Tests,Introduction Concepts Basic to
the Hypothesis-testing Procedure, Testing Hypotheses, Hypothesis
Testing of Means When the Population ,Standard Deviation, Measuring
III 6
the Power of a Hypothesis Test ,Hypothesis Testing of Proportions:
Large Samples , Hypothesis Testing of Means When the Population,
Standard Deviation .
Testing Hypotheses: Two-sample Tests, Hypothesis Testing for
Differences Between Means and Proportions ,Tests for Differences
Between Means: Large Sample Sizes, Tests for Differences Between
IV 6
Means: Small Sample Sizes,
Testing Differences Between Means with Dependent Samples,
Tests for Differences Between Proportions: Large Sample Sizes

P a g e | 88
 Curriculum for B.Tech.in Data Science

Simple Regression and Correlation, Introduction , Estimation Using the

Regression Line, Correlation Analysis , Making Inferences About
Population Parameters, Using Regression and Correlation Analyses:
V Limitations, Errors, and Caveats, Statistics at Work, Chapter Review, 4
Flow Chart: Regression and Correlation , Multiple Regression and
Modeling, Multiple Regression and Correlation Analysis, Finding the
Multiple-Regression Equation, The Computer and Multiple Regression

Statistics For Management - Richard I. Levin, David S. Rubin, Sanjay

1.
Text Rastogi, Masood Husain Siddiqui
Books 2. Statistics for Management- N Chandrashekaran, M Parvathi
3.
1.
E--Books
2.
Reference Statistics For Management - Richard I. Levin, David S. Rubin, Sanjay
1.
Books Rastogi, Masood Husain Siddiqui
on line TL 1. https://www.tutorialspoint.com/statistics/index.htm
Material 2. https://www.coursera.org/specializations/statistics-with-python

Course Title: Engineering Economics and Industrial Management

Teaching Scheme Evaluation Scheme
Semester V
Theory Practical
Term ODD Th Tu Pr Credits TAE CAE ESE INT EXT
Course
H
Category
2 -- - 2 10 15 50 -- --
Course
UHUL303
Code
Teaching
Classroom 75 --
Mode
2 Total
Duration of
3 Hrs. 75
ESE

Understanding of basic knowledge of Economics and its

application.
Course Understanding of Management as discipline and its practices.
Objectives
Strengthening knowledge of management in the functional area of
Marketing and Finance.
CO1:The students should be able to understand the basic concepts of
Micro-Economics, which shall be helpful in their Engineering career.
CO2:The students should be able to understand the basics concepts of
Course
Macro-Economics and its applications.
Outcomes
CO3:The student should be able to understand different functions of
Management and its importance in managing an organization.
CO4:The student should be able to understand the relevance of
P a g e | 89
 Curriculum for B.Tech.in Data Science

Marketing of Product or Services and its applicability in profit

maximization.
CO5:The student should be able to understand the importance of
Financial Management and its applicability in Industrial scenario.
Mapping of Course Outcomes with Program Outcomes and Program Specific
Outcomes:

Course Program Outcomes and Program Specific Outcomes

Outcomes PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO
1 2 3
1 2 3 4 5 6 7 8 9 10 11 12
CO1 1 2
CO2 1 2
CO3 2 2 3 3
CO4 2 2
CO5 3

Course Contents:

Unit Contents Hours

Demand, Utility and Indifference curves, approach to Analysis of
demand, Elasticity of demand, Measure of demand elasticity, Factors of
Production, Advertising elasticity. Market and Market Structures:Price
I 7
and output determination under perfect competition, monopolistic
competition, oligopoly &monopoly, Depreciation and methods for its
determination.
Functions of central and commercial banks, Inflation, Deflation,
Stagflation, Direct and Indirect Taxes, New economic policy,
II 6
Liberalization, Globalization, Privatization, Monetary &Fiscal policies of
the government, Meaning and phases of business cycles.
Definition, nature and scope of Management, Functions of
III management- Planning, Organizing, Directing, Controlling, Principles of 5
management, Communication.
Meaning of Marketing management, concepts of marketing, Marketing
IV Mix, Service Marketing, Product Life Cycle, New Product Development, 7
Pricing strategies, Channels of distribution, Promotion Mix
Meaning, nature and scope of Financial Management,Sources of
V 5
Financing, Ratio Analysis. Time value of money.

Modern Economics Theory, by K.K. Dewett, S. Chand &

1.
company ltd., 3rd Edition, 2006
Essentials of Management by Harold Koontz &Hein&Weihrich
Text 2.
Tata McGraw Hill Publishing, 7th Edition, 2008.
Books Marketing Management by Philip Kotler, Kevin Keller, 14th
3.
Edition, 2016.
Financial Management by M.Y. Khan & P.K. Jain, Tata McGraw
4.
Hill Publishing, 5th Edition, 2008.

P a g e | 90
 Curriculum for B.Tech.in Data Science

http://164.100.133.129:81/econtent/Uploads/Managerial_Economics
1.
E-- %20(1).pdf[Economics]
Books
http://164.100.133.129:81/econtent/Uploads/Financial_Managemen
2.
t.pdf[Financial Management]
Management by Stephen P. Robbins Mary A. Coulter, 14th
1.
Edition.
Refere
Marketing Management by Ramaswamy V S and Namakumari,
nce 2.
Macmillan India Ltd.
Books
Financial Management by I M Pandey, Vikas Publishing House,
3.
New Delhi.

Course Title: Business Intelligence

Teaching Scheme Evaluation Scheme
Semester V
Theory Practical
Term ODD Th Tu Pr Credits TAE CAE ESE INT EXT
Course
EL
Category
3 Hrs -- -- 3 10 15 50 -- --
Course Code UAIL210
Teaching
Online 75
Mode
3 Hrs Total
Duration of
2 Hrs. 75
ESE

1. To introduce the concepts, processes and practice of decision making .

2. To provide an understanding of the senior management perspective regarding the

Course use of business intelligence (BI) systems.
Objectives
3. To encourage students to consider the strategic use of BI technology for strategic
advantage

Upon successful completion of this course, student will be able to:

CO1. Learn concept, process, and practice of the data science and how
methodologies are applied to visualize information from raw data.

CO2. Encourage and motivate students for learning BI involving predictive and
Course statistical approach.
Outcomes
CO3. Understand and analyze BI concepts and techniques.

CO4. Apply BI Techniques for various situations.

CO5. Implement BI techniques by using various tools and Create data visualization.

P a g e | 91
 Curriculum for B.Tech.in Data Science

Mapping of Course Outcomes with Program Outcomes and Program Specific Outcomes:

Course Program Outcomes and Program Specific Outcomes

Outcomes
PO PO PO PO PO PO PO PO PO PO1 PO PO PSO PSO 2
1 2 3 4 5 6 7 8 9 0 11 12 1
CO1
-- -- 3 -- -- -- -- -- -- -- -- -- 3 --
CO2 -- -- -- -- -- -- -- -- -- -- -- -- -- 2
CO3 2 3 3 -- -- -- -- -- -- -- -- -- -- 2
CO4 -- -- -- 3 -- -- -- -- -- -- -- -- 3 --
CO5 -- -- -- 3 3 -- -- -- -- -- -- -- -- --

Course Contents:

Unit Contents Hours

Introduction to Business Intelligence
BI concept, BI architecture, BI in today’s perspective, BI Process,
Applications of BI like Financial analysis, statistical analysis, sales analysis,
I CRM, result pattern and ranking analysis, Balanced Scorecard, BI in Decision 7
Modelling: Optimization, Decision making under uncertainty. Ethics and
business intelligence.

Data Science
The concept, process and typical tools in data science. Example of different
algorithms i.e segmentation, classification, validation, regressions,
II recommendations. Exercises using Excel and R to work on histograms, 8
regression, clustering and text analysis. Co-relation between Algorithm and
Code in data science

Data Visualization and Dashboard Design

Responsibilities of BI analysts by focusing on creating data visualizations and
III dashboards. Importance of data visualization, types of basic and composite 8
charts.

Performance Dashboard
Measuring, Monitoring and management of Business, KPIs and dashboard, the
IV types of dashboards, the common characteristics of Enterprise dashboard, 7
design of enterprise dashboards, and the common pitfalls of dashboard design.

Modelling and Analysis

Exploring Excel Modeling capabilities to solve business problems, summarize
and present selected data, introduction to business metrics and KPIs, creating
V 8
cubes using Microsoft Excel. Future of Business Intelligence-Emerging
Technologies.

P a g e | 92
 Curriculum for B.Tech.in Data Science

Efraim Turban, Ramesh Sharda, Dursun Delen, “Decision Support and Business
1. Intelligence Systems”, 9th Edition, Pearson 201
Text
David Loshin Morgan, Kaufman, “Business Intelligence: The Savvy Manager‟s
Books
2. Guide”,
Second Edition, 2012.

E-Books 1. https://www.tableau.com/learn/articles/business-intelligence-books
Carlo Vercellis, “Business Intelligence: Data Mining and Optimization for
1. Decision Making”, Wiley Publications, 2009.
Reference
Books Larissa T. Moss, S. Atre, “Business Intelligence Roadmap: The Complete
2. Project Lifecycle of Decision Making”, Addison Wesley, 2003

On line TL
1. https://nptel.ac.in/courses/110/107/110107092/
Material

Course Title: Recommendation System

Teaching Scheme Evaluation Scheme
Semester V
Theory Practical
Term ODD Th Tu Pr Credits TAE CAE ESE INT EXT
Course
EL
Category 2 2
NA 2 10 15 25 10 15
hrs. hrs.
Course Code UAIL307
Teaching
Online 75 --
Mode
3 Hrs Total
Duration of
2 Hrs. 75
ESE

1. To introduce the basic concepts of recommender systems and its application in

various domain.
Course
2. To develop state-of-the-art recommender systems that automate a variety of
Objectives choice-making strategies with the goal of providing affordable, personal, and
high-quality recommendations.
3. To evaluate recommendation systems
Upon successful completion of this course, student will be able to:
CO1: Describe basic concepts behind recommender systems
CO2: Be Familiar with various issues related to Personalization and
Course
Recommendations.
Outcomes
CO3: Explain a variety of approaches for building recommender systems
CO4: Describe system evaluation methods from both algorithmic and users’
perspectives
P a g e | 93
 Curriculum for B.Tech.in Data Science

CO5: Develop Recommender Systems for various domains.

Mapping of Course Outcomes with Program Outcomes:

Course Program Outcomes

Outcomes PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO1

CO1 -- 2 1 3 -- -- -- -- -- -- -- 1 2 --

CO2 -- 3 3 -- 3 3 -- -- -- -- -- 3 -- 3

CO3 -- 3 -- -- 3 3 -- -- -- -- -- 3 3 --

CO4 -- 2 3 -- 3 1 2 -- -- -- -- 1 -- 2

CO5 -- 3 3 -- 3 3 3 -- -- -- -- 3 -- --

Course Contents:

Unit Contents Hours

Introduction: Recommender system functions, Linear Algebra notation:

I Matrix addition, Multiplication, transposition, and inverses; covariance
8
matrices, Understanding ratings, Applications of recommendation systems,
Issues with recommender system.

Collaborative Filtering: User-based nearest neighbor recommendation, Item-

II based nearest neighbor recommendation, Model based and pre-processing 9
based approaches, Attacks on collaborative recommender systems.
Content-based recommendation: High level architecture of content-based
systems, Advantages and drawbacks of content based filtering, Item profiles,
III Discovering features of documents, Obtaining item features from tags, 9
Representing item profiles, Methods for learning user profiles, Similarity based
retrieval, Classification algorithms.
Knowledge based recommendation: Knowledge representation and
reasoning, Constraint based recommenders, Case based recommenders.
IV Hybrid approaches: Opportunities for hybridization, Monolithic hybridization
9
design: Feature combination, Feature augmentation, Parallelized hybridization
design: Weighted, Switching, Mixed, Pipelined hybridization design: Cascade
Meta-level, Limitations of hybridization strategies.

V Evaluating Recommender System: Introduction, General properties of

7
evaluation research, Evaluation designs, Evaluation on historical datasets,

P a g e | 94
 Curriculum for B.Tech.in Data Science

Error metrics, Decision-Support metrics, User-Centred metrics.

Recommender Systems and communities: Communities, collaboration and
recommender systems in personalized web search, Social tagging
recommender systems, Trust and recommendations, Group recommender
systems.

Jannach D., Zanker M. and FelFering A., Recommender Systems: An

Text Book 1.
Introduction, Cambridge University Press (2011), 1st ed.
Ricci F., Rokach L., Shapira D., Kantor B.P., Recommender Systems
1. Handbook, Springer(2011), 1st ed.
Books
Reference Manouselis N., Drachsler H., Verbert K., Duval E., Recommender Systems
2.
For Learning, Springer (2013), 1st ed.

Online
3 https://www.coursera.org/specializations/recommender-systems
Course

https://www.cse.iitk.ac.in/users/nsrivast/HCC/Recommender_systems_handbo
1
ok.pdf
E-book
https://github.com/singmiya/recsys/blob/master/Recommender%20Systems%2
2
0An%20Introduction.pdf

Course Title: DATA MINING

Teaching Scheme Evaluation Scheme
Semester VI
Theory Practical
Term Even Th Tu Pr Credits TAE CAE ESE INT EXT
Course
EL2
Category 3
NA NA 3 10 15 50 NA NA
Course Hrs
UCSL322
Code
Teaching
Offline 75 --
Mode
3 Hrs Total
Duration
2 Hrs 75
of ESE

P a g e | 95
 Curriculum for B.Tech.in Data Science

To identify the scope and essentiality of Data Mining.

Course To analyze data, choose relevant models and algorithms for respective
Objectives applications.
To develop research interest towards advances in data mining
Up on successful completion of this course, student will be able to:
CO1: Understand Data and Data Mining Principles
CO2: Illustrate frequent pattern mining methods, such as Apriori, ECLAT,
Course and FPgrowth.
Outcomes CO3: Apply different data mining techniques for classification and prediction.
CO4: Learn popular algorithms for cluster analysis.
CO5: Identify appropriate data mining algorithms to solve real world
problems

Mapping of Course Outcomes with Program Outcomes and Program Specific Outcomes:
Course Program Outcomes and Program Specific Outcomes
Outcome PO PO PO PO PO PO PO PO PO PO PO PO PSO PS
s 1 2 3 4 5 6 7 8 9 10 11 12 1 O2
CO1 -- 3 2 -- -- -- -- -- -- -- -- 2 -- --
CO2 2 3 3 2 2 -- -- -- -- -- -- 2 -- --
CO3 2 3 3 3 3 -- -- -- -- -- -- 2 3 2
CO4 2 3 3 3 3 -- -- -- -- -- -- 2 3 2
CO5 3 3 3 3 3 2 -- -- -- -- -- 2 3 3

Course Contents:
Unit Contents Hours
Introduction to data mining: What is Data Mining? What is the Data Mining
Process? Basic Data Mining Tasks, Problem Identification, Data Mining
I Metrics, Data Cleaning (pre-processing, feature selection, data reduction, 6
feature encoding, noise and missing values, etc.), Key Issues, Opportunities for
Data Mining.
Mining frequent patterns, associations and correlations: Basic concepts,
efficient and scalable frequent item set mining algorithms, mining various
II 6
kinds of association rules – multilevel and multidimensional, association rule
mining versus correlation analysis, constraint based association mining.
Classification and prediction: Definition, decision tree induction, Bayesian
classification, rule based classification, classification by backpropagation and
III 8
support vector machines, associative classification, lazy learners, prediction,
accuracy and error measures.
Cluster analysis: Definition, clustering algorithms - partitioning, hierarchical,
density based, grid based and model based; Clustering high dimensional data,
IV 8
constraint based cluster analysis, outlier analysis – density based and distance
based
Data mining on complex data and applications: Algorithms for mining of
V 8
spatial data, multimedia data, text data; Data mining applications, social
P a g e | 96
 Curriculum for B.Tech.in Data Science

impacts of data mining, trends in data mining.

Han, J. and Kamber, M., “Data Mining - Concepts and Techniques”, 3rd Ed.,
1.
Text Morgan Kaufmann Series.
Books Ali, A. B. M. S. and Wasimi, S. A., “Data Mining - Methods and
2.
Techniques”, Cengage Publishers
Mining the Social Web Data Mining Facebook Twitter LinkedIn Instagram
by Matthew A. Russell & Mikhail Klassen
E-Book 1.
https://www.pdfdrive.com/mining-the-social-web-data-mining-facebook-
twitter-linkedin-instagram-e185781408.html
Tan, P.N., Steinbach, M. and Kumar, V., “Introduction to Data Mining”,
Reference 1.
Addison Wesley – Pearson.
Books
2. Pujari, A. K., “Data Mining Techniques”, 4th Ed., Sangam Books.
On line TL
1. https://nptel.ac.in/courses/106/105/106105174/
Material

Course Title: Blockchain Technology

Teaching Scheme Evaluation Scheme
Semester V
Theory Practical
Term ODD Th Tu Pr Credits TAE CAE ESE INT EXT
Course
Category
3 NA NA 3 10 15 50 NA NA
Course
UCSL412
Code
Teaching
Offline 75 NA
Mode
3 Hrs
Duration
2 Hrs 75
of ESE

Understand how blockchain systems (mainly Bitcoin and Ethereum) work


Course  Design, build, and deploy smart contracts and distributed applications
Objectives  Integrate ideas from blockchain technology into their own projects

CO1: Understand and explore the working of Blockchain technology

CO2: Analyze the working of Smart Contracts
Course
CO3: Apply the learning of solidity and de-centralized apps on Ethereum
Outcomes
CO4: Design, build, and deploy a distributed application.
CO5: Evaluate security, privacy, and efficiency of a given blockchain system.

P a g e | 97
 Curriculum for B.Tech.in Data Science

Mapping of Course Outcomes with Program Outcomes:

Course Program Outcomes
Outcomes PO PO PO PO PO PO PO PO PO PO PO PO
1 2 3 4 5 6 7 8 9 10 11 12
CO1 2 2
CO2 3

CO3 3

CO4 2 3

CO5 3

Course Contents:

Unit Contents Hours

Basics:
Introduction to distributed computing, What is Blockchain, Blockchain
Technology Mechanisms & Networks, Blockchain Origins, Objective of
I 6
Blockchain, Blockchain Challenges, Transactions And Blocks, P2P Systems,
Keys As Identity, Digital Signatures, Hashing, and public key cryptosystems,
private vs. public Blockchain.
Introduction to Blockchain:
Introduction, Advantage over conventional distributed database, Blockchain
Network, Mining Mechanism, Distributed Consensus, Merkle Patricia Tree,
II 7
Gas Limit, Transactional Blocks in blockchain, Anonymity, Reward, Chain
Policy, Life of Blockchain application, Soft & Hard Fork, Private and Public
blockchain.
BitCoin and Hyperledger:
What is Bitcoin, The Bitcoin Mining Process, Mining Developments, Ethereum
Virtual Machine (EVM), Merkle Tree, Double-Spend Problem, Blockchain
III 7
And Digital Currency, What is Hyperledger? Distributed Ledger Technology &
its Challenges, Hyperledger & Distributed Ledger Technology, Hyperledger
Fabric, Hyperledger Composer.
Distributed Consensus & Cryptocurrency:
Nakamoto consensus, Proof of Work, Proof of Stake, Proof of Burn, Difficulty
Level, Sybil Attack, Energy utilization and alternate. History, Distributed
IV Ledger, Bitcoin protocols - Mining strategy and rewards, Ethereum - 8
Construction, DAO, Smart Contract, GHOST, Vulnerability, Attacks,
Sidechain, Namecoin
Cryptocurrency Regulation & Applications:
Stakeholders, Roots of Bit coin, Legal Aspects-Crypto currency Exchange,
V Black Market and Global Economy. 6
Applications: Internet of Things, Medical Record Management System,
Domain Name Service and future of Blockchain.

P a g e | 98
 Curriculum for B.Tech.in Data Science

Arvind Narayanan, Joseph Bonneau, Edward Felten, Andrew Miller and

Text 1. Steven Goldfeder, Bitcoin and Cryptocurrency Technologies: A
Books Comprehensive Introduction, Princeton University Press (July 19, 2016).
2. Satoshi Nakamoto, Bitcoin: A Peer-to-Peer Electronic Cash System
EBooks 1. https://www.blockchainexpert.uk/book/blockchain-book.pdf
1 Antonopoulos, Mastering Bitcoin: Unlocking Digital Cryptocurrencies
2 DR. Gavin Wood, “ETHEREUM: A Secure Decentralized Transaction
Reference
Ledger,”Yellow
Books
paper.2014.
3 Antonopoulos and G. Wood, Mastering Ethereum.
Online 1. https://nptel.ac.in/courses/106/104/106104220/

Course Title: Virtualized Container Platforms

Teaching Scheme Evaluation Scheme
Semester V
Theory Practical
Term Even Th Tu Pr Credits TAE CAE ESE INT EXT
Course
Category
3 3 10 15 50 -- --
Course
UCSL416
Code
Teaching
Offline
Mode
3 Hrs Total 75
Duration
2 Hrs
of ESE

To Understand the Features and Components of Docker and Kubernets

Course
Learn the architecture of containers and its configuration
Objectives
Learn the Docker networking with public and private registries
CO1:- Exemplify the features and components of containers with toolbox
CO2:- Articulate and experiment the Docker architecture with its configuration
Course
CO3:- Analyze the public and private repositories for Docker containers
Outcomes
CO4:- Comprehend the knowledge of Docker Networking for setting various
toolboxes

P a g e | 99
 Curriculum for B.Tech.in Data Science

Mapping of Course Outcomes with Program Outcomes

Course Programme
Programme Outcomes
Outcomes Specific Outcomes

PO3 PO4 PO5 PO8 PO9 PO11 PSO1 PSO2

CO1 2 2 1 3 2 2 -
CO2 1 2 3 1 3 3 2 3
CO3 2 3 2 2 3 3 2 3
CO4 2 3 3 3 2 3 2

Course Contents:
Unit Contents Hours
Docker Overview: Definition, Features of Docker, Components of Docker,
I Docker for Windows, Docker ToolBox, Working with Docker Toolbox, 6
Docker-Hub, Docker-Images, Docker-Containers, Working with Containers
Docker Architecture: Architecture, Containers and Hosts, Docker Images,
II Running a Container, Listing All Containers, Stopping a Container, Docker- 6
Configuring: service Docker stop, service Docker start
Docker Containers: Docker Containers and Shells, Docker-File, Docker-Hub,
III Building Files, Public Repositories, Managing Ports, Private Registries, 6
Building a Web Server Docker File, Instructions, Container Linking, Storage
Docker Networking: Listing All Docker Networks, Inspecting a Docker
network, Creating Your Own New Network, Setting Node.js, MongoDB,
IV NGINX, Docker-Toolbox, Setting ASP.net, Docker-Cloud, Logging, Line 6
Charts, Compose, Continuous Integration, Kubernetes Architectures, Working
on Kubernetes

Kubernetes and Docker - An Enterprise Guide: Effectively containerize

applications, integrate enterprise systems, and scale applications in your
1.
Text enterprise, Packt Publishing; 1st edition (6 November 2020) by Scott
Books Surovich and Marc Boorshtein, ISBN: 183921340X
The Kubernetes Book, Packt Publishing Limited (28 June 2019), by Nigel
2.
Poulton and Pushkar Joglekar, ISBN-13: 978-1838984380
Kubernetes: The Complete Guide to Master Kubernetes (March 2019 Edition),
Reference
1 Independently Published (28 April 2019), By Josef D. Moore, ISBN-13: 978-
Books
1096165774

P a g e | 100
Curriculum for B.Tech.in Data Science

P a g e | 101
 Curriculum for B.Tech.in Data Science

Semester-VI
Course Title: Next Generation Databases
Teaching Scheme Evaluation Scheme
Semester VI
Theory Practical
Term EVEN Th Tu Pr Credits TAE CAE ESE INT EXT
Course
C
Category
3 -- 2 4 10 15 50 25 --
Course UAIL421/
Code UAIP421
Teaching
75 25
Mode
5 Total
Duration of
3 Hrs. 100
ESE

To understand the basic concepts and terminology related to Unstructured

Database.
Course
Familiarize students with databases like NOSQL, XML
Objectives
Implement and evaluate complex, scalable database systems, with
emphasis on providing experimental evidence for design decisions.
CO1:Understand basic of Unstructured Database system
CO2:Demonstrate the management of structured and unstructured data
management with recent tools and technologies.
Course CO3:Demonstrate competency in designing NoSQLdatabase
Outcomes management systems
CO4:Demonstrate competency in designing XML Databases
CO5:Demonstrate competency in selecting a particular database for
specific use cases

Mapping of Course Outcomes with Program Outcomes and Program Specific

Outcomes:

Course Program Outcomes and Program Specific Outcomes

Outcomes PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO
1 2 3
1 2 3 4 5 6 7 8 9 10 11 12
CO1 3 2 2 2 2
CO2 3 2 2 3 2 2 2
CO3 3 2 3 3 2
CO4 3 2 3 3 2
CO5 3 2 2 3
P a g e | 102
 Curriculum for B.Tech.in Data Science

Course Contents:

Unit Contents Hours

Introduction : Three Database Revolutions, The Third Database
I 6
Revolution, Google, Big Data, and Hadoop
Sharding, Amazon, and the Birth of NoSQL, Document Databases,
II JSON Document Databases, Tables are Not Your Friends: Graph 6
Databases, Column Databases, Column Database Architectures
XML, XML Databases – XML Tools and Standards, XML Databases,
III XML Support in relational systems,JSON Document Databases, 6
MOngoDB, Column Databases, Graph Databases
Distributed Database Patterns, Nonrelational Distributed
IV 6
Databases,MongoDBSharding and Replication,HBase
Consistency Models, Consistency in MongoDB, Data Models and
V 4
Storage,Languages and Programming Interfaces,NoSQL APIs
Databases of the Future and Advance Databases,
VI Counterrevolutionaries,Oracle JSON Support, Disruptive Database 4
Technologies

1. Next Generation Databases, Mr. Guy Harrison,Apress

Text 2. Beginning JSON,by Mr. Ben Smith, Apress
Books Practical MongoDB,ByShakuntala Gupta Edward NavinSabharwal,
3.
Apress

Course Title: Computes Vision and Deep Learning

Teaching Scheme Evaluation Scheme
Semester VI
Theory Practical
Term EVEN Th Tu Pr Credits TAE CAE ESE INT EXT
Course
C
Category
3 -- 2 4 10 15 50 25 --
Course UAIL303
Code UAIP303
Teaching
75 25
Mode
5 Total
Duration of
3 Hrs. 100
ESE

Course To understand the mathematical, statistical and computational challenges

Objectives of building stable representations for high-dimensional data, such as

P a g e | 103
 Curriculum for B.Tech.in Data Science

images, text and data.

To understand basic type of neural networking
To apply Deep learning Techniques to various engineering and social
applications.

CO1:Ability to identify the deep learning techniques.

CO2:Ability to select and implement Machine learning and deep learning.
CO3:Ability to Train machine and solve problems associated with batch
Course learning and online learning,
Outcomes CO4:Ability to recognize and implement various ways of selecting suitable
model parameters for different machine learning techniques.
CO5:Ability to integrate deep learning libraries and mathematical and
statistical tools.

Mapping of Course Outcomes with Program Outcomes and Program Specific

Outcomes:

Course Program Outcomes and Program Specific Outcomes

Outcomes PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO
1 2 3
1 2 3 4 5 6 7 8 9 10 11 12
CO1 3 3 3 2 1 3
CO2 3 3 2 2 2
CO3 3 3 2
CO4 3 3 3
CO5 2 3 3 3

Course Contents:

Unit Contents Hours

(Partial) History of Deep Learning,Deep Learning Success
Stories,McCulloch Pitts Neuron, ThreesholdingLogic, Perceptron’s,
I PerceptronLearning Algorithm MultilayerPerceptron’s 6
(MLPs),Representation Power of MLPs,Sigmoid Neurons, Gradient
Descent,Feedforward Neural Networks
Representation Power of FeedforwardNeural Networks FeedForward
Neural Networks,Backpropagation Gradient Descent (GD),
II MomentumBased GD, Nesterov Accelerated GD,Stochastic GD, 8
AdaGrad, RMSProp,Adam, Eigenvalues and eigenvectors,Eigenvalue
Decomposition, Basis
Principal Component Analysis and its interpretations, Singular Value
Decomposition Autoencoders and relation to PCA, Regularization in
III 8
auto encoders, Denoising auto encoders, Sparse auto encoders,
Contractive auto encoders
Regularization: Bias Variance Tradeoff,L2 regularization, Early
IV 8
stopping, Dataset augmentation, Parameter sharing and tying, Injecting

P a g e | 104
 Curriculum for B.Tech.in Data Science

noise at input, Ensemble methods, Dropout Greedy Layer wise Pre-

training, Better activation functions, Better weight initialization methods,
Batch Normalization
Convolutional Neural Networks, LeNet, AlexNet, ZF-Net, VGGNet,
V 5
GoogLeNet, ResNet Learning Vectorial Representations Of Words
Recurrent Neural Networks, Backpropagation through time
(BPTT),Vanishing and Exploding Gradients,Truncated BPTT, GRU,
VI 5
LSTMs Encoder Decoder Models, Attention Mechanism, Attention over
images.

“Computer Vision Metrics: Survey, Taxonomy, and Analysis” by Andy Krig

1. Scott

Text Deep Learning in Computer Vision,Principles and

2.
Books Applications,MahmoudHassaballah, Ali Ismail Awad
Modern Deep Learning and Advanced Computer Vision, A Perspective
3. Approach, Dr.P.S.Jagadeesh Kumar, Prof. Thomas Binford, Dr.J.
Ruby, J. Lepika
on line TL
1. https://nptel.ac.in/courses/106/106/106106224/
Material

Course Title: Big Data Computing

Teaching Scheme Evaluation Scheme
Semester VI
Theory Practical
Term EVEN Th Tu Pr Credits TAE CAE ESE INT EXT
Course
C
Category
3 -- 2 4 10 15 50 25 25
Course UITL305
Code UITP305
Teaching
75 50
Mode
5 Total
Duration of
3 Hrs. 125
ESE

To understand the Hadoop architecture

Course
To learn Hadoop Distributed File System (HDFS) and YARN building, and
Objectives its functionality for limit and resource organization
To understand Map Reduce, Pig and HIVE architecture
Up on successful completion of this course, student will be able to:
CO1:Understand basic concepts and techniques of Hadoop and Big data
Course concept.
Outcomes CO2:Design different component of Hadoop ecosystem
CO3:Develop skills of implementation of various Hadoop ecosystem
components.
CO4:Apply ecosystem knowledge to real time problems of moderate
P a g e | 105
 Curriculum for B.Tech.in Data Science

complexity.
CO5:Understand the domain of data science and analysis of big data.

Mapping of Course Outcomes with Program Outcomes and Program Specific

Outcomes:

Course Program Outcomes and Program Specific Outcomes

Outcomes PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
CO1 2 3 - 3 - - - - - 3 - - - -
CO2 2 3 - 3 - - - - - 3 - - - 2
CO3 3 3 2 3 - - - - - 3 - 3 2 3
CO4 3 3 - 3 - - - - - 3 - 3 3 3
CO5 3 3 1 3 - - - - - 3 - - 3 -

Course Contents:

Unit Contents Hours

Big data and Hadoop:

Introduction to Hadoop and Big Data, Big data, challenges for
I 7Hr
processing big data, technologies support big data, History of Hadoop,
Use cases of Hadoop, RDBMS vsHadoop When to use and when not
to use Hadoop.
HDFS:
Hadoop Distributed File System, Significance of HDFS in Hadoop,
Features of HDFS, Data Storage in HDFS Introduction about Blocks,
II 7Hr
Data replication. Accessing HDFS: CLI (Command Line Interface) and
admin commands, Java Based Approach, Fault tolerance. Download
Hadoop, Installation and set-up of Hadoop, Start-up & Shut down
process
Map Reduce:
Map Reduce: Map Reduce Story, Map Reduce Architecture, How Map
III 7Hr
Reduce works, Developing Map Reduce, Map Reduce Programming
Model, Different phases of Map Reduce Algorithm, Different Data types
in Map Reduce
Pig
Introduction to Apache Pig, Map Reduce Vs. Apache Pig, Modes of
IV Execution in Pig, Loading data, Exploring Pig Latin commands, HIVE: 7Hr
Hive introduction, Hive architecture, Data types and schemas,
Partitions and buckets.
HIVE
V Hive introduction, Hive architecture. Data types and schemas, 7Hr
Partitions and buckets. BASE Architecture and schema design, Spark
Shell, Spark Application, Flume, SQOOP introduction and application

P a g e | 106
 Curriculum for B.Tech.in Data Science

Text 1. Tom White, “Hadoop: The Definitive Guide", 3rd edition, O'Reilly Media.
2. Big Data (Black Book), Wiley Publications
Books
3. V. Prajapati, "Big Data Analytics with R and Hadoop", Packt Pub.
1. https://nptel.ac.in/courses/106106142/ ------ Algorithm for Big data
E--Books
2. https://nptel.ac.in/courses/106104135/48 --- Big Data
3. Hadoop Definitive Guide, Tom White, O’Reilly Media
1. V. Ankam, Big Data Analytics, Packt Publication Ltd.
Reference 2. N. Dasgupta, Practical Big Data Analytics, Packt Publication Ltd.
Books MapReduce Design Patterns: Building Effective Algorithms and
3. Analytics for Hadoop and Other Systems, Adam Shook and Donald
Miner
1. https://www.udemy.com/big-data-hadoop-the-complete-course/
On line TL 2. https://www.cloudera.com/more/training/certification.html
Material
https://www.edureka.co/big-data-and-hadoop
3. https://www.simplilearn.com/big-data-and-analytics/big-data-and-hadoop-
training

List of Practical

Practical
Name of Practical
No
1 Installation of Hadoop& starting of Hadoop.
2 Copy the files from and to local
3 Map-Reduce for word counting
4 Creating the HDFS tables and loading them in Hive
5 Exporting data from Hive
6 Implementation of Pseudo Code using Spark
7 Word Count implementation Using Pig Script
8 Using Sqoop& Flume implement data aggregation

Course Title: Universal Human Values 2 : Understanding Harmony

Teaching Scheme Evaluation Scheme
Semester VI
Theory Practical
Term EVEN Th Tu Pr Credits TAE CAE ESE INT EXT
Course
H
Category
3 -- -- 3 10 15 50 -- --
Course
UHUL304
Code
P a g e | 107
 Curriculum for B.Tech.in Data Science

Teaching
75 --
Mode
3 Total
Duration of
3 Hrs. 75
ESE

Development of a holistic perspective based on self- exploration

about themselves (human being), family, society and
nature/existence
Course
Understanding (or developing clarity) of the harmony in the human
Objectives
being, family, society and nature/existence
Strengthening of self-reflection and development of commitment
and courage to act.
CO1:Students are expected to become more aware of themselves.
CO2:Students are expected to become more aware of their
surroundings (family, society, nature).
CO3:Students should become more responsible in life, and in
handling problems with sustainable solutions, while keeping human
Course relationships and human nature in mind.
Outcomes CO4:Students would have better critical ability, they would also
become sensitive to their commitment towards what they have
understood (human values, human relationship and human
society).
CO5:Students would be able to apply what they have learnt to their
own self in different day-to-day settings in real life.

Mapping of Course Outcomes with Program Outcomes and Program Specific

Outcomes:

Course Program Outcomes and Program Specific Outcomes

Outcomes PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO
1 2 3
1 2 3 4 5 6 7 8 9 10 11 12
CO1 2 3 1 2
CO2 3 2 2 2 2
CO3 3 3 3 2
CO4 2 2 2 2
CO5 1 1 1 2 3

Course Contents:

Unit Contents Hours

Course Introduction - Need, Basic Guidelines, Content and
Process for Value Education:
I Purpose and motivation for the course, Self-Exploration, 8
Continuous Happiness and Prosperity, Right understanding
relationship and physical facility, Understanding happiness
P a g e | 108
 Curriculum for B.Tech.in Data Science

and prosperity correctly, Method to fulfill the above human

aspirations.

Understanding Harmony in the Human Being - Harmony in

Myself!
Understanding human being as a co-existence of the sentient
II ‘I’ and the material ‘Body’, Understanding the needs of Self 8
(‘I’) and ‘Body’, Understanding the Body as an instrument of
‘I’, Understanding the characteristics and activities of ‘I’ and
harmony in ‘I’, Understanding the harmony of I with the Body.
Understanding Harmony in the Family and Society-
Harmony in Human-Human Relationship
Understanding values in human-human relationship,
III 8
Understanding the meaning of Trust, Understanding the
meaning of Respect, Understanding the harmony in the
society, Visualizing a universal harmonious order in society
Understanding Harmony in the Nature and Existence -
Whole existence as Coexistence
Understanding the harmony in the Nature,
IV 8
Interconnectedness and mutual fulfilment among the four
orders of nature, Understanding Existence as Co-existence,
Holistic perception of harmony
Implications of the above Holistic Understanding of
Harmony on Professional Ethics
Natural acceptance of human values, Definitiveness of Ethical
Human Conduct, Basis for Humanistic Education, Humanistic
V 8
Constitution and Humanistic Universal Order, Competence in
professional ethics, Strategy for transition from the present
state to Universal Human Order: a) At the level of individual,
b) At the level of society.

Text Human Values and Professional Ethics by R R Gaur, R

1.
Books Sangal, G P Bagaria, Excel Books,New Delhi, 2010
JeevanVidya: EkParichaya, A Nagaraj,
1.
JeevanVidyaPrakashan, Amarkantak, 1999.
Human Values, A.N. Tripathi, New Age Intl. Publishers, New
2.
Delhi, 2004.
3. The Story of Stuff (Book)
Reference The Story of My Experiments with Truth - by Mohandas
Books 4.
Karamchand Gandhi.
5. Small is Beautiful - E. F Schumacher.
6. Slow is Beautiful - Cecile Andrews
7. Economy of Permanence - J C Kumarappa
8. Bharat Mein Angreji Raj - PanditSunderlal
P a g e | 109
 Curriculum for B.Tech.in Data Science

9. Rediscovering India - by Dharampal

Hind Swaraj or Indian Home Rule - by Mohandas K.
10.
Gandhi
11. India Wins Freedom - Maulana Abdul Kalam Azad
12. Vivekananda - Romain Rolland (English)
13. Gandhi - Romain Rolland (English)

Course Title: Employability Skills

Teaching Scheme Evaluation Scheme
Semester VI
Theory Practical
Term EVEN Th Tu Pr Credits TAE CAE ESE INT EXT
Course
A
Category
-- -- 2 1 25 --
UHUP30
Course Code
2
Teaching
-- 25
Mode
2 Total
Duration of
3 Hrs. 25
ESE

To introduce them with the current market scenarios

Course To equip the students with the essential skills for employability
Objectives To demonstrate self-sufficiency to be highly employable or venture their
start-ups
CO1:Students shall exhibit their ability to set clear and realistic professional
objective
CO2:Enabling them to make well informed choices and commercially
equipped
Course CO3:Master Verbal (LSRW) and non-verbalcommunication skills required in
Outcomes the process of recruitment
CO4:Students shall exhibit improved Interpersonal skills for better
professional conduct
CO5:Students shall exercise higher order thinking skills, creativity skills,
convincing and Negotiation skills

Mapping of Course Outcomes with Program Outcomes and Program Specific

Outcomes:

Course Program Outcomes and Program Specific Outcomes

Outcomes PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO
1 2 3
1 2 3 4 5 6 7 8 9 10 11 12
CO1 3
CO2 3 3 3
CO3 3

P a g e | 110
 Curriculum for B.Tech.in Data Science

C04 3 3 3 3
C05 3 3 3

Course Contents:

Unit Contents Hours

Orientation - Researching Job and Company- Emerging Market
Trends:Experience sharing of Major Campus interviews, Skill
I 4
Requirements, Current Market trends, Researching the Job and
company
Personal and company commercial:Guidelines for preparing a 30-
90 second self Introduction .Questions to think about in developing a
commercial Understand " What to avoid" in a commercial - Self
Selling Proficiency: What to say and do, How to demonstrate
II commercial awareness in an interview ,Post Interview activity, 6
Telephone etiquette in a phone Interview Resume Building
:Guidelines on framing resume and cover letter Checklist to ensure
completeness , Sample resumes and cover letter references
Basic Guidelines on Video Resume an its difference with conventional
Verbal and Non-Verbal Communication:Format of Business
Correspondence, Email and Letter writing etiquette, Hands on training
on email and letter writing with case study, Body Language in an
III Interview- Dos' and Donts', Tips and techniques on Essay Writing 6
How to knot the crux on Essay writingPractise on some common essay
writing topics in an interview - Voice Versant Neutralization : Voice
Modulation, Pitch and tone training and Accent Neutralization
Personal Interview- Group Discussion: Preparation tips on GD and
Extempore: Dos' and Donts', Presentation on PI Preparation and FAQs
IV 4
-Role Plays/ Mock Interview with Technical Faculty and Mock Interview
by Faculty Assessment and feedback series:

Text
1. Employability Book – Global Education Ltd( Under Review)
Books
Reference 1. Employability Skills by NIMI Chennai, First Edition Aug 2019
Books 2. What employers wants by Karen Holmes, March 2017 Edition
E- Udemy , Coursera, Alison, Edx, WPA Apprentice, Hubspot,
1.
Learning Codecademy

Course Title: Campus Recruitment Training

Teaching Scheme Evaluation Scheme
Semester VI
Theory Practical
Term EVEN Th Tu Pr Credits TAE CAE ESE INT EXT
Course A -- -- 2 1 -- -- -- 25 --
P a g e | 111
 Curriculum for B.Tech.in Data Science

Category
Course
UHUP301
Code
Teaching
-- 25
Mode
2 Total
Duration of
3 Hrs. 25
ESE

The Curriculum aims to equip students in order to apply quantitative

reasoning and Mathematical analysis methodologies to understand and
solve problems.
Course The students shall attain conceptual clarity to comprehend reasoning
Objectives questions in a simple way and arrive at decisions at a logical manner.
The program intends to enhance student’s Critical Thinking, Analytical,
Evaluative and Creative skills that make them best fit and sustain in the
corporate/competitive world.
Students shall draw conclusions or make decisions based on analysis and
critique of quantitative information. This leads them to effectively justify
the conclusionand execute their plans.
Students shall solve real life problems requiring interpretation and
comparison of various probabilities to ascertain the best outcomes
Course
expected.
Outcomes
Students shall identify logical relation to analyze, comprehend and apply
mathematical techniques instead of assumptions to different real time
situations.
Shall solve the campus placements aptitude papers that qualifies them to
get employed.

Mapping of Course Outcomes with Program Outcomes and Program Specific

Outcomes:

Course Program Outcomes and Program Specific Outcomes

Outcomes PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO
1 2 3
1 2 3 4 5 6 7 8 9 10 11 12
CO1 3 3 3 2
CO2 3 3 3 3 3 3 2 2
CO3 3 3 3 3 3 2
C04 3 3 3 2 3

Course Contents:

Unit Contents Hours

P a g e | 112
 Curriculum for B.Tech.in Data Science

Orientation to Aptitude: Orientation on syllabus,Emerging aptitude

I 4
requirement,Pre-assessment on existing knowledge
Quantitative Aptitude: Number System, Problem on Numbers, Ratio
and Proportion, Averages, Percentage, Profit/ Loss and Discount,
Simple Interest and Compound Interest, Partnership, Mixtures and
II 8
Alligations,Speed, Time & Distance, Time & Work, Boats and Stream,
Pipes and Cistern, Permutation & Combination, Probability,
Progression, Mensuration
Logical Reasoning:Blood Relation, Direction, Analogy, Puzzles,
Seating Arrangement, Syllogism, Clocks, Calendar, Cubes & Dices,
III 5
Coding and Decoding, Spatial and 2-D Ability, Data Sufficiency,
Number Series
Data Interpretation: Table chart, pie chart, bar graph and line graph,
problems based on the various data , such as combination of gender,
IV 4
city, profession,salary, sports, vehicle, problems based on Pie chart,
degree of fraction occupied by the commodity, line chart and bar chart

Text Book on Aptitude and Verbal Ability- Global Education Ltd( Under
1.
Books Review)
Reference 1. Quantitative Aptitude- R S Aggarwal - 2017 Edition- S. Chand
Books 2. Campus Recruitment- Paxis Group
E-
1. Wifi study, indiabix.com, freshers world, sawal.com, unacademy
Learning

Course Title: Humanities Elective

Evaluation Scheme
Semester VI Teaching Scheme
Theory Practical
Term EVEN Th Tu Pr Credits TAE CAE ESE INT EXT
Course
Category H3
2
NA NA 2 10 15 50 NA NA
Course Hrs
UHULX
Code XX
Teaching OFFLIN
Mode E 75 --
2 Hrs Total
Duration of
2 Hrs
ESE 75

To be offered based on courses available

P a g e | 113
 Curriculum for B.Tech.in Data Science

Semester-VII

Evaluation Scheme
Teaching Scheme
Course Name of Course Theory Practical
Credits TOTAL
Code Courses Category Total
L T P TAE CAE ESE INT EXT MARKS
Hours
SEMESTER-VII
Department
UAIL XXX EL 3 3 3 10 15 50 75
Elective III
Department
UAIL XXX EL 3 3 3 10 15 50 75
Elective IV
Department
UAIL XXX EL 3 2 5 4 10 15 50 25 100
Elective-V
Department
UAIL XXX EL 3 2 5 4 10 15 50 25 100
Elective-VI
UAIP419 Project P 8 8 4 100 100 200
TOTAL 12 0 12 24 18 550

Semester-VIII

Teaching Evaluation Scheme

Scheme Theory Practical
Course Name of Course
Credits TOTAL
Code Courses Category Total
L T P TAE CAE ESE INT EXT MARKS
Hours

SEMESTER-VIII
UAIP420 Internship P 12 250 250 500
MOOCs
UISL4XX based Open OE 3 3 3 10 15 50 75
Elective
TOTAL 3 0 0 3 15 575

P a g e | 114