ANNEXURE-I

JAYPEE UNIVERSITY OF INFORMATION TECHNOLOGY, SOLAN

COURSE CURRICULUM OF CSE&IT DEPARTMENT- 2018 batch (160 CREDITS)

CERTIFICATE OF PROFICIENCY IN COMPUTER SCIENCE AND ENGINEERING &

INFORMATION TECHNOLOGY
PROFICIENCY 1 (INFORMATION SECURITY)
Total
S. No. Elective Semester Name of the Subjects Course Hours Credits
Hours

L T P
1 Elective -1 5th Sem Data Compression 2 0 0 2 2
2 Elective -1 5th Sem Data Compression Lab 0 0 2 1 2
3 Elective -2 6th Sem Digital Forensics 2 0 0 2 2
4 Elective -2 6th Sem Digital Forensics lab 0 0 2 1 2
5 Elective -3 6th Sem Information Security 2 0 0 2 2
6 Elective -3 6th Sem Information Security Lab 0 0 2 1 2
7 Elective -4 7th Sem Cryptography& network security 2 0 0 2 2
Cryptography& network security
8 Elective -4 7th Sem Lab 0 0 2 1 2
Information Auditing & Risk
9 Elective -5 7th Sem Management 3 0 0 3 3
Ethics and Information
10 Elective -6 8th Sem Technology 3 0 0 3 3
Total 22
PROFICIENCY 2 (DATA SCIENCES)
Total
S. No. Elective Semester Name of the Subjects Course Hours Credits
Hours

L T P
Foundation for Data Science and
1 Elective -1 5th Sem Visualization 2 0 0 2 2
Data Science and Visualization
2 Elective -1 5th Sem Lab 0 0 2 1 2

3 Elective -2 6th Sem Machine learning 2 0 0 2 2

2
Machine Learning Lab
4 Elective -2 6th Sem 0 0 2 1 2
From Graph to Knowledge Graph
5 Elective -3 6th Sem 2 0 0 2 2
From Graph to Knowledge Graph
6 Elective -3 6th Sem Lab 0 0 2 1 2
Computational Data Analysis
7 Elective -4 7th Sem 2 0 0 2 2
Computational Data Analysis lab
8 Elective -4 7th Sem 0 0 2 1 2
Optimization Methods in
9 Elective -5 7th Sem Business Analytics 3 0 0 3 3
Social and Information Network
10 Elective -6 8th Sem Analysis 3 0 0 3 3
Total 22
PROFICIENCY 3 (MACHINE LEARNING)
Total
S. No. Elective Semester Name of the Subjects Course Hours Credits
Hours

L T P
Foundation for Data Science and
1 Elective -1 5th Sem Visualization 2 0 0 2 2
Data Science and Visualization
2 Elective -1 5th Sem Lab 0 0 2 1 2
3 Elective -2 6th Sem Machine learning 2 0 0 2 2
4 Elective -2 6th Sem Machine Learning Lab 0 0 2 1 2
Data Mining & Data
5 Elective -3 6th Sem Warehousing 2 0 0 2 2
Data Mining & Data
6 Elective -3 6th Sem Warehousing Lab 0 0 2 1 2
7 Elective -4 7th Sem Cryptography& network security 2 0 0 2 2
Cryptography& network security
8 Elective -4 7th Sem Lab 0 0 2 1 2
Information Auditing & Risk
9 Elective -5 7th Sem Management 3 0 0 3 3
10 Elective -6 8th Sem Probabilistic Graphical Models 3 0 0 3 3
Total 22
PROFICIENCY 4 (COMPUTER GRAPHICS)
Total
S. No. Elective Semester Name of the Subjects Course Hours Credits
Hours

L T P
Foundation for Data Science and
1 Elective -1 5th Sem Visualization 2 0 0 2 2

3
Data Science and Visualization
2 Elective -1 5th Sem Lab 0 0 2 1 2
3 Elective -2 6th Sem Computer Animation 2 0 0 2 2
4 Elective -2 6th Sem Computer Animation Lab 0 0 2 1 2
5 Elective -3 6th Sem Digital Image processing 2 0 0 2 2
6 Elective -3 6th Sem Digital Image processing Lab 0 0 2 1 2
7 Elective -4 7th Sem Game Development and Design 2 0 0 2 2
8 Elective -4 7th Sem Game Development Lab 0 0 2 1 2
9 Elective -5 7th Sem Computer Vision 3 0 0 3 3
10 Elective -6 8th Sem Information Modeling 3 0 0 3 3
Total 22
PROFICIENCY 5 (BIG DATA AND VISUAL ANALYTICS)
Total
S. No. Elective Semester Name of the Subjects Course Hours Credits
Hours

L T P
1 Elective -1 5th Sem Big Data using Hadoop 2 0 0 2 2
2 Elective -1 5th Sem Big Data using Hadoop Lab 0 0 2 1 2
3 Elective -2 6th Sem Machine learning 2 0 0 2 2
4 Elective -2 6th Sem Machine Learning Lab 0 0 2 1 2
Data Mining & Data
5 Elective -3 6th Sem Warehousing 2 0 0 2 2
Data Mining & Data
6 Elective -3 6th Sem Warehousing Lab 0 0 2 1 2
7 Elective -4 7th Sem Computational Data Analysis 2 0 0 2 2
8 Elective -4 7th Sem Computational Data Analysis lab 0 0 2 1 2
9 Elective -5 7th Sem Introduction to Deep Learning 3 0 0 3 3
10 Elective -6 8th Sem Information Visualization 3 0 0 3 3
Total 22
PROFICIENCY 6 (IMAGE ANALYSIS AND PROCESSING)
Total
S. No. Elective Semester Name of the Subjects Course Hours Credits
Hours

L T P
Image Analysis and Pattern
1 Elective -1 5th Sem Recognition 2 0 0 2 2
Image Analysis and Pattern
2 Elective -1 5th Sem Recognition Lab 0 0 2 1 2

4
3 Elective -2 6th Sem Computer and Robot Vision 2 0 0 2 2
4 Elective -2 6th Sem Computer and Robot Vision lab 0 0 2 1 2
5 Elective -3 6th Sem Digital Image processing 2 0 0 2 2
6 Elective -3 6th Sem Digital Image processing Lab 0 0 2 1 2
7 Elective -4 7th Sem Artificial Intelligence 2 0 0 2 2
8 Elective -4 7th Sem Artificial Intelligence Lab 0 0 2 1 2
9 Elective -5 7th Sem Computer Vision 3 0 0 3 3
10 Elective -6 8th Sem Information Visualization 3 0 0 3 3
Total 22
PROFICIENCY 7 (CLOUD COMPUTING)
Total
S. No. Elective Semester Name of the Subjects Course Hours Credits
Hours

L T P

Cloud Computing: Concepts,

1 Elective -1 5th Sem Technology & Architecture 2 0 0 2 2

Cloud Computing: Concepts,

2 Elective -1 5th Sem Technology & Architecture Lab 0 0 2 1 2
8 Elective -2 6th Sem Machine Learning 2 0 0 2 2
9 Elective -2 6th Sem Machine Learning Lab 0 0 2 1 2
Architecting Distributed Cloud
6 Elective -3 6th Sem Applications 2 0 0 2 2
Architecting Distributed Cloud
7 Elective -3 6th Sem Applications Lab 0 0 2 1 2
12 Elective -4 7th Sem Artificial Intelligence 2 0 0 2 2
13 Elective -4 7th Sem Artificial Intelligence Lab 0 0 2 1 2
14 Elective -5 7th Sem Storage Networks 3 0 0 3 3
3 Elective -6 8th Sem Cloud Computing Security 3 0 0 3 3
Total 22
PROFICIENCY 8 (HUMAN COMPUTER INTRACTION)
Total
S. No. Elective Semester Name of the Subjects Course Hours Credits
Hours

L T P
1 Elective -1 5th Sem Human-Computer Interaction 2 0 0 2 2
2 Elective -1 5th Sem Human-Computer Interaction Lab 0 0 2 1 2

5
Computability, Complexity &
3 Elective -2 6th Sem Algorithms 2 0 0 2 2
Computability, Complexity &
4 Elective -2 6th Sem Algorithms Lab 0 0 2 1 2
5 Elective -3 6th Sem Pattern Recognition 2 0 0 2 2
6 Elective -3 6th Sem Pattern Recognition Lab 0 0 2 1 2
7 Elective -4 7th Sem Artificial Intelligence 2 0 0 2 2
8 Elective -4 7th Sem Artificial Intelligence Lab 0 0 2 1 2
9 Elective -5 7th Sem Computer Vision 3 0 0 3 3
Knowledge-Based AI: Cognitive
10 Elective -6 8th Sem Systems 3 0 0 3 3
Total 22
PROFICIENCY 9 (ARTIFICIAL INTELLIGENCE)
Total
S. No. Elective Semester Name of the Subjects Course Hours Credits
Hours

L T P
Foundation for Data Science and
2 Elective -1 5th Sem Visualization 2 0 0 2 2
Data Science and Visualization
3 Elective -1 5th Sem Lab 0 0 2 1 2
4 Elective -2 6th Sem Machine Learning 2 0 0 2 2
5 Elective -2 6th Sem Machine Learning Lab 0 0 2 1 2
Statistics and Exploratory Data
8 Elective -3 6th Sem Analytics 2 0 0 2 2
Statistics and Exploratory Data
9 Elective -3 6th Sem Analytics Lab 0 0 2 1 2
10 Elective -4 7th Sem Artificial Intelligence 2 0 0 2 2
11 Elective -4 7th Sem Artificial Intelligence Lab 0 0 2 1 2
12 Elective -5 7th Sem Introduction to Deep Learning 3 0 0 3 3
6 Elective -6 8th Sem Reinforcement Learning 3 0 0 3 3
Total 22
PROFICIENCY 10 (SOCIAL COMPUTING)
Total
S. No. Elective Semester Name of the Subjects Course Hours Credits
Hours

L T P

2 Elective -1 5th Sem Social Media 2 0 0 2 2

Social Media Lab (Node XL)
3 Elective -1 5th Sem 0 0 2 1 2

6
Statistics and Data Science
6 Elective -2 6th Sem 2 0 0 2 2
Statistics and Data Science Lab
7 Elective -2 6th Sem 0 0 2 1 2
From Graph to Knowledge Graph
8 Elective -3 6th Sem 2 0 0 2 2
From Graph to Knowledge Graph
9 Elective -3 6th Sem Lab 0 0 2 1 2
Artificial Intelligence
10 Elective -4 7th Sem 2 0 0 2 2
Artificial Intelligence Lab
11 Elective -4 7th Sem 0 0 2 1 2
Cloud Computing
12 Elective -5 7th Sem 3 0 0 3 3
Social and Information Network
13 Elective -6 8th Sem Analysis 3 0 0 3 3
Total 22

7
ANNEXURE-II

1. Statistics and Data Science

COURSE CODE: XXXXXXXX
COURSE CREDITS: 2
CORE/ELECTIVE:
L-T-P: 2-0-1
Pre-requisite: Basic knowledge of high school mathematics and reasonable programming
experience.
Course Objectives:
1. Understand the Fundamentals of Statistics
2. Understand the Probability for Data Analysis
3. Learn how to work with Different Types of Data
4. Different Types of Distributions
5. Apply Statistical Methods and Hypothesis Testing to Business Problems
6. Understand all the concepts of Statistics for Data Science and Analytics
7. Working of Regression Analysis
8. Implement one way and two way ANOVA
9. Chi-Square Analysis
10. Central Limit Theorem
Course Outcomes:
Level of
S No Course Outcomes
Attainment
CO-1 Understand all the concepts of Statistics for Data Science and Analytics Familiarity
Compute the probabilities of events along with an understanding of the
CO-2 Usage
random variables, expectation, variance and distributions.
Identify probability distributions commonly used as foundations for
CO-3 Assessment
statistical modeling.
CO-4 Apply Statistical Methods and Hypothesis Testing to Business Problems Usage
Broaden the knowledge about Random Variables, Joint Distributions,
CO-5 Assessment
Special Distributions
To have hands on skills on Illustrative example for data
analysis(Implementation of statistical techniques, data interpretation,
CO-6 Usage
Regression Analysis, Covariance, Hypothesis testing and analysis of
variance)
Course Contents:

Lectures
Unit Contents
required
Introduction: What is Data Science? - Big Data and Data Science hype
and getting past the hype - Why now? Datafication - Current landscape of
1 perspectives - Skill sets needed 5
Probability: Classical, relative frequency and axiomatic definitions of
probability, addition rule and conditional probability, multiplication rule,

8
total prob

Random Variables: Discrete, continuous and mixed random variables,

probability mass, probability density and cumulative distribution functions,
2 mathematical expectation, moments, probability and moment generating 6

problems, Function of a random variable, problems.

Special Distributions: Discrete uniform, binomial, geometric, negative
binomial, hypergeometric, Poisson, continuous uniform, exponential,
3 gamma, Weibull, Pareto, beta, normal, lognormal, inverse Gaussian, 5
Cauchy, double exponential distributions, reliability and hazard rate,
reliability of series and parallel systems, problems.
Joint Distributions: Joint, marginal and conditional distributions, product
4 moments, correlation and regression, independence of random variables, 5
bivariate normal distribution, problems.
Sampling Distributions: The Central Limit Theorem, distributions of the
5 sample mean and the sample variance for a normal population, Chi-Square, t 5
and F distributions, problems
Testing of Hypotheses: Null and alternative hypotheses, the critical and 8
acceptance regions, two types of error, power of the test, the most powerful
6 test and Neyman-Pearson Fundamental Lemma, tests for one sample and 6
two sample problems for normal populations, tests for proportions,
Chisquare goodness of fit test and its applications, problems.
Total lectures 32

Suggested Text Book(s):

An Introduction to Probability and Statistics by V.K. Rohatgi & A.K. Md. E. Saleh,
Wiley, (2008), 3rd ed.
Introduction to Probability and Statistics by J.S. Milton & J.C. Arnold, Boston,
London, McGraw-Hill, (2006), 4th ed.
Data Science and analytics with python by Jesus Rogel-Salazar.

Suggested Reference Book(s):

Introduction to Probability Theory and Statistical Inference by H.J. Larson, John

Wiley & Sons, (2005) 3rd ed.
Introduction to Probability and Statistics for Engineers and Scientists by S.M. Ross,
Elsevier, (2014), 4th ed.
Python Data Science Handbook by Jake VanderPlas, 2017.

9
Other useful resource(s):

https://nptel.ac.in/courses/110/106/110106064/
https://onlinecourses.nptel.ac.in/noc18_cs28/pr
eview
https://bit.ly/2GvlBfs
https://bit.ly/3aONiOo

Evaluation Scheme:
S No Exam Marks Duration Coverage / Scope of Examination
1 T-1 15 1 Hour. Syllabus covered upto T-1
2 T-2 25 1.5 Hours Syllabus covered upto T-2
3 T-3 35 2 Hours Entire Syllabus
Assignment (2) - 10
Teaching
4 25 Entire Semester Quizzes (2) - 10
Assessment
Attendance - 5

Course Outcomes (COs) contribution to the Programme Outcomes (POs)

Course outcomes
(Parallel and
Distributed
Algorithms )
CO-1 2 2 2 2 2 1 1 1 2 2 2 2
CO-2 2 3 3 3 3 1 1 1 2 2 1 1
CO-3 2 2 2 2 1 1 1 1 2 2 1 2
CO-4 3 3 3 3 2 1 1 1 2 3 3 2
CO-5 2 3 3 3 1 1 1 1 2 3 2 2
CO-6 2 3 3 3 2 1 1 1 2 3 2 2
Average

10
2. Statistics and Data Science Lab

COURSE CODE: XXXXXXXX

COURSE CREDITS: 1
CORE/ELECTIVE:
L-T-P: 0-0-2
Pre-requisite: Basics of programming in R or Python
Course Objectives:

After completion of this course, the students will be able to:

1. Understand the fundamentals of statistics and apply them in practice
2. To analyze the data using different descriptive measures and present graphically.
3. Compute the probabilities of events along with an understanding of the random
variables, expectation, variance and distributions.
4. Understand the estimation of mean and variance and their respective one-sample and
k sample hypothesis tests.

Course Outcomes:
Level of
S No Course Outcomes
Attainment
CO1 Understand basics of Python or R syntax, functions and programming Familiarity
CO2 Learn the core tools for data science with R or Python Usage
CO3 Understand and carry out regression analysis Usage
CO4 Visualise data: plot different types of data & draw insights Usage
CO5 Hypothesis testing in R or Python Usage
CO6 Analyze the systems using Laplace transform and Z-transform. Usage

List of Experiments

S No Description Hours
1 Introduction to basics of Python or R syntax, functions and programming. 2
2 2
package in R, Lib/statistics.py package in python)
3 Implementation of statistical techniques using statistical packages. 2
4 Evaluation of Statistical Parameters and data interpretation 2
5 Regression Analysis 2
6 Covariance Analysis 2
7 Hypothesis testing 2
8 Analysis of variance 2
9 Introduction to Numpy in Python 2
10 Data Manipulation with Pandas 2

11
11 Data Visulaization with Matplotlib 2
12 Introduction to Data Preprocessing 2
13 Introduction to Machine Learning Models 2
14 Introduction to model cross-validation and model performance analysis 2
Total Lab hours 28

Suggested/Resources:

Python Data Science Handbook by Jake VanderPlas, 2017.

Data Science and analytics with python by Jesus Rogel-Salazar.
Introduction to Probability Theory and Statistical Inference by H.J. Larson, John Wiley
& Sons, (2005) 3rd ed.
https://bit.ly/3aONiOo
https://bit.ly/2GvlBfs
https://bit.ly/2uIJuxg

Evaluation Scheme:
1 Mid Sem. Evaluation 20 Marks
2 End Sem. Evaluation 20 Marks
3 Project-1 10 Marks
4 Lab Assessment 45 Marks
5 Lab Attendance 5 Marks
Total 100 marks

Course Outcomes (COs) contribution to the Programme Outcomes (POs)

CO/PO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 Avg
CO1 3 3 3 3 2 2 1 1 1 1 1 1
CO2 3 3 3 3 3 1 1 1 1 1 1 3
CO3 3 3 2 3 2 3 2 1 1 1 2 1
CO4 3 3 3 2 3 2 1 1 1 1 1 1
CO5 2 2 3 3 3 3 1 1 1 1 1 1
CO6 2 3 3 3 2 2 2 2 2 2 2 2
Avg

12
3. Digital Forensics

COURSE CODE: XXXXXXXX

COURSE CREDITS: 2
CORE/ELECTIVE:
L-T-P: 2-0-2
Pre-requisite: Cryptography and Security, Computer Networks
Course Objectives:

1. To understand underlying principles and many of the techniques associated with the
digital forensic practices and cyber crime
2. To explore practical knowledge about ethical hacking Methodology.
3. To learn the importance of evidence handling and storage for various devices
4. To develop an excellent understanding of current cyber security issues (Computer
Security Incident) and analyzed the ways that exploits in securities.
5. To investigate attacks, IDS .technical exploit
computer networks.
6. To apply digital forensic knowledge to use computer forensic tools and investigation
report writing

Course Outcomes:
Level of
S No Course Outcomes
Attainment
CO-1 Introduction to Cyber Crime and Ethical Hacking Familiarity
CO-2 Introduction to Digital Forensics and Digital Evidences Familiarity
CO-3 Computer Security Incident Response Methodology Assessment
CO-4 Forensic Duplication and Disk Analysis, and Investigation Data Analysis Assessment
CO-5 Network Forensics Incidents, Using Routers as Response Tools Usage
CO-6 Forensic Investigation Report and Forensic Tools Usage

Course Contents:

Lectures
Unit Contents
required
Introduction of Cybercrime: Types of cybercrime ,categories of cybercrime ,
Computers' roles in crimes, Prevention from Cyber crime, Hackers, 6
Crackers, Phreakers
1
Ethical Hacking :Difference between Hacking and Ethical hacking : Steps of
Ethical Hacking, Exploring some tools for ethical hacking: reconnaisance
tools, scanning tools
Digital Forensic ,Rules for Digital Forensic The Need for Digital Forensics,
Types of Digital Forensics, Ethics in Digital Forensics,
2 6
Digital Evidences : Types and characteristics and challenges for Evidence
Handling

13
Introduction to Computer Security Incident Goals of Incident response,
Incident Response Methodology, Formulating Response Strategy,
IR Process Initial Response, Investigation, Remediation, Tracking of
3 Significant ,Investigative Information, Reporting 6
Pre Incident Preparation, Incident Detection and Characterization.
Live Data Collection : Live Data Collection on Microsoft Windows Systems:
Live Data Collection on Unix-Based Systems
Forensic Duplication
Forensic Image Formats, Traditional Duplication, Live System Duplication,
Forensic Duplication tools
Disk and File System Analysis: Media Analysis Concepts, File System
Abstraction Model
The Sleuth Kit : Installing the Sleuth Kit , Sleuth Kit Tools
Partitioning and Disk Layouts : Partition Identification and Recovery,
4 Redundant Array of Inexpensive Disks 6
Special Containers : Virtual Machine Disk Images , Forensic Containers
Hashing, Carving : Foremost , Forensic Imaging : Deleted Data , File Slack
, dd , dcfldd , dc3dd
Data Analysis
Analysis Methodology Investigating Windows systems , Investigating UNIX
systems , Investigating Applications, Web Browsers, Email, Malware
Handling: Static and Dynamic Analysis
Technical Exploits and Password Cracking ,
Introduction to Intrusion Detection systems, Types of IDS
Understanding Network intrusion and attacks , Analyzing Network Traffic,
5 4
Collecting Network based evidence, Evidence Handling.
Investigating Routers, Handling Router Table Manipulation Incidents, Using
Routers as Response Tools
Report :Goals of Report, Layout of an Investigative Report, Guidelines for
Writing a Report, sample for writing a forensic report .
6 Computer Forensic Tools : need and types of computer forensic tools, task 4
performed by computer forensic tools . Study of open source Tools like
SFIT, Autopsy etc. to acquire, search, analyze and store digital evidence
Total lectures 32

Suggested Text Book(s):

Tata McGraw Hill, 2014.

Publishing, Inc. 2011.

14
Suggested Reference Book(s):

forensic evidence guide for moving targets and data , Syngress Publishing, Inc. 2010
B

.2008.
Marjie T. Britz, Computer Forensics and Cyber Crime, Pearson, Third Edition.

Evaluation Scheme:
S No Exam Marks Duration Coverage / Scope of Examination
1 T-1 15 1 Hour. Syllabus covered upto T-1
2 T-2 25 1.5 Hours Syllabus covered upto T-2
3 T-3 35 2 Hours Entire Syllabus
Assignment (2) - 10
Entire
4 Teaching Assessment 25 Quizzes (2) - 10
Semester
Attendance - 5

Course Outcomes (COs) contribution to the Programme Outcomes(POs)

Course outcomes

CO-1 2 2 2 2 2 1 1 1 2 2 2 2
CO-2 2 3 3 3 3 1 1 1 2 2 1 2
CO-3 2 2 2 2 3 1 1 1 2 2 1 2
CO-4 2 3 3 3 2 1 1 1 2 3 2 2
CO-5 2 2 2 2 3 1 1 1 2 2 1 2
CO-6 2 3 3 3 2 1 1 1 2 3 2 2
Average

15
4. Digital Forensics Lab

COURSE CODE: XXXXXXXX

COURSE CREDITS: 2
CORE/ELECTIVE:
L-T-P: 2-0-2
Pre-requisite: Cryptography and Security, Computer Networks
Course Objectives:

1. To understand underlying principles and many of the techniques associated with the
digital forensic practices and cyber crime
2. To explore practical knowledge about ethical hacking Methodology.
3. To learn the importance of evidence handling and storage for various devices
4. To develop an excellent understanding of current cyber security issues (Computer
Security Incident) and analyzed the ways that exploits in securities.
5.
computer networks.
6. To apply digital forensic knowledge to use computer forensic tools and investigation
report writing

Course Outcomes:
Level of
S No Course Outcomes
Attainment
CO-1 Introduction to Cyber Crime and Ethical Hacking Familiarity
CO-2 Introduction to Digital Forensics and Digital Evidences Familiarity
CO-3 Computer Security Incident Response Methodology Assessment
CO-4 Forensic Duplication and Disk Analysis, and Investigation Data Analysis Assessment
CO-5 Network Forensics Incidents, Using Routers as Response Tools Usage
CO-6 Forensic Investigation Report and Forensic Tools Usage

Course Contents:

Labs
Unit Contents
required
Use a Web Search Engine, and search for companies specializing in
1 computer forensics. Select three and write a two-to-three paper comparing 1
what each company does.
Search the internet for articles on computer crime prosecutions. Find at least
2 two. Write one or two pages summarizing the two articles and identify key 1
features of the decisions you find in your search.
3 Using search engine, search for various computer forensics tools. 1
Preparing and processing of investigations. Try to examine and identify the
4 1
evidences from the drives.
5 Extracting of files that have been deleted. 1

16
Illustrate any data acquisition method and validate. Use an open source data
6 1
acquisition tool.
-mail
about a serious assault for which a police report needs to be filed. What
7 1
should you do? Write a two page paper specifying who in your company
you need to talk to first and what evidence must be turned over to police.
Create a file on a USB drive and calculate its hash value using FTK Imager.
8 1
Change the file and calculate the hash value again to compare the files.
Compare two files created in Microsoft office to determine whether the files
9 1
are different at the hexadecimal level. Keep a log of what you find.
10 Illustrate the analysis of forensics data. 1
11 Illustrate the validating of forensics data. 1
12 Locate and extract (JPEG) files with altered extensions. 1
13 Examine an E-mail message. 1
14 Investigate an E-mail message. 1
Total labs 14

Suggested Text Book(s):

Learning.
Suggested Reference Book(s):
Brian Carrier , "File System Forensic Analysis" , Addison Wesley, 2005
Dan Farmer & Wietse Venema ,"Forensic Discovery", Addison Wesley, 2005

Press, 2011
Chris Pogue, Cory Altheide, Todd Haverkos ,Unix and Linux Forensic Analysis DVD
ToolKit, Syngress Inc. , 2008
5.Harlan Carvey ,Windows Forensic Analysis DVD Toolkit, Edition 2, Syngress Inc. ,
2009
Harlan Carvey ,Windows Registry Forensics: Advanced Digital Forensic Analysis of
the Windows
Registry , Syngress Inc, Feb 2011
Eoghan Casey, Handbook of Digital Forensics and Investigation, Academic Press, 2009
M Sonka, V Hlavac and R Boyle, Image Processing, Analysis and Machine Vision,
PWS
Pratt.W.K., Digital Image Processing, John Wiley and Sons, New York, 1978

Evaluation Scheme:
S No Exam Marks Duration Coverage / Scope of Examination
1 P-1 20 2 Hour. Syllabus covered upto P-1
2 P-2 20 2 Hours Syllabus covered upto P-2
3. T-3 60 CA-30, LR-15, Attendance and Discipline-15

17
Course Outcomes (COs) contribution to the Programme Outcomes(POs)

Course
outcomes

CO-1 2 2 2 2 2 1 1 1 2 2 2 2
CO-2 2 3 3 3 3 1 1 1 2 2 1 2
CO-3 2 2 2 2 3 1 1 1 2 2 1 2
CO-4 2 3 3 3 2 1 1 1 2 3 2 2
CO-5 2 2 2 2 3 1 1 1 2 2 1 2
CO-6 2 3 3 3 2 1 1 1 2 3 2 2
Average

18
5. Foundation on Data Science and Visualization

COURSE CODE: XXXXXXXX

COURSE CREDITS: 2
CORE/ELECTIVE:
L-T-P: 2-0-0

Pre-requisite: Basic knowledge of high school mathematics and reasonable programming

experience.

Course Objectives:
Asking the correct questions and analyzing the raw data.
Modeling the data using various complex and efficient algorithms.
Visualizing the data to get a better perspective.
Understanding the data to make better decisions and finding the final result.

Course Outcomes:
Level of
S No Course Outcomes
Attainment
CO-1 Understanding the basics of data science Familiarity
Using versatile and flexible languages (Python and R programming) for
CO-2 Usage
supporting data science
Using data processing for collecting and manipulating the data into
CO-3 Usage
usable and desired form
Using data visualization to easily access the huge amount of data in
CO-4 Usage
visuals
Using statistics to collect and analyze the numerical data in a large
CO-5 Usage
amount and finding meaningful insights from i
Understanding linear algebra to represent, model, synthesize, and
CO-6 Usage
summarize the complex data

Course Contents:

Lectures
Unit Contents
required
Data Science an Introduction: Computer Science, Data Science, and
Real Science, What is Data Science? Need for Data Science, Data Science
1 2
Components, Tools for Data Science, Data Science Lifecycle,
Applications of Data Science

19
Python and R Programming for Data Science for Data Science:
Introduction to Python Programming (Python Basics, Python Data
Structures, Python Programming Fundamentals, Working with Data in
2 Python, Working with NumPy, Pandas, SciPy, and Matplotlib). 6
Introduction to R Programming (R basics, Data structures in R, R
Programming fundamentals, Working with Data in R, Stings and Dates in
R, )
Data Processing: Data Operations, Data cleansing, Processing CSV Data,
Processing JSON Data, Processing XLS Data, Relational databases,
3 NoSQL Databases, Date and Time, Data Wrangling, Data Aggregation, 6
Reading HTML Pages, Processing Unstructured Data, Word tokenization,
Stemming and Lemmatization
Statistical Data Analysis: Measuring Central Tendency, Measuring
Variance, Normal Distribution, Binomial Distribution, Poisson
4 6
Distribution, Bernoulli Distribution, P-Value, Correlation, Chi-square
Test, Linear Regression
Linear Algebra: Visualizing Matrix Operations (Matrix Addition, Matrix
Multiplication, Applications of Matrix Multiplication, Identity Matrices
and Inversion, Matrix Inversion and Linear Systems, Matrix Rank)
5 Factoring Matrices (Why Factor Feature Matrices, LU Decomposition and 6
Determinants), Eigen values and Eigenvectors (Properties of Eigen
values, Computing Eigen values), Eigen value Decomposition (Singular
Value Decomposition, Principal Components Analysis)
Data Visualization: Chart Properties, Chart Styling, Box Plots, Heat
6 Maps, Scatter Plots, Bubble Charts, 3D Charts, Time Series, Geographical 6
Data, Graph Data
Total lectures 32

Suggested Text Book(s):

Data Science from Scratch by Joel Grus
Data Science for Dummies by Lillian Pierson and Jake Porway
An Introduction to Statistical Learning by Gareth James , Daniela Witten , et al.

Reference Book(s):
An Introduction to Probability and Statistics by V.K. Rohatgi & A.K. Md. E. Saleh,
Wiley, (2008), 3rd ed.
Introduction to Probability Theory and Statistical Inference by H.J. Larson, John
Wiley & Sons, (2005) 3rd ed.

Other useful resource(s):

https://nptel.ac.in/courses/110/106/110106064/
https://onlinecourses.nptel.ac.in/noc18_cs28/pr
eview

20
Evaluation Scheme:
S No Exam Marks Duration Coverage / Scope of Examination
1 T-1 15 1 Hour. Syllabus covered upto T-1
2 T-2 25 1.5 Hours Syllabus covered upto T-2
3 T-3 35 2 Hours Entire Syllabus
Assignment (2) - 10
Teaching
4 25 Entire Semester Quizzes (2) - 10
Assessment
Attendance - 5

Course Outcomes (COs) contribution to the Programme Outcomes (POs)

Course
outcomes
(Parallel and
Distributed
Algorithms )
CO-1 2 2 2 3 2 1 1 1 3 2 2 1 1.8
CO-2 3 3 3 3 3 1 1 2 2 2 1 1 2.1
CO-3 2 2 2 2 1 1 2 2 2 2 1 2 1.8
CO-4 3 3 3 3 2 1 1 3 2 3 3 2 2.4
CO-5 3 2 3 3 1 1 2 1 1 3 2 1 1.9
CO-6 2 2 1 2 2 2 3 2 1 2 3 1 1.9
Average 2.5 2.3 2.3 2.7 1.8 1.2 1.7 1.8 1.8 2.3 2 1.3

21
6. Foundation on Data Science and Visualization Lab
COURSE CODE: XXX
COURSE CREDITS: 1
CORE/ELECTIVE:
L-T-P: 0-0-2
Pre-requisite: Python/ R Programming and Machine Learning
Course Objectives:
Asking the correct questions and analyzing the raw data.
Modeling the data using various complex and efficient algorithms.
Visualizing the data to get a better perspective.
Understanding the data to make better decisions and finding the final result.

Course Outcomes:
Level of
S No Course Outcomes
Attainment
CO-1 Understanding the basics of data science Familiarity
Using versatile and flexible languages (Python and R programming) for
CO-2 Usage
supporting data science
Using data processing for collecting and manipulating the data into
CO-3 Usage
usable and desired form
Using statistics to collect and analyze the numerical data in a large
CO-4 Usage
amount and finding meaningful insights from i
Understanding linear algebra to represent, model, synthesize, and
CO-5 Usage
summarize the complex data
Using data visualization to easily access the huge amount of data in
CO-6 Usage
visuals

List of Experiments

S No Description Hours
Write a Python/R program to create a vector of a specified type and length.
Create vector of numeric, complex, logical and character types of length 6.
Write a Python/R program to add two vectors of integer type and length 3.
1 Write a Python/R program to create a list containing a vector, a matrix and 2
a list and remove the second element
Write a Python/R program to create a list containing a vector, a matrix and
a list and update the last element.
Write Python/R programs to solve the following tasks in both of them.
Read numbers from a file, and print them out in sorted order.
2 Read a text file, and count the total number of words. 2
Read a text file, and count the total number of distinct words.
Read a file of numbers, and plot a frequency histogram of them
Statistical Data Analysis
3 Write a program to solve linear regression for a given data set. 2
Y = ax + b

22
where
2 2

-
Here
Y: response variable
X: predicator variable
a, b: regression coefficients
Read data set
X Y
-2 -1
1 1
3 2
Statistical Data Analysis
Solve the linear regression for given data set, and also predict sales in the year
2012.
Year Sales
4 2005 12 2
2006 19
2007 29
2008 37
2009 45
Statistical Data Analysis
Compute Logistic Regression for Organization dataset.
Response Variables
Y = Compensation in rupees
Prediction Variables
X1 = Experience in years
X2 = Education in years (after 10th standard)
X3 = Number of Employees Supervised
X4 = Number of Projects Handled

S Compensation Experience Education Number Projects

No supervised
1 1500 2 5 4 10
5 2
2 1650 3 6 5 10
3 1750 3 3 5 12
4 1400 2 3 3 9
5 2000 4 4 6 15
6 2200 5 6 6 14
7 2100 1 5 4 12
8 2750 5 8 7 15
9 2900 8 9 8 25
10 1100 3 3 2 7
11 1000 4 2 1 5
12 1350 6 4 4 12
13 1550 4 6 4 11

Here you will get an error as y- value must be 0 < 1. So modify Y

23
values.
Statistical Data Analysis
In an entrance examination there are twenty multiple choice questions.
Each question has four options, and only one of them is correct. Find the
probability of having seven or less than seven correct answers if a student
6 2
attempts to answer every question at random.
Let us assume that the test scores an entrance exam fits a normal
distribution where the mean test score is 67, and the standard deviation is
13.7. Calculate the percentage of students scoring 80 or more in the exam?
Mid-Semester Lab Examination 2
Linear Algebra
Compare the speed of a library function for matrix multiplication to your own
implementation of the nested loops algorithm.
How much faster is the library on products of random n × n matrices, as a
7 function of n as n gets large? 2
What about the product of an n × m and m × n matrix, where n × m?
By how much do you improve the performance of your implementation to
calculate C = A × B by first transposing B internally, so all dot products are
computed along rows of the matrices to improve cache performance?
Linear Algebra
Implement Gaussian elimination for solving systems of equations, C × X = Y.
Compare your implementation against a popular library routine for:
Speed: How does the run time compare, for both dense and sparse
coefficient matrices?
8 2
Accuracy: What are the size of the numerical residuals CX Y, particularly
as the condition number of the matrix increases.
Stability: Does your program crash on a singular matrix? What about
almost singular matrices, created by adding a little random noise to a
singular matrix?
Data Visualization
Construct a revealing visualization of some aspect of your favorite data set,
using:
A well-designed table.
A dot and/or line plot.
9 2
A scatter plot.
A heatmap.
A bar plot or pie chart.
A histogram.
A data map.
Data Visualization
10 Create ten different versions of line charts for a particular set of (x, y) points. 2
Which ones are best and which ones worst? Explain why.
Data Visualization
11 Construct scatter plots for sets of 10, 100, 1000, and 10,000 points. Experiment 2
with the point size to find the most revealing value for each data set.

24
Data Visualization
Experiment with different color scales to construct scatter plots for a particular
12 2
set of (x, y, z) points, where color is used to represent the z dimension. Which
color schemes work best? Which are the worst? Explain why.
End-Semester Lab Examination 2
Total Lab hours 28

Suggested Text Books:

Python Data Science Hand Book Jake VanderPlas

Mastering Python for Data Science - by Samir Madhavan.
R Programming for Data Science by Roger D. Peng

Reference Books:

Python Data Science: Hands on Learning for Beginners Kindle Edition by Travis
Booth 
Data Science with R: A Step By Step Guide with Visual Illustrations & Examples by
Andrew Oleksy
R for Data Science: Import, Tidy, Transform, Visualize, and Model Data by Hadley
Wickham (Author), Garrett Grolemund

Evaluation Scheme:
1 Mid Sem. Evaluation 20 Marks
2 End Sem. Evaluation 20 Marks
3 Project-1 10 Marks
4 Lab Assessment 45 Marks
5 Lab Attendance 5 Marks
Total 100 marks

Course Outcomes (COs) contribution to the Programme Outcomes (POs)

Course
outcomes
(Parallel and
Distributed
Algorithms )
CO-1 2 2 2 3 2 1 1 1 3 2 2 1 1.8
CO-2 3 3 3 3 3 1 1 2 2 2 1 1 2.1
CO-3 2 2 2 2 1 1 2 2 2 2 1 2 1.8
CO-4 3 3 3 3 2 1 1 3 2 3 3 2 2.4
CO-5 3 2 3 3 1 1 2 1 1 3 2 1 1.9
CO-6 2 2 1 2 2 2 3 2 1 2 3 1 1.9
Average 2.5 2.3 2.3 2.7 1.8 1.2 1.7 1.8 1.8 2.3 2 1.3

25
7. Computational Data Analysis

COURSE CODE: XXXXXXXX

COURSE CREDITS: 2
CORE/ELECTIVE: Elective
L-T-P: 2-0-2
Pre-requisite: Basics of probability and statistics
Course Objectives:

1. To provide students with foundational knowledge of topics such as probability and

statistics and algorithms to solve data analysis problems arising in practical
applications,
2. To enable students to effectively apply computational methods to solve exemplar data
analysis problems arising in relevant applications.
3. Have a good understanding of the fundamental issues and challenges of machine
learning.
4. Have an understanding of the strengths and weaknesses of many popular machine
learning approaches.
5. Be able to design and implement various machine learning algorithms in a range of
real-world applications.

Course Outcomes:
Level of
S No Course Outcomes
Attainment
To learn the basic concepts and terminology in statistics used in machine
CO-1 Familiarity
learning
To understand the concepts associated with classification and
CO-2 Familiarity
experimental evaluation of classification algorithms
CO-3 To learn about clustering and unsupervised learning Assessment
To learn about various techniques for selecting relevant features
CO-4 Assessment
selection.
To learn about various techniques for enhancing the performance of basic
CO-5 Usage
machine learning algorithms.

Course Contents:

Lectures
Unit Contents
required
Supervised Learning, Discriminative Algorithms:
Supervised Learning Concept, Linear Regression, Maximum Likelihood,
1 6
Normal Equation, Gradient Descent, Stochastic Gradient, SVRG. Linear
Classification, Logistic Regression.
2 Generative Algorithms: 6

26
Multivariate Normal, Linear Discriminant Analysis, Naive Bayes,
Laplacian Smoothing, Multiclass Classification, K-NN
Multi-class Fisher Discriminant Analysis, Multinomial Regression
Support Vector Machines and Kernel Methods: Intuition, Geometric
Margins, Optimal Margin Classifier, Multiclass SVM
Unsupervised Learning:
3 5
EM Algorithm, DBSCAN, k-means, Hierarchical clustering
Regularization, Model Selection and Optimization:
Cross Validation, Bayesian Optimization
Bayesian Regression, Bayesian Logistic Regression
4 6
Forward and Backward Regression, Lasso, elastic-net.
Proximal Gradient, Prox-SVRG.
Coordinate Proximal Gradient, Pathwise Coordinate Descent
Feature Selection:
5 4
Information Gain, Correlation Coefficient, Chi-square test, PCA
Ensemble Learning:
Bagging, Boosting, Stacking,
6 5
Entropy, Building Tree, Bagging features, Bagging Samples, Random
Forest, Adaboost, Gradient Tree Boosting
Total lectures 32

Suggested Text Book(s):

Introduction to Machine Learning Edition 2, by Ethem Alpaydin.

T. Hastie, R. Tibshirani, & J. H. Fried

Suggested Reference Book(s):

The Elements of Statistical Learning, 2nd Edition, Hastie, Tibshirani and Friedman.
Foundations of Machine Learning, Mohri, Rostamizadeh and Talwalker

Wiley Asia, 2006

Other useful resource(s):

Link to NPTEL course contents: https://nptel.ac.in/courses/106106139/

https://nptel.ac.in/courses/110106064/

Evaluation Scheme:

S No Exam Marks Duration Coverage / Scope of Examination

1 T-1 15 1 Hour. Syllabus covered upto T-1
2 T-2 25 1.5 Hours Syllabus covered upto T-2

27
3 T-3 35 2 Hours Entire Syllabus
Assignment (2) - 10
Teaching Entire
4 25 Quizzes (2) - 10
Assessment Semester
Attendance - 5

Course Outcomes (COs) contribution to the Programme Outcomes (POs)

Course outcomes
(Computational
Data Analysis )
CO-1 2 2 2 2 2 1 1 1 2 2 2 2
CO-2 2 3 3 3 3 1 1 1 2 2 1 2
CO-3 2 2 2 2 3 1 1 1 2 2 1 2
CO-4 2 3 3 3 2 1 1 1 2 3 2 2
CO-5 1 2 2 1 3 2 1 1 1 1 1 1
Average

28
8. Computational Data Analysis Lab

COURSE CODE: XXXXXXXX

COURSE CREDITS: 1
CORE/ELECTIVE: ELECTIVE
L-T-P: 0-0-2
Pre-requisite: Python Programming Language
Course Objectives:

1. To develop students' skill in software development techniques using one or more high
level programming languages relevant to data analytics.
2. To enable students to effectively apply computational methods to solve exemplar data
analysis problems arising in relevant applications.
3. To learn the implementation of classification techniques for any dataset.
4. To conduct experiments for clustering techniques for any dataset.
5. To discuss different classification and clustering algorithms based on the analysis of
results obtained from experimental evaluation.

Course Outcomes:
S No Course Outcomes Level of
Attainment
To learn and implement the basic concepts and terminology in
CO1 Usage
statistics used in machine learning
CO2 To implement classification and clustering algorithms in python Usage
CO3 To implement feature selection methods in Python Usage
CO4 To compare different algorithms based on some common factors Assessment

List of Experiments

S No Description Hours
Visualize data using any plotting framework
How to upload a dataset
How to retrieve rows and data in the dataset
1 2
How to delete certain column in the dataset
How to display minimum, maximum value of a particular feature
How to display certain rows of dataset
Visualize data using any plotting framework
How to display certain rows of dataset
How to insert a new row at particular index
2 2
Visualization of the dataset (scatterplot, histogram)
To find the sum of null values in each column
Extracting certain columns

29
Implement SVM using different kernel methods like Gaussian Radial Basis
3 Function (RBF), Laplace RBF kernel, ANOVA Radial Basis kernel, 2
Polynomial Kernel.
Implement Naïve Bayes using Bernoulli model and Multinomial model
4 2
(Laplace smoothing and Log-Transformation).
5 Implement K-NN and DT 2
6 Implement Linear regression and Logistic regression 2
Implement the following clustering techniques:
7 2
K-means, Hierarchical,
Implement the following clustering techniques:
8 2
DBSCAN, EM Algorithm
Implement various feature selection methods
9 Information Gain 2
Correlation Coefficient
Implement various feature selection methods
10 Chi-square test 2
PCA
Implement the following ensemble techniques:
11 2
XGBoost, AdaBoost
Implement the following ensemble techniques:
12 2
Gradient Boosting, Bagging
Total Lab hours 24

Suggested/Resources:

O'Reilly Media, Inc.

Ltd.
Link to topics related to course:
https://www.python-course.eu/machine_learning.php
https://www.analyticsvidhya.com/blog/2018/05/24-ultimate-data-science-projects-to-
boost-your knowledge-and-skills/
https://www.datacamp.com/

30
Evaluation Scheme:
1 Mid Sem. Evaluation 20 Marks
2 End Sem. Evaluation 20 Marks
3 Attendance 10 Marks
4 Project 20 Marks
5 Lab Assessment 30 Marks
Total 100 marks

Course Outcomes (COs) contribution to the Programme Outcomes (POs)

PO PO PO
CO/PO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 Average
10 11 12
CO-1 3 2 2 2 3 1 1 1 1 1 2 2 1.8
CO-2 3 3 3 3 3 2 1 2 2 1 2 3 2.3
CO-3 3 3 2 3 3 2 1 2 2 1 2 3 2.3
CO-4 3 3 3 3 3 2 1 2 2 1 2 3 2.3
Average 3 2.8 2.5 2.8 3 1.8 1 1.8 1.8 1 2 2.8

31
9. Big Data and Hadoop
COURSE CODE: XXXXXXXX
COURSE CREDITS: 2
CORE/ELECTIVE: Elective
L-T-P: 3-0-1
Pre-requisite: None
Course Objectives:

1. Understand fundamentals of Concepts in BigData and Hadoop etc

2. Understand fundamentals of Hadoop etc.
3. Be able to use the HDFS file system, debug and run simple Java programs for hdfs.
4. Be aware of the important topics and principles of software development and write
better &more maintainable code
5. Be able to program using advanced Java topic like JDBC, Servlets and JSP.

Course Outcomes:
Level of
S No Course Outcomes
Attainment
What is big data: introduction to data lake, why do companies
CO-1 Familiarity
care for big data, why do we out of big data, social media
History of hadoop, importance of HDFS: Hadoop timeline, why
CO-2 hadoop, hadoop 1.x architecture, core components and job Assessment
process
Different phases in Map Reduce: input-output formats in each
phase, modeling real world applications in map reduce,
CO-3 Assessment
understanding map reduce program execution, problems in map
reduce
Apache HIVE, Apache PIG: introduction to Hive meta store,
SQL vs Hive, Hive query language, managed and external
CO-4 Usage
tables, querying data, introduction to PIG, map reduce vs PIG,
PIG in local mode, PIG in map reduce mode
SQOOP: Introduction to SQOOP framework, SQOOP flavors
CO-5 Usage
of import, SQOOP flavors of export, SQOOP CLI options
FLUME: Introduction to messaging service, applications of a
messaging service, FLUME architecture framework, working
of a FLUME agent, understanding FLUME configurations,
CO-6 Assessment
Hadoop ecosystem labs, importing data from MYSQL and
querying it using HIVE, configuring FLUME agent to listen to
local log files

32
Course Contents:

Lectures
Unit Contents
required
What is big data: introduction to data lake, why do companies care for
1 5
big data, why do we out of big data, social media
History of hadoop, importance of HDFS: Hadoop timeline, why
2 5
hadoop, hadoop 1.x architecture, core components and job process
Different phases in Map Reduce: input-output formats in each phase,
3 modeling real world applications in map reduce, understanding map 6
reduce program execution, problems in map reduce
Apache HIVE, Apache PIG: introduction to Hive meta store, SQL vs
Hive, Hive query language, managed and external tables, querying
4 5
data, introduction to PIG, map reduce vs PIG, PIG in local mode, PIG
in map reduce mode
SQOOP: Introduction to SQOOP framework, SQOOP flavors of
5 6
import, SQOOP flavors of export, SQOOP CLI options
FLUME: Introduction to messaging service, applications of a
messaging service, FLUME architecture framework, working of a
6 FLUME agent, understanding FLUME configurations, Hadoop 5
ecosystem labs, importing data from MYSQL and querying it using
HIVE, configuring FLUME agent to listen to local log files
Total lectures 32

Suggested Text Book(s):

Big Data and Hadoop, V.K. Jain
(https://books.google.co.in/books?id=i6NODQAAQBAJ&printsec=frontcover&redir_
esc=y#v=onepage&q&f=false) .
Big Data and Hadoop, MAYANK BHUSHAN.

Other useful resource(s):

https://www.youtube.com/watch?v=1vbXmCrkT3Y

Evaluation Scheme:
S. No Exam Marks Duration Coverage / Scope of
Examination
1 T-1 15 1 Hour. Syllabus covered upto T-1
2 T-2 25 1.5 Hours Syllabus covered upto T-2
3. T-3 35 2 Hours Entire Syllabus
4. Teaching Assessment 25 Entire Semester Assignment (2) - 10
Quizzes (2) - 10
Attendance - 5

33
Course Outcomes (COs) contribution to the Programme Outcomes (POs)

Course outcomes
(Parallel and
Distributed
Algorithms )
CO-1 2 2 2 2 2 1 1 1 2 2 2 2 1.8
CO-2 2 3 3 3 3 1 1 1 2 2 1 2 2
CO-3 2 2 2 2 3 1 1 1 2 2 1 2 1.8
CO-4 2 3 3 3 2 1 1 1 2 3 2 2 2.1
CO-5 2 3 1 1 2 3 2 1 2 3 3 2 2.1
CO-6 2 3 3 2 1 3 2 2 3 3 2 2 2.3
Average 2 2.7 2.3 2.2 2.2 1.7 1.3 1.2 2.2 2.5 1.8 2 2

34
10. Big Data and Hadoop Lab
COURSE CODE: XXXXXXXX
COURSE CREDITS: 1
CORE/ELECTIVE: ELECTIVE
L-T-P: 0-0-2

Pre-requisites
An understanding in practicalities of big data and hadoop to any programming language
(Preferably, C)
Course Objective
The lab course provides the complete description about inner working of a big data and
hadoop. The main focus is on the design of big data techniques. The course also aims to
convey the language specifications, use of file management tasks and map reduce behind the
design of algorithms. It builds an understand ability of various techniques like map reduce, pig
latin scripts etc.
Course Outcomes (COs)

Level of
S No Course outcomes ( Compiler Design) (10B11CI612)
Attainment
Perform setting up and Installing Hadoop in various
CO-1 Familiarity
operating modes
CO-2 Implement of file management tasks in Hadoop Familiarity
CO-3 Running a Map Reduce Paradigm Computational skills
CO-4 Run Pig then write Pig Latin scripts Technical skills

Detailed Syllabus
This course studies the principles of programming languages with an emphasis on
programming language implementation and algorithmic techniques. This includes various
techniques for describing and defining a algorithms, language, as well as techniques for
implementing methods. The course is centered on a large programming project-the
construction of a complete algorithm for a small programming language-which will be
completed in this subject.

List of Practical

S No Topic No of Labs
Implement the following data structures in Java: Linked list, stacks,
1 1
queues, Set and Map
Perform setting up and Installing Hadoop in its three operating modes:
Standalone,
2 Pseudo distributed, 2
Fully distributed
Use web based tools to monitor your Hadoop setup.

35
Implement the following file management tasks in Hadoop:
Adding files and directories
Retrieving files
3 Deleting files 2
Hint: A typical Hadoop workflow creates data files (such as log files)
elsewhere and copies them into HDFS using one of the above command
line utilities.
Run a basic Word Count Map Reduce program to understand Map
4 2
Reduce Paradigm
Write a Map Reduce program that mines weather data.
Weather sensors collecting data every hour at many locations across the
5 globe gather a large volume of log data, which is a good candidate for 2
analysis with Map Reduce, since it is semi structured and record-
oriented
6 Implement Matrix Multiplication with Hadoop Map Reduce 1
Install and Run Pig then write Pig Latin scripts to sort, group, join,
8 2
project, and filter your data
Install and Run Hive then use Hive to create, alter, and drop databases,
9 2
tables, views, functions, and indexes
Total lab hrs 14

Evaluation Scheme

S No Exam Coverage/Scope of Examination Marks

1 Mid Term Test Viva and Written Exam 20
2 End Term Test Viva and Written Exam 20
3 Lab Records 15
(Quality and quantity of experiment
4 Teacher Assessment 30
performed, learning laboratory skills)
5 Attendance and discipline in lab 15
Total 100

Reference Books:

Big Data and Hadoop, V.K. Jain

Big Data and Hadoop, MAYANK BHUSHAN

36
Course Outcomes (COs) contribution to the Programme Outcomes (POs)

Course PO- PO- PO- PO- PO- PO- PO- PO- PO- PO- PO- PO-
Weightage
outcomes 1 2 3 4 5 6 7 8 9 10 11 12
CO-1 3 2 2 2 1 3 3 2 1 3 2 1 2.1
CO-2 3 3 2 2 1 3 3 1 3 3 3 1 2.3
CO-3 3 3 2 2 2 2 2 1 2 3 3 2 2.3
CO-4 3 3 3 2 2 2 3 2 2 1 2 2 2.3
CO-5 3 3 2 1 1 3 3 1 3 3 3 1 2.3
Weightage 3 2.8 2.2 1.8 1.4 2.6 2.8 1.4 2.2 2.6 2.6 1.4 2.2

37
11. Computability, Complexity and Algorithms

COURSE NAME: Computability, Complexity and Algorithms

COURSE CODE: XXXXXXXX
COURSE CREDITS: 3
CORE/ELECTIVE: Elective
L-T-P: 3-0-1
Pre-requisite: None
Course Objectives:

1. Learn to analyze algorithms for Time and Space Complexity

2. Learn asymptotic notations for performance analysis of algorithms.
3. Learn various computational and complexity of randomized algorithms.
4. Apply important algorithmic design paradigms and method of analysis.
5. Synthesize efficient mathematical induction and asymptotic notations.

Course Outcomes:
Level of
S No Course Outcomes
Attainment
CO-1 Introduction of algorithms Familiarity
Demonstrate a familiarity with major topics of algorithm
CO-2 Assessment
analysis.
CO-3 Introduction of computability theory. Assessment
CO-4 Analysis of time complexity of randomized algorithms. Usage
CO-5 An introduction of probability and randomized algorithms Usage
A brief description of probability, mathematical induction and
CO-6 Assessment
asymptotic notations

Course Contents:

Lectures
Unit Contents
required
Introduction to algorithm analysis: Basic introduction of
1 algorithms, divide and conquer paradigm, Asymptotic notations, 7
Probabilistic and randomized algorithms.
Advanced algorithm I: Dynamic programming, Greedy algorithms,
2 7
and amortized analysis.
Advanced topics in algorithms II: Graph algorithm, flow in
3 6
Computability Theory: Turing machines, decidability, mapping
4 6
reducibility
Complexity Theory: Introduction to time complexity, NP and NP
5 7
completeness, Approximation algorithms and de randomization..
Probabilistic and Randomized Algorithms: Probabilistic
6 6
algorithms; Randomizing deterministic algorithms, Monte Carlo and

38
Las Vegas algorithms; Probabilistic numeric
Algorithms.
Supplementary material: Mathematical induction, asymptotic
7 3
notations and probability
Total lectures 42

Suggested Text Book(s):

V. J. Rayward-Smith, A first course in computability, McGraw Hill, 1995? An
introductory paperback that covers Parts I and III of the course, and some of Part II.
More detailed than this course.

D. Harel, The Science of Computing, Addison-Wesley, 1989. A good book for

background and motivation, with fair coverage of this course and a great deal more.
Some may find the style diffuse. Less detailed than this course

Suggested Reference Book(s):

Robert Sedgewick, Algorithms, Addison-Wesley, 2nd ed., 1988. A practical guide to
many useful algorithms and their implementation. A reference for Part II of the course.
J. Bell, M. Machover, A course in mathematical logic, North Holland, 1977. A good
mathematical text, for those who wish to read beyond the course.
G. Boolos, R. Jeffrey, Computability and Logic, Cambridge University Press, 1974

Other useful resource(s):

youtube.com/playlist?list=PLLkyyG3XCR1mCH_XAWGdm9u4h_VTIRYC-

Evaluation Scheme:
Coverage / Scope of
S No Exam Marks Duration
Examination
1 T-1 15 1 Hour. Syllabus covered upto T-1
2 T-2 25 1.5 Hours Syllabus covered upto T-2
3 T-3 35 2 Hours Entire Syllabus
Assignment (2) - 10
Teaching
4 25 Entire Semester Quizzes (2) - 10
Assessment
Attendance - 5

39
Course Outcomes (COs) contribution to the Programme Outcomes (POs)

Course outcomes
(Parallel and
Distributed
Algorithms )
CO-1 2 2 2 2 2 1 1 1 2 2 2 2
CO-2 2 3 3 3 3 1 1 1 2 2 1 2
CO-3 2 2 2 2 3 1 1 1 2 2 1 2
CO-4 2 3 3 3 2 1 1 1 2 3 2 2
CO-5 2 3 1 1 2 3 2 1 2 3 3 2
CO-6 2 3 3 2 1 3 2 2 3 3 2 2
Average

Course Outcomes (COs) contribution to PSOs

Attainment of PSOs through COs

Sr. No. PSO-1 PSO-2 PSO-3 PSO-4 Weightage
CO-1 H M M L
CO-2 H H M M
CO-3 H M H M
CO-4 H H M H
CO-5 H M M L
CO-6 H M L M
Average Score

40
12. Computability, Complexity and Algorithms Lab

Course Code: XXXXXXX

Course Title: Computability, Complexity and Algorithms Lab
Course Credits: 01
Semester: VIIIth Semester

Pre-requisites
An understanding in practicalities of Computability, Complexity and Algorithms to any
programming language (Preferably, C)

Course Objective
The lab course provides the complete description about inner working of a complexity and
algorithms. The main focus is on the design of algorithms and computational techniques. The
course also aims to convey the language specifications, use of regular expressions and
computations behind the design of algorithms. It builds an understand ability of various
algorithmic techniques like dynamic programming, greedy algorithms and complexity theory.

Course Outcome (CO)

Level of
S No Course outcomes ( Compiler Design) (10B11CI612)
Attainment
CO-1 Construction of dynamic and greedy algorithms Familiarity
Analyzing the time complexity of graph, dynamic and greedy
CO-2 Familiarity
methods
Computational
CO-3 Construction of minimization of automata
skills
CO-4 Building various probabilistic techniques Technical skills

Detailed Syllabus

This course studies the principles of programming languages with an emphasis on

programming language implementation and algorithmic techniques. This includes various
techniques for describing and defining a algorithms, language, as well as techniques for
implementing methods. The course is centered on a large programming project-the
construction of a complete algorithm for a small programming language-which will be
completed in this subject. Topics to be covered in this subject include: dynamic programming,
greedy algorithms and complexity theory.

List of Practical

S. No Topic No of Labs
Write a program to read and translate integers into numbers. e.g.
1 1=ONE, 12 = ONE TWO and 856 = EIGHT FIVE SIX 1
Generate an error if the number of digits is more than 3

41
2 Write a program to convert infix notation to postfix notation. 1
3 Implement a DFA which simulates the regular expression a + (aa)*b. 2
4 Write a program to implement minimization of finite automata
5 Implementation of greedy algorithms 1
6 Implementation of dynamic programming algorithms
7 Program for computation of computability and complexity theory. 1
Write a program to check advanced algorithms like dynamic
8 1
programming, greedy algorithm.
9 Implementation of approximation algorithm 2
10 Implementation of randomized algorithm 1
Total lab hrs 13

Evaluation Scheme
S No Exam Coverage/Scope of Examination Marks
1 Mid Term Test Viva and Written Exam 20
2 End Term Test Viva and Written Exam 20
3 Lab Records 15
Teacher Assessment (Quality and quantity of experiment performed,
4 30
learning laboratory skills)
Attendance and
5 15
discipline in lab
6 Total 100

BOOKS

V. J. Rayward-Smith, A first course in computability, McGraw Hill, 1995? An

introductory paperback that covers Parts I and III of the course, and some of Part II.
More detailed than this course.

D. Harel, The Science of Computing, Addison-Wesley, 1989. A good book for

background and motivation, with fair coverage of this course and a great deal more.
Some may find the style diffuse. Less detailed than this course

Course Outcomes (COs) contribution to the Programme Outcomes (POs)

Course PO- PO- PO- PO- PO- PO- PO- PO- PO- PO- PO- PO-
Weightage
outcomes 1 2 3 4 5 6 7 8 9 10 11 12
CO-1 H M M L M H H M L H M L
CO-2 H H M L L H H L H H H L
CO-3 H H M L M M M L M H H M
CO-4 H H H M M M H M M L M M
CO-5 H H M L L H H L H H H L
Weightage

42
Course Outcomes (COs) contribution to PSOs

Attainment of PSOs through COs

Sr. No. PSO-1 PSO-2 PSO-3 PSO-4 Weightage
CO-1 H M M L
CO-2 H H M M
CO-3 H M H M
CO-4 H H M H
CO-5 H M M L
CO-6 H M L M
Average Score

43
13. Computer and Robot Vision

Course Name: Computer and Robot Vision

Course Code: XXXXX
Course Credits: 3 (3-0-0)
Branch and Semester: CSE/ IT VI Semester
Session: July-Dec 2020
Faculty: XXXXX

Pre-requisite: Image Processing and Robotics

Description & Rationale:
This course aims at applying the knowledge from the disciplines of computer vision and robot
vision. The main target of computer vision is the 3-D world. As most computer vision
algorithms require some form of image processing. Robot vision is to program a robot to "see"
through a camera either mounted on the robot, or in a static position, takes pictures of each
work piece that the robot will interact with. This course integrates the two disciplines to
achieve a significant purpose.
Course Objectives:
1. To learn fundamental image processing techniques required for computer vision.
2. To learn shape analysis and boundary tracking.
3. To learn and apply chain codes and other region descriptors..
4. To learn and apply Hough Transform for line, circle, and ellipse detections.
5. To learn and apply 3D vision techniques, implement motion related techniques, and
Develop applications using computer vision techniques.

Course outcomes:

Level of
S No Course outcomes
Attainment
Implement fundamental image processing techniques required for
CO-1 Familiarity
computer vision
CO-2 Perform shape analysis and implement boundary tracking techniques Usage
CO-3 Apply chain codes and other region descriptors. Usage
CO-4 Apply Hough Transform for line, circle, and ellipse detections Usage
Apply 3D vision techniques, implement motion related techniques,
CO-5 Usage
and Develop applications using computer vision techniques

44
Detailed Course Contents:

Module Contents Lectures

required
Module 1 CAMERAS: Pinhole Cameras, Radiometry Measuring Light: 8
Light in Space, Light Surfaces, Important Special Cases, Sources,
Shadows, And Shading: Qualitative Radiometry, Sources and Their
Effects, Local Shading Models, Application: Photometric Stereo,
Interreflections: Global Shading Models, Color: The Physics of
Color, Human Color Perception, Representing Color, A Model for
Image Color, Surface Color from Image Color.
Module 2 Linear Filters: Linear Filters and Convolution, Shift Invariant 8
Linear Systems, Spatial Frequency and Fourier Transforms,
Sampling and Aliasing, Filters as Templates, Edge Detection: Noise,
Estimating Derivatives, Detecting Edges, Texture: Representing
Texture, Analysis (and Synthesis) Using Oriented Pyramids,
Application: Synthesis by Sampling Local Models, Shape from
Texture.
Module 3 The Geometry of Multiple Views: Two Views, Stereopsis: 8
Reconstruction, Human Stereposis, Binocular Fusion, Using More
Cameras, Segmentation by Clustering: What Is Segmentation?,
Human Vision: Grouping and Getstalt, Applications: Shot Boundary
Detection and Background Subtraction, Image Segmentation by
Clustering Pixels, Segmentation by Graph-Theoretic Clustering,
Module 4 Segmentation by Fitting a Model: The Hough Transform, Fitting 8
Lines, Fitting Curves, Fitting as a Probabilistic Inference Problem,
Robustness, Segmentation and Fitting Using Probabilistic
Methods: Missing Data Problems, Fitting, and Segmentation, The
EM Algorithm in Practice, Tracking With Linear Dynamic
Models: Tracking as an Abstract Inference Problem, Linear Dynamic
Models, Kalman Filtering, Data Association, Applications and
Examples.
Module 5 Geometric Camera Models: Elements of Analytical Euclidean 8
Geometry, Camera Parameters and the Perspective Projection, Affine
Cameras and Affine Projection Equations, Geometric Camera
Calibration: Least-Squares Parameter Estimation, A Linear
Approach to Camera Calibration, Taking Radial Distortion into
Account, Analytical Photogrammetry, An Application: Mobile Robot
Localization, Model- Based Vision: Initial Assumptions, Obtaining
Hypotheses by Pose Consistency, Obtaining Hypotheses by pose
Clustering, Obtaining Hypotheses Using Invariants, Verification,
Application: Registration In Medical Imaging Systems, Curved
Surfaces and Alignment.
TOTAL LECTURES 40

Evaluation Scheme:

45
S No Exam Marks Duration Coverage/Scope of Examination
1 Test -1 15 1 hr. Syllabus covered upto T- 1
2 Test -2 25 1 hr 30 min. Syllabus covered upto T- 2
3 Test - 3 35 2 hours Full Syllabus
Regularity, Regularity- 4
Entire
4 Assignments, 25 Assignments - 9
Semester
Quizzes. Quizzes - 12

Text Books:
David A. Forsyth and Jean Ponce: Computer Vision A Modern Approach, PHI
Learning (Indian Edition), 2009.
Reference Books:
E. R. Davies: Computer and Machine Vision Theory, Algorithms and Practicalities,
Elsevier (Academic Press), 4th edition, 2013.

Course Outcomes (COs) contribution to the Programme Outcomes (POs)

Level
of PO- PO- PO- PO- PO- PO- PO- PO- PO- PO- PO- PO-
COs Wtg
Attain 1 2 3 4 5 6 7 8 9 10 11 12
ment
Assess 91.67
CO-1 H H H H M H H M H M H H
ment %
Assess 91.67
CO-2 H H H H M H H M H M H H
ment %
Assess 91.67
CO-3 H H H H M H H M H M H H
ment %
Assess 91.67
CO-4 H H H H M H H M H M H H
ment %
Assess 91.67
CO-5 H H H H M H H M H M H H
ment %
88.89
CO-6 Usage H M M H H H H M H M H H
%
100 94.4 94.4 100 72.2 100 100 66.7 100 66.7 100 100
Wtg
% % % % % % % % % % % %

46
14. Computer and Robot Vision Lab

Course Name: Computer and Robot Vision Lab

Course Code: xxx
Course Credits: 01
Course Co-ordinator: xxx
Pre-requisites: Image Processing and Artificial Intelligence

Objective: The main target of computer vision is the 3-D world. As most computer vision
algorithms require some form of image processing. Robot vision is to program a robot to "see"
through a camera either mounted on the robot, or in a static position, takes pictures of each
work piece that the robot will interact with. This course integrates the two disciplines to
achieve a significant purpose.

Course Outcomes (COs)

Level of
S No Course outcomes ( Web Technology Lab 10B28CI581)
Attainment
CO 1 To study cameras, radiometry, sources, and properties. Familiarity
To understand and implement linear filters, edge detection, and
CO 2 Usage
texture.
To understand and implement the Geometry of Multiple Views,
CO 3 Usage
Stereopsis, and Segmentation by Clustering.
To understand and implement Segmentation by Fitting a Model,
CO 4 Segmentation and Fitting Using Probabilistic Methods, and Usage
Tracking With Linear Dynamic Models.
To understand and implement Geometric Camera Models and
CO 5 Usage
Geometric Camera Callibration.

List of experiments

S No Topic No of Labs
Pinhole Cameras, Radiometry Measuring Light, Sources, Shadows,
1 3
And Shading, Color
2 Linear Filters, Edge detection, and Texture 3
The Geometry of Multiple Views, Stereopsis, and Segmentation by
3 3
Clustering
Segmentation by Fitting a Model, Segmentation and Fitting Using
4 3
Probabilistic Methods, and Tracking With Linear Dynamic Models
5 Geometric Camera Models and Geometric Camera Callibration 2
Total 14

47
Evaluation Scheme:

1. Mid Term Exam (Viva and Written Exam) 20

2. End term Exam (Viva and Written Exam) 20
3. Lab Records 15
4. Regular Assessment (Quality and quantity of experiments performed,
Learning laboratory skills) 30
5. Attendance 15

Total 100

Text Books:
David A. Forsyth and Jean Ponce: Computer Vision A Modern Approach, PHI
Learning (Indian Edition), 2009.
Reference Books:
E. R. Davies: Computer and Machine Vision Theory, Algorithms and Practicalities,
Elsevier (Academic Press), 4th edition, 2013.

Course Outcomes (COs) contribution to the Programme Outcomes(POs)

PO- PO- PO- PO- PO- PO- PO-

S No PO-1 PO-2 PO-3 PO-6 PO-12 Wtg
4 5 7 8 9 10 11
CO-1 H H H M M H L L M L L H 69%
CO-2 H H H H H H L L M L L H 75%
CO-3 H H H H H H L L M L L H 75%
CO-4 H H H H H H L L M L L H 75%
CO-5 H H H H H H L L M L L H 75%
CO-6 H H H H H H L L M L L H 75%

Wtg 100% 100% 100% 94% 94% 100% 33% 33% 67% 33% 33% 100%

48
15. Human Computer Interaction

Course Credit: 2
Semester: V
Course Coordinator: Dr. Himanshu Jindal

Introduction

This course provides an introduction to and overview of the field of human-computer

interaction (HCI). HCI is an interdisciplinary field that integrates theories and methodologies
from computer science, cognitive psychology, design, and many other areas. Course readings
will span current theory and practice in interface specification, design and evaluation, as well
as current and classic research papers in HCI. Students will work on both individual and team
projects to design, implement and evaluate computer interfaces. The course is open to students
from all disciplines, providing them with experience working in interdisciplinary design teams.

Course Objectives (Post-conditions)

Knowledge objectives:

Upon successful completion of this course, students should be able to:

Design, implement and evaluate effective and usable graphical computer interfaces.
Describe and apply core theories, models and methodologies from the field of HCI.
Describe and discuss current research in the field of HCI.
Implement simple graphical user interfaces using the Java Swing toolkit.
Describe special considerations in designing user interfaces for older adults.

Course Outcomes:
Course outcomes (Object-Oriented Programming Lab) Level of
S No
Course Code: 10B17CI371 Attainment
CO-1 To learn to explain why it is important to design interactive products Familiarity
that are usable, define key terms used in interaction design
CO-2 To learn to explain key theories used in the design of interactive Familiarity
products and to explain the importance of iteration, evaluation and
prototyping in interaction design
CO-3 To gather data in the context of developing a simple interactive Technical
product using suitable techniques Skills
CO-4 To produce a low-fidelity prototype for an interactive product based
Technical
upon a simple list of interaction design principles and to evaluate an
Skills
interactive product using suitable techniques
CO-5 To communicate effectively to peers and specialists about
requirements, design, and evaluation activities relating to interactive Key Skills
products

49
CO-6 To define a suitable programme of user involvement that treats users
Key Skills
ethically and fairly.

Topics Outline:

S
Topic Hrs
No
Principles of HCI : History and Foundations of HCI, Research Frameworks in
HCI, Modeling Social and Emotional Processes, Computer-Mediated
1 4
Communication, Social and Embodied Interfaces I, II, Computer-Supported
Collaborative Work
Principles of HCI : Speech Interfaces, Games, Crowdsourcing, Information
2 Visualization, Ubiquitous Computing, Assistive and Accessible Interfaces, Future 8
of HCI
Human Subjects Research Methods: Introduction: Research methods in HCI,
Introduction: What are elements of a research project in HCI?, Introduction: How
3 6
to choose research designs?, Introduction: Methodological fit, Qualitative research:
data collection, Qualitative research: data analysis
Quantitative research: Experimental design principles, Quantitative research: Step-
by-step experimental design, Quantitative research: Measurement, Part I,
Quantitative research: Measurement, Part II, Quantitative research: Measurement,
4 10
Part III, Quantitative research: Scale construction, Quantitative research: Statistics,
Part I, Quantitative research: Statistics, Part II, Quantitative research: Statistics,
Part III
Project: Completing the required human-subjects research training program and
an Institutional Review Board (IRB) application for the project, Gaining a
5 2
theoretical and empirical understanding of the application domain, Applying
exploratory and experimental research methods in HCI
Prototyping user interfaces, Designing exploratory and experimental
studies, Gaining experience in recruiting participants and conducting studies with
6 2
human subjects, Creating generalizable knowledge on how computing can improve
aspects of human life.
Total 32

Evaluation Scheme

T1 15
T2 25
T3 35

50
Internal Assessment
Attendance 05
Quiz 10
Assignments 10

Total Marks 100

References

Interaction the BCS Specialist Group on Interaction

The Usability Professionals' Association (UPA) - founded in US, with local chapters in
the US and other countries
Mikael Ericsson's listing of research labs and projects world-wide
Ubiquity - ACM online magazine (general IT topics, but lots relevant to HCI)
Alan's column and resources on HCI Education in SIGCHI Bulletin
HCI International has a bi-monthly subscription newsletter partly about the
conference,but also carrying general news, events, etc. back issues at their Press Room
Videos in User-System Interaction - collated by Matthias Rauterberg
The HCI Bibliography - free-access online bibliographic database on Human Computer
Interaction
HCI Resource Network - event listings, links, jobs and subscription only
sections,includes A-Z of HCI topics
Hans de Graaff's HCI Index
Craig Marion's Software Design Smorgasbord
Gary Perlman's Resources in HCI columns from Interactions
University of Michigan HCI resource links
The Usability First web site has good collections of resources, particularly for web and
accessability
Usability First glossary of usability terms
CHI recently completed theses list
ComputingCases.org a resource site for teaching ethical issues in computing
SAP Usability Glossary

Course Outcomes (COs) contribution to the Programme Outcomes(POs)

PO- PO- PO- PO- PO- PO- PO- PO- PO- PO- PO- PO-
Sr No
1 2 3 4 5 6 7 8 9 10 11 12
CO-1 H M M L M H H M L L L H 79%
CO-2 H H H M L L M H M L L H 73%
CO-3 H H M M M L M M M L L M 70%
CO-4 H H H H M L M H M L L M 64%
CO-5 H H H H M L M H M L L H 67%
CO-6 H H H H M L M H M L L H 67%
90% 78% 76% 72% 68% 64% 72% 76% 68% 60% 60% 72%

51
16. Human Computer Interaction Lab

Course Credit: 1
Semester: V

Objective:
This course provides an introduction to and overview of the field of human-computer
interaction (HCI). HCI is an interdisciplinary field that integrates theories and methodologies
from computer science, cognitive psychology, design, and many other areas. Course readings
will span current theory and practice in interface specification, design and evaluation, as well
as current and classic research papers in HCI. Students will work on both individual and team
projects to design, implement and evaluate computer interfaces. The course is open to students
from all disciplines, providing them with experience working in interdisciplinary design teams.
Lab course of two hours per week will supplement the theory. Implementation of basic and
advanced algorithms will be done with C/C++. Basic knowledge of C/C++ programming is
mandatory.
The course will involve four hours of contact including lectures, tutorials and lab classes.
Students are strongly encouraged to participate actively in class discussions.

Learning Outcomes:
Knowledge and understanding: explain why it is important to design interactive products
that are usable, define key terms used in interaction design, explain key theories used in
the design of interactive products explain the importance of iteration, evaluation and
prototyping in interaction design
Cognitive skills: gather data in the context of developing a simple interactive product
using suitable techniques, produce a low-fidelity prototype for an interactive product
based upon a simple list of interaction design principles, evaluate an interactive product
using suitable techniques.
Key skills: communicate effectively to peers and specialists about requirements, design,
and evaluation activities relating to interactive products
Practical and/or professional skills: define a suitable programme of user involvement that
treats users ethically and fairly.

List of Experiments

S No Topics
How to open the Visual Studio software and the steps and tutorial about the software
Design an User Interface for
1
Welcome screen
Multiplication and Addition of any two numbers
Design an user interface for assigning a grade to students based on the subjects marks
Design an User interface for printing the numbers in
2 Ascending order
Descending order
Subtraction

52
Design an user interface for calculator
3
Design an user interface for registration of a student for admissions.
Design an user interface for semester registration
4 Design an user interface for displaying and changing of picture on the form
Design an user interface for To count the number of digits in a given number
Design an user interface for simple sort program
5
Design an User interface
User interest form
6
Making suggestion form
Design an user interface to check whether the year is leap year or not
7
Design an user interface for menu based program
Design an User Interfaces for ATM Machine
8
Design an User Interfaces for Socio E-commerce shop
Design an User Interfaces for Smart Phone
9
Design an User Interfaces for Railway Reservation System
Design an User Interfaces for Online Examination
10
Design an User Interfaces for Hospital management
Design an User Interfaces for library management
11
Design an User Interfaces for Hotel Booking

References

Interaction the BCS Specialist Group on Interaction

The Usability Professionals' Association (UPA) - founded in US, with local chapters in
the US and other countries
Mikael Ericsson's listing of research labs and projects world-wide
Ubiquity - ACM online magazine (general IT topics, but lots relevant to HCI)
Alan's column and resources on HCI Education in SIGCHI Bulletin
HCI International has a bi-monthly subscription newsletter partly about the
conference,but also carrying general news, events, etc. back issues at their Press Room
Videos in User-System Interaction - collated by Matthias Rauterberg
The HCI Bibliography - free-access online bibliographic database on Human Computer
Interaction
HCI Resource Network - event listings, links, jobs and subscription only
sections,includes A-Z of HCI topics
Hans de Graaff's HCI Index
Craig Marion's Software Design Smorgasbord
Gary Perlman's Resources in HCI columns from Interactions
University of Michigan HCI resource links
The Usability First web site has good collections of resources, particularly for web and
accessability
Usability First glossary of usability terms

53
17. Cloud Computing: Concepts, Technology & Architecture
COURSE CODE: XXX
COURSE CREDITS: 2
CORE/ELECTIVE: CORE
L-T-P: 2-1-0

Pre-requisite: Knowledge of Computer Architecture, Computer Networking and Distributed

Computing.
Course Objectives:

1. To demonstrate an understanding of cloud computing concepts and standards.

2. To understand all enabling technologies of Cloud computing.
3. To discuss issues and challenges pertaining to management of emerging cloud
computing technologies and learn approaches to manage them.
4. To demonstrate the practical implementation and usage scenarios of Cloud computing.

Course Outcomes:

Level of
S No Course Outcomes
Attainment
To learn the basic concepts, applications and terminology of cloud
CO-1 Familiarity
computing.
CO-2 To learn basic concepts of infrastructure management and load balancing. Familiarity
CO-3 To learn basic concepts of cloud security and metrics for evaluation. Assessment
To understand cloud computing and its role in new distributed
CO-4 Assessment
computing implementation.

Course Contents:

Unit / Lectures
Contents
Module required
Understanding Cloud Computing:
Lect 1: Basic Concepts and terminology, Goals and Benefits
Lect 2: Risks and Challenges, Roles and boundaries, Cloud
1 characteristics 5
Lect 3: Cluster Computing, Grid Computing
Lect 4: NIST Architecture, Cloud Deployment models
Lect 5: Cloud service models
Cloud Enabling Technologies:
Lect 6,7: Virtualization, Types of virtualization, Server Consolidation,
virtualization management
2 5
Lect 8: Web Technology
Lect 9: Service Oriented Architecture
Lect 10: Datacenter and Multi-tenancy

54
Cloud Infrastructure Management:
Lect 11,12: Cloud datacenter design, Workloads and software
infrastructure for a datacenter
3 Lect 13,14: Datacenter hardware, energy and power efficiency in a 5
datacenter
Lect 15: Cloud usage monitor, Monitoring agent, Resource agent,
Polling Agent
Cloud Mechanisms:
Lect 16: Automated Scaling
Lect 17, 18: Load Balancer
4 6
Lect 19: SLA Monitor
Lect 20: Failover System
Lect 21: Multi-Cloud Broker
Load Magement:
Lect 22,23: Fundamental Cloud Architectures: workload distribution
architecture, resource pooling architecture, dynamic scalability
5 architecture, service load balancing architecture, cloud brusting 6
architecture
Lect 24, 25 : Billing Management System
Lect 26,27: Business cost metrics, cloud usage cost metrics
Metrics & security:
Lect 28: Cloud service metrics
Lect 29: Cloud Security
6 5
Lect 30: Mobile cloud computing
Lect 31: Disaster recovery in cloud computing
Lect 32: Case studies
Total lectures 32

Suggested Text Book(s):

Cloud Computing: Concepts, Technology & Architecture, by Zaigham Mahmood,
Thomas Erl, Ricardo Puttini, Prentice Hall, ISBN: 9780133387568.
Cloud Computing Bible, by Barrie Sosinsky, Barrie Sosinsky.

Suggested Reference Book(s):

Cloud Computing: A Practical Approach by Anthony T. Velte, Toby J. Velte and

Robert Elsenpeter; Tata McGraw Hill Edition
The Datacenter as a Computer An Introduction to the Design of Warehouse Scale
Machines by Luiz Andre Barroso and Urs Holzle; Morgan and Claypool Publishers
Cloud Computing Explained: Implementation Handbook for Enterprises by John
Rhoton
The Cloud at Your Service by Jothy Rosenburg and Arthur Mateos.

Other useful resource(s):

55
Link to NPTEL course contents: https://onlinecourses.nptel.ac.in/noc17_cs23/preview
Link to topics related to course:
i. https://www.edx.org/learn/cloud-computing
ii. https://www.udemy.com/introduction-to-cloud-computing/
iii. https://nptel.ac.in/courses/106104019/2

Evaluation Scheme

Coverage / Scope of
S No Exam Marks Duration
Examination
1 T-1 15 1 Hour. Syllabus covered upto T-1
2 T-2 25 1.5 Hours Syllabus covered upto T-2
3 T-3 35 2 Hours Entire Syllabus
Assignment (2) - 10
Tutorials / Assignments, Entire
4 25 Quizzes (2) - 10
Quizzes, Attendance Semester
Attendance - 5

Course outcomes:

Course outcomes (Cloud Computing: Concepts, Technology & Level of

S No
Architecture) Attainment
To learn the basic concepts, applications and terminology of cloud
CO-1 Familiarity
computing.
To understand different enabling technologies for Cloud computing
CO-2 Assessment
environment.
To design Cloud computing data-center for effective utilization of
CO-3 Usage
available resources
CO-4 To study different managers related to Cloud computing services Assessment
To understand different case studies of Cloud computing and its
CO-5 Usage
advance topics

Course Outcomes (COs) contribution to the Programme Outcomes (POs):

Course outcomes
((Cloud Computing:
Concepts, Technology
& Architecture )
CO-1 2 2 2 2 2 1 1 1 2 2 2 2
CO-2 2 3 3 3 3 1 1 1 2 2 1 2
CO-3 2 2 2 2 3 1 1 1 2 2 1 2
CO-4 2 3 3 3 2 1 1 1 2 3 2 2
Average

56
18. Cloud Computing: Concepts, Technology & Architecture Lab

COURSE CODE: XXXXXXXX

COURSE CREDITS: 1
CORE/ELECTIVE: CORE
L-T-P: 0-0-2
Pre-requisite: Knowledge of Visualization, Web Service Architecture, Computer
Architecture, Computer Networking and Distributed Computing.

Course Objectives:

To demonstrate various Visualization Platform.

To demonstrate an understanding of cloud computing concepts and standards.
To understand all enabling technologies for Cloud Deployment.
To demonstrate the practical implementation and usage scenarios of Cloud computing.

Course Outcomes:

S No Course Outcomes Level of

Attainment
To learn the basic concepts, applications and terminology of
CO1 Familiarity
cloud computing.
To learn basic concepts of infrastructure management and load
CO2 Familiarity
balancing.
To learn basic concepts of cloud security and metrics for
CO3 Assessment
evaluation.
To understand cloud computing and its role in new distributed
CO4 Assessment
computing implementation.

List of Experiments:

S No Description Hours
Introduction to Infrastructure as a Service Platforms like EC2 (AWS).
1 2
Demonstrate the creation of computing platform.
Demonstrate management and deployment for IAAS platform by Remote
2 2
Access platforms (Putty, remote desktop, etc).
Introduction to Visualization and its various types (Hypervisor type0 and
3 2
type1).
Implementation to Visualization platforms (Sun Virtual Box, VM
4 workstation, Zen, KVM) for Virtual Machine (VM) creation and 4
management.
Implement and Management of various Virtual disk standards and VM
5 2
imaging formats for Virtual Machine.
6 Implementation and installation of a Cloud management platform like 4

57
open-stack / Eucalyptus etc.
7 Creating a Warehouse Application in SalesForce.com. 2
Implementation and Deployment of a Platform as a Service Platform like
8 2
Google App engine/ microsoft azure etc.
9 Installation and Configuration of Hadoop. 2
Introduction to Cloud Simulation Platforms Like CloudSim and Green
10 2
Cloud.
Total Lab hours 24

Suggested/Resources:
Cloud Computing: Concepts, Technology & Architecture, by Zaigham Mahmood,
Thomas Erl, Ricardo Puttini, Prentice Hall, ISBN: 9780133387568.
Cloud Computing Bible, by Barrie Sosinsky, Barrie Sosinsky.
Cloud Computing: A Practical Approach by Anthony T. Velte, Toby J. Velte and
Robert Elsenpeter; Tata McGraw Hill Edition
The Datacenter as a Computer An Introduction to the Design of Warehouse Scale
Machines by Luiz Andre Barroso and Urs Holzle; Morgan and Claypool Publishers
Cloud Computing Explained: Implementation Handbook for Enterprises by John
Rhoton
The Cloud at Your Service by Jothy Rosenburg and Arthur Mateos.
Link to NPTEL course contents: https://onlinecourses.nptel.ac.in/noc17_cs23/preview
Link to topics related to course:
a. https://www.edx.org/learn/cloud-computing
b. https://www.udemy.com/introduction-to-cloud-computing/
c. https://nptel.ac.in/courses/106104019/2Ev
Evaluation Scheme:

1 Mid Sem. Evaluation 20 Marks

2 End Sem. Evaluation 20 Marks
3 Attendance 15 Marks
4 Lab Assessment 45 Marks
Total 100 Marks

Course Outcomes (COs) contribution to the Programme Outcomes (POs)

PO PO PO
CO/PO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 Average
10 11 12
CO1 3 3 3 3 2 2 1 1 1 1 1 1 1.83
CO2 3 3 3 3 3 1 1 1 1 1 1 3 2.00
CO3 3 3 2 3 2 3 2 1 1 1 2 1 2.00
CO4 3 3 3 2 3 2 1 1 1 1 1 1 1.83
CO5 2 2 3 3 3 3 1 1 1 1 1 1 1.83
C06 2 3 3 3 2 2 2 2 2 2 2 2 2.25
Average 2.67 2.83 2.80 2.80 2.60 2.20 1.20 1.00 1.00 1.00 1.20 1.40

58
19. Cloud Computing Security

COURSE CODE: XXXXXXXX

COURSE CREDITS: 3
CORE/ELECTIVE: CORE
L-T-P: 3-0-3
Pre-requisite: None
Course Objectives:

1. Understand some of the major security challenges of cloud computing that act as
hindrance to widespread adoption.
2. Learn about some of the newer techniques that scientists are considering to protect
cloud systems, their advantages and disadvantages.
3. Learn how to critically evaluate security literature.
4. Learn how to formulate and solve a research problem in computer security and be able
to present it.

Course Outcomes:

Level of
S No Course Outcomes
Attainment
CO-1 To understand the use of cloud computing Familiarity
CO-2 Different technique to secure the cloud Assessment
CO-3 Different types of attack on the cloud. Assessment
Identify the known threats, risks, vulnerabilities and privacy
CO-4 Usage
issues associated with Cloud based IT services

Course Contents:

Lectures
Unit Contents
required
Architectural and Technological Influences of Cloud Computing,
Cloud deployment models Public, Private, Community and Hybrid
1 models, Software as a Service (SaaS) Platform as a Service (PaaS) 4
Infrastructure as a Service (IaaS), Cloud Computing Roles, Risks
and Security Concerns
Guiding Security design principles for Cloud Computing, Secure
Isolation, Comprehensive data protection, End-to-end access control,
2 6
Monitoring and auditing, Quick look at CSA, NIST and ENISA
guidelines for Cloud Security, Common attack vectors and threats
Secure Isolation, Compute, Network and Storage, Common attack
vectors and threats, Secure Isolation Strategies, Multitenancy,
3 6
Virtualization strategies, Inter-tenant network segmentation
strategies, Storage isolation strategies

59
Data Protection: Understand the Cloud based Information Life
Cycle, Data protection for Confidentiality and Integrity, Common
attack vectors and threats, Encryption, Data Redaction,
4 6
Tokenization, Obfuscation, PKI and Key Management, Assuring data
deletion, Data retention, deletion and archiving procedures for tenant
data, Data Protection Strategies
Access Control for Cloud: Understand the access control
requirements for Cloud infrastructure, Common attack vectors and
threats, Enforcing Access Control Strategies, Compute, Network and
Storage, Authentication and Authorization, Roles-based Access
5 6
Control, Multi-factor authentication, Host, storage and network
access control options, OS Hardening and minimization, securing
remote access, Verified and measured boot, Firewalls, IDS, IPS and
honeypots
Monitoring and auditing: Proactive activity monitoring, Incident
Response, Monitoring for unauthorized access, malicious traffic,
abuse of system privileges, intrusion detection, events and alerts,
6 Auditing Record generation, Reporting and Management, Tamper- 6
proofing audit logs, Quality of Services, Secure Management, User
management, Identity management, Security Information and Event
Management
Identity Management in Cloud: User Identification,
Authentication, and Authorization in Cloud Infrastructure, Be able to
7 understand the concepts of Identity & Access Management, Single 4
Sign-on, Identity Federation, Identity providers and service
consumers, The role of Identity provisioning
Technology Review: OpenStack Platform, Docker, Amazon Web
8 4
Services
Total lectures 42

Suggested Text Book(s):

Cloud Computing Security: Foundations and Challenges John R. Vacca
Cloud Security: A Comprehensive Guide to Secure Cloud Computing Ronald L
Krutz, Russell Dean Vines

Suggested Reference Book(s):

Securing The Cloud: Cloud Computing Security Techniques and Tactics by Vic (J.R.)
Winkler

Cloud Computing Design Patterns by Thomas Erl (Prentice Hall)

Other useful resource(s):
http://www.cs.colostate.edu/~cs656/

60
Evaluation Scheme:

Coverage / Scope of
S No Exam Marks Duration
Examination
1 T-1 15 1 Hour. Syllabus covered upto T-1
2 T-2 25 1.5 Hours Syllabus covered upto T-2
3. T-3 35 2 Hours Entire Syllabus
Assignment (2) - 10
Entire
4. Teaching Assessment 25 Quizzes (2) - 10
Semester
Attendance - 5

Course Outcomes (COs) contribution to the Programme Outcomes (POs)

Course outcomes
(Parallel and
Distributed
Algorithms )
CO-1 2 2 2 2 2 1 1 1 2 2 2 2
CO-2 2 3 3 3 3 1 1 1 2 2 1 2
CO-3 2 2 2 2 3 1 1 1 2 2 1 2
CO-4 2 3 3 3 2 1 1 1 2 3 2 2
Average

61
20. Information Security

COURSE CODE: XXX

COURSE CREDITS: 2
CORE/ELECTIVE: Elective
L-T-P: 2-0-0

Pre-requisite: None
Course Objectives:

1. Investigation of core security technologies and security policies to mitigate risks.

2. Gain an understanding of network perimeter security design principles
3. Gain an understanding of free/ commercial security tools and their applications and
develop the security solution for a given application/scenario.
4. Ability to review procedures for installation, troubleshooting and monitoring of
network devices to maintain integrity, confidentiality and availability of data and
devices.
5. Knowledge of the technologies that underpin the deployment and maintenance of a
secure network.

Course Outcomes:

Level of
S No Course Outcomes
Attainment
CO-1 Understand the need of security Familiarity
CO-2 Analysis of security algorithms Assessment
Demonstrate a familiarity with major security algorithms and data
CO-3 Assessment
structure.
Apply important security algorithmic design paradigms and method of
CO-4 Usage
analysis.

Course Contents:

Lectures
Unit Contents
required
Symmetric Encryption Shift Cipher, Substitution Cipher, Vigen`ere
Cipher, A Permutation Cipher
1 6
Introduction To Symmetric Ciphers, Stream Cipher Basics, The Lorenz
Cipher, Linear Feedback Shift Registers, Combining LFSRs, RC4
Introduction To Block Ciphers, Feistel Ciphers and DES, Rijndael, Modes
of Operation
2 Key Management, Secret Key Distribution, Formal Approaches to Protocol 6
Checking
Hash Functions, Designing Hash Functions, Message Authentication

62
Codes
Public Key Encryption and Signatures Public Key Cryptography
Candidate One-way Functions, RSA, ElGamal Encryption , Rabin
Encryption, Paillier Encryption
3 6
Diffie Hellman Key Exchange, Digital Signature Schemes, The Use of
Hash Functions In Signature Schemes, The Digital Signature Algorithm,
Schnorr Signatures, Nyberg Rueppel Signatures
Attacks on Public Key Schemes
4 Lattice Reduction, Lattice Based Attacks on RSA, Partial Key Exposure 6
Attacks
Provable Security: Security of Signature Algorithms, Security of
5 Encryption Algorithms, Hybrid Ciphers, Signature Schemes, Encryption 4
Algorithms
Advanced Protocols: Access Structures, General Secret Sharing, Reed
Solomon Codes, Shamir Secret Sharing, Commitment Schemes, Oblivious
6 4
Transfer, Showing a Graph Isomorphism in Zero-Knowledge, Zero-
Knowledge and N P, Sigma Protocols
Total lectures 32

Suggested Text Book(s):

Cryptography: An Introduction, Nigel Smart

Cryptography and Network Security: Principles and Practice william stallings

Suggested Reference Book(s):

A.J. Menezes, P. van Oorschot and S.A. Vanstone. The Handbook of Applied
Cryptography.

Evaluation Scheme:

S No Exam Marks Duration Coverage / Scope of Examination

1 T-1 15 1 Hour. Syllabus covered upto T-1
2 T-2 25 1.5 Hours Syllabus covered upto T-2
3 T-3 35 2 Hours Entire Syllabus
Assignment (2) - 10
Entire
4 Teaching Assessment 25 Quizzes (2) - 10
Semester
Attendance - 5

63
Course Outcomes (COs) contribution to the Programme Outcomes (POs)

Course outcomes
(Parallel and
Distributed
Algorithms )
CO-1 2 2 2 2 2 1 1 1 2 2 2 2
CO-2 2 3 3 3 3 1 1 1 2 2 1 2
CO-3 2 2 2 2 3 1 1 1 2 2 1 2
CO-4 2 3 3 3 2 1 1 1 2 3 2 2
Average

64
21. Information Security Lab

COURSE CODE: XXX

COURSE CREDITS: 1
CORE/ELECTIVE: CORE
L-T-P: 0-0-2

Pre-requisite: None
Course Objectives:

1. To understand the basic security algorithms

2. To Implement various symmetric cipher
3. To implement various public key encryption algorithms

Course Outcomes:

Level of
S No Course Outcomes
Attainment
Understand the basic security services e.g. Authentication, Access
CO1 Familiarity
Control, Confidentiality, Integrity
CO2 Learn standard symmetric encryption algorithms Assessment
CO3 Learn the architecture for public and private key cryptography. Assessment
CO4 Learn the methods of digital signature and encryption. Assessment
CO5 Learn key management and how key exchange protocols work. Uses
Learn futuristic cryptographic techniques like Eliptic Curve and
CO6 Assessment
quantum cryptography

List of Experiments

S No Description Hours
Study of Network Security fundamentals - Ethical Hacking, Social
1 2
Engineering practices.
2 Study of System threat attacks - Denial of Services 2
3 Study of Sniffing and Spoofing attacks 2
4 Study of Techniques uses for Web Based Password Capturing 2
5 Study of Different attacks causes by Virus and Trojans 2
6 Study of Anti-Intrusion Technique Honey pot 2
7 Study of Symmetric Encryption Scheme RC4 2
8 Implementation of S-DES algorithm for data encryption 2
9 Implementation of Asymmetric Encryption Scheme RSA. 2
10 Study of IP based Authentication 2
Total Lab hours

65
Suggested/Resources:

Evaluation Scheme:
1 Mid Sem. Evaluation 20 Marks
2 End Sem. Evaluation 20 Marks
3 Attendance 15 Marks
4 Lab Assessment 45 Marks
Total 100 marks

Course Outcomes (COs) contribution to the Programme Outcomes (POs)

CO/PO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 Avg
CO1 3 3 3 3 2 2 1 1 1 1 1 1 1.83
CO2 3 3 3 3 3 1 1 1 1 1 1 3 2.00
CO3 3 3 2 3 2 3 2 1 1 1 2 1 2.00
CO4 3 3 3 2 3 2 1 1 1 1 1 1 1.83
CO5 2 2 3 3 3 3 1 1 1 1 1 1 1.83
C06 2 3 3 3 2 2 2 2 2 2 2 2 2.25
Avg 2.67 2.83 2.80 2.80 2.60 2.20 1.20 1.00 1.00 1.00 1.20 1.40

66
22. Game Development and Design
Course Name: Game Development and Design
Course Code: XXX
Course Credits: 2
Branch and Semester: 8th Semester [CSE, IT]
Session: Jan Jun, 2020
Last updated on: 04-02-2020
Faculty Coordinators: Mr. Praveen Modi

Description & Rationale: Game theory is a branch of Mathematical Economics that studies
strategic interactions amongst rational decision makers. Traditionally, game theoretic tools
have been applied to solve problems in Economics, Business, Political Science, Biology,
Sociology, Computer Science, Logic, and Ethics. In recent years, applications of game theory
have been successfully extended to several areas of engineered / networked system such as
wireline and wireless communications, static and dynamic spectrum auction, social and
economic networks. This course is intended to provide students with a comprehensive
treatment of game theory with specific emphasis on applications in Economics and
Engineering.

Aim: The aim of this course is to introduce students to the novel concepts of Game Theory
with special emphasis on its applications in diverse fields and current research.

Course Outcomes:

Level of
S No Course outcomes (Computer Game Design) (17B1WCI812)
Attainment
CO-1 Game Theory Introduction with Various Theorem Technical
Introduction of Nash Equilibrium, Bounded Rationality, Strategic
CO-2 Technical
Games, Strictly competitive Games
Methods to solve the Strategic Games with Matrix 2-person Games,
CO-3 Technical
3-person Games
Introduction of Matrix Games & Linear Programming methods to
CO-4 Technical
solve complex Games
Design the games using by analyzing the Mixed Strategy Nash
CO-5 Technical
Equilibrium
Analysis of Game complexity by finite repeated & infinite repeated
CO-6 Technical skills
games
CO-7 Design the Games with timeliness and restrict the strategies Technical skills
CO-8 Learn the games complexity by NASH FOLK Theorem Technical skills
CO-9 Analyze the Game Design with best response & equality of pay-off Assessment

67
Course Contents / Lecture Plan:

Chapters HRS
Chapter 1: Introduction: Game Theory, The theory of rational choice, Theory of 7
Competitive Equilibrium, steady State and Deductive Interpretations, Bounded
Rationality Terminology and Notation Nash Equilibrium- Strategic Games, Nash
Equilibrium Examples Existence of a Nash Equilibrium, Strictly Competitive Games,
Bayesian Games: Strategic Games with Imperfect Information
Chapter 2:Matrix Two-Person Games(The Basics, The von Neumann Minimax 5
Theorem, Mixed Strategies, Solving 2 × 2 Games Graphically, Graphical Solution of 2
× m and n × 2 Games, Best Response Strategies
Chapter 3: Solution Methods for Matrix Games: Solution of Some Special Games, 6
Invertible Matrix Games,Symmetric Games, Matrix Games and Linear Programming,
Two-Person Nonzero Sum Games(The Basics, 2 × 2 Bimatrix Games, Best Response,
Equality of Payoffs,
Chapter 4: Mixed Strategy Nash Equilibrium Interpretations of Mixed Strategy Nash 6
Equilibrium Correlated Equilibrium Evolutionary Equilibrium Rationalizability and
Iterated Elimination of Dominated Actions-Rationalizability Iterated Elimination of
Strictly Dominated Actions, Iterated Elimination of Weakly Dominated Actions
Chapter 5: Repeated Games: The Basic Idea Infinitely Repeated Games vs.\ Finitely 6
Repeated Games Infinitely Repeated Games: Definitions Strategies as Machines
Trigger Strategies: Nash Folk Theorems Punishing for a Limited Length of Time
Chapter 6:Game Examples:- 8 Queen Game, Sudoku Puzzle Game, Chess Board 2
Game
Total Hours: 32

Maintenance of Records:

resource from time to time) neatly in suitable hard bound notebooks separately (one for each).
The same will be submitted to the TA in the Lab on or before the scheduled time.

Teaching and Learning Strategies:

Delivery consists of a series of lectures that introduce and develop the core principles. These
are further explored and expanded through a series of laboratory-based sessions. A project
problem is to be taken up and implemented as a continuous assessment in the semester to give
a hands-on exposure on integrating various concepts taught and integrating them into a
problem solving exercise. The students are expected to spend time on unsupervised self-study
and laboratory work. The course is structured so that each unit builds upon previous
knowledge. Programming and implementation on different topics will be available that will be
implemented in the semester.

68
Evaluation Scheme:

S No Exam Marks Duration Coverage / Scope of

Examination

1 T-1 15 1 Hour. Syllabus covered up to T-1

2 T-2 25 1.5 Hours Syllabus covered up to T-2
3 T-3 35 2 Hours Entire Syllabus
4 Tutorials / 25 Entire Assignment - 9
Assignments, Quizzes, Semester Quizzes - 12
Attendance Attendance - 4

Text Book(s):
Games Theory An Introduction second edition by E. N Barron Loyola University
Chicago Chicago, Illinois

Reference Book(s):
An Introduction to Game Theory by Martin J. Osborne
Introduction to Game Theory by StefTijs Tilburg University Tilburg, Hindustan
Book Agency(India)
Games of Strategy Theory And Application by Melvin Dresher Prentice Hall, Inc.
Englewood Cliffs, N.J.

Course Outcomes (COs) contribution to the Programme Outcomes(POs)

Attainment of POs through Cos (Computer Game Design) (17B1WCI812)

PO- PO- PO- PO-
S No PO-1 PO-2 PO-3 PO-4 PO-5 PO-6 PO-7 PO-8
9 10 11 12
CO-1 H M H L M H H M L M M M 72%
CO-2 H H H L M H H H M M M M 81%
CO-3 H H H L M H M H M M H H 83%
CO-4 H H H H M H H M M M H H 89%
CO-5 H H H M M H H H M M H H 89%
CO-6 H H H M M M H M M M M M 78%
CO-7 H H H M M M M M M M H M 78%
CO-8 H H H H M H H M M M H H 89%
CO-9 H H H H M H H H M M H M 89%
Avg 100% 96% 96% 96% 63% 93% 93% 81% 63% 67% 89% 81%

69
23. Game Development Lab

COURSE CODE: XXX

COURSE CREDITS: 1
CORE/ELECTIVE: CORE
L-T-P: 0-0-2

Pre-requisite: Introduction to Computer Programming C ,C++, Matlab

Course Objectives:
1. To strengthen their problem solving ability by applying logic & numerical approach.
2. To strengthen ability to design and represent solutions to problems using Nash
Equilibrium and saddle points.
3. To introduce the 2-Person , N-Person Game ,Mixed Strategy, Convex Combination
Course Outcomes:
1. Explain how game is implemented through matrix representation
2. Analyze and decompose the problem into matrix & propose the various solutions using
Nash Equilibrium, Mixed Strategy.
3. Design the game for 2-person, N-person e.g. Puzzle Game, Chess Board,8 Queen Game

Exp no Experiment Hours

1 There are 100 bankers lined up in each of 100 rows. Pick the richest 2
banker in each row. Javier is the poorest of those. Pick the poorest banker
in each column. Raoul is the richest of those. Who is richer: Javier or
Raoul
2 Implement Mixed Strategy Problem & find out the expected payoff 2
3 Implement the Mixed strategy Problem and find the saddle point for 2
finite & infinite user
4 Consider the game with matrix 2
[ ].
Solve the game, find the best response for player1 to the
strategy . What is 2nd best response to 1st best response?
5 Consider the game 2

Solve this game by finding v(A) and the optimal strategies.

6 Consider the matrix for two player 2

Find the Nash Equilibrium

70
7 Consider the matrix 2

Find x so that the game has exactly two pure Nash equilibrium?
8 Consider the game in which each player has two strategies Wait and Go. 2
The game matrix is

Find the correlated equilibria corresponding to the Nash equilibria

9 2
10 The third column of the matrix 2

is dominated by a convex combination. Reduce the matrix and solve the

game.
11 Use dominance to solve the following game even though it has no 2
inverse

A=

12 Design the magic Square game. A Game has a matrix in which each row 2
has a row sum that is the same as each of the column sums. For example

A=

13 Design the 9×9 Sudoku puzzle game 2

14 Implement the chess board for 2 users and find the optimal strategy 2

Evaluation Scheme

Attendance & Discipline in Lab: 15 marks

Mid-Term Lab Exam and Viva: 20 marks
End-Term Lab Exam and Viva: 20 marks
Lab Records: 15 marks
Regular Assessment: 30 marks
(Quality and quantity of experiment
performed, Learning laboratory skills)
Total = 100 marks

71
References:-

An Introduction to Game Theory by Martin J. Osborne

Introduction to Game Theory by Stef Tijs Tilburg University Tilburg, Hindustan Book
Agency(India)
Games of Strategy Theory and Application by Melvin Dresher Prentice Hall, Inc.
Englewood Cliffs, N.J.

CO/PO

CO-1 3 2 2 2 3 1 1 1 1 1 2 2 1.8

CO-2 3 3 3 3 3 2 1 2 2 1 2 3 2.3

CO-3 3 3 2 3 3 2 1 2 2 1 2 3 2.3

3 2.8 2.5 2.8 3 1.8 1 1.8 1.8 1 2 2.8

Average

72
24. Information Auditing and Risk Management

Course Credit: 3
Semester: VII
Course Coordinator: Dr. Monika Bharti Jindal

Introduction

This course provides a robust introduction of Enterprise Risk Management (ERM) and the ISO
31000 risk management standard. The course covers both the theoretical and
practical perspectives.
The training course discusses risk as a concept, its potential impact on an organisation and how
risk management can be applied and sustained in an organisation. Throughout the course, you
will explore the practical processes involved in identifying, and evaluating internal and
external risk to an organisation. Response and reporting procedures, such as auditing,
compliance and governance will be covered.

Course Objectives (Post-conditions)

Knowledge objectives:

Upon successful completion of this course, students should be able to:

Targets project leaders involved in managing risk in capital projects.

Topics Outline:

S No Topic Hrs
1 Introduction: Overview of course objectives and agenda, Interactive exercise 4
participants will complete a survey on the level of maturity of project risk
management in their organization. Introduction to the Construction Industry

project performance
2 Risk Management Process: Introduction to risk management Owner and 8
contractor perspectives on risk, The risk management process, Applying risk
management throughout the project lifecycle, Roles and responsibilities
3 Risk Identification: Major sources of risk, Risk identification methods 6
brainstorming, structured interviews, documentation review and risk checklists
4 Supporting tools: Risk Register template, Risk Breakdown Structure(RBS), 10
Construction-focused Risk Checklist, Using the Risk Register template to
document identified risks
5 Risk Assessment: The assessment process for identified risks, Selecting an 4
appropriate risk assessment level for each project, Level 1 Risk
Identification, Level 2 Probability & Impact
6 Utilizing the Risk Assessment tables, Recording assessment results in the 5
Risk Register

73
7 Risk Response: Developing risk response plans and actions, Risk response 3
s
8 Risk Monitoring: Tracking and reporting risks using the Risk Register, 2
Monitoring existing risks and execution of risk response plans and actions,
Integrating risk status into regular project communications and reporting
Total 42

Evaluation Scheme

T1 15
T2 25
T3 35

Internal Assessment
Attendance 05
Quiz 10
Assignments 10

Total Marks 100

References

Risk Management, The Blackford Centre

Course Outcomes:
Level of
S No Course outcomes
Attainment
To learn to explain why it is important to design interactive products
CO-1 Familiarity
that are usable, define key terms used in interaction design
To learn to explain key theories used in the design of interactive
CO-2 products and to explain the importance of iteration, evaluation and Familiarity
prototyping in interaction design
To gather data in the context of developing a simple interactive product Technical
CO-3
using suitable techniques Skills
To produce a low-fidelity prototype for an interactive product based
Technical
CO-4 upon a simple list of interaction design principles and to evaluate an
Skills
interactive product using suitable techniques
To communicate effectively to peers and specialists about requirements,
CO-5 Key Skills
design, and evaluation activities relating to interactive products
To define a suitable programme of user involvement that treats users
CO-6 Key Skills
ethically and fairly.

74
Course Outcomes (COs) contribution to the Programme Outcomes(POs)

PO- PO- PO- PO- PO- PO- PO- PO- PO- PO- PO- PO-
Sr No
1 2 3 4 5 6 7 8 9 10 11 12
CO-1 H M M L M H H M L L L H 79%
CO-2 H H H M L L M H M L L H 73%
CO-3 H H M M M L M M M L L M 70%
CO-4 H H H H M L M H M L L M 64%
CO-5 H H H H M L M H M L L H 67%
CO-6 H H H H M L M H M L L H 67%
90% 78% 76% 72% 68% 64% 72% 76% 68% 60% 60% 72%

75
25. Information Modeling

COURSE CODE: XXX

COURSE CREDITS: 3
CORE/ELECTIVE: CORE
L-T-P: 2-0-0
Pre-requisite: Database systems, Data Mining
Course Objectives:
1. Learn to build an information modeling.
2. Learn the Concept of data and process modeling.
3. Learn the Concept of Component modeling.
4. Apply information modeling techniques to solve real life problems.

Course Outcomes:

Level of
S No Course Outcomes
Attainment
Understand the basics of information modeling application and their
CO-1 Familiarity
usages in different areas
CO-2 To be familiar with the basics of various modeling techniques Familiarity
Ability to apply modeling techniques on real life scenarios to solve
CO-3 Assessment
them easily
CO-4 Ability to apply information modeling with Linked data Usage

Course Contents:

Lectures
Unit Contents
required
Information Model: Introduction, needs; Components of information
model.
1 6
Information Modeling: Introduction: Why? What? How? Goals;
Concepts; Information Modeling Vs Data Modeling.
Data Modeling: Introduction; Workflow of Data Modeling; Data
2 Modeling Notations and Languages; Data Modeling Concepts; Challenges 5
in Data Modeling.
Meta Modeling: Introduction; Concepts; Requirements on Metamodeling
Notations; IRDS - Information Resource Dictionary Standard Resource
3 6
Dictionary Standard; Repositories; Introduction to Ontology; Analyzing
and Comparing Ontologies with Meta-Models.
Process Modeling: Introduction; Workflow Management; Process
4 Modeling; Workflow Management System; Executing Processes; 5
Information Delivery Manuals and Model View Definitions.

76
Data, Ontology, and Component Modelling: A Taxonomic Class
Modelling Methodology for Object-Oriented Analysis; Comprehension of
5 Hierarchical ER Diagrams Compared to Flat ER Diagrams; Constraints on 5
Conceptual Join Paths; A Service-Oriented Component Modelling
Approach; Evaluation of Component-Based Development Methods.
Information Modelling and Linked Data: Introduction; Concepts of
Linked Data and the Semantic Web; Technology: The Semantic Web
6 5
Stack; Multiple Interlinked Models; Dynamic, Semantic Model
Extensions; Querying and Reasoning
Total lectures 32

Suggested Text Book(s):

John Krogstie (SINTEF, Norway ), Terry Halpin (Neumont University, USA )
and Keng Siau (Missouri University of Science and Technology, USA): Information
Modeling Methods and Methodologies: Advanced Topics in Database Research, IGI-
Global, August, 2004.
André Borrmann, Markus K¨onig, Christian Koch, Jakob Beetz: Building Information
Modeling, Springer,
Suggested Reference Book(s):
Charrel, Pierre-Jean ; Jaakkola, Hannu ; Kangassalo, Hannu ; Kawaguchi, Eiji:
Information Modelling and Knowledge Bases, Frontiers in artificial intelligence and
applications,

Evaluation Scheme:

Coverage / Scope of
S No Exam Marks Duration
Examination
1 T-1 15 1 Hour. Syllabus covered upto T-1
2 T-2 25 1.5 Hours Syllabus covered upto T-2
3 T-3 35 2 Hours Entire Syllabus
Assignment (2) - 10
4 Teaching Assessment 25 Entire Semester Quizzes (2) - 10
Attendance - 5

Course Outcomes (COs) contribution to the Programme Outcomes(POs)

Course outcomes

CO-1 2 1 1 1 2 1 - 1 1 1 2 3
CO-2 3 1 1 2 2 1 - 1 1 1 2 3
CO-3 2 2 2 3 3 2 - 1 2 1 3 3
CO-4 3 2 3 3 3 2 - 1 1 1 3 3
Average

77
26. Ethics and Information Technology

COURSE CODE: XXX

COURSE CREDITS: 3
CORE/ELECTIVE: ELECTIVE
L-T-P: 3-0-0
Pre-requisite: None
Course Objectives:

1. The course will discuss the social impacts of computers in information technology.
2. Students will be given a broad overview of relevant topics to include free speech,
privacy, security and the law
3. Understand the importance of ethical issues that emerge from the widespread use of
information technology.
4. Professional and ethical responsibilities based on community values and the law will
be discussed.
5. This course will focus on the economic, social, cultural and global impacts of
decisions that are made relating to information technology.
6. Understand the ethical issues associated with confidentiality and privacy as they relate
to information technology.
7. Students will become familiar with organizations, laws and regulations related to
computer ethics and individual conduct in cyberspace.
8. Students will apply critical thinking skills to evaluate cyber ethics issues.

Course Outcomes:

Level of
S No Course Outcomes
Attainment
Demonstrate knowledge of current models of information and
CO-1 Familiarity
computer ethics.
Apply ethical theories to interpret personal and group behavior when
CO-2 Assessment
using a variety of information technology tools.
Evaluate the nature of ethical choices made by self and others when
CO-3 Assessment
serving various roles that expose social and multicultural differences.
Construct written arguments in a variety of formats on the evolving
CO-4 Usage
nature of ethical norms relating to new technologies

Course Contents:

Lectures
Unit Contents
required
Introduction: Defining key terms: Cyberethics and Cybertechnology,
1 Four Developmental Phases in Cybertechnology, Are Cyberethics Issues 5
Unique Ethical Issues? Digital Piracy, Cyberethics as a Branch of

78
Applied Ethics: Three Distinct Perspectives, A Comprehensive Strategy
for Approaching Cyberethics Issues, Ethics and Morality.
Ethical Concepts and Critical Thinking:

Moral Dilemma, A Controversial Policy in Newmerica, A Dilemma

Involving Conflicting Duties, Character-Based Ethical Theories,
2 Integrating Aspects of Classical Ethical Theories into a Single 6
Comprehensive Theory, Constructing an Argument: Valid Arguments,
Sound Arguments, Invalid Arguments, Inductive Arguments, Fallacious
Arguments, A Seven-Step Strategy for Evaluating arguments, Identifying
some common fallacies.
Professional Ethics and Privacy: Professional Ethics, Safety-Critical
Software, Professional Codes of Ethics and Codes of Conduct, Conflicts
of Professional Responsibility: Employee Loyalty and Whistle-Blowing,
Moral, Responsibility, Legal Liability, and Accountability, Risk
Assessment in the Software Development Process, Do Some Computer
Corporations Have Special Moral Obligations?
3 Privacy: Personal privacy, Importance of Privacy, Gathering Personal 6
Data: Monitoring, Recording, and Tracking Techniques, Exchanging
Personal Data: Merging and Matching Electronic Records, Mining
Personal Data, Protecting Personal Privacy in Public Space, Privacy-
Enhancing Technologies, Privacy Legislation and Industry Self-
Regulation.
Security in Cyberspace: Security in the context of cyber technology,

4 5
Cyberterrorism, Information Warfare(IW), Cybersecurity and Risk
Analysis.
Cyber Crime: Cybercrimes and Cybercriminals, Hacking, Cracking, and
Counterhacking, Defining Cybercrime, Three Categories of Cybercrime:
Piracy, Trespass, and Vandalism in Cyberspace, Cyber-Related Crimes,
Technologies and Tools for Combating Cybercrime, National and
International Laws to Combat Cybercrime.Various scenarios: Virtual
Casino, Prosecuting a Computer Corporation in Multiple Countries, The
5 8
Intellectual property: What is Intellectual Property?Copyright law and
Digital Media, Patents, Trademarks, and Trade Secrets, Jurisdictional
Issues Involving Intellectual Property Law, Philosophical Foundations for
Intellectual Property Rights, The Free Software and the Open Source
Movements,
Regulating Commerce: Background Issues and Some Preliminary
Distinctions, Four Modes of Regulation: The Lessig Model, Digital
Rights Management and the Privatization of Information Policy, The Use
6 6
and Misuse of (HTML) Metatags and Web Hyperlinks, Email-Spam, Free
Speech vs. Censorship and Content

79
Community in CyberSpace: Online Communities and Social
7 Networking Services, Virtual Environments and Virtual Reality, Cyber 4
Identities and Cyber Selves, AI and its implications.
Ethical aspects of emerging technologies: Converging Technologies and
Technological Convergence, Bioinformatics and Computational
Genomics, Nanotechnology and Nanocomputing, Autonomous Machines
8 2
hical Framework for Guiding
Research in New and Emerging
Technologies.
Total lectures 42

Suggested Text Book(s):

Tavani, H.T. (2010). Ethics and technology: Controversies, questions and strategies in
ethical computing (3rd ed.) Massachusetts, John Wiley & Sons Inc. [ISBN: 978-0-
470-50950-0].
Suggested Reference Book(s):

Blackley, J. A., Peltier, J., & Peltier, T. (2003) Information Security Fundamentals, 1st
ed. Boca Raton, FL. Auerbach Publications. [ISBN: 0849319579/9780849319570].

Evaluation Scheme:
Coverage / Scope of
S No Exam Marks Duration
Examination
1 T-1 15 1 Hour. Syllabus covered upto T-1
2 T-2 25 1.5 Hours Syllabus covered upto T-2
3 T-3 35 2 Hours Entire Syllabus
Assignment (2) - 10
Teaching
4 25 Entire Semester Quizzes (2) - 10
Assessment
Attendance - 5

Course Outcomes (COs) contribution to the Programme Outcomes (POs)

Course outcomes
(Parallel and
Distributed
Algorithms )
CO-1 2 2 2 2 2 1 1 1 2 2 2 2 1.8
CO-2 2 3 3 3 3 1 1 1 2 2 1 2 2
CO-3 2 2 2 2 3 1 1 1 2 2 1 2 1.8
CO-4 2 3 3 3 2 1 1 1 2 3 2 2 2.1
Average 2 2.5 2.5 2.5 2.5 1 1 1 2 2.3 1.5 2

80
27. Knowledge-Based AI: Cognitive Systems

COURSE CODE: XXX

COURSE CREDITS: 3
CORE/ELECTIVE: CORE
L-T-P: 3-0-0

Pre-requisite: Discrete Mathematics, Programming Languages

Course Objectives:

The aim of the course is to familiarize the students with the basic concepts as well as with the
state-of-the-art research literature in knowledge based artificial intelligence. After successful
completion of this course, students will be able to:

1. Understand concepts, methods, and prominent issues in knowledge-based artificial

intelligence
2. Learn specific skills and abilities needed to apply those concepts to the design of
knowledge-based AI agents
3. Understand relationship between knowledge-based artificial intelligence and the study
of human cognition.

Course Outcomes:
Level of
S No Course Outcomes
Attainment
Understanding basic concepts of knowledge based AI & Cognitive
CO-1 Familiarity
Systems
Understanding various fundamental concepts & techniques related
CO-2 Familiarity
to AI as well as cognitive systems.
Learning & implementing various reasoning methods such as
CO-3 Usage
common sense reasoning, analogical reasoning, etc
CO-4 Designing & creating as well as meta cognition knowledge Assessment

Course Contents:

Lectures
Unit Contents
required
Introduction: Introduction to KBAI & Cognitive Systems, Where
1 Knowledge-Based AI fits into AI as a whole - Cognitive systems: 5
what are they? - AI and cognition: how are they connected?
Fundamentals: Semantic Networks - Generate & Test - Means-
2 5
Ends Analysis - Problem Reduction - Production Systems
Common Sense Reasoning: Frames - Understanding - Common
3
Sense Reasoning - Scripts 4
4 Planning & Learning: Logic, Planning, Learning by Recording 6

81
Cases - Incremental Concept Learning - Classification - Version
Spaces & Discrimination Trees
Analogical Reasoning: Case-Based Reasoning - Explanation-Based
5 5
Learning - Analogical Reasoning
Visuo-spatial Reasoning: Constraint Propagation - Visuospatial
6 5
Reasoning
Design & Creativity: Configuration - Diagnosis - Design -
7 6
Creativity
Metacognition: Learning by Correcting Mistakes - Meta-Reasoning
8 6
- AI Ethics
Total Lectures 42

Suggested Text Book(s):

"Artificial Intelligence: A Modern Approach", Stuart Russell and Peter Norvig, 3rd
Edition
st
Edition

Suggested Reference Book(s):

tificial Intelligence by Example", Denis Rothman

Other useful resource(s):

1. Link to NPTEL course contents:

https://nptel.ac.in/courses/106/105/106105077/
2. Link to topics related to course:
https://www.youtube.com/watch?v=0Alhb1HDsNw
https://www.youtube.com/watch?v=JMUxmLyrhSk
https://www.udacity.com/course/knowledge-based-ai-cognitive-systems--ud409

Evaluation Scheme:
Coverage / Scope of
S No Exam Marks Duration
Examination
1 T-1 15 1 Hour. Syllabus covered up to T-1
2 T-2 25 1.5 Hours Syllabus covered up to T-2
3 T-3 35 2 Hours Entire Syllabus
Assignment (2) - 10
Teaching
4 25 Entire Semester Quizzes (2) - 10
Assessment
Attendance - 5

82
Course Outcomes (COs) contribution to the Program Outcomes (POs)

Course outcomes
(Parallel and
Distributed
Algorithms )
CO-1 2 2 2 2 2 1 1 2 2 2 2
CO-2 2 3 3 3 3 1 1 2 2 1 2
CO-3 2 2 3 3 3 1 1 2 2 1 2
CO-4 2 3 3 3 2 1 1 2 3 1 2
Average

83
28. Reinforcement Learning

COURSE CODE: XXX

COURSE CREDITS: 3
CORE/ELECTIVE: CORE
L-T-P: 3-0-0
Pre-requisite: Probability & Statistics, Machine Learning
Course Objectives:

The aim of the course is to familiarize the students with the basic concepts as well as with the
state-of-the-art research literature in deep reinforcement learning. After successful completion
of this course, students will be able to:

1. Structure a reinforcement learning problem

2. Understand and apply basic RL algorithms for simple sequential decision making
problems in uncertain conditions.
3. Evaluate the performance of the solution
4. Interpret state-of-the-art RL research and communicate their results.

Course Outcomes:
Level of
S No Course Outcomes
Attainment
CO-1 Understanding basic concepts of Reinforcement Learning Familiarity
CO-2 Understanding Probability Primer Techniques in detail. Familiarity
Learning & implementing various methods & techniques such as TD
CO-3 Usage
methods, Monte Carlo, Markov Decision Process, etc.
Learning & understanding policy gradients along with its advantages
CO-4 Assessment
and disadvantages.

Course Contents:

Lectures
Unit Contents
required
Introduction: Origin and history of Reinforcement Learning research. Its
1 connections with other related fields and with different branches of 2
machine learning.
Probability Primer: Axioms of probability, concepts of random variables,
PMF, PDFs, CDFs, Expectation. Concepts of joint and multiple random
2 4
variables, joint, conditional and marginal distributions. Correlation and
independence.
Markov Decision Process: Introduction to RL terminology, Markov
property, Markov chains, Markov reward process (MRP). Introduction to
3 6
and proof of Bellman equations for MRPs along with proof of existence of
solution to Bellman equations in MRP. Introduction to Markov decision

84
process (MDP), state and action value functions, Bellman expectation
equations, optimality of value functions and policies, Bellman optimality
equations.
Prediction & Control by Dynamic Programming: Overview of dynamic
programming for MDP, definition and formulation of planning in MDPs,
principle of optimality, iterative policy evaluation, policy iteration, value
4 iteration, Banach fixed point theorem, proof of contraction mapping 6
property of Bellman expectation and optimality operators, proof of
convergence of policy evaluation and value iteration algorithms, DP
extensions.
Monte Carlo methods for Model Free Prediction & Control : Overview
of Monte Carlo methods for model free RL, First visit and every visit
5 6
Monte Carlo, Monte Carlo control, On policy and off policy learning,
Importance sampling.
TD Methods: Incremental Monte Carlo Methods for Model Free
Prediction, Overview TD(0), TD(1) and TD( -step estimators, unified
6 6
view of DP, MC and TD evaluation methods, TD Control methods -
SARSA, Q-Learning and their variants.
Function Approximation Methods: Getting started with the function
approximation methods, Revisiting risk minimization, gradient descent
from Machine Learning, Gradient MC and Semi-gradient TD(0)
7 6
algorithms, Eligibility trace for function approximation, After states,
Control with function approximation, Least squares, Experience replay in
deep Q-Networks.
Policy Gradients: Getting started with policy gradient methods, Log-
derivative trick, Naive REINFORCE algorithm, bias and variance in
8 6
Reinforcement Learning, Reducing variance in policy gradient estimates,
baselines, advantage function, actor-critic methods.
Total Lectures 42

Suggested Text Book(s):

"Reinforcement Learning: An Introduction", Richard S. Sutton and Andrew G. Barto,

2nd Edition
"Probability, Statistics, and Random Processes for Electrical Engineering", 3rd
Edition, Alberto Leon-Garcia

Suggested Reference Book(s):

Other useful resource(s):

1. Link to NPTEL course contents:

85
https://nptel.ac.in/courses/106/106/106106143/
2. Link to topics related to course:
https://www.youtube.com/watch?v=JgvyzIkgxF0
https://www.youtube.com/watch?v=LzaWrmKL1Z4

Evaluation Scheme:

Coverage / Scope of
S. No Exam Marks Duration
Examination
1 T-1 15 1 Hour. Syllabus covered up to T-1
2 T-2 25 1.5 Hours Syllabus covered up to T-2
3 T-3 35 2 Hours Entire Syllabus
Assignment (2) - 10
4 Teaching Assessment 25 Entire Semester Quizzes (2) - 10
Attendance - 5

Course Outcomes (COs) contribution to the Program Outcomes (POs)

Course outcomes
(Parallel and
Distributed
Algorithms )
CO-1 2 2 2 2 2 1 2 2 1 2
CO-2 2 3 3 3 3 1 2 2 1 2
CO-3 2 3 3 3 3 2 2 2 1 2
CO-4 2 3 3 3 2 1 2 3 2 2
Average

86
29. Architecting Distributed Cloud Applications
COURSE CODE: XXX
COURSE CREDITS: 2
CORE/ELECTIVE:
L-T-P: 2-0-0
Pre-requisite: Cloud Computing, Distributed applications, Basic networking concepts.
Course Objectives:

1. To understand cloud distributed applications.

2. To know the benefits and challenges of micro services architecture.
3. To learn fundamentals of service endpoints, scalability, and availability.
4. To know the fundamentals of messaging with queues.
5. To understand best practices for managing service configuration.

Course Outcomes:

Level of
S No Course Outcomes
Attainment
CO-1 Introduction to cloud computing and distributed cloud applications Familiarity
CO-2 Network Communication in distributed cloud applications Assessment
CO-3 Message Communication in distributed cloud applications Assessment
Versioning, upgrading and configuration of distributed cloud
CO-4 Usage
applications

Course Contents:
Lectures
Unit Contents
required
Module 1:
Cloud Computing Introduction: Cloud computing definition,
benefits of cloud computing.
What are cloud applications, why develop cloud applications, what are
1 orchestrators and containers in cloud, difference between orchestrators 6
and containers.
What are micro-services, why convert monolith applications to micro-
services, micro-service architectural myths, auto-scaling of cloud
micro services.
Module 2: Network Communication
Network issues for distributed cloud applications, service endpoint
scalability and availability, forward and reverse proxies, cluster DNS,
2 5
reverse proxy load balancers.
What are service APIs for distributed cloud applications.
Fault tolerant network communication, circuit breaking.
Module 3:Messiging Communication
3 5
What is message communication, benefits of message communication,

87
messing with queues, fault tolerant messaging process, some queue
features.
Module 4: Versioning, upgrading and configuration
Service update options, rolling updates feature, shutting down a
4 5
service, gracefully shutting down a service, service configuration and
reconfiguration.
Module 5: Leader Election
What is leader election, why we need leader, main roles and
5 5
responsibilities of leader, leader election via lease, leader election via
queue messages.
Module 6: Storage Services
Introduction to data storage services, data temperature, object storage
6 6
services, database storage services, backup restore and disaster
recovery.
Total lectures 32

Suggested Text Book(s):

Cloud Computing: Concepts, Technology & Architecture, by Zaigham Mahmood,

Thomas Erl, Ricardo Puttini, Prentice Hall, ISBN: 9780133387568
Wilder, B. (2012). Cloud architecture patterns: using microsoft azure. " O'Reilly
Media, Inc.".

Suggested Reference Book(s):

Srinivasan, V., Ravi, J., & Raj, J. (2018). Google Cloud Platform for Architects:
Design and manage powerful cloud solutions. Packt Publishing Ltd.
Other useful resource(s):
This course is designed based on famous course provided by Microsoft. Links to
courses and content are as follows:
https://courses.edx.org/courses/course-
v1:Microsoft+DEVOPS200.9x+3T2019/course/
https://azure.microsoft.com/en-in/blog/architecting-distributed-cloud-applications-
free-video-course/
https://www.youtube.com/watch?v=xJMbkZvuVO0&list=PL9XzOCngAkqs0Q8Z
RdafnSYExKQurZrBY

EvaluationScheme:

S No Exam Marks Duration Coverage / Scope of Examination

1 T-1 15 1 Hour. Syllabus covered upto T-1
2 T-2 25 1.5 Hours Syllabus covered upto T-2
3. T-3 35 2 Hours Entire Syllabus
Assignment (2) - 10
Entire
4. Teaching Assessment 25 Quizzes(2) -10
Semester
Attendance - 5

88
Course Outcomes (COs) contribution to the Programme Outcomes(POs)

Course outcomes
(Parallel and
Distributed
Algorithms )
CO-1 3 3 2 1 1 1 1 1 1 1 1 1
CO-2 3 3 3 2 2 1 1 1 1 1 3 1
CO-3 3 3 3 2 2 2 1 1 1 1 3 1
CO-4 3 3 3 2 2 1 1 1 1 1 3 1
Average

89
30. ARCHITECTING DISTRIBUTED CLOUD APPLICATION LAB

COURSE CODE:
COURSE CREDITS: 1
CORE/ELECTIVE:
L-T-P: 0-0-2
Pre-requisite: Cloud Computing, Basic Networking
Course Objectives:

1. Learn to create a VM on Microsoft Azure cloud.

2. Create Docker and install container on the docker.
3. Learn to run network, communication and storage services for cloud application on
containers.

Course Outcomes:

Level of
S No Course Outcomes
Attainment
Install Docker and container. Deploy virtual machine on Microsoft
CO1 Usage
Azure.
CO2 Create sample micro service on cloud container Usage
CO3 Perform messaging service on cloud containers Usage
CO4 Learn about storage service on cloud containers Usage

Lab Requirements
You will require the following to successfully complete the labs in this course. Both
items listed below can be set up as directed during the lab steps and need not be
configured before you start the labs.
Subscriptions
An Azure Subscription: You can use your own Microsoft Azure subscription to
complete certain lab tasks. If you do not have an Azure subscription, you can follow the
details on the Create your Azure free account today page.
A Visual Studio Team Services (VSTS) account will be required to complete some of
the ab steps in this course. If you do not have a VSTS account, sign up for a free
account on the Visual Studio page.

List of Experiments

S No Description Hours
Deploy a Microsoft Azure Virtual Machine using free account.
1 4
Create an account on Visual Studio Team Services (VSTS).
2 Install Docker on Ubuntu Machine. 4
3 Create a container image and run the container 4
4 Build a Sample Application with Microservices 4

90
5 Message Communication of Distributed Cloud Applications 4
6 Storage Services for Distributed Cloud Applications 4
7 Small Project using cloud application services 4
Total Lab hours 28

Suggested/Resources:
This course is designed based on famous course provided by Microsoft. Links to courses and
content are as follows:
https://courses.edx.org/courses/course-v1:Microsoft+DEVOPS200.9x+3T2019/course/
https://azure.microsoft.com/en-in/blog/architecting-distributed-cloud-applications-free-
video-course/
https://www.youtube.com/watch?v=xJMbkZvuVO0&list=PL9XzOCngAkqs0Q8ZRdaf
nSYExKQurZrBY

Evaluation Scheme:
1 Mid Sem. Evaluation 20 Marks
2 End Sem. Evaluation 20 Marks
3 Attendance 15 Marks
4 Lab Assessment 45 Marks
Total 100 marks

Course Outcomes (COs) contribution to the Programme Outcomes (POs)

CO/PO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 Average
CO1 3 3 2 1 1 1 1 1 1 1 1 1
CO2 3 3 3 2 2 1 1 1 1 1 3 1
CO3 3 3 3 2 2 2 1 1 1 1 3 1
CO4 3 3 3 2 2 1 1 1 1 1 3 1
Average

91
31. Optimization Methods in Business Analytics
COURSE CODE: XXX
COURSE CREDITS: 3
CORE/ELECTIVE: CORE
L-T-P: 3-0-0

Pre-requisite: Algorithm design

Course Objectives:
1. Learn the analytics of optimize algorithms.
2. Learn various computing algorithms in solving complex problems.
3. Apply important algorithmic design paradigms and method of analysis.
4. Synthesize efficient algorithm design in common engineering design situations.
5. Learn to analyze specifications and sensitivity of the algorithms.
6. Learn the improvisations of algorithms.

Course Outcomes:

Level of
S No Course Outcomes
Attainment
CO-1 Comprehension of the optimize algorithms design. Familiarity
CO-2 Demonstrate a familiarity with major algorithms. Assessment
CO-3 Analyze the different types of algorithm. Assessment
CO-4 Apply algorithms for simulating the decision. Usage

Course Contents:

Lectures
Unit Contents
required
Introduction to optimization technique: Examples of optimization
problems: Shortest path problem, integer knapsack; Unconstrained
1 optimization; Unconstrained optimization; Convex set and Convex 8
function; Duality: Geometric interpretation, Lagrangian Saddle point,
Weak and strong duality.
Linear programming: Linear programming problem; Basic feasible
solution ; Geometric solution; Optimality condition and simplex
2 8
method; Two phase simplex method; Interior point method, Duality in
linear programming, Karmarkars method.
Transportation problem: Characteristics of transportation problem;
Northwest Corner Method ;
Method
3 6
Assignment problem: Characteristics of assignment problem,
Hungarian methods, Dual of assignment problem, optimality of
Hungarian methods.

92
Integer programming: Complexity of simplex methods; Elementary
notions; Formulation; Solving 0-1 problem; Branch-Bound for integer
4 8
programming; Cutting plane problem; All integer primal and Dual
algorithm;
Network models: Characteristics of network models ; Shortest path
5 problem; Successive shortest path problem; Maximum flow problem; 6
Minimum cost flow problem.
Non linear programming: Quadratic programming: Lagrange
multiplier and KKT , Steepest descent method.
6
6 Sensitivity analysis: dummy variable, linear programming, integer
linear programming, non linear models and statistical test : t test, chi
square test, Wilcoxon signed rank
Total lectures 42

Suggested Text Book(s):

Singiresu S. Rao, Engineering Optimization: Theory and Practice by John Wiley
and Sons, 4th edition, 2009.
H. S. Kasene & K. D. Kumar, Introductory Operations Research, Springer (India), Pvt.
Ltd., 2004
Optimization for Engineering Design. K Deb.
Suggested Reference Book(s):
Sheskin, David J. (2003) Handbook of Parametric and Nonparametric Statistical
Procedures. CRC Press.
Optimization concepts and applications in engineering, A. D. Belegundu and T. R.
Chandrupatla.
Linear and Nonlinear programming. Stephen G. Nash and A. sofer
Other useful resource(s):
Link to NPTEL course contents: https://nptel.ac.in/courses/111/105/111105039/
Link to NPTEL course contents : https://nptel.ac.in/courses/111/104/111104068/
Link to NPTEL course contents : https://nptel.ac.in/courses/112/106/112106131/
Link to topics related to course:
https://nptel.ac.in/courses/112/106/112106134/
https://nptel.ac.in/courses/112/106/112106131/
https://nptel.ac.in/courses/106104019/26
https://nptel.ac.in/courses/111/105/111105039/

Evaluation Scheme:

Coverage / Scope of
S No Exam Marks Duration
Examination
1 T-1 15 1 Hour. Syllabus covered upto T-1
2 T-2 25 1.5 Hours Syllabus covered upto T-2
3 T-3 35 2 Hours Entire Syllabus
Assignment (2) - 10
4 Teaching Assessment 25 Entire Semester Quizzes (2) - 10
Attendance - 5

93
Course Outcomes (COs) contribution to the Programme Outcomes(POs)

Course outcomes
(Parallel and
Optimization
Methods in Business
Analytics)
CO-1 2 2 2 2 2 1 1 1 2 2 2 2
CO-2 2 3 3 3 3 1 1 1 2 2 1 2
CO-3 2 2 2 2 3 1 1 1 2 2 1 2
CO-4 2 3 3 3 2 1 1 1 2 3 2 2
Average

94
32. From Graph to Knowledge Graph

COURSE CODE: XXX

COURSE CREDITS: 2
CORE/ELECTIVE: CORE
L-T-P: 2-0-2
Pre-requisite: Basic programming skills
Course Objectives:
1. You will learn graph representations.
2. Understand the entire process of how to design, construct, and query a knowledge
graph to solve real-world problems.
3. Understand how to apply the tools and infrastructure to build and query knowledge
graphs.
4. Use knowledge graphs in modern search applications.

Course Outcomes:
Level of
S No Course Outcomes
Attainment
CO-1 Learn graph representations Familiarity
CO-2 Utilize fundamentals to build knowledge graphs Assessment
Understand the algorithms and techniques for crawling web sites,
CO-3 structured data extraction, and information extraction from Assessment
unstructured text.
Understand how to apply the tools and infrastructure to build and
CO-4 Usage
query knowledge graphs.

Course Contents:

Lectures
Unit Contents
required
Introduction and Overview
1 5
Introduction to Graphs, Introduction to Knowledge graphs
Graph Properties and Applications:
2 5
Graph basics, Graph Applications
Graph Representation Learning
3 5
Embeddings and Graph Embeddings
Knowledge Graph (KG) - Fundamentals and Construction.
4 KG Fundamentals 6
How to Build a Knowledge Graph
Knowledge Graph (KG) - Inference and Applications
KG Inference.
5 6
How to Use a Knowledge Graph
Why We Need Knowledge Graphs: Applications KG Applications
6 Knowledge graph analytics 5
Total lectures 32

95
Suggested Text Book(s):
Fensel, Diete
.
Qi, G. -981-10-8177-4

Suggested Reference Book(s):

Jeff Z. Pan, Guido Vetere, Jose Manuel Gomez-Perez, Honghan Wu
Springer International
Publishing, Print ISBN 978-3-319-45652-2, DOI https://doi.org/10.1007/978-3-319-
45654-6
- er,
DOI: 10.1007/978-3-030-12375-8

Other useful resource(s):

-

Evaluation Scheme:

S No Exam Marks Duration Coverage / Scope of Examination

1 T-1 15 1 Hour. Syllabus covered upto T-1
2 T-2 25 1.5 Hours Syllabus covered upto T-2
3. T-3 35 2 Hours Entire Syllabus
Assignment (2) - 10
Entire
4. Teaching Assessment 25 Quizzes (2) - 10
Semester
Attendance - 5

Course Outcomes (COs) contribution to the Programme Outcomes (POs)

Course outcomes
(Parallel and
Distributed
Algorithms )
CO-1 2 2 2 2 2 1 1 1 2 2 2 2 1.75
CO-2 2 3 3 3 3 1 1 1 2 2 1 2 2
CO-3 2 2 2 2 3 1 1 1 2 2 1 2 1.75
CO-4 2 3 3 3 2 1 1 1 2 3 2 2 2.08
Average 2 2.5 2.5 2.5 2.5 1 1 1 2 2.25 1.5 2 1.89

96
33. From Graph to Knowledge Graph Lab

COURSE CODE: XXX

COURSE CREDITS: 1
CORE/ELECTIVE: CORE
L-T-P: 0-0-2
Pre-requisite: Basic programming skills
Course Objectives:
1. The lab is designed to provide a versatile means to perform learning tasks over a
knowledge graph.
2. Use Machine Learning over a Knowledge Graph

Course Outcomes:

S No Course Outcomes Level of Attainment

CO1 Build a knowledge graph from documents Usage
CO2 Building a knowledge graph from text Usage
CO3 Build a Small Knowledge Graph Usage
CO4 Understand the Graph Databases Assessment
CO5 Familarity with graph computing Frameworks Familiarity
CO6 Able to Visualization of graphs Assessment

List of Experiments

S No Description Hours
Introduction to Linked Data.
1 Loan Prediction Practice Problem (Using Python) 2
Build a knowledge graph from documents
Build a Small Knowledge Graph Creating and Processing Linked Data
2 Building a knowledge graph from text 2
A Knowledge Graph understanding and implementation
Build a Small Knowledge Graph
3 2
Building a knowledge graph in python from scratch
Introduction to Graph Databases
4 3
A Python Library for Knowledge Graph Embedding
5 Introduction to graph computing Frameworks 2
6 Introduction to Graph Visualization 3
Total Lab hours 14

Suggested/Resources:
Grakn KGLIB (Knowledge Graph Library) https://github.com/.
Online resources.
e

97
.

Evaluation Scheme:

1 Mid Sem. Evaluation 20 Marks

2 End Sem. Evaluation 20 Marks
3 Attendance 15 Marks
4 Lab Assessment 45 Marks
Total 100 marks

Course Outcomes (COs) contribution to the Programme Outcomes(POs)

CO/PO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 Avg
CO1 3 3 3 3 2 2 1 1 1 1 1 1 1.83
CO2 3 3 3 3 3 1 1 1 1 1 1 3 2.00
CO3 3 3 2 3 2 3 2 1 1 1 2 1 2.00
CO4 3 3 3 2 3 2 1 1 1 1 1 1 1.83
CO5 2 2 3 3 3 3 1 1 1 1 1 1 1.83
C06 2 3 3 3 2 2 2 2 2 2 2 2 2.25
Avg 2.67 2.83 2.80 2.80 2.60 2.20 1.20 1.00 1.00 1.00 1.20 1.40

98
34. Probabilistic Graphical Models

COURSE CODE: XXX

COURSE CREDITS: 3
CORE/ELECTIVE: CORE
L-T-P: 3-0-0
Pre-requisite: Machine learning and Probability
Course Objectives:
1. Learn introductory concepts in probabilistic graphical models.
2. Able to model problems using graphical models.
3. Able to model problems using design inference algorithms.
4. Learn the structure of the graphical model from data

Course Outcomes:
Level of
S No Course Outcomes
Attainment
CO-1 Learn introductory concepts in probabilistic graphical models Familiarity
CO-2 Able to model problems using graphical models. Assessment
CO-3 Able to model problems using design inference algorithms. Assessment
CO-4 Analyze the structure of the graphical model from data Usage

Course Contents:

Lectures
Unit Contents
required
Fundamentals I:
Fundamentals of Probability Theory - Views of Probability, Random
1 Variables and Joint Distributions, Conditional Probability, Conditional 3
Independence, Expectation and Variance, Probability Distributions -
Conjugate Priors, Introduction to Exponential Family;
Fundamentals II: Fundamentals of Graph Theory Nodes and Edges,
2 3
Paths and Trails, Cliques, Subgraphs, Cycles and Loops.
Graphical Models I: Introduction - Directed Models (Bayesian Network),
3 Undirected Models (Markov Random Fields), Dynamic Models (Hidden 6
Markov Model & Kalman Filters) and Factor Graph;
Graphical Models II: Conditional Independence (Bayes Ball Theorem
and D-separation), Markov Blanket, Factorization (Hammersley-Clifford
4 6
Theorem), Equivalence (I-Maps & Perfect Maps); Factor Graphs -
Representation, Relation to Bayesian Network and Markov Random Field.
Inference in graphical models I: Exact Inference - Variable Elimination,
Elimination Orderings, Relation to Dynamic Programming, Dealing with
5 6
Evidence, Forward-Backward Algorithm, Viterbi Algorithm; Junction
Tree Algorithm; Belief Propagation (Sum Product);

99
Inference in graphical models I I: Approximate Inference - Variational
Methods (Mean Field, Kikuchi & Bethe Approximation), Expectation
Propagation, Gaussian Belief Propagation; MAP Inference - Max-Product,
6 6
Graph Cuts, Linear Programming Relaxations to MAP (Tree-Reweighted
Belief Propagation, MPLP); Sampling - Markov Chain Monte Carlo,
Metropolis Hastings, Gibbs (Collapsing & Blocking), Particle filtering
Learning in Graphical Models I: Overview, Parameter Estimation -
7 Expectation Maximization, Maximum Likelihood Estimation, Maximum 6
Entropy, Pseudolikelihood, Bayesian Estimation, Conditional Likelihood,
Learning in Graphical Models II: Structured Prediction; Learning with
8 Approximate Inference; Learning with Latent Variables; Structure 6
Learning, Structure Search, L1 priors.
Total lectures 42

Suggested Text Book(s):

Koller, D. and Friedman, N. (2009). Probabilistic Graphical Models: Principles and

Techniques. MIT Press.

Suggested Reference Book(s):

Jensen, F. V. and Nielsen, T. D. (2002). Bayesian Networks and Decision Graphs.

Information Science and Statistics. Springer, 2nd edition.
Kevin P. Murphy (2013) Machine Learning: A Probabilistic Perspective. 4th Printing.
MIT Press.
Barber, D. (2011). Bayesian Reasoning and Machine Learning. Cambridge University
Press, 1st edition.
Bishop, C. M. (2011). Pattern Recognition and Machine Learning (Information
Science and Statistics). Springer, 2nd printing.
Wainwright, M. and Jordan, M. (2008). Graphical Models, Exponential Families, and
Variational Inference. Foundations and Trends in Machine Learning, 1:1 305.

Other useful resource(s):

Conference papers and journal articles

Evaluation Scheme:

Coverage / Scope of
S No Exam Marks Duration
Examination
1 T-1 15 1 Hour. Syllabus covered upto T-1
2 T-2 25 1.5 Hours Syllabus covered upto T-2
3 T-3 35 2 Hours Entire Syllabus
Assignment (2) - 10
Teaching Entire
4 25 Quizzes (2) - 10
Assessment Semester
Attendance - 5

100
Course Outcomes (COs) contribution to the Programme Outcomes (POs)

Course outcomes
(Parallel and
Distributed
Algorithms )
CO-1 2 2 2 2 2 1 1 1 2 2 2 2 1.75
CO-2 2 3 3 3 3 1 1 1 2 2 1 2 2
CO-3 2 2 2 2 3 1 1 1 2 2 1 2 1.75
CO-4 2 3 3 3 2 1 1 1 2 3 2 2 2.08
Average 2 2.5 2.5 2.5 2.5 1 1 1 2 2.25 1.5 2 1.89

101
35. Image Analysis and Pattern Recognition

COURSE CODE: XXX

COURSE CREDITS: 2
CORE/ELECTIVE: CORE
L-T-P: 2-0-0

Pre-requisites: Linear algebra, Matrices, Matrix Operations, Determinants, Systems of Linear

Equations, Eigen values, Eigenvectors, Statistics and probability, Programming experience,
preferably in matlab, and/or C/C++/C#/Python/Java
Objective:
The aim of the course is to introduce the student to various image processing techniques. The
student learns about image fundamentals, describes the main characteristics of digital images,
how they are represented, mathematical transforms such as such as Fourier, Cosine transforms,
Singular value decomposition, 2D Wavelet transform, image enhancement techniques, Image
restoration and denoising, segmentation, lossy and lossless data compression algorithms,
binary and color image processing. The student will be exposed to dealing with image data
through programming assignments using matlab, and/or C/C++/C#/Python/Java.
Learning Outcome:
Upon completion of this course, a successful student should be able to design and implement
programs that deal with image data.
To understand how digital images are represented, manipulated, encoded and
processed, with emphasis on algorithm design, implementation and performance
evaluation.
Emphasis will be to develop engineering skills and intuitive understanding of the tools
used in Image Processing.
The students would be encouraged to design and develop the image processing
algorithms/tools to real life problems.

Course Outcomes:

Level of
S No Course outcomes
Attainment
CO-1 To understand the different images and its processing Familiarity
To understand the concept of Image transformation
CO-2 Assessment
Algorithms/techniques
To understand the concepts of lossy and Lossless compression
CO-3 Assessment
Algorithms/techniques
To understand the concepts of Image enhancement and
CO-4 Assessment
Segmentation Algorithms/techniques
To understand the concepts of Image Restoration and Denoising Technical
CO-5
Algorithms/techniques skills
CO-6 To understand the concepts of Binary and Color image processing Assessment
To understand the concepts of Object recognition decision theoretic Technical
CO-7
methods and structural methods skills

102
Course contents:
S
Topic L
No
Introduction to Digital Image Processing
Introduction to images and its processing, Components of image processing
systems, image representations, Image file formats, Applications of digital image
1 3
processing, image sampling and quantization, Image Analysis, Intensity
transformations, contrast stretching, Correlation and convolution, Smoothing
filters, sharpening filters, gradient and Laplacian.
Image Transformation Techniques
Need for transform, Fourier, Cosine transforms, Haar, KL Transform, Singular
2 4
value decomposition, 2D Wavelet transform, Different properties of image
transform techniques.
Image Compression Basics
Concept of image compression, lossless techniques (Huffman Coding, Arithmetic
and Lempel-Ziv Coding, Other Coding Techniques) and lossy compression
3 4
techniques (Transform Coding & K-L Transforms, Discrete Cosine Transforms,
and BTC), Multi-Resolution Analysis, and Still Image Compression Standards
(JBIG and JPEG),
Image Enhancement
Enhancement in spatial and transform domain, histogram equalization
4 3
DirectionalSmoothing, Median, Geometric mean, Harmonic mean, Contraharmoni
c mean filters, Homomorphic filtering,Color image enhancement.
Image Restoration and Denoising
Image degradation, Type of image blur, Classification of image restoration
5 3
techniques, ,image restoration model, Linear and non linear restoration techniques,
Image denoising, Median filtering
Image Segmentation
Classification of image segmentation techniques, Boundary detection based
techniques, Point, line detection, Edge detection, Edge linking, local processing,
6 4
regional processing, Hough transform, Thresholding, Iterative thresholding, Otsu's
method, Moving averages, Multivariable thresholding, Region-based
segmentation, Watershed algorithm, Use of motion in segmentation
Binary and Color image processing
Binarization, Basic Set theory, Binary morphological operations and its properties,
7 Color Image Representation in MATLAB, Converting Between Color Spaces, The 3
Basics of Color Image Processing, Color Transformations, Spatial Filtering of
Color Images, Working Directly in RGB Vector Space
Object Recognition
Decision theoretic methods: Matching, Optimal statistical Classifier, Neural
8 network. 4
Structural methods: Matching shape numbers, String matching, Syntactic
recognition of string, Syntactic recognition of tree.
Total Hours 28

103
Recommended Books
Digital Image Processing, R.C. Gonzalez and R.E. Woods, 2nd edition, Pearson
Prentice Hall, 2008
Anil K. Jain, Fundamentals of Digital Image Processing, Prentice Hall, 1989.
Digital Image processing, S Jayaraman, TMH, 2012
William K. Pratt, Digital Image Processing, 3rd Edition, John Wiley, 2001.

Evaluation Scheme:

S
Exam Marks Duration Coverage/Scope of Examination
No
1 Test -1 15 1 hr. Syllabus covered up to Test- 1.
Syllabus covered up to Test- 2.
2 Test -2 25 1.5 hr.
3 Test -3 35 2 hr. Complete Syllabus.
Assignments/Homework/Small
Projects (5),
Quizzes (5),
Entire
4 Regularity in Attendance (5), 25 5+5+5+10
Semester
Researching and presenting a
technology review topic (10)

TOTAL = 100

Course Outcomes (COs) contribution to the Programme Outcomes(POs)

Course Level of
outcomes Attainment

To understand
the different 60
Familiarity 3 3 3 2 3 3 2 2 2 2 2 3
images and its %
processing
To understand
the concept
of Image
77
transformatio Assessment 3 3 3 2 2 2 2 2 2 2 2 3
%
n
Algorithms/te
chniques

104
To understand
the concepts
of lossy and
85
Lossless Assessment 3 3 3 2 3 2 2 2 2 2 2 3
%
compression
Algorithms/te
chniques
To understand
the concepts
of Image
enhancement 85
Assessment 3 3 3 2 3 2 2 2 2 2 2 3
and %
Segmentation
Algorithms/te
chniques
To understand
the concepts
of Image
Restoration Technical 85
3 3 3 2 3 2 2 2 2 2 2 3
and skills %
Denoising
Algorithms/te
chniques
To understand
the concepts
85
of Binary and Assessment 3 3 3 2 3 2 2 2 2 2 2 3
%
Color image
processing
To understand
the concepts
of Object
recognition
Technical 70
decision 3 3 3 3 3 3 2 2 3 2 3 3
skills %
theoretic
methods and
structural
methods
100 100 100 70 80 90 60 80 100 70 80 100
Weightage
% % % % % % % % % % % %

105
36. Image Analysis and Pattern Recognition Lab

COURSE CODE: XXX

COURSE CREDITS: 1
CORE/ELECTIVE: CORE
L-T-P: 0-0-2

Pre-requisite: programming, algorithm, matrix operations

Course Objectives: In this lab you will implement image processing techniques that you will
learn during the frontal course. Work in the lab will be carried out in Matlab and OpenCV

Course Outcomes:

Level of
S No Course Outcomes
Attainment
Introduction to basic image processing operations and histogram
CO1 Familiarity
algorithms
CO2 Introduction to image filtering in spatial and in frequency domains. Assessment
CO3 Introduction to image restoration. Assessment
CO4 Introduction of principles of the JPEG baseline coding system. Assessment
Getting familiar with OpenCV library. Basic processing of color Technical
CO5
images and introduction to video tracking using Camshift algorithm. skills
CO6 Analyze the systems using Laplace transform and Z-transform. Assessment

List of Experiments

S No Description Hours
Introduction to MATLAB. In this lab we will study basic image-processing
operations: image resizing and rotation, quantization and histogram
algorithms. We will analyze the effects of resizing and quantization on image
quality and the methods to improve the quality and avoid artifacts.
1 4
Histogram techniques allow us to analyze the distribution of gray levels in
image. In this lab we will study histogram, histogram normalization and
histogram equalization.Understand basics of MATLAB syntax, functions and
programming.
In this lab we'll study the properties of DFT and two practical applications:
1.Computation of convolution by two methods direct method (in spatial
2 4
domain) and indirect method (in frequency domain).
2.Computation of edge enhancement by unsharp masking.
In practical imaging systems the acquired image often suffers from effects of
blurring and noise. Image restoration algorithms are aimed to restore the
3 original undistorted image from its blurry and noisy version. The lab 4
experiment demonstrates the evolution of restoration algorithms from the
simple Inverse Filter, Pseudo Inverse Filter and Wiener Filter
Midsem exam 2

106
In this lab we will present the basic concepts used for JPEG coding and
experiment with different coding parameters.The JPEG standard provides a
powerful compression tool used worldwide for different applications. This
4 4
standard has been adopted as the leading lossy compression standard for
natural images due to its excellent compression capabilities and its
configurability.
OpenCV is an open source computer vision library, written in C and C++.
One of the main goals of OpenCV is to provide a simple-to-use computer
vision infrastructure that helps people to build sophisticated vision
5 4
applications quickly. Among the tools provided by OpenCV are image
transformations, histograms, video tracking, 3D vision algorithms and
machine learning.
Implementation of Camshift algorithm, Mean-shift algorithm
6 4
and Adaptive adjustment
End-semester Exam 2
Total Lab hours 28

Suggested/Resources:
R. C. Gonzalez, R. E. Woods and S. L. Eddins, Digital Image Processing using
MATLAB. Pearson Education, Inc., 2004 (Library Dewey number 621.368 GON).
OpenCV library: http://SourceForge.net/projects/opencvlibrary

Evaluation Scheme:
1 Mid Sem. Evaluation 20 Marks
2 End Sem. Evaluation 20 Marks
3 Attendance 15 Marks
4 Lab Assessment 45 Marks
Total 100 marks

Course Outcomes (COs) contribution to the Programme Outcomes (POs)

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 Avg
CO1 3 3 3 3 2 2 1 1 1 1 1 1 1.83
CO2 3 3 3 3 3 1 1 1 1 1 1 3 2.00
CO3 3 3 2 3 2 3 2 1 1 1 2 1 2.00
CO4 3 3 3 2 3 2 1 1 1 1 1 1 1.83
CO5 2 2 3 3 3 3 1 1 1 1 1 1 1.83
C06 2 3 3 3 2 2 2 2 2 2 2 2 2.25
Avg 2.67 2.83 2.80 2.80 2.60 2.20 1.20 1.00 1.00 1.00 1.20 1.40

107
37. Statistics and Exploratory Data Analytics

COURSE CODE: XXX

COURSE CREDITS: 2
CORE/ELECTIVE:
L-T-P: 2-0-2
Pre-requisite: None
Course Objectives:
1. Learn basic concept of statistics and exploratory data analysis.
2. Learn graphical and modeling techniques for exploring data.
3. Learn Data Transformation and dimensionality reduction of data.
4. Learn data clustering and scatter plots.
5. Apply exploratory data analysis techniques to visualized data.

Course Outcomes:
Level of
S No Course Outcomes
Attainment
CO-1 Analyze the concept of statistics and exploratory data analysis. Familiarity
CO-2 Graphical and modeling techniques for exploring data. Assessment
CO-3 Implement data transformation, dimensionality reduction Assessment
Apply data clustering and visualized exploratory data through various
CO-4 Usage
plots and graphs.

Course Contents:
Lectures
Unit Contents
required
Concept of statistics and exploratory data analysis: Introduction of data
and its types (categorical and quantitative), Central Tendency: mean,
1 6
median, mode, variance, standard deviation, skewness, kurtosis,
exploratory data analysis and its types, data dimensionality.
Graphical and modeling techniques for exploratory data: Box Plot,
2 Histogram, Multi-Vari Chart, Run Chart, Pareto Chart, Scatter Plot, Stem- 6
and-leaf plot.
Data transformation, dimensionality reduction: Power
3 transformation, standardization, multidimensional scaling, principal 8
component analysis, linear or non linear dimensionality reduction.
Data Clustering Techniques: Data clustering, Hierarchal methods,
4 6
optimization method, k-means and model based clustering.
Smoothing scatter plots and graphical methods for EDA: Bivariate
5 distribution smooths, curve fitting toolbox, Dendrogram, treemaps, 6
rectangle plots.
Total lectures 32

108
Suggested Text Book(s):

Martinez, W. L.; Martinez, A. R. & Solka, J. (2010). Exploratory Data Analysis with
MATLAB, second edition. Chapman & Hall/CRC.
Hoaglin, D C; Mosteller, F & Tukey, John Wilder (Eds) (1983). Understanding Robust
and Exploratory Data Analysis.
Andrienko, N & Andrienko, G (2005) Exploratory Analysis of Spatial and Temporal
Data. A Systematic Approach

Suggested Reference Book(s):

Tukey, John Wilder (1977). Exploratory Data Analysis. Addison-Wesley

Evaluation Scheme:

Coverage / Scope of
S No Exam Marks Duration
Examination
1 T-1 15 1 Hour. Syllabus covered upto T-1
2 T-2 25 1.5 Hours Syllabus covered upto T-2
3 T-3 35 2 Hours Entire Syllabus
Assignment (2) - 10
Entire
4 Teaching Assessment 25 Quizzes (2) - 10
Semester
Attendance - 5

Course Outcomes (COs) contribution to the Programme Outcomes(POs)

Course outcomes
(Parallel and
Distributed
Algorithms )
CO-1 2 2 2 2 2 1 1 1 2 2 2 2
CO-2 2 3 3 3 3 1 1 1 2 2 1 2
CO-3 2 2 2 2 3 1 1 1 2 2 1 2
CO-4 2 3 3 3 2 1 1 1 2 3 2 2
Average

109
38. Statistics and Exploratory data analytics Lab

COURSE CODE: XXX

COURSE CREDITS: 1
CORE/ELECTIVE: CORE
L-T-P: 0-0-2
Pre-requisite: Basic knowledge of python programming and Matlab.
Course Objectives:
1. Learn exploring dataset
2. Visualization of data
3. Dimensionality reduction of data
4. Cluster findings in dataset
5. Usage of curve fitting tools

Course Outcomes:
S No Course Outcomes Level of Attainment
CO1 Understand basics of MATLAB syntax/python libraries Familiarity
CO2 Exploring dataset and visualizing data on different charts. Assessment
Perform the basic operations of data pre-processing and Assessment
CO3
dimensionality reduction.
CO4 Design and analyze clustering techniques. Usage
CO5 Understanding of curve fitting toolbox. Usage
CO6 Implementation of dendrogram and tree maps. Usage

List of Experiments

S No Description Hours
1 Introduction to MATLAB/Python Libraries 2
2 Exploring dataset and data preprocessing 2
3 Importing dataset in python 2
4 Implementation of standard deviation and skewness of data 2
5 Visualizing data on histogram 2
6 Implementations of box plot chart 2
7 Implementation of data representation in pie chart 2
8 Implementation of data representation in scatter plot 2
9 Implementation of column chart 2
10 Implementation of principal component analysis techniques 2
11 Implementation of nonlinear dimensionality reduction 2
12 Finding cluster in dataset 2
13 Implementation of hierarchal clustering techniques 2
14 Implementation of curve fitting toolbox 2
Total Lab hours 28

110
Suggested/Resources:
Martinez, W. L.; Martinez, A. R. & Solka, J. (2010). Exploratory Data Analysis with
MATLAB, second edition. Chapman & Hall/CRC.
Hoaglin, D C; Mosteller, F & Tukey, John Wilder (Eds) (1983). Understanding Robust
and Exploratory Data Analysis.

Evaluation Scheme:
1 Mid Sem. Evaluation 20 Marks
2 End Sem. Evaluation 20 Marks
3 Attendance 15 Marks
4 Lab Assessment 45 Marks
Total 100 marks

Course Outcomes (COs) contribution to the Programme Outcomes (POs)

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 Avg
CO1 3 3 3 3 2 2 1 1 1 1 1 1 1.83
CO2 3 3 3 3 3 1 1 1 1 1 1 3 2.00
CO3 3 3 2 3 2 3 2 1 1 1 2 1 2.00
CO4 3 3 3 2 3 2 1 1 1 1 1 1 1.83
CO5 2 2 3 3 3 3 1 1 1 1 1 1 1.83
C06 2 3 3 3 2 2 2 2 2 2 2 2 2.25
Avg 2.67 2.83 2.80 2.80 2.60 2.20 1.20 1.00 1.00 1.00 1.20 1.40

111
39. Information Visualization
COURSE CODE: XXX
COURSE CREDITS: 3
CORE/ELECTIVE: CORE
L-T-P: 3-0-0
Pre-requisite: Basic mathematics courses
Course Objectives:
1. Information visualization offers instruments for reasoning about quantitative
information, analyzing and communicating statistical information.
2. The course overviews the main typologies of data graphics (data-maps, time-series,
space-time narrative, relational diagrams, graphs and methods for dimensionality
reduction)
3. The course provides a language for discussing data visualizations combined with
knowledge of the human perception of visual objects.

Course Outcomes:

Level of
S No Course Outcomes
Attainment
CO-1 Big Data and Large-Scale Computation, Web Technologies Familiarity
CO-2 Applications and Science, Signal Processing and Data Science tracks Assessment
Game Design and Production and Machine Learning, Data Science and
CO-3 Assessment
Artificial Intelligence majors
Machine Learning, Data Science and Artificial Intelligence, Analytics
CO-4 and Data Science minor. Usage
ICT Innovation programme's Data Science, Digital Media Technology,
Human-Computer Interaction minor, and Life Science Technologies
CO-5 Usage
Complex Systems major and minor and Bioinformatics and Digital
Health minor.

Course Contents:

Lectures
Unit Contents
required
Foundations for an Applied Science of Data Visualization:
Visualization Stages, Experimental Semiotics Based on Perception,
1 6
Affordance Theory, A Model of Perceptual Processing, Costs and
Benefits of Visualization, Types of Data, Metadata
The Environment, Optics, Resolution, and the Display: The
2 4
Environment, The Eye, The Optimal Display
Lightness, Brightness, Contrast, and Constancy: Neurons, Receptive
Fields, and Brightness Illusions, Luminance, Brightness, Lightness, and
3 4
Gamma, Perception of Surface Lightness, Monitor Illumination and
Monitor Surrounds

112
Color: Trichromacy Theory, Color Measurement, Opponent Process
4 Theory, Properties of Color Channels, Color Appearance, Applications of 4
Color in Visualization
Visual Salience and Finding Information: Eye Movements, V1,
Channels, and Tuned Receptors, Preattentive Processing and Ease of
5 6
Search, Integral and Separable Dimensions: Glyph Design, Representing
Quantity, The Searchlight Metaphor and Cortical Magnification
Static and Moving Patterns: Gestalt Laws, Texture: Theory and Data
Mapping, Perception of Transparency: Overlapping Data, Perceiving
Patterns in Multidimensional Discrete Data, Pattern Learning, The Visual
6 6
Grammar of Node Link Diagrams, The Visual Grammar of Maps,
Patterns in Motion, Perception of Animated Motion, The Processes of
Pattern Finding
Space Perception: Depth Cue Theory, Depth Cues in Combination,
Task-Based Space Perception, Tracing Data Paths in 3D Graphs, Judging
the Morphology of Surfaces, Patterns of Points in 3D Space, Perceiving
7 Patterns in 3D Trajectories, Judging Relative Positions of Objects in 6
Space, Judging the Relative Movements of Self within the Environment,

Aesthetic Impression of 3D Space (Presence)

Visual Objects and Data Objects: Image-Based Object Recognition,
Structure-Based Object Recognition, The Object Display and Object-
8 Based Diagrams, Faces, Coding Words and Images, Labels and Concepts, 6
Concept Mapping, Iconic Images versus Words versus Abstract Symbols,
Scenes and Scene Gist
Total lectures 42

Suggested Text Book(s):

Ware, C., 2020. Information visualization: perception for design. Morgan Kaufmann.

Suggested Reference Book(s):

Bederson, B.B., Bederson, B.B. and Shneiderman, B. eds., 2003. The craft of
information visualization: readings and reflections. Morgan Kaufmann.
Bergman, E. ed., 2000. Information appliances and beyond: interaction design for
consumer products. Morgan Kaufmann.

Other useful resource(s):

https://www.youtube.com/watch?v=t0B2sxIumh0&list=PLk_jmmkw5S2C1A_ZD3mp
Bb3Og_Y1QZ83Z
https://www.youtube.com/watch?v=IKSRwGZe8Oc

113
Evaluation Scheme:

Coverage / Scope of
S No Exam Marks Duration
Examination
1 T-1 15 1 Hour. Syllabus covered upto T-1
2 T-2 25 1.5 Hours Syllabus covered upto T-2
3 T-3 35 2 Hours Entire Syllabus
Assignment (2) - 10
4 Teaching Assessment 25 Entire Semester Quizzes(2) -10
Attendance - 5

Course Outcomes (COs) contribution to the Programme Outcomes (POs)

Course outcomes
(Parallel and
Distributed
Algorithms )
CO-1 2 2 2 2 2 1 1 1 2 2 2 2 1.75
CO-2 2 3 3 3 3 1 1 1 2 2 1 2 2
CO-3 2 2 2 2 3 1 1 1 2 2 1 2 1.75
CO-4 2 3 3 3 2 1 1 1 2 3 2 2 2.08
CO-5 2 3 3 3 2 1 1 1 2 3 2 2 2.08
Average 2 2.6 2.6 2.6 2.4 1 1 1 2 2.4 1.6 2

114
40. Introduction to Deep Learning

COURSE CODE: XXX

COURSE CREDITS: 3
CORE/ELECTIVE: CORE
L-T-P: 3-0-0
Pre-requisite:
1) Basic knowledge of Python.
2) Basic linear algebra and probability.
Course Objectives:
1. The goal of this course is to give learners basic understanding of modern neural
networks and their applications in computer vision and natural language understanding.
2. The course starts with a recap of linear models and discussion of stochastic
optimization methods that are crucial for training deep neural networks.
3. Learners will study all popular building blocks of neural networks including fully
connected layers, convolutional and recurrent layers.
4. Learners will use these building blocks to define complex modern architectures in
TensorFlow and Keras frameworks.
5. In the course project learner will implement deep neural network for the task of image
captioning which solves the problem of giving a text description for an input image.

Course Outcomes:

Level of
S No Course Outcomes
Attainment
CO-1 Linear regression: mean squared error, analytical solution. Familiarity
Logistic regression: model, cross-entropy loss, class probability
CO-2 Assessment
estimation
Gradient descent for linear models. Derivatives of MSE and cross-
CO-3 Assessment
entropy loss functions.
CO-4 The problem of overfitting. Usage
CO-5 Regularization for linear models. Usage

Course Contents:

Lectures
Unit Contents
required
Introduction to optimization: Linear regression, Linear classification
1 Gradient descent, Over fitting problem and model validation, Model 8
regularization, Stochastic gradient descent, Gradient descent extensions9m
Introduction to neural networks: Multilayer perceptron (MLP), Chain
rule, Backpropagation, Efficient MLP implementation, Other matrix
2 8
derivatives, what is TensorFlow, our first model in TensorFlow, What Deep
Learning is and is not, Deep learning as a language

115
Deep Learning for images: Motivation for convolutional layers11m
Our first CNN architecture, Training tips and tricks for deep CNNs,
3 6
Overview of modern CNN architectures, Learning new tasks with pre-
trained CNNs, A glimpse of other Computer Vision tasks8m
Unsupervised representation learning: Unsupervised learning: what it is
and why bother, Autoencoders 10, Autoencoder applications, Autoencoder
4 applications: image generation, data visualization & more, Natural language 6
processing primer, Word embeddings, Generative models 10, Generative
Adversarial Networks, Applications of adversarial approach
Deep learning for sequences: Motivation for recurrent layers, Simple
RNN and Backpropagation, The training of RNNs is not that easy, Dealing
5 8
with vanishing and exploding gradients, Modern RNNs: LSTM and GRU,
Practical use cases for RNNs
Final Project: In this week you will apply all your knowledge about neural
6 networks for images and texts for the final project. You will solve the task 6
of generating descriptions for real world images!
Total lectures 42

Suggested Text Book(s):

Ian Goodfellow, YoshuaB
Press, Cambridge, 2016.

2018.

Suggested Reference Book(s):

Josh Patterson, Adam Gibson, "Deep Learning: A Practitioner's Approach", 2nd
Edition, OReilly Media

deeplearning.ai

Other useful resource(s):

http://www.charuaggarwal.net/neural.htm
https://www.coursera.org/specializations/deep-learning

Evaluation Scheme:

Coverage / Scope of
S No Exam Marks Duration
Examination
1 T-1 15 1 Hour. Syllabus covered upto T-1
2 T-2 25 1.5 Hours Syllabus covered upto T-2
3 T-3 35 2 Hours Entire Syllabus
Assignment (2) - 10
Teaching
4 25 Entire Semester Quizzes(2) -10
Assessment
Attendance - 5

116
Course Outcomes (COs) contribution to the Programme Outcomes (POs)

Course outcomes
(Parallel and
Distributed
Algorithms )
CO-1 2 2 2 2 2 1 1 1 2 2 2 2 1.75
CO-2 2 3 3 3 3 1 1 1 2 2 1 2 2
CO-3 2 2 2 2 3 1 1 1 2 2 1 2 1.75
CO-4 2 3 3 3 2 1 1 1 2 3 2 2 2.08
CO-5 2 3 3 3 2 1 1 1 2 3 2 2 2.08
Average 2 2.6 2.6 2.6 2.4 1 1 1 2 2.4 1.6 2

117
41. Social Media

COURSE CODE: XXX

COURSE CREDIT: 2
CORE/ELECTIVE: ELECTIVE
L-T-P: 2-0-0
Pre-requisites: Graph Theory, Probability

Course Objectives:
1. Understanding the social media structure.
2. Understanding graph theory, particularly the algebraic description and analysis of
graphs and their use in social media studies.
3. Helping scientists, artists and sociologists understand complex social media phenomena
like information diffusion, marketing and recommendation systems in social mediaand
evolving systems.
4. Acquiring expertise to analyze the social and digital media markets.
5. Providing insight into processing, storing and visualizing big social media data and
social graphs.

Course outcomes:
Level of
S No Course Outcomes
Attainment
CO-1 Understand what constitutes Social and Digital Media Familiarity
CO-2 Algebraic Graph Analysis Assessment
CO-3 Design effective and reliable network research projects Assessment
Matrix and Tensor Factorization with Recommender System
CO-4 Assessment
Applications
CO-5 Graph Signal Processing in Social Media Assessment
CO-6 Big Data Analytics for Social Networks Assessment

Course Contents:
No of
S No Topics Topics Outcomes
Lectures
Dominant social networking/media
platforms
Graphs in Social and Digital
1 Collecting data from social media sites 4
Media
Social media graphs
Big data issues in social and digital media
Mathematical Preliminaries: Matrix decompositions
Graphs and Applications of graph analysis
2 4
Matrices&Algebraic Graph Graph clustering
Analysis Graph anomaly detection
Information Retrieval Background
Web Search Based on
3 Relevance Beyond the Web Page 4
Ranking
Ranking in Heterogeneous Networks

118
Graph construction approaches
Label Propagation and
Label inference methods
4 Information Diffusion in 4
Diffusion processes
Graphs
Social network diffusion models
Graph-Based Pattern Unsupervised Methods
5 Classification and Supervised Methods 4
Dimensionality Reduction Semi-Supervised Methods
Singular Value Decomposition on Matrices
Matrix and Tensor for Recommender Systems
Factorization with Higher Order Singular Value
6 4
Recommender System Decomposition (HOSVD) on Tensors
Applications A Real Geo-Social System-Based on
HOSVD
Hypergraphs
Multimedia Social Search Game-Theoretic approaches to uniform
7 Based on hypergraph clustering 4
Hypergraph Learning Spectral clustering for arbitrary
hypergraphs
Latent Model Adaptation
Semantic Model Adaptation Parallel and Distributed Approaches for Big
8 for Evolving Big Social Data Analysis 4
Data Applications to Evolving Social Data
Analysis
Total =
32

Suggested Text Book(s):

Pitas, Ioannis, ed. Graph-based social media analysis. Vol. 39. CRC Press, 2016.
Suggested Reference Book(s):
Analyzing Social Networks 1st Edition by Stephen P Borgatti, Martin G. Everett,
Jeffrey C. Johnson, SAGE Publications Ltd; 1 edition
Influence and Behavior Analysis in Social Networks and Social MediabyMehmet Kaya,
Reda Alhajj, Lecture Notes in Social Networks, Springer International Publishing
Emerging Research Challenges and Opportunities in Computational Social Network
Analysis and Mining by Nitin Agarwal, NimaDokoohaki, Serpil Tokdemir, Lecture
Notes in Social Networks, Springer International Publishing

Evaluation Scheme:

S No Exam Marks Duration Coverage / Scope of

Examination
1 T-1 15 1 hour. Syllabus covered upto Test-1
2 T-2 25 1.5 hours Syllabus covered upto Test-2
3 T-3 35 2 hours Syllabus covered upto Test-3
4 Teaching 25 Entire Assignment (2) - 10

119
Assessment Semester Quizzes (2) -10
Attendance - 5

Course Outcomes (COs) contribution to the Programme Outcomes (POs)

Course PO- PO- PO- PO- PO- PO- PO- PO- PO- PO- PO- PO-
Avg
outcomes 1 2 3 4 5 6 7 8 9 10 11 12
CO-1 3 3 3 2 2 3 2 2 2 3 1 3 2.4
CO-2 3 3 3 2 3 2 3 2 2 3 1 3 2.5
CO-3 3 3 3 2 2 3 1 2 3 3 1 3 2.4
CO-4 3 3 3 2 3 3 2 2 3 3 1 3 2.6
CO-5 3 3 3 2 3 3 2 2 3 3 1 3 2.6
CO-6 3 3 3 2 3 3 2 2 1 3 1 3 2.4
Average 3 3 3 2 2.7 2.8 2 2 2.3 3 1 3

120
42. Social Media Lab

COURSE CODE: XXX

COURSE CREDIT: 1
CORE/ELECTIVE: ELECTIVE
L-T-P: 0-0-2
Pre-requisites: Graph Theory, Probability, Statistics
Course Objectives:
1. To create a sustainable software and technical ecosystem driven by a large international
open-source community
2. To shares common interests in networks and complex systems
3. To focus on visualization and manipulation, simplicity and extensibility.
4. To complementthe statistical analysis to discover, extract and classify new patterns in
network structure and data.
Course Outcomes:

Level of
S No Course Outcomes
Attainment
To learn about interactive network exploration and visualization
CO-1 Familiarity
accompanied by the graph theory concepts that drive them
CO-2 To understand about the nuances of network visualization Assessment
CO-3 To understand a conceptual, and also an implementation perspective Assessment
CO-4 Getting Real-world Graph Datasets, explores various networks in Gephi Assessment
Exploring Dynamic and Multilevel Graphs, focuses on two special
CO-5 Assessment
kinds of graphs,dynamic graphs and multilevel graphs
Exploring Some Useful Gephi Plugins, describes a number of plugins
CO-6 that are extensively used by researchers and developers while working Assessment
with Gephi

Course Contents:

No of
S No Topics Topics Outcomes
Labs
The Network Perspective
Social Network The Network Analysis Research andPractitioner
Analysis Measuring, Landscape
1 Mapping, and Social Networks in the Era of Abundant 2
Modeling Collections Computation
of Connections Node-Link Diagrams: Visually MappingSocial
Networks
Downloading and Installing NodeXL
Getting Started with
Getting Started with NodeXL
NodeXL, Layout,
2 Layout: Arranging Vertices in the Graph Pane 2
Visual Design, and
Labeling Visual Design: Making Network Displays
Meaningful

121
Calculating and Kite Network Example
3 Visualizing Network Computing Graph Metrics 2
Metrics Les Misérables Co-Appearance Network
Serious Eats Network Example
Preparing Data and Filtering to Reduce Clutter and Reveal Important
4 2
Filtering Features
Putting It All Together
The 2007 Senate Voting Analysis
Clustering and
Les Misérables Character Clusters
5 Grouping 2
Federal Communications Commission (FCC)
Lobbying Coalition Network
Working with Email Data
Email: The Lifeblood leaning email Data in NodeXL
6 of Modern Analyzing Personal Email Networks 2
Communication Creating a Living Org-Chart with an Organizational
Email Network
Twitter
The Nuts and Bolts of Twitter
Conversation,
Networks in Twitter
7 Entertainment, and 2
Acquiring Data
Information,
All in One Network! Discovery with Twitter
Total = 14

Suggested Text Book(s):

Hansen, D., Shneiderman, B. and Smith, M.A., 2010. Analyzing social media networks
with NodeXL: Insights from a connected world. Morgan Kaufmann.Suggested
Reference Book(s):
Social Analytics: Network and Text Methods with NodeXL and R.1st Edition by Shaila
Miranda and Publisher Prospect Press
Influence and Behavior Analysis in Social Networks and Social MediabyMehmet Kaya,
Reda Alhajj, Lecture Notes in Social Networks, Springer International Publishing
Online Resources: -
https://www.youtube.com/user/brianbritt87/videos
Marc SmithTutorials
:https://www.youtube.com/watch?v=TiTxYSqPBaI&list=PL0FBF4A3DCF40BCE
2
Evaluation Scheme:

1 Mid Sem. Evaluation 20 Marks

2 End Sem. Evaluation 20 Marks
3 Attendance 15 Marks
4 Lab Assessment 45 Marks
Total 100 Marks

122
Course Outcomes (COs) contribution to the Program Outcomes (POs)

Course PO- PO- PO- PO- PO- PO- PO- PO- PO- PO- PO- PO-
Average
outcomes 1 2 3 4 5 6 7 8 9 10 11 12
CO-1 3 3 3 2 2 3 2 2 2 3 1 3 2.4
CO-2 3 3 3 2 3 2 3 2 2 3 1 3 2.5
CO-3 3 3 3 2 2 3 1 2 3 3 1 3 2.4
CO-4 3 3 3 2 3 3 2 2 3 3 1 3 2.6
CO-5 3 3 3 2 3 3 2 2 3 3 1 3 2.6
CO-6 3 3 3 2 3 3 2 2 1 3 1 3 2.4
Average 3 3 3 2 2.7 2.8 2 2 2.3 3 1 3

123
43. COMPUTER ANIMATION

COURSE CODE: XXX

COURSE CREDITS: 2
CORE/ELECTIVE: CORE
L-T-P: 2-0-0
Description
This course investigates the theory, algorithms and techniques for describing and programming
motion for animation worlds. Approaches that will be explored include key framing systems,
kinematics, motion of articulated figures, and procedural and behavioral systems.
Pre-requisite: Computer Graphics, C
Course Objectives: Students will be able
1. To learn the basic of animation
2. To learn the fundamentals of key framing and interpolation.
3. To understand the working of motion.
4. To understand animating behavior and articulated figures.
5. To learn the basic principles of motion capture and apply them to an animation
application.
6. To understand Human figure study through anatomy

Course Outcomes

Level of
S No Course Outcomes
Attainment
CO-1 Understand the basic of animation Familiarity
CO-2 Able to learn the fundamentals of key framing and interpolation. Assessment
CO-3 Understand the working of motion Familiarity
Demonstrate the skills for animating behavior and articulated
CO-4 Assessment
figures
CO-5 Able to learn the basic principles of motion capture Assessment
CO-6 To develop animation application and facial recognition Usage

Course Contents:

Lectures
Unit Contents
required
Introduction- Motion perception, Heritage of animation, Animation
production, Computer animation production, History of computer
1 4
animation, Technical Background- Spaces and transformations,
Orientation representation
Interpolating Values- Interpolation, Controlling the motion of a point
along a curve, Interpolation of orientations, Working with paths,
2 5
Interpolation-Based Animation- Key-frame systems, Animation
languages, Deforming objects, Three-dimensional shape interpolation,

124
Morphing (two-dimensional)
Kinematic Linkages- Hierarchical modeling, Forward kinematics, Inverse
kinematics, Motion Capture- Motion capture technologies, Processing the
3 images, Camera calibration, Three-dimensional position reconstruction, 6
Fitting to the skeleton, Output from motion capture systems, Manipulating
motion capture data
Physically Based Animation- Basic physic, Spring animation examples,
Particle systems, Rigid body simulation, Cloth, Enforcing soft and hard
4 6
constraints, Fluids- Liquids and Gases: Specific fluid models,
Computational fluid dynamics
Modeling and Animating Human Figures- Overview of virtual human
representation, Reaching and grasping, Walking, Coverings, Facial
5 6
Animation: Human face, Facial models, Animating the face, Lip-sync
animation
Behavioral Animation- Primitive behaviors, Knowledge of Environment,
6 Modeling intelligent behavior, Crowds, Special Models for Animation- 5
Implicit surfaces, Plants, Subdivision surfaces
Total lectures 32

Text Book
Computer Animation: Algorithms and Techniques, 3rd Edition, by Rick Parent
(Morgan Kauffmann, 2012), ISBN: 0124158420
Reference Books
Foundations of Physically Based Modeling & Animation by Donald H. House and John
C. Keyser CRC Press, 2016, ISBN: 9781482234602
Physics for Game Developers by David M. Bourg, O'Reilly, 2002, ISBN: 0596000065

Evaluation Scheme:

Coverage/ Scope of
S No Exam Marks Duration
Examination
1 T-1 15 1 Hour Syllabus covered upto T-1
2 T-2 25 1.5 Hours Syllabus covered upto T-2
3 T-3 35 2 Hours Entire Syllabus
Assignment (2) - 10
4 Teaching Assessment 25 Entire Semester Quizzes (2) - 10
Attendance - 5

125
Course Outcomes (COs) contribution to the Programme Outcomes (POs)

Course PO- PO- PO-

PO-1 PO-2 PO-3 PO-4 PO-5 PO-6 PO-7 PO-8 PO-9
outcomes 10 11 12
CO-1 1 1 1 1 1 1 1 1 1
CO-2 2 2 2 2 2 2
CO-3 3 3 3 3 3
CO-4 1 1 1 1 1 1 1 1 1
CO-5 3 3 3 3 3 3 3 3
CO-6 2 2 2 2 2 2 2 2 2 2 2

126
44. COMPUTER ANIMATION LAB

COURSE CODE: XXX

COURSE CREDITS: 1
CORE/ELECTIVE: CORE
L-T-P: 0-0-2
Description
The students will discover the fundamental principles of animation & to exploit these
fundamental principles to create convincing character motion.
Course Objectives: Students will be able
1. To learn the basic tool of animation
2. To learn the fundamentals of sketching and drawing.
3. To learn the design of animation character.
4. To develop animation application

Course Outcomes
Level of
S No Course Outcomes
Attainment
CO-1 Capable to work with basic Animator Drawing Tool Familiarity
CO-2 Demonstrate the skills for sketching and drawing. Assessment
CO-3 Capable to develop animation character Assessment
CO-4 Capable to develop animation application Usage

List of Experiments
Level of
S No Experiment
Attainment
Using Animato
Part 1 The Animation Table (light box), Field charts, Line Testing Camera, Familiarity
Peg bar, Punching Machine
Sketching and Drawing
Drawing for Animation, Exercises and Warm ups on Pegging Sheet,
Part 2 Assessment
Quick studies from real life, sequential movement drawing,
Caricaturing the action, thumbnails drawing for motion
Developing a Animation Character
Part 3 Incorporating various moods and shades of a character Various Assessment
gestures and facial expressions of the character
Anatomy and Body Language
Part 4 Front, side and back view of the character, Anatomy and Body Usage
Language of the character Caricaturing the character

127
Text book
The complete animation course by Chris Patmore Pub.-
(New York)
Reference book
Animation Unleashed by Ellen Bessen, Michael Weise Productions Pub.2008 (U.S.A)

Evaluation Scheme:
1 Mid Sem. Evaluation 20 Marks
2 End Sem. Evaluation 20 Marks
3 Attendance 15 Marks
4 Lab Assessment 45 Marks
Total 100 marks

Course Outcomes (COs) contribution to the Programme Outcomes (POs)

CO-1 1 1 2 1 3 1 1 2 1
CO-2 2 1 2 2 2 3 2 1
CO-3 3 2 3 2 2 3 3
CO-4 1 2 1 3 1 3 2 1 2

128
ANNEXUR-III

MULTIMEDIA DEVELOPMENT LAB-II

COURSE CODE: 10B28CI408
COURSE CREDITS: 1
CORE/ELECTIVE: CORE
L-T-P: 0-0-2

Course Objectives:
This course focuses on the development of applications that manipulate media assets.
Significant time is spent on intermediate to advanced programming and scripting as well as the
synchronization of aural and graphical components. Students are required to plan, design and
implement lab projects.

Course Outcomes:
Level of
S No Course Outcomes
Attainment
To learn how to design and develop multimedia for real world e-
learning, practice software engineering in a learner-oriented
CO1 Familiarity
project and to learn and apply cognitive principles of user
interface design.
To learn how to implement multimedia e-leaning in Macromedia
Flash, Demonstrate mastery of scripting in a multimedia
CO2 development environment, Create multi-user multimedia Technical Skills
applications and Use the basic tools used by an Android
programmer.
Configure an Android emulator and a hardware connection to an
CO3 Android device, Describe the Android development lifecycle and Technical Skills
Define XML and give examples of how it is used to express data.
Write interactive programs on the Android, Demonstrate the use
of activity lifecycles to control an app and Analyze a design's
CO4 Technical Skills
ability to support multiple screen resolutions and natural
languages.
Design dynamic UIs using fragments and the Android support
CO5 library, Analyze a design's ability to interact with other apps on Technical Skills
the device and Use layout hierarchies to produce reusable layouts.
Demonstrate the use of animation, digitized sound, video control,
CO6 and scanned images and Develop conceptual maps of content and Assessment
process for interactive multimedia instructional programs

List of Experiments
S No Topic No of Labs
1 Basic Animation Concepts, Introduction to Flash 1

129
2 Basic Assignment to understand the fundamental of Flash 1
3 Tween motion and Break Apart functionalities 1
4 Introduction to android & Environment Setup 1
Leveraging Application Fundamentals - Building mobile
5 2
applications
6 Create Android Application , UI Controls 2
Processing User Input - Interacting with the UI, Managing the
7 2
activity life cycle
Persisting Application Data - Selecting storage options,
8 Manipulating the SQLite database, Consuming and creating 2
content providers
Exchanging Data over the Internet - Interacting with server-side
9 1
applications, Developing clients for web services
Multimedia in Android multimedia supported audio formats,
10 1
media playback, video formats, video playback

Suggested Resources:
Flash MX Action Script Programming Robert Reinhardt and Joey Lott, Wiley
Publisher
Flash J. Scott Hamlin and David J. Emberton,
Techmedia Publisher
Beginning Android Application Development Wei-Meng Lee, Paperback
Publisher

Evaluation Scheme:
1. Mid Term Exam (Viva and Written Exam) 15
2. End term Exam (Viva and Written Exam) 15
3. Lab Records 15
4. Regular Assessment (Quality and quantity of
experiments performed, learning laboratory skills) 40
5. Attendance and discipline in lab 15

Total 100

Course Outcomes (COs) contribution to the Programme Outcomes (POs)

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 Avg
CO1 3 3 3 3 2 2 1 1 1 1 1 1 1.83
CO2 3 3 3 3 3 1 1 1 1 1 1 3 2.00
CO3 3 3 2 3 2 3 2 1 1 1 2 1 2.00
CO4 3 3 3 2 3 2 1 1 1 1 1 1 1.83
CO5 2 2 3 3 3 3 1 1 1 1 1 1 1.83
C06 2 3 3 3 2 2 2 2 2 2 2 2 2.25
Avg 2.67 2.83 2.80 2.80 2.60 2.20 1.20 1.00 1.00 1.00 1.20 1.40

130