B.

TECH

CURRICULUM-2021

SCHOOL OF COMPUTING

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

KALASALINGAM ACADEMY OF RESEARCH AND EDUCATION

(DEEMED TO BE UNIVERSITY)

(Under Section 3 of the UGC Act 1956)

Anand Nagar, Krishnankoil-626 126.

Srivilliputtur, Virudhunagar(Dist.),Tamil Nadu, India

(Website: https://kalasalingam.ac.in/)
 KALASALINGAM ACADEMY OF RESEARCH AND EDUCATION

VISION

To be a University of Excellence of International Repute in Education and Research

MISSION

M1: To provide a scholarly teaching-learning ambience which results in creating

graduates equipped with skills and acumen to solve real-life problems.
M2: To promote research and create knowledge for human welfare, rural and societal
development.
M3: To nurture entrepreneurial ambition, industrial and societal connect by creating an
environment through which innovators and leaders emerge

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

VISION

To be a department of excellence for quality education and research in various fields of

Computer Science and Engineering

MISSION

M1: Strive to build and maintain an academic atmosphere conducive to the highest
levels of research and instruction by promoting high-quality teaching and scholarly
activity.
M2: To equip students with knowledge and skills in both the fundamental and applied
aspects of computer science, which are necessary to solve real-world engineering
challenges to meet industry and societal needs.
M3: To prepare students to attain creative endeavours and entrepreneurship skills with
proper ethical values and a desire to pursue life-long learning.

2
PROGRAM EDUCATIONAL OBJECTIVES (PEOs)
PEO1: The graduates will demonstrate technical proficiency in Computer Science and
Engineering during employment or higher studies.
PEO2: The graduates will imbibe problem solving skills through continuous learning and
innovative mindset to provide sustainable solutions.
PEO3: The graduates will operate in a diverse environment as a professional or an en-
trepreneur to solve societal problems with professional ethics.

PROGRAM SPECIFIC OBJECTIVES (PSOs)

PSO1: Able to develop software solutions for real world problems using core computing
technologies.
PSO2: Able to apply contemporary technologies such as AIML and data science for ef-
fective decision-making towards sustainable development of a smart society.

PROGRAMME OUTCOMES (POs)

PO1 : Engineering knowledge: Apply the knowledge of mathematics, science, engineering
fundamentals, and an engineering specialization to the solution of complex engineering
problems.
PO2 : Problem analysis: Identify, formulate, review research literature, and analyze
complex engineering problems reaching substantiated conclusions using first principles of
mathematics, natural sciences, and engineering sciences.
PO3 : Design/development of solutions: Design solutions for complex engineering prob-
lems and design system components or processes that meet the specified needs with
appropriate consideration for the public health and safety, and the cultural, societal, and
environmental considerations.
PO4 : Conduct investigations of complex problems: Use research-based knowledge and
research methods including design of experiments, analysis and interpretation of data,
and synthesis of the information to provide valid conclusions.
PO5 : Modern tool usage: Create, select, and apply appropriate techniques, resources,
and modern engineering and IT tools including prediction and modeling to complex en-
gineering activities with an understanding of the limitations.
PO6 : The engineer and society: Apply reasoning informed by the contextual knowledge
to assess societal, health, safety, legal and cultural issues and the consequent responsibil-
ities relevant to the professional engineering practice.
PO7 : Environment and sustainability: Understand the impact of the professional engi-
neering solutions in societal and environmental contexts, and demonstrate the knowledge
of, and need for sustainable development.
PO8 : Ethics: Apply ethical principles and commit to professional ethics and responsi-
bilities and norms of the engineering practice.
PO9 : Individual and team work: Function effectively as an individual, and as a member
or leader in diverse teams, and in multidisciplinary settings.

3
PO10 : Communication: Communicate effectively on complex engineering activities with
the engineering community and with society at large, such as, being able to comprehend
and write effective reports and design documentation, make effective presentations, and
give and receive clear instructions.
PO11 : Project management and finance: Demonstrate knowledge and understanding
of the engineering and management principles and apply these to one’s own work, as a
member and leader in a team, to manage projects and in multidisciplinary environments.
PO12 : Life-long learning: Recognize the need for, and have the preparation and ability
to engage in independent and life-long learning in the broadest context of technological
change.

4
 ABET STUDENT OUTCOMES
Computing Accreditation Commission (CAC)
CSO1 : Analyze a complex computing problem and to apply principles of computing and
other relevant disciplines to identify solutions.
CSO2 : Design, implement, and evaluates a computing-based solution to meet a given
set of computing requirements in the context of the program’s discipline.
CSO3 : Communicate effectively in a variety of professional contexts.
CSO4 : Recognize professional responsibilities and make informed judgments in comput-
ing practice based on legal and ethical principles.
CSO5 : Function effectively as a member or leader of a team engaged in activities appro-
priate to the program’s discipline.
CSO6 : Apply Computer Science theory and software development fundamentals to pro-
duce computing-based solutions.

Engineering Accreditation Commission (EAC)

ESO1 : Ability to identify, formulate and solve complex engineering problems by apply-
ing principles of Engineering, Science, and Mathematics.
ESO2 : Ability to apply engineering design to produce solutions that meet specified needs
with consideration of public health, safety, and welfare, as well as global, cultural, social,
environmental, and economic factors.
ESO3 : An ability to communicate effectively with a range of audiences.
ESO4 : Ability to recognize ethical and professional responsibilities in engineering sit-
uations and make informed judgments, which must consider the impact of engineering
solutions in global, economic, environmental, and societal contexts.
ESO5 : Ability to function effectively on a team whose members together provide lead-
ership, create a collaborative and inclusive environment, establish goals, plan tasks, and
meet objectives.
ESO6 : Ability to develop and conduct appropriate experimentation, analyze and inter-
pret data, and use engineering judgment to draw conclusions.
ESO7 : Ability to acquire and apply new knowledge as needed, using appropriate learning
strategies.

5
Contents
1 FOUNDATION CORE 17
1.1 211CSE1401: PROBLEM SOLVING USING COMPUTER PROGRAM-
MING . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 17
1.2 211CSE1402: PYTHON PROGRAMMING . . . . . . . . . . . . . . . . 21

2 UNIVERSITY ELECTIVE (from CSE) 30

2.1 214CSE1301: WINDOWS PROGRAMMING . . . . . . . . . . . . . . . 30
2.2 214CSE2302: GETTING STARTED WITH DATA STRUCTURE . . . . 35
2.3 214CSE2303: OBJECT ORIENTED PROGRAMMING . . . . . . . . . 39
2.4 214CSE2304: NETWORK PROGRAMMING . . . . . . . . . . . . . . . 43
2.5 214CSE2305: CLOUD COMPUTING . . . . . . . . . . . . . . . . . . . . 48
2.6 214CSE2306: ANDROID PROGRAMMING . . . . . . . . . . . . . . . . 53
2.7 214CSE3307: DATA ANALYTICS WITH R . . . . . . . . . . . . . . . . 59
2.8 214CSE3308: INTRODUCTION TO CYBER SECURITY . . . . . . . . 63
2.9 214CSE3309: INTRODUCTION TO MACHINE LEARNING . . . . . . 69
2.10 214CSE4310: ETHICAL HACKING . . . . . . . . . . . . . . . . . . . . 73

3 PROGRAM CORE 78
3.1 212CSE1101: IT INFRASTRUCTURE LANDSCAPE
OVERVIEW . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 78
3.2 212CSE2301: DATA STRUCTURES . . . . . . . . . . . . . . . . . . . . 83
3.3 212CSE2302: DIGITAL PRINCIPLES AND SYSTEM DESIGN . . . . . 89
3.4 212CSE2403: JAVA PROGRAMMING . . . . . . . . . . . . . . . . . . . 94
3.5 212CSE2303: SOFTWARE ENGINEERING . . . . . . . . . . . . . . . . 99
3.6 212CSE2101: DISCRETE MATHEMATICS . . . . . . . . . . . . . . . . 103
3.7 212CSE2304: MACHINE LEARNING . . . . . . . . . . . . . . . . . . . 108
3.8 212CSE2305: DATABASE MANAGEMENT SYSTEMS . . . . . . . . . 116
3.9 212CSE2102: COMPUTER ARCHITECTURE AND ORGANIZATION 122
3.10 212CSE3301: DESIGN AND ANALYSIS OF ALGORITHM . . . . . . . 128
3.11 212CSE3302: COMPUTER NETWORKS . . . . . . . . . . . . . . . . . 134
3.12 212CSE3303: OPERATING SYSTEM . . . . . . . . . . . . . . . . . . . 142
3.13 212CSE3304: AUTOMATA AND COMPILER DESIGN . . . . . . . . . 149
3.14 212CSE3305: SECURED COMPUTING . . . . . . . . . . . . . . . . . . 155

4 PROGRAM ELECTIVE COURSES 161

ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING 161

4.1 213CSE1301: INTRODUCTION TO ARTIFICIAL INTELLIGENCE AND
MACHINE LEARNING . . . . . . . . . . . . . . . . . . . . . . . . . . . 161
4.2 213CSE2301: PREDICTIVE ANALYSIS . . . . . . . . . . . . . . . . . . 168
4.3 213CSE2302: ALGORITHM FOR INTELLIGENT SYSTEMS AND ROBOTICS173
4.4 213CSE2303: COMPUTATIONAL LINGUISTICS AND NATURAL LAN-
GUAGE PROCESSING . . . . . . . . . . . . . . . . . . . . . . . . . . . 175
4.5 213CSE3301: DEEP LEARNING . . . . . . . . . . . . . . . . . . . . . . 179
4.6 213CSE4301: PATTERN AND ANOMALY DETECTION . . . . . . . . 181

6
DATA ANALYTICS 183
4.7 213CSE1303: INTRODUCTION TO DATA ANALYTICS . . . . . . . . 183
4.8 213CSE2305: DATA WAREHOUSING & MULTIDIMENSIONAL MOD-
ELING . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 193
4.9 213CSE2306: DATA VISUALIZATION FOR ANALYTICS . . . . . . . . 195
4.10 213CSE3305: DESCRIPTIVE ANALYTICS . . . . . . . . . . . . . . . . 197
4.11 213CSE3306: BIG DATA ANALYTICS . . . . . . . . . . . . . . . . . . 199
4.12 213CSE4305: SOCIAL, WEB AND MOBILE ANALYTICS . . . . . . . 209

CYBER SECURITY AND FORENSICS 211

4.13 213CSE1302: INFORMATION SECURITY FUNDAMENTALS . . . . . 211
4.14 213CSE2309: IT PHYSICAL SECURITY AND SYSTEM SECURITY . 213
4.15 213CSE3309: IT APPLICATION SECURITY . . . . . . . . . . . . . . . 217
4.16 213CSE4307: DIGITAL FORENSICS . . . . . . . . . . . . . . . . . . . . 220
4.17 213CSE4308: IT NETWORK SECURITY . . . . . . . . . . . . . . . . . 222
4.18 213CSE4309: IT DATA SECURITY . . . . . . . . . . . . . . . . . . . . 224
4.19 213CSE4310: ETHICAL HACKING & PENETRATION TESTING . . . 226

INTERNET OF THINGS AND SMART CITY 228

4.20 213CSE1304: INTRODUCTION TO INTERNET OF THINGS . . . . . 228
4.21 213CSE3310–INTRODUCTION TO SENSOR TECHNOLOGY AND IN-
STRUMENTATION . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 233
4.22 213CSE3311–WIRELESS SENSOR NETWORKS AND IOT STANDARDS238
4.23 213CSE3312: CLOUD COMPUTING ARCHITECTURE AND DEPLOY-
MENT MODELS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 241
4.24 213CSE4311: ANALYTICS FOR IOT . . . . . . . . . . . . . . . . . . . 245
4.25 213CSE4312: SMARTER CITY . . . . . . . . . . . . . . . . . . . . . . . 247

NETWORKS AND SECURITY 249

4.26 213CSE1305: NETWORK AND INFORMATION SECURITY . . . . . . 249
4.27 213CSE1305: PERVASIVE AND UBIQUITOUS COMPUTING . . . . . 253
4.28 213CSE2311: VIRTUALIZATION . . . . . . . . . . . . . . . . . . . . . . 258
4.29 213CSE2312: MOBILE AND WIRELESS SECURITY . . . . . . . . . . 262
4.30 213CSE3313: GRAPH THEORY AND ITS APPLICATIONS . . . . . . 266

ELECTRICAL AND ELECTRONICS COMMUNICATION 270

4.31 213CSE2313: EMBEDDED SYSTEMS . . . . . . . . . . . . . . . . . . . 270
4.32 213CSE2314: RFID AND ITS APPLICATIONS . . . . . . . . . . . . . . 275
4.33 213CSE3314: COGNITIVE RADIO . . . . . . . . . . . . . . . . . . . . . 279
4.34 213CSE3315: PRINCIPLES OF COMMUNICATION . . . . . . . . . . . 282
4.35 213CSE3316–SIGNAL AND IMAGE PROCESSING . . . . . . . . . . . 287

SOFTWARE DEVELOPMENT 292

4.36 213CSE1306: WEB TECHNOLOGY . . . . . . . . . . . . . . . . . . . . 292
4.37 213CSE2315: SOFTWARE TESTING . . . . . . . . . . . . . . . . . . . 298
4.38 213CSE2316: MOBILE APPLICATION DEVELOPMENT . . . . . . . . 304
4.39 213CSE3317: FREE AND OPEN SOURCE SOFTWARE . . . . . . . . 308
4.40 213CSE3318: USER INTERFACE DESIGN . . . . . . . . . . . . . . . . 313
4.41 213CSE3319: AGILE METHODOLOGY . . . . . . . . . . . . . . . . . . 317

7
5 EXPERIENTIAL ELECTIVE 322
5.1 216CSE4301: APPLICATIONS OF MACHINE LEARNING IN INDUS-
TRIES . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 322
5.2 216CSE4302: BA FOR INDUSTRIES . . . . . . . . . . . . . . . . . . . . 325
5.3 216CSE4303: IOT FOR INDUSTRIES ( Use Case Scenarios) . . . . . . 327
5.4 216CSE4304: INFORMATION SECURITY GOVERNANCE, MANAGE-
MENT PRACTICES, SECURITY AUDIT & MONITORING . . . . . . 329
5.5 216CSE2201: COMPETITIVE PROGRAMMING . . . . . . . . . . . . . 333
5.6 216CSE3201: MICRO PROJECT . . . . . . . . . . . . . . . . . . . . . . 335

6 HONORS ELECTIVE 336

6.1 213CSE2101: ADVANCED WEB FRAMEWORKS . . . . . . . . . . . . 336
6.2 213CSE2102: BLOCKCHAIN TECHNOLOGY . . . . . . . . . . . . . . 339
6.3 213CSE2103: VIDEO ANALYTICS . . . . . . . . . . . . . . . . . . . . . 343
6.4 213CSE3101:ADVANCED COMPUTER ARCHITECTURE . . . . . . . 347
6.5 213CSE3102: AUGMENTED REALITY . . . . . . . . . . . . . . . . . . 349
6.6 213CSE3103: ADVANCED DATABASES . . . . . . . . . . . . . . . . . 353
6.7 213CSE4101: HIGH PERFORMANCE COMPUTING . . . . . . . . . . 357
6.8 213CSE4102: NEXT GENERATION NETWORKS . . . . . . . . . . . . 360
6.9 213CSE4103: VISUAL CRYPTOGRAPHY . . . . . . . . . . . . . . . . 364

8
KALASALINGAM ACADEMY OF RESEARCH AND
EDUCATION
DEPARTMENT OF COMPUTER SCIENCE AND
ENGINEERING
B.Tech CSE - CURRICULUM STRUCTURE

S.no Curriculum Components Credits

Foundation Core

Mathematics and Sciences

Engineering Sciences

I Computing 44

Sustainable Product Development

Human Values and Communication

Entrepreneurship and Innovation

University Elective

II Engineering(outside school) 16

Liberal arts (or) Mathematics and Sciences

III Program Core 52

IV Program Elective 24

Experiential Core

V Design Project 16

Capstone

Experiential Elective Courses

VI 8
CSP/Internship/UG Research/Competitions

VII Honors Elective 20*

Total Credits 160

*180 credits is required to complete BTech Honors

9
 1. Foundation Core
Course Course
S.No Course Name L T P X C H
Code Type

Problem Solving
1 211CSE1401 using Computer IC-T 1 0 2 3 3 6
Programming

2 211CSE1402 Python Programming IC-T 1 0 2 3 3 6

Total Credits 6

2. University Electives
Course Course
S.NO Course Name L T P X C H
Code Type
Windows
1 214CSE1301 IC-T 2 0 2 0 3 4
programming
Getting started with
2 214CSE2302 IC-T 2 0 2 0 3 4
data structure
Object Oriented
3 214CSE2303 IC-T 2 0 2 0 3 4
Programming
Network
4 214CSE2304 IC-T 2 0 2 0 3 4
programming
5 214CSE2305 Cloud computing IC-T 2 0 2 0 3 4
Android
6 214CSE2306 IC-T 2 0 2 0 3 4
Programming
Data Analytics with
7 214CSE3307 IC-T 2 0 2 0 3 4
R
Introduction to Cyber
8 214CSE3308 IC-T 2 0 2 0 3 4
Security
Introduction to
9 214CSE3309 IC-T 2 0 2 0 3 4
Machine Learning
10 214CSE4310 Ethical hacking IC-T 2 0 2 0 3 4

10
 3. Program Core

Course Course
S.NO Course Name L T P X C H
Code Type

IT Infrastructure
1 212CSE1101 T 4 0 0 0 3 4
Landscape Overview

2 212CSE2301 Data Structures IC-T 2 0 2 3 4 7

Digital Principles and

3 212CSE2302 IC-T 2 1 2 0 4 5
System Design

4 212CSE2403 Java Programming IC-P 1 0 6 0 4 7

5 212CSE2303 Software Engineering IC-T 2 0 2 0 3 4

6 212CSE2101 Discrete Mathematics T 3 1 0 0 4 4

7 212CSE2304 Machine Learning IC-T 2 0 2 3 4 7

Database
8 212CSE2305 IC-T 3 0 2 0 4 5
Management Systems

Computer
9 212CSE2102 Architecture and T 4 0 0 0 3 4
Organization

Design and Analysis

10 212CSE3301 IC-T 2 0 2 3 4 7
of Algorithms

11 212CSE3302 Computer Networks IC-T 2 0 2 3 4 7

12 212CSE3303 Operating Systems IC-T 3 0 2 0 4 5

Automata and
13 212CSE3304 IC-T 3 0 2 0 4 5
Compiler Design

14 212CSE3305 Secured Computing IC-T 2 0 2 3 3 7

Total Credits 52

11
 4. Program Elective
Course Course
S.No Course Name L T P X C H
Code Type
Stream : Artificial Intelligence and Machine Learning
Introduction to
Artificial Intelligence
1 213CSE1301 IC-T 4 0 2 0 4 6
and Machine
Learning
2 213CSE2301 Predictive Analytics IC-T 4 0 2 0 4 6
Algorithms for
3 213CSE2302 Intelligent Systems IC-T 4 0 2 0 4 6
and Robotics
Computational
Linguistics and
4 213CSE2303 IC-T 4 0 2 0 4 6
Natural Language
Processing
5 213CSE3301 Deep Learning IC-T 4 0 2 0 4 6
Pattern and Anamoly
6 213CSE4301 IC-T 4 0 2 0 4 6
Detection
Stream : Data Analytics
Introduction to Data
1 213CSE1303 IC-T 4 0 2 0 4 6
Analytics
Data Warehousing
2 213CSE2305 and Multidimensional IC-T 4 0 2 0 4 6
Modeling
Data Visualization for
3 213CSE2306 IC-T 4 0 2 0 4 6
Analytics
4 213CSE3305 Descriptive Analytics IC-T 4 0 2 0 4 6
5 213CSE3306 Big Data Analytics IC-T 4 0 2 0 4 6
Social, Web and
6 213CSE4305 IC-T 4 0 2 0 4 6
Mobile Analytics

12
 Course Course
S.NO Course Name L T P X C H
Code Type
Stream : Cyber Security and Forensics
Information Security
1 213CSE1302 IC-T 4 0 2 0 4 6
Fundamentals
IT Physical Security
2 213CSE2309 IC-T 4 0 2 0 4 6
and System Security
IT Application
3 213CSE3309 IC-T 4 0 2 0 4 6
Security
4 213CSE4307 Digital Forensics IC-T 4 0 2 0 4 6
5 213CSE4308 IT Network Security IC-T 4 0 2 0 4 6
6 213CSE4309 IT Data Security IC-T 4 0 2 0 4 6
Ethical Hacking &
7 213CSE4310 IC-T 4 0 2 0 4 6
Penetration Testing
Stream : Internet of Things and Smart City
Introduction to
1 213CSE1304 IC-T 4 0 2 0 4 6
Internet of Things
Introduction to
2 213CSE3310 Sensor Technology IC-T 4 0 2 0 4 6
and Instrumentation
Wireless Sensor
3 213CSE3311 Networks and IoT IC-T 4 0 2 0 4 6
Standards
Cloud Computing
4 213CSE3312 Architecture and IC-T 4 0 2 0 4 6
Deployment Models
5 213CSE4311 Analytics for IoT IC-T 4 0 2 0 4 6
6 213CSE4312 Smarter City IC-T 4 0 2 0 4 6
Stream : Network and Security
Network and
1 213CSE1305 IC-T 3 0 2 0 4 5
Information security
Pervasive and
2 213CSE2310 Ubiquitous TP 3 0 2 0 4 5
computing
3 213CSE2311 Virtualization IC-T 3 0 2 0 4 5
Mobile and Wireless
4 213CSE2312 IC-T 3 0 2 0 4 5
Security

13
 Course Course
S.NO Course Name L T P X C H
Code Type
Graph theory and its
5 213CSE3313 IC-T 3 0 2 0 4 5
applications
Stream : Electrical and Electronics Communication
1 213CSE2313 Embedded Systems IC-T 3 0 2 0 4 5
RFID and its
2 213CSE2314 IC-T 3 1 0 0 4 4
Applications
3 213CSE3314 Cognitive Radio IC-T 3 1 0 0 4 4
Principles of
4 213CSE3315 IC-T 3 0 2 0 4 5
Communication
Signal and Image
5 213CSE3316 IC-T 3 0 2 0 4 5
Processing
Course Course
S.NO Course Name L T P X C H
Code Type
Stream : Software Development
1 213CSE1306 Web Technology IC-T 3 0 2 0 4 5
2 213CSE2315 Software Testing IC-T 3 0 2 0 4 5
Mobile Application
3 213CSE2316 IC-T 3 0 2 0 4 5
Development
Free and Open Source
4 213CSE3317 IC-T 3 0 2 0 4 5
Software
5 213CSE3318 User Interface Design IC-T 3 0 2 0 4 5
6 213CSE3319 Agile Methodology IC-T 3 0 2 0 4 5

14
 5. Experiential Core

Course Course
S.No Course Name L T P X C H
Code Type

1 215CSE2201 Design Project - I Project 0 0 0 9 3 9

2 215CSE3202 Design Project - II Project 0 0 0 9 3 9

3 215CSE4203 Capstone Project Project 0 0 0 30 10 30

Total Credits 16

6. Experiential Elective

Course Course
S.No Course Name L T P X C H
Code Type

Community Service
1 216CSE3201 Project 0 0 0 9 3 9
Project

2 216CSE2202 Industry Internship Practical 0 0 4 0 2 4

Applications of
3 216CSE4301 Machine Learning in IC-T 0 0 4 0 2 4
Industry

4 216CSE4302 BA for Industries IC-T 0 0 4 0 2 4

IOT for Industries

5 216CSE4303 IC-T 0 0 4 0 2 4
(Use Case Scenarios)

Information Security
Governance,
6 216CSE4304 Management IC-T 0 0 4 0 2 4
Practices, Security
Audit and Monitoring

Competitive
7 216CSE2201 Practical 0 0 2 0 1 2
Programming

8 216CSE3201 Micro Project Practical 0 0 2 0 1 2

15
 7. Honors Elective
Course Course
S.No Course Name L T P X C H
Code Type

Advanced Web
1 213CSE2101 T 3 0 0 0 3 3
Frameworks

BlockChain
2 213CSE2102 T 3 0 0 0 3 3
Technology

3 213CSE2103 Video Analytics T 3 0 0 0 3 3

Advanced Computer
4 213CSE3101 T 3 0 0 0 3 3
Architecture

5 213CSE3102 Augmented Reality T 3 0 0 0 3 3

6 213CSE3103 Advanced Databases T 3 0 0 0 3 3

High Performance
7 213CSE4101 T 3 0 0 0 3 3
Computing

Next generation
8 213CSE4102 T 3 0 0 0 3 3
networks

9 213CSE4103 Visual Cryptography T 3 0 0 0 3 3

16
 1 FOUNDATION CORE

1.1 211CSE1401: PROBLEM SOLVING USING COMPUTER

PROGRAMMING

211CSE1401 Problem Solving using Computer L T P X C

Programming
1 0 2 3 3
Pre-requisite :NIL
Course Category :Foundation Core
Course Type :Integrated Course - Theory

COURSE OBJECTIVES:
• To introduce the students with the foundations of computing, programming and
problem-solving

• To make the students understand the concept of data representation in computers

• To make the students solve simple and complex problems through programming
concepts

COURSE OUTCOMES:
CO1: Understand and formulate algorithms and pseudocode for problems

CO2: Able to represent, organize, manipulate and interpret data

CO3: Apply programming skills to implement pseudocodes and algorithms

CO4: Apply user defined and built in functions to frame efficient programs

CO5: Apply programming techniques to permanently store and retrieve large datasets for
the problems

MAPPING OF COURSE OUTCOMES WITH PO, PSO:

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

17
UNIT I
Problem Solving - Pillars of Problem Solving - Analysing and representing Algorithms –
Flowcharts - Importance of programming in problem solving - Expressing Algorithms in
Pseudocode - Case studies in the specific domain of study in analysing and representing
algorithms

UNIT II
Computational thinking – Information to Data Format – Data Encoding – Binary Con-
versions and Binary Logic - Representation of Problem data in computer format - In-
troducing compiler, compiler features and, working with basic datatypes - working with
DMA, creating strings using DMA concepts

UNIT III
Writing Problem Workflow in Computer Language – Use control structures to write sim-
ple algorithms for sort, search and similar algorithms – Organizing multiple datasets in
problem domain to computer format – Working with Single dimensional, multidimen-
sional arrays, One dimensional character arrays - Declaration and String Initialization
Arrays of Strings

UNIT IV
Decomposing complex problems to simple solutions - functions – parameter passing –
recursion - Organizing complex and variable datasets – Structures, self-referential struc-
tures – Unions – Applications

UNIT V
Representing and organizing large problem dataset – Files – Types - Modes - File oper-
ations – Applications, Idea of pointers, Defining pointers, Use of Pointers.

15 WEEK COURSE PLAN

Week Lecture (2 hours) Practical (2 X-Component (3 Hours)

hours)
What is a problem (bound- Take Real life Case studies in the spe-
Week 1 aries of problem)- Intro- problems, Apply cific domain of study (de-
duction to Problem Solv- the four pillars in partment specific) Identify
ing – 4 Pillars of Prob- solving the prob- the boundaries of the prob-
lem Solving (Decomposi- lems (Individual lem domain, find solu-
tion, Pattern Recognition, / Group Activity tion applying the pillars of
Data Representation, Algo- can be planned) problem solving Examples:
rithms) Car Parking problem Water
scarcity problem

18
 Analysing and representing Finding Maxi- Write algorithms for the
Week 2
Algorithms and *flowcharts mum/Minimum problem chosen (Done in
(Common Algorithms to Searching, Sorting Week-1)
discuss) (Algorithms &
flowchart alone.
No program)
Importance of program- Practical expo- Convert all algorithms to
Week 3
ming in problem solving, sure to computer Pseudocode for the problem
Expressing Algorithms in and computer (Done in Week-2)
Pseudocode hardware, Intro-
ducing operating
system, applica-
tion software and
compilers
Introduction to Computa- Practice with Identify the different data
Week 4
tional thinking – Informa- Numeral, Binary, available in the problem
tion to Data Format – Data Conversions to (Done in Week-3)
Encoding Binary
Representation of Problem Introducing com- Analyse the proper data
Week 5
data in computer format piler, compiler type and memory require-
features and, ment for the problem (Done
working with in Week-4)
basic datatypes
Week 6 Representation of Problem Accessing data di- Calculate and identify
data in computer format rectly with com- memory limitations and
puter memory wherever possible apply
minimal memory access
for the problem ( Done in
Week-5)
Writing Problem Workflow Use control struc- Convert pseudo codes to
Week 7
in Computer Language tures to write sim- programs for the problem
ple algorithms for (Done in week 2-5)
sort, search and
similar algorithms
Week 8 Organizing multiple Organizing mul- Analyse multiple datasets
datasets in problem do- tiple datasets and represent the same in
main to computer format in problem do- program(Done in Week 4)
main to computer
format
Week 9 Organizing multiple String operations, Wherever possible, apply
datasets in problem do- working with dynamic memory creation
main to computer format DMA, creating instead of static in the prob-
strings using lem (Done in Wee 3-4,8)
DMA concepts

19
Week 10 Decomposing complex Simple decompo- Decompose the complex
problems to simple solu- sition using func- problems to simple pro-
tions tions grams (Done in Week
7)
Week 11 Decomposing complex Decomposition Decompose the complex
problems to simple solu- with parameters problems to simple pro-
tions and recursion grams (Done in Week
7)
Week 12 Organizing complex and Create com- Analyse complex data
variable datasets in prob- plex data using structures available in the
lem domain to computer Structure. problem. Apply the same
format in Program(Done in Week
4)
Week 13 Organizing complex and Implementation of Write the programs inte-
variable datasets in prob- single Linked list grating complex data struc-
lem domain to computer ture (Done in Week 12, 11)
format
Week 14 Representing and organiz- Reading, Writing Check for Large Data Set as
ing large problem dataset in inputs to the system / ne-
secondary storages cessity for permanent stor-
age to the solution (Done in
Week 13)
Week 15 Representing and organiz- Develop solutions Represent the data in Per-
ing large problem dataset in for domain spe- meant storage for the prob-
secondary storages cific problems. lem (Done in Week 14)

TEXT BOOK(S):
1. David D. Riley and Kenny A. Hunt, ComputationalThinking for the Modern Prob-
lem Solver, CRC Press, 2014.

2. Pradip Dey and Manas Ghosh,Programming in C,Oxford University Press, Third

Edition 2018.

3. Byron Gottfried, Schaum’s Outline of Programming with C, McGraw-Hill, Third

Edition, 2010

REFERENCES:
1. Brian W. Kernighan and Dennis M. Ritchie, The C Programming Language, Pren-
tice Hall of India, Second Edition 1988

2. 2. E. Balaguruswamy, Programming in ANSI C, Tata McGraw-Hill, Seventh Edi-

tion 2017

20
 1.2 211CSE1402: PYTHON PROGRAMMING

211CSE1402 Python Programming L T P X C

1 0 2 3 3
Pre-requisite :NIL
Course Category :Foundation Core
Course Type :Integrated Course - Theory

COURSE OBJECTIVES:
• To learn how to use lists, tuples, and dictionaries in Python programs.

• To learn how to identify Python object types.

• To learn how to use indexing and slicing to access data in Python programs.

• To define the structure and components of a Python program.

• To learn how to write loops and decision statements in Python.

• To learn how to write functions and pass arguments in Python.

• To learn how to build Python modules for reusability.

• To learn how to read and write files in Python.

• To learn how to design object-oriented programs with Python classes.

• To practice data processing, analysis and visualization with python

COURSE OUTCOMES:
CO1: Understand the constructs and concepts of a programming language

CO2: Apply Python data structures for problem solving and programming

CO3: Implement user defined python functions and build an efficient program leveraging
modules

CO4: Create python programs to handle file I/O and exceptions, and solve problems with
Object Oriented Concepts

CO5: Understand Data processing, Validation, Visualization concepts in python with

regex, pandas, matplotlib and numpy packages.

21
MAPPING OF COURSE OUTCOMES WITH PO, PSO:
PO’S
1 2 3 4 5 6 7 8 9 10 11 12
CO1 S S S
CO2 S S S
CO3 S M M M
CO4 S S S S S
CO5 S M M S M S

UNIT I: Getting Started with Programming

Introduction, Python Versions, Applications of Python in mainstream technologies.
Strings and Formatting: Basic Syntax, Comments, String Values, String Methods,
The format Method, String Operators, Numeric Data Types, Conversion Functions, Sim-
ple Output, Simple Input, The % Method, The print Function
Language Components: Indenting Requirements, the if Statement, Relational and
Logical Operators, Bit Wise Operators, the while Loop, break and continue, The for
Loop.

UNIT II: Python Data Structures

Introduction to Python Data Structures, Lists, Tuples, List Comprehensions, Nested
List Comprehensions, Sets, Dictionaries, Sorting Dictionaries, Copying Collections, Dic-
tionary Comprehensions, Dictionaries with Compound Values

UNIT III: Functions and Modules

Functions: Introduction, Defining Your Own Functions, Parameters, Function Docu-
mentation, Keyword and Optional Parameters, Passing Collections to a Function, Vari-
able Number of Arguments, Scope, Functions - ”First Class Citizens”, Passing Functions
to a Function, map, filter, Mapping Functions in a Dictionary, Lambda, Inner Functions,
Closures
Modules: Modules, Standard Modules – sys, math, time, The dir Function

UNIT IV: Exceptions, I/O and OOP

Exceptions: Errors, Runtime Errors, The Exception Model, Exception Hierarchy, Han-
dling Multiple Exceptions, raise, assert.
Input and Output: Introduction, Data Streams, Creating Your Own Data Streams,
Access Modes, Writing Data to a File, Reading Data from a File
Object Oriented Programming: Class Coding Basics Class Statement Methods In-
heritance Attribute Tree Construction Specializing Inherited Methods Class Interface
Techniques Abstract Super Classes

UNIT V: Data Processing, Analysis and Visualization

Regular Expressions: Introduction, Simple Character Matches, Special Characters,
Character Classes, Quantifiers, The Dot Character, Greedy Matches, Grouping, Match-

22
ing at Beginning or End, Match Objects, Substituting, Splitting a String, Compiling
Regular Expressions, Flags.
Numerical Analysis & Plotting: Numpy – Overview, Setup, Datatypes, Basic Op-
erators, Indexing, Broadcasting, Matrix Operators. Matplotlib-Overview, Setup, Basic
plots, Customizing plots, Subplots, 3D plots.
Data Processing with Pandas: Pandas – Overview, Setup, Data Structures, Indexing
& Selecting Data, groupby Operations, Reshaping data.

X Component
• Competitive coding using Core Python – Practical Assignments and Hacker-
rank challenges

• GUI Development using Python – Project

Syllabus for GUI Development

An Example GUI, The Tk Widget, Button Widgets, Entry Widgets, Text Widgets,
Checkbutton Widgets, Radiobutton Widgets, Listbox Widgets, Frame Widgets, Menu
Widgets, Toplevel Widgets, Dialogs

15 WEEK COURSE PLAN

Week Lecture (1 Pedagogy Practical (2 X Component (3

hours) hours) hours)
Introduction Explicit Python Ver- Access and
Week 1 to Python – Teaching sions, Installing perform
Applications Python, Envi- operations on
of Python in ronment Vari- Open Source
Mainstream ables, Executing Environments
Technologies Python from the like Raspberry
Command Line Pi
Strings in Explicit String functions
Python Teaching/ and formatting
Demon-
stration
Language Com- Explicit Indenting Re-
ponents – Part Teaching quirements, the
01: Simple if if Statement
Language Com- Explicit while Loop, Provide
Week 2
ponents – Part Teaching/ break and con- programming
02: Relational Demon- tinue, for Loop solution for
and Logical stration decision and
Operators, Bit looping problem
Wise Operators scenarios

23
 Lists, Tuples Explicit Hands-on ses-
Teaching sion for Lists
and Tuples
- methods
and functions
Hackerrank –
Problem Solving
Challenge
Sets, Dictionary Explicit Hands-on ses- Create solutions
Week 3
Teaching sion for Sets for complex
and Dictionary problem
- methods and statements
functions leveraging
Comprehension Explicit List Comprehen- Python Data
Teaching sion, Dictionary structures
Comprehen-
sion, Lambda,
Hackerrank –
Problem Solving
Challenge
Functions Explicit Getting started Apply
Week 4
Teaching with function the buit-in and
oriented pro- user defined
gramming functions to
create efficient
programs lever-
aging Python
modules.
Modules Explicit Modular Pro-
Teaching gramming,
Built-in Mod-
ules
Exceptions Explicit Practicing pro- Get data from
Week 5
Teaching grams that are sensors through
robust against Raspberry Pi,
exceptional with
inputs appropriate
Input/Output Explicit Getting data Exceptional
Teaching out from Excel, Handling
Notepad
Week 6 Object Oriented Explicit Attribute Tree Create Ob-
Programming: Teaching Construction ject Oriented
Class State- Specializing Solution for
ment Methods Inherited Meth- solving appli-
Inheritance ods, Class cation oriented
Interface Tech- problems
niques Abstract
Super Classes

24
 Regular Expres- Explicit Practicing Validate data
Week 7
sions, Simple Teaching regular using RegExp
Character expression rules package for
Matches, Spe- for different realtime inputs,
cial Characters, problem from integrated
Character scenarios environment
Classes, Quan-
tifiers, The Dot
Character
Greedy Matches, Explicit
Grouping, Teaching
Matching at
Beginning or
End, Match
Objects, Substi-
tuting, Splitting
a String, Com-
piling Regular
Expressions,
Flags.
Week 8 Numerical Anal- Explicit Performing op- Perform com-
ysis, Datatypes, Teaching erations on data plex mathetical
Basic Opera- frames obtained operations lever-
tors, Indexing, from real time aging Numpy
Broadcasting, datasets
Matrix Opera-
tors.
Week 9 Plotting, Basic Explicit Practicing data Perform data
plots, Customiz- Teaching plots for Real visualization on
ing plots, Sub- time datasets streaming data
plots, 3D plots
Week 10 Data Processing, Explicit Working with Process data
Data Structures, Teaching data processing from benchmark
Indexing & operations using sites using Pan-
Selecting Data, Pandas das, Numpy,
groupby Opera- Matplotlib
tions, Reshaping
data.

25
Week 11 Tkinter: Tk Explicit Tkinter Pro- Create a
Widget, Button Teaching gramming for UI well-defined user
Widgets, Entry Snips interface, based
Widgets, Text on the problem
Widgets, Check- requirement
button Widgets, (GUI
Radiobutton Development)
Widgets, List-
box Widgets,
Frame Widgets,
Menu Widgets,
Toplevel Wid-
gets, Dialogs
Week 12 Developing User Explicit Efficient UI
Interface with Teaching Development
OOP using Tkinter
and OOP
Week 13 Desktop App Project Problem Identification and Backend details
Development Based
Learning
Week 14 Creating own Project Pip, PyPi, Licence Reception
Python Pack- Based
ages Learning
Week 15 UI Development Project UI Development for Integrated Application
Based
Learning

EXPERIMENTS:
1. Let d(n) be defined as the sum of proper divisors of n (numbers less than n which
divide evenly into n).
If d(a) = b and d(b) = a, where a 6= b, then a and b are an amicable pair and each
of a and b are called amicable numbers.
For example, the proper divisors of 220 are 1, 2, 4, 5, 10, 11, 20, 22, 44, 55 and
110; therefore d(220) = 284. The proper divisors of 284 are 1, 2, 4, 71 and 142; so
d(284) = 220.
Find the count of the matching proper divisors of the given amicable number

2. We come across varying magic numbers or so called occult numbers. There are
very few numbers in having a particular property. The so called occult number in
our scenario is the number, whose individual digits’ factorial sum will give back the
same number.
For instance: 40585 = 4! + 0! + 5! + 8! + 5! = 40585
Calculate the number of occult numbers in the less than a particular value ’alpha’
Alpha will be given in the input

26
3. A positive integer, n, is factorised into prime factors. We define f(n) to be the
product when each prime factor is replaced with 2. In addition we define f(1)=1.
For example, 90=2*3*3*5, then replacing the primes, 2*2*2*2=16, hence f(90)=16.
Calculate f(n), for the given n

4. Each new term in the Fibonacci sequence is generated by adding the previous two
terms. By starting with 1 and 2, the first 10 terms will be:
1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ...
By considering the terms in the Fibonacci sequence whose values do not exceed
four million, find the sum of the even-valued terms upto the given V terms series.

5. Namonical charge is a value that is calculated by inputting the name of the person.
The charge is calculated by first coverting the characters in the name to its corre-
sponding alphabetical position and then accumulating a sum based on the following
rules:
(i) if the number is even, take factorial of it
(ii) if the number is odd, take the square root of the number
The accumulated sum is returned as the Namonical charge of the given name
Eg.
name = ”abcd”
a - 1 (odd, take square root)
b - 2 (even, take factorial)
c - 3 (odd, take square root)
d - 4 (even, take factorial)
Namonical charge = sqrt(1) + factorial (2) + sqrt(3) + factorial(4) = 28.732
Note: Round the output to three decimal digits

6. For a positive integer n, define f(n) to be the number of non-empty substrings of n

that are divisible by 3. For example, the string ”2573” has 10 non-empty substrings,
three of which represent numbers that are divisible by 3, namely 57, 573 and 3. So
f(2573)=3.
If f(n) is divisible by 3 then we say that n is 3-like.
If the given number is 3-like, print ’yes’, otherwise print ’no’

7. Natural Numbers are simply the numbers 1, 2, 3, 4, 5, ... (and so on).

Given a number k and N, take sum of all numbers less than or equal to N, that are
divisible by k.
Example:
Given k = 5, N = 10, the natural numbers less than or equal to 10 and divisible by
5 are 5,10
The sum is 5+10=15

8. Sorting is a base for any problem solving. Sorting can be done in ascending or
descending order. Various algorithms exist in the literature to do the sorting effi-
ciently.
Create a sorting algorithm that sorts elements between a particular range (i,j)
Example:
Given the inputs
7 // Number of elements

27
 5 2 6 3 9 1 7 // The array (index starts from zero)
2 // Start range
5 // end range
Output:
5236917
9. Convert the given word into magnet word. Magnet word is a word which will have
a property.
Each character of the word will be assigned index starting from 1.
Alphabets in English will be numbered from index 1.
Reverse of the multiplied indices of the character in string and alphabers, mod 26
gives the corresponding magnetic character.
Replace all the characters in the given string with its magnetic character, resulting
in magnetic word.
Note: If a character is changed to magnetic once, all its subsequents appearances
will have the same magnetic character.
(space character remains untouched)
The elements between the range 2 and 5-1 are sorted
10. Ak gave a challenge to Vj. Ak gave a decimal number N.
Vj needs to find the product of unique critical digits of the number N.
Critical digits are those digits which are divisible by X.
The value X is 2, if the number of unique even numbers is greater than those of
unique odd numbers, else, the value of X is 1.
Help Vj to crack the challenge.
Eg. N = 123564.2654916465
If the count of numbers to the left of . (dot) is greater than the count of numbers
to the right, then . (dot) is considered as even number. Else . (dot) is considered
as odd number. In above case, . (dot) is considered as odd number.

11. n! means n × (n - 1) × ... × 3 × 2 × 1

For example, 20! = 2432902008176640000,
The number is so long. We need to compress this number in such a way that much
information is not last.
Essential information of the number is its case: even or odd. We shall preserve the
highest case in the given number (i.e.,) if the number of even numbers is greater
than the odd, then even is the highest case, and vice versa.
The resultant compressed number should have unique numbers in ascending order.
12. RSK is going to play KPL in 2021. RSK consist of many players in its player pool
in different type: batsman, bowler, wicket keeper and all-rounder. Each player will
have a X factor determining his own strength. In addition to strength, the mode
of the player, either aggressive or defensive will also be provided.
Team RSK management and its captain is in ambiguity on how to select their best
team. The selected team should be highly competent in the tournament. A team
can be competent enough only when it has competent players in aggressive mode.
Given with the set of team player details including their X factor, mode and type,
the task is to form an optimal team.
A team should require minimum two batsmen, one bowler and one wicket keeper

28
 out of its 11 field players. Team should contain minimum 4 aggressive players Note:
An all-rounder can be accounted as either batsmen or bowler
Help team RSK management to finds its best 11-squad to win the trophy. Prove
to the management by selecting a optimal team with highest cumulative x-factor
value

TEXT BOOK(S):
1. Mark Lutz, “Learning Python”, Fifth Edition, O,Reilly, 2018

REFERENCES:
1. Charles Severance, 2016, Python for everybody: exploring data in Python 3

2. Charles Dierbach, 2013, Introduction to Computer Science using Python: a com-

putational problem-solving focus, Wiley Publishers

29
 2 UNIVERSITY ELECTIVE (from CSE)

2.1 214CSE1301: WINDOWS PROGRAMMING

214CSE1301 Windows Programming L T P X C

2 0 2 0 3
Pre-requisite :NIL
Course Category :University Elective
Course Type :Integrated Course - Theory

COURSE OBJECTIVES:
• To understand the customize and install windows.

• To demonstrate the configure updates for windows.

• To implement the configure devices and drivers for windows.

• To design to configure the storage for windows.

• To analyze the remote management settings in windows.

COURSE OUTCOMES:
CO1: Understand the customize and install windows

CO2: Demonstrate the configure updates for windows

CO3: Implement the configure devices and drivers for windows

CO4: Design to configure the storage for windows

CO5: Analyze the remote management settings in windows

MAPPING OF COURSE OUTCOMES WITH PO:

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

30
UNIT I: INSTALLING WINDOWS
Introducing windows - Editions of windows – Requirements – features – how to install
the OS – Methods for migrations and upgrading – Migrate content using the User State
Migration Tool - deployment options – common tools used in deployment process – Up-
grading windows – client installation options.

UNIT II: POST INSTALLATION CONFIGURATION AND PER-

SONALIZATION
Post installation tasks in windows – customize user interface – control panel – settings app
– configure common OS settings – device drivers – managing and configuring hardware
peripherals – printer – client side printing – managing print server properties - configure
windows start menu – common configuration options – Advanced configuration methods
– Managing drivers and devices- device specific settings.

UNIT III: UPDATING WINDOWS AND CONFIGURING NET-

WORKING
Windows servicing model – apply to various scenarios – Methods for updating windows
and applications – managing updates - group policy – windows update for business - Net-
working concepts – IPV4 – IPV6 –DNS – Configure IP Network Connectivity - Implement
Name Resolution - Remote Access Overview - Remote Management

UNIT IV: CONFIGURING STORAGE

Overview of storage options - benefits of storage space - Storage configuration – man-
agement – local – cloud –virtual storage options – configuring storage on client devices –
introducing storage spaces – managing storage spaces - Maintaining disks and volumes –
configuring local disk partitions and volumes - compressing folders - Enabling disk quotas
– Creating a storage space - Synchronizing files with OneDrive.

UNIT V: MANAGING APPS IN WINDOWS

App management in Windows – Different types of apps – installation methods – manual
– automated methods – Manage App delivery – Windows store – Differences between Mi-
crosoft Edge and Internet Explorer – Managing universal windows apps – web browsers
– features - sideloading an App – Installing and Updating Microsoft store apps – Config-
uring Internet Explorer Enterprise Mode.

15 WEEK COURSE PLAN

Week Lecture (2 hours) Pedagogy Practical (2 hours)

31
 Introducing win- Direct instruc- To learn about upgrading of
Week 1 dows,Editions of windows, tion(PPT) windows.
Requirements,features,how
to install the OS,Methods
for migrations and upgrad-
ing,Migrate content using
the User State Migration
Tool
Deployment op- Interactive in- To configure settings app
Week 2
tions,common tools used in struction(PPT) and control panel.
deployment process
Upgrading windows,client Direct instruc- To study about Group pol-
Week 3
installation options tion(Videos) icy objects.
Post installation tasks Explicit Teaching To implement powershell to
Week 4
in windows, customize configure windows.
user interface,control
panel,settings app,configure
common OS settings,device
drivers
Managing and config- Flipped Learning To manage the local and
Week 5
uring hardware periph- network printers.
erals,printer,client side
printing,managing print
server properties
Week 6 Configure windows start Case Study based To learn about windows ser-
menu,common configura- Learning vicing model.
tion options,Advanced
configuration meth-
ods,Managing drivers
and devices,device specific
settings.
Windows servicing Explicit Teaching To configure IP network
Week 7
model,apply to various connectivity.
scenarios,Methods for
updating windows and
applications,managing
updates
Week 8 Group policy,windows Problem solving To study about implement-
update for busi- ing name resolution.
ness, Networking con-
cepts,IPV4,IPV6,DNS
Week 9 Configure IP Network Con- Direct instruc- To implement wireless net-
nectivity, Implement Name tion(PPT) work connectivity.
Resolution,Remote Access
Overview,Remote Manage-
ment

32
Week 10 Overview of storage op- Flipped Learning To study about remote
tions,benefits of storage management.
space,Storage configura-
tion,management,local,cloud,virtual
storage options
Week 11 Configuring storage on Case Study based To implement Recovering
client devices, introducing Learning using Driver Rollback
storage spaces,managing
storage spaces,Maintaining
disks and volumes
Week 12 Configuring local disk Direct instruc- To implement Trou-
partitions and vol- tion(PPT) bleshooting Desktop Apps
umes,compressing fold-
ers,Enabling disk quo-
tas,Creating a storage
space,Synchronizing files
with OneDrive
Week 13 App management in Win- Interactive in- To study about Monitoring
dows,Different types of struction(PPT) Events
apps,installation meth-
ods,manual,automated
methods,Manage App
delivery
Week 14 Windows store,Differences Interactive in- To Create Firewall Rules
between Microsoft Edge and struction(PPT)
Internet Explorer,Managing
universal windows apps
Week 15 Web browsers,features, Direct instruc- To Configure Windows De-
sideloading an tion(PPT) fender
App,Installing and Up-
dating Microsoft store
apps,Configuring Internet
Explorer Enterprise Mode.

EXPERIMENTS:
1. To learn about upgrading of windows.

2. To configure settings app and control panel.

3. To study about Group policy objects.

4. To implement powershell to configure windows.

5. To manage the local and network printers.

6. To learn about windows servicing model.

33
 7. To configure IP network connectivity.

8. To study about implementing name resolution.

9. To implement wireless network connectivity.

10. To study about remote management.

11. To implement Recovering using Driver Rollback

12. To implement Troubleshooting Desktop Apps

13. To study about Monitoring Events

14. To Create Firewall Rules

15. To Configure Windows Defender

TEXT BOOK(S):
1. Lambert Joan, Lambert Steve, Windows 10 Step by Step, PHI Learning Pvt Ltd,
2016.

REFERENCES:
1. Kevin Wilson , Computer Training: Windows 10, Elluminet Press, 2015.

34
 2.2 214CSE2302: GETTING STARTED WITH DATA STRUC-
TURE

214CSE2302 Getting Started with Data Structure L T P X C

2 0 2 0 3
Pre-requisite :NIL
Course Category :University Elective
Course Type :Integrated Course - Theory

COURSE OBJECTIVES:
• Prepare the students to understand and gain the knowledge about Data Structure.

• Gain knowledge on Data Structure algorithms and apply the same on real time
data extracted from confined sources.

• Familiarise the students with C programming pertaining to Data Structure.

COURSE OUTCOMES:
CO1: Understand the different categories of data Structures

CO2: Evaluate and create Abstract Data Types Stack.

CO3: Design and implement linear data structures such as Queues.

CO4: Design and implement linear data structures such as Linked Lists.

CO5: Analyze efficiency of various sorting and searching techniques.

MAPPING OF COURSE OUTCOMES WITH PO:

PO’S
1 2 3 4 5 6 7 8 9 10 11 12
CO1 S S M M M
CO2
CO3 S M S S M L
CO4 S
CO5 S S S

UNIT I: INTRODUCTION TO DATA STRUCTURES

Basic Terminologies: Elementary Data Organizations, Data Structure, Operations: in-
sertion, deletion, traversal etc.Analysis of an Algorithm, Notations, Time-Space trade off.

35
UNIT II: STACKS
ADT Stack and its operations: Algorithms and their complexity, analysis, Applications of
Stacks: Expression Conversion and evaluation corresponding algorithms and complexity
analysis.

UNIT III:QUEUES
ADT queue, Types of Queue: Simple Queue, Circular Queue, Operations on each types
of Queues: Algorithms and their analysis.

UNIT IV: LINKED LISTS

Singly linked lists: Representation in memory, Algorithms of several operations: Travers-
ing, Searching, Insertion into, Deletion from linked list; Linked representation of Stack
and Queue, Header nodes, Doubly linked list: operations on it and algorithmic analysis;
Circular Linked Lists: all operations their algorithms and the complexity analysis.

UNIT V: SORTING AND SEARCHING

Objective and properties of different sorting algorithms, Selection Sort, Bubble Sort, In-
sertion Sort, Quick Sort, Merge Sort, Heap Sort, Performance and Comparison among
all the methods. Searching: Linear Search and Binary Search.

15 WEEK COURSE PLAN

Week Lecture (2 hours) Pedagogy Practical (2 hours)

Basic Terminologies: El- Direct instruc- Write a Program to search
Week 1 ementary Data Organiza- tion(PPT) an element in array.
tions, Data Structure.
Operations: insertion, dele- Direct instruc- Write a R Write a Program
Week 2
tion, traversal etc. tion(PPT) to Find the minimum ele-
ment in a sorted and rotated
array.
Analysis of an Algorithm, Direct instruction Write a Program for array
Week 3
Notations, Time-Space (PPT) implementation of Stack.
trade off.ADT Stack and
its operations
Algorithms and their com- Direct instruc- Write a Program for various
Week 4
plexity, analysis tion(PPT) applications of Stack.
Applications of Stacks Direct instruction Write a Program for array
Week 5
(PPT) implementation of Queue.

36
Week 6 Expression Conversion and Direct instruc- Write a program Linked
evaluation corresponding tion(PPT) list based implementation of
algorithms and complexity Queue.
analysis.
ADT queue, Types of Direct instruc- Write a Program to imple-
Week 7
Queue: Simple Queue, tion(PPT) ment the Linked List.
Circular Queue.
Week 8 Operations on each types Direct instruction Write a Program for linked
of Queues: Algorithms and (PPT) list implementation of
their analysis. Stack.
Week 9 Singly linked lists: Repre- Direct instruc- Write a Program for linked
sentation in memory. tion(PPT) list implementation of
Stack.
Week 10 Algorithms of several oper- Direct instruc- Write a Program for sin-
ations: Traversing, Search- tion(PPT) gle linked list implementa-
ing, Insertion into, Deletion tion of Queue.
from linked list;
Week 11 Linked representation of Direct instruc- Hand session for Doubly
Stack and Queue, Header tion(PPT) linked list: operations on it
nodes, and algorithmic analysis.
Week 12 Circular Linked Lists: all Direct instruc- Write a Program for dou-
operations their algorithms tion(PPT) ble linked list implementa-
and the complexity analy- tion of Queue.
sis.
Week 13 Objective and properties of Direct instruction Write a Program to imple-
different sorting algorithms (Demonstration) ment various Sorting tech-
niques.(Selection Sort, Bub-
ble Sort)
Week 14 Selection Sort, Bubble Sort, Direct instruction Write a Program to im-
Insertion Sort, Quick Sort, (Demonstration) plement various Sorting
Merge Sort, Heap Sort. techniques(Insertion Sort,
Quick Sort.
Week 15 Performance and Compari- Interactive in- Write a Program to im-
son among all the methods. struction (Prob- plement various Searching
Searching: Linear Search lem solving) techniques.(Merge Sort,
and Binary Search. Heap Sort).

EXPERIMENTS:
1. Write a Program to implement the Array concept.

2. Write a Program for array implementation of Stack.

3. Write a Program for various applications of Stack.

4. Write a Program for array implementation of Queue.

37
 5. Write a Program to implement the Linked List.

6. Write a Program for linked list implementation of Stack.

7. Write a Program for linked list implementation of Queue.

8. Write a Program to implement various Sorting techniques.

9. Write a Program to implement various Searching techniques.

TEXT BOOK(S):
1. Fundamentals of Data Structures, Third Edition by Ellis Horowitz, Sartaj Sahni,
Computer Science Press,2010

REFERENCES:
1. Algorithms, Data Structures, and Problem Solving with C++, Third Edition by
Mark Allen Weiss, Addison-Wesley Publishing Company ,2011.

2. How to Solve it by Computer, 2nd Impression by R. G. Dromey, Pearson press,2010.

38
 2.3 214CSE2303: OBJECT ORIENTED PROGRAMMING

214CSE2303 Object Oriented Programming L T P X C

2 0 2 0 3
Pre-requisite :NIL
Course Category :University Elective
Course Type :Integrated Course - Theory

COURSE OBJECTIVES:
• To learn Object Oriented Programming concepts.

• To understand how C++ improves C with object-oriented features.

• To learn Java Programming Concepts to solve problems.

COURSE OUTCOMES:
CO1: Understand the basic concepts of OOPS and syntax in C++.

CO2: Create C++ programs using classes and constructors.

CO3: Understand the basic concepts of overloading and inheritance.

CO4: Understand the basic concepts of OOPS in Java.

CO5: Apply the programming concepts of JAVA to solve problem.

MAPPING OF COURSE OUTCOMES WITH PO:

PO’S
1 2 3 4 5 6 7 8 9 10 11 12
CO1 S M M M M
CO2 L S M L
CO3 M S S L
CO4 M S
CO5 S M

UNIT I: INTRODUCTION
Introduction to OOP: Basic Concepts of OOP- Applications of OOP. Introduction to
C++ - Input and Output Declarations in C++ - Namespaces - Function Prototypes -
Inline Functions - Default Arguments- Unary Scope Resolution Operator.

39
UNIT II: CLASSES, CONSTRUCTORS AND FRIEND CLASS
IIntroduction Comparing class with Structure: Class Scope - Accessing Members of a
class. Constructor - Destructor - Passing and Returning Objects from Functions- Friend
Class and Friend function.

UNIT III: OVERLOADING AND INHERITANCE

Operator Overloading Fundamentals – Restrictions- Overloading stream Insertion and
Stream Extraction Operators- Overloading Unary Binary Operators. Inheritance Intro-
duction Types - Protected Members Public - Protocols and Private Inheritance - Direct
Base Classes and Indirect Base Classes.

UNIT IV: JAVA BASICS

History of Java- Java Buzzwords - Data Types Variables - Scope and Life Time Of Vari-
ables - Arrays - Operators- Expressions - Control Statements - Type Conversion and
Casting - Simple Java Program - Concepts of Classes Objects Constructors Methods -
Access Control- This Keyword - Garbage Collection - Overloading Methods and Con-
structors - Parameter Passing- Recursion - Nested and Inner Classes- Exploring String
Class.

UNIT V: INHERITANCE,PACKAGES AND INTERFACE

Forms of Inheritance- Class Hierarchy- Benefits of Inheritance - Member Access Rules
-Super Uses - Using Final With Inheritance - Polymorphism- Method Overriding - Ab-
stract Classes - Defining - Creating And Accessing A Package - Understanding CLASS
PATH – Importing Packages – Interfaces.

15 WEEK COURSE PLAN

Week Lecture (2 hours) Pedagogy Practical (2 hours)

Introduction to C++ - In- Direct instruc- Write a C++ programs us-
Week 1 put and Output Declara- tion(PPT) ing inline function.
tions in C++ - Namespaces
Function Prototypes . In- Interactive in- Write a C++ programs us-
Week 2
line Functions struction(PPT) ing default arguments.
Default Arguments- Unary Direct instruction Write a C++ program using
Week 3
Scope Resolution Operator. (PPT and Demon- Scope resolution operator.
stration)
Introduction Comparing Direct instruction To learn about OOP Con-
Week 4
class with Structure: Class (Demonstration) cepts.
Scope
Accessing Members of a Direct instruction Write a C++ program using
Week 5
class. Constructor - De- (PPT) Constructor function and
structor Destructor function.

40
Week 6 Passing and Returning Ob- Direct instruction Write a C++ program using
jects from Functions- Friend (Demonstration) Friend function and Friend
Class and Friend function. class.
Operator Overloading Fun- Direct instruction To learn about operator
Week 7
damentals – Restrictions- (Demonstration) overloading.
Overloading stream Inser-
tion and Stream Extraction
Operators
Week 8 Overloading Unary, Binary Direct instruction Write a C++ program using
Operators. (PPT) Unary, Binary Operators.
Week 9 Inheritance Introduction Direct instruc- Write a C++ programs us-
Types - Protected Members tion(PPT) ing inheritance.
Public - Protocols and
Private Inheritance - Direct
Base Classes and Indirect
Base Classes.
Week 10 History of Java- Java Buz- Direct instruction Write a Java program using
zwords - Data Types Vari- (Demonstration) Class and Objects .
ables - Scope and Life Time
Of Variables - Arrays -
Operators- Expressions
Week 11 Control Statements - Type Direct instruction Write a Java program using
Conversion and Casting - (Demonstration) Overloading method.
Simple Java Program
Week 12 Concepts of Classes Ob- Direct instruction Write a Java program using
jects Constructors Methods (Demonstration) Overriding method.
- Access Control- This Key-
word - Garbage Collection
- Overloading Methods and
Constructors - Parameter
Passing- Recursion - Nested
and Inner Classes- Explor-
ing String Class.
Week 13 Forms of Inheritance- Class Direct instruction Write a Java program using
Hierarchy- Benefits of In- (Demonstration) Single Inheritance .
heritance - Member Access
Rules -Super Uses - Using
Final With Inheritance
Week 14 Polymorphism- Method Direct instruction Write a Java program using
Overriding - Abstract (PPT) Mutiple Inheritance
Classes - Defining - Cre-
ating And Accessing A
Package
Week 15 Understanding CLASS Direct instruction To learn about Package
PATH – Importing Pack- (PPT) Concepts
ages – Interfaces.

41
EXPERIMENTS:
1. Write a C++ program using Scope resolution operator.

2. Write a C++ programs using inline function.

3. Write a C++ programs using Constructor function.

4. Write a C++ programs using Destructor function.

5. Write a C++ programs using Friend function.

6. Write a C++ programs using Friend class.

7. Write a Java program using Class and Objects .

8. Write a Java program using Overloading method.

9. Write a Java program using Overriding method.

10. Write a Java program using Multiple Inheritance concepts.

TEXT BOOK(S):
1. E.Balagurusamy, Object-Oriented Programming Using C++ , Mcgraw Hill Educa-
tion, 8th Edition, 2020.

2. Herbert Schildt,Java The complete reference, 11th Edition, McGraw Hill Education,
2019.

REFERENCES:
1. D.S.Malik, C++ Programming Language, CENGAGE Learning, 2009.

2. Bjarne Struoustrup, The C++ Programming Language , Addison Wesley, 2000.

42
 2.4 214CSE2304: NETWORK PROGRAMMING

214CSE2304 Network Programming L T P X C

2 0 2 0 3
Pre-requisite :NIL
Course Category :University Elective
Course Type :Integrated Course - Theory

COURSE OBJECTIVES:
• To understand the concepts to build a network.

• To describe the multimedia networking.

• To analyze the concepts of network management.

• To apply the multi-node setup environment.

• To understand the concepts of IP-IN-IP Encapsulation.

COURSE OUTCOMES:
CO1: Understand the concepts to build a network.

CO2: Describe the multimedia networking.

CO3: Analyze the concepts of network management.

CO4: Apply the multi-node setup environment.

CO5: Understand the concepts of IP-IN-IP Encapsulation.

MAPPING OF COURSE OUTCOMES WITH PO:

PO’S
1 2 3 4 5 6 7 8 9 10 11 12
CO1 S M M M M
CO2 S S
CO3 M M S L
CO4 S S M S S
CO5 S S

43
UNIT I: BUILDING A NETWORK
Requirements – connectivity –cost effective resource sharing – Support for common ser-
vices – Network architecture - Internet architecture – Layering and Protocols – Imple-
menting network software – Example application – Protocol implementation issues –
Performance – Bandwidth and Latency – Delay – Bandwidth product – Application Per-
formance needs.

UNIT II: MULTIMEDIA NETWORKING

Multimedia networking applications – Hurdles for multimedia in today’s internet – Audio
and video compression – Streaming stored Audio and Video – Real Time Streaming
Protocol – Making the Best of the Best-Effort service – An Internet phone example –
Removing jitter at the receiver for audio – Beyond Best Effort - Protocols for Real- Time
interactive Applications.

UNIT III: NETWORK MANAGEMENT

Overview of network management – Infrastructure for network management – Internet
Standard Management Framework – Structure of Management Information – Manage-
ment Information Base – security and administration

UNIT IV: MULTI-NODE SETUP ENVIRONMENT

Setup multi-node cluster of virtual machines on your machine – Local and remote subnets
– Layer 3 route semantics – Configure layer 3 routes in nodes – Dynamic construction of
L3 routing table – Neighbotship database management – Creation of Link state database
– Shortest path first algorithm – calculation of final routing table.

UNIT V: IP-IN-IP ENCAPSULATION

Need - Definition of IP-IN-IP Encapsulation – Routing of Encapsulated packet – scenarios
– TLVs –Need – TLV decoder – Benefits – How ping works – ICMP protocol description
– networking applications – troubleshooting utilities – wireshark –tcpdump – Router to
Vlan forwarding - Concept of SVI interfaces - SVI –Vlan binding - Inter vlan routing.

15 WEEK COURSE PLAN

Week Lecture (2 hours) Pedagogy Practical (2 hours)

Requirements – connectiv- Direct instruc- To implement the L2 rout-
Week 1 ity –cost effective resource tion(PPT) ing concepts
sharing – Support for com-
mon services – Network ar-
chitecture - Internet archi-
tecture

44
 Layering and Protocols – Interactive in- To implement the L3 rout-
Week 2
Implementing network soft- struction(PPT) ing concepts
ware – Example application
– Protocol implementation
issues
Performance – Bandwidth Direct instruc- Understand the procedure
Week 3
and Latency – Delay – tion(Videos) of Dynamic construction of
Bandwidth product – L3 Routing Table
Application Performance
needs.
Multimedia networking ap- Explicit Teaching To study the Networking
Week 4
plications – Hurdles for mul- devices functioning - L2
timedia in today’s internet switch
– Audio and video compres-
sion – Streaming stored Au-
dio and Video
Real Time Streaming Pro- Flipped Learning To implement HTTP web-
Week 5
tocol – Making the Best of servers
the Best-Effort service – An
Internet phone example
Week 6 Removing jitter at the re- Case Study based To learn the concepts of
ceiver for audio – Beyond Learning TLVs
Best Effort - Protocols for
Real- Time interactive Ap-
plications.
Overview of network man- Explicit Teaching To implement the concept
Week 7
agement – Infrastructure for of packet encapsulation.
network management
Week 8 Internet Standard Manage- Problem solving To implement VLANs and
ment Framework – Struc- Routing in VLANs.
ture of Management Infor-
mation
Week 9 Management Informa- Direct instruc- To learn Broadcast domain
tion Base – security and tion(PPT) and collision domain.
administration
Week 10 Setup multi-node cluster of Flipped Learning To learn the SVI interfaces.
virtual machines on your
machine – Local and remote
subnets – Layer 3 route se-
mantics – Configure layer 3
routes in nodes
Week 11 Dynamic construction of L3 Case Study based Implementation of Ping ser-
routing table – Neighbot- Learning vice
ship database management
– Creation of Link state
database

45
Week 12 Shortest path first algo- Direct instruc- Demonstration of Non-
rithm – calculation of final tion(PPT) Blocking I/O
routing table.
Week 13 Need - Definition of IP-IN- Direct instruc- Implementation of concur-
IP Encapsulation – Rout- tion(PPT) rent chat server that allows
ing of Encapsulated packet current logged in
– scenarios – TLVs –Need
– TLV decoder – Benefits –
How ping works
Week 14 ICMP protocol description Interactive in- Build a concurrent multi-
– networking applications – struction(PPT) threaded file transfer server
troubleshooting utilities – using threads
wireshark –tcpdump
Week 15 Router to Vlan forwarding Direct instruc- Implementation Of GUI
- Concept of SVI interfaces tion(PPT) With AWT
- SVI –Vlan binding - Inter
vlan routing.

EXPERIMENTS:
1. To implement the L2 routing concepts

2. To implement the L3 routing concepts

3. Understand the procedure of Dynamic construction of L3 Routing Table

4. To study the Networking devices functioning - L2 switch

5. To implement HTTP webservers

6. To learn the concepts of TLVs

7. To implement the concept of packet encapsulation.

8. To implement VLANs and Routing in VLANs.

9. To learn Broadcast domain and collision domain.

10. To learn the SVI interfaces.

11. Implementation of Ping service

12. Demonstration of Non-Blocking I/O

13. Implementation of concurrent chat server that allows current logged in

14. Build a concurrent multithreaded file transfer server using threads

15. Implementation Of GUI With AWT

46
TEXT BOOK(S):
1. Dr. Parminder Singh , Foundation of Network Programming, 2019.

REFERENCES:
1. Jason Edelman , Scott S. Lowe , Matt Oswalt, Network Programmability and Au-
tomation: Skills for the Next-Generation Network Engineer, 1st Edition, 2018.

47
 2.5 214CSE2305: CLOUD COMPUTING

214CSE2305 Cloud Computing L T P X C

2 0 2 0 3
Pre-requisite :NIL
Course Category :University Elective
Course Type :Integrated Course - Theory

COURSE OBJECTIVES:
• To understand the IaaS, PaaS and SaaS.

• To analyze various scheduling techniques for virtual machines and emerging tech-
nologies in cloud infrastructure.

• To implement private/public/hybrid Cloud infrastructure and components of cloud

computing.

• To design of data security techniques in the Cloud Computing.

• To implement IBM cloud.

COURSE OUTCOMES:
CO1: Understand the IaaS, PaaS and SaaS

CO2: Analyze various scheduling techniques for virtual machines in cloud infrastructure.

CO3: Implement private/public/hybrid Cloud infrastructure.

CO4: Design of data security techniques in the Cloud Computing.

CO5: Implement IBM cloud.

MAPPING OF COURSE OUTCOMES WITH PO:

PO’S
1 2 3 4 5 6 7 8 9 10 11 12
CO1 S M M M M
CO2 S S
CO3 M M S L
CO4 S S M S S
CO5 S S

48
UNIT I: OVERVIEW OF CLOUD COMPUTING
Introduction to Cloud Computing - Definition - Characteristics - Components – Cloud
Provider - SAAS - PAAS - IAAS And Others - Organizational Scenarios of Clouds -
Administering Monitoring Cloud Services - Benefits and Limitations - Deploy Applica-
tion Over Cloud - Comparison among SAAS - PAAS - IAAS Cloud Computing Platforms

UNIT II: CLOUD ADOPTION AND EMERGING TECHNOLO-

GIES
Business case for cloud computing- Emerging technologies – AI, IOT, Analytics - Data
in the Cloud: Relational Databases - Cloud File Systems: GFS And HDFS - Bigtable
- Hbase and Dynamo. Map-Reduce And Extensions: Parallel Computing – The Map-
Reduce Model - Parallel Efficiency of Map-Reduce - Relational Operations Using Map-
Reduce - Enterprise Batch Processing Using Map-Reduce.

UNIT III: COMPONENTS OF CLOUD COMPUTING

Cloud security fundamentals - Vulnerability Assessment Tool for Cloud - Identity Man-
agement and Access Control-Identity Management - Access Control - Autonomic Secu-
rity Cloud Computing Security Challenges: Virtualization Security Management- Virtual
Threats - VM Security Recommendations - VM-Specific Security Techniques - Secure Ex-
ecution Environments and Communications In Cloud.

UNIT IV: SECURITY

Issues in Cloud Computing - Implementing Real Time Application over Cloud Platform -
Issues in Intercloud Environments - QOS Issues in Cloud - Dependability - Data Migration
- Streaming in Cloud. Quality Of Service (Qos) Monitoring in A Cloud Computing
Environment - Cloud Middleware - Mobile Cloud Computing - Inter Cloud Issues – A
Grid Of Clouds - Sky Computing.

UNIT V: IBM CLOUD

Next generation hybrid multi-cloud platform – Advanced data – AI capabilities – IBM
cloud hybrid solutions – cloud native applications – Migrate workloads to cloud – DevOps
– 5G – edge computing – serverless – microservices – Application modernization – Virtual
Private Cloud – Features – benefits –three-tier architecture – Pricing - VPC and IBM
cloud.

15 WEEK COURSE PLAN

Week Lecture (2 hours) Pedagogy Practical (2 hours)

Introduction to Cloud Com- Direct instruc- To study business case for
Week 1 puting,Definition, Char- tion(PPT) cloud computing.
acteristics,Components,
Cloud Provider

49
 SAAS, PAAS, IAAS And Interactive in- To create an account on
Week 2
Others, Organizational Sce- struction(PPT) IBM cloud
narios of Clouds, Admin-
istering Monitoring Cloud
Services
Benefits and Limita- Direct instruc- To implement deployment
Week 3
tions,Deploy Application tion(Videos) models of cloud
Over Cloud,Comparison
among SAAS - PAAS -
IAAS Cloud Computing
Platforms.
Business case for cloud com- Explicit Teaching To study about serverless
Week 4
puting, Emerging technolo- computing
gies – AI, IOT, Analytics
Data in the Cloud: Rela- Flipped Learning To implement hybrid clouds
Week 5
tional Databases, Cloud
File Systems: GFS And
HDFS,Bigtable, Hbase and
Dynamo. Map-Reduce And
Extensions: Parallel Com-
puting,The Map-Reduce
Model
Week 6 Parallel Efficiency of Case Study based To learn about Microser-
Map-Reduce, Relational Learning vices.
Operations Using Map-
Reduce,Enterprise Batch
Processing Using Map-
Reduce.
Cloud security funda- Explicit Teaching Simulate a cloud scenario
Week 7
mentals, Vulnerability using CloudSim and run a
Assessment Tool for scheduling algorithm that is
Cloud,Identity Manage- not present in CloudSim.
ment and Access Control
Week 8 Autonomic Security Cloud Problem solving Find a procedure to trans-
Computing Security Chal- fer the files from one virtual
lenges: Virtualization Se- machine to another virtual
curity Management,Virtual machine.
Threats
Week 9 VM Security Direct instruc- To install and configure own
Recommendations,VM- tion(PPT) cloud.
Specific Security Tech-
niques,Secure Execution
Environments and Commu-
nications In Cloud.

50
Week 10 Issues in Cloud Comput- Flipped Learning To implement virtualization
ing,Implementing Real in cloud computing.
Time Application over
Cloud Platform,Issues
in Intercloud Environ-
ments,QOS Issues in
Cloud,Dependability, Data
Migration
Week 11 Streaming in Cloud. Qual- Case Study based Install Virtualbox/VMware
ity Of Service (Qos) Moni- Learning Workstation with different
toring in A Cloud Comput- flavours of linux or windows
ing Environment OS on top of windows7 or 8.
Week 12 Cloud Middleware,Mobile Direct instruc- Find a procedure to launch
Cloud Computing, Inter tion(PPT) virtual machine using trys-
Cloud Issues,A Grid Of tack.
Clouds,Sky Computing.
Week 13 Next generation hy- Direct instruc- Install Hadoop single node
brid multi-cloud plat- tion(PPT) cluster and run simple ap-
form,Advanced data,AI plications like wordcount.
capabilities,IBM cloud
hybrid solutions,cloud na-
tive applications,Migrate
workloads to cloud
Week 14 DevOps,5G,edge com- Interactive in- Install a C compiler in the
puting,serverless, mi- struction(PPT) virtual machine created us-
croservices,Application ing virtual box and execute
modernization Simple Programs
Week 15 Virtual Private Direct instruc- Use GAE launcher to
Cloud,Features, bene- tion(PPT) launch the web applica-
fits, three-tier architec- tions.
ture,Pricing,VPC and IBM
cloud.

EXPERIMENTS:
1. To study business case for cloud computing.

2. To create an account on IBM cloud

3. To implement deployment models of cloud

4. To study about serverless computing

5. To implement hybrid clouds

6. To learn about Microservices.

51
 7. Simulate a cloud scenario using CloudSim and run a scheduling algorithm that is
not present in CloudSim.

8. Find a procedure to transfer the files from one virtual machine to another virtual
machine.

9. To install and configure own cloud.

10. To implement virtualization in cloud computing.

11. Install Virtualbox/VMware Workstation with different flavours of linux or windows

OS on top of windows7 or 8.

12. Find a procedure to launch virtual machine using trystack.

13. Install Hadoop single node cluster and run simple applications like wordcount.

14. Install a C compiler in the virtual machine created using virtual box and execute
Simple Programs

15. Use GAE launcher to launch the web applications.

TEXT BOOK(S):
1. Stephen Orban, Andy Jassy, Adrian Cockcroft, Mark Schwartz , Ahead in the
Cloud: Best Practices for Navigating the Future of Enterprise IT, CreateSpace
Independent Publishing Platform; 1st edition, 2018.

REFERENCES:
1. Michael J. Kavis , Architecting the Cloud: Design Decisions for Cloud Computing
Service Models (SaaS, PaaS, and IaaS), Wiley, 1st Edition, Kindle Edition, 2014.

52
 2.6 214CSE2306: ANDROID PROGRAMMING

214CSE2306 ANDROID PROGRAMMING L T P X C

2 0 2 0 3
Pre-requisite :NIL
Course Category :University Elective
Course Type :Integrated Course - Theory

COURSE OBJECTIVES:
• To understand Android SDK..

• To gain a basic understanding of Android Application Development.

• To design the basic level application using Android SDK.

COURSE OUTCOMES:
CO1: Understand the basics of android application development environment.

CO2: Build their ability to develop software with reasonable complexity on mobile plat-
form.

CO3: Analyze the basics of android User Interface.

CO4: Discover the life cycles of Activities, Applications, intents and fragments.

CO5: Design the Android apps for real time problem.

MAPPING OF COURSE OUTCOMES WITH PO:

PO’S
1 2 3 4 5 6 7 8 9 10 11 12
CO1 S L L M M L
CO2 S S M L
CO3 S M M L M L L M M L
CO4 S M M L L L M
CO5 S M M M M M L L M M L

UNIT I: INTRODUCTION ANDROID PROGRAMMING

Features of Android, Architecture of Android, Android Devices in the Market, Android
SDK, Installing the Android SDK Tools, Configuring the Android SDK Manager, Eclipse,
Android Development Tools (ADT), Creating Android Virtual Devices (AVDs), Creating
Your First Android Application, Anatomy of an Android Application.

53
UNIT II: ANDROID USER INTERFACE
Understanding the Components of a Screen, Views and ViewGroups, LinearLayout, Abso-
luteLayout, TableLayout, RelativeLayout, FrameLayout, ScrollView, Adapting to Display
Orientation, Anchoring Views, Resizing and Repositioning, Managing Changes to Screen
Orientation, Persisting State Information during Changes in Configuration, Detecting
Orientation Change, Controlling the Orientation of the Activity.

UNIT III: DESIGNING YOUR USER INTERFACE WITH VIEWS

Using Basic Views, TextView View, Button, ImageButton, EditText, CheckBox, Toggle-
Button, RadioButton, and RadioGroup Views, ProgressBar View,Using Picker Views,
Using List Views to Display Long Lists, Using the Spinner View, Using Image Views to
Display Pictures, Gallery and ImageView Views, ImageSwitcher, GridView, Using Menus
with Views.

UNIT IV: DATA PERSISTENCE

Saving and Loading User Preferences, Accessing Preferences Using an Activity, Program-
matically Retrieving and Modifying the Preferences Values, Persisting Data to Files, Cre-
ating and Using Databases, Creating the DBAdapter Helper Class, Using the Database
Programmatically , Pre-Creating the Database.

UNIT V: APPLICATION DEVELOPMENT

Building Application(IOS, Window, Android).- App structure, built-in Controls, file ac-
cess, basic graphics Android/iOS/Win8 inbuilt APP- DB access, network access, con-
tacts/photos. Native level programming on Android -Low-level programming on (jail-
broken) iOS-Windows low level APIs.

54
15 WEEK COURSE PLAN

Week Lecture (2 hours) Pedagogy Practical (2 hours)

Features of Android, Archi- PPT, Demonstra- Installing Andriod Studio
Week 1 tecture of Android, Android tion on Windows
Devices in the Market, An-
droid SDK, Installing the
Android SDK Tools
Configuring the Android Demonstration, Create “Hello World” ap-
Week 2 SDK Manager, Eclipse, An- PPT,Videos plication. That will dis-
droid Development Tools play “Hello World” in the
(ADT), Creating Android middle of the screen using
Virtual Devices (AVDs) TextView Widget in the yel-
low color
Creating Your First PPT,Case Study- i) Create application for
Week 3 Android Application, based Learning demonstration of android
Anatomy of an Android activity life cycle .
Application. ii) Create Registration page
to demonstration of Ba-
sic widgets available in an-
droid.
Understanding the Compo- PPT Using Android, Create
Week 4 nents of a Screen, Views a login Activity. It asks
and ViewGroups, Linear- “username” and “pass-
Layout, Abso- luteLayout, word” from user. If
TableLayout, RelativeLay- username and password are
out, FrameLayout, Scrol- valid, it displays Welcome
lView message using new activity.
Adapting to Display Ori- PPT, Videos i) Create an application for
Week 5 entation, Anchoring Views, demonstration of Relative
Resizing and Reposition- and Table Layout in an-
ing, Managing Changes to droid.
Screen Orientation ii) “Independence Day ”
App using TextView and
ImageView.
Persisting State Informa- PPT Create “Hello Toast” App
Week 6 tion during Changes in Con- by implementing a click
figuration, Detecting Orien- handler method for the but-
tation Change, Controlling ton to display a message on
the Orientation of the Ac- the screen when the user
tivity clicks. Use Linear Layout
for creating view.

55
 Using Basic Views, PPT, Case Study- i) Create an application
Week 7 TextView View, Button, based Learning for demonstration of Scroll
ImageButton, EditText, view in android.
CheckBox, Toggle- Button, ii) Create an application
RadioButton that will pass two number
using TextView to the next
screen , and on the next
screen display sum of that
number
RadioGroup Views, Pro- Case Study- Create an application that
Week 8 gressBar View,Using Picker based Learning, will have spinner with list
Views, Using List Views to Problem solving, of animation names. On
Display Long Lists, Using PPT selecting animation name,
the Spinner View that animation should affect
on the images displayed be-
low
Using Image Views to PPT, Demonstra- Create a list of all courses
Week 9 Display Pictures, Gallery tion in your college and on
and ImageView Views, selecting a particular course
ImageSwitcher, GridView, teacher-incharge of that
Using Menus with Views course should appear at the
bottom of the screen
Saving and Loading User PPT, Case Study- Create an application with
Week 10 Preferences, Accessing Pref- based Learning three option buttons, on se-
erences Using an Activity. lecting a button colour of
the screen will change.
Programmatically Retriev- PPT, Demonstra- Saving Data to Internal
Week 11 ing and Modifying the Pref- tion Storage as files
erences Values, Persisting
Data to Files, Creating and
Using Databases.
Creating the DBAdapter PPT,Videos Student database using
Week 12 Helper Class, Using the SQlite
Database Programmatically
, Pre-Creating the Database
Building Application(IOS, PPT, Flipped Create an application to
Week 13 Window, Android).- App Learning Create, Insert, update,
structure, built-in Controls, Delete and retrieve opera-
file access. tion on the database
Basic graphics An- PPT, Videos, Develop a native applica-
Week 14 droid/iOS/Win8 inbuilt Demonstration tion that uses GPS location
APP- DB access, network information
access, contacts/photos

56
 Native level programming PPT, Case Study- Design a society based An-
Week 15 on Android -Low-level pro- based Learning droid Application.
gramming on (jailbroken)
iOS-Windows low level
APIs.

EXPERIMENTS:
1. Installing Andriod Studio on Windows.

2. Create “Hello World” application. That will display “Hello World” in the middle
of the screen using TextView Widget in the yellow color.

3. i) Create application for demonstration of android activity life cycle .

ii) Create Registration page to demonstration of Basic widgets available in android.

4. Using Android, Create a login Activity. It asks “username” and “password” from
user. If username and password are valid, it displays Welcome message using new
activity.

5. i) Create an application for demonstration of Relative and Table Layout in android.

ii) “Independence Day ” App using TextView and ImageView.

6. Create “Hello Toast” App by implementing a click handler method for the button
to display a message on the screen when the user clicks. Use Linear Layout for
creating view.

7. i) Create an application for demonstration of Scroll view in android.

ii) Create an application that will pass two number using TextView to the next
screen , and on the next screen display sum of that number.

8. Create an application that will have spinner with list of animation names. On
selecting animation name, that animation should affect on the images displayed
below.

9. Create a list of all courses in your college and on selecting a particular course
teacher-incharge of that course should appear at the bottom of the screen.

10. Create an application with three option buttons, on selecting a button colour of the
screen will change.

11. Saving Data to Internal Storage as files.

12. Student database using SQlite.

57
13. Create an application to Create, Insert, update, Delete and retrieve operation on
the database.

14. Develop a native application that uses GPS location information.

15. Design a society based Android Application.

TEXT BOOK(S):
1. Wei-Meng Lee, Beginning Android 4 Application Development March 2012.

2. Rajiv Ramnath, Roger Crawfis, and Paolo Sivilotti, Android SDK3 for Dum-
mies,Wiley 2011.

REFERENCES:
1. Jeff McWherter and Scott Gowell, Professional Mobile Application Development,
Wrox 2012.

2. Charlie Collins, Michael Galpin and Matthias Kappler, Android in Practice, Dream
Tech. 2012.

3. James Dovey and Ash Furrow, Beginning Objective C, Apress, 2012.

4. David Mark, Jack Nutting, Jeff LaMouche, and Fredric Olsson, Beginning iOS
Development: Exploring the iOS SDK, Apress, 2013.

58
 2.7 214CSE3307: DATA ANALYTICS WITH R

214CSE3307 Data Analytics With R L T P X C

2 0 2 0 3
Pre-requisite :NIL
Course Category :University Elective
Course Type :Integrated Course - Theory

COURSE OBJECTIVES:
• In this course students will learn R. Programming language,data analytics, data
visualisation and statistical model for data analytics.

• By completion of this course, students will be able to become data analyst.

COURSE OUTCOMES:
CO1: Understand the concepts of Various Analytics Techniques.

CO2: Analyze the various concepts of R Programming Basics.

CO3: Understand and apply the concepts of getting data of different types into R.

CO4: Create various paradigms of Visualizations using R.

CO5: Analyze the various concepts of decision trees Statics in R.

MAPPING OF COURSE OUTCOMES WITH PO:

PO’S
1 2 3 4 5 6 7 8 9 10 11 12
CO1 S M M M M
CO2 L M
CO3 M S S M L
CO4 S
CO5 S M M

UNIT I: Introduction to Data Analytics

Overview of Data Analytics, Need of Data Analytics, Nature of Data, Types of data and
data Analytics- Characteristics of Data, Applications of Data Analytics.Business Intelli-
gence and Analytics, Business Analytics Optimization.

59
UNIT II: R Programming Basics
Overview of R programming, Environment setup with R Studio, R Commands, Vari-
ables and Data Types, Control Structures, Array, Matrix, Vectors, Factors, Functions, R
packages.

UNIT III: Getting data into R:

Introduction to Reading and getting data into R (External Data)-Using CSV files, XML
files, Web Data, JSON files, Databases, Excel files.

UNIT IV: Working with R Charts and Graphs

Introduction to Working with R Charts and Graphs- Histograms, Boxplots, Bar Charts,
Line Graphs, Scatter plots, Pie Charts.

UNIT V: Statistics with R

Random Forest, Decision Tree, Normal and Binomial distributions, Time Series Analysis,
Linear and Multiple Regression, Logistic Regression, Survival Analysis.

15 WEEK COURSE PLAN

Week Lecture (2 hours) Pedagogy Practical (2 hours)

Overview of Data Ana- Direct instruc- Write a R program great-
Week 1 lytics, Need of Data An- tion(PPT) est among 3 numbers us-
alytics, Nature of Data, ing if and else Statement.
Types of data and data
Analytics.
Characteristics of Data, Direct instruc- Write a R program to
Week 2
Applications of Data An- tion(PPT) generate the even num-
alytics. ber from 1 to 30 using
loop statement.
Business Intelligence and Direct instruction Write a R program to
Week 3
Analytics, Business Ana- (PPT) calculate factorial of a
lytics Optimization. number using function.
Overview of R pro- Direct instruc- Write a R program to
Week 4
gramming, Environment tion(PPT) create user defined func-
setup with R Studio, R tions to perform bubble
Commands, Variables sort using array.
and Data Types,
Control Structures, Ar- Direct instruction Write a R program to
Week 5
ray, Matrix, Vectors, (PPT) create user defined func-
Factors. tions to perform selection
sort using array.

60
Week 6 Functions, R packages. Direct instruc- Write a R program to
tion(PPT) create user defined func-
tions to perform binary
search on numeric vector
using array .
Introduction to Reading Direct instruc- Write an R script to find
Week 7
and getting data into tion(PPT) basic descriptive statis-
R (External Data)-Using tics using summary, str,
CSV files, XML files. quartile function on mt-
cars and cars datasets.
Week 8 Web Data, JSON files. Direct instruction Write an R script to
(PPT) find subset of dataset by
using subset (), aggre-
gate () functions on iris
dataset.
Week 9 Databases, Excel files. Direct instruc- READING AND WRIT-
tion(PPT) ING DIFFERENT
TYPES OF DATASETS
A.Reading different
types of data sets (.txt,
.csv) from Web and disk
and writing in file in
specific disk location.
Week 10 Introduction to Work- Direct instruc- READING AND WRIT-
ing with R Charts and tion(PPT) ING DIFFERENT
Graphs. TYPES OF DATASETS
b. Reading Excel data
sheet in R.
Week 11 Histograms, Boxplots, Direct instruc- READING AND WRIT-
Bar Charts. tion(PPT) ING DIFFERENT
TYPES OF DATASETS
c. Reading XML dataset
in R
Week 12 Line Graphs, Scatter Direct instruc- VISUALIZATIONS a.
plots, Pie Charts. tion(PPT) Find the data distri-
butions using box and
scatter plot.
Week 13 Random Forest, Decision Interactive in- VISUALIZATIONS b.
Tree, struction (Prob- Plot the histogram, bar
lem solving) chart and pie chart on
sample data.

61
 Week 14 Normal and Binomial Interactive in- REGRESSION MODEL
distributions, Time Se- struction (Prob- Import a data from web
ries Analysis lem solving) storage. Name the
dataset and perform Lo-
gistic Regression to find
out the relation between
variables that are affect-
ing the admission of a
student in a institute
based on his/her GRE
score, GPA, GPA ob-
tained and rank of the
student. Project the ac-
curacy of the model.
Week 15 Linear and Multiple Re- Interactive in- REGRESSION MODEL
gression, Logistic Regres- struction (Prob- Import a data from web
sion, Survival Analysis. lem solving) storage. Name the
dataset and perform Lo-
gistic Regression to find
out the relation between
variables that are affect-
ing the admission of a
student in a institute
based on his/her GRE
score, GPA, GPA ob-
tained and rank of the
student. Project the ac-
curacy of the model.

TEXT BOOK(S):
1. An Introduction to R, Notes on R: A Programming Environment for Data Analysis
and Graphics. W. N. Venables, D.M. Smith and the R Development Core Team,
2008.

REFERENCES:
1. Jared P Lander, R for everyone: advanced analytics and graphics, Pearson Educa-
tion, 2018.

2. Dunlop, Dorothy D., and Ajit C. Tamhane. Statistics and data analysis: from
elementary to intermediate. Prentice Hall, 2000.

3. G Casella and R.L. Berger, Statistical Inference, Thomson Learning, Second Edition
2002.

62
 2.8 214CSE3308: INTRODUCTION TO CYBER SECURITY

214CSE3308 Introduction to Cyber Security L T P X C

2 0 2 0 3
Pre-requisite :NIL
Course Category :University Elective
Course Type :Integrated Course - Theory

COURSE OBJECTIVES:
• Understand Key terms and concepts in Cryptography.

• To be able to secure a message over insecure channel by various means.

• To learn about how to maintain the Confidentiality, Integrity and Availability of a

data.

COURSE OUTCOMES:
CO1: Understand the basic concepts of security, computer crime and attacks.

CO2: Learn security policies and forensics computation.

CO3: Analyze the crimes and securities/attacks.

CO4: Implement the securities.

CO5: Discover the issues and forensics data.

MAPPING OF COURSE OUTCOMES WITH PO:

PO’S
1 2 3 4 5 6 7 8 9 10 11 12
CO1 S M M L
CO2 S S L M M M
CO3 S S S L M M M L
CO4 S S S L L M L
CO5 S L M M M L L M

UNIT I: INTRODUCTION
Basic Cyber Security Concepts, layers of security, Vulnerability, threat, Harmful acts,
Internet Governance – Challenges and Constraints, Computer Criminals, CIA Triad, As-
sets and Threat, motive of attackers, active attacks, passive attacks, Software attacks,

63
hardware attacks, Spectrum of attacks, Taxonomy of various attacks, IP spoofing, Meth-
ods of defense, Security Models, risk management, Cyber Threats-Cyber Warfare, Cyber
Crime, Cyber terrorism, Cyber Espionage, etc., Comprehensive Cyber Security Policy.

UNIT II: CYBERSPACE AND THE LAW CYBER

FORENSICS
Introduction, Cyber Security Regulations, Roles of International Law. The INDIAN Cy-
berspace, National Cyber Security Policy. Introduction, Historical background of Cyber
forensics, Digital Forensics Science, The Need for Computer Forensics, Cyber Forensics
and Digital evidence, Forensics Analysis of Email, Digital Forensics Lifecycle, Forensics
Investigation, Challenges in Computer Forensics, Special Techniques for Forensics Audit-
ing.

UNIT III: CYBERCRIME: MOBILE AND WIRELESS DEVICES

Introduction, Proliferation of Mobile and Wireless Devices, Trends in Mobility, Credit
card Frauds in Mobile and Wireless Computing Era, Security Challenges Posed by Mobile
Devices, Registry Settings for Mobile Devices, Authentication service Security, Attacks
on Mobile/Cell Phones, Mobile Devices: Security Implications for Organizations, Orga-
nizational Measures for Handling Mobile, Organizational Security Policies and Measures
in Mobile Computing Era, Laptops.

UNIT IV: CYBER SECURITY: ORGANIZATIONAL

IMPLICATIONS
Introduction cost of cybercrimes and IPR issues, web threats for organizations, security
and privacy implications, social media marketing: security risks and perils for organi-
zations, social computing and the associated challenges for organizations. Cybercrime
and Cyber terrorism: Introduction, intellectual property in the cyberspace, the ethical
dimension of cybercrimes the psychology, mindset and skills of hackers and other cyber
criminals.

UNIT V: PRIVACY ISSUES

Privacy Issues: Basic Data Privacy Concepts: Fundamental Concepts, Data Privacy
Attacks, Data linking and profiling, privacy policies and their specifications, privacy
policy languages, privacy in different domains- medical, financial, etc.

15 WEEK COURSE PLAN

Week Lecture (2 hours) Pedagogy Practical (2 hours)

64
 Basic Cyber Security PPT, Tool Study the use of net-
Week 1 Concepts, layers of secu- Demonstra- work reconnaissance tools
rity, Vulnerability,threat, tion like WHOIS, dig, tracer-
Harmful acts, Internet oute, nslookup to gather in-
Governance – Challenges formation about networks
and Constraints, Computer and domain registrars
Criminals, CIA Triad,
Assets and Threat
Motive of attackers, active PPT, Tool Study of packet sniffer tools
Week 2 attacks, passive attacks, Demonstra- like wireshark, ethereal,
Software attacks, hardware tion tcpdump etc. Use the
attacks, Spectrum of at- tools to do the following
tacks, Taxonomy of various 1. Observer performance
attacks in promiscuous as well as
non-promiscous mode. 2.
Show that packets can be
traced based on different
filters.
IP spoofing, Methods of PPT,Flipped Download and install nmap.
Week 3 defense, Security Models, Class Learn- Use it with different options
risk management, Cyber ing to scan open ports,perform
Threats-Cyber Warfare, OS fingerprinting, do a ping
Cyber Crime, Cyber ter- scan, tcp port scan, udp
rorism, Cyber Espionage, port scan, etc
etc., Comprehensive Cyber
Security Policy
Introduction, Cyber Secu- PPT, Anima- HTTP basics
Week 4 rity Regulations, Roles of tion
International Law. The
INDIAN Cyberspace, Na-
tional Cyber Security Policy
Introduction, Historical PPT, Videos OWASP installation
Week 5 background of Cyber
forensics, Digital Forensics
Science, The Need for
Computer Forensics, Cyber
Forensics and Digital evi-
dence, Forensics Analysis of
Email
Digital Forensics Lifecycle, PPT, Case HTML injection
Week 6 Forensics Investigation, Studybased
Challenges in Com- Learning
puter Forensics, Special
Techniques for Forensics
Auditing

65
 Introduction, Proliferation PPT, Demon- Login Page SQL injection
Week 7 of Mobile and Wireless De- stration
vices, Trends in Mobility,
Credit card Frauds in Mo-
bile and Wireless Comput-
ing Era, Security Challenges
Posed by Mobile Devices
Registry Settings for PPT, Prob- File inclusion vulnerability
Week 8 Mobile Devices, Authen- lem Solving
tication service Security,
Attacks on Mobile/Cell
Phones, Mobile Devices
Security Implications for PPT, Demon- RFI Remote file inclusion
Week 9 Organizations, Organi- stration
zational Measures for
Handling Mobile, Organi-
zational Security Policies
and Measures in Mobile
Computing Era, Laptops.
Introduction cost of cyber- PPT, Flipped Path traversal attack or Di-
Week 10 crimes and IPR issues, web Class Learn- rectory browsing attack
threats for organizations, ing
security and privacy impli-
cations, social media mar-
keting.
Security risks and perils for PPT, Videos CSRF Cross Site Request
Week 11 organizations, social com- Forgery
puting and the associated
challenges for organizations.
Cybercrime and Cyber ter- PPT, Videos Buffer overflow
Week 12 rorism: Introduction, intel-
lectual property in the cy-
berspace, the ethical dimen-
sion of cybercrimes the psy-
chology, mindset and skills
of hackers and other cyber
criminals.
Privacy Issues: Basic Data PPT, Flipped Use the Nessus tool to scan
Week 13 Privacy Concepts: Funda- Learning the network for vulnerabili-
mental Concepts, Data Pri- ties
vacy Attacks.
Data linking and profiling, PPT, Demon- Firewalls and Intrusion De-
Week 14 privacy policies and their stration tection Systems (IDS) - IP
specifications. Tables

66
 Privacy policy languages, PPT, Demon- Firewalls Bypassing
Week 15 privacy in different stration
domains- medical, financial,
etc.

EXPERIMENTS:
1. Study the use of network reconnaissance tools like WHOIS, dig, traceroute, nslookup
to gather information about networks and domain registrars.

2. Study of packet sniffer tools like wireshark, ethereal, tcpdump etc. Use the tools
to do the following
i) Observer performance in promiscuous as well as non-promiscous mode.
ii) Show that packets can be traced based on different filters.

3. Download and install nmap. Use it with different options to scan open ports,perform
OS fingerprinting, do a ping scan, tcp port scan, udp port scan, etc

4. HTTP basics

5. OWASP installation

6. HTML injection

7. Login Page SQL injection

8. File inclusion vulnerability

9. RFI Remote file inclusion

10. Path traversal attack or Directory browsing attack

11. CSRF Cross Site Request Forgery

12. Buffer overflow

13. Use the Nessus tool to scan the network for vulnerabilities

14. Firewalls Intrusion Detection Systems (IDS) - IP Tables

15. Firewalls Bypassing

TEXT BOOK(S):
1. Nina Godbole and Sunit Belpure, Cyber Security Understanding Cyber Crimes,
Computer Forensics and Legal Perspectives, Wiley.

2. B. B. Gupta, D. P. Agrawal, Haoxiang Wang, Computer and Cyber Security: Princi-

ples, Algorithm, Applications, and Perspectives, CRC Press, ISBN 9780815371335,
2018.

67
REFERENCES:
1. Cyber Security Essentials, James Graham, Richard Howard and Ryan Otson, CRC
Press.

2. Introduction to Cyber Security, Chwan-Hwa(john) Wu,J. David Irwin, CRC Press

TF Group.

68
 2.9 214CSE3309: INTRODUCTION TO MACHINE LEARN-
ING

214CSE3309 Introduction to Machine Learning L T P X C

2 0 2 0 3
Pre-requisite :NIL
Course Category :University Elective
Course Type :Integrated Course - Theory

COURSE OBJECTIVES:
• Prepare the students to understand and gain the knowledge about Machine Learning
and statistical modelling

• Gain knowledge on various machine learning algorithms and apply the same on real
time data extracted from confined sources.

• Familiarise the students with Python programming packages pertaining to Machine

Learning.

COURSE OUTCOMES:
CO1: Understand the concepts and paradigms of machine learning.

CO2: Apply the regression models on continuous data and analyse the efficiency.

CO3: Apply the classification models on discrete data and analyse the efficiency.

CO4: Apply clustering algorithms over the data with appropriate pre-processing.

CO5: Understand and create machine learning models for real time data, appropriate to
the given application.

MAPPING OF COURSE OUTCOMES WITH PO:

PO’S
1 2 3 4 5 6 7 8 9 10 11 12
CO1 L L
CO2 S S S S M
CO3 S S S S M
CO4 S S S S M
CO5 S S S S M L L L S L L M

69
UNIT I:INTRODUCTION TO MACHINE LEARNING
The Origins of Machine Learning, Uses and Abuses of Machine Learning – Abstraction
and Knowledge Representation, Generalization, Assessing the Success of Learning, Steps
to Apply Machine Learning to Data, choosing a Machine Learning Algorithm -Thinking
about the Input Data, Thinking about Types of Machine Learning Algorithms.

UNIT II: SIMPLE LINEAR REGRESSION AND MODEL BUILD-

ING
Introduction to Simple Linear Regression, Simple Linear Regression Model Building, Val-
idation of Simple Linear Regression Model, Coefficient of Determination(R-squared) and
Adjusted R-Squared, Hypothesis Test for Regression Coefficients (t-Test), Test for Over-
all Model: Analysis of Variance (F-Test).

UNIT III: CLASSIFICATION ALGORITHMS

Introduction to Classification, General Approach to Classification, Data Distribution, k-
Nearest Neighbour Algorithm, Logistic Regression, Decision Trees, Naive Bayesian Clas-
sifier Random Forests.

UNIT IV: CLUSTERING ALGORITHMS

Introduction to Clustering, Characteristics of Data for Clustering, Types of Clustering,
Partitioning Methods, k Means Clustering, Gap Analysis, k Medoids Clustering, Hierar-
chical Clustering – Agglomerative and Divisive Clustering.

UNIT V: APPLICATIONS
Machine Learning in Banking and Security – Machine Learning in Communication, Media
and Entertainment, Healthcare and Life Sciences – Machine Learning in Education –
Machine Learning in Government and Insurance.

15 WEEK COURSE PLAN

Week Lecture (2 hours) Pedagogy Practical (2 hours)

The Origins of Machine Direct instruc- Hands-on session for In-
Week 1 Learning, Uses and Abuses tion(PPT) troduction to Machine
of Machine Learning Learning Concepts.
Abstraction and Knowledge Direct instruc- Hands-on session for
Week 2
Representation, Generaliza- tion(PPT) Steps to Apply Machine
tion, Assessing the Success Learning to Data, choos-
of Learning. ing a Machine Learning
Algorithm.

70
 Thinking about the Input Direct instruction Hands-on session for
Week 3
Data. (PPT) Thinking about Types
of Machine Learning
Algorithms.
Introduction to Simple Lin- Direct instruc- Program to demonstrate
Week 4
ear Regression, Simple Lin- tion(PPT) Simple Linear Regres-
ear Regression Model Build- sion.
ing.
Validation of Simple Linear Direct instruction Program to demonstrate
Week 5
Regression Model. (PPT) Logistic Regression.
Week 6 Coefficient of Direct instruc- Hands-on session for Test
Determination(R-squared) tion(PPT) for Overall Model: Anal-
and Adjusted R-Squared, ysis of Variance (F-Test).
Hypothesis Test for Regres-
sion Coefficients (t-Test).
Introduction to Classifica- Direct instruc- Program to demonstrate
Week 7
tion, General Approach to tion(PPT) k-Nearest Neighbor clas-
Classification, Data Distri- sification.
bution.
Week 8 k-Nearest Neighbour Algo- Direct instruction Program to demonstrate
rithm, Logistic Regression, (PPT) Decision Tree Algorithm.
Decision Trees.
Week 9 Naive Bayesian Classifier Direct instruc- Program to demonstrate
Random Forests. tion(PPT) Random Forest Classi-
fier.
Week 10 Introduction to Clustering, Direct instruc- Program to demonstrate
Characteristics of Data for tion(PPT) k-means clustering algo-
Clustering. rithm.
Week 11 Types of Clustering, Parti- Direct instruc- Program to demonstrate
tioning Methods, k Means tion(PPT) k-medoids clustering al-
Clustering. gorithm.
Week 12 Gap Analysis, k Medoids Direct instruc- Program to demonstrate
Clustering, Hierarchical tion(PPT) hierarchical agglomera-
Clustering – Agglomerative tive clustering algorithm.
and Divisive Clustering.
Week 13 Machine Learning in Bank- Direct instruc- Hands-on session for Ma-
ing and Security tion(PPT) chine Learning in Com-
munication.
Week 14 Media and Entertainment, Direct instruction Hands-on session for
(PPT) Healthcare and Life
Sciences.
Week 15 Machine Learning in Educa- Direct instruction Hands-on session for Ma-
tion . (PPT) chine Learning in Gov-
ernment and Insurance.

71
EXPERIMENTS:
1. Program to demonstrate Simple Linear Regression.

2. Program to demonstrate Logistic Regression.

3. Program to demonstrate k-Nearest Neighbor classification.

4. Program to demonstrate Decision Tree Algorithm.

5. Program to demonstrate Random Forest Classifier.

6. Program to demonstrate k-means clustering algorithm.

7. Program to demonstrate k-medoids clustering algorithm.

8. Program to demonstrate hierarchical agglomerative clustering algorithm.

TEXT BOOK(S):
1. Atul Kahate, Introduction to Database Management Systems, Pearson Educa-
tion,New Delhi, 2006.

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

REFERENCES:
1. P. Flach, Machine Learning: The art and science of algorithms that make sense of
data, Cambridge University Press, 2012.

2. C2. M. Mohri, A. Rostamizadeh, and A. Talwalkar, Foundations of Machine Learn-

ing,MIT Press, 2012 .

72
 2.10 214CSE4310: ETHICAL HACKING

214CSE4310 Ethical Hacking L T P X C

2 0 2 0 3
Pre-requisite :NIL
Course Category :University Elective
Course Type :Integrated Course - Theory

COURSE OBJECTIVES:
• To understand the need of Ethical Hacking .

• To demonstrate the social engineering attacks .

• To implement the various attacks and vulnerabilities.

• To design the tools and techniques to prevent hacking .

• To analyze the various malwares.

COURSE OUTCOMES:
CO1: Understand the need of Ethical Hacking

CO2: Demonstrate the social engineering attacks

CO3: Implement the various attacks and vulnerabilities

CO4: Design the tools and techniques to prevent hacking

CO5: Analyze the various malwares.

MAPPING OF COURSE OUTCOMES WITH PO:

PO’S
1 2 3 4 5 6 7 8 9 10 11 12
CO1 S M M M M
CO2 S S
CO3 M M S L
CO4 S S M S S
CO5 S S

73
UNIT I: INTRODUCTION OF ETHICAL HACKING
Ethics Of Ethical Hacking:Cyber ethics Hacking –Introduction Why you need to Un-
derstand Your Enemy’s Tactics?, Recognizing The Gray Areas in Security, Information
Gathering, Scanning, Vulnerability Assessment Penetration Testing. Ethical Hacking and
the Legal System: Understanding Individual Cyberlaws 18 USC Section 1029, 1030, 2510
Digital Millennium Copyright Act (DMCA) Cyber Security Enhancement Act 2002

UNIT II: SOCIAL ENGINEERING ATTACKS

Social Engineering Attacks: How A Social Engineering Attack Works? Conducting A So-
cial Engineering Attack Common Attacks used in Penetration Testing Defending Against
Social Engineering Attacks. Physical Penetration Attacks: Why A Physical Penetration
is important Conducting a Physical Penetration Common Ways into A Building. Insider
Attacks: Why Simulating an Insider Attack is Important Conducting an Insider Attack
Defending against Insider Attack.

UNIT III: CONTENT-TYPE ATTACKS

Understanding and Detecting Content-Type Attacks: How do Content-Type Attacks
work? - Which File Formats are Being Exploited Today? - Tools to Detect Malicious
PDF Files Tools to test your Protections against Content-Type Attacks How to protect
your Environment from Content-Type Attacks. Web Application Security Vulnerabilities:
Overview of Top Web Application Security Vulnerabilities SQL Injection Vulnerabilities
Cross-Site Scripting Vulnerabilities. VoIP Attacks

UNIT IV: PASSIVE ANALYSIS

Passive Analysis: Ethical Reverse Engineering Why Bother with Reverse Engineering?
Source Code Analysis. Advanced Reverse Engineering: Overview of Software Develop-
ment Process Instrumentation Tools Fuzzing Instrumented Fuzzying Tools and Tech-
niques. Finding New Browser Based Vulnerabilities. Mitigation Alternatives

UNIT V: MALWARE ANALYSIS

Collecting Malware and Initial Analysis: Malware Latest Trends in Honeynet Technol-
ogy Catching Malware Initial Analysis of Malware. Hacking Malware: Trends in Mal-
ware De-Obfuscating Malware Reverse Engineering Malware. How to hack Wi-Fi?, Web-
server,Website

15 WEEK COURSE PLAN

Week Lecture (2 hours) Pedagogy Practical (2 hours)

74
 Ethics Of Ethical Hacking: Direct instruc- To learn about hack-
Week 1 Cyber ethics Hacking –In- tion(PPT) ing tools and skills.
troduction Why you need to
Understand Your Enemy’s
Tactics?, Recognizing The
Gray Areas in Security
Information Gathering, Interactive in- To implement Foot-
Week 2
Scanning, Vulnerability struction(PPT) printing and Recon-
Assessment Penetration naissance.
Testing. Ethical Hacking
and the Legal System
Understanding Individual Direct instruc- To study about Fin-
Week 3
Cyberlaws 18 USC Section tion(Videos) gerprinting
1029, 1030, 2510 Digital
Millennium Copyright Act
(DMCA) Cyber Security
Enhancement Act 2002.
Social Engineering Attacks: Explicit Teaching To implement system
Week 4
How A Social Engineering Hacking
Attack Works? Conducting
A Social Engineering At-
tack Common Attacks used
in Penetration Testing
Defending Against Social Flipped Learning To study about Wire-
Week 5
Engineering Attacks. Phys- less Hacking
ical Penetration Attacks:
Why A Physical Penetra-
tion is important
Week 6 Insider Attacks: Why Sim- Case Study based To implement Sniffing
ulating an Insider Attack Learning and their tools
is Important Conducting an
Insider Attack Defending
against Insider Attack.
Understanding and Detect- Explicit Teaching To learn about basics
Week 7
ing Content-Type Attacks: of Kali linux
How do Content-Type At-
tacks work? - Which
File Formats are Being Ex-
ploited Today? - Tools to
Detect Malicious PDF Files

75
 Week 8 Tools to test your Protec- Problem solving To implement Wi-Fi
tions against Content-Type penetration testing
Attacks How to protect
your Environment from
Content-Type Attacks.
Web Application Security
Vulnerabilities: Overview
of Top Web Application
Security Vulnerabilities
Week 9 SQL Injection Vulnerabil- Direct instruc- To learn about Net-
ities Cross-Site Scripting tion(PPT) work Hacking – Pas-
Vulnerabilities. VoIP At- sive Hacking
tacks
Week 10 Passive Analysis: Ethical Flipped Learning To implement Man in
Reverse Engineering Why the Middle attack
Bother with Reverse Engi-
neering? Source Code Anal-
ysis. Advanced Reverse En-
gineering
Week 11 Overview of Software Devel- Case Study based To check links on Web
opment Process Instrumen- Learning sites and sustaining
tation Tools their efficiency
Week 12 Fuzzing Instrumented Direct instruc- To perform auto-
Fuzzying Tools and Tech- tion(PPT) mated computer
niques. Finding New encryption
Browser Based Vulner-
abilities. Mitigation
Alternatives
Week 13 Collecting Malware and Ini- Direct instruc- To restrict the re-
tial Analysis: Malware Lat- tion(PPT) sources for an applica-
est Trends in Honeynet tion
Technology Catching Mal-
ware Initial Analysis of Mal-
ware.
Week 14 Hacking Malware: Trends Interactive in- To monitor network
in Malware De-Obfuscating struction(PPT) and capturing data
Malware Reverse Engineer- traffic
ing Malware.
Week 15 How to hack Wi-Fi?, Web- Direct instruc- To implement a code
server,Website. tion(PPT) to simulate buffer
overflow attack.

EXPERIMENTS:
1. To learn about hacking tools and skills.

76
 2. To implement Footprinting and Reconnaissance.

3. To study about Fingerprinting

4. To implement system Hacking.

5. To study about Wireless Hacking.

6. To implement Sniffing their tools.

7. To learn about basics of Kali linux

8. To implement Wi-Fi penetration testing.

9. To learn about Network Hacking – Passive Hacking

10. To implement Man in the Middle attack

11. To check links on Web sites and sustaining their efficiency

12. To perform automated computer encryption

13. To monitor network and capturing data traffic.

14. To restrict the resources for an application

15. To implement a code to simulate buffer overflow attack.

TEXT BOOK(S):
1. The Hacker Playbook 2: Practical Guide to Penetration Testing, Kindle Edition,
Peter Kim, 2014

REFERENCES:
1. Allen Harper, Shon Harris, Jonathan Ness, Chris Eagle, Gideon Lenkey, Terron
Williams, Gray Hat Hacking The Ethical Hackers Handbook, 3rd Edition, 2011

2. Sharma Pankaj, Hacking, APH Publishing, 2005. Rajat Khare, Network Security
and Ethical Hacking, Luniver Press, 2006.

77
 3 PROGRAM CORE

3.1 212CSE1101: IT INFRASTRUCTURE LANDSCAPE

OVERVIEW

212CSE1101 IT Infrastructure Landscape L T P X C

Overview
4 0 0 0 3
Pre-requisite :NIL
Course Category :Program Core
Course Type :Theory

COURSE OBJECTIVES:
• To understand the concepts of IT infrastructure and its components.

• To learn the importance of information assurance and security in the selection,

creation, integration and administration of an IT infrastructure.

• To develop conceptual understanding of database management systems.

• To provide a transition from working on a single computer to an entire fleet.

COURSE OUTCOMES:
CO1: Apply skills on server, directory structure and virtualization techniques for com-
puting practice.

CO2: Inspect on the current storage technologies.

CO3: Interpret the different networking technologies and threats.

CO4: Interpret on the IT management technologies and analyse the database concepts.

CO5: Analyse on different applications of middleware services.

MAPPING OF COURSE OUTCOMES WITH PO, PSO:

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

78
UNIT I: Systems Directory Services Overview
Basics, functions - Examples, Virtualization, Hypervisor, Server Deployment, Server
Availability Concepts And Techniques, partitioning, Server Workload. Directory Con-
cepts, LDAP PROTOCOL, Overview of LDAP, LDAP Architecture, LDAP Models,
LDAP Replication Topologies, LDAP Data Interchange Format (LDIF).

UNIT II: Storage Overview

Storage Networking Technology, Types Of Storage System, FC-AL (Fibre Channel Arbi-
trated Loop), Fabric, Storage Area Network, Zoning, Storage Virtualization - Backups,
Archive, Bare Machine Recovery (BMR) , Retention.

UNIT III: Network Security and Overview

Network Overview, Network Topologies, Tree Topology, Firewalls, Hub, Bridge, Switch-
ing Concepts, What Is Routing? , Virtual Lan’s, Security Basics, Loss Of Privacy, Loss
Of Integrity, Security Technology, Secure Messaging, Data Security, Network Security.

UNIT IV: Database Overview

Understanding Database types, Database Terminology, Characteristics, Introduction To
Database Management Systems, Types Of Database Management Systems, Database Se-
curity And Recovery, Data Mining, Data Warehousing, And Data Marts, Data Mining
(DM), Data Warehousing and Data Marts, SQL Overview , Introduction to SQL, His-
tory of SQL, Relational database schema, manipulation with SQL - Selecting, Ordering,
Inserting data, Deleting data, Updating data, JDBC and ODBC concepts.

UNIT V: Application and Middleware Overview

Introduction To Common Messaging System (MQ SERIES), Middleware, Message Ori-
ented Middleware, Synchronous interaction, Asynchronous interaction, IBM Websphere
MQ, Websphere MQ Objects, Web Tier Deployment, Application Servers And Clustered
Deployment, Lotus Architecture, Lotus Domino Server Types, Lotus DATA WARE-
HOUSING, Warehouse Modeling Approaches , Basic Concepts, Dimension, Basic OLAP
Operations.

15 WEEK COURSE PLAN

Week Lecture (4 hours) Pedagogy

Server Technology basics, Explicit Teaching
Week 1 need
Rack, Tower and Blade Explicit Teaching
Server
Operating System - Basics, Explicit Teaching
functions - Examples
Server concepts Tutorial

79
Week Virtualization, Hypervisor - Explicit Teaching/ Demon-
2 types, implementation stration
Server Deployment Explicit Teaching
Server Availability Con- Explicit Teaching
cepts and Techniques
Partitioning, Practice Ses- Demonstration
sion - Disk Partitioning
Week Server Workload, Directory Explicit Teaching
3 Concepts
LDAP PROTOCOL, Explicit Teaching
Overview of LDAP, LDAP
Architecture
LDAP Models Explicit Teaching
LDAP Replication Topolo- Demonstration
gies
Week LDAP Data Interchange Explicit Teaching
4 Format (LDIF)
Storage Networking Tech- Explicit Teaching
nology
Types Of Storage System Explicit Teaching
Week FC-AL (Fibre Channel Ar- Explicit Teaching
5 bitrated Loop)
Fabric Explicit Teaching
Storage Area Network Explicit Teaching
Practice Session - Disk Demonstration
Management
Week Zoning Explicit Teaching/ Demon-
6 stration
Storage virtualization Explicit Teaching, Problem
Solving
Backups, Archive, Bare Ma- Explicit Teaching
chine Recovery (BMR) , Re-
tention
Tutorial - Virtualization Tutorial, Problem Solving
Week Network Overview, Charac- Explicit Teaching/ Demon-
7 teristics stration
Network Topologies Explicit Teaching
Firewalls Explicit Teaching
Week Switching Concepts, Hub, Explicit Teaching/ Demon-
8 Bridge , Routing stration
Virtual Lan’s Explicit Teaching
Security Basics Explicit Teaching
Loss Of Privacy, Loss Of In- Explicit Teaching
tegrity
Week Security Technology, Active Flipped Learning
9 Audit

80
 Secure Messaging, Data Se- Explicit Teaching
curity
Network Security Explicit Teaching
Cryptography, public key Tutorial
and private key
Week Understanding Database Explicit Teaching/ Demon-
10 types, Database Terminol- stration
ogy
Types of Database Manage- Explicit Teaching
ment Systems, Advantages
of Using the DBMS Ap-
proach
Database Security And Re- Explicit Teaching
covery
Week Data Mining, Data Ware- Explicit Teaching/ Demon-
11 housing, And Data Marts stration
SQL Overview , Introduc- Explicit Teaching
tion to SQL, History of
SQL, Relational database
schema a schema
Data Types, Dates and Demonstration
Times
Creating a table, Default Demonstration
Values, NULL values
Week Constraints, Referential in- Explicit Teaching/ Demon-
12 tegrity stration
Creating a view, Creat- Explicit Teaching/ Demon-
ing other database objects, stration
Modifying database objects,
Renaming database objects
Data manipulation with Explicit Teaching/ Demon-
SQL - Selecting, Ordering, stration
Inserting data, Deleting
data, Updating data
SQL queries Practical
Week JDBC and ODBC concepts Explicit Teaching/ Demon-
13 stration
Introduction To Common Explicit Teaching/ Demon-
Messaging System (MQ SE- stration
RIES), Middleware concept
Data Warehousing, Ware- Explicit Teaching
house Modeling Approaches
Global data Warehouse Ar- Explicit Teaching
chitecture
Week Middleware, Message Ori- Explicit Teaching/ Demon-
14 ented Middleware stration
Synchronous interaction, Explicit Teaching
Asynchronous interaction

81
 Web tier Deployment, Explicit Teaching
OLAP operations
Middleware technologies Tutorial
Week IBM Websphere MQ, Web- Explicit Teaching/ Demon-
15 sphere MQ Objects stration
Application servers and Explicit Teaching
clustered deployment
Lotus Architecture, Lotus Demonstration
Domino Server Types, DB2
access views
IBM Websphere MQ Tutorial

TEXT BOOK(S):
1. IT Infrastructure Landscape Overview (IBM ICE Publication).

2. Gupta, “IT Infrastructure its Management”, First Edition, Tata McGraw-Hill

Education.

REFERENCES:
1. R Elmasri and S Navathe, 2012, “Fundamentals of Database Systems”, Seventh
Edition, Pearson Education.

2. Gilbert Held, 2000, “Server Management (Best Practices Book 9)”, 1st Edition,
Auerbach Publications.

3. Sangam Racherla, Vikas Bajaj, Emile Knebel, 2010, “IBM Information Infrastruc-
ture Solutions”, IBM Redbook publisher, International Technical support Organi-
zation.

82
 3.2 212CSE2301: DATA STRUCTURES

212CSE2301 DATA STRUCTURES L T P X C

2 0 2 3 4
Pre-requisite :NIL
Course Category :Program Core
Course Type :Integrated Course - Theory

COURSE OBJECTIVES:
• Identify the systematic way of solving the problems searching techniques

• Understand and evaluate Abstract Data Types and linear data structures

• Design non-linear data structures such as trees and graphs

• Understand the efficiency of various sorting and hashing techniques

• Apply data structure concepts to various examples and real life applications

COURSE OUTCOMES:
CO1: Understand the role of algorithms and programming constructs as a systematic and
efficient way of solving problems searching techniques

CO2: Create Abstract Data Types for linear data structures and implement the same.

CO3: Design and implement non-linear data structures such as tree

CO4: Interpret and analyze efficiency of various sorting techniques and hashing

CO5: Design data structures and develop code for real life problems using graphs

MAPPING OF COURSE OUTCOMES WITH PO, PSO:

PO’S PSO’S
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 S S S
CO2 S S S
CO3 S S M L M S M
CO4 S S M L M S M
CO5 S S M L S

83
UNIT I: INTRODUCTION
Basic Terminologies: Elementary Data Organizations, Data Structure, Operations: in-
sertion, deletion, traversal etc.; Analysis of an Algorithm, Asymptotic Notations, Time-
Space trade off. Searching: Linear Search and Binary Search Techniques, and their
complexity analysis.

UNIT II LINKED LISTS, STACKS AND QUEUES

Singly linked lists: Representation in memory, Algorithms of several operations: Travers-
ing, Searching, Insertion into, Deletion from linked list; Linked representation of Stack
and Queue, Header nodes, Doubly linked list: operations on it and algorithmic analy-
sis; Circular Linked Lists: all operations their algorithms and the complexity analysis.
ADT Stack and its operations: Algorithms and their complexity, analysis, Applications
of Stacks: Expression Conversion and evaluation – corresponding algorithms and com-
plexity analysis. ADT queue, Types of Queue: Simple Queue, Circular Queue, Priority
Queue; Operations on each types of Queues: Algorithms and their analysis.

UNIT III TREES

Trees: Basic Tree Terminologies, Different types of Trees: Binary Tree, Threaded Bi-
nary Tree, Binary Search Tree, AVL Tree; Tree operations on each of the trees and
their algorithms with complexity analysis. Applications of Binary Trees. B Tree, B+
Tree:definitions, algorithms and analysis.

UNIT IV – SORTING AND HASHING

Objective and properties of different sorting algorithms, Selection Sort, Bubble Sort, In-
sertion Sort, Quick Sort, Merge Sort, Heap Sort ,Performance and Comparison among
all the methods, Hashing

UNIT V - GRAPHS
Basic Terminologies and Representations Traversal algorithms: Depth First Search (DFS)
and Breadth First Search (BFS)- Shortest path algorithms –Floyds, Warshall, Transitive
closure, Minimum Spanning Tree, Prims, Kruskals, Topological sorting

X Component
• Student will reach a minimum of 5000 -10000 points in Hackerrank coding website

• Completion of course in Coursera “Advanced Data structures ”

• Programming Assignments with the problems from ProjectEuler and Hackerrank

84
15 WEEK COURSE PLAN

Week Lecture (1 hours) Pedagogy Practical (2 hours) X Component (3 hours)

Basic Terminolo- Explicit Problem scenario in Courseera on data struc-
Week 1 gies: Elementary Teaching structures, arrays tures using C++ /DS
Data Organiza- and pointers using python
tions, Data Struc-
ture operations :
insertion, deletion,
traversal,Analysis
of an Algorithm
Week 2 Asymptotic Nota- Explicit Problem scenario in Analysis of Problems in
tions, Time-Space Teaching searching terms of time and Space
trade off,Searching: (GATE)
Linear, Binary
Search Techniques,
and their complex-
ity analysis.
Week 3 ADT Stack and Explicit Problem scenario in Assignment Submission
its operations, Teaching Stack and its appli- problem using LIFO and
Applications - cation using arrays FIFO
Expression Con-
version and evalu-
ation, Complexity
Analysis
Week 4 ADT queue, Types Explicit Problem scenario in Roller-Coaster ride us-
of Queue: Simple, Teaching Queue and types of ing Queue ADT
Circular,Priority queue using arrays
Queues : Opera-
tions on each types
of Queues, Com-
plexity Analysis
,
Week 5 Singly linked Explicit Problem scenario in Merging L1and L2
lists: Represen- Teaching linked list opera- without duplicate data
tation and oper- tions in the list, Hackerrank
ations:Traversing, Challenges- I
Searching, Inser-
tion into, Deletion
from linked list

85
Week 6 Linked represen- Explicit Problem scenario in Implementation of Muti-
tation of Stack Teaching Stack and queue player board game using
and Queue, Header using Linked list linked list concepts in C/
nodes, Doubly and pointers python language, Hack-
linked list: op- errank Challenges- II
erations on it
and algorithmic
analysis,Circular
Linked Lists: all
operations their
algorithms and
the complexity
analysis.
Week 7 Basic Tree Termi- Explicit Problem scenario in Develop an application
nologies, Different Teaching Binary search ma- program for executing
types of Trees: Bi- nipulation all the tree traversal
nary Tree, Binary with interactive output
Search Tree
Week 8 Applications of BT, Explicit Problem scenario in Tree Terminology and
BST, Threaded Bi- Teaching Binary search Tree its operations( GATE)
nary Trees and its manipulation
insertion and dele-
tion
Week 9 Height Balanced Explicit Problem scenario in Indian Railway ticketing
Trees : AVL Tree Teaching AVL operations system using Red -Black
and its Rotations trees
Week 10 B Tree, B+ Explicit Problem scenario in To implement an appli-
Tree:definitions, Teaching B+ tree operations cations for Auto correc-
algorithms and tors and spell checker us-
analysis ing all tree concepts
Week 11 Objective and Explicit Problem scenario in Apply all sorting tech-
properties of dif- Teaching internal sorting niques for sorting a
ferent sorting large data set From
algorithms, Selec- your observation and
tion Sort, Bubble analysis,determine the
Sort,Insertion Sort, best sorting technique
Quick Sort, Merge for working with large
Sort numbers
Week 12 Heap Sort, Perfor- Explicit Problem scenario in Secure Hashing Algo-
mance and Com- Teaching External sorting rithm SHA-512
parison of sorting
methods, Hashing.

86
Week 13 Graph -Basic Ter- Explicit Problem scenario in Implementation of
minologies and Teaching Graph application Google Page Rank Al-
Representations, and traversal gorithm , Search engine
Traversal algo- crawlers - web page
rithms: Depth indexing and searching
First Search, using graph traversal
(DFS) and Breadth
First Search (BFS)
Week 14 Shortest path algo- Explicit Problem scenario in Floyds Warshall algo-
rithms –Dijkstra Teaching Shortest path rithm for Shortest Path
Week 15 Minimum Span- Explicit Problem scenario in Bellman Ford algorithm
ning Tree Algo- Teaching MST Algorithms
rithms -Prim’s,
Kruskal’s Algo-
rithm, Topological
sorting

EXPERIMENTS:
1. Programs using structures, arrays, pointers to structures and passing them as pa-
rameters to functions.
2. Programs for various types of recursion searching
3. Program for linked list and its operations.
4. Program for array implementation of stack and queue
5. Program for various applications of stack.
6. Program for linked list implementation of stack and queue.
7. Program for binary search tree and its operations
8. Program for various simple sorting techniques: Selection Sort b) Bubble Sort c)
Insertion Sort
9. Program for various advanced sorting techniques : a) quick sort b) Merge sort c)
Heap sort
10. Program for Dijikstra’s shortest path algorithms in graphs
11. Program for finding minimum spanning tree in graphs using Kruskal’s and Prim’s
algorithms
12. Secure Hashing Algorithm SHA-512
13. Bellman Ford algorithm
14. RED black and Splay tree

87
TEXT BOOK(S):
1. Fundamentals of Data Structures”, Third Edition by Ellis Horowitz, Sartaj Sahni,
Computer Science Press,2010

2. Fundamental Data Structures and Algorithm ,P.Deepalakshmi, Shasi Anand Srid-

haran ,First Edition, Pearson Education,2019

REFERENCES:
1. Algorithms, Data Structures, and Problem Solving with C++”, Third Edition by
Mark Allen Weiss, Addison-Wesley Publishing Company ,2011 How to Solve it by
Computer”, 2nd Impression by R. G. Dromey, Pearson press,2010

2. Charles Dierbach, Introduction to Computer Science using Python: a computa-

tional problem-solving focus, Wiley Publishers,2013

88
 3.3 212CSE2302: DIGITAL PRINCIPLES AND SYSTEM DE-
SIGN

212CSE2302 Digital Principles and System Design L T P X C

2 1 2 0 4
Pre-requisite :NIL
Course Category :Program Core
Course Type :Integrated Course - Theory

COURSE OBJECTIVES:
• On completion of the course delegates will be able to:

• To acquire the basic knowledge of digital logic levels and application of knowledge
to understand digital electronics circuits.

• To identify commonly used integrated circuit families used in digital equipment.

• To prepare students to perform the analysis and design of various digital electronic
circuits.

• To Troubleshoot digital circuits using standard test equipment.

COURSE OUTCOMES:
CO1: Demonstrate the simplification of Boolean expressions using Boolean algebra & K-
Map method.

CO2: Design combinational digital circuits to meet a given specification and to represent
logic functions in multiple forms.

CO3: Illustrate the concept of sequential circuits with its characteristic equation and ex-
citation Table.

CO4: Demonstrate the working of logic families with its characteristics.

CO5: Analyse the role of memory in computer and the different types of memory.

CO6: Identify combinatorial logic circuits and sequential logic circuits, and explain their
operation.

CO7: Analyse the performance digital circuits using specialized instruments.

89
MAPPING OF COURSE OUTCOMES WITH PO, PSO:
PO’S PSO’S
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 M
CO2 M
CO3 M
CO4 M M M
CO5 S M M
CO6 S M M
CO7 S M M

UNIT I: Number Systems and Boolean Algebra

Base Conversions, Signed numbers, Fixed and Floating-point Numbers, Basic Arithmetic
Operations, Alphanumeric Codes, Boolean algebra and Switching Functions, Karnaugh
map Minimization and Quine-McCluskey method of minimization.

UNIT II: Combinational Logic

Analysis and Synthesis Procedure, Design of Adder and Substractor, Binary Parallel
Adder, Carry look ahead Adder, Magnitude Comparator, Data Selector and Data Dis-
tributor, Code Converters, Parity Bit Generators and Checkers.

UNIT III: Sequential Logic

Latches, Pulse and Edge-Triggered Flip-Flops, Applications of Flip-flops, State Machine,
State Diagram, Characteristic Equation and Excitation Table, Shift Registers, Universal
Shift Register, Design of Counters, Counter Applications

UNIT IV: Logic Families

Logic Families and Characteristics, RTL, DTL, TTL, IIL, MOS, CMOS, BiCMOS Logic,
TTL to CMOS interface, CMOS to TTL interface, IEEE/ANSI representation of Logic
families

UNIT V: Memories
Role of Memory in a computer, Random Access Memory, Memory Expansion, Introduc-
tion to Programmable Logic Devices, Read-Only Memory, Programmable Logic Arrays
(PLA), Programmable Array Logic (PAL)

15 WEEK COURSE PLAN

Weeks Lecture (2 Hours) Pedagogy Practical (2 Hours)

Alphanumeric Codes,
Learning through Implementation of
Week 2 Boolean algebra
teaching (PPT) Logic Gates
and Switching Functions

90
Weeks Lecture (2 Hours) Pedagogy Practical (2 Hours)
Karnaugh map Minimization
Week 3 and Quine-McCluskey Flipped classroom Design of Adder
method of minimization.
Analysis and Synthesis
Procedure, Design of Adder
Learning through
Week 4 and Substractor, Binary Design of Substractor
teaching (PPT)
Parallel Adder,
Carry look ahead Adder
Magnitude Comparator,
Problem Based Design of Binary
Week 5 Data Selector and
learning Parallel Adder
Data Distributor
Code Converters, Parity
Learning through Design of Carry Look
Week 6 Bit Generators and
teaching (PPT) Ahead Adder
Checkers
Latches, Pulse and
Edge-Triggered Flip-Flops,
Applications of Flip-flops, Learning through Design of Magnitude
Week 7
State Machine, teaching (PPT) Comparator
State Diagram, Characteristic
Equation and Excitation Table
Shift Registers, Universal Learning through
Week 8 Design of Data Selector
Shift Register teaching (PPT)
Design of Counters, Counter Problem Based Design of Data
Week 9
Applications learning Distributor
Logic Families and
Learning through Design of Parity
Week 10 Characteristics,
teaching (PPT) Generators
RTL, DTL, TTL, IIL
MOS, CMOS, BiCMOS Design of Parity
Week 11 Flipped classroom
Logic Checkers
TTL to CMOS interface,
CMOS to TTL interface, Learning through Design of Code
Week 12
IEEE/ANSI representation teaching (PPT) Converter
of Logic families
Role of Memory in a
computer,
Week 13 Flipped classroom Design of Flip-Flop
Random Access Memory,
Memory Expansion
Introduction to Programmable
Learning through
Week 14 Logic Devices, Study of Shift Registers
teaching (PPT)
Read-Only Memory
Programmable Logic Arrays
(PLA), Problem Based
Week 15 Study of Counters
Programmable Array Logic learning
(PAL)

91
EXPERIMENTS:
1. Introduction to the Laboratory Equipment and their usage.

2. Implementation of Logic Gates

3. Design of Adder

4. Design of Substractor

5. Design of Binary Parallel Adder

6. Design of Carry Look Ahead Adder

7. Design of Magnitude Comparator

8. Design of Data Selector

9. Design of Data Distributor

10. Design of Parity Generators

11. Design of Parity Checkers

12. Design of Code Converter

13. Design of Flip-Flop

14. Study of Shift Registers

15. Study of Counters

TEXT BOOK(S):
1. S. Salivahanan, S. Arivazhagan, “Digital Circuits and Design”, Oxford University
Press, India, 2018(5th Edition), ISBN: 978019948868

2. Anand Kumar A., “Fundamentals of Digital Circuits”, PHI, 2016 (4th Edition),
ISBN: 9788120352681

92
REFERENCES:
1. Donald P Leach, Albert Paul Malvino and Goutam Saha, “Digital Principles and
Applications. ”, McGraw Hill, 2014(8th Edition, SIE), ISBN: 9789339203405

2. M. Rafiquzzaman, “Fundamentals of Digital Logic and Microcomputer Design”,

Wiley, 2005(5th Edition), ISBN: 9788126522590

3. Morris M. Mano, “Digital Logic and Computer Design, Pearson Education”, 2016,
ISBN:9789332542525

4. A. Saha, N. Manna, “Digital Principles and Logic Design: Fundamentals and Mod-
ern applications”, Jones and Bartlett Publishers, 2010, ISBN: 9780763773731

5. Thomas L. Floyd, “Digital Fundamentals”, Pearson Education, 2011(10th Edition),

ISBN:9788131734483

93
 3.4 212CSE2403: JAVA PROGRAMMING

212CSE2403 JAVA PROGRAMMING L T P X C

1 0 6 0 4
Pre-requisite :NIL
Course Category :Program Core
Course Type :Integrated Course - Practical

COURSE OBJECTIVES:
• To understand Object Oriented Programming concepts and characteristics of Java

• To know the principles of packages, inheritance, exceptions and interfaces.

• To develop a java application with threads and generics classes

• To design and build simple Graphical User Interfaces

• To build applications using java programming for real-world applications.

COURSE OUTCOMES:
CO1: Understand the object oriented programming concepts

CO2: Apply the fundamental programming concepts of Java to develop stand alone ap-
plications.

CO3: Solve real world problems using reusable and error free code.

CO4: Design and Develop distributed applications

CO5: Implement window based applications using event handling mechanisms.

CO6: Communicate effectively with the technical community.

CO7: Work effectively independently or as a member of a team for a multi-disciplinary

environments.

MAPPING OF COURSE OUTCOMES WITH PO, PSO:

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

94
UNIT I: OOP IN JAVA & INHERITANCE
Object Oriented Programming Concepts - OOP in Java – Characteristics of Java –Fun-
damental Programming Structures in Java – Defining classes in Java – Comments, Data
Types, Variables, Operators, Control Flow, Arrays - constructors, methods -access spec-
ifiers - static members – Packages- Inheritance – Super classes- sub classes –Protected
members – constructors in sub classes- Strings.

UNIT II: EXCEPTION HANDLING AND I/O

Exceptions - exception hierarchy - throwing and catching exceptions – built-in exceptions,
creating own exceptions, Stack Trace Elements-Input / Output Basics – Streams – Byte
streams and Character streams – Reading and Writing Console – Reading and Writing
Files - abstract classes and methods - final methods and classes

UNIT III: INTERFACES AND MULTITHREADING

Interfaces – defining an interface, implementing interface, differences between classes and
interfaces - extending interfaces - Object cloning -inner classes-Differences between multi-
threading and multitasking, thread life cycle, creating threads, synchronizing threads,
Inter-thread communication, daemon threads - Generic Programming.

UNIT IV: AWT AND EVENT DRIVEN PROGRAMMING

AWT Event Hierarchy- Components - Graphics programming – Applets-Frame –working
with 2D shapes - Using color, fonts, and images - Basics of event handling - event handlers
- adapter classes - actions - mouse events - Introduction to Swing – layout management
- Swing Components – Windows –Menus – Dialog Boxes.

UNIT V: NETWORKING AND JDBC

Networking Basics - The Networking Classes and Interfaces - TCP/IP Client Sockets-
URL - TCP/IP Server Sockets - Datagrams - A Relational Database Overview - JDBC
Introduction - JDBC Product Components - JDBC Architecture - Case studies.

15 WEEK COURSE PLAN

Week Lecture (1 hour) Pedagogy Practical (6 hours)

Object Oriented Pro- Explicit Teaching Familiarise with JVM, Java
Week 1 gramming Concepts - Programming Structure
OOP in Java – Charac-
teristics of Java
Fundamental Program- Demonstration Hands-on-session for simple
ming Structures in Java class
– Defining classes in Java
– Comments

95
 Data Types, Variables, PPT Hands-on-session for data
Operators, Control Flow types, relational operators,
for, while and do..while
loops
Arrays - Strings Demonstration Hands-on-session for 1D, 2D
Week 2 arrays, methods in String
class
Constructors, Methods - PPT Hands-on-session for
Access specifiers default, parameterized con-
structors, private, public,
static data members.
Static members – Pack- Demonstration Hands-on-session for Pack-
ages age creation.
Inheritance – Super PPT Hands-on session for single,
Week 3 Classes - Sub Classes multilevel, hierarchical in-
heritance
Protected members Demonstration Hands-on-session for pro-
tected members and super
method to call base class
constructor in sub classes
Constructors in Sub Demonstration Selection of Mini Project
classes Title
Exceptions - Exception PPT Hands-on-session for built-
Week 4
hierarchy - Throwing and in Exception classes
catching exceptions
Built-in exceptions, Cre- Demonstration Hands-on-session for user
ating own exceptions, defined exception
Stack Trace Elements.
Input / Output Basics – PPT Hands-on-session for File
Week 5
Streams – Byte streams I/O, Console I/O
and Character streams
Reading and Writing Demonstration Presentation of Mini
Console – Reading and Project titles
Writing Files
Abstract classes PPT Hands-on-session for dy-
Week 6
namic polymorphism
Abstract Methods PPT Presentation of Modules in
Mini Project
Interfaces – Defining an PPT Hands-on-session for Multi-
Week 7 interface, Implementing ple inheritance
interface
Differences between PPT Hands-on-session for inter-
Classes and Interfaces - face inheritance
Extending interfaces
Inner classes Demonstration Hands-on-session for Inner
Class

96
Week 8 Differences between PPT Hands-on-session fo single
multi-threading and and multiple threads, Inter
multitasking, Thread thread communication
life cycle, Creating
threads, Synchronizing
threads, Inter-thread
communication, daemon
threads
Generic Class Demonstration Hands-on-session for
Week 9
Generic method an Generic
Class implementation
Generic Method Demonstration Presentation of Modules in
Mini Project
AWT Event Hierarchy - Demonstration Hands-on-session for
Week 10
Components - Graphics Frames window creation,
programming - Frame – Drawing Lines, circles,
Working with 2D shapes ellipse using awt package
Using Color, fonts, and Demonstration Hands-on-session for Col-
Images ors, Fonts and Images
Week 11 Introduction to Swing Demonstration Hands-on-session forLayout
– layout management management using Swing
- Swing Components – Components
Windows
Basics of event handling - Demonstration Hands-on-session for event
Week 12
Event handlers - Adapter handling using mouse, ac-
classes tion, menu and dialog cre-
ation
Action Event - Mouse Demonstration Mini Project Demonstra-
events – Menus – Dialog tion
Boxes
Networking Basics - The Demonstration Mini Project Report and
Week 10
Networking Classes and PPT Submission
Interfaces
TCP/IP Client Sockets- PPT Hands-on-session for client
URL - TCP/IP Server server programs using
Sockets - Datagrams TCP/IP, UDP
Week 14 A Relational Database Demonstration Hands-on-session for JDBC
Overview - JDBC Intro- Connectivity and Mini
duction - JDBC Product Project Viva Voce
Components - JDBC Ar-
chitecture
Week 15 Java Frameworks - Demonstration Mini Project Viva Voce
Spring Boot

97
EXPERIMENTS:
1. Basic Java Programs

2. Programs using Objects and Classes

3. Programs using Inheritance

4. Programs using Interfaces

5. Programs using Array List and String

6. Programs using Exception Handling

7. Programs using Reading and Writing Files

8. Programs using Multithreading

9. Programs using Generic Programming

10. Programs using Event Handling, Swing and AWT

11. Programs using TCP/IP and UDP sockets

12. Programs using JDBC

TEXT BOOK(S):
1. Java - The Complete Reference, Herbert Schildt, Tata McGraw-Hill, Eighth Edition,
2011.

2. Core Java: Volume I – Fundamentals Cay S. Horstmann and Gary Cornell, Nineth
Edition, Sun Microsystems Press, 2013.

REFERENCES:
1. Java SE 8 for Programmers Paul Deitel, Harvey Deitel / Pearson / 3rd Edion /
2015

2. Understanding Object-oriented programming with Java Timothy Budd / Pearson

Education / 2000

3. The Java Programming Language-A primer Ken Arnold, James Gosling, David
Holmes, , Fourth Edition, Prentice Hall

98
 3.5 212CSE2303: SOFTWARE ENGINEERING

212CSE2303 SOFTWARE ENGINEERING L T P X C

2 0 2 0 3
Pre-requisite :NIL
Course Category :Program Core
Course Type :Integrated Course - Theory

COURSE OBJECTIVES:
The course provides knowledge in introducing the concepts and terms used in the
object-oriented approach to systems analysis and design. This course highlights
the importance of object-oriented analysis and design and its limitations. The
course shows how to apply the process of object-oriented analysis and design to
software development. It points out the importance and function of each UML
model throughout the process of object-oriented analysis and design and explains
the notation of various elements in these models. It provides students with the
necessary knowledge and skills in using object-oriented CASE tools.

COURSE OUTCOMES:
CO1: Create a list of use cases, classes, objects out of the given problem summary.

CO2: Develop the steps in each phase of the software development model.

CO3: Apply the given UML tool on identified models.

CO4: Verify the deliverables of the model with sample inputs.

CO5: Document the refined designs and coding.

MAPPING OF COURSE OUTCOMES WITH PO, PSO:

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

UNIT I: Software Engineering Concepts

Software and Software Engineering - Project Management Concepts - Software Engineer-
ing Paradigms Generic Process Models, Assessment and Improvement, Use Case Model:
Goals, Actors - Finding Primary Actors, Use Case types and Formats.

99
UNIT II: Elaboration Phase And Interaction Diagram
Definition of the Elaboration phase, identify system events and system operations, Cre-
ating a System Sequence Diagram, Interaction diagrams: Importance of interaction
diagrams-Sequence diagrams. Creating a collaboration diagram.

UNIT III: Design Concepts

Design Process - Design Principles - Design Concepts - Software Architecture Architec-
tural Style, Design and Mapping - User Interface Design. Class diagram, state diagram.

UNIT IV: Software Testing and Debugging

Testing Fundamentals and Strategies - White-box and Black-box testing - Basis Path
Testing - Data Flow Testing - Testing for Special Environments - Unit Testing, - Integra-
tion Testing - Validation Testing - System Testing Debugging - Software Maintenance.

UNIT V: Implementation Model

Applying patterns and assigning responsibilities, Coupling and Cohesion, Define frame-
works, Mapping designs to code-Creating class definitions from DCDs, Creating methods
from interaction diagrams UML and CASE tools.

15 WEEK COURSE PLAN

Week Lecture (2 hours) Pedagogy Practical (2 hours)

Week 1 Introduction to Software Explicit Teaching Identify project
Engineering,Project Man- scope,Identify the
agement Concepts,Software objective,Identify
Engineering Paradigms the requirements for
Generic problem.
Week 2 Process Models,Assessment Explicit Teaching Constructing the
and Improvement and Demonstra- SRS for the prob-
tion lem,Describing the
module description for
the problem,Identify
the software require-
ment analysis,
Week 3 Use Case Model,Goals, Ac- Explicit Teaching Identify the ac-
tors - Finding Primary Ac- tors,Defining the
tors, Use Case types and usecases for the ap-
Formats plication,Identify the
relationship between
use case and actor.
Week 4 Definition of the Elabora- Explicit Teaching Constructing the class
tion phase,Identify system and Demonstra- diagram ,Identify the
events and system opera- tion relationship between
tions classes

100
Week 5 Creating a System Sequence Explicit Teaching Hands-on session on
Diagram,Interaction dia- and Demon- interaction diagram
grams: Importance of inter- stration
action diagrams-Sequence
diagrams. Creating a
collaboration diagram
Week 6 Design Process, Design Explicit Teaching Creating the State
Principles and Demon- diagram,Identify the
stration relationship between
various states
Week 7 Software Architecture, Ar- Explicit Teaching Creating the Activity
chitectural Style,Design and and Demonstra- diagram
Mapping tion
Week 8 User Interface Design Explicit Teaching Identify the user in-
terface for the applica-
tion
Week 9 Class diagram, state dia- Explicit Teaching Identify the user inter-
gram and Demonstra- face for the applica-
tion tion Constructing the
various diagram for
the application
Week 10 Testing Fundamentals and Explicit Teaching Creating the various
Strategies,White-box and test cases for the prob-
Black-box testing - Basis lem
Path Testing - Data Flow
Testing
Week 11 Testing for Special Environ- Explicit Teaching Integration testing is
ments - Unit Testing, - Inte- applied
gration Testing - Validation
Testing
Week 12 System Testing Debugging - Explicit Teaching Creating class defini-
Software Maintenance and Demon- tions from DCDs
stration
Week 13 Definition of the Elabora- Explicit Teaching Constructing the class
tion phase,Identify system and Demonstra- diagram ,Identify the
events and system opera- tion relationship between
tions classes
Week 14 Coupling and Cohesion, De- Explicit Teaching Creating application
fine frameworks, Mapping and Demonstra- using CASE tools
designs to code tion
Week 15 Case Study Demon-stration Project Evaluation

EXPERIMENTS:
1. Software personnel management system

101
 2. Web-based CPU usage monitor

3. Video Conferencing

4. Pattern Recognition

5. Character Recognizer

6. Intranet Memory Usage Analyzer

7. Foreign trading system

8. Expert Systems

9. Remote Procedure Call Implementation

10. Real-Time Scheduler

TEXT BOOK(S):
1. Larman C. Applying UML and Patterns. An Introduction to Object -Oriented
Analysis and Design, Prentice-Hall, 3rd Edition, 2015.

REFERENCES:
1. Bjarne Stroustrup, The C++ Programming Language, 3rd Edition, 2010.

2. Grady Booch, James Runbaugh, Ivar Jacobson, UML User Guide, Addison Wesley,
2010.

3. Tom Pender, UML 2.0 Bible, Wiley Publishing, Inc, 2013.

102
 3.6 212CSE2101: DISCRETE MATHEMATICS

212CSE2101 Discrete Mathematics L T P X C

3 1 0 0 4
Pre-requisite : NIL
Course Category : Program Core
Course Type : Theory

COURSE OBJECTIVES:
• To specify and manipulate basic mathematical objects such as sets, functions and
relations.

• To develop logical thinking and its application to computer science.

• To analyze the recurrence relation and generating functions

• To use graphs as tools to visualize and simply real life situations.

COURSE OUTCOMES:
CO1: Analyze the operations on sets, relations and functions

CO2: Apply the concepts of tautology, normal forms and theory of inference in studying
of the design computers and electric circuits.

CO3: Create the recurrence relations and generating functions.

CO4: Apply the concepts of lattice, modular, distributive lattices and Boolean algebra in
engineering mathematical problems.

CO5: Apply the basic concepts in graph theory to computer science engineering and
information technology.

MAPPING OF COURSE OUTCOMES WITH PO, PSO:

PO’S PSO’S
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 S M M
CO2 S S S
CO3 S S M L S M
CO4 S S M L S M
CO5 S S M S

103
UNIT I: SET THEORY, RELATIONS AND FUNCTIONS
Principle of Inclusion-Exclusion – Types of Relations – Some operations of relations –
Composition of relations – Equivalence classes – Functions – one-to-one – onto –Compo-
sition of functions– Inverse of a function. (Proofs of theorems are not included)

UNIT II: LOGIC

Propositions – Connectives – Conditional and bi-conditional propositions – Tautology
and contradiction – Algebra of propositions – Tautological implication – Normal forms –
Disjunctive and conjunctive normal forms – Principal disjunctive and principal conjunc-
tive normal forms.

UNIT III: COMBINATORICS

Permutations and combinations –Recurrence relations – Particular solutions – Solutions
of recurrence relations by using generating functions.

UNIT IV: LATTICES AND BOOLEAN ALGEBRA

Lattices– Properties of Lattices – Lattices as algebraic system – Sub lattices – Boolean
algebra – Additional properties of Boolean algebra.

UNIT V: GRAPH THEORY

Basic definitions – Degree of a vertex – Some special simple graphs – Matrix representa-
tion of graphs – paths, cycles and connectivity –Eulerian and Hamiltonian graphs (Proofs
of Theorems are not included) – Connectedness in directed graphs – Trees – Spanning
trees – Prim’s algorithm –Kruskal’s algorithm. (Proofs of Theorems are not included)

15 WEEK COURSE PLAN

Course Lecture (3 Hours) Practical Pedagogy

Chart: (2Hours)
Weeks
Week 1 Principle of Inclusion- Matlab Pro- Interactive white
Exclusion grams to under- Board
stand types of
relations
Some operations of re- Matlab Pro- Demonstration with
lations grams to under- Matlab
stand types of
relations
Week 2 Compositions of Rela- Matlab pro- Interactive white
tions grams to find Board
equivalence
classes

104
 Types of Rela- Matlab pro- Demonstration with
tions,,Equivalence grams to find Matlab
classes equivalence
classes
Week 3 Functions – one-to- Matlab for func- Interactive white
one – onto tions, inverse of Board
functions
Composition of func- Matlab for func- Demonstration with
tions– Inverse of a tions, inverse of Matlab
function. functions
Week 4 Propositions – Con- Matlab for Tau- Interactive white
nectives tology and Con- Board
tradiction
Tautology and contra- Matlab for Tau- Demonstration with
diction tology and Con- Matlab
tradiction
Week 5 Algebra of proposi- Matlab for Alge- Interactive white
tions bra of Proposi- Board
tions
Conditional and Matlab for Alge- Demonstration with
bi-conditional propo- bra of Proposi- Matlab
sitions tions
Week 6 Tautological implica- Matlab for Interactive white
tions ,Normal Forms Disjunctive Board
and conjuctive
normal forms
Disjunctive and con- Matlab for Demonstration with
junctive normal forms Disjunctive Matlab
and conjuctive
normal forms
Week 7 Principal disjunctive Matlab for Interactive white
normal forms PCNF and Board
PDNF
Principal conjunctive Matlab for Demonstration with
normal forms PCNF and Matlab
PDNF
Week 8 Permutations Matlab for Per- Interactive white
mutations and Board
combinations
Combinations Matlab for Per- Demonstration with
mutations and Matlab
combinations
Week 9 Recurrence relations, Matlab for gen- Interactive white
Particular solutions erating functions Board
Solutions of recur- Matlab for gen- Demonstration with
rence relations using erating functions Matlab
generating functions

105
 Week 10 Lattices Matlab for Lat- Interactive white
tices Board
Properties of Lattices Matlab for Lat- Demonstration with
tices Matlab
Week 11 Lattices as algebraic Matlab for Lat- Interactive white
system tices as algebraic Board
system
Sub lattices Matlab for Lat- Demonstration with
tices as algebraic Matlab
system
Week 12 Boolean algebra Matlab for Interactive white
Boolean Algebra Board
Additional properties Matlab for Demonstration with
of Boolean algebra. Boolean Algebra Matlab
Week 13 Basic definitions – De- Matlab for de- Interactive white
gree of a vertex – gree of a vertex Board
Some special simple
graphs
Matrix representation Matlab for de- Demonstration with
of graphs gree of a vertex Matlab
Week 14 paths, cycles and Matlab for ver- Interactive white
connectivity – Eule- ifying Eulerian Board
rian and Hamiltonian and Hamiltonian
graphs graphs
Connectedness in di- Matlab for ver- Demonstration with
rected graphs ifying Eulerian Matlab
and Hamiltonian
graphs
Week 15 Trees – Spanning trees Matlab for Interactive white
Prim’s algo- Board
rithm and
Krushkals algo-
rithm
Prim’s algorithm – Matlab for Demonstration with
Kruskal’s algorithm. Prim’s algo- Matlab
rithm and
Krushkals algo-
rithm

TEXT BOOK(S):
1. T. Veerarajan, Discrete Mathematics with graph theory and Combinatorics, Tata
McGraw Hill Publishing Company Limited, 26th reprint 2017.

106
REFERENCES:
1. Kenneth H. Rosen, Discrete Mathematics and its Applications, Tata McGraw – Hill
Publishing Company, 1999.

2. M.K. Venkataraman, N. Sridharan, N. Chandrasekaran, Discrete Mathematics, Na-

tional Publishing Company, 2009.

107
 3.7 212CSE2304: MACHINE LEARNING

212CSE2304 Machine Learning L T P X C

2 0 2 3 4
Pre-requisite : NIL
Course Category : Program Core
Course Type : Integrated Course - Theory

COURSE OBJECTIVES:
• To introduce Machine Learning and its benefits

• To understand simple linear regression and its significance.

• To gain knowledge on multiple regression and interpret multiple linear regression

coefficients

• To introduce classification and various classification algorithms.

• To provide knowledge on clustering algorithms and various information retrieval

models.

COURSE OUTCOMES:
CO1: Understand the origin, uses, concept, types and applications of Machine Learning.

CO2: Understand the mathematics behind learning algorithms and apply simple linear
regression on datasets with performance evaluation.

CO3: Design and Evaluate Multiple Regression models on real time datasets.

CO4: Understand and Apply various classification algorithms in Machine Learning and
visualize the results.

CO5: Apply various clustering algorithms on real time datasets and analyze the efficiency
of each algorithm in different usecase scenarios.

CO6: Create real time datasets from social/ public websites using information retrieval
techniques

CO7: Create efficient machine learning models to perform analysis and prediction on real
datasets

108
MAPPING OF COURSE OUTCOMES WITH PO, PSO:
PO’S PSO’S
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 S S M S M
CO2 S S M S M
CO3 S S S S
CO4 S
CO5 S
CO6 S S M S M
CO7 S S M S M

UNIT I: Introduction to Machine Learning

Introduction, Motivation for machine learning, Applications, Machine learning, Classifi-
cation, Regression, The origin of machine learning, Timeline of machine learning tech-
niques, Uses and abuses of machine learning, How do machines learn, Abstraction and
knowledge representation, Generalization, Assessing the success of learning, Steps to ap-
ply machine learning to data, Input data and ML algorithm, Machine learning methods,
Unsupervised learning, Semi-supervised learning, Clustering, What are we looking for?
Classification of machine learning algorithms, General ML architecture, Reinforcement
learning, Supervised learning, Unsupervised learning, Semi-supervised learning, Regular-
ization algorithms, Clustering algorithms, Deep learning algorithms, Ensemble learning,
Matching data to an appropriate algorithm, Data Retrieval, Web Scrapping, Beautiful-
Soup, Sklearn, Seaborn packages in Python.

UNIT II: Simple Linear Regression

Introduction, Supervised learning, Regression, Regression examples, Regression models,
Steps in regression analysis, Linear regression, Simple linear regression, Least squares es-
timation, Least squares regression-Line of best fit, Illustration, Direct regression method,
Maximum likelihood estimation, Matrix approach, Regression assumptions and model
properties, Coefficient of determination (R-squared), Example, Testing for significance,
Testing hypothesis in simple linear regression, Illustration, Checking model adequacy,
Over-fitting, Detecting over-fit models: Cross validation, Cross validation: The ideal
procedure, Logistic regression.

UNIT III: Multiple Regression and Model Building

Introduction, Ordinary least squares estimation for multiple linear regression, Multiple
linear regression model building, Partial correlation and regression model building, Multi-
ple linear regression model, Interpretation of multiple linear regression coefficients-Partial
regression coefficients, Standardized regression coefficients, Missing data, Validation of
multiple regression model, Coefficient of multiple determination (R-Squared), Adjusted
R-squared, Statistical significance of individual variables in multiple linear regression:
Hypothesis Testing, Student’s T-Test, Chi-squared test, Comparison of hypothesis tests.

109
UNIT IV: Introduction to Classification & Classification Algo-
rithms
Preamble: Machine learning, To classify faces and expressions, Introduction, ML classi-
fier, Classification and general approach, Classification algorithms, Instance based learn-
ing, K-Nearest neighbour, Decision trees, Attribute selection measure: Information gain,
ID3 algorithm, Decision tree: weekend example, Converting a tree to rules, Bayesian
algorithms,Naı̈ve Bayes Classifier, Example, Ensemble, Stories of success, Why ensemble
works? Ensemble of classifiers, Bagging, Boosting, Random forests, Neural networks,
Activation functions, Feedforward neural network, Multi-layer perceptron, Backprop al-
gorithm, Recurrent or feedback architecture, Perceptron rule, Gradient-descent (training
examples, ç), Multilayer networks and back propagation algorithm, Support vector ma-
chine,SVM with linear kernel, polynomial kernel, RBF kernel, sigmoid kernelClassification
model evaluation and selection, ROC curves, Cost Benefit Analysis (CBA).

UNIT V: Clustering Techniques and Information Retrieval

Clustering, Clustering algorithms, More common clustering situation, Statistics asso-
ciated with cluster analysis, General applications of clustering, Clustering as a pre-
processing tool, Hard vs. soft clustering, Similarity and dissimilarity between objects,
Type of data in clustering analysis, Binary variables, Nominal variables, Ordinal variables,
Major clustering approaches, Types of clusters, Cluster centroid and distances, Hierarchi-
cal clustering, Hierarchical Agglomerative Clustering (HAC), Hierarchical Agglomerative
Clustering: Linkage method, Hierarchical Agglomerative Clustering: Variance and Cen-
troid method, Cluster distance measures, Single link agglomerative clustering, Complete-
link clustering, Average-link clustering, Other agglomerative clustering methods, Dis-
tance between two clusters, Hierarchical clustering: Time and Space requirements, K
- means clustering, Importance of choosing initial centroids, The K-medoids clustering
method, PAM (Partitioning Around Medoids), CLARA (Clustering Large Applications),
CLARANS (Randomized CLARA), Density based clustering methods, DBSCAN: Den-
sity Based Spatial Clustering of Applications with Noise, When DBSCAN Does NOT
Work Well, External criteria for clustering quality, Different aspects of cluster validation,
Measures of cluster validity, Measuring cluster validity via correlation, Using similarity
matrix for cluster validation, Internal measures: SSE, Framework for cluster validity,
Internal measures: Cohesion and Separation, Internal measures: Silhouette coefficient.
Information retrieval- introduction, Information retrieval process, Information retrieval
architecture, how do we represent document? Information retrieval models, Similarity
metric, Term weighting, Retrieval in vector space model, Constructing inverted index
(word counting), Stop words removal, Stemming, Text document clustering, Agglomera-
tive vs. divisive, Impact of cluster distance measure, Buckshot clustering, Issues related to
cosine similarity, Validity of document clusters, Text datasets, Experimental evaluation.

15 WEEK COURSE PLAN

Course Practical (2 X Component (3 hours) ”Learn

Lecture (2 hours)
Chart hours) Machine Learning using Sports”
Weeks
Topic Pedagogy Topic Pedagogy

110
 Introduction, Moti- Explicit Hands-on ses- Webscraping Demonstration
Week
vation for machine Teaching sion on Pan-
1
learning, Appli- das, Numpy
cations, Machine Packages
learning, Classifi-
cation, Regression,
The origin of
machine learning
Time line of ma- Experiential sklearn Hackathon Cooperative
chine learning Learning Package Project - Learning
techniques, Uses Problem
and abuses of Descrip-
machine learning, tion, Team
How do machines Formation
learn, Abstraction and
and knowledge Initiation
representation,
Generalization
Assessing the suc- Explicit
cess of learning, Teaching
Steps to apply
machine learning
to data, Input data
and ML algorithm,
Machine learning
methods, Unsu-
pervised learning,
Semi-supervised
learning, Cluster-
ing
Least squares Linear Comparison of
estimation, Least Regression Linear, Polynomial,
squares regression Explicit Lasso and Ridge
Week Line of best fit, Teaching Regression on Independent
2 Illustration & ESPNCricinfo ODI Study
Demonstration Polynomial Batsmen Dataset
Regression using Variance,
Determination,
Accuracy, Confusion
Matrices

111
Week Direct regression Problem Checking Logistic Independent
3 method, Maxi- Solving model Regression Study
mum likelihood adequacy, on ESPN-
estimation, Matrix Over- Cricinfo ODI
approach, Regres- fitting, Bowlers
sion assumptions Detecting Dataset
and model prop- over-fit
erties, Coefficient models:
of determina- Cross
tion (R-squared), validation,
Example Cross
Testing for signifi- Problem validation:
cance, Testing hy- Solving The ideal
pothesis in simple procedure
linear regression, Il-
lustration
Week Introduction, Ordi- Explicit Interpretation of Missing data, Independent
4 nary least squares Teaching multiple linear Validation of Study
estimation for regression multiple regres-
multiple linear re- coefficients- sion model
gression, Multiple Partial
linear regression regression
model building coefficients,
Partial correlation & Explicit Standardized Hackathon Project-
regression model Teaching regression Project - Review Based Learn-
building, Multiple linear
coefficients 1 ing
regression model
Week Estimate Hypothesis Independent
5 Coefficient of mul- Demonstration Variance, Testing: Study
tiple determination Coefficient of Student’s T
(R-Squared), Ad- Determina- Test,
justed R-squared tion and F Chi-square test
Week 6 Statistical signif- Explicit Score for real Industry Ex- Independent
icance of individ- Teaching time dataset pert Interaction Study
ual variables in for Hackathon
multiple linear Project
regression: t-Test
Week Introduction, ML Explicit K-Nearest Understanding Independent
7 classifier, Classifi- Teaching neighbour the data for Study
cation and general Classification
approach, Classifi- – ODI Players
cation Algorithms with closest
Instance Based Explicit characteristics
Learning Teaching

112
Week Decision trees, Explicit Decision tree: Decision Tree Independent
8 Attribute selection Teaching weekend exam- Learning – Study
measure: Infor- & Problem ple, Convert- What decides
mation gain, ID3 Solving ing a tree to the outcome
algorithm rules of the cricket
match
Bayesian algo- Explicit Naı̈ve Bayes Naı̈ve Bayes Independent
rithms Teaching Classifier Classifier – How Study
Bayes define the
Decider
Week 9 Ensemble, Stories Explicit Random For- Ensemble Clas- Independent
of success, Why Teaching est sifier– What Study
ensemble works? decides the
Ensemble of clas- outcome of the
sifiers, Bagging, cricket match
Boosting
Week Neural networks, Explicit Recurrent Neural Problem
10 Activation func- Teaching or Network Based
tions, Feedforward feedback Parameter Learning
neural network architecture Estimation
Multi-layer percep- Explicit on a
tron, Backprop al- Teaching structured
gorithm network
Week Perceptron rule, Explicit Classification Support Independent
11 Gradient-descent Teaching model Vector Study
(training exam- evaluation and Machines
ples), Multilayer selection, ROC – Predict
networks and curves, Cost Win, Loss,
back propagation Benefit Analysis Draw
algorithm (CBA)
Support Vector Explicit
Machine Teaching
Week Clustering, Clus- Explicit Hierarchical Hackathon Project
12 tering algorithms, Teaching Agglomerative Project Re- Based Learn-
More common clus- Clustering: view 2 and ing
tering situation, Linkage method, Research Article
Statistics associ- Hierarchical Preparation
ated with cluster Agglomerative
analysis, General Clustering:
applications of Variance and
clustering Centroid
K Means, Hier- Explicit method k Means Clus- Independent
archical cluster- Teaching tering – Cluster Study
ing, Hierarchical & Problem similar kind of
Agglomerative Solving players part 01
Clustering (HAC)

113
Week Importance of Experiential Problem k Medoid Independent
13 choosing initial Learning Identifica- Clustering – Study
centroids in K tion and Cluster similar
Means, The K- Backend kind of
medoids clustering details players part 02
method
PAM (Partitioning Explicit
Around Medoids) Teaching
Week CLARA (Cluster- Explicit DBSCAN: DBSCAN Independent
14 ing Large Applica- Teaching Density Clustering – Study
tions), CLARANS Based Spatial Cluster similar
(Randomized Clustering of kind of
CLARA) Applications players part 03
Density based clus- Experiential with Noise
tering methods, Learning
When DBSCAN
Does NOT Work
Well
Week External crite- Explicit Principal Hackathon Project
15 ria for clustering Teaching Compo- Project - Final Based Learn-
quality, Different nent Review ing
aspects of cluster Analysis –
validation, Mea- Act on
sures of cluster Handwrit-
validity, Measuring ten
cluster validity Characters
via correlation,
Using similarity
matrix for cluster
validation
Internal measures: Explicit Paper Submis- Project
SSE, Framework Teaching sion to IEEE Based Learn-
for cluster validity, Conferences ing
Internal measures:
Cohesion and Sep-
aration, Internal
measures: Silhou-
ette coefficient.

EXPERIMENTS:
1. Data Scraping – Frontend to Backend – BeautifulSoup

2. Multiple linear Regression – Model the strike rate of a batsman in ODI

3. k Nearest Neighbor – ODI Bowler with closest characteristics

114
 4. Decision Tree Learning – What decides the outcome of the cricket match

5. Naı̈ve Bayes Classifier – How Bayes define the Decider

6. k Means Clustering – Cluster similar kind of players part 01

7. k Medoid Clustering – Cluster similar kind of players part 02

8. DBSCAN Clustering – Cluster similar kind of players part 03

9. Support Vector Machines – Predict Win, Loss, Draw

10. Principal Component Analysis – Act on Handwritten Characters

11. Case Study Project

TEXT BOOK(S):
1. Machine Learning, 2019 (IBM ICE)

2. Tom Mitchell, Machine Learning, McGrawHill, 1997

REFERENCES BOOKS:
1. Andrew Ng, Machine Learning, deeplearning.ai, 2018

115
 3.8 212CSE2305: DATABASE MANAGEMENT SYSTEMS

212CSE2305 DATABASE MANAGEMENT SYS- L T P X C

TEMS
3 0 2 0 4
Pre-requisite :NIL
Course Category :Program Core
Course Type :Integrated Course - Theory

COURSE OBJECTIVES:
• To make students to understand the different issues involved in the design and
implementation of a database system.

• To make students to understand the different issues involved in the design and
implementation of a database system.

COURSE OUTCOMES:
CO1: Describe the fundamental elements of relational database management systems

CO2: Explain the basic concepts of relational data model, entity-relationship model, re-
lational database design, and SQL.

CO3: Familiar with basic database storage structures and access techniques: file and page
organizations, indexing methods including B tree, and hashing.

CO4: Execute various advance SQL queries related to Transaction Processing Locking
using concept of Concurrency control.

CO5: Understand latest trends in Database Management techniques.

CO6: Perform PL/SQL programming using concept of Cursor Management, Error Han-
dling, Package and Triggers.

CO7: Apply acquired knowledge for developing holistic solutions based on database sys-
tems/database techniques .
.

116
MAPPING OF COURSE OUTCOMES WITH PO, PSO:
PO’S PSO’S
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 S S S
CO2 S S S
CO3 S S
CO4 S S S S S S
CO5 S S S S S S
CO6 S S S S S S
CO7 S S S S S

UNIT I: INTRODUCTION
Introduction to File Systems – File systems vs Database systems- -Abstraction levels of
DBMS- Data Models-Introduction to Network andHierarchical Models -ER Model - E-R
Diagrams – Relational Model- Relational Algebra- Relational Calculus- Database System
Structure -Database Languages.

UNIT II: RELATIONAL MODEL

SQL Data Definition – Queries in SQL- Updates-Views-Keys- Integrity and Security- Sub
Queries - Correlated Sub Queries - Relational Database Design -Functional Dependences
and Normalization For Relational Databases (up to BCNF).

Record Storage and Primary File Organization - Secondary Storage Devices- Opera-
tions on Files - Heap File - Sorted Files - Hashing Techniques Index Structure for Files
Different Types of Indexes B-Tree - B+Tree Database Tuning - Query Processing.

UNIT IV: TRANSACTION MANAGEMENT

Transaction in DBMS- ACID Properties- Need for Concurrency Control - Schedule –
Serializability- Concurrency Control- Types of Locks- Two Phases locking- Deadlock-
Time Stamp based Concurrency Control Recovery Techniques Concepts - Immediate
Update - Deferred Update - Shadow Paging.

UNIT V: CURRENT TRENDS

Object Oriented Databases- OO Data models- Distributed Databases- Homogenous and
Heterogeneous – Distributed data storage – Multimedia Databases- XML Structure-XML
Document Schema- Data mining- Data Warehouse- Database Security- Database Appli-
cation Security Models.

15 WEEK COURSE PLAN

Week Lecture (3 hours) Pedagogy Practical (2 hours)

117
 Introduction to File Sys- Power point Introduction to SQL,
Week 1 tems presentation Database Languages
File systems vs Database Power point Introduction to SQL,
systems presentation Database Languages
Abstraction levels of DBMS Power point Introduction to SQL,
presentation Database Languages
Data Models Flipped Commands related to Data
Week 2 videos Definition Language
Network and Hierarchical Flipped Commands related to Data
Models videos Definition Language

Network and Hierarchical Flipped Commands related to Data

ER Model and E-R Dia- videos Definition Language
grams
Relational Model Power point Commands related to Data
Week 3 presentation Manipulation Languages
Relational Algebra and Re- Power point Commands related to Data
lational Calculus presentation Manipulation Languages
Database System Structure Power point Commands related to Data
presentation Manipulation Languages
Database Languages Power point Commands Related to
Week 4
presenta- Transaction Control Lan-
tion, Flipped guages
videos, Demo:
Implement
DDL,DCL,
TCL com-
mands
SQL Data Definition , Power point Commands Related to
Queries in SQL presenta- Transaction Control Lan-
tion, Flipped guages
videos, Demo:
Implement
DDL,DCL,
TCL com-
mands
Updates-Views-Keys, In- Collaborative Built-in Functions and
Week 5
tegrity and Security Teaching Aggregate Functions in
– Seminar RDBMS
Self-Study
Topic
Sub Queries - Correlated Collaborative Built-in Functions and
Sub Queries Teaching Aggregate Functions in
– Seminar RDBMS
Self-Study
Topic

118
 Relational Database Design Power point Implementation of Simple
Week 6
presentation Programs using PL SQL
Functional Dependences Power point Implementation of Simple
and Normalization For Re- presentation Programs using PL SQL
lational Databases , Boycee
Codd Normal form.
Record Storage and Pri- Structured Cursor Implementations-
Week 7
mary File Organization , Overview Example Programs
Secondary Storage Devices
RAID Models Structured Cursor Implementations-
Overview Example Programs
Operations on Files - Heap PPT lecture Trigger Implementation-
Week 8
File - Sorted Files delivery Example Programs
Hashing Techniques Power point Trigger Implementation-
presenta- Example Programs
tionPPT
lecture deliv-
ery
Index Structure for Files Explicit RDBMS Procedures Imple-
Week 9 Different Types of Indexes Teaching mentation
B-Tree
B-Tree and B+ Tree, Oper- Explicit RDBMS Procedures Imple-
ations on B+ Tree. Teaching mentation
Database Tuning - Query Explicit RDBMS Procedures Imple-
Processing Teaching mentation
Transaction in DBMS- Explicit RDBMS Functions Imple-
Week 10
ACID Properties Teaching mentation
Need for Concurrency Con- Explicit RDBMS Functions Imple-
trol - Schedule Teaching mentation
Serializability- Concurrency Demonstrations RDBMS Procedures Imple-
Week 11 Control- mentation
Types of Locks- Two Phases Demonstrations Database Design with Nor-
locking malization
Deadlock Handling Demonstrations Database Design with Nor-
malization
Time Stamp based Concur- Mastery lec- Introduction to Database
Week 12 rency Control and Recovery ture Connectivity-ODBC and
Techniques Concepts JDBC
Immediate Update - De- Mastery lec- Introduction to Database
ferred Update - ture Connectivity-ODBC and
JDBC
Role of Shadow Paging Mastery lec- Introduction to Database
ture Connectivity-ODBC and
JDBC

119
 Types of DBMS- Object Case studies Embedded SQL -Mini
Week 13
Oriented Databases- OO Project Topic selection and
Data models and Multime- Front End Identification
dia Databases and Group identification
Distributed Databases- Ho- Case studies Embedded SQL -Mini
mogenous and Heteroge- Project Topic selection and
neous – Distributed data Front End Identification
storage and Group identification
XML Structure-XML Docu- Concept for- Implementation of Mini
Week 14
ment Schema mation Project using appropriate
backend
Data Mining and Data Concept for- Implementation of Mini
Warehouse mation Project using appropriate
backend
Security in Database Man- Explicit Demonstration and Report
Week 15
agement Systems Teaching submissionof Mini Project
Database Application Secu- Explicit Demonstration and Report
rity Models. Teaching submissionof Mini Project

EXPERIMENTS:
1. Implementation of DDL commands in RDBMS. .

2. Implementation of DML and DCL commands in RDBMS.

3. Implementation of Date and Built in Functions of SQL.

4. Implementation of Simple Programs.

5. Implementation of High-level language extension with Cursors.

6. Implementation of High level language extension with Triggers

7. Implementation of stored Procedures and Functions.

8. EmbeddedSQL

9. Database design using E-R model and Normalization.

10. Database Connectivity using ADO

11. Database Connectivity using ODBC

12. Database Connectivity using JDBC

TEXT BOOK(S):
1. Abraham Silberschatz, Henry F., Korth and Sudarshan S, Database System Con-
cepts, McGraw-Hill, Seventh Edition, 2019.

120
REFERENCES:
1. Ramez Elmasri and Shamkant B. Navathe, Fundamental Database Systems, Pear-
son Education, Fifth Edition 2008.

2. Raghu Ramakrishnan, Database Management System, Tata McGraw-Hill Publish-

ing Company, 2003.

3. Hector GarciaMolina, Jeffrey D.Ullman and Jennifer Widom, Database System

Implementation, Pearson Education, Second Edition, 2009.

4. C.J.Date, A.Kannan and S.Swamynathan, An Introduction to Database Systems,

Eighth Edition, Pearson Education, 2006.

5. Atul Kahate, Introduction to Database Management Systems, Pearson Education,

New Delhi, 2006.

6. Alexis Leon and Mathews Leon, Database Management Systems, Vikas Publishing
House Private Limited, New Delhi, 2003.

121
 3.9 212CSE2102: COMPUTER ARCHITECTURE AND OR-
GANIZATION

212CSE2102 Computer Architecture and Organi- L T P X C

zation
4 0 0 0 3
Pre-requisite :NIL
Course Category :Program Core
Course Type :Theory

COURSE OBJECTIVES:
• To understand the structure, function and characteristics of computer systems.

• To describe on the fundamental design of various functional units and computer

components.

• To analyze the elements of modern instructions sets and their impact on proces-
sor design, different elements of memory hierarchy and the different methods of
computer I/O.

COURSE OUTCOMES:
CO1: Examine functional units of computer, bus structure and addressing mode.

CO2: Apply the knowledge of algorithms to solve arithmetic unit problems.

CO3: Demonstrate single bus, multiple bus organization and pipelining concepts.

CO4: Analyse the different forms of memory and its organization.

CO5: Evaluate the various I/O interfaces.

MAPPING OF COURSE OUTCOMES WITH PO, PSO:

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

122
UNIT I: BASIC STRUCTURE OF COMPUTERS
Generation of Computers - Progress achieved in the past years, Changes in Technology
- Software Functional Units - Von Neumann model - Software Performance - Instruction
Types - Examples - Instruction and Instruction Sequencing - Instruction Format - Mem-
ory Locations and Addresses - Machine addressability - Memory Operations - Load Store
- Addressing Modes.

UNIT II: ARITHMETIC UNIT

Number Systems – Basic Number Representation – Integer Representation – Signed Ad-
dition and Subtraction – 2’ s complement Addition - Design of Fast - Multiplication of
Positive Numbers – Signed Multiplication – Bit pair Recoding of Multiplier – Restoring
and Non-Restoring Division – Basic Floating Point Representation.

UNIT III: BASIC PROCESSING UNIT

Processor Organization– Register Organization - Instruction Cycle – Execution of com-
plete instruction – Instruction Hardwired Control – Micro Programmed Control –Basic
Concepts of Pipelining – Different types of Pipeline Hazards – Instruction Level Paral-
lelism and Superscalar Operation.

UNIT IV: MEMORY SYSTEM

Computer System Memory overview – Cache memory principles – Elements of cache
Design – Design and performance considerations of cache memory - Semiconductor Main
Memory – ROM – External Memory–Virtual Memory Concept.

UNIT V: I/O ORGANIZATION

Need of I/O Module –Basic I/O Operations - Accessing I/O devices – Interrupts - Direct
Memory Access – Buses, Bus arbitration, Types of buses - Standard I/O Interfaces (PCI,
SCSI, USB).

15 WEEK COURSE PLAN

Week Lecture (4 hours) Pedagogy

Generation of Computers, Explicit Teaching
Week 1 Progress achieved in the
past years, Changes in
Technology, Software Func-
tional Units
Von Neumann model Explicit Teaching
Basic Operational Con- Explicit Teaching
cepts, Connections between
the processor and the
memory

123
 Software Performance, Pro- Explicit Teaching
cessor Clock, Basic Perfor-
mance equation and mea-
surement
Week Instruction Types (zero, Explicit Teaching/ Demon-
2 one, two and three Address) stration
Examples of 1, 2, 3 and 0- Explicit Teaching
Address Instruction
Instruction and Instruction Explicit Teaching
Sequencing, Data transfers,
ALU, Sequencing and I/O
Branching and condition Explicit Teaching
codes
Week Memory Locations and Ad- Explicit Teaching
3 dresses, Machine Address-
ability, Big endian and little
endian
Memory Operations Load, Explicit Teaching
Store
Addressing Modes Explicit Teaching
Example Problem Solving
Week Number Systems, Basic Explicit Teaching/ Demon-
4 Number Representation stration
Numerical Example Explicit Teaching, Problem
Solving
Integer Representation Explicit Teaching
Signed Addition and Sub- Explicit Teaching, Problem
traction Solving
Week Design of Fast Adders Explicit Teaching/ Demon-
5 stration
Carry Save Addition of Explicit Teaching, Problem
Summands Solving
Multiplication of Positive Explicit Teaching, Problem
Numbers Solving
Booth Multiplication of Explicit Teaching, Problem
Signed Numbers Solving
Week Bit pair Recoding of Multi- Explicit Teaching/ Demon-
6 plier stration
Restoring Division Explicit Teaching, Problem
Solving
Non-Restoring Division Explicit Teaching, Problem
Solving
Basic Floating Point Repre- Explicit Teaching, Problem
sentation Solving
Week Processor Organization, Explicit Teaching/ Demon-
7 Fundamental Concepts stration

124
 Execution of a Complete In- Explicit Teaching
struction, Hardware Com-
ponents of processor
Single Bus Organization, Explicit Teaching
Register Transfers, Per-
forming an ALU operation
Multi-bus Organization, Explicit Teaching
Control signals
Week Instruction Hardwired Con- Explicit Teaching/ Demon-
8 trol, control step counter stration
Micro-programmed Con- Explicit Teaching
trol, control memory,
organization
Basic Concepts of Pipelin- Explicit Teaching
ing, advantages, stages
Instruction Level Paral- Explicit Teaching
lelism, stages
Week Types of pipeline hazards- Explicit Teaching/ Demon-
9 Data, Control and struc- stration
tural
Implementation of pipelin- Explicit Teaching
ing
Branch prediction, static Explicit Teaching
and dynamic
Superscalar Operation - out Explicit Teaching
of order B27execution, im-
precise exception
Week Memory - Basic concepts Explicit Teaching/ Demon-
10 stration
Semiconductor RAMs - Explicit Teaching
types, internal organiza-
tions, synchronous and
Asynchronous RAMs,
Dynamic memories
Internal organization Explicit Teaching
Mapping - Direct, Associa- Explicit Teaching
tive and set Associative
Week Cache memory - design con- Explicit Teaching/ Demon-
11 siderations stration
Performance consideration - Explicit Teaching
hit rate, miss rate, miss
penalty
memory interleaving and its Explicit Teaching
types
Improving Hit Rate - Explicit Teaching
prefetching, lock-up free
cache

125
 Week Reducing Miss Penalty - Explicit Teaching/ Demon-
12 write through, write back, stration
principle of locality
Virtual Memory - pading, Explicit Teaching
address translation, TLB,
Page fault
Secondary Storage - fixed, Explicit Teaching
removable
Types of secondary storage Explicit Teaching
Week Need of I/O Module, Basic Explicit Teaching/ Demon-
13 I/O Operations stration
Accessing I/O devices - Explicit Teaching
memory mapped, pro-
grammed I/O
Interrupts- vectored inter- Explicit Teaching
rupts, interrupt nesting
Handling Interrupt -ISR, Explicit Teaching
Daisy chaining, polling,
nested
Week Direct Memory Access - or- Explicit Teaching/ Demon-
14 ganization, implementation, stration
DMA controller
Buses - Introduction Explicit Teaching
Synchronous and Asyn- Explicit Teaching
chronous Bus
Bus arbitration - centralized Explicit Teaching
, distributed
Week Basics on Standard I/O - Explicit Teaching/ Demon-
15 protocols and standards stration
serial / Parallel port Explicit Teaching
SCSI representation Explicit Teaching
Universal Serial Bus Explicit Teaching

TEXT BOOK(S):
1. Carl Hamacher, Zvonko Vranesic and Safwat Zaky, Computer Organization, McGraw-
Hill, 6’th Edition 2016.

REFERENCES:
1. William Stallings, Computer Organization and Architecture – Designing for Per-
formance, PHI pvt Ltd, 10’th Edition, 2016.

2. David A.Patterson and John L.Hennessy, Computer Organization and Design: The
hardware software interface, Morgan Kaufmann, 4’th Edition, 2010.

126
3. John P.Hayes, Computer Architecture and Organization, McGraw Hill, 3’rd Edi-
tion, 2017.

127
 3.10 212CSE3301: DESIGN AND ANALYSIS OF ALGORITHM

212CSE3301 DESIGN AND ANALYSIS OF AL- L T P X C

GORITHMS
2 0 2 3 4
Pre-requisite : Data Structure
Course Category :Program Core
Course Type : Integrated Course - Theory

COURSE OBJECTIVES:
• Analyze the asymptotic performance of algorithms.

• Apply and write rigorous correctness proofs for algorithms.

• Demonstrate a familiarity with major algorithms and data structures

• Apply important algorithmic design paradigms and methods of analysis.

• Synthesize efficient algorithms in common engineering design situations

COURSE OUTCOMES:
CO1: Understand the characteristics and types of algorithms and use asymptotic nota-
tions to analyze the performance of algorithms

CO2: Analyze the differences in design techniques and apply Greedy and Dynamic Pro-
gramming strategies to solve Optimization problems

CO3: Apply and Analyze Backtracking and Branch , Bound strategies to solve combina-
torial optimization problems respectively

CO4: Understand Tractable and Intractable problems and apply reduction techniques to
find problem classes

CO5: Analyze the efficiency of Randomization and Approximation algorithms in solving

complex problems

CO6: Create efficient algorithms for real time problem statements by applying appropriate
design strategies.

CO7 : Implement the problem statements in programming languages efficiently

128
MAPPING OF COURSE OUTCOMES WITH PO, PSO:
PO’S PSO’S
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 S S S
CO2 S S S
CO3 S S S
CO4 S S S
CO5 S S M S S S
CO6 S S M S M S M
CO7 S S M S M S M

UNIT I: INTRODUCTION TO ALGORITHMS AND ANALY-

SIS
Introduction: Characteristics of algorithm. Analysis of algorithm: Asymptotic analysis of
complexity bounds best, average and worst-case behaviour,Performance measurements of
Algorithm, Time and space trade-offs, Analysis of recursive algorithms through recurrence
relations: Substitution method, Recursion tree method and Masters theorem

UNIT II: FUNDAMENTAL ALGORITHMIC STRATEGIES

Divide and Conquer – Karatsuba algorithm- Strassan matrix multiplication - Brute-
Force – String matching - Greedy Techniques Elements of greedy strategy - Single source
shortest path - Huffman tree Task Scheduling problem Dynamic programming Principal
of optimality - Longest common subsequence - Optimal binary tree

UNIT III:BACKTRACKING AND BRANCH AND BOUND

Backtracking n-Queens Problem Hamiltonian Circuit problem Subset-Sum problem -
Branch and Bound Assignment Problem Knapsack Problem - Travelling Salesman Problem-
Illustrations of these techniques for Problem-Solving

UNIT IV: TRACTABLE

Tractable and Intractable Problems- Computability of Algorithms- Computability classes-
P, NP, NP-complete and NP-hard- Cooks theorem- Standard NP-complete problems and
Reduction techniques

UNIT V: ADVANCED TOPICS

Heuristics – Characteristics- Bin packing algorithm -Approximation algorithms – Vertex-
Cover - Travelling Salesman Problems - Randomized algorithms, Hiring problem- pri-
marily testing, comparison of strings, Las Vedas - Monte carlo- Randomized Quick Sort
Algorithm – Communication algorithm – Case studies

15 WEEK COURSE PLAN

129
Week Lecture (2 Pedagogy Practical (2 X Component (3
hours) hours) hours)
Week 1 Introduction: Explicit Logics and Pro- Brute force
Characteristics Teach- gramming Problem solving
of algorithm. ing
Analysis of algo-
rithm,Asymptotic
Analysis of
Complexity
bounds best,
Average and
Worst case
behaviour
Week 2 Performance Explicit Non - Recursive Analysis of
Measurements Teach- and Recursive Problems in
of Algorithm, ing algorithms terms of time
Time and and Space
space trade- (GATE) and
offs,Analysis Hackerank Chal-
of recursive lenge - Level
algorithms, sub- I
stitution meth-
ods,Recursion
tree method
Week 3 Masters the- Explicit Problem Scenar- Chinese remain-
orem ,Brute Teach- ios in divide and der theroem and
Force - String ing conquer strategy Closest Pair al-
Matching,Divide gorithm
and Conquer
– Karatsuba
algorithm-
Strassan matrix
multiplication

Week 4 Greedy Tech- Explicit Problem scenar- Competitive

niques Elements Teach- ios in Greedy ap- Programming
of greedy strat- ing proach Challenge -
egy - Single Round I
source shortest
path,Huffman
tree Task
Scheduling
problem

130
Week 5 Dynamic pro- Explicit Problem Sce- Competitive
gramming Prin- Teach- nario in dynamic Programming
cipal of opti- ing prograaming Challenge -
mality, Longest Round I
common sub
sequence
Week 6 Optimal bi- Explicit Problem Sce- Problem solving
nary search Teach- nario in Back- using permuta-
tree,Backtracking ing tracking tech- tion and combi-
n-Queens Prob- niques nation
lem Hamiltonian
Circuit problem
Week 7 Subset-Sum Explicit Problem sce- Problem solving
problem ,Branch Teach- nario using in Project Euler
and Bound ing Branch and - Level I
Assignment Bound
Problem Knap-
sack Problem
Week 8 Travelling Sales- Explicit Problem sce- Hungarian
man Problem- Teach- nario using method for
Illustrations of ing Branch and branch and
these techniques Bound bound
for Problem-
Solving
Week 9 Tractable and Explicit Implementation Problem solving
Intractable Teach- of NP Complete in Project Euler
Problems- ing problems - Level II
Computability
classes- P, NP,
NP-complete
and NP-hard
Week Cooks theorem- Explicit Implementation Competitive
10 Standard NP- Teach- of NP - I prob- Programming
complete prob- ing lems Challenge -
lems and Reduc- Round II
tion techniques.
Week Randomized Explicit Randomized Competitive
11 algorithm - Las Teach- Quick sort Programming
Vegas - Ran- ing Challenge -
domized quick Round II
sort
Week Monte carlo - Explicit String communi- Determininstic
12 String communi- Teach- cation protocol Selection
cation protocol ing

131
 Week Approximation Explicit Bin packing Graphs and
13 algorithms - Teach- problem Minimum Cuts
Heuristics - Bin ing
packing problem
Week Vertex-Cover Explicit Vertex-Cover Graphs and
14 -Analysis Teach- Minimum Cuts
ing
Week Travelling Sales- Explicit Problem solving Competitive
15 man Problems- Teach- leveraging hiring Programming
Hiring problem- ing and primality Challenge -
primality testing test Round III

EXPERIMENTS:
1. Implementation of Euclid’s Algorithm

2. Implementation of Consecutive Integer Checking Algorithm

3. Implementation of Middle School Procedure

4. Unique elements in an Array

5. Tower of Hanoi Problem

6. Number of digits in binary using recursion

7. Karatsuba algorithm, strassan Matrix multiplication

8. String Compression Algorithm

9. Task Scheduling Algorithm

10. Longest Common Sub sequence

11. Optimal Binary Tree

12. Binary String Pattern Recognition

13. Segment Summation

14. Hamiltonian Circuit Problem

15. Subset-Sum Problem

16. Knapsack Problem

17. Travelling Salesman Problem

18. Vertex Cover Problem

19. Randomized Quick Sort

132
20. Graph Colouring Problem

21. Vertex Colouring

TEXT BOOK(S):
1. T.H. Cormen, C.E. leiserson, R.L. Rivest and C. Stein, Introduction to Algorithms,
Fourth Edition, PHI Private Limited, 2012

2. Anany Levitin, Introduction to the Design and Analysis of Algorithm, Third Edi-
tion, Pearson Education Asia, 2012

3. Juraj Hromkovic, Randomization and Approximation Algorithms, 2nd Edition,

Springer , 2014

REFERENCES:
1. Sara Baase and Allen Van Gelder, Computer Algorithms Introduction to Design
Analysis, Third Edition, Pearson Education, New Delhi, 2000

2. Obed Goldreich, P, NP, NP Completeness, Second Edition, Cambridge, 2010

3. A.V.Aho, J.E Hopcroft and J.D.Ullman, The Design and Analysis of Computer
Algorithms ,Third Edition, Pearson Education Asia, 2012

133
 3.11 212CSE3302: COMPUTER NETWORKS

212CSE3302 COMPUTER NETWORKS L T P X C

2 0 2 3 4
Pre-requisite :NIL
Course Category :Program Core
Course Type :Integrated Course - Theory

COURSE OBJECTIVES:
• To provide students with an overview of the concepts and fundamentals of data
communication and computer networks.

• To introduce students to local, metropolitan and wide area networks are using the
standard OSI reference model as a framework and to the Internet protocol suite
and network tools and programming using various networking technologies.

COURSE OUTCOMES:
CO1: Understand the network model and analyze the various protocols in application
layer.

CO2: Learn and identify the segmentation through TCP and UDP.

CO3: Inspect the basics of data communication and various categories of networks.

CO4: Identify the technologies for error free secure transmission of data in data link layer.

CO5: Apply various routing protocols to select optimal path and relate addressing entities
in Network Layer.

CO6: Analyze the performance of various communication protocols using network tools.

CO7: Apply the knowledge acquired on various real time applications over internet.

134
MAPPING OF COURSE OUTCOMES WITH PO, PSO:
PO’S PSO’S
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 S
CO2 S
CO3 S M M
CO4 S M M
CO5 S M M
CO6 S S
CO7 S S M S M

UNIT I: INTRODUCTION TO NETWORKS AND

APPLICATION LAYER
Introduction: Networks, Reference Model: TCP/IP and OSI , client-server, peer-to-peer
network, overview of components of a network – devices, media and services (applica-
tion) –end devices, intermediary network devices, NIC, gateways, Topology- physical and
logical. Application Layer - Principles of network applications, DNS - Electronic Mail –
FTP – HTTP - Next Generation Networks: Introduction - Vision, Scenarios - Require-
ments on Technology and Management - Functional Architecture - Introduction to tools:
Wireshark, packet tracer.

UNIT II: TRANSPORT LAYER

Transport Layer - Need and Issues - Transport service - Elements of Transport Protocols
Transport layer protocols - TCP and UDP, flow control, retransmission strategies, con-
gestion control.

UNIT III: NETWORK LAYER

Network Layer - Need and Issues - Routing algorithms - Congestion Control Algorithms
– QOS - Network Layer in Internet - Network Addressing – IPv4 IPv6-Configuration
of Router - Distance Vector Routing – Link State Routing – RIP – OSPF – BGP -
Subnetting – Classless Inter Domain Routing (CIDR) – Variable Length Subnet Mask
(VLSM) – DHCP – ARP – Network Address Translation (NAT) – ICMP.

UNIT IV: DATA LINK LAYER

DLL: Need and Issues - Error Detection and Correction - Protocol Verification and Data
Link Layer protocols - MAC Sub layer - Channel Allocation Problem - Multiple Access
Protocols – Ethernet - Wireless LANs and VLAN - Data Link Layer Switching - Con-
nectivity Devices - Configuration of Switches, ARP and RARP.

135
UNIT V: PHYSICAL LAYER
Physical Layer: Need and Issues, Data Communication, Guided transmission media,
Wireless Transmission, Communication Satellites, Multiplexing and Switching.

15 WEEK COURSE PLAN

Week Lecture ( hours) Pedagogy Practical (2 X Component (3

hours) hours)
Introduction: PPT, Flash Study of Net- Impact of Net-
Week 1 Networks, Animation work Tool - works in Day
TCP/IP and packet tracer, today life, Re-
OSI. wireshark searching Con-
verged Network
Services.
Week 2 Client-Server, Demonstration, Study of Net-
peer-to-peer net- PPT, Flipped work Devices a) Help-
work, overview Learning in detail - Hub, Navigation
of components Switch, Router. b) Exploring
of a network – a) Building a internetworking
devices, media Peer-to-Peer devices
and services Network
(application) b) Examining
–end devices, Telnet and SSH
intermediary
network devices,
NIC, gateways,
Topology- phys-
ical and logical
- Next Genera-
tion Networks
- introduc-
tion - Vision,
Scenarios - Re-
quirements on
Technology and
Management
- Functional
Architecture.

136
Week 3 Application PPT,Videos, Network Proto- FTP Servers,
Layer - Princi- Case Study- col analysis: DNS Servers,
ples of network based Learn- a) Capture and DHCP, Web
applications, ing, Flipped Analyze DNS server and
DNS - Elec- Learning Packets. Email server
tronic Mail – b) Capture and
FTP – HTTP. Analyze HTTP
(Assignment - Packets
I).
Week 4 Transport Layer PPT Network Pro- Investigating
- Need and Is- tocol analysis: the TCP/IP and
sues - Transport Capture and OSI Models in
service. Analyze ICMP Action
Packets.
Week 5 Elements of Videos, PPT, Network Proto- Observe the
Transport Pro- Flipped col analysis: TCP 3-Way
tocols Transport Learning a) Capture and Handshake
layer protocols - Analyze TCP
TCP and UDP. Segment.
b) Capture and
Analyze UDP
Datagram.
Week 6 Flow control, Videos,PPT, Perform an Examine a UDP
retransmission Case Study- experiment for DNS Capture
strategies, con- based Learn- port scanning
gestion control. ing with Nmap, Su-
(Assignment - perscan or any
II). other Software.
a) Find open
ports on a sys-
tem
b) Find the
machines which
are active
Week 7 Network Layer - Demonstration, Capture and An- Static Route
Need and Issues PPT alyze IP Packets Configuration
- Routing algo- using wireshark.
rithms - Conges-
tion Control Al-
gorithms – QOS
- Network Layer
in Internet.

137
Week 8 Network Ad- Case Study- Exploring link Configuring a
dressing – based Learn- state and dis- Linksys router
IPv4 and IPv6- ing, Problem tance vector
Configuration solving, PPT routing proto-
of Router - cols
Distance Vector
Routing – Link
State Routing –
RIP – OSPF –
BGP.
Week 9 Subnetting – Case Study- a) To create a Designing and
Classless Inter based Learn- number of Sub- Implementing a
Domain Rout- ing, Problem net and assign VLSM Address-
ing (CIDR) solving, PPT, the devices. ing Scheme
– Variable Flipped b) To check
Length Subnet Learning the connectivity
Mask (VLSM) from one subnet
– DHCP – to another sub-
ARP – Net- net.
work Address c) To Config-
Translation ure the DHCP
(NAT) – ICMP. Server and pro-
(Assignment - vide a service
III). to end device
using different
Gateways.
Week DLL: Need and Problem To configure Identify MAC
10 Issues - Error solving, the Intra VLAN and IP Ad-
Detection and PPT,Flipped using packet dresses, con-
Correction - Learning tracer. figure a small
Protocol Ver- LAN
ification and
Data Link Layer
protocols - MAC
Sub layer.
Week Channel Alloca- PPT,Flipped To configure Managing the
11 tion Problem - Learning the Inter VLAN Medium, Con-
Multiple Access using packet figuring Secure
Protocols – Eth- tracer. Passwords and
ernet. SSH.

138
 Week Wireless LANs PPT,Videos Checking Layer Connecting
12 and VLAN - 2 functionality a Wired and
Data Link Layer using packet Wireless LAN,
Switching - tracer. Examine the
Connectivity a) Configure ARP Table.
Devices - Con- Spanning Tree
figuration of Protocol
Switches, ARP b) Configure
and RARP. ARP and MAC
Table.
Week Physical Layer: PPT, Videos, Study of dif- Scenario 1
13 Need and Issues, Demonstra- ferent types of
Data Communi- tion Network cables
cation. and practically
implement the
Crossover wired
and Straight
through cable
using Crimping
Tool.
Week Guided trans- PPT, Videos, Topologies - Trouble shoot-
14 mission media, Flipped Ring Topology, ing default
Wireless Trans- Learning Mesh Topology, gateway
mission. Tree Topology,
Ring Topology
Week Communication PPT Design and Trouble shoot-
15 Satellites, Mul- Build a Small ing connectivity
tiplexing and Business Net- issues on a
Switching. work network.

EXPERIMENTS:
1. Study of Network Tool - packet tracer, wireshark.

2. Study of Network Devices in detail - Hub, Switch, Router.

a) Building a Peer-to-Peer Network.
b) Examining Telnet and SSH.

3. Network Protocol analysis:

a) Capture and Analyze DNS Packets.
b) Capture and Analyze HTTP Packets.

4. Network Protocol analysis: Capture and Analyze ICMP Packets.

5. Network Protocol analysis:

a) Capture and Analyze TCP Segment.
b) Capture and Analyze UDP Datagram.

139
 6. Perform an experiment for port scanning with Nmap, Superscan or any other Soft-
ware.
a) Find open ports on a system.
b) Find the machines which are active.

7. Capture and Analyze IP Packets using wireshark.

8. Exploring link state and distance vector routing protocols.

9. a) To create a number of Subnet and assign the devices.

b) To check the connectivity from one subnet to another subnet.
c) To Configure the DHCP Server and provide a service to end device using different
Gateways.

10. To configure the Intra VLAN using packet tracer.

11. To configure the Inter VLAN using packet tracer.

12. Checking Layer 2 functionality using packet tracer.

a) Configure Spanning Tree Protocol.
b) Configure ARP and MAC Table.

13. Study of different types of Network cables and practically implement the Crossover
wired and Straight through cable using Crimping Tool.

14. Topologies - Ring Topology, Mesh Topology, Tree Topology, Ring Topology.

15. Design and Build a Small Business Network.

TEXT BOOK(S):
1. James F. Kurose, Keith W. Ross, “Computer Networking: A Top-Down Approach”,
7th Edition, Pearson Education, 2017.

2. Larry Peterson Bruce Davie, “Computer Networks - A Systems Approach”, 5th

Edition by, Morgan Kaufmann, 2011.

3. Andrew S Tanenbaum, David J. Wetherall, “Computer Networks”, 5th Edition

Pearson Education, 2011.

4. Dr Jingming Li Salina, Pascal Salina. “Next Generation Networks Perspectives and

Potentials”, Wiley, 2007.

REFERENCES:
1. Todd Lammle, “CCNA Cisco Certified Network Associate Study Guide”, 7th Edi-
tion, 2011.

2. B. S. Manoj, C. Siva Ram Murthy , “Ad Hoc Wireless Networks Architectures and
Protocols”, Prentice Hall, 2004.

3. Behrouz A. Forouzan, “Data Communications and Networking” Fourth Edition,

McGraw-Hill, 2006.

140
4. William Stallings” Cryptography and Network Security: Principles and Practice”,
6th Edition, 2014.

5. William Stallings, “Data and Computer Communications”, 10th Edition, Pearson

Education, 2014.

141
 3.12 212CSE3303: OPERATING SYSTEM

212CSE3303 Operating System L T P X C

3 0 2 0 4
Pre-requisite :NIL
Course Category :Program Core
Course Type :Integrated Course - Theory

COURSE OBJECTIVES:
• To learn modern operating systems and their principles.

• To gain knowledge on distributed operating system concepts that includes architec-

ture, Mutual exclusion algorithms, deadlock detection algorithms and agreement
protocols

• To learn, the details of processes, CPU scheduling, memory management, file sys-
tem, storage subsystem, and input/output management.

COURSE OUTCOMES:
CO1: Understand and Interpret Operating System Structure, Operations, Services and
Process.

CO2: Apply various scheduling algorithms for Process/CPU Scheduling and elaborate
multithreaded programming

CO3: Apply different methods for handling deadlocks and elaborate process synchroniza-
tion.

CO4: Analyze the efficiency of various page replacement algorithms for memory manage-
ment.

CO5: Analyze the performance of disk scheduling algorithms and explore the concepts of
protection and security

MAPPING OF COURSE OUTCOMES WITH PO, PSO:

PO’S PSO’S
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 S
CO2 S
CO3 S M M
CO4 S M M
CO5 S M L M L

142
UNIT I INTRODUCTION TO OPERATING SYSTEMS
Introduction: Concept of Operating Systems, Generations of Operating systems, Types
of Operating Systems, Operating System structure - Layered, Monolithic, Microkernel
operating systems, Operating system services, system calls, Network operating system,
Distributed operating system, Concept of Virtual Machine. Installation of windows and
Linux via Virtual Machine.

UNIT II PROCESS SCHEDULING

Definition, Process Relationship, Di?erent states of a Process, Process State transitions,
Process Control Block (PCB), Context switching Thread: Definition, Various states,
Benefits of threads, Types of threads, Concept of multi threads, Process Scheduling:
Foundation and Scheduling objectives, Types of Schedulers, Scheduling criteria: CPU
utilization, Throughput, Turnaround Time, Waiting Time, Response Time; Scheduling
algorithms: Preemptive and Non preemptive, FCFS, SJF, RR; Multiprocessor schedul-
ing: Real Time scheduling: RM and EDF.

UNIT III PROCESS SYNCHRONIZATION AND DEADLOCK

Operations on Processes, Cooperating Processes, Inter-process Communication: Critical
Section, Race Conditions, Mutual Exclusion, Hardware Solution, Strict Alternation, Pe-
tersons Solution, The Producer Consumer Problem, Semaphores, Event Counters, Moni-
tors, Message Passing, Classical IPC Problems: Readers AND Writer’s Problem, Dining
Philosopher Problem etc. Deadlocks: Definition, Necessary and su?cient conditions for
Deadlock, Deadlock Prevention, Deadlock Avoidance: Bankers algorithm, Deadlock de-
tection and Recovery.

UNIT IV MEMORY MANAGEMENT

Memory Management: Basic concept, Logical versus Physical address space, Memory
allocation: Contiguous Memory allocation-Fixed and variable partition- Internal and
External fragmentation and Compaction; Segmentation: Basic Method- Segmentation
Hardware. Paging: Principle of Operation-Page allocation-Hardware support for pag-
ing, Protection and sharing, Disadvantages of paging. Virtual Memory: Basics of Vir-
tual Memory- Hardware and control structures-Locality of reference, Page fault, Dirty
page/Dirty bit, Demand paging, Page Replacement algorithms: Optimal, First in First
Out (FIFO), Second Chance (SC), Not recently used (NRU) and Least Recently used
(LRU).Allocation of frames,Thrashing.Implementaion of virtual memory in windows.

UNIT V FILE, SECONDARY STORAGE MANAGEMENT AND

PROTECTION
I/O Hardware: I/O devices, Device controllers, Direct memory access Principles of I/O
Software Disk Management: Disk structure, Disk scheduling - FCFS, SSTF, SCAN, C-
SCAN, Disk reliability, Disk formatting, Boot-block, Bad blocks. File Management: Con-

143
cept of File, Access methods, File types, File operation, Directory structure, File System
structure, Allocation methods (contiguous, linked, indexed), Free-space management (bit
vector, linked list, grouping), directory implementation (linear list, hash table), e?ciency
and performance.Protection AND Security: Protection- Goals of Protection, Domain of
protection, Access Matrix, Access control, Implementation of Access Matrix, Revocation
of Access Rights. Capability Based Systems, Language-based protection. Security: Se-
curity problems, Program Threats, System and network threats, Cryptography as a tool,
user authentication, implementing security defence-Fire walling to protect system and
networks, computer security classification.

15 WEEK COURSE PLAN

Week Lecture (3 hours) Pedagogy Practical(2 hours)

Week 1 Introduction to Con- Flipped Learn- Practicing windows and
cept of Operating Sys- ing, PPT, unix operating systems
tems,Generations of Oper- Demonstration commands
ating systems, Types of Op-
erating Systems,Operating
System structure,Operating
system services, system
calls,Network operating
system, Distributed oper-
ating system, Concept of
Virtual Machine. Installa-
tion of windows and Linux
via Virtual Machine.
Week 2 Definition, Process Rela- PPT Creating the parent process
tionship, Di?erent states of and child process and check
a Process, Process State the order of executing in
transitions, Process Con- any real applications.
trol Block (PCB, Context
switching, Thread: Defini-
tion, Various states, Ben-
efits of threads, Types of
threads, Concept of multi
threads

144
Week 3 Process Scheduling: Foun- PPT,Problem Implement the CPU
dation and Scheduling Solving Scheduling to schedule the
objectives, Types of Sched- input process
ulers, Scheduling criteria:
CPU utilization, Through-
put, Turnaround Time,
Waiting Time, Response
Time, Scheduling algo-
rithms: Preemptive and
Non preemptive, FCFS,
SJF, RR; Multiprocessor
scheduling
Week 4 Operations on Processes, PPT,Problem Implement the Simulation
Cooperating Processes, Solving of Inter process Communi-
Inter-process Communi- cation
cation: Critical Section,
Race Conditions, Mu-
tual Exclusion, Hardware
Solution, Strict Alterna-
tion, Petersons Solution,
The Producer Consumer
Problem
Week 5 Semaphores, Event Coun- PPT, Problem Practing simple inter-
ters, Monitors, Message Solving process communication
Passing, Classical IPC with signals
Problems: Readers and
Writer’s Problem, Dining
Philosopher Problem
Week 6 Deadlocks: Definition, Nec- PPT, Problem Hand-on session to imple-
essary and su?cient condi- Solving, Case mentation deadlock avoid-
tions for Deadlock, Dead- study ance using Banker’s algo-
lock Prevention, Deadlock rithm with appropriate data
Avoidance: Bankers algo- structure.
rithm, Deadlock detection
and Recovery.

145
Week 7 Memory Management: PPT,Problem Hand-on session for Imple-
Basic concept, Logical Solving, Case mentation of memory man-
versus Physical address Study agement functions.
space, Memory alloca-
tion: Contiguous Memory
allocation-Fixed and vari-
able partition- Internal and
External fragmentation and
Compaction; Segmentation:
Basic Method- Segmen-
tation Hardware. Paging:
Principle of Operation-Page
allocation-Hardware sup-
port for paging, Protection
and sharing, Disadvantages
of paging.
Week 8 Virtual Memory: Basics peer learning, Performing operations on
of Virtual Memory- Hard- PPT, Problem data frames obtained from
ware and control structures- Solving real time datasets
Locality of reference, Page
fault, Dirty page/Dirty bit,
Demand paging.
Week 9 Page Replacement algo- Problem Solving Page replacement al-
rithms: Optimal, First in gorithms on real world
First Out (FIFO), Sec- memory management
ond Chance (SC), Not problems.
recently used (NRU)
and Least Recently
used (LRU).Allocation
of frames,Thrashing. Im-
plementaion of virtual
memory in windows.
Week I/O Hardware: I/O devices, PPT, Problem Working with the schedul-
10 Device controllers, Direct Solving ing of disk spaces using
memory access Principles of scheduling algorithms
I/O Software Disk Manage-
ment: Disk structure, Disk
scheduling - FCFS, SSTF,
SCAN, C-SCAN, Disk re-
liability, Disk formatting,
Boot-block, Bad blocks
Week File Management: Con- PPT Hands-on session to create
11 cept of File, Access meth- directory structure.
ods, File types, File oper-
ation, Directory structure,
File System structure

146
Week Allocation methods (con- PPT, Problem Hands-on session on alloca-
12 tiguous, linked, indexed), Solving tion of directory storage in
Free-space management (bit real-time applications
vector, linked list, group-
ing), directory implementa-
tion (linear list, hash table),
e?ciency and performance.
Week Protection and Security: PPT, Demon- Practical hands-on session
13 Protection- Goals of Protec- stration, Prob- to the implementation of ac-
tion, Domain of protection, lem Solving cess control mechanisms.
Access Matrix, Access con-
trol, Implementation of Ac-
cess Matrix, Revocation of
Access Rights. Capability
Based Systems, Language-
based protection.
Week Security: Security prob- Case Study, Practical hands-on session
14 lems, Program Threats, Demonstration to handle system and net-
System and network work threats.
threats
Week Cryptography as a tool, Demonstration, Hands-on session on imple-
15 user authentication, imple- flipped Learning mentation of encryption al-
menting security defence gorithms
Fire walling to protect sys-
tem and networks, com-
puter security classification

EXPERIMENTS:
1. Windows
and UNIX Commands.

2. Simulation of System calls

3. Implementation of CPU Scheduling algorithms

4. Simulation of IPC in UNIX

5. Implementation of deadlock avoidance algorithms

6. Implementation of Page replacement algorithms

7. Implementation of memory management functions

8. Implementation of disk scheduling algorithms

9. Implementation of access control mechanisms

147
10. Implementation of encryption algorithms

TEXT BOOK(S):
1. Operating System Concepts Essentials, 9th Edition by Avi Silberschatz, Peter
Galvin,Greg Gagne, Wiley Asia Student Edition,2012.

2. Operating Systems: Internals and Design Principles, 6th Edition, William Stallings,
Prentice Hall of India,2010.

REFERENCES:
1. Operating System: A Design-oriented Approach, 1st Edition by Charles Crowley,
Irwin Publishing.

2. Operating Systems: A Modern Perspective, 2nd Edition by Gary J. Nutt, Addison-

Wesley.

3. Design of the Unix Operating Systems, 8th Edition by Maurice Bach, Prentice-Hall
of India

4. Understanding the Linux Kernel, 3rd Edition, Daniel P. Bovet, Marco Cesati,O’Reilly
and Associates

5. Operating systems- A Concept based Approach-D.M.Dhamdhere. 3rd Edition.TMH

6. Modern Operating Systems, Andrew S Tanenbaum 4rd edition PHI. 2015

7. Principles of Operating Systems, B.L.Stuart. Cengage learning, India Edition.

8. Operating Systems. A.S. Godboie.2nd Edition, TMH,2008

148
 3.13 212CSE3304: AUTOMATA AND COMPILER DESIGN

212CSE3304 AUTOMATA AND COMPILER L T P X C

DESIGN
3 0 2 0 4
Pre-requisite : Nil
Course Category :Program Core
Course Type : Integrated Course - Theory

COURSE OBJECTIVES:
• Understand the different mathematical models of computation.

• Design Finite Automata and recognize the Regular Expression and Languages.

• Explore the principles, algorithms, and data structures involved in the design and
construction of compilers.

COURSE OUTCOMES:
CO1: Understand the different forms of proof and construct Finite Automata, Determin-
istic Finite Automata and Non-Deterministic Finite Automata.

CO2: Evaluate Regular Expression and Languages using Finite Automata and their types.

CO3: Understand the different phases of compilers and Evaluate Lexical Analysis.

CO4: Apply Various Parsing Techniques to the Context Free Grammar (CFG).

CO5: Create the Various Code Generation Schemes and apply the various optimization
techniques for the generated code.

CO6: Analyze the Various Mathematical Computational Machine Model using JFLAP
simulation tools.

CO7 : Implement all the Compiler Phases in programming language efficiently.

MAPPING OF COURSE OUTCOMES WITH PO, PSO:

PO’S PSO’S
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 S M M
CO2 S M L L M
CO3 S M L L M
CO4 S M M
CO5 S M S M M L L M M
CO6 S S S M M L S M
CO7 S S S L S S

149
UNIT I: AUTOMATA
Introduction to formal proof – Additional forms of Proof - Inductive Proofs –Finite Au-
tomata (FA) – Deterministic Finite Automata (DFA) – Non-deterministic Finite Au-
tomata (NFA) – Finite Automata with Epsilon Transitions.

UNIT II: REGULAR EXPRESSIONS AND LANGUAGES

Regular Expression –Finite Automata and Regular Expressions – Properties of Regular
languages: Pumping Lemma for Regular Languages and Applications – Closure Proper-
ties of Regular Languages- Equivalence of Automata.

UNIT III:INTRODUCTION TO COMPILER

Language processors - Structure of a compiler - Grouping of phases into passes- Compiler
construction tools - Lexical Analysis: Role of Lexical Analyzer - Lexical Errors - Specifi-
cation of tokens - Recognition of Tokens - Optimization of DFA based Pattern Matchers-
LEX.

UNIT IV: PARSER

Introduction-Role of the parser - Error Handling and Recovery in Syntax Analyzer -
Context-Free Grammars -Writing a Grammar-Top-Down parsing – Predictive Parsing -
Bottom-up parsing - Shift Reduce Parsing- Simple LR Parser – YACC.

UNIT V: CODE GENERATION AND OPTIMIZATION

Intermediate Code Generation: - Intermediate Languages, Variants of Syntax Trees -
Three-Address Code: Types and Implementations - Code Optimization: Principal Sources
of Optimization- Peephole Optimization. Code Generation: Issues in Design of a Code
Generator - Basic Blocks and Flow Graphs - Optimization of Basic Blocks

15 WEEK COURSE PLAN

Course
Lecture (4 hours) Practical (2 hours)
Chart
Weeks
Topic Pedagogy Topic Pedagogy
Introduction to formal Explicit Teaching Installing JFLAP
Week 1 proof Simulation Tool Demonstration
Additional forms of Explicit Teaching and perform
Proof proving
Inductive Proofs Problem Solving techniques.
Finite Automata Explicit Teaching Design a DFA
Week 2 Deterministic Finite Experiential and NFA, Demonstration
Automata (DFA) Learning Recognize the
Non-Deterministic Fi- Explicit Teaching input string
nite Automata (NFA) from Automata

150
 Conversion from NFA Explicit Teaching Automata
Week 3 to DFA Translation Demonstration
Finite Automata with Explicit Teaching using JFLAP.
Epsilon Transitions.
Epsilon Closure and Problem Solving
Conversion from Ep-
silon Transitions NFA
to DFA.
Regular Expression, Problem Solving Building a
Week 4 Demonstration
Properties of Regular Regular
languages. Expression
Finite Automata and Explicit Teaching
Regular Expression
Conversion from Reg- Problem Solving Automata and Experiential
Week 5 ular Expression to Au- Regular Learning and
tomata Expression Demonstartion
Conversion from Au- Problem Solving Translation
tomata to Regular Ex- using JFLAP.
pression
Automata Versus Explicit Teaching
Regular Expression
Pumping Lemma for Problem Solving Proving
Week 6 Regular Languages languages not to Demonstration
and Applications be regular
Closure Properties of Explicit Teaching
Regular Languages
Equivalence of Au- Problem Solving
tomata
Language processors - Explicit Teaching Installing LEX
Week 7 Structure of a com- tool. Simple
piler Program using Demonstration
Grouping of phases Explicit Teaching LEX,
into passes- Compiler Performing
construction tools Lexical
Lexical Analysis Explicit Teaching Analyzer
Role of Lexical Ana- Explicit Teaching Operation from
Week 8
lyzer - Lexical Errors & Problem Solv- Source
ing Language and
Specification of to- Explicit Teaching Source
kens, Recognition of Expression
Tokens
Optimization of DFA Explicit Teaching Construction of
Week 9 based Pattern Match- Optimized DFA Problem Solving
ers using direct
method.

151
 Problem based on Explicit
Regular Expression Teaching &
to DFA using Direct Problem Solving
Method
LEX
Introduction-Role Explicit Teaching Build a CFG,
Week 10 of the parser - Er- Parse Tre and Problem Solving
ror Handling and Ambiguous
Recovery in Syntax Grammar
Analyzer
Context-Free Gram- Explicit Teaching
mars
Writing a Grammar Explicit Teaching
Top-Down parsing Explicit Teaching Compute first
Experiential
Week 11 & Problem Solv- and follow using
Learning
ing predictive
Predictive Parsing Experiential parsing and
Learning Construct a
Construction of Pre- Problem Solving Predictive
dictive Parsing Table Parsing table
Bottom-up parsing - Explicit Teaching Design a Shift
Week 12 Shift Reduce Parsing Reduce Parsing, Demonstration
Simple LR Parser Su- Explicit Teaching Construction of
pervised Learning : SLR Parsing
Concepts and Exam-
ples
YACC Experiential
Learning
Intermediate Code Explicit Teaching Construct and
Week 13 Generation: - Inter- implement the Demonstration
mediate Languages, 3-address code
Variants of Syntax from source
Trees language
Three-Address Code: Explicit Teaching
Types
Three-Address Code: Explicit Teaching
Implementations
Code Optimization Problem Solving Implementations
Week 14 Principal Sources of Experiential of Optimization Demonstration
Optimization Learning Techniques
Peephole Optimiza- Explicit Teaching
tion
Code Generation: Is- Explicit Teaching Generate Target
Week 15 sues in Design of a code from Demonstartion
Code Generator Source
Basic Blocks and Flow Explicit Teaching Language and
Graphs 3-address code.

152
 Optimization of Basic Explicit Teaching
Blocks

EXPERIMENTS:
1. Installing JFLAP Simulation Tool and Perform Proving Techniques

2. Design a DFA and NFA, Recognize an input string from Automata

3. Automata Translation using JFLAP

4. Building a Regular Expression

5. Automata and Regular Expression Translation using JFLAP

6. Proving Language not to be Regular

7. Installing Lex, Simple Lex Program, Implementation of Lexical Analyzer

8. Construction of Optimized DFA using Direct Method

9. Building a CFG, Parse Tree and Ambiguous Grammar

10. Compute First and Follow Function using Predictive Parsing

11. Construction of Predictive Parsing Table

12. Design a Shift Reduce Parser

13. Construction of SLR Parsing Table

14. Generation of 3-address code

15. Implementation of 3-address code

16. Implementations of Optimization Techniques

17. Generation of Target Code

TEXT BOOK(S):
1. Introduction to Automata Theory, Languages and Computations, Hopcroft J.E,
Motwani R and Ullman J.D, Pearson Education, Third Edition, 2011.

2. Compilers principles, techniques and tools, Alfred Aho, Ravi Sethi, V.Jeffery Ull-
man D, Pearson Education, Second Edition, 2018

153
REFERENCES:
1. Introduction to Languages and the Theory of Computation, Martin J, Tata Mc
Graw Hill, 2003

2. Elements of The theory of Computation, Lewis H. R and Papadimitriou, Pearson

Education, 2003

3. Allen I. Holub “Compiler Design in C”, Prentice Hall of India, 2003.

4. C. N. Fischer and R. J. LeBlanc, “Crafting a compiler with C”, Benjamin Cum-

mings, 2003.

5. J.P. Bennet, “Introduction to Compiler Techniques”, Second Edition, Tata McGraw-

Hill, 2003.

6. HenkAlblas and Albert Nymeyer, “Practice and Principles of Compiler Building

with C”, PHI, 2001.

7. Kenneth C. Louden, “Compiler Construction: Principles and Practice”, Thompson

Learning, 2003

154
 3.14 212CSE3305: SECURED COMPUTING

212CSE3305 SECURED COMPUTING L T P X C

2 0 2 3 3
Pre-requisite :NIL
Course Category :Program Core
Course Type :Integrated Course - Theory

COURSE OBJECTIVES:
• To understand the basics of cryptography

• To learn to identify the vulnerabilities in programs and to overcome them.

• To create awareness of the different kinds of Security threats in networks.

• To study the security threats in databases and the solutions available.

• To learn about the models and standards for security.

COURSE OUTCOMES:
CO1: Demonstrate knowledge of symmetric and asymmetric Encryption Algorithms like
DES, AES and RSA, hash functions and digital signatures for protecting messages
and data.

CO2: Secure programs and protect systems from malicious code.

CO3: Work with Firewalls, VPNs and IDSs to secure networks.

CO4: Identify the issues and solutions for implementing Security in Databases.

CO5: Demonstrate knowledge of Secure SDLC, Bell Lapadula and Biba models and ISO
27000 family of standards.

MAPPING OF COURSE OUTCOMES WITH PO, PSO:

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

UNIT I: ELEMENTARY CRYPTOGRAPHY

Terminology and background, Substitution ciphers, Transpositions, Making good en-
cryption algorithms, Data Encryption Standard, AES encryption algorithm, Public key
encryption, Cryptographic hash functions, Key exchange, Digital signatures Certificates.

155
UNIT II: PROGRAM SECURITY
Secure programs, Non-malicious program errors, Viruses, Targeted malicious code, Con-
trols against program threat, Control of access to general objects, User authentication,
Secure coding practices, Vulnerabilities in web applications.

UNIT III: SECURITY IN NETWORKS

Threats in networks, Threat analysis, Encryption, Virtual Private Networks, PKI,SSH,SSL,
IPSec, content integrity, Access controls, Wireless security, Honey pots, Traffic flow se-
curity, Firewalls, Intrusion detection systems, Secure e-mail, Mobile Security. .

UNIT IV: SECURITY IN DATABASES

Security requirements of database systems, Reliability and integrity in databases, Two
phase update, Redundancy / internal consistency, Recovery, Concurrency / consistency,
Monitors, Sensitive data, Types of disclosures, Inference.

UNIT V: SECURITY MODELS AND STANDARDS

Secure SDLC, Secure application testing, Security architecture models, Trusted comput-
ing base, Bell LaPadula confidentiality model,Biba integrity model, Graham Denning
access control model, Harrison Ruzzo Ulmanmodel, Secure frameworks,COSO, CobiT,
Compliances, PCI DSS, Security standards, ISO 27000 family of standards.

156
15 WEEK COURSE PLAN

Week Lecture (2 hours) Pedagogy X Component (3 hours)

Terminology and Direct instruction Breaking the Shift Cipher: To understand the
background (PPT) principle of large key space so as to understand that
Week 1 the secure encryption is not possible with small key
Substitution Interactive in-
space. The system is easily broken if the total
ciphers struction (Prob- number of distinct secret keys is small, that is the
lem solving) key space K is small. In this experiment, we work
Transpositions Interactive in- with a well-known encryption scheme, namely the
struction (Prob- shift cipher, that has a very small key space. Your
task is to break the shift cipher using brute force
lem solving)
approach. Specifically, given only the cipher text in
Making good Interactive in- some instance of a shift cipher, you need to find the
encryption algo- struction (Prob- plain text and the secret key.”
rithms lem solving)
Data Encryption Direct instruction Breaking the Mono-alphabetic Substitution Cipher:
Week 2 Standard (PPT) Interactive To understand that just having a large key space is
not enough to achieve secure encryption. In this
instruction (Prob-
experiment, we work with another well-known
lem solving) encryption scheme, namely the mono-alphabetic
AES encryption Direct instruction substitution cipher, that has a very large key space.
algorithm (PPT), Interac- However, it is quite easily broken using ”Frequency
tive instruction analysis” methods. Your task is to break this
cipher. Specifically, given only the ciphertext in
(Problem solving)
some instance of a mono alphabetic substitution
Public key encryp- Direct instruction cipher, you need to find the plaintext and the secret
tion (PPT), Interac- key.
tive instruction
(Problem solving)
Cryptographic Direct instruction Message Authentication Code:To understand
hash functions (PPT) Interactive the requirements of data integrity with the help
Week 3 of Secure Hash Algorithm 1 (SHA-1) which is a
instruction (Prob-
lem solving) popular cryptographic hash function highly
Key exchange Direct instruction used in TLS,SSL,PGP,SSH,S/MIME,IPSec.In
(PPT) Interactive this experiment, we calculate the message
instruction (Prob- digest of a text using the SHA-1 algorithm and
thereby verifying data integrity.
lem solving)
Digital signatures Direct instruction
(video)
Certificates Direct instruction
(Demonstration)
Secure programs Direct instruction Symmetric Key Encryption with 48 bit key: To
Week 4 (Demonstration) understand a symmetric-key block cipher algorithm
Non-malicious Direct instruction known as Data Encryption Standard(DES). In this
experiment, you are asked to perform encryption
program errors (Demonstration) and decryption of the plain message using a 48 bit
Viruses Direct instruction key which provides high security
(PPT)
Targeted mali- Direct instruction Symmetric Key Encryption with 128 bit key:To
Week 5 cious code (PPT) understand the need of highly secured symmetric
encryption algorithm known as Advanced
Encryption Standard (AES).In this experiment, you
are asked to encrypt long messages using various
modes of operation wherein a block cipher (AES)
157 with 128 bit key is provided to you.
 Controls against Direct instruction
program threat (PPT)
Control of access Direct instruction
to general objects (PPT)
User authentica- Direct instruction Asymmetric Key Encryption : To understand
Week 6 tion (PPT) the need of using different keys for encryption
and decryption so as to achieve more security.
Secure coding Direct instruction In this experiment, you are asked to implement
practices (PPT) the popular asymmetric key algorithm RSA.
Vulnerabilities in Direct instruction
web applications (PPT)
Threats in net- Direct instruction Secure Key exchange: To understand how to
works,Threat (PPT) securely exchange the crypto graphic keys over
Week 7 Internet (Public channel). In this experiment,
analysis
you are asked to implement Diffie-Hellman Key
Encryption Direct instruction exchange mechanism.
(PPT)
Virtual Private Direct instruction
Networks (PPT)
PKI, SSH, SSL, Direct instruction
Ipsec (PPT)
Content integrity, Direct instruction Digital Signature generation:To understand
Access controls (PPT) how to authenticate a message sent over the
Week 8 Internet using digital signature mechanism. In
Wireless security Direct instruction this experiment, you are asked to generate
(PPT) digital signature for the given message so as to
Honey pots Direct instruction ensure authenticity, integrity and
(PPT) non-repudiation.
Traffic flow secu- Direct instruction
rity (PPT)
Firewalls Flipped classroom
Intrusion detec- Flipped classroom Firewall:To understand the security device
Week 9 tion systems which sits between public and private network
and protects the network by filtering traffic. In
Secure e-mail Direct instruction this experiment, you are asked to simulate a
(PPT) Software-based Firewall System for Computer
Mobile Security Direct instruction Network Traffic Control.
(PPT)
Security require- Direct instruction Intrusion Detection/Prevention System: To
Week 10 ments of database (PPT) understand IDS/IPS system with the help of
systems the Linux utility, snort. In this experiment,
you are asked to configure snort to monitor
Reliability and Direct instruction your network traffic for intrusion attempts, log
integrity in (PPT) them, and report when an intrusion attempt is
databases detected.
Two phase update Direct instruction
(PPT)

158
 Redundancy Direct instruction Virus creation: To understand how virus is
Week 11 (PPT) working and how it is a threat to computing
system. In this experiment, you are asked to
Internal consis- Direct instruction create a self replicating virus program in a
tency (PPT) Virtual Machine environment and test it in a
Recovery Direct instruction Linux-based Virtual Machine.
(PPT)
Concurrency Direct instruction Antivirus creation: For the virus created in
/ consistency– (PPT) week 11, create an antivirus which detects and
Week 12
Monitors alerts the system user about the virus. Test it
in a Linux-based Virtual Machine.
Sensitive data Direct instruction
(PPT)
Types of disclo- Direct instruction
sures (PPT)
Inference Direct instruction
(PPT)
Secure SDLC Direct instruction Database security- Access control and
Week 13 (PPT) authentication: To explore the security threats to
database and the solution to protect the data in
database against compromises of their
Secure application Direct instruction confidentiality.In this experiment, you are asked to
testing (PPT) implement database security mechanisms by
Security architec- Direct instruction considering the following: Access control and
ture models (PPT) authentication.
Trusted comput- Direct instruction Database security- Encryption and Integrity :
ing base (PPT) To explore the security threats to database and
Week 14 the solution to protect the data in database
Bell LaPadula Direct instruction against compromises of their integrity. In this
confidentiality (PPT) experiment, you are asked to implement
model database security mechanisms by considering
Biba integrity Direct instruction the following: Encryption and integrity controls
model (PPT)
Graham Denning Direct instruction
access control (PPT)
model
Harrison Ruzzo Direct instruction
Ulmanmodel (PPT)
Secure frame- Direct instruction
works (PPT)
Week 15 Evaluation of X component by Quiz
COSO-CobiT Direct instruction
(PPT)
Compliances Direct instruction
(PPT)
PCI DSS Blended learning

159
 Security Independent
standards-ISO study (Home-
27000 family of work)
standards

TEXT BOOK(S):
1. Charles P.Pfleeger, Shari Lawrence Pfleeger,“Security in Computing”, Fourth Edi-
tion, Pearson Education, 2015.

REFERENCES:
1. 1. William Stallings, “Cryptography and Network Security: Principles and Prac-
tices”, Prentice Hall, Fifth Edition, 2010.

2. 2. Michael Howard, David LeBlanc, John Viega, “24 Deadly Sins of Software Se-
curity: Programming Flaws and How to Fix Them”, McGraw Hill Osborne Media,
First Edition, 2009.

3. 3. Matt Bishop, “Introduction to Computer Security”, Addison-Wesley, 2004.

4. 4. Michael Whitman, Herbert J. Mattord, “Management of Information Security”,

Course Technology, Third Edition, 2010

5. 5. Matt Bishop, “Computer Security: Art and Science”, Addison-Wesley, First

Edition, 2002

6. 6. Michael Whitman, Herbert J. Mattord,” Principles of Information Security”,

Cengage Learning, Fourth Edition, 2011.

160
 4 PROGRAM ELECTIVE COURSES

STREAM: ARTIFICIAL INTELLIGENCE AND MA-

CHINE LEARNING
4.1 213CSE1301: INTRODUCTION TO ARTIFICIAL INTEL-
LIGENCE AND MACHINE LEARNING

213CSE1301 Introduction to Artificial Intelligence L T P X C

and Machine Learning
4 0 2 0 4
Pre-requisite : NIL
Course Category : Program Elective
Course Type : Integrated Course - Theory

COURSE OBJECTIVES:
• To understand Artificial Intelligence concept and its applications.

• To gain knowledge regarding bayesian networks and its benefits in AI.

• To analyze various genetic algorithms and understand the basics of neural networks.

• To introduce the history of machine learning and to provide sufficient knowledge in

choosing appropriate machine learning algorithms for the corresponding application.

• To explore various learning models.

COURSE OUTCOMES:
CO1: Understand the foundations and history of Artificial Intelligence, as well as the sci-
ence of agent design.

CO2: Understand the probabilistic approaches to AI and apply them to solve real world
problems.

CO3: Apply Evolutionary, Neural Network algorithms to solve complex problems.

CO4: Understand the origins of Machine learning and analyse the various types of algo-
rithms with respect to the data.

CO5: Apply and analyze deterministic machine learning models on various real time data
and build ability to implement the learning algorithms.

161
MAPPING OF COURSE OUTCOMES WITH PO, PSO:
PO’S PSO’S
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 S M L M S L
CO2 S S S M S M
CO3 S S S S M L S S S
CO4 S S S S S M
CO5 S S S S L L L L M L L S S S

UNIT I: Introduction to Artificial Intelligence, Logistic Approach

& Knowledge based Systems
History of Artificial Intelligence, Emergence of AI, Cognitive Science and AI.Basics of
Propositional Logic- Syntax, Semantics, Tautologies and Logical Implication, Logical Ar-
guments, Derivation Systems, Resolution in normal forms, derivations using resolutions
and resolution algorithm. Artificial Intelligence Applications- Knowledge-Based Systems,
Wumpus World. Taxonomic Knowledge- Semantic Nets, Model of Human Organization
of Knowledge, Frame data structure, planning using frames. Non-monotonic Logic- Cir-
cumscription, Default Logic, Difficulties.

UNIT II: Probabilistic Approach to AI

Probability Basics- Probability Spaces, Conditional Probability and Independence, Bayes’
Theorem; Meaning of probability, Relative frequency and subjective approaches. Ran-
dom Variables- Probability Distributions of Random Variables, Independence of Random
Variables, Random variables in applications. Bayesian Networks -Definition, properties
and representation; Inference, Algorithms and packages, Inference using Netica; Casual-
ity and Markov condition in networks. Networks with Continuous Variables- Gaussian
Bayesian Networks, Hybrid Networks. Obtaining the Probabilities in a Bayesian Net-
work: Difficulty Inherent in Multiple Parents, Basic Noisy OR-Gate Model, Leaky Noisy
OR-Gate Model. Large-Scale Application of Bayesian Networks: Promedas.

UNIT III: Evolutionary Intelligence, Neural Networks & Natural

Language Understanding
Genetics Review. Genetic Algorithms: Algorithm Description, Illustrative Examples,
Travelling Salesperson Problem; Ant system, Ant colonies and Artificial Ants for TSP,
Flocks, application to Financial trading. Basic understanding of Neural Networks, Func-
tional structure of neural networks. Understanding of Natural Language Understanding,
Parsing, Semantic Interpretation, Concept/Knowledge Interpretation.

UNIT IV: Introduction to Machine Learning

The Origins of Machine Learning. Uses and Abuses of Machine Learning. How do Ma-
chines Learn? - Abstraction and Knowledge Representation, Generalization. Assessing
the Success of Learning 4 Steps to Apply Machine Learning to Data. Choosing a Machine
Learning Algorithm - Thinking about the Input Data, Thinking about Types of Machine
Learning Algorithms, Matching Data to an Appropriate Algorithm.

162
UNIT V: Learning Deterministic Models
Supervised Learning- Concepts and Examples. Regression- Simple Linear Regression,
Multiple Linear Regression, Overfitting and Cross Validation. Parameter Estimation-
Estimating the Parameters for Simple Linear Regression, Gradient Descent, Logistic Re-
gression and Gradient Descent. Learning a Decision Tree: Information Theory, Informa-
tion Gain and the ID3 Algorithm. Unsupervised Learning: Clustering, Automated Dis-
covery. Reinforcement Learning: Multi-Armed Bandit Algorithms, Dynamic Networks.
Decision Trees, Influence diagrams, Risk Modelling, Sensitivity Analysis. Structured
Learning problems, score based structure learning, constraint based structure learning.
Casual Learning – casual faithful assumption, embedded faithfulness,Information Re-
trieval, Data Scraping from Web sources, Scrapy in Python.

15 WEEK COURSE PLAN

Course
Lecture (2 hours) Practical (2 hours)
Chart
Weeks
Topic Pedagogy Topic Pedagogy
History of Artificial Explicit Teach-
Introduction to
Week 1 Intelligence-What is ing Demonstration
Netica
AI?- Emergence of AI
Cognitive Science and Explicit Teach-
AI – Logical Approach ing
to AI and Knowledge
based systems – Ba-
sics of Propositional
Logic: Syntax, Se-
mantics
Tautologies and Explicit Teach-
Logical Implication, ing
Logical Arguments,
Derivation Systems
Resolution in normal Explicit Teach- Network
Week 2 forms, derivations us- ing Construction in Demonstration
ing resolutions and Netica
resolution algorithm
Artificial Intelli- Experiential
gence Applications: Learning
Knowledge-Based
Systems, Wumpus
World
Taxonomic Knowl- Explicit Teach-
edge: Semantic Nets ing

163
 Model of Human Or- Explicit Teach- Simulating
Week 3 ganization of Knowl- ing Networks in Demonstration
edge, Frame data Netica
structure, planning
using frames
Non-monotonic Logic: Explicit Teach-
Circumscription ing
Default Logic, Diffi- Explicit Teach-
culties ing
Probability Basics: Problem Solving Inference using
Week 4 Problem Solving
Probability Spaces, Netica;
Conditional Probabil- Casuality and
ity and Independence Markov
Bayes’ Theorem; Explicit Teach- condition in
Meaning of probabil- ing networks
ity, Relative frequency
and subjective ap-
proaches
Random Variables: Problem Solving Hands-on
Experiential
Week 5 Probability Distri- Session on
Learning
butions of Random Pandas,
Variables Matplotlib,
Independence of Ran- Explicit Teach- Numpy
dom Variables, Ran- ing
dom variables in ap-
plications
Bayesian Networks Explicit Teach-
-Definition, properties ing
and representation;
Inference, Algorithms
and packages
Networks with Con- Problem Solving Data Scraping
Week 6 tinuous Variables: using Demonstration
Gaussian Bayesian BeautifulSoup
Networks, Hybrid
Networks
Obtaining the Proba- Explicit Teach-
bilities in a Bayesian ing
Network: Difficulty
Inherent in Multiple
Parents
Basic Noisy OR-Gate Problem Solving
Model, Leaky Noisy
OR-Gate Model
Large-Scale Applica- Explicit Teach- Scraping data
Week 7 tion of Bayesian Net- ing from websites:
works: Promedas Flipkart, Demonstration
Espncricinfo,
Pubmed
164
 Genetics Review – Ge- Explicit Teach-
netic algorithms – Al- ing
gorithm Description,
Illustrative Examples
Travelling Salesperson Explicit Teach-
Problem; Ant system ing
Ant colonies and Arti- Explicit Teach-
Week 8
ficial Ants for TSP ing & Problem
Solving
Flocks, application to Explicit Teach-
Financial trading ing
Neural Networks, Explicit Teach-
Evaluation:
Week 9 Natural Language ing Problem Solving
Data Scraping
Understanding: Basic
understanding of
Neural Networks
Functional structure Explicit
of neural networks Teach-
Understanding of ing &
Natural Language Prob-
Understanding lem
Parsing, Semantic Solving
Interpretation, Con-
cept/ Knowledge
Interpretation
The Origins of Ma- Experiential Hands on
Experiential
Week 10 chine Learning – Learning Session on
Learning
How do Machines Explicit Teach- Sklearn
Learn? - Abstrac- ing
tion and Knowledge
Representation, Gen-
eralization
Assessing the Success Explicit Teach-
of Learning ing
4 Steps to Apply Explicit Teach- Hands on
Experiential
Week 11 Machine Learning to ing & Problem Session on
Learning
Data Solving Sklearn
Choosing a Machine Experiential
Learning Algorithm - Learning
Thinking about the
Input Data
Thinking about Types Experiential
of Machine Learning Learning
Algorithms
Matching Data to an Explicit Teach-
Linear
Week 12 Appropriate Algo- ing Demonstration
Regression
rithm

165
 Learning Determinis- Explicit Teach-
tic Models Supervised ing
Learning : Concepts
and Examples
Regression: Simple Experiential
Linear Regression Learning
Multiple Linear Re- Explicit Teach-
Logistic
Week 13 gression, Over fitting ing Demonstration
Regression
and Cross Validation
Parameter Estima- Explicit Teach-
tion: Estimating the ing
Parameters for Simple
Linear Regression
Gradient Descent, Lo- Explicit Teach-
gistic Regression and ing
Gradient Descent
Learning a Decision Problem Solving
Decision Tree
Week 14 Tree: Information Demonstration
Learning
Theory, Information
Gain and the ID3
Algorithm
Unsupervised Learn- Experiential
ing: Clustering, Auto- Learning
mated Discovery
Reinforcement Learn- Explicit Teach-
ing: Multi-Armed ing
Bandit Algorithms,
Dynamic Networks
Decision Trees, Influ- Explicit Teach- ML Model
Project Based
Week 15 ence diagrams, Risk ing Building using
Learning
Modelling, Sensitivity Scraped Data
Analysis
Structured Learning Explicit Teach-
problems, score-based ing
structure learning,
constraint-based
structure learning
Casual Learning – ca- Explicit Teach-
sual faithful assump- ing
tion, embedded faith-
fulness

EXPERIMENTS:
1. Web Scraping - Scrapy
2. Linear Regression

166
 3. Lasso Regression

4. Ridge Regression

5. Logistic Regression

6. Polynomial Regression

7. Decision Tree Learning

8. Partition Clustering

9. Hierarchical Clustering

10. Realtime Data Modelling – Project

TEXT BOOK(S):
1. Introduction to Artificial Intelligence and Machine Learning (IBM ICE Publica-
tions)

REFERENCES:
1. Stuart Russel and Peter Norvig, Artificial Intelligence- A Modern Approach, 3rd
Edition, Pearson Education/Prentice Hall of India, 2016.

2. Elaine Rich andKevin Knight, Artificial Intelligence, 2nd Edition, Tata McGraw-
Hill, 2013 (4th Edition).

3. Neeta Deshpande and Nanda Yadav, Artificial Intelligence, Technical Publications,

Pune, 2008.

4. George F. Luger, Artificial Intelligence- Structures and Strategies for Complex

Problem Solving, 2nd Edition, Pearson Education/PHI, 2010.

167
 4.2 213CSE2301: PREDICTIVE ANALYSIS

213CSE2301 Predictive Analytics L T P X C

4 0 2 0 4
Pre-requisite : NIL
Course Category : Program Elective
Course Type : Integrated Course - Theory

COURSE OBJECTIVES:
• To understand data mining concepts, applications and challenges.

• To provide knowledge on data visualization and various distributions.

• To detect outliers, remove duplicates and partition the data.

• To explore various model development techniques.

• To validate a model, access its performance and update it.

COURSE OUTCOMES:
CO1: Understand the concepts, models and technologies behind data mining.

CO2: Apply mining and statistical techniques to visualize relationships between data.

CO3: Apply data preparation techniques to process aggregate data, missing data, dupli-
cate data and cached data.

CO4: Apply and analyze various data modelling techniques on real-time data.

CO5: Evaluate and deploy models by assessing the performance of the model.

MAPPING OF COURSE OUTCOMES WITH PO, PSO:

PO’S PSO’S
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 M L L L S L
CO2 S M L M S M
CO3 M M M S L M S M
CO4 S S S S L L L L M L L S S M
CO5 S S S S L L S S S

168
UNIT I: Introduction to Data Mining
Introduction, What is Data Mining?, Concepts of Data mining, Technologies Used, Data
Mining Process, KDD Process Model, CRISP – DM, Mining on different kinds of data,
Applications of Data Mining, Challenges of Data Mining.

UNIT II: Understanding and Preparation-I

Introduction, Reading data from various sources, Data visualization, Distributions and
summary statistics, Relationships among variables, Extent of Missing Data, R Program-
ming Constructs, Functional Programming, Map, Reduce, Filter.

UNIT III: Understanding and Preparation-II

Segmentation, Outlier detection, Automated Data Preparation, Combining data files,
Aggregate Data, Duplicate Removal, Sampling DATA, Data Caching, Partitioning data,
Missing Values, Data Visualization, Tableau, Animations, Dashboard.

UNIT IV: Model Development and Techniques

Data Partitioning, Model selection, Model Development Techniques, Neural networks,
Decision trees, Logistic regression, Discriminant analysis, Support vector machine, Bayesian
Networks, Linear Regression, Cox Regression, Association rules.

UNIT V: Model Evaluation and Deployment

Introduction, Model Validation, Rule Induction Using CHAID, Automating Models for
Categorical and Continuous targets, Comparing and Combining Models, Evaluation Charts
for Model Comparison, Meta-Level Modeling, Deploying Model, Assessing Model Perfor-
mance, Updating a Model.

169
15 WEEK COURSE PLAN

Course
Lecture (2 hours) Practical (2 hours)
Chart
Weeks
Topic Pedagogy Topic Pedagogy
Introduction, Explicit Teaching Introduction to
Week 1 what is Data Tableau and its Demonstration
Mining? usecases
Concepts of Experiential
Data mining, Learning
Technologies
Used
Data Mining Explicit Teaching
Process, KDD
Process Model
CRISP – DM, Explicit Teaching Data
Week 2 Mining on differ- & Animation Representation Demonstration
ent kinds of data in Tableau
Applications of Experiential
Data Mining Learning
Challenges of Explicit Teaching
Data Mining
Introduction, Demonstration Data
Week 3 Reading data Visuallization in Demonstration
from various Tableau
sources
Data Visualiza-
Demonstration
tion
Distributions
and summary
statistics
Week Relationships Explicit Teaching Creating
Demonstration
4 among variables Animations
Extent of Miss- Explicit Teaching with Data
ing Data Streams
Week Segmentation, Explicit Teaching Evaluation: Problem
5 Outlier detec- Data Solving
tion Visualization
Automated Explicit Teaching using Tableau
Data Prepara-
tion
Week Duplicate Re- Explicit Introduction to Explicit
6 moval Teaching R Teaching &
Sampling DATA Demonstration
Week Data Caching Explicit Teaching Introduction to Explicit
7 R Teaching &
Demonstration

170
 Partitioning Explicit Teaching
data, Missing
Values
Week Data Partition- Explicit Teaching Data Explicit
8 ing, Model selec- preparation in R Teaching &
tion Demonstration
Model Devel- Explicit Teaching
opment Tech-
niques, Neural
networks
Week 9 Decision Trees Explicit Teaching Functional Explicit
& Problem Solv- Programming in Teaching &
ing R Demonstration
Week Logistic Regres- Explicit Teaching
10 sion
Discriminant Explicit Teaching Decision Trees in Demonstration
Analysis & Problem R
Week Solving Logistic Demonstration
11 Support vector Explicit Teaching Regression in R
machine
Week Bayesian Net- Explicit Teaching
SVM in R Demonstration
12 works
Linear Re- Explicit Teaching
gression, Cox & Problem Solv-
Regression, ing
Association
rules
Week Introduction, Experiential Linear
Demonstration
13 Model Valida- Learning Regression in R
tion
Rule Induction Explicit Teaching
Using CHAID
Automating Explicit Teaching
Week Apriori Mining
Models for Cat- Demonstration
14 in R
egorical and
Continuous
targets
Comparing Experiential
and Combining Learning
Models
Evaluation Explicit Teaching
Charts for
Model Compari-
son
Week Meta-Level Explicit Teaching Data Modeling Project Based
15 Modeling, De- using R Learning
ploying Model

171
 Assessing Model Explicit Teaching
Performance,
Updating a
Model

EXPERIMENTS:
1. R Programming Basics – Hands-on

2. Matrices in R

3. Introduction to dplyr Package

4. Introduction to ggplot Package

5. Association Rule Mining – Apriori

6. k Means Clustering Algorithm

7. Hierarchical Clustering Algorithm

8. Cox Regression

9. Support Vector Machine (SVM)

10. Tableau – Data Visualization

11. Animations in Tableau

12. Dashboard – Case study

TEXT BOOK(S):
1. Data Mining and Predictive Modeling (IBM ICE Publications)

REFERENCES:
1. Bruce Ratner, Statistical and Machine-Learning Data Mining, CRC Press, 2011

2. Eric Siegel & Thomas H. Davenport, Predictive Analytics, Wiley Publications, 2013

3. James Wu and Stephen Coggeshall, Foundations of Predictive Analytics, CRC

Press, 2012

172
4.3 213CSE2302: ALGORITHM FOR INTELLIGENT SYS-
TEMS AND ROBOTICS

213CSE2302 ALGORITHM FOR INTELLIGENT L T P X C

SYSTEMS AND ROBOTICS
4 0 2 0 4
Pre-requisite : NIL
Course Category : Program Elective
Course Type : Integrated Course - Theory

COURSE OUTCOMES:
Upon successful completion of this course, students will be able to
CO1:Understand the Principles of Control Systems.
CO2:Applying Machine Learning in Decision Making.
CO3:Optimization using Numerical Methods in Search.
CO4:Appling Neural Networks in Control Systems.
CO5:Applying the principles of Reinforcement Learning in Robotics.

MAPPING OF COURSE OUTCOMES WITH PO, PSO:

PO’S PSO’S
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 S M S S M L L L L L S L
CO2 S M S S S S L M M L L S M
CO3 M M S S M L L L L S L
CO4 M M M M M L M M L S S
CO5 M S S S S L S L L M S L S S

UNIT I: System Modeling Introduction, Biological and cognitive paradigms for

robot design, Declarative-Procedural-Reflexive hierarchy for decision making and control,
Articulated robots, Joint-Link (Denavit-Hartenberg) transformations, Mobile ground robots,
Uninhabited ground robots, Intelligent agents, Open-loop and closed-loop systems.

UNIT II: Artificial Intelligence for Robotics Engineering Artificial intelligence,

Well-known definitions for AI, Birth of AI, Basic terminologies, Applications of AI, The AI
problems and techniques, Real world problems, State space search, Explicit vs. Implicit
state space, State space search notations, Search problem and problem space, Represen-
tation of search problems, State space search example, Pegs and disks problem, 8 queen’s
problem, N queens problem formulation, 8 puzzle problem, State space search exam-
ple: Tic-tac-toe problem, Production systems, Commutative production system, Problem
characteristics, Search paradigm, Classification of search algorithms, General terminolo-
gies, Uninformed search algorithms, Breadth first search, BFS illustration, Depth first
search, DFS illustrations, Depth Limited Search (DLS), Depth first iterative deepening
search and bi-directional search, Comparing the uninformed search algorithms, Informed

173
search algorithms, Heuristic search techniques, Generate-and-test, Hill climbing, Algo-
rithm for simple hill climbing, Best first search, Knowledge representation, Knowledge
representation languages, Framework for knowledge representation, Knowledge represen-
tation schemes, Properties and schemes for knowledge representation, Relational based
knowledge representation scheme, Inheritable knowledge representation scheme, Infer-
ential knowledge representation scheme, Declarative/procedural knowledge, Planning,
Representation of states, goals and actions, Goal stack planning.

UNIT III: Components of an Intelligent Robotic System Introduction to robotics,

Types of robots, Classification of robots, Components of robot, Manipulation arms, Mer-
its and demerits of robot types with different geometries, Wrists, Robot kinematics,
Homogenous transformation modelling convention, Example of forward kinematics, In-
verse kinematics, Algebraic solution approach: Example, Advanced robotics, Machine
intelligence: Architectures, controllers and applications, Architectures for intelligent con-
trol, Machine learning, Machine learning: Rule-based control, Machine learning: Machine
learned control, Machine learning: Reinforcement learning, Advanced control systems for
robotic arms, Kinematic and dynamic control, Intelligent gripping systems, Overview
of the Salford theories, Need and provision of fingertip sensor system, Computer soft-
ware package implementation, Force feedback control in robots and its application to
decommissioning, Force feedback strategies, Introduction to mobile robots, Environment
capturing with common sensors, CCD cameras, CCD Vs. CMOS, Sonar sensors, Opto-
electronic sensors, Sensor integration, Qualitative approaches, Quantitative approaches,
Bayes statistics, Kalman filter, Machine vision system, Phases of a machine vision sys-
tem, Tool condition monitoring systems, Neural networks for tool condition monitoring
systems, Basic understanding of neural networks, Representational power of perceptrons,
Architecture of neural networks, Single-layer feed-forward architecture, Multiple-layer
feed-forward architecture, Recurrent or feedback architecture, Mesh architecture, The
perceptron training rule, Gradient descent and the delta rule, Gradient descent algorithm,
Stochastic approximation to gradient descent, Multilayer networks and back-propagation
algorithm, The back-propagation algorithm, Multiple principal component fuzzy neural
networks, Fuzzy classification and uncertainties in tool condition monitoring.

UNIT IV: Robot Operating System (ROS) Real and simulated robots, Robot
Operating System (ROS), ROS basics and architecture, The File system level, Files
and folders in a sample package of ROS, ROS packages, ROSbash, package.xml, ROS
messages, ROS services, The computational graph level, The community level, Debugging
and visualization, Using sensors and actuators, 3D modeling and simulation, Computer
vision.

UNIT V: Navigation, SLAM and Speech Recognition and Synthesis Naviga-

tion, Simultaneous localization and mapping, setting up rviz for navigation stack, Adap-
tive Monte Carlo Localization, Avoiding obstacles, Speech recognition and synthesis.

TEXT BOOK(S):
1. 1. Algorithms for Intelligent Systems and Robotics (IBM ICE Publications)

174
4.4 213CSE2303: COMPUTATIONAL LINGUISTICS AND NAT-
URAL LANGUAGE PROCESSING

213CSE2303 COMPUTATIONAL LINGUISTICS L T P X C

AND NATURAL LANGUAGE
PROCESSING
4 0 2 0 4
Pre-requisite : NIL
Course Category : Program Elective
Course Type : Integrated Course - Theory

COURSE OUTCOMES:
Upon successful completion of this course, students will be able to
CO1:Understanding the principles of Natual Language Processing.
CO2:Study of Semantic analysis in Natual language processing.
CO3:Appling statistical technique in linguistic analysis.
CO4:Analysis of documents based on Distance measures similarity measures.
CO5:Application of Information Retrieval algorithms.

MAPPING OF COURSE OUTCOMES WITH PO, PSO:

PO’S PSO’S
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 S M S S M L L L L L S M
CO2 M S M M M M M M M M L S L
CO3 M S M M S L M M L S S
CO4 M M M M M L M M S S M
CO5 M L M M S M M L L M S L S S

UNIT I: Classical Approaches of NLP Introduction, Classical approaches to nat-

ural language processing, Approaches to natural language processing, Understanding lin-
guistics, Level 1: Morphology, Level 2: Syntax, Level 3: Semantics, Level 4: Pragmatics,
Understanding linguistics, Traditional approach, Example: Automatic summarization us-
ing NLP, Drawbacks, Text processing, What Is text processing? Text analysis vs. Text
mining vs. Text analytics, Tools and methodologies: Statistical methods, Tools and
methodologies: Text classification, Tools and methodologies: Text extraction, Tools and
methodologies: Example, Scope of text analysis/processing, Importance of text analysis,
Working principles of text analysis, Data gathering, Data preparation, Data preparation
steps, Data analysis, Evaluation of text classification process, Text extraction, Analysis
in test extraction, Evaluation of text extraction process, Text analysis APIs, Levels of
NLP, Lexical analysis, Pre-processing activity, POS tagging, Syntactic parsing, Types of
parsing, Derivation logic, Grammar, Semantic analysis, Semantic analysis elements, Rep-
resentation in semantic analysis, Natural language generation, NLP vs NLG, History of
NLG, Working principle of natural language generation, Limitations in natural language
generation.

175
UNIT II: Empirical Approaches Corpus creation, Corpus linguistics, Types of cor-
pora, Lexicographical implementations in corpora, Timeline of corpus linguistics, Usage
areas of corpora, Traits of a good text corpus, Annotations in text corpus, NLP task-
specific training corpora, Data sets used for natural language processing, Treebank anno-
tation, Linguistic description layers, Areas using text annotations, Usage of annotations
and corpora, Kinds of annotations, Annotation semantic labels, Annotations in machine
learning, Annotation development cycle, Model creation, Create annotations, Training
and testing the algorithms, Result evaluation, Revision of the model, Tree banks and
its construction, Need for tree bank, Types of tree bank corpus, Phrase structured vs
dependency structured tree bank, Fundamental statistical techniques, Problems of the
traditional approach, How statistics helps, Problems of the traditional approach and how
statistics helps, Hidden Markov model, Maximum entropy Markov model, Conditional
random field model, Support vector machine, N-GRAM, Genetic algorithm, POS Tag-
ging, Word sense disambiguation, POS tag and Tagsets, Types of POS taggers, Markovian
model, Hidden Markov model, POS tagging using HMM.

UNIT III: Statistical Approaches Parsing, Statistical parsing, Approaches to pars-

ing, Statistical approach, Lexicalized statistical parsing, Top-down parsing, Bottom-up
parsing, Left corner parsing method, Statistical parsing: Probabilistic parser, Multiword
expressions, Features of MWE, Types of multi word expressions, Multi word verbs, Word
similarity and text similarity, Text similarity methods, Jaccard similarity, K-means, Co-
sine similarity, Word Mover’s distance, Variational auto encoders, Pre-trained sentence
encoders, Bidirectional Encoder Representations from Transformers (BERT) with cosine
distance, Word sense disambiguation, Complications in WSD, Methods in WSD, Eval-
uation of WSD, History of speech recognition technology, Working principle in voice
recognition, Major leaders in speech recognition and voice assistant, Amazon Alexa, Mi-
crosoft Cortana, Google Assistant, Machine translation, Rule-based machine translation,
Statistical machine translation, Rule-based MT vs. statistical MT, Working principle of
SMT, Challenges with statistical machine translation.

UNIT IV: Applications of Natural Language Processing Information retrieval,

Information retrieval in NLP, IR development, Model types, Model types: Mathematical
basis model, Problems with NLP in information retrieval, NLP in information retrieval,
IR evaluation metrics, Information Retrieval (IR) model and types, Design features of IR
systems, Design features of IR systems, Question answering systems, QA system architec-
ture, QA system types, Text based QA systems, Factoid question answering system, Web
based question answering system, Information retrieval or information extraction based
QA systems, Restricted domain question answering, Rule based question answering sys-
tems, Information extraction, Working of information extraction, Information extraction
applications, Chunking, Representing chunks: Tags vs trees, Report generation, Text
report specifications, Features of reports, Report generation process, Usage of NLP text
in report generation, Ontology construction, Ontology classifications and process, Why
ontology and its advantages, Ontology components, Levels of formality, Ontology con-
struction approaches, Ontology construction.

UNIT V: Emerging Applications of Natural Language Generation in Informa-

tion Visualization, Education, and Health Care Multimedia presentation gener-
ation, Focus points to add multimedia in NLG, Text generation: Meaning represen-

176
tation, Text generation: Document structure design, Text generation: Linguistic style
control, Document layout, Layout and meaning representation, Layout style and word-
ing representation, Image style and meaning representation, Image and wording usage,
Scripted dialogue, Language interfaces for intelligent tutoring systems, CIRCSIM-Tutor,
CIRCSIM-Tutor architecture, data presentation and process cycle, AUTOTUTOR, AU-
TOTUTOR architecture and process, ATLAS Andes, Andes system architecture and
design, Pedagogical considerations in Andes, WHY2-ATLAS, Why 2 Atlas architecture
and process, Argumentation for healthcare consumers, CDS architecture and processing,
NLP for CDS scope, NLP models, Building blocks of NLP - CDS, Data based evidence
collection: Summarization, Applications of NLP in healthcare, Sentiment analysis and
subjectivity, Difficulties in sentiment analysis, Document level sentiment classification,
Sentence level sentiment classification, Lexicon, Feature-based sentiment analysis, Opin-
ion summarization.

EXPERIMENTS:
1. Text Retrieval
2. Processing, Subsetting, Merging and Cleaning Text Data
3. Simple Language Processing using Spacy
4. Language Processing
5. Accessing Text Corpora
6. Processing Raw Text
7. Categorizing and Tagging Words
8. POS Tagging using NLTK Treebank
9. Tagging and Parsing
10. Analysing Text Similarity
11. Analysing Word Sense
12. Analysing Meaning of Words and Sentences
13. POS tagging with Rule Based Viterbi Implementation
14. Machine Translation
15. Information Retrieval from Corpus
16. Information Answering QA system – Rule Based Text Analysis
17. Information Extraction from Text
18. Relation Extraction using Subtree Matching
19. Information Extraction from a Text Corpus
20. Analysis of Sentiment and Subjectivity
21. Analysing Meaning of Sentences

177
TEXT BOOK(S):
1. Computational Linguistic and Natural Language Processing (IBM ICE Publica-
tions).

178
4.5 213CSE3301: DEEP LEARNING

213CSE3301 DEEP LEARNING L T P X C

4 0 2 0 4
Pre-requisite : NIL
Course Category : Program Elective
Course Type : Integrated Course - Theory

COURSE OUTCOMES:
Upon successful completion of this course, students will be able to
CO1:Understand the background and concept of Deep learning.
CO2:Understand and apply Single layer and Multi layer perceptron networks to solve
complex learning problems efficiently.
CO3:Apply Regularization and Optimization criterions to improve performance of learn-
ing models.
CO4:Understand and apply stochastic learning models to solve complex problems.
CO5:Understand the power of dynamically driven recurrent networks and apply them
over real time datasets.

MAPPING OF COURSE OUTCOMES WITH PO, PSO:

PO’S PSO’S
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 M M L L S S
CO2 S M S M L S S
CO3 S M S S L L M S S
CO4 S S S S M L L L M L L S S S
CO5 S S S S M L L S S S

UNIT I: Introduction and Learning Processes Description of a Neural Network,

Human Brain, Models of a Neuron, Neural Networks Viewed as Directed Graphs, Feed-
back, Network Architectures, Knowledge Representation, Artificial Intelligence and Neu-
ral Networks, Error-Correction Learning, Memory-Based Learning, Hebbian Learning,
Competitive Learning, Boltzmann Learning, Supervised and Unsupervised Learning,
Learning Tasks, Memory and Adaptations, Statistical Nature of the Learning Process,
Statistical Learning Theory, Probably Approximately Correct Model of Learning

UNIT II: Single Layer Perceptrons and Multilayer Perceptrons Adaptive

Filtering Problems, Unconstrained Optimization Techniques, Linear Least-Squares Fil-
ters, Least-Mean-Square Algorithms, Learning Curves, Learning Rate Annealing Tech-
niques, Perceptrons, Perceptron Convergence Theorem, Relation between the Perceptron
and Bayes Classifier for a Gaussian Environment, Continuous Latent Variables, Pattern
Recognition in Sequential Data, Combining Models for Pattern Recognition, Preliminary
Concepts, Backpropagation Algorithm, XOR Problem, Heuristics for Making Backprop-
agation Algorithm Perform Better, Output Representation and Decision Rules, Feature

179
Detection, Backpropagation and Differentiation, Hessian Matrix, Generalization, Ap-
proximations of Functions, Cross-Validations, Network Pruning Techniques, Virtues and
Limitations of Backpropagation Learning, Accelerated Convergence of Backpropagation
Learning, Supervised Learning Viewed as Optimization Problem.

UNIT III: Radial-Basis Function Networks and Information-Theoretic Models

Cover’s Theorem on the Separability of Patterns, Interpolation Problem, Regulariza-
tion Theory and Regularization Networks, Generalized Radial-Basis Function Networks,
Estimation of the Regularization Parameter, Approximation Properties of RBF Net-
works, Comparison of RBF Networks and Multilayer Perceptrons, Kernel Regression and
its Relation to RBF Networks, Learning Strategies in RBF Networks, Entropy, Maximum
Entropy Principle, Mutual Information, Kullback-Leibler Divergence, Mutual Informa-
tion as an Optimization Function, Maximum Mutual Information Principle, Infomax and
Redundancy Reduction, Spatially Coherent Features, Spatially Incoherent Features, In-
dependent Components Analysis, Maximum Likelihood Estimation Technique, Maximum
Entropy Method.

UNIT IV: Stochastic Machines Statistical Mechanics, Markov Chains, Metropolis

Algorithm, Simulated Annealing, Gibbs Sampling, Boltzmann Machines, Sigmoid Belief
Networks, Deterministic Boltzmann Machine, Deterministic Sigmoid Belief Networks,
Deterministic Annealing

UNIT V:Dynamically Driven Recurrent Networks Recurrent Network Architec-

tures, State-Space Model, Nonlinear Autoregressive with Exogenous Inputs Model, Com-
putational Power of Neural Networks, Learning Algorithms, Backpropagation through
Time, Real-Time Recurrent Learning, Vanishing Gradients in Recurrent Networks.

TEXT BOOK(S):
1. Deep Learning (IBM ICE Publications).

180
4.6 213CSE4301: PATTERN AND ANOMALY DETECTION

213CSE4302 PATTERN AND ANOMALY DE- L T P X C

TECTION
4 0 2 0 4
Pre-requisite : NIL
Course Category : Program Elective
Course Type : Integrated Course - Theory

COURSE OUTCOMES:
Upon successful completion of this course, students will be able to
CO1:Understanding the concepts in pattern matching problems.
CO2:Apply Statistical methods for Patten matching.
CO3:Applying Machine Learning Methods in Pattern Matching.
CO4:Analyse data analytics method in pattern recognition.
CO5:Understanding hybrid models.

MAPPING OF COURSE OUTCOMES WITH PO, PSO:

PO’S PSO’S
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 S M S S S M L L L L S L
CO2 M S L S S M M M L L M S M
CO3 L M M M S M L L M L S S
CO4 M M M M M M L M L S M
CO5 M L M M S M M L L M S L S M

UNIT I: INTRODUCTION Introduction to Pattern Recognition and Anomaly De-

tection, Example: Polynomial Curve Fitting, Probability Theory, Model Selection, The
Problem with High Dimensionality, Information Theory.

UNIT II: Statistical Approaches for Pattern Recognition Probability Distribu-

tions, Linear Models for Regression, Linear Models for Classification.

UNIT III: Machine Learning Approaches for Pattern Recognition Neural Net-
works, Kernel Methods, Sparse Kernel Machines, Graphical Models, Mixture Models and
EM.

UNIT IV: Approximate Inference, Sampling Methods for Pattern Recognition, Con-
tinuous Latent Variables.

UNIT V: HYBRID INTELLIGENT SYSTEMS Pattern Recognition in Sequen-

tial Data, Combining Models for Pattern Recognition.

181
TEXT BOOK(S):
1. Pattern and Anomaly Detection (IBM ICE Publications).

182
 STREAM: DATA ANALYTICS
4.7 213CSE1303: INTRODUCTION TO DATA ANALYTICS

213CSE1303 Introduction to Data Analytics L T P X C

4 0 2 0 4
Pre-requisite :NIL
Course Category :Program Elective
Course Type :Integrated Course - Theory

COURSE OBJECTIVES:
• Prepare the students to understand and gain the basic knowledge about data ana-
lytics and its evolution.

• Gain knowledge about various business intelligence frameworks techniques to han-

dle data analytics information.

• Familiarizes the students with the help of data warehousing and data mining plat-
form concepts to perform data analytic tasks.

COURSE OUTCOMES:
CO1: Understand the fundamentals of business analytics and optimization.

CO2: Understand the basic concepts of data warehouse and functionality of the various
data warehousing components and how it differs from traditional data base systems.

CO3: Apply the business intelligence techniques in various project activities.

CO4: Apply various data mining and big data techniques in various business intelligence
components.

CO5: Analyze the different dashboard and report design strategies and framework used
in data analytics.

MAPPING OF COURSE OUTCOMES WITH PO, PSO:

PO’S PSO’S
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 S M M M M S S L
CO2 M M S L S L
CO3 S S S M
CO4 M S S M M M S M
CO5 M M M M S S S S

183
UNIT I: BUSINESS ANALYTICS AND OPTIMIZATION
Introduction to Business Analytics and Optimization, Challenges - Volume, Variety (Di-
versity), and speed of Data Creation (and needed decisions), Approaches to help maximize
profitability and returns, Business Analytics Capabilities, Enterprise Analytics Capabil-
ities, Business Analytics Technologies, Predictive Analytics, Prescriptive Analytics, A
fact-based decision making culture, A strong data infrastructure, The Right Analytical
Tools, Analytics Workforce, Knowledge Requirements, Business Analyst, Data Scientist,
Where to put the analytics team, IBM Business Analytics Maturity Model, Optimiza-
tion, Key BAO Concepts, The need for BAO now, Essential Capabilities In BAO, BAO
Capabilities: Business Performance Management, Predictive Analysis and Mining, Value
of BAO to Business Organization, Impact of BAO on diverse industries, Advantages to
implementing BAO solutions, BAO Capabilities: Real-time Analytics: Data In Motion,
BAO support for decision-making, , IBM Technology Portfolio for BAO, Analytical Tools,
Data Analysis in the real world.

UNIT II: DATA WAREHOUSE

Decision Support, Three-Tier Decision Support Systems, Exploring and Analyzing Data,
what is a data warehouse? Data warehouse architecture choices, Enterprise data ware-
house, Independent data mart architecture, Dependent data mart architecture, Data
Warehouse, Data warehouse usage, Multidimensional Data, Conceptual Modeling of Data
Warehouses, The “Classic” Star Schema, The “Snowflake” Schema, The “Fact Constel-
lation” Schema, Data Warehouse Design Process, Single-Layer Architecture, Two-Layer
Architecture, Three-Tier Data Warehouse Architecture, Data Warehouse Development,
Multi-Tiered Architecture, Information pyramid, BI reporting tool architectures, Types of
BI users, Multidimensional analysis techniques, Data Analysis and OLAP, OLAP Server
Architectures, Data Cube, Discovery-Driven Data Cubes, OLTP vs. OLAP, Business
Query, Dashboards and Scorecards Development, Metadata Model, Automated Tasks
and Events, Mobile BI, Disconnected BI, Collaborative BI, Real-time Monitoring, Soft-
ware Development Kit (SDK), Setting up data for BI, Making BI easy to consume.

UNIT III: BUSINESS INTELLIGENCE

Definitions of Business Intelligence, Sample BI Architecture, Things are getting more
complex, BI Components and Architecture, Scope and fit of BI solutions within exist-
ing infrastructure, High Level BI Process, Functional Areas of BI Tool, A single or a
few applications, Benefits of BI, Maximize Value from BI Systems, Strategy and Busi-
ness Intelligence, Business Transformation Projects, Business Role of BI (TWDI), ASUG
Business Intelligence Maturity Model, Why Act? BI Effectiveness Scorecard, BI Value
Scorecard, Five key areas of strategy, Planning a BI Project, Pre-Engagement Activi-
ties, Engagement Activities and process, BI Design and Development, Business Envi-
ronment, Project Tasks: Task 1- Knowledge Capture Goals - Discuss Business Objec-
tives Prior Learning, Interview key stakeholders, Project Planning, Task 2 - Consolidate
Findings - Create logical design, Task 3 - Map the Customer Situation - Current Envi-
ronment, Business/Functional Requirements Sample Diagram, Logical BI Diagram, Task
4 -Methodology Approach, Task 5 - Standards Governance, Task 6 - Sections, Mile-
stones and Tasks, Task 7 – Proof of Concept (POC), Task 8 – Table Creation, Task 9

184
– OLAP Creation, Task 10 –Final Deliverables, Risk management and mitigation, Cost
justification and measuring success.

UNIT IV: DATA MINING BIG DATA ANALYTICS

What is Data Mining, Evolution of Data Mining, Why Data Mining? Knowledge-Based
System, Data Mining Process, Phases of Data Mining Process, KDD Process Model,
CRISP - DM, CRISP-DM - Elaborate view, Data Mining – On what kinds of Data? DM
Tasks and Components of DM methods, Data mining operations, Data mining techniques,
Industry examples of application of DM, Challenges of Data Mining, Why Machine should
“Learn”? What is Machine Learning? Growth of Machine Learning, Machine Learning
types, Unsupervised learning, Reinforcement Learning. Cleaning and Wrangling Data
What is Big Data? Intrinsic Property of Data. . . it grows, A Growing Interconnected
and Instrumental World, Need for Big Data, Characteristics of Big Data, Structure of
Big Data and need for standards, Big Data Analytics Adoption, Benefits Barrier of Big
Data Analytics, Trends for Big Data Analytics, Commoditization of Hardware Enabling
New Analytics, the 5 Key Big Data Use Cases, More Ways – Wide Ranging Analytics
and Techniques, Big Data Platform and Application Frameworks, A Big Data Platform
Manifesto, Use Cases for a Big Data Platform.

UNIT V: DASHBOARD REPORT DESIGNING

Definition, Dashboard Types, Evolution of Dashboards, Layers of Information, Dash-
board Design, Dashboard Design Principles, Other Dashboard Examples, Display Media
for Dashboards, Chart Overview, Singular Components, Metrics, Metrics drive behavior
in a number of ways, Kaplan Norton Balanced Scorecard, The Rayport-Jaworski Perfor-
mance Dashboard and Strategy Framework, Introducing the R-J Performance Dashboard,
Blueprint to the R-J Performance Dashboard, Building Reports, List Report, Crosstab
Report, Chart Report, Map Report, Data group, sort and Filters, add calculations to re-
port, Conditions and Aggregations in Report, Drilling in report, Run report – on demand
or schedule, Charts, Chart Type – Bar Chart, Line, Pie, Area, Scatter, Data Analytics
in different sector, Analytical framework and Latest Trends.

15 WEEK COURSE PLAN

Course
Lecture (2 hours) Practical (2 hours)
Chart
Weeks
Topic Pedagogy Topic Pedagogy
Introduction to Busi- Explicit Teaching Introduction to
Week 1 ness Analytics and Statistical Cen- Demonstration
Optimization, Chal- tral Tendency
lenges - Volume, Measures using
Variety (Diversity), EXCEL
and speed of Data
Creation (and needed
decisions)

185
 Approaches to help Explicit Teaching
maximize profitability
and returns, Business
Analytics Capa-
bilities, Enterprise
Analytics Capabilities
Business Analytics Explicit Teaching
Technologies, Pre-
dictive Analytics,
Prescriptive Analytics
A fact-based decision Explicit Teaching Simple Data Vi- Demonstration
Week 2 making culture, A sualization using
strong data infras- Excel
tructure, The Right
Analytical Tools,
Analytics Workforce,
Knowledge Require-
ments
Business Analyst, Explicit Teaching
Data Scientist, Where
to put the analytics
team, IBM Business
Analytics Maturity
Model
Optimization, Key Explicit Teaching
BAO Concepts, The
need for BAO now,
Essential Capabili-
ties In BAO, BAO
Capabilities: Busi-
ness Performance
Management
Predictive Analysis Explicit Teaching Advanced Data Demonstration
Week 3 and Mining, Value Visualization us-
of BAO to Business ing Excel
Organization, Impact
of BAO on diverse
industries
Advantages to imple- Explicit Teaching
menting BAO solu-
tions, BAO Capabili-
ties: Real-time Ana-
lytics: Data In Motion
BAO support for Explicit Teaching
decision-making, ,
IBM Technology
Portfolio for BAO

186
 Decision Support, Problem Solving Data Visual- Demonstration
Week 4 Three-Tier Decision ization using
Support Systems, Ex- PIVOT Table
ploring and Analyzing and Charts
Data
What is a data ware- Explicit Teaching
house? Data ware-
house architecture
choices, Enterprise
data warehouse
Independent data Explicit Teaching
mart architecture,
Dependent data mart
architecture, Data
Warehouse, Data
warehouse usage
Multidimensional Problem Solving Advanced Visu- Demonstration
Week 5 Data, Concep- alization using
tual Modeling of PIVOT Table
Data Warehouses, and Charts
The “Classic”
Star Schema, The
“Snowflake” Schema,
The “Fact Constella-
tion” Schema
Data Warehouse De- Explicit Teaching
sign Process, Single-
Layer Architecture,
Two-Layer Architec-
ture, Three-Tier Data
Warehouse Architec-
ture, Data Warehouse
Development
Multi-Tiered Archi- Explicit Teaching
tecture, Information
pyramid, BI reporting
tool architectures,
Types of BI users,
Multidimensional
analysis techniques
Data Analysis and Explicit Teaching Hands-on Ses- Demonstration
Week 6 OLAP, OLAP Server sion on Pandas,
Architectures, Data Matplotlib,
Cube, Discovery- Numpy
Driven Data Cubes,
OLTP vs. OLAP

187
 Business Query, Dash- Explicit Teaching
boards and Scorecards
Development, Meta-
data Model, Auto-
mated Tasks and
Events, Mobile BI,
Disconnected BI,
Collaborative BI
Real-time Monitoring, Explicit Teaching
Software Development
Kit (SDK), Setting up
data for BI, Making
BI easy to consume.
Definitions of Busi- Explicit Teaching Hands on Ses- Demonstration
Week 7 ness Intelligence, sion on Sklearn
Sample BI Archi-
tecture, Things are
getting more complex,
BI Components and
Architecture
Scope and fit of BI Explicit Teaching
solutions within ex-
isting infrastructure,
High Level BI Process,
Functional Areas of BI
Tool, A single or a few
applications, Benefits
of BI, Maximize Value
from BI Systems
Strategy and Business Explicit Teaching
Intelligence, Busi-
ness Transformation
Projects, Business
Role of BI (TWDI)
ASUG Business In- Explicit Teaching Statistical Mea- Demonstration
Week 8 telligence Maturity sures using
Model, Why Act? Python
BI Effectiveness
Scorecard
BI Value Score- Explicit Teaching
card, Five key areas
of strategy, Plan-
ning a BI Project,
Pre-Engagement
Activities

188
 Engagement Activ- Explicit Teaching
ities and process,
BI Design and De-
velopment, Business
Environment
Project Tasks: Task Explicit Teaching Data Visual- Demonstration
Week 9 1- Knowledge Cap- ization using
ture Goals - Discuss Python
Business Objectives &
Prior Learning, Inter-
view key stakeholders,
Project Planning,
Task 2 - Consolidate
Findings - Create
logical design, Task
3 - Map the Cus-
tomer Situation -
Current Environment,
Business/Functional
Requirements Sample
Diagram, Logical BI
Diagram
Task 4 -Methodology Explicit Teaching
& Approach, Task 5
- Standards & Gover-
nance, Task 6 - Sec-
tions, Milestones and
Tasks, Task 7 – Proof
of Concept (POC)
Task 8 – Table Cre- Explicit Teaching
ation, Task 9 – OLAP
Creation, Task 10 –Fi-
nal Deliverables, Risk
management and mit-
igation, Cost justifi-
cation and measuring
success
What is Data Min- Explicit Teaching Data Visual- Demonstration
Week 10 ing, Evolution of Data ization using
Mining, Why Data Python
Mining? Knowledge-
Based System
Data Mining Process, Explicit Teaching
Phases of Data Mining
Process, KDD Process
Model, CRISP - DM,
CRISP-DM - Elabo-
rate view

189
 Data Mining – On Explicit Teaching
what kinds of Data?
DM Tasks and Com-
ponents of DM meth-
ods
Data mining opera- Explicit Teaching Data Visual- Demonstration
Week 11 tions, Data mining ization using
techniques, Industry Python
examples of applica-
tion of DM
Challenges of Data Explicit Teaching
Mining, Why Ma-
chine should “Learn”?
What is Machine
Learning? Growth of
Machine Learning
Machine Learning Explicit Teaching
types, Supervised
learning, Unsu-
pervised learning,
Reinforcement Learn-
ing.
What is Big Data? Explicit Teaching Simple Linear Demonstration
Week 12 Intrinsic Property Regression
of Data. . . it grows,
A Growing In-
terconnected and
Instrumental World,
Need for Big Data,
Characteristics of Big
Data, Structure of
Big Data and need for
standards
Big Data Analytics Explicit Teaching
Adoption, Benefits &
Barrier of Big Data
Analytics, Trends for
Big Data Analytics,
Commoditization of
Hardware Enabling
New Analytics, the
5 Key Big Data Use
Cases, More Ways –
Wide Ranging Ana-
lytics and Techniques

190
 Big Data Platform Explicit Teaching
and Application
Frameworks, A Big
Data Platform Mani-
festo, Use Cases for a
Big Data Platform
Definition, Dashboard Explicit Teaching Decision Tree Demonstration
Week 13 Types, Evolution of Learning
Dashboards, Layers of
Information
Dashboard Design, Explicit Teaching
Dashboard Design
Principles
Other Dashboard Ex- Explicit Teaching
amples, Display Me-
dia for Dashboards
Chart Overview, Sin- Explicit Teaching Dashboard Demonstration
Week 14 gular Components, design
Metrics, Metrics drive
behavior in a number
of ways
KaplanNorton Bal- Explicit Teaching
anced Scorecard, The
Rayport-Jaworski
Performance Dash-
board and Strategy
Framework
Introducing the R-J Explicit Teaching
Performance Dash-
board, Blueprint to
the R-J Performance
Dashboard
Building Reports, List Explicit Teaching Building a re- Demonstration
Week 15 Report, Crosstab Re- port with online
port, Chart Report, data
Map Report
Data group, sort and Explicit Teaching
Filters, add calcu-
lations to report,
Conditions and Ag-
gregations in Report,
Drilling in report
Run report – on Explicit Teaching
demand or schedule,
Charts, Chart Type –
Bar Chart, Line, Pie,
Area, Scatter

191
EXPERIMENTS:
1. Statistical Central Tendency Measures using Spread Sheet

2. Simple Data Visualization using Spread Sheet

3. Advanced Visualization using Spread Sheet

4. Data Visualization using PIVOT Table and Charts

5. Advanced Visualization using PIVOT Table and Charts

6. Statistical Central Tendency Measures using Python

7. Simple Data Visualization using Python

8. Advanced Data Visualization using Python

9. Building a dashboard report with online data

10. Web Scraping

TEXT BOOK(S):
1. Introduction to Data Analytics (IBM ICE Publications)

REFERENCES:
1. Big Data for Dummies,Judith Hurwitz, Alan Nugent, Fern Halper, Marcia Kauf-
man, Wiley Brand, 2013.

2. Analytics in a Big Data World, The Essential Guide to Data Science and its Ap-
plications,Bart Baesens, Wiley, First edition,2014.

3. Mining of Massive Datasets, Anand Rajaraman, Jeffrey D. Ullman, Cambridge

University Press New York, 2011.

4. Understanding Big Data- Paul C. Zikopoulos, Chris Eaton, McGraw-Hill, 2012

(eBook from IBM)

192
4.8 213CSE2305: DATA WAREHOUSING & MULTIDIMEN-
SIONAL MODELING

213CSE2305 DATA WAREHOUSING & MULTI- L T P X C

DIMENSIONAL MODELING
4 0 2 0 4
Pre-requisite : NIL
Course Category : Program Elective
Course Type : Integrated Course - Theory

COURSE OUTCOMES:
Upon successful completion of this course, students will be able to
CO1:Understand the fundamentals of data warehouse and its applications.
CO2:Design data warehouse with dimensional modelling and to apply the various OLAP
operations.
CO3:Analyze the different multidimensional modelling techniques.
CO4:Apply R-OLAP to different design technique and compare the performance.
CO5:Design MOLAP and analyze the various online data analysis with ROLAP.

MAPPING OF COURSE OUTCOMES WITH PO, PSO:

PO’S PSO’S
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 S M M S L
CO2 M S S M S L L L S M
CO3 S M S M M L L M M S L
CO4 S M S M M L L M M S M
CO5 M S S M S L L L S M

UNIT I: INTRODUCTION TO DATA WAREHOUSING Data Warehouse Ar-

chitectures, A perspective on decision support applications.

UNIT II: DATA WAREHOUSING AND MODELING An Introduction to Data

Warehouse Modeling, Differentiating the Warehousing model from the OLTP model,
Warehouse Modeling Approaches, OLAP – OnLine Analytical Processing, Basic OLAP
Operations.

UNIT III: MULTI-DIMENSIONAL MODELING – METHODOLOGY Re-

quirement Analysis, Requirements modeling, Terminologies in a Multi-dimension Model,
Multi-Dimensional Model Structures, Solution Validation Techniques, Detailed Dimen-
sion Modeling.

UNIT IV: NON-TEMPORAL DESIGN - R-OLAP R-OLAP and its design tech-
niques, Design techniques of an R-OLAP System, Dimension-Oriented Design techniques,

193
Fact-oriented Design Techniques, Utilize Cubing Services to improve R-OLAP and M-
OLAP performance, Cubing Services performance and scalability, Scalability, Cubing
Services security, Role-based security in Cubing Services.

UNIT V: NON-TEMPORAL DESIGN - M-OLAP IBM Cognos Architecture,

Sparse and Dense Dimensions – with Hyperion Essbase, MOLAP characteristics, Online
Data Analysis MOLAP and ROLAP.

TEXT BOOK(S):
1. Data Warehouse Multidimensional Modeling (IBM ICE Publications)

REFERENCE BOOK(S):
1. Data Warehousing and Mining :Concepts, Methodologies, Toolls and Applications
(Vol I to VI) by John Wang

2. The Data Warehouse Toolkit: The Definitive Guide to Dimensional Modeling, 3rd
Edition by Ralph Kimball and Margy Ross

3. Open Source Data Warehousing and Business Intelligence by Lakshman Bulusu

Auerach Pulications

4. Data Mining and Data Warehousing by Bharat Bhushan Agarwal and Sumit Prakash
,Tayal Laxmi Publications.

List of Lab Experiments:

1. Working with Kettle

2. Enhancing Data Integration and Warehouse Design

3. Surrogate Key, Processing a header and trailer text file and Data Allocation

4. Data Allocation Pentaho Data Integration example

5. Introduction to the Case Study - implementation of a data warehouse project for a

chain of home entertainment rental stores

6. Business Requirements for Rental and Sales Analysis

7. Business Requirements for Working Shifts

8. Business Requirements for Customers

194
4.9 213CSE2306: DATA VISUALIZATION FOR ANALYTICS

213CSE2306 DATA VISUALIZATION FOR AN- L T P X C

ALYTICS
4 0 2 0 4
Pre-requisite : NIL
Course Category : Program Elective
Course Type : Integrated Course - Theory

COURSE OUTCOMES:
Upon successful completion of this course, students will be able to
CO1:Understand the basic concepts of data analytics and visualization.
CO2:Analyze the different types of data analytics and charts.
CO3:Apply the different types of hypothesis testing using ANOVA.
CO4:Create visualization report, graphs and charts using tableau.
CO5:Design the scoreboards and dashboard for data analytics.

MAPPING OF COURSE OUTCOMES WITH PO, PSO:

PO’S PSO’S
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 S S M S L
CO2 S M M L M L L L M S L
CO3 S S S M M L L M L S L
CO4 S S S L M L L L S L
CO5 M S S M S L L L S L

UNIT I: Exploratory data analysis and visulaization Importance of data anal-

ysis, Descriptive vs predictive vs prescriptive, Overview of commonly used techniques,
Univariate analysis, Distributions, Outlier detection, Histograms, box plots, Bar charts,
Classification, Association and Segmentation models using SPSS.

UNIT II: Exploratory Data Analytics and Charts T-Test, Bi-variate Analysis,
Correlations, Crosstabs, Heatmaps, Stacked bars, Line charts, Multi-variate Analysis,
Trending analysis, Geographical analysis, Maps, Scatter plot, Muli line charts, Area
graph, Labs using R/Python/SPSS.

UNIT III: Hypothesis Testing Hypothesis Testing, T-test, Chi-square test, AN-
NOVA, Clustering Analysis, Cognitive Analytics, create reports based on relationships,
Labs using SPSS/R/Python.

UNIT IV: Visualizing Business Intelligence Representing data using graphs and
charts- Line chart, Bar, Box plot, Scatter chart, Building visualization reports using
tableau

195
UNIT V: Dashboard and Scorecards Scorecards and Dashboard creation for data
analytics, Dynamic reporting, Enhance user interaction.

TEXT BOOK(S):
1. Data Visualization for Analytics (IBM ICE Publications).

196
4.10 213CSE3305: DESCRIPTIVE ANALYTICS

213CSE3305 DESCRIPTIVE ANALYTICS L T P X C

4 0 2 0 4
Pre-requisite : NIL
Course Category : Program Elective
Course Type : Integrated Course - Theory

COURSE OUTCOMES:
Upon successful completion of this course, students will be able to
CO1:Understand the concepts of Business Intelligence(BI), BI Tools and BI Systems.
CO2:Evaluate the Business Intelligence(BI) Solutions based on Software Development
Kit.
CO3:Create a Business Intelligence projects and Analyze the Business Intelligence Solu-
tions.
CO4:Create a report for Business Intelligence Projects by using the operations of Intel-
ligence Techniques.
CO5:Evaluate the Business Intelligence(BI) Projects using projects estimation models.

MAPPING OF COURSE OUTCOMES WITH PO, PSO:

PO’S PSO’S
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 S S S S S L M S S L
CO2 S S S S S S M M S S M
CO3 S S S S S S M S S S
CO4 S S S S S S M S S M
CO5 S S S S S M S S S

UNIT I: Introduction to Business Intelligence Business Intelligence (BI), Scope

of BI solutions and their fitting into existing infrastructure, BI Components and archi-
tecture, BI Components, Future of Business Intelligence, SaaS and Cloud computing
techniques, Functional areas of BI tools, End user assumptions, Setting up data for BI,
Data warehouse, OLAP and advanced analytics, Supporting the requirements of senior
executives including performance management, Glossary of terms and their definitions
specific to the field of BI and BI systems.

UNIT II: Elements of Business Intelligence Solutions Business Query and Re-
porting, Reporting, Dashboards and Scorecards Development, Development, Scorecards,
Metadata models, Automated Tasks and Events, Mobile Business Intelligence, Software
development kit (SDK).

UNIT III: Building BI Project Stages of Business Intelligence Projects, Project

Tasks, Risk Management and Mitigation, Cost justifying BI solutions and measuring
success, BI Design and Development.

197
UNIT IV: Report Authoring Building Reports, Building a Report, Drill-up, Drill-
down Capabilities.

UNIT V:BI Deployment, Administration and Security Centralized versus De-

centralized Architecture, Phased and Incremental BI road map, Setting early expectations
and measuring the results, EPM (Enterprise performance Management), End-User Pro-
visos, OLAP Implementation, Implementation, Data Warehouse Architecture, Predictive
Analysis, Text Mining , Authentication, Authorization, Access Permissions, Group and
Roles, Single Sign-on (SSO), Data Backup and Restoring.

TEXT BOOK(S):
1. Descriptive Analytics (IBM ICE Publications).

1. Rajiv Sabherwal and Irma Becerra-Fernandez, Business Intelligence, Wiley Publi-

cations (2010)

2. Swain Scheps, Business Intelligence For Dummies, Wiley Publications (2011)

3. Arshad Khan, Business Intelligence Data Warehousing Simplified, Mercury learn-

ing information LLC (2012)

198
 4.11 213CSE3306: BIG DATA ANALYTICS

213CSE3306 Big Data Analytics L T P X C

4 0 2 0 4
Pre-requisite :NIL
Course Category :Program Elective
Course Type :Integrated Course - Theory

COURSE OBJECTIVES:
• Prepare the students to understand and gain the basic knowledge about big data
and its evolution.

• Gain knowledge about various frameworks techniques to handle big data like
Hive,and Hadoop Distributed file systems, Hbase, Impala and so on.

• Familiarizes the students with Sqoop and Pig for R programming concepts to per-
form data analytic tasks.

COURSE OUTCOMES:
CO1: Understand the key issues on big data, characteristics, data sources and the asso-
ciated applications in intelligent business and scientific computing.

CO2: Understand the frameworks of Hadoop and Map reduce and apply them to solve
complex problems.

CO3: Understand and apply the various Query Language for Hadoop to perform data
analytics.

CO4: Apply various Pig: Hadoop Reporting and Analysis tools to perform data analytics
operations.

CO5: Apply various Sqoop and R: Hadoop Reporting and Analysis tools to perform data
analytics operations.

MAPPING OF COURSE OUTCOMES WITH PO, PSO:

PO’S PSO’S
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 S M M M M S L
CO2 M M S L S M
CO3 S S S M
CO4 M S S M M M S M
CO5 M M M M S L S S

199
UNIT I: INTRODUCTION to BIG DATA ANALYTICS
Big Data overview, Structures of data, Big Data growth story, Big Data sources, Big Data
adoption drivers, Need of Big Data, Growth drivers for IT industry, Big Data: Definition,
Characteristics of Big Data, Units to measure Big Data, Big Data types, Benefits barrier
of Big Data analytics, Need of Big Data, Big Data process, Big Data framework, Big
Data platform and application frameworks, An example of Big Data platform in prac-
tice, A Big Data platform manifesto, Big Data technologies, Big Data tools, Big Data
analytics, Merging the traditional and Big Data approaches, More ways: Wide ranging
analytics and techniques, The 5 key Big Data use cases, Big Data usage, Use cases, Big
Data and complexity in health care, Use cases: Healthcare and life sciences, Use cases:
Transportation services, Use cases: Life insurance, IBM’s Big Data success story, Data
repository analyst view, Business drivers with examples, BI versus data studies, Archi-
tecture of modern analytics, Large data drivers, Method to study the evolving Big Data
environment, Latest Big Data ecosystem, Large data research explanations, Overview
of lifecycle data processing, Major functions for a good research, Information analytics
history and summary, Big Data resources, Tackling the question, Primary stakehold-
ers recognition, Analytical supporter interview, Original assumptions creation, Potential
databases detection, Preparing evidence for Big Databases, Analytical sandbox planning,
ETL execution, The data learning, Data conditioning, Visualize and verification, Popular
data preparation instruments, Step 3: Planning of models, Research on model planning
in industry verticals, Data exploration, Big Data: Choice of model, Popular model of Big
Data, Step 4: Model design, Popular model building tools, Step 5: Results contact, Step
6: Consumption, Key outputs from a successful analytics project, Case study: Digital
network for creativity and research (GINA), Step 1: Searching, Step 2: Preparing evi-
dence, Step 3: Planning of models, Step 4: Model design, Step 5: Results contact, Step
6: Consumption.

UNIT II: HADOOP FUNDAMENTALS

What is Hadoop? Examples of Hadoop in action: IBM Watson, Examples of Hadoop
in action, Introduction to Hadoop, Data distribution, Flat scalability, HDFS (Hadoop
Distributed File System), Name nodes, Data nodes, Data nodes with blocks of multiple
files with a replica of 2, The data is distributed across nodes at the time of loading,
MapReduce, An SQL example of MapReduce, The map function, Sort phase, The reduce
function, Combiner and partition functions, Streaming and pipes, MapReduce example:
Wordcount, MapReduce co-locating with HDFS, MapReduce processing, Speculative ex-
ecution, MapReduce: A tale of two APIs, MapReduce anatomy, What is HBase? NoSQL
technology, CAP theorem, ACID properties, Why HBase? Important things to keep
in mind, HBase vs. RDBMS, For example, Physical view in HBase, Logical to phys-
ical view, HBase components, HBase components definitions and roles, Characteristics
of HBase tables, HBase is a sorted multidimensional map, Row key design considera-
tions, Column family design considerations, Cluster configuration, HDFS configurations
settings, Hadoop site.xml for a single-node configuration, HDFS start, Interact with
HDFS, Example of put command, Retrieve data from HDFS, HDFS command reference,
HDFS permissions and security, HDFS additional tasks: Rebalancing blocks, Closing the
nodes, Check health file system, Load scenarios, Load solution using Flume, How Flume
works, Consolidation, Replicating and multiplexing, Apache Hadoop core components,
Why Hadoop Apache? Why is it easier for Hadoop than other distributed computing

200
systems? Where is Hadoop ideal for computing? Daemons of HDFS, Secondary name
node, Check-pointing by secondary name node, HDFS architecture, Daemons MapRe-
duce, YARN capital assignments, Node manager with three containers, Resource alloca-
tion on another node, Running tasks on m multiple containers, Resource allocation, Fair
scheduler per-queue properties, The map reducing job workflow, HDFS daemons with
strong disponibility, Height of the block, A file stored in a single block, Abstract block,
Name node keeps the block locations, Data flow in replication, Data pipeline in creat-
ing block replicas, Under reproduction, Name node metadata, Single namespace HDFS
architecture, HDFS federation architecture, Place of data, Replica placement on two
racks, HDFS network topology, Table: Block location class methods, How does HDFS
store, read, and write files? Data node pipeline in writing a file, Verification of check-
sum, Data collection and data analysis Hadoop cluster, Hadoop cluster in data storage
and processing, Master protocol application, MRv2 cluster operation, Current and ex-
isting APIs, Data serialization options, Apache Avro, Sequence and Avro reference files,
Apache Thrift, Thrift and protocol buffers comparison, Commands for HDFS shell file
system, Select MapReduce work main and importance forms, A mapper’s development
cycle and areducer’s function, The mapper’s life cycle in the latest API, A reducer’s
life-cycle in the old API, The reducer lifecycle in the latest API, Input clues to output
clues link, Input/Output Mapper sort, Key/Value types, Input Formats in the old API,
Mapper Key/Values Input/Output number, Reducer Input/Output number of K values,
Keys and attributes sorting, Combiners, Shuffle, Table: Parameters in compare meth-
ods, Table: Configuration properties to tune the sort and shuffle process, MapReduce
with shuffle and sort, Settings and submissions for MapReduce job, Table: FileInputFor-
mat¡K,V¿ class Static methods using JobConf, Settings and submissions for MapReduce
job, Combiner on reducer, Shuffle transfer number, Speculative performance, Data paths
in MapReduce task input and output, Data movement in a MapReduce job in the reduce
phase, Data flow provided by the InputFormat, Data flow provided by the OutputFor-
mat, InputFormats for File-Based Input formats, Table: InputFormats for File-Based In-
put formats, RecordReader, compression andsequence files, LineRecordReader example,
RecordReader with FileSplit, Built-In RecordReaders, Sequence files, SequenceFileIn-
putFormat classsubclasses, SequenceFile class nested classes and interfaces, Sequence
file header, Compression, Configuration properties for configuring, Codecs supported by
Hadoop, Commands for HDFS Shell file system, Administration commands.

UNIT III: QUERY LANGUAGES FOR HADOOP

What is JAQL? JSON: JavaScript Object Notation, JSON format, where does JAQL fit?
MapReduce overview, MapReduce and Hadoop, Starting up the JAQL server entering
JAQL in command line mode, JAQL and MapReduce, Let’s do this step by step, JAQL
and MapReduce: The rewrite engine and explain, JAQL schema, Data types, JAQL
basics, Arrays, Records, Operators, Lazy/late evaluation, Why materialized assignment
(:=) ? The -¿ operator, Expressions, Functions, Why JAQL core operators, Core op-
erators: Expand, Core operators: Group, Core operators: Group format (single), Core
operators: Group (single), Core operators: Understanding grouping, Core operators: Co-
groups, Core operators: Join outer joins, Core operators: Sort, JAQL SQL, JAQL SQL:
Case-sensitivity, JAQL and MapReduce basics, JAQL and MapReduce: Explain, JAQL
and MapReduce: Map, MapReduce: Job configuration, JAQL and MapReduce: Native
MR jobs, JAQL I/O, JAQL I/O adapter operations, JAQL I/O: I/O adapters, JAQL

201
I/O: I/O adapters arguments, JAQL I/O: Delimited files, JAQL I/O: Binary sequence
files, JAQL I/O: Text sequence files, JAQL I/O: Other adapters.

UNIT IV: PIG: HADOOP REPORTING AND ANALYSIS

What is Pig? Pig versus other tools, Executing Pig, First look at Pig data, Pig Latin
statement basics, Input, LOAD operator continued, Accessing data, Case sensitivity,
Field reference, Pig data types, Operators, Parameter substitution, Output, MapReduce
in Pig, Cascading in Pig, Apache hive and Pig, Pig data form, Complex data types, Map,
Schema, Casting, Casting error, Comparison operators, Identifiers, Boolean operators,
Invoking the grunt shell, Auto completion, Grunt shell flow, Pig operators and commands,
Regex in the file path, Store, Dump, Foreach generate, Flatten, New schema, Nested
block, Null, Comparison operators, Assert, SPLIT, Flatten, RANK, Order by, Using
the partitioner, Using a shell program, MapReduce program, CUBE, Rollup, Parameter
substitution, Advanced JOIN, Equi Joins, Inner Joins, Left outer join, Cogroup, CROSS
Join, Functions, Pig storage, HBase Storage, Apache Oozie, Types of Oozie jobs, Set a
value to a property, Scheduling a Pig script, Integrating with the workflow, Upload Files
to HDFS, Bundle, Oozie user interface.

UNIT V: SQOOP AND R: HADOOP REPORTING AND ANAL-

YSIS
What is Sqoop? Sqoop connection, Sqoop import, Sqoop import examples, Sqoop ex-
ports, Sqoop exports, Additional export information, Distributed systems, Sqoop com-
mand. What is open-source R? The R appeal: What attracts users? Companies currently
using R, what is the R programming language? Limitations of open-source R, Open source
R packages to boost performance, Challenges with running large-scale analytics, 3 key
capabilities in big R, Big R architecture, User experience for big R, what’s behind run-
ning big r’s scalable algorithms? Big R machine learning: Scalability and performance,
Simple Big R example.

15 WEEK COURSE PLAN

Course
Lecture (2 hours) Practical (2 hours)
Chart
Weeks
Topic Pedagogy Topic Pedagogy
Big Data overview, Explicit teaching HDFS Basic Demonstration
Week 1 Structures of data, commands
Big Data growth
story, Big Data
sources

202
 Big Data process, Big Explicit teaching HDFS Basic Demonstration
Data framework, Big command
Data platform and ap-
plication frameworks,
An example of Big
Data platform in prac-
tice
Big Data resources, Explicit teaching HDFS ad- Demonstration
Tackling the question, vanced co-
Primary stakeholders mands
recognition, Ana-
lytical supporter
interview, Original
assumptions creation,
Potential databases
detection, Prepar-
ing evidence for Big
Databases
Week 2 The data learning, drill and practice HDFS ad- Demonstration
Data conditioning, vanced co-
Visualize and ver- mands
ification, Popular
data preparation
instruments
Step 1: Searching, Explicit teaching HDFC com- Demonstration
Step 2: Preparing ev- mands to
idence, Step 3: Plan- handle unstruc-
ning of models, Step 4: tured datasets,
Model design, Step 5: HDFC com-
Results contact, Step mands to
6: Consumption. handle Semi-
unstructured
datasets (XML
files)
Hadoop in action: Explicit teaching Demonstration
IBM Watson, Exam-
ples of Hadoop in
action, Introduction
to Hadoop, Data
distribution, Flat
scalability, HDFS
(Hadoop Distributed
File System)

203
Week 3 MapReduce, An SQL Explicit teaching MapReduce Problem based
example of MapRe- Program – learning
duce, The map func- Word count,
tion, Sort phase, The MapReduce
reduce function, Com- Program –
biner and partition Find the
functions maximum tem-
perature of
city
MapReduce example: Explicit teaching
Wordcount, MapRe-
duce co-locating with
HDFS, MapReduce
processing, Spec-
ulative execution,
MapReduce: A tale of
two APIs, MapReduce
anatomy.
HDFS configurations Explicit teaching ”MapReduce
settings, Hadoop Program –
site.xml for a single- Weather Data
node configuration, Analysis
HDFS start, In-
teract with HDFS,
Example of put com-
mand, Retrieve data
from HDFS, HDFS
command reference,
HDFS permissions
and security, HDFS
additional tasks
Week 4 Daemons of HDFS, Explicit teaching Problem based
Secondary name learning
node, Check-pointing
by secondary name
node, HDFS archi-
tecture, Daemons
MapReduce, YARN
capital assignments
Resource allocation, drill and practice MapReduce
Fair scheduler per- Program –
queue properties, Aggregating
The map reducing text fields
job workflow, HDFS
daemons with strong
disponibility, Height
of the block

204
Week 5 Single namespace Explicit teaching Demonstration
HDFS architecture,
HDFS federation
architecture, Place
of data, Replica
placement on two
racks, HDFS network
topology
MapReduce with shuf- drill and practice
fle and sort, Settings
and submissions for
MapReduce job
Week 6 Data movement in Explicit teaching ”Hive com- Problem based
a MapReduce job mands Hive learning
in the reduce phase, Joins for
Data flow provided Datasets”
by the InputFormat,
Data flow provided
by the OutputFor-
mat, InputFormats
for File-Based Input
formats
JSON: JavaScript Ob-
ject Notation, JSON
format, where does
JAQL fit,Starting up
the JAQL server & en-
tering JAQL in com-
mand line mode
Week 7 JAQL and MapRe- Explicit teaching ” Hive Par- Problem based
duce, Let’s do this titioning for learning
step by step, JAQL Datasets Hive
and MapReduce: The Bucketing ”
rewrite engine and ex-
plain, JAQL schema,
Data types, JAQL ba-
sics, Arrays, Records,
Operators, Lazy/late
evaluation
Week 8 Core operators:
Co-groups, Core op-
erators: Join outer
joins, Core operators:
Sort, JAQL SQL,
JAQL SQL

205
 I/O adapters, JAQL drill and practice ”Hive Perfor- Problem based
I/O: I/O adapters ar- mance tuning learning
guments, JAQL I/O: Hive MapRe-
Delimited files, JAQL duce”
I/O: Binary sequence
files, JAQL I/O: Text
sequence files, JAQL
I/O: Other adapters.
Week 9 JSON: JavaScript Ob- Explicit teaching PIG commands
ject Notation, JSON
format, where does
JAQL fit Starting up
the JAQL server & en-
tering JAQL in com-
mand line mode
Sort, JAQL SQL, Explicit teaching PIG - Group
JAQL SQL: Case- By, Nested
sensitivity, JAQL Foreach, Join
and MapReduce
basics, JAQL and
MapReduce
Week 10 Pig: Hadoop Re- drill and practice PIG MapRe- Demonstration
porting and Analysis duce - word
What is Pig? Pig count
versus other tools,
Executing Pig,
Week 11 MapReduce in Pig, drill and practice ”Hive com-
Cascading in Pig, mands Hive
Apache hive and Pig Joins for
Datasets Hive
Partitioning for
Datasets”
First look at Pig data, Explicit teaching ”Hive Perfor-
Pig Latin statement mance tuning
basics Hive MapRe-
ducePIG
MapReduce -
word count ”
Week 12 Pig operators and drill and practice PIG - Twitter Demonstration
commands, Regex Data analysis
in the file path,
Store, Dump, Foreach
generate
Week 13 Sqoop connection, Explicit teaching SQOOP Oper- Demonstration
Sqoop import, Sqoop ations
import examples,
Sqoop exports

206
 R programming lan- Explicit teaching ”Flume - Senti-
guage? Limitations of mental analysis
open-source R, Open Apache Storm
source R packages to - Mobile Call
boost performanc Log Analyzer”
Week 14 Big R architecture, Explicit teaching
User experience for
big R, what’s behind
running big r’s scal-
able algorithms
Week 15 Big R machine learn- drill and practice MongoDB Op- Problem based
ing: Scalability and erations learning
performance, Simple
Big R example.

EXPERIMENTS:
1. HDFS commands – Basic

2. HDFS commands – Advance

3. HDFC commands to handle unstructured datasets

4. HDFC commands to handle Semi- unstructured datasets (XML files)

5. MapReduce Program – Word count

6. MapReduce Program – Find the maximum temperature of city

7. MapReduce Program – Weather Data Analysis

8. MapReduce Program – Aggregating text fields

9. Hive commands

10. Hive Joins for Datasets

11. Hive Partitioning for Datasets

12. Hive Bucketing

13. Hive Performance tuning

14. Hive MapReduce

15. PIG commands

16. PIG - Group By, Nested Foreach, Join

17. PIG MapReduce - word count

207
18. PIG - Twitter Data analysis

19. SQOOP Operations

20. Flume - Sentimental analysis

21. Apache Storm - Mobile Call Log Analyzer

22. MongoDB Operations

TEXT BOOK(S):
1. Introduction to Data Analytics (IBM ICE Publications)

REFERENCES:
1. Big Data for Dummies,Judith Hurwitz, Alan Nugent, Fern Halper, Marcia Kauf-
man, Wiley Brand, 2013.

2. Analytics in a Big Data World, The Essential Guide to Data Science and its Ap-
plications,Bart Baesens, Wiley, First edition,2014.

3. Mining of Massive Datasets, Anand Rajaraman, Jeffrey D. Ullman, Cambridge

University Press New York, 2011.

4. Understanding Big Data- Paul C. Zikopoulos, Chris Eaton, McGraw-Hill, 2012

(eBook from IBM)

208
4.12 213CSE4305: SOCIAL, WEB AND MOBILE ANALYT-
ICS

213CSE4305 SOCIAL, WEB AND MOBILE AN- L T P X C

ALYTICS
4 0 2 0 4
Pre-requisite : NIL
Course Category : Program Elective
Course Type : Integrated Course - Theory

COURSE OUTCOMES:
Upon successful completion of this course, students will be able to
CO1:Understand the basic knowledge about web and social analytics.
CO2:Evaluate the KPI metrics using soical media analytics.
CO3:Analyze the mobile analytics and social media analytics.
CO4:Create Social, web,mobile applications based on customer experience management
and content publisher operators.
CO5:Understand and analyze the various functionalities in social,web and mobile ana-
lytics.

MAPPING OF COURSE OUTCOMES WITH PO, PSO:

PO’S PSO’S
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 S M M S L
CO2 S M S M L L M L S M
CO3 S M L L M L S M
CO4 S S L M L L L L S
CO5 S M M S S

UNIT I: Introduction to Web Social Analytics and Relevant Data its collec-
tion Overview of web social media. Need of using analytics, Web analytics technical
requirements. Social media environment, Impact of social media on business, How to
leverage social media for better services, current analytics platforms, OpenSource vs
licensed platform, choosing right specifications optimal solution. Participating with peo-
ple centric approach, organizing for social media, Choosing focused Data sources Social
networks, collecting and understanding social media data, leverage qualitative data by
understanding what, why and how much, usability alternatives, web enabled emerging
user research, online surveys.

UNIT II: KPIs/ metrics and Manage Web Social media with Analytics Un-
derstand the discipline of social analytics, Aligning social objectives with business goals,
Identify common social business objectives, developing KPIs; Standard vs Critical met-
rics. Bounce rate, exit rate, conversion rate, engagement, strategically aligned KPIs,
Tactics to find out best web and social media metrics; moving from strategy to execution,

209
build scorecards dashboards to track KPIs. Measuring Macro micro conversions, Quan-
tify Economic value, measuring success for non-ecommerce and B2B websites, Explore
evaluate - Dashboard, Relationships, Sentiments, Evolving Topics, Reports, Content cre-
ation tracking, Competitive Intelligence analysis, website traffic analysis, search keyword
analysis, audience identification segment analysis, Optimizing social media strategy, So-
cial media enablement audit, Understand signals and potential

UNIT III: Future of Social Media Analytics, Monitoring and Introduction to

Mobile Analytics Mashing Up Data from Disparate Sources; Integrate solution to
share outcome with others, Overview, Web Analytics Vs Mobile Analytics, Social media
Analytics Vs Mobile analytics, Need of mobile analytics, Basics of mobile computing –
Smart phones, mobile browsers, Mobile applications, Bandwidth, transactions, sessions,
handset types operating systems, mobile operators their services, WAP gateway or
GGSN support, APNs or regional POPs support, Architecture components, mobile web-
services, overview of mobile cloud

UNIT IV:Mobile Customer Experience Management, Mobile Analytics for

Content Publishers Operators Mobile as next customer experience frontier, Cus-
tomers expectations, business impact criticality, Core metrics for deeper behavior anal-
ysis, Integration of different channels – SMS, Instant messaging, chatting, apps, HTML5
enabled sites on browsers for unique experience, Multi-chennal campaning optimization,
considerations for best mobile services, Location based media support, Mobile Hand-
set Analysis, Mobile Handset Screen Resolution - supported screen resolutions of mobile
handsets browsing site in terms of page views, visits and visitors, Mobile Operator Anal-
ysis - operator names and countries of subscribers browsing your site in terms of page
views, visits and visitors. The types of statistics reports –Bandwidth (total, average per
visit, total per file type), Transactions (average per visit, number of downloads, page view
breakdown), Sessions (entry page, average duration, click paths, referring search engine),
Subscribers (browser type, user agent, operating system), Operating system (iOS, An-
droid, Blackberry, etc), Mobile applications (YouTube, Facebook, Twitter, etc), Content
categorisation (Adult, Video, Social, Ad Networks, etc), Handsets (make, model, screen
resolution), Mobile Operator (country of origin, operator name), Geo Location (Visitor
location tracking, country of origin, RDNS lookup), Referrer tracking, Search term per-
formance, Specific visitor behaviour, Page views per visit by referrer/advert, Time spent
on site by referrer/advert.

UNIT V: Email marketing and Data Functionalities Logs users email address,
Cold callers report, Page views per annum, Data recording timeframe, Data archiving
timeframe, Historic comparison, Integration to client platforms through API, HTTPS
Support.

TEXT BOOK(S):
1. Social, Web and Mobile Analytics (IBM ICE Publications).

210
 STREAM: CYBER SECURITY AND FORENSICS
4.13 213CSE1302: INFORMATION SECURITY FUNDAMEN-
TALS

213CSE1302 INFORMATION SECURITY FUN- L T P X C

DAMENTALS
4 0 2 0 4
Pre-requisite : NIL
Course Category : Program Elective
Course Type : Integrated Course - Theory

COURSE OBJECTIVES:
• Understand basic concepts of Information Security.
• Learn about various domains under information security
• Enumerate various tools and techniques associated to information security
• Clarify its advantages and disadvantages

COURSE OUTCOMES:
CO1: Understand overview of information security, concepts, benefits, issues and method-
ology of cost-benefit analysis
CO2: Apply techniques and controls associated to cryptography and operations security
CO3: Recognize the scope of physical and network security, identify the threats, vulner-
abilities and categorizise the tools and techniques used for implementation.
CO4: Interpret the need and improtance of Operating System hardening, protection mech-
anisms and associated vulnerabilities.
CO5: Enumerate concepts of security audit, standards, governance, risk and compliance.

MAPPING OF COURSE OUTCOMES WITH PO, PSO:

PO’S PSO’S
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 S S S S L
CO2 S S S S M
CO3 S S S S S S S S S M
CO4 S S S S L
CO5 S S S S S S S S S L

UNIT I CIA TRIAD

Confidentiality, Integrity Availability, what is Information Security? Identification and
Authentication, Authorization and Access Control, Auditing and Accountability.

211
UNIT II CRYPTOGRAPHY AND OPERATIONS SECURITY
Modern Cryptography Tools, Protecting Data at rest, In motion, and in Use, Origins
of Operations Security, The Operations Security Process, Laws of Operations Security,
Operations Security in our Personal Lives.

UNIT III PHYSICAL SECURITY AND NETWORK SECU-

RITY
Introduction, Physical Security Controls, Protecting People, Data and Equipment. Pro-
tecting Networks, Protecting Network Traffic. Network Security Tools.

UNIT IV OPERATING SYSTEM AND APPLICATION SECU-

RITY
Operating System Hardening, Protecting Against Malware, Software Firewalls and Host
Intrusion Detection, Operating System Security Tools, Software Development Vulnera-
bilities, Web Security, Database Security, Application Security Tools.

INFORMATION SECURITY -AUDIT AND MONITORING,

INTELLIGENCE, COMPLIANCE, MANAGEMENT AND GOV-
ERNANCE
Change and Security Implications, System Models, Targets and Methods, Log Manage-
ment, Data Aggregation and Reduction, Notifications and Reporting, Monitoring and
Control Challenges, Auditing Standards, SAS 70 Audits, Sarbanes-Oxley, Addressing
Multiple Regulations for Information Security Technical Frameworks for IT Audits, In-
telligence and Compliance, Management and Governance.

TEXT BOOK(S):
1. Information Security Fundamentals (IBM ICE Publications)

212
 4.14 213CSE2309: IT PHYSICAL SECURITY AND SYSTEM
SECURITY

213CSE2309 IT PHYSICAL SECURITY AND L T P X C

SYSTEM SECURITY
4 0 2 0 4
Pre-requisite : NIL
Course Category : Program Elective
Course Type : Integrated Course - Theory

COURSE OBJECTIVES:
• To understand the physical security and vulnerability assessment.
• To understand the different strategies for security surveys and audit.
• To understand the various approaches to the physical security and Intrusion Detec-
tion System (IDS).
• To understand the video technology, bio metric characteristics, control standards
and fence standards.
• To understand the fire safety and standards and guidelines for global resources and
security personnel.

COURSE OUTCOMES:
CO1: Understand the importance of physical security, to relate between physical and
cyber security and perform vulnerability assessment.
CO2: Deep understanding of Physical Security layers, to know what plans and tools are
required for a particular environment, and perform survey and audit.
CO3: Understand the approaches to physical security, alarm and intrusion detection sys-
tem (IDS).
CO4: Enumerate methods employed to mitigate video technology, bio metrics, access
control and fence standards for ensuring the physical security.
CO5: Understand the meaning of fire safety inspection, to use the standards, regulations,
guidelines and compliance of security personnel to give the solution for future risks.

MAPPING OF COURSE OUTCOMES WITH PO, PSO:

PO’S PSO’S
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 S S S S L
CO2 S S S S M
CO3 S S S S S S S S S M
CO4 S S S S L
CO5 S S S S S S M M S L

213
UNIT I: PHYSICAL SECURITY OVERVIEW AND VULNER-
ABILITY ASSESSMENT
Importance of Physical Security, Relationship Between Physical and Cyber Security,
Guard Against Disgruntled Employees and Angry Former Employees, How Activists and
Corporate Foes Can Hurt You, Vandals Who Damage for Fun, Saboteurs Who Work
for Profit, Thieves and Spies Are Everywhere, Domestic Terrorists Are Still a Threat,
International Terrorist Are a Growing Threat, Physical Security for Natural Disasters, Se-
curity for Random Incidents, Steps to Improve Physical IT Security, Influence of Physical
Design - Defensible Space, Crime Prevention Through Environmental Design, Risk Man-
agement and the Vulnerability Assessment, Risk Assessment and the Vulnerability As-
sessment Process, Statistics and Quantitative Analysis, Vulnerability Process Overview,
Reporting and Using of Vulnerability Assessment, System Engineering and Vulnerability
Assessment.

UNIT II: SECURITY SURVEYS AND THE AUDIT

Overview, The best time to conduct the survey, Why conduct a security review, classi-
fication of survey recommendations, developing security points, nine points of security
concern, personality of the complex, positive and negative aspects of making recommen-
dations, crime analysis, key control, digital closed-circuit television, intrusion alarms,
lighting and security, other security aspects, security survey follow-up, residential se-
curity, home security checklist, top ten security threats, the audit. Site survey and
risk assessment, physical security survey - exterior physical characteristics: perimeter
grounds, plant security checklist , security officers checklist , office security checklist ,
home security checklist - exterior, doors, windows, general home security, miscellaneous,
bullet-resistant glazing for a secure workplace, bullet-resistant fiber glass wall panels,
bullet-resistant doors, bullet-resistant windows, window film.

UNIT III: APPROACHES TO PHYSICAL SECURITY, SECU-

RITY LIGHTING, ALARMS INTRUSION DETECTION SYS-
TEMS
Overview, levels of physical security, the value of planning, physical barriers, the secu-
rity plan. Protective physical barriers - perimeter entrances, barrier planning, combi-
nation locks, lock bodies, door lock types, strikes, attacks and countermeasures, locks
and the systems approach to security , safes, vaults, and accessories - choose the right
container, ul-rated combination locks, relocking devices, locking dials, lockable handles,
time locks, time-delay combination locks, alarmed combination locks, vision-restricting
and shielded dials, combination changing, safe burglaries, hidden combinations, overcom-
ing safe-opening problems , rating files, safes, and vaults. Illumination, types of lamps,
things needed to know about lighting, energy management, lighting definitions, light-
ing description, components of alarm systems, application, alarm equipment overhaul, a
smoke detectors, alarm certificate services - definitions, standards, fire classifications, use
of fire extinguishers, Vulnerability Assessment scanning tools: Nikto, Netsparker, W3AF,
Nmap, Nessus. .

214
UNIT IV: VIDEO TECHNOLOGY OVERVIEW, BIOMETRICS
CHARACTERISTICS, ACCESS CONTROL AND BADGES,
CRYPTOGRAPHY
Video system, camera function, scene illumination, scene characteristics, lenses, cameras,
transmission, switchers, quads and multiplexers, monitors, recorders, hard-copy video
printers, ancillary equipment, CCTV biometrics characteristics access control, designated
restricted areas, degree of security, considerations, employee screening, identification sys-
tem, id methods, mechanized/automated systems, card/badge specifications, visitor iden-
tification and control, visitors, enforcement measures, sign/countersign and code word,
duress code, access control rosters, control methods, security controls of packages, per-
sonal property, typical design example, Basics of Cryptographic concepts, Symmetric and
Asymmetric Cryptography, Hashing algorithms.

UNIT V: FIRE AND FIRE SAFETY INSPECTION, STAN-

DARDS, REGULATIONS, AND GUIDELINES, COMPLIANCE
AND YOUR SECURITY PROGRAM
How fire spreads? Four ways to put out a fire, classifying fire, ul standard 217, water
supply for sprinklers and tanks. Fire safety inspection - administrative and planning
phase, general physical inspection phase, extinguisher inspection phase, stand pipe, fire
hose, and control valve inspection phase, sprinkler system inspection phase, hazardous
materials inspection phase, alarm system inspection phase. Introduction, standards, reg-
ulations, guidelines, managing compliance, resources, Number and function of guards,
uniform, firearms, vehicles, guardhouses, communication, rounds, logbooks, hazard as-
sessment, command structure, emergency drills crisis management. Including Global
Resources Security personnel - Introduction - Network security, Hardware/Downloadable
devices/Data storage, Physical security. Information Technology (IT) Security - Software
updates to reduce vulnerabilities, Firewall Account Management - Authentication, One
Time passwords. Host security and Host security (System threats and Denial of Service
attack) - System Threats - Antivirus software, Worms, Trojan horse, Root kits, Port
Scanning, Denial of service attack, Distributed Denial of Service attack

EXPERIMENTS:
1. Installation steps of micro soft baseline security analyzer

2. How to scan a computer by name

3. How to scan a computer by ip address

4. How to scan multiple computers by ip address

5. How to scan multiple computers by domain

6. How to view existing security scan reports

7. Installation steps of tripwire

8. How to start the secure check scanning

215
 9. About the tool window

10. Securecheq summary report

11. How system aspects covered in scan

12. Securecheq test report

TEXT BOOK(S):
1. IT System Security Physical Security (IBM ICE Publications).

216
 4.15 213CSE3309: IT APPLICATION SECURITY

213CSE3309 IT APPLICATION SECURITY L T P X C

4 0 2 0 4
Pre-requisite : NIL
Course Category : Program Elective
Course Type : Integrated Course - Theory

COURSE OBJECTIVES:
• To understand the software development methodology and application security.

• To design the input validation strategies and protect sensitive data.

• To develop the effective strategies of authentication and authorization.

• To design an application’s configuration management features and user session.

• To develop the cryptography, parameter manipulation prevention, exception man-

agement and audit, logging considerations.

COURSE OUTCOMES:
CO1: Understand the software development and applications with the help of program-
ming and secure software principles.

CO2: Develop the solutions for input validation and sensitive data for the different appli-
cations.

CO3: Understand the various approaches for the authentication and authorization process
of the application security.

CO4: Understand the different features of configuration and session management.

CO5: Understand the various approaches for cryptography, parameter manipulation and
exception management.

MAPPING OF COURSE OUTCOMES WITH PO, PSO:

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

217
UNIT I: INTRODUCTION TO SOFTWARE DEVELOPMENT
APPLICATION SECURITY
Introduction to software development application, Basics of programming languages,
Compiled versus interpreted, Program utilities, Programming concepts, Distributed pro-
gramming, Threats and malware, Importance of software development life cycle, Software
development methods, Adherence to secure software development principles, Web appli-
cation security principles, Application design development security, Environment and
controls, Essence of secure software development, Auditing and assurance mechanisms.

UNIT II: INTRODUCTION TO INPUT VALIDATION SEN-

SITIVE DATA
Introduction to input validation sensitive data, Implementation of input validation, Prac-
tical solutions Input validation vulnerability, Buffer overflow, Cross-site scripting, SQL
injection, Canonicalization, Sensitive data, Sensitive data access, Sensitive data in stor-
age, Information disclosure, Data tampering, Installation of OWASP BWA application,
Need for OWASP BWA, Burp Suite, Wire Shark.

UNIT III: INTRODUCTION TO AUTHENTICATION AU-

THORIZATION
Introduction to authentication authorization, Network eavesdropping, Brute force at-
tack, Dictionary attack, Cookie replay attack, Credential theft, Elevation of privilege,
Basics of authorization, Data tampering, Luring attack, Phishing attack, File inclusion
vulnerability, Remote file inclusion and Cross site request forgery.

UNIT IV: INTRODUCTION TO CONFIGURATION MAN-

AGEMENT SESSION MANAGEMENT
Introduction to configuration management session management, Unauthorized access to
administration interfaces, Unauthorized access to configuration stores, Retrieval of clear
text configuration data, Lack of individual accountability, Over-privileged process and
service accounts, Basics of Session Management, Hijacking attack, Session replay attack,
Man in the middle attack.

UNIT V: INTRODUCTION TO CRYPTOGRAPHY, PARAM-

ETER MANIPULATION EXCEPTION MANAGEMENT
Introduction, Poor Key Generation or Key Management, Weak or Custom Encryption,
Basics of Parameter Manipulation, Cookie Manipulation, HTTP Header Manipulation,
Basics of Exception Management, Denial of Service. Auditing Logging, Countermeasures
- Introduction to Auditing Logging, Countermeasures, Basic Countermeasures.

EXPERIMENTS:
1. Scanning the target

218
 2. NMAP

3. Metasploit framework

4. Wire shark

5. HTTP basics

6. Burp Suite

7. OWASP installation

8. Cross site Scripting

9. HTML injection

10. Login Page SQL injection

11. File inclusion vulnerability

12. RFI Remote file inclusion

13. Path traversal attack or Directory browsing attack

14. CSRF Cross Site Request Forgery

15. Buffer overflow

16. Captcha testing

TEXT BOOK(S):
1. IT Application Security (IBM ICE Publications)

219
4.16 213CSE4307: DIGITAL FORENSICS

213CSE3306 DIGITAL FORENSICS L T P X C

4 0 2 0 4
Pre-requisite : NIL
Course Category : Program Elective
Course Type : Integrated Course - Theory

COURSE OUTCOMES:
Upon successful completion of this course, students will be able to
CO1:Understand computer forensics and apply different forensics software to verify in-
cidents and recover data.
CO2:Analyze the different network internet forensics techniques and apply suitable foren-
sics techniques to email, messenger and browser.
CO3:Create legal documents of different forensics performed on various platforms.
CO4:Understand mobile forensics and apply mobile forensics on different mobile plat-
forms and also understand forensics on digital camera and apply suitable steganography
tools.
CO5:Analyze various operation systems malwares and apply suitable reverse engineering
tools and techniques.
CO6:Create solutions for real time applications by using suitable digital forensics tech-
niques.
CO7:Implement various forensics techniques in an efficient manner.

MAPPING OF COURSE OUTCOMES WITH PO, PSO:

PO’S PSO’S
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 S S S M M S L
CO2 S S S M M S L
CO3 S S S M M S L
CO4 S S S M M S M
CO5 S S S M M S L
CO6 S S S M S L L M M M L M S M
CO7 S S S M S L L L M S L M S S

UNIT I: Computer Forensics Standard Procedure, Incident Verification, System

identification, Recovery of Erased and damaged data, Disk imaging and preservation,
Data encryption and compression, Automated search techniques, Forensic software

UNIT II: Network Internet Forensics Tracking network traffic, Reviewing Net-
work Logs, Tools, Performing Live Acquisitions, Order of volatility, Standard Procedure,
Internet World wide web threats ( Email, Chat-rooms, Search Engines, Hacking illegal
access, Obscene and indecent transmission, Extortion threats), Domain Name Owner-
ship Investigation, Reconstructing Past Internet Activities and Events, Email Forensics:
E-mail Analysis, Email Headers and Spoofing, Laws Against Email Crime. Messenger

220
Forensics: AOL, Yahoo, MSN, and Chats, Browser Forensics: Analyzing Cache and
Temporary Internet Files, Cookie Storage and Analysis, Web Browsing Activity Recon-
struction.

UNIT III: Forensic Investigation, Evidence Presentation and Legal aspects

of Digital Forensics Authorization to collect the evidence, Acquisition of evidence,
Authentication of the evidence, Analysis of the evidence, reporting on the findings, Tes-
timony, Laws regulations - Information Technology Act, Giving evidence in court

UNIT IV: Mobile Memory Forensics, Steganography Collecting and Analyzing

Cell Phone, PDA, Blackberry, iPhone, iPod, iPad and MP3 Evidence, Analyzing CD,
DVD, Tape Drives, USB, Flash Memory, and other Storage Devices, Digital Camera
Forensics, Reconstructing Users Activities, Recovering and Reconstructing Deleted Data,
Steganography Tools and Tricks, Data Hiding, Data Recovery, Memory Data Collection
and Examination Extracting and Examining Processes.

UNIT V:Malware Analysis Analyzing Live Windows System for Malware, Analyz-
ing Live Linux System for Malware, Analyzing Physical and Process Memory Dumps for
Malware, Discovering and Extracting Malware from Windows Systems, Discovering and
Extracting Malware from Linux Systems, Rootkits and Rootkit Detection and Recovery,
Reverse Engineering Tools and Techniques

TEXT BOOK(S):
1. Digital Forensics(IBM ICE Publications).

221
4.17 213CSE4308: IT NETWORK SECURITY

213CSE3307 IT NETWORK SECURITY L T P X C

4 0 2 0 4
Pre-requisite : NIL
Course Category : Program Elective
Course Type : Integrated Course - Theory

COURSE OUTCOMES:
Upon successful completion of this course, students will be able to
CO1:Understand network standards, layers and its characteristics, LAN/WAN technolo-
gies, topologies and protocols.
CO2:Apply various network protocols for securing communication in LAN/WAN.
CO3:Understand various network devices in Internet, intranet, Extranet components
and its security solutions.
CO4:Analyze various network services for remote access, telecommuting and WAN tech-
nologies.
CO5:Apply network management tools for monitoring and penetration.

MAPPING OF COURSE OUTCOMES WITH PO, PSO:

PO’S PSO’S
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 S S S S S
CO2 S S S M M S S
CO3 S S S S S
CO4 S S M S S L
CO5 S S S S S M M S M M S S

UNIT I: Securing Communications and LAN/WAN Networks-I International

Organization for Standardization/Open Systems Interconnection (ISO/OSI) Layers and
Characteristics, LANs vs. WANs, Network Cabling, Wireless, LAN Technologies (Ether-
net, Token Ring, and FDDI), Network Topologies, Network Protocols

UNIT II: Securing Communications and LAN/WAN Networks-II Lan Man-

ager / Microsoft Network / NT Domains, TCP/IP, Weaknesses, Routing Protocols, PPP
(Point to Point Protocol), DNS (Domain Name Service), NIS, NIS + (Network Infor-
mation Service), DHCP (Dynamic Host Configuration Protocol), NFS (Network File
System), Appletalk, SNA, IPX/SPX, OSI protocols, X.25, DECNET, Telephone/Fax
Network.

UNIT III: Physical network types & Internet/Intranet/Extranet components

Ethernet, Leased lines, FDDI, ATM, Hubs, Bridges, Routers, Modems, Gateways, Fire-
walls, Internet Email Gateway, Permission for external connections, Remote Access Secu-
rity Management, Network and Protocol Security Mechanisms (VPN, Secure Communica-
tions Protocols, E-Mail Security Solutions, Dial-Up Protocols, Authentication Protocols)

222
UNIT IV: Network Services Remote Access and Telecommuting Techniques (Frame
Relay), Other WAN Technologies (SMDS, X.25, ATM, HSSI, SDLC, HDLC, ISDN),
Avoiding Single Points of Failure (Redundant Servers, Failover, RAID)

UNIT V: Network Management / Monitoring and Penetration Testing IBM

Netview, HP Openview, Sun NetManager. Introduction to Penetration Testing

TEXT BOOK(S):
1. IT Network Security (IBM ICE Publications).

223
4.18 213CSE4309: IT DATA SECURITY

213CSE3308 IT DATA SECURITY L T P X C

4 0 2 0 4
Pre-requisite : NIL
Course Category : Program Elective
Course Type : Integrated Course - Theory

COURSE OUTCOMES:
Upon successful completion of this course, students will be able to
CO1:Understand the various factors and processes for the data security threat processes.
CO2:Understand the different security techniques for handling the network and web ap-
plications.
CO3:Apply the various techniques to measure the data security threats.
CO4:Analyze the various techniques for ensuring the security threats in database and
web applications.
CO5:Understand the different counter measures for network and web applications.
CO6:Develop the various threat technique for the network applications.
CO7:Implement the threat techniques for wireless network and bluetooth applications.

MAPPING OF COURSE OUTCOMES WITH PO, PSO:

PO’S PSO’S
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 S M M M S L
CO2 S M M M S L
CO3 S S S M S S L
CO4 S S S M S S L
CO5 S M S M S L
CO6 S S S S S M M L M L S S S L
CO7 S S S S S M L L M L S S S L

UNIT I: Data Security Threats-I Data security – background, Data security – a

need, Data security – its importance, Factors for implementing a robust data security,
Data security processes, Data security threats, Network Driven Threats to Data Security,
Phishing, Identity Theft.

UNIT II: Data Security Threats-II More Network based Threat types, Crypto-
graphic Threats, Threats to database security, Banking frauds, Threats to web- applica-
tion, Physical security threats, Hacking and social engineering, Threats – wireless net-
work, Threats – bluetooth devices, Threats in Current technological environment, Data
security - benefits.

UNIT III: Data Security Threat techniques-I Threat techniques - an introduc-

tion, Malware threat techniques, Network based threat techniques - botnet, Network

224
Based Threat Techniques - PHISHING, Network Based Threat Techniques - SNIFFING,
Network Based Threat Techniques – PASSWORD ATTACK, Transmission interception.

UNIT IV: Data Security Threat techniques-II Cryptographic Threat Techniques,

Database Threat Techniques, Threat technique - sqlinsjection, More Database Threat
Techniques, Banking Fraud Techniques, Web-application Threat Techniques, Web-application
Threat Techniques – More, Cross-site Scripting Forgery - XSS, Physical security threat
techniques, Wireless network threat techniques, DoS attack, Bluetooth device threat
techniques.

UNIT V: Countermeasures Introduction to Countermeasures, Importance of data

protection, Evolution of mitigation techniques, Countermeasures, Malware counter mea-
sures, Network threats - counter measures, Cryptography threats - counter measures,
Database threats - countermeasures, Banking frauds - countermeasures, Web application
- countermeasures, Physical barrier: - a countermeasure for Physical Threat, Mantrap
and perimeter security, Hardware security, Security zone, Partitioning, Biometric and
power system, Emi shielding, Hot and cold aisles, Fire suppression, Natural and man-
made countermeasures, Insider threat countermeasures, Hacking and social networking -
countermeasures, Wireless Network Security Countermeasures, Bluetooth Device Coun-
termeasures.

TEXT BOOK(S):
1. IT Data Security (IBM ICE Publications).

REFERENCE BOOK(S):
1. Law of Data Security and Investigations - SANS
2. Security Data Visualization: Graphical Techniques for Network Analysis - Greg
Conti
3. Web Security, Privacy Commerce - Simson Garfinkel, Gene Spafford
4. SANS GIAC Certification: Security Essentials Toolkit (GSEC) - Eric Cole, Mathew
Newfield, John M. Millican
5. Information Security Resources - SANS
6. Designing Storage Area Networks – Second Edition – Tom Clark

REFERENCE URL(S):
1. http://ptac.ed.gov/sites/default/files/issue-brief-threats-to-your-data.pdf
2. https://www.cs.purdue.edu/homes/bertino/sdm13.pdf
3. https://ico.org.uk/media/for-organisations/documents/1575/it security practical guide.pdf
4. https://www.ncsc.gov.uk/content/files/protected files/guidance files/Cloud-computing-
and-data-security.pdf
5. https://www-03.ibm.com/software/sla/sladb.nsf/pdf/KUP12494/$file/KUP12494USEN.pdf

225
4.19 213CSE4310: ETHICAL HACKING & PENETRATION
TESTING

213CSE4310 ETHICAL HACKING & PENE- L T P X C

TRATION TESTING
4 0 2 0 4
Pre-requisite : NIL
Course Category : Program Elective
Course Type : Integrated Course - Theory

COURSE OUTCOMES:
Upon successful completion of this course, students will be able to
CO1:Understand the hacking mechanism for different application sources.
CO2:Understand the various security and risk management techniques for the develop-
ment of applications.
CO3:Apply the various techniques for evaluating the vulnerability assessment and pen-
etration testing.
CO4:Understand the open source resources for developing attacks using penetration test-
ing tool.
CO5:Develop the web applcation with considereing the various security issues.
CO6:Implement the various tools for evaluating the vulnerabilty assessment process.
CO7:Develop the open source attacks with the help of peneration testing tools.

MAPPING OF COURSE OUTCOMES WITH PO, PSO:

PO’S PSO’S
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 S S M M S M
CO2 S M M M S L
CO3 S S S M S S L
CO4 S M M S S L
CO5 S S S M S S S
CO6 S S S S S M L L M L S S S M
CO7 S S S S S M M L M L S S S S

UNIT I: Introduction to Hacking Introduction, Hacking, Motives, Types of Hack-

ers, Sources of Interest – Internet, Mobile, Cloud, ATM, Types of Online Crimes , Brief
introduction to National and International Laws specific to hacking and accessing third
party asset, Information Technology Act.

UNIT II: Understanding Security and Risk Management Introduction, Identi-

fying Threats, Worms, Virus, Trojans, Operating System Threats, Web Applications and
Databases threats, Network Threats, Social Engineering, Understanding Environment
gathering information, Installing and Setting up your System and tools.

226
UNIT III: Vulnerability Assessment and Penetration Testing (VAPT) Un-
derstanding Vulnerability, Consequences of Vulnerabilities, Web Application attack and
Audit Frameworks, Executing tools to attack the defence, (List of tools related to Attack
will be compiled into the material to cover) Manual Attacks and Automated Attacks.

UNIT IV: Open source resources for Attacks – Penetration Testing Tools
Package Management on VM Instance for Penetration testing, installing tools and addi-
tional components for hacking remote systems, Wi-Fi, Stress Testing, sniffing and spoof-
ing, password and miscellaneous tools, Tools alone cannot make am attacker a Hacker.

UNIT V: Setting up a web application with exploits Introduction to Web Ap-

plication with security issues, identifying attack surface, planning the tools and attacking
the site, Hacking demonstration and Reporting attacks and vulnerability, Reporting the
Vulnerability and recommendation for fixing.

TEXT BOOK(S):
1. Ethical Hacking and Penetration Testing (IBM ICE Publications).

227
 STREAM: INTERNET OF THINGS AND SMART
CITY
4.20 213CSE1304: INTRODUCTION TO INTERNET OF THINGS

213CSE1304 INTRODUCTION TO INTERNET L T P X C

OF THINGS
4 0 2 0 4
Pre-requisite :NIL
Course Category :Program Elective
Course Type :Integrated Course - Theory

COURSE OBJECTIVES:
• To provide students with an overview of the concepts and fundamentals of internet
of things.

• To learn the importance of communication standards in the selection, creation,

integration and administration of an IoT.

• To understand the concept of IoT security framework and the procedure of access
control

COURSE OUTCOMES:
CO1: Inspect the basics of internet of things and its technologies

CO2: Understand the applications, system and networks in IoT terminology.

CO3: Analyse the design of IoT with appropriate hardwares, softwares and sensor devices

CO4: Understand the various communication technologies in IoT

CO5: Understand the security standards in IoT

MAPPING OF COURSE OUTCOMES WITH PO, PSO:

PO’S PSO’S
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 S M S
CO2 S M S
CO3 S S L L S
CO4 M S S L S
CO5 S S S

228
UNIT I: INTRODUCTION TO IOT TECHNOLOGIES
IOT Concepts, Introduction to IOT Communications, Telemetry vs IOT, Applications of
IOT Communications, People, Processes and Devices, Automation, asset management,
telemetry, transportation, telematics. Telemetry and Telemetric; Report location, lo-
gistics, tracking and remote assistance; Next generation kiosks, self-service technology;
Cellular IOT connectivity services

UNIT II: IOT APPLICATIONS, SYSTEMS AND NETWORKS

IOT Verticals; IOT Hosted Services; IOT Application development.; IOT Connectivity;
IOT Software providers, Study of RF Wireless Sensors; Wireless networks; Computer
Connected to Internet; Network Devices; Device configuration and management; Ex-
change information in real time without human intervention.

UNIT III - IOT DESIGN AND SYSTEM ENGINEERING

Discuss IOT Requirements; Hardware and Software; Study of IOT Sensors; Tagging and
Tracking; Embedded Products; IOT Design; (U) SIM Card Technology; IOT Connectivity
and Management; IOT Security and IOT Communication.

UNIT IV: IOT COMMUNICATION TECHNOLOGIES

Discuss Wireless Sensor Networking (WSN); Cellular Machine-to- Machine (M2M) appli-
cation networks; Software for M2M Applications, Hardware, IP Based Cellular Networks
and 3G, 4G.

UNIT V: IOT SECURITY

Discuss Security & Trust M2M Communications; Secure Communications; M2M Security
Framework; Securing Data input/output and internet communication.

15 WEEK COURSE PLAN

Week Lecture (4 hours) Pedagogy Practical (2 pedagogy

hours)
Week 1 IOT Concepts, Intro- Explicit Arduino Hard- Demonstration
duction to IOT Com- Teaching ware and Its
munications,Telemetry Types, Configura-
vs IOT, Applications of tion
IOT Communications,
People,Processes and De-
vices, Automation, asset
management

229
Week 2 telemetry, transportation, Explicit Arduino IDE Demonstration
telematics, Telemetry and Teaching Installation and
Telemetric,Report location, Configuring Ar-
logistics, tracking and re- duino board with
mote assistance Arduino IDE
Week 3 Next generation kiosks, self- Explicit Basic Program- Demonstration
service technology, Cellular Teaching ming in Ar-
IOT connectivity services duino - pinMode,
digitalRead,
digitalWrite,
analogRead
Week 4 Unit II - IOT APPLICA- Explicit Serial commu- Demonstration
TIONS, SYSTEMS AND Teaching nication, Serial
NETWORKS IOT Verti- monitor concept
cals; IOT Hosted Services; - Serial.begin,
IOT Application develop- Serial.print
ment, IOT Connectivity;
IOT Software providers,
Week 5 Study of RF Wireless Sen- Explicit data types and de- Demonstration
sors; Wireless networks, Teaching lay concept - data
Computer Connected to In- types, delay, mil-
ternet; Network Devices lis, break
Week 6 Device configuration and Explicit Condition State- Demonstration
management; Exchange in- Teaching ment - if, else, el-
formation in real time with- seif
out human intervention
Week 7 UNIT III - IOT DESIGN Explicit Control State- Demonstration
AND SYSTEM ENGI- Teaching ment - for loop,
NEERING Discuss IOT while loop and
Requirements; Hardware switch cases
and Software, Study of IOT
Sensors
Week 8 Tagging and Tracking; Em- Explicit Blinking a LED Demonstration
bedded Products, IOT De- Teaching
sign; (U) SIM Card Tech-
nology
Week 9 IOT Connectivity and Man- Explicit Blink Multiple Demonstration
agement, IOT Security and Teaching LEDs – Sequen-
IOT Communication tial and Parallel
Week 10 UNIT IV - IOT COMMU- Explicit Blink Multiple Demonstration
NICATION TECHNOLO- Teaching LEDs – Sequen-
GIES Discuss Wireless tial and Parallel
Sensor Networking (WSN), Using Conditional
Cellular Machine-to- Ma- Loop
chine (M2M) application
networks

230
Week 11 Software for M2M Applica- Explicit Blink Multiple Demonstration
tions, Hardware, IP Based Teaching LEDs – Sequen-
Cellular Networks tial and Parallel
Using Array
Week 12 3G, 4G Explicit Blinking Tri- Demonstration
Teaching color(RGB) LED,
Blinking Tri-
color(RGB) LED
Using Switch Case
Week 13 UNIT V - IOT SECURITY Explicit PUSH Button Demonstration
Discuss Security and Trust Teaching Control
M2M Communications, Se-
cure Communications
Week 14 M2M Security Framework, Explicit Potentiometer Demonstration
Securing Data input/output Teaching Control, Bright-
ness Control of
LED Using PWM
Week 15 Internet communication Explicit Seven Segment Demonstration
Teaching Display and
Design of Counter

EXPERIMENTS:
1. Study of Arduino Hardware and Its Types, Configuration

2. Arduino IDE Installation and Configuring Arduino board with Arduino IDE

3. Basic Programming in Arduino - pinMode, digitalRead, digitalWrite, analogRead,

Serial communication, Serial monitor concept - Serial.begin, Serial.print, data types
and delay concept - data types, delay, millis, break, Condition Statement - if, else,
elseif, Control Statement - for loop, while loop and switch cases

4. Arduino first program - Blinking a LED

5. Blink Multiple LEDs – Sequential and Parallel

6. Blink Multiple LEDs – Sequential and Parallel Using Conditional Loop

7. Blink Multiple LEDs – Sequential and Parallel Using Array

8. Blinking Tricolor(RGB) LED,

9. Blinking Tricolor(RGB) LED Using Switch Case

10. PUSH Button Control

11. Potentiometer Control.

12. Brightness Control of LED Using PWM

231
13. Interfacing Seven Segment Display

14. Design of Counter

TEXT BOOK(S):
1. Introduction to Internet Of Things(IBM ICE Publication)

REFERENCES:
1. Learning Internet of Things, by Peter Waher, Kindle Edition, 2015.

2. Internet of Things, by Jeeva Jose , Kindle Edition, 2018.

3. Internet of Things: A Hands-On Approach Paperback – 2015, by ArsheepBahga

and Vijay Madisetti, Orient Blackswan Private Limited.

232
 4.21 213CSE3310–INTRODUCTION TO SENSOR TECHNOL-
OGY AND INSTRUMENTATION

213CSE3310 INTRODUCTION TO SENSOR L T P X C

TECHNOLOGY AND INSTRU-
MENTATION
4 0 2 0 4
Pre-requisite :NIL
Course Category :Program Elective
Course Type :Integrated Course - Theory

COURSE OBJECTIVES:
• To understand the working principles of basic electronics components

• To provide students with an overview and the importance of sensors and actuators.

• To understand the concept of data acquisition system with real time applications

COURSE OUTCOMES:
CO1: Inspect the basic properties of resistance, capacitance and inductance towards in-
ternet of things and its technologies

CO2: Understand the working principles of amplifier circuits and its classifications

CO3: Analyze the different types of sensor and its applications

CO4: Understand the basic idea of sensor based data acquisition system

CO5: Examine the different types of actuators

CO6: Design the various applications using sensors

CO7: Design the various applications using actuators

MAPPING OF COURSE OUTCOMES WITH PO, PSO:

PO’S PSO’S
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 S M S
CO2 S M S
CO3 S S L S L S
CO4 M S L L S
CO5 S L S S
CO6 L M S S S S M L S
CO7 L M S S S S M L S

233
UNIT I: RESISTANCE AND CAPACITANCE
Resistance, Ohm’s Law, Kirchhoff’s Law, Capacitance, Induction, Thermoelectric Effects,
Types of thermoelectric effects, See-beck Effect, Pettier Effect, Thomson Effect, Piezo-
electric Effect, Hall Effect, Photoelectric Effect, Temperature and Thermal Properties of
Materials, Types of temperature sensors, Electro-mechanical, DynamicModels of Sensor
Elements, Mechanical Elements, Thermal Elements, Electrical Elements.

UNIT II: AMPLIFIER CIRCUITS

Amplifier circuits, Magnetic amplifier, Transistor amplifier, Voltage amplifier and power
amplifier, Operational amplifier, Voltage Follower (or Unity Gain Buffer), Bridgecircuits,
Analog-to- digital converters, A-to-DConversionMethods –Integrating(Dual Slope) ADC,
Noise in sensors and circuits, Internal noise sources, Low-power sensors, Powering Sensors,
Batteries for Low-Power Sensors.

UNIT III: SENSORS

Sensors, Occupancy and Motion Detectors, Motion Detectors, Occupancy Detectors,
Force Sensors, Strain Sensors, Tactile sensors, Pressure sensors,Pressure SensorDesigns,
Chemicalsensors,Temperature Sensors.

UNIT IV: DATA ACQUISITION IN SENSORS

Introduction to data acquisition in sensors, Data Acquisition System,Sensors, Differ-
ent Types of Sensors, need of sensors, DAQ device, Key MeasurementComponents of a
DAQ Device, Computer Bus, Introduction to SCADA systems, SCADA requirements,
Supervisory computers, Programmable logic controllers, Communication infrastructure,
PLC/RTU programming, PLC commercial integration, SCADA Architectures, SCADA
architecture development, Monolithic SCADA Systems, Distributed SCADA systems,
Networked SCADA Systems, Internet of things, Functions of SCADA, Real-Time Moni-
toring and Control using SCADA, Applications of SCADA, Benefits of SCADA, Schedul-
ing, Classification of scheduling, On-line Scheduling, fixed versus Dynamic Priority Al-
gorithms, Rate-Monotonic, Deadline-monotonic priority, Dynamic- Priority Algorithms.

UNIT V: ACTUATORS
Introduction to actuators, Types of Actuator, Electromagnetics, Electromagnetic Force,
Solenoid, Voice Coil, DC Motor, DC Motor: Types, Brushless DC Motor, AC Motor: Ro-
tating magnetic field, AC Motor: Synchronous Motor, AC Motor: Three-Phase induction
motor,AC Motor: Induction motor, Stepper motor, Solid State Switches.

15 WEEK COURSE PLAN

Week Lecture (4 hours) Pedagogy Practical (2 pedagogy

hours)

234
Week 1 UNIT I – RESISTANCE Explicit Effect of Resis- Demonstration
AND CAPACITANCE Teaching tance in Serial and
Introduction - Resistance, Parallel, Verifica-
Ohm’s Law, Kirchhoff’s tion of Ohm’ S
Law, Capacitance, In- Law
duction, Thermoelectric
Effects, Types of thermo-
electric effects
Week 2 See-beck Effect, Pettier Explicit Verification of Demonstration
Effect, Thomson Effect, Teaching Krichoff’s Voltage
Piezoelectric Effect, Hall and Current Law
Effect, Photoelectric Effect,
Temperature and Thermal
Properties of Materials
Week 3 Types of temperature sen- Explicit Smart Operations Demonstration
sors, Electro-mechanical, Teaching Based on Temper-
Dynamic Models of Sensor ature Sensor
Elements, Mechanical Ele-
ments, Thermal Elements,
Electrical Elements
Week 4 UNIT II- AMPLIFIER Explicit Smart Operations Demonstration
CIRCUITS Amplifier cir- Teaching Based on Poten-
cuits, Magnetic amplifier, tiometer Sensor
Transistor amplifier, Volt-
age amplifier and power
amplifier, Operational am-
plifier, Voltage Follower (or
Unity Gain Buffer)
Week 5 Bridge circuits, Analog-to- Explicit Smart Operations Demonstration
digital converters, A-to-D Teaching Based on Photore-
Conversion Methods – Inte- sistor Sensor
grating (Dual Slope) ADC
Week 6 Noise in sensors and cir- Explicit Smart Operations Demonstration
cuits, Internal noise sources, Teaching Based on Photodi-
Low-power sensors, Power- ode Sensor
ing Sensors, Batteries for
Low-Power Sensors
Week 7 UNIT III - SENSORS In- Explicit Smart Operations Demonstration
troduction - Sensors, Occu- Teaching Based on Ambient
pancy detecors Light Sensor
Week 8 Motion Detectors, Force Explicit Ultrasonic Sensor Demonstration
Sensors, Strain Sensors, Teaching Based Distance
Tactile sensors Measurement
Week 9 Pressure sensors, Pressure Explicit PIR Sensor Based Demonstration
Sensor Designs, Chemical Teaching Motion Detector
sensors, Temperature Sen-
sors

235
Week 10 UNIT IV - DATA AC- Explicit Gas and Alcohol Demonstration
QUISITION IN SENSORS Teaching Sensor Based IOT
Introduction to data ac- Application
quisition in sensors, Data
Acquisition System, Sen-
sors, Different Types of Sen-
sors, need of sensors, DAQ
device, Key Measurement
Components of a DAQ De-
vice, Computer Bus, Intro-
duction to SCADA systems,
SCADA requirements, Su-
pervisory computers
Week 11 Programmable logic con- Explicit Tilt Sensor Based Demonstration
trollers, Communication Teaching IOT Application
infrastructure, PLC/RTU
programming, PLC
commercial integration,
SCADA Architectures,
SCADA architecture de-
velopment, Monolithic
SCADA Systems, Dis-
tributed SCADA systems,
Networked SCADA Sys-
tems, Internet of things,
Functions of SCADA,
Real-Time Monitoring and
Control using SCADA
Week 12 Applications of SCADA, Explicit Infrared Sen- Demonstration
Benefits of SCADA, Teaching sor Based IOT
Scheduling, Classifica- Application
tion of scheduling, On-line
Scheduling, fixed versus
Dynamic Priority Algo-
rithms, Rate-Monotonic,
Deadline-monotonic pri-
ority, Dynamic- Priority
Algorithms
Week 13 UNIT V - ACTUATORS Explicit Control DC- Demonstration
Introduction to actuators, Teaching Motor Using
Types of Actuator, Elec- Arduino
tromagnetics, Electromag-
netic Force, Solenoid, Voice
Coil, DC Motor, DC Motor:
Types, Brushless DC Motor
Week 14 AC Motor: Rotating mag- Explicit Control Servo Mo- Demonstration
netic field Teaching tor Using Arduino

236
Week 15 IAC Motor: Three-Phase Explicit Control Stepper Demonstration
induction motor, AC Motor: Teaching Motor Using
Induction motor, Stepper Arduino
motor, Solid State Switches

EXPERIMENTS:
1. Write an Arduino code to verify the function of photoresistor sensor.

2. Write an Arduino code to verify the functions of photodiode.

3. Write an Arduino code to verify the functions of ambient light sensor.

4. Write an Arduino code to verify the functions of IR sensor.

5. Write an Arduino code to verify the functions of Ultrasonic Distance sensor.

6. Write an Arduino code to verify the functions of PIR sensor.

7. Write an Arduino code to verify the functions of Tilt sensor.

8. Write an Arduino code to verify the functions of Gas sensor.

9. Write and implement an Arduino code to sense the moisture level in the soil using
FC-28 soil moisture sensor.

10. Write and implement an Arduino code to sense the temperature level using LM35
temperature sensor.

11. Write and implement an Arduino code to sense the temperature and humidity level
using DHT11 temperature sensor.

12. Write and implement an Arduino code to sense and measure the acceleration using
GY-521 accelerometer.

13. Write and implement an Arduino code to sense the pressure level using BMP180
pressure sensor.

14. Write and implement an Arduino code to control the DC motor.

15. Write and implement an Arduino code to control the stepper motor.

TEXT BOOK(S):
1. SENSOR TECHNOLOGY & INSTRUMENTATION (IBM ICE PUBLICATIONS)

237
 4.22 213CSE3311–WIRELESS SENSOR NETWORKS AND IOT
STANDARDS

213CSE3311 WIRELESS SENSOR NETWORKS L T P X C

AND IOT STANDARDS
4 0 2 0 4
Pre-requisite :NIL
Course Category :Program Elective
Course Type :Integrated Course - Theory

COURSE OBJECTIVES:
• Understand the perspective of a WSN and the design principles of the WSN

• Learn about design and implement a low energy consumption wireless network for
sensor applications

• Differentiate the function of the MAC layer and the Physical layer especially with
reference to WSN

• Gain knowledge on network layer and the associated routing protocols

• Gain an insight into architect a sensor network and a wireless sensor network for
different types of applications

• Learn on introduction to Hardware design of a WSN node

• Gain knowledge on Operating Systems for WSN

COURSE OUTCOMES:
CO1: Understand the working principle wireless sensor networks and its characteristics

CO2: Analyze the different layer in WSN architecture

CO3: Analyze the applications of WSN related to agriculture

CO4: Analyze the performance of routing protocol for WSN

CO5: Demonstrate the performance of WSN using modern simulation tools

MAPPING OF COURSE OUTCOMES WITH PO, PSO:

PO’S PSO’S
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 S M M S
CO2 S M M M S
CO3 S M M L M M S
CO4 S M L L M S
CO5 S S S S S S S L M M S S S

238
UNIT I - CHARACTERISTICS OF WSN
Communication, Wireless sensor networks, Characteristics of WSN, Fault tolerant WSN,
Scalability, WSN topologies, Microcontroller, Transceiver, Energy consumption in a WSN,
Transducer, Energy consumption, Energy scavenging, Routing protocols, WSN operat-
ing systems, TinyOS, Contiki OS, MANTIS, Environments, Network architecture, WSN
network architecture, Design principles for a WSN, Gateway.

UNIT II – PHYSICAL LAYER

OSI models, OSI models and WSN, Session layer, Physical link layer, RF communication,
Physical layer, Data encoding, Channel encoding, PHY standard, MAC layer, Contention
protocols, Sleep MAC, Berkeley MAC, Low power listening, Clear channel assessment,
Reservation based protocols, TRAMA protocol, Adaptive election, Hardware limitations,
Energy consumption, Energy consumption Deep Sleep, Network failures.

UNIT III - APPLICATIONS OF WSN

Application of WSN, CoAP, IPv6, Unicast, Multicast and Anycast, Hexadecimal Number
System, Address Structure, Block Diagram of IPv6 Fixed Header, Global Unicast Ad-
dress, Unique Local Address, Scope of different address, Transition to IPv6, Tunnelling,
Network address Translation, 6LoWPAN, Building automation, BAS Integration with
WSN, Object Access Services, Analysis of Stack usage - Energy, BMS types of equip-
ment, BMS and WSN players, Smart Agriculture, Crop monitoring, Composting, Smart
Agriculture – Green House, Hydroponics, Perimeter monitoring, Video surveillance and
analytics, Item and object tracking, Tag and trace, Inventory management system, Takt
time.

UNIT IV - ROUTING PROTOCOLS

IPv6 - Routing, The routing protocols classification, ICMPV6 vs DHCPV6 Vs DNS,
Routing Protocol and Data Centric Networking, Challenges in WSNs, Network Struc-
ture Categorization, “Data-centric and Flat-Architecture Protocols”, Illustration of Data
Centric Routing, Flooding, Gossiping, Sensor Protocols for Information via Negotiation
(SPIN), SPIN PP, SPIN EC ( Energy Conserve), SPIN BC, SPIN - Conclusion, Directed
Diffusion, Negative reinforcement in direct diffusion, Hierarchical Protocols, LEACH,
LEACH: Adaptive Clustering, Algorithm, Algorithm Summary, LEACH Network-An
Example, Geographical Routing Protocols, MECN and SMECN, Relay region Concept
in MECN, Geographical Forwarding Schemes for Lossy Links, Hop selection algorithms,
PRADA, QoS-Based Protocols, SAR, Minimum Cost Path Forwarding, SPEED.

UNIT V - IOT OPEN SOURCE TOOLS

Overview, Main components to build IoT applications, Various IoT tools available for de-
velopment, ARM MBED, MBED OS, Features of MBED OS, IoT CLOUD SERVICES,
NODE-RED, Admin HTTP API, Errors, Methods, IoTivity, IoTivity and IoTivity-Lite
Comparison, IoTivity-Main Stack, IoTivity-LITE Stack, Distributed Service Architec-
ture, Distributed Service Broker, Distributed Service Link, nodeAPI, Devices for moni-
toring and controlling.

239
EXPERIMENTS:
1. Interfacing of Input Device with Microcontroller.

2. Interfacing of Output Device with Microcontroller.

3. Multitasking of Microcontroller.

4. Social Distance Detector (Corona Kawach).

5. Controlling Electrical Appliances Using Microcontroller.

6. Controlling DC Motor Using Relay.

7. Weather Monitoring System.

8. Controlling Electrical Appliances from Any Place of The World (IOT Application).

9. Uploading Sensor Data at Cloud and Fetching it from Any Place of World (IOT
Application).

10. Contiki OS And Cooja Simulator for WSN.

11. Basic Programming in Cooja Simulator.

12. Hello World in Contiki.

13. LED Blinking.

14. Button Control LED.

15. Temperature Monitoring.

TEXT BOOK:
1. WIRELESS SENSOR NETWORKS(WSN) & IOT STANDARDS (IBM ICE PUB-
LICATIONS)

240
 4.23 213CSE3312: CLOUD COMPUTING ARCHITECTURE
AND DEPLOYMENT MODELS

213CSE3312 CLOUD COMPUTING ARCHI- L T P X C

TECTURE AND DEPLOYMENT
MODELS
4 0 2 0 4
Pre-requisite : NIL
Course Category : Program Elective
Course Type : Integrated Course - Theory

COURSE OBJECTIVES:
• To provide students with an overview of the concepts and fundamentals of cloud
computing architecture.

• To learn the importance of different cloud deployment models.

• To understand the concept of cloud services and its characteristics.

COURSE OUTCOMES:
CO1: Inspect the basics of cloud computing and its technologies

CO2: Understand the need of migration to cloud and cloud deployment in industry

CO3: Analyse the public cloud deployment model and its function

CO4: Analyse the private and hybrid cloud deployment models and its function

CO5: Understand the different architecture of cloud service and its characteristics

CO6: Demonstrate OpenStack architecture with both CLI and API functionalities

CO7: Implement suitable use-cases for OpenStack

MAPPING OF COURSE OUTCOMES WITH PO, PSO:

PO’S PSO’S
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 S M S
CO2 S M S
CO3 S S L S L S
CO4 M S L L S
CO5 S L S S
CO6 L M S S S S M L S
CO7 L M S S S S M L S

241
UNIT 1 INDUSTRY TRENDS AND THE FUTURE OF CLOUD
COMPUTING
Analysis of industry trends, Evolution from IaaS to PaaS applications, Convergence of
IaaS and SaaS providers, Trends leading from private to hybrid clouds, The future of cloud
computing: Hybrid clouds and cloud brokering, Application transformation: fully multi-
threaded, multi provider, dynamically scalable applications, Self-service administration:
consolidated application control panels, Software-defined networking, Software-defined
data centre, Big Data and analytics,The Internet of Things.

UNIT II CONSIDERATIONS FOR MOVING TO CLOUD CLOUD

DEPLOYMENT
How does cloud computing work? Dynamic cloud with service composition and patterns,
composable business, Migration to cloud: It is all about workloads, Virtualization of
servers, network, and storage, the relentless pursuit of automation, Adding customer vis-
ibility and transparency into cloud operations, monitoring, and reports. Accessing cloud
services, Data sovereignty and on-shore support operations, New backup and recovery
techniques, Cloud operational changes in an Information Technology Infrastructure Li-
brary model (ITIL). Operational transformation best practices. Migrating applications
to cloud, 5 key success factors for cloud implementation, Consume-versus-build decision,
building your own cloud—lessons learned, including architecture examples and guidance,
managing scope, releases, and customer expectations, Redundancy, continuity, and disas-
ter recovery, Using existing operational staff during deployment, Cloud Deployment best
practices.

UNIT III PUBLIC CLOUD DEPLOYMENT MODELS

What is a Public Cloud? Illustration of Public Cloud, Why Public Cloud, Advantages
of Public Cloud, Limitations of Public Cloud, Low degree of security and control, Lack
of control on infrastructure, configuration, Network latency and accessibility concerns,
Highest long term cost, Public v/s Private, Journey into Public Cloud, Revisit the idea
of adopting public cloud, Cloud vendor selection, Migrating to Cloud, Cloud vendor se-
lection, SLA – Service Level Agreements, Credits/Compensation terms, Credit process,
Disaster recovery plan, Exclusions, Security and Privacy, Periodic upgrade and mainte-
nance, Data location and Jurisdiction, Pricing and Measurability, Interoperability and
Lock-in, Exit process/Termination policies, Proven track record, Public cloud vendors,
Case studies.

UNIT IV PRIVATE AND HYBRID CLOUD DEPLOYMENT

MODELS
What is a Private Cloud? Illustration of Private Cloud, Advantages of Private Cloud,
Limitations of Private Cloud, Service Management, Journey into Private Cloud, Planning
and Strategy, Standardization, Virtualization, Automation, Cloud, Case study – VMware
vCloud, Case Study – IBM SmartCloud Entry, Private cloud. What is a Hybrid Cloud?
Why Hybrid Cloud, Illustration of Hybrid Cloud, Advantages of Hybrid Cloud, Chal-
lenges of Hybrid Cloud, Develop and manage hybrid workloads, Developing applications

242
for hybrid cloud, Develop applications using PaaS, Managing hybrid workloads, Journey
into Hybrid Cloud, Step 1: Asses current IT infrastructure and business, Step 2: Explore
cloud computing, Step 3: Create cloud deployment strategy plan, Step 4: hybrid cloud
implementation.

UNIT V IAAS, PAAS AND SAAS

Infrastructure as a Service (IaaS), Characteristics of IaaS, Comparing ISPs and IaaS,
IaaS case studies, IaaS enabling technology, The trusted cloud, IaaS as the best option,
IaaS may not be the best option, PaaS: Platform as a Service, PaaS characteristics,
Integrated lifecycle platforms, Anchored lifecycle platforms, Enabling technologies as a
platform, Case studies: Integrated lifecycle platform, PaaS as the best option, PaaS as
may not be the best option, Software as a Service (SaaS), SaaS origin, Evolution of
SaaS: Salesforce.com’s approach, Characteristics of Software as a Service (SaaS), SaaS
economics and the ecosystem, Types of SaaS platforms, SaaS: Providers, Collaboration
as a service, Enabling and management tools as a service, Monitoring and management
tools as a service, SaaS as the best option, SaaS may not be the best option.

EXPERIMENTS:
1. OpenStack Installation.
2. Familiarize with OpenStack dashboard.
3. Cloud Project Management.
4. OpenStack user management.
5. Upload a qcow2 image (Machine image).
6. Upload an ISO image.
7. Creating a new key pair.
8. Enabling SSH on default security group.
9. Launch a new instance using qcow2 Image.
10. Deploy Linux VM from an ISO Image.
11. Create and attach a volume to an instance.
12. Create an instance Snapshot.
13. Deploy a VM from an image snapshot.
14. Volume snapshot.
15. Detach and attach volume.
16. Create Flavor.
17. Controlling the state of an instance (pause, suspend, reboot).
18. Deleting an instance.

243
TEXT BOOK(S):
1. CLOUD COMPUTING DEPLOYMENT MODELS, IBM ICE PUBLICATION,
2019.

2. CLOUD COMPUTING ARCHITECTURE, IBM ICE PUBLICATION, 2019.

244
4.24 213CSE4311: ANALYTICS FOR IOT

213CSE4311 ANALYTICS FOR IOT L T P X C

4 0 2 0 4
Pre-requisite : NIL
Course Category : Program Elective
Course Type : Integrated Course - Theory

COURSE OUTCOMES:
Upon successful completion of this course, students will be able to
CO1:To understand the concepts behind the descriptive analytics of data.
CO2:Apply the technologies and tools of BI.
CO3:Explore and Analyz Data data using descriptive analytics techniques.
CO4:Apply different predictive,Descriptive and text analytic chart models.
CO5:Recognize and apply various suitable IoT tools for use cases.

MAPPING OF COURSE OUTCOMES WITH PO, PSO:

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

UNIT I: Introduction to Analytics for IoT and Descriptive analytics - deep

dive What is Analytics? - Capabilities of analytics, Analytics ecosystem for IoT, Types
of analytics - Descriptive Analytics /BI, Predictive Analytics / DM, Prescriptive Analyt-
ics / Optimization, Cognitive Analytics. Intro to Descriptive analytics/ for IoT, Benefits
of BI, Maximise Value From BI Systems, Strategy and Business Intelligence, Five key
areas of strategy, Planning a BI Project, BI Design and Development, Engagement Ac-
tivities, Pre-Engagement Activities, Business Environment, Engagement Process, Project
Tasks, Task 1- Knowledge Capture Goals, Discuss Business Objectives Prior Learning,
Interview key stakeholders, Task 2 - Consolidate Findings, Create logical design, Task 3 -
Map the Customer Situation, Current Environment, Business/Functional, Requirements
Sample Diagram, Task 4 - Methodology Approach, Task 5 - Standards Governance,
Task 6 - Sections, Milestones, and Tasks, Task 7 – Proof of Concept (POC), Task 8 –
Table Creation, Task 9 – OLAP Creation, Task 10 – Three Final Deliverables.

UNIT II: BI framework for IoT BI Architecture- Centralized versus Decentral-

ized architecture, BI Architecture Alternatives, Phased and Incremental BI Roadmap,
System sizing, measurement and dependencies, Authentication, Authorization and Ac-
cess permissions, Server Administration, Data Backup and Restoring BI framework for
IoT, Ecosystem preparation – device, network and software layer integrations, Data mart
framework, Data layer framework, Presentation layer framework.

245
UNIT III: Applying Descriptive analytics for IoT Data for analytics - Decision
driven data - Exploring and Analyzing Data, Setting up data for BI IoT data for Ana-
lytics - Sensor data – Problem of plenty, Challenges of data – categorization of relevancy,
Capture of data, Storage and retrieval – need for data warehouse/ marts ETL strategy
for IoT data, Challenges of ETL layer, Building data marts for IoT data, What is a
data warehouse?, Data Warehouse - Subject Oriented, Data Warehouse – Integrated,
Data Warehouse – Time Variant, Data Warehouse – Non Volatile, Data Warehouse Us-
age 2-13, From tables and spreadsheets to data cubes, Multidimensional Data, Concep-
tual Modeling of Data Warehouses, Data Warehouse Design Process, Three-Tier Data
Warehouse Architecture, Three Data Warehouse Models, Data Warehouse Development,
Multi-Tiered Architecture, Metadata Model for IoT.

UNIT IV: Reports and Dashboards for IoT Multidimensional analysis techniques
- Data Analysis and OLAP, OLAP Server Architectures, Data Cube, Discovery-Driven
Data Cubes, OLTP vs. OLAP, Business Query, Dashboards Development – Definition,
Dashboard Types, Evolution of Dashboards, Layers of Information, Dashboard Design,
Dashboard Examples, Display Media for Dashboards, Reports - Building Reports, List
Report, Crosstab Report, Chart Report, Map Report, Data group, sort and Filters, Add
calculations to report, Conditions and Aggregations in Report, Drilling in report, Run
report – on demand or schedule, Charts Graphs, Parts of a Graph, Chart Type – Bar
Chart, Chart Type – Line, Chart Type – Pie, Chart Type – Area, Chart Type – Scatter,
Presenting IoT data analysed- Examples of dashboards on IoT analytics, Examples of
reporting IoT analytics, Examples of charts and graphs on IoT analytics.

UNIT V: Cloud Big data Analytics for IoT and Analytics for IoT – Tools and
Use cases Overview of Big data in IoT analytics - Introduction to Big data, Big data
and IoT, BI from Big data for IoT, Overview of cloud in IoT analytics - Introduction to
Cloud computing, IoT on cloud, Integration of devices on cloud for analytics, Building
analytics for IoT, Introduction to various tools in BI, Introduction to Data modelling
tools, Introduction to ETL tools, Introduction to Data mart building tools, Introduc-
tion to Data visualization and analytics tools, Use cases for IoT analytics, Use case for
data capture and extraction, Use case for data marts and data warehouse, Use case for
analytical reporting, Use case for backward integration of analytics.

TEXT BOOK(S):
1. Analytics for IoT (IBM ICE Publications).

246
4.25 213CSE4312: SMARTER CITY

213CSE4312 SMARTER CITY L T P X C

4 0 2 0 4
Pre-requisite : NIL
Course Category : Program Elective
Course Type : Integrated Course - Theory

COURSE OUTCOMES:
Upon successful completion of this course, students will be able to
CO1:Understand the smarter city framework.
CO2:Design and apply a suitable solution for home automation.
CO3:Design and apply smart street light, pipeline leakeage detection and process ana-
lytics of gas, force and humidity.
CO4:Design and apply smart solution for traffic monitoring and control.
CO5:Design and apply a suitable solution for environmental control.

MAPPING OF COURSE OUTCOMES WITH PO, PSO:

PO’S PSO’S
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 S M M S
CO2 S S S S S S S S
CO3 S S S S S S S S L S S
CO4 S S S S S S S S S L M S S
CO5 S S S S S S S S S L M S S

UNIT I: INTRODUCTION Introduction to Smart solutions; Smarter City Frame-

work.

UNIT II: Building and Home Automation Access Control- access control HMI,
Light & Temperature Control- Heat meter, Energy Optimization- HVAC Air Handling
unit (AHU), Predictive maintenance, Connected Appliances- motor control, LED Light
control .

UNIT III: Smart Cities 1 Residential E-meter-AMR, Smart Street Lights-LED

Lighting via PLC, Pipeline Leak detection- process analytics-pH, Gas, Concentartion,
Force & humidity.

UNIT IV: Smart Cities 2 Traffic Control, Surveillance Cameras- IP Cameras, Cen-
tralized and Integrated Systems Control – Digital Signage, Structural analysis, Smart
Parking.

UNIT V: Smart Environment Waste management, Fire detection, Air pollution,

Snow level monitoring, Landslide and avalanche prevention, Earthquake and tsunami
early detection.

247
TEXT BOOK(S):
1. Smarter City (IBM ICE Publications).

248
 STREAM: NETWORKS AND SECURITY
4.26 213CSE1305: NETWORK AND INFORMATION SECU-
RITY

213CSE1305 NETWORK AND INFORMATION L T P X C

SECURITY
3 0 2 0 4
Pre-requisite :Computer Networks
Course Category :Program Elective
Course Type :Integrated Course - Theory

COURSE OBJECTIVES:
To enable students to understand the Information security’s role, threats, elements
of cryptography, protocols, architectures and technologies for secure systems and
services.

COURSE OUTCOMES:
CO1: Examine the security architecture, services and mechanisms.

CO2: Apply the knowledge of number theory in public key cryptography.

CO3: Analyze the various data integrity algorithms.

CO4: Interpret the various internet and network security mechanisms.

CO5: Evaluate various system security mechanisms.

MAPPING OF COURSE OUTCOMES WITH PO, PSO:

PO’S PSO’S
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 S S
CO2 S S S S M L S S
CO3 S S S S S S M L S M S
CO4 S S S S S M L S M S
CO5 S S S S S M L S M S

UNIT I: Introduction
An Overview of Computer Security - OSI Security Architecture - Security Services -
Security Mechanisms - Security Attacks - Classical Encryption Techniques - Block Ciphers
and Data Encryption Standard - Advanced Encryption Standard.

249
UNIT II: Public Key Cryptosystems
Number Theory- Block Cipher Operation - Public Key Cryptography and RSA -Other
Public Key Cryptosystems - Diffie Hellman Key Exchange - Elgamal Cryptosystems -
120Elliptic Curve Cryptography.

UNIT III: Data Integrity Algorithms

Cryptographic Hash Function - Hash Function based on Cipher Block Chaining-Secure
Hash Algorithms -SHA3 - Message Authentication Code HMAC - DAA and CMAC -
Authenticated encryption - Digital signature.

UNIT IV: Network and Internet Security

Transport Level security - Secure Socket Layer - Transport Layer Security HTTPS -Secure
Shell - E-mail Security - Pretty Good Privacy - S/MIME - Domain Keys Identified Mail
- IP Security.

UNIT V: System Security

Intrusion detection system, Malicious software Viruses Worms - Distributed denial of
service Attacks -Firewalls Control Hijacking attacks integer overflow ,More Control Hi-
jacking attacks format string vulnerabilities, Defence against Control Hijacking-Platform
Defences, Defence against Control Hijacking-Run-time Defences, Advanced Control Hi-
jacking attacks.

15 WEEK COURSE PLAN

Week Lecture (2 hours) Pedagogy Practical (2 hours)

Week 1 Introduction to Software Explicit Teaching Introduction to
Engineering,Project Man- Computer Security.
agement Concepts,Software
Engineering Paradigms
Generic An Overview of
Computer Security ,OSI Se-
curity Architecture,Security
Services
Week 2 Security Mecha- Explicit Teaching Introduction to
nisms,Security Attacks and Demonstra- various attacks,
- Classical Encryption tion
Techniques
Week 3 Block Ciphers and Data En- Demon-stration Introduction of en-
cryption Standard - Ad- crption techniques.
vanced Encryption Stan-
dard

250
Week 4 Number Theory- Block Explicit Teaching Demostration of
Cipher Operation - Public and Demonstra- public key crptog-
Key Cryptography and tion raphy
RSA
Week 5 Other Public Key Cryp- Explicit Teaching Demostration of
tosystems - Diffie Hellman and Demon- Elliptic Curve
key exchange stration Cryptography
Week 6 Elgamal Cryptosystems - Explicit Teaching Creating the State
120 Elliptic Curve Cryptog- and Demon- diagram,Identify
raphy stration the relationship
between various
states
Week 7 Cryptographic Hash Func- Demon-stration Programs using
tion - Hash Function based Hash function
on Cipher Block Chaining
Week 8 Secure Hash Algorithms - Explicit Teaching Programs using
SHA3 - Message Authenti- and Demonstra- Message Authenti-
cation Code tion cation Code
Week 9 HMAC - DAA and CMAC - Demon-stration Demostration of
Authenticated encryption - Digital signature.
Digital signature
Week 10 Transport Level security - Explicit Teaching Demonstration for
Secure Socket Layer and Demonstra- Transport Layer
tion Security
Week 11 Transport Layer Security Explicit Teaching Demonstration for
HTTPS -Secure Shell - E- E-mail Security
mail Security
Week 12 Pretty Good Privacy - Explicit Teaching IP Security
S/MIME - Domain Keys and Demonstra-
Identified Mail - IP Security tion
Week 13 Intrusion detection system, Explicit Teaching Demonstration of
Malicious software Viruses and Demonstra- intrusion detection
Worms - Distributed denial tion system
of service Attacks
Week 14 Firewalls Control Hijack- Explicit Teaching Demonstration of
ing attacks integer overflow and Demonstra- firewalls
,More Control Hijacking at- tion
tacks format string vulnera-
bilities
Week 15 Defense against Control Demon-stration Program using var-
Hijacking-Platform De- ions attacks
fenses, Defense against
Control Hijacking-Run-
time Defenses, Advanced
Control Hijacking attacks

251
EXPERIMENTS:
1. Implementation of Ceaser cipher

2. Implementation of hill cipher

3. Implementation of play fair cipher

4. Implementation of DES algorithm

5. Implementation of RSA algorithm

6. Implementation of Diffie hellman key exchange algorithm

7. Implementation of AES algorithm

8. Implementation of firewall techniques

9. Implementation of email security

10. Implementation of IP security

TEXT BOOK(S):
1. M Stallings, Cryptography and Network Security Principles and Practice Seventh
Edition, PHI, 2017.

REFERENCES:
1. Behrouz A. Ferouzan, Cryptography Network Security, Tata Mc Graw 2nd Edi-
tion,2010.

2. 2. Charles Pfleeger, Security in Computing, 5th Edition, Prentice Hall of India,

2015.

252
 4.27 213CSE1305: PERVASIVE AND UBIQUITOUS COM-
PUTING

213CSE1305 PERVASIVE AND UBIQUITOUS L T P X C

COMPUTING
3 0 2 0 4
Pre-requisite :Operating Systems
Course Category :Program Elective
Course Type :Integrated Course - Theory

COURSE OBJECTIVES:
• To understand the characteristics and principles of Pervasive computing

• To understand the various components that helps to build pervasive computing

system

• To understand the necessity of sensor networks and RFID that capture and dissem-
inate context information

• To understand the principles, challenges, infrastructures and user interface that

supports the ubiquitous computing

• To design and implement Pervasive and Ubiquitous applications that are embedded
in everyday objects

COURSE OUTCOMES:
CO1: Understand the enabling technologies that drive the pervasive and ubiquitous com-
puting

CO2: Analyze and compare the performance of different data dissemination techniques

CO3: Formulate the design aspects, that are essential to create the model of pervasive
computing

CO4: Develop solutions for problems related to pervasive and ubiquitous computing sys-
tem through investigation

CO5: Analyze the various applications of Ubiquitous computing

MAPPING OF COURSE OUTCOMES WITH PO, PSO:

PO’S PSO’S
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 S S
CO2 S S M M S M L L S
CO3 S M S S M L S
CO4 S S M S S M L L S S
CO5 M S M L S

253
UNIT I: Introduction
Pervasive Computing: Principles - Characteristics - interaction transparency - context
aware – automated experience capture - Vision and challenges of pervasive computing
- Pervasive computing infrastructure - Architecture for pervasive computing - Pervasive
devices - embedded controls - smart sensors and actuators - Context communication and
access services.

UNIT II: Technologies

Device Technology for Pervasive Computing: Hardware - Human-machine interfaces -
Biometrics – Operating Systems - Java for pervasive devices - Voice Technology: Basics
of Speech Recognition - Voice standards - Speech Applications - Speech and Pervasive
Computing - Security - Personal Digital Assistants.

UNIT III: Sensor Networks and RFID

Introduction to Sensor networks: Sensor Node Architecture - Sensor Network Architec-
ture - Types of sensor networks - Platforms for Wireless sensor networks - Applications of
Wireless Sensor networks - Introduction to RFID - transponder and reader architecture -
Types of tags and readers - Frequencies of operation - Application of RFID Technologies

UNIT IV: Introduction to Ubiquitous Computing

An introduction - overview - challenges to research topics in ubiquitous computing in-
cluding sensors – ambient displays - tangibles - middleware - mobility - allocation and
context awareness - Architecture for ubiquitous computing: new devices and communi-
cations - software architectures - Wireless standards protocols for ubiquitous networks
- Near field communication (NFC) - Bluetooth classic - Bluetooth Low Energy (BLE) -
WiFi- WiFi Direct.

UNIT V: Ubiquitous Computing Applications

Ubiquitous applications: the appropriate design - Weiser’s vision of ubiquitous computing
- mixed reality and sensible design - Wearable computing - Glass and Augmented Reality
- Eye-Tracking-Digital Pen and Paper Mobile social networking crowd sensing Event
based social network

15 WEEK COURSE PLAN

Week Lecture (2 hours) Pedagogy Practical (2 Pedagogy

hours)
Week 1 Pervasive Computing Princi- Explicit Hands-on ses- Demonstration
ples,Characteristics,interaction Teaching sion on In-
transparency,context aware stalling J2ME
,automated experience cap- simulator
ture

254
Week 2 Vision and challenges of per- Explicit Design the soft- Problem based
vasive computing ,Pervasive Teaching ware using mo- learning
computing infrastructure, Ar- bile phone using
chitecture for pervasive com- J2ME
puting
Week 3 Pervasive devices - embedded Flipped Design a web Problem based
controls - smart sensors and Learning application learning
actuators - Context commu- from PCs us-
nication and access services ing smart card
authentication
Week 4 Device Technology for Per- Explicit Design a web Problem based
vasive Computing Hardware, Teaching application learning
Human-machine interfaces, from PCs us-
Biometrics, Operating Sys- ing smart card
tems authentication
Week 5 Java for pervasive de- Explicit Create a web Problem based
vices,Voice Technology, Teaching application via learning
Basics of Speech Recognition WAP phones
,Voice standards, Speech
Applications
Week 6 Speech and Pervasive Com- Flipped Create a web Problem based
puting - Security - Personal Learning application via learning
Digital Assistants WAP phones
Week 7 Introduction to Sensor net- Explicit Create a Web Problem based
works Sensor Node Architec- Teaching application from learning
ture, Sensor Network Archi- PDAs
tecture, Types of sensor net-
works
Week 8 Platforms for Wireless sen- Flipped Design the Problem based
sor networks, Applications of Learning photo sharing learning
Wireless Sensor networks, In- application
troduction to RFID
Week 9 Transponder and reader ar- Explicit Design the Problem based
chitecture,Types of tags and Teaching photo sharing learning
readers,Frequencies of oper- application
ation,Application of RFID
Technologies
Week 10 An introduc- Explicit Basics of WSN Problem based
tion,overview,challenges Teaching programming learning
to research topics in using Tiny os
ubiquitous computing in-
cluding sensors, ambient
displays,tangibles, middle-
ware,mobility,allocation and
context awareness

255
Week 11 Architecture for ubiquitous protocols Explicit Teach- Hands on ses-
computing new devices for ubiq- ing sion of WSN
and communications, soft- uitous programming
ware architectures,Wireless networks using Tiny OS
standards
Week 12 Near field communication Flipped simulation of Demonstration
(NFC), Bluetooth classic, Learning WSN using
Bluetooth Low Energy TOSSIM frame-
(BLE), WiFi- WiFi work
Week 13 Ubiquitous applications the Explicit Interfacing Problem based
appropriate design, Weiser’s Teaching RFID reader Learning
vision of ubiquitous comput- with computer
ing, mixed reality and sensi- using reader
ble design communication
protocols
Week 14 Wearable computing - Glass Flipped Reading a UID Problem based
and Augmented Reality Learning from the RFID Learning
tag using TAG
commands and
response
Week 15 Eye-Tracking-Digital Pen and Explicit Case study and Project based
Paper Mobile social network- Teaching projects Learning
ing and crowd sensing Event
based social network

EXPERIMENTS:
1. Design the software using mobile phone using J2ME

2. Design a web application from PCs using smart card authentication

3. Create a web application via WAP phones

4. Create a Web application from PDAs

5. Design the photo sharing application

6. Basics of WSN programming using Tiny os

7. Simulation of WSN using TOSSIM framework

8. Interfacing RFID reader with computer using reader communication protocols

9. Reading a UID from the RFID tag using TAG commands and response

256
TEXT BOOK(S):
1. Jochen Burkhardt, Horst Henn, Stefan Hepper, Thomas Schaec, Klaus Rindtorff,
“Pervasive Computing: Technology and Architecture of Mobile Internet Applica-
tions”, Sixth Edition, Pearson Education, New Delhi, 2009.

2. Seng Loke, “Context-Aware Computing Pervasive Systems”, Auerbach Pub., Taylor

and Francis Group, New York, 2007.

3. John Krumm, “Ubiquitous Computing Fundamentals”, CRC Press, 2010.

REFERENCES:
1. Rahul Banerjee, “Lecture Notes in Pervasive Computing”, Outline Notes, BITS-
Pilani, 2012.

2. Genco, S. Sorce, “Pervasive Systems and Ubiquitous Computing”, WIT Press, 2012.

3. Guruduth S. Banavar, Norman H. Cohen, Chandra Narayanaswami, “Pervasive

Computing: An Application-Based Approach”, Wiley Interscience, 2012.

4. Frank Adelstein, S K S Gupta, G G Richard, L Schwiebert, “Fundamentals of

Mobile and Pervasive Computing”, Tata McGraw Hill, New Delhi, 2005.

5. Stefen Poslad, “Ubiquitous Computing: Smart Devices, Environments and Interac-

tions”, Second Edition, Wiley, 2010.

257
 4.28 213CSE2311: VIRTUALIZATION

213CSE2311 VIRTUALIZATION L T P X C
3 0 2 0 4
Pre-requisite :Computer Networks
Course Category :Program Elective
Course Type :Integrated Course - Theory

COURSE OBJECTIVES:
To make the students realize the need and benefits of virtualization and automation
by introducing various types, architectures and implementation of virtualization.

COURSE OUTCOMES:
CO1: Justify the need and benefits of virtualization over the conventional methods.

CO2: Analyze various virtualization approaches.

CO3: Elaborate the concept and working mechanism of virtual machines.

CO4: Examine the data management of complex virtual environments using VM ware
technology.

CO5: Compare performance factors of virtualized systems, principal issues in troubleshoot-

ing virtual environment.

MAPPING OF COURSE OUTCOMES WITH PO, PSO:

PO’S PSO’S
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 S M S
CO2 S S S
CO3 S S
CO4 S S S S S M L S
CO5 S S S S S M L S

UNIT I: Introduction
Virtualization Overview - Benefits Need of Virtualization Limitations Traditional Vs Con-
temporary Virtualization Pitfalls of Virtualization Hypervisors Virtualization Consider-
ations for Cloud Providers, Data Centre Architecture, Types of Components, Repository
Architecture Style, Blackboard Architecture Style..

UNIT II: Types of Virtualization

Types of Hardware Virtualization: Full Virtualization Para Virtualization Desktop Vir-
tualization Server Virtualization Data Virtualization OS Level Virtualization Application

258
Level Virtualization Comparing Virtualization Approaches Managing Heterogeneous Vir-
tualization Environment Customized and Modifying Virtualization Advanced Virtualiza-
tion Case Studies.

UNIT III: Virtual Machine

Understanding Virtual Machines Taxonomy of Virtual Machines Life Cycle Process and
System Level Virtual Machines Emulation Binary Translation Techniques Managing Stor-
age for Virtual Machine Applications of Virtual Machines.

UNIT IV: Implementation

Building and Managing Virtual Machine Xen Hypervisor And Its Architecture VMware
VSphere Kernel Virtual Machine (KVM) Microsoft Hyper-V - Virtual Box, Virtual ma-
chine sprawling, Hypervisor vulnerabilities, Hypervisor attacks, VM attacks, VM migra-
tion attacks.

UNIT V: Automation and Management

Cloud Management Reference Architecture Data Center Challenges And Solutions Goals
of Automating Virtualization Management Automating The Data Center Benefits Of
Data Center Automation Virtualization For Automatic Service Provision Virtualization
Management, Private cloud implementation using Eucalyptus, Hyper-V and VMWare.

15 WEEK COURSE PLAN

Week Lecture (2 hours) Pedagogy Practical (2 hours)

Week 1 Virtualization Overview - Explicit Teaching Introduction to vir-
Benefits Need Of Virtual- tualization.
ization Limitations Tradi-
tional Vs Contemporary
Week 2 Pitfalls of Virtualization Explicit Teaching Virtual Machine
Hypervisors Virtualization and Demonstra- Creation.
Considerations for Cloud tion
Providers
Week 3 Data Centre Architec- Demon-stration Implemenation of
ture, Types of Compo- various architec-
nents,Repository Archi- ture.
tecture Style, Blackboard
Architecture Style.
Week 4 Types of Hardware Virtual- Explicit Teaching Installation of
ization: Full Virtualization vCenter.
Para Virtualization Desk-
top Virtualization
Week 5 Server Virtualization,Data Explicit Teaching Implementation of
Virtualization OS Level and Demon- different Virtual-
Virtualization Application stration ization
Level Virtualization

259
Week 6 Comparing Virtualization Explicit Teaching Analyzing the
Approaches Managing different Virtual-
Heterogeneous Virtu- ization approaches
alization,Environment
Customized and Modifying
Virtualization Advanced
Virtualization Case Studies
Week 7 Understanding Virtual Ma- Demon-stration Working with au-
chines Taxonomy of Virtual tomation tools:
Machines Life Cycle Process Puppet,chef
Week 8 System Level Virtual Ma- Explicit Teaching Implementation of
chines Emulation Binary and Demonstra- emulation binary
Translation Techniques tion translation
Week 9 Managing Storage for Vir- Demon-stration Working with au-
tual Machine Applications tomation tools:
of Virtual Machines chef.
Week 10 Building and Managing Vir- Explicit Teaching Implementation us-
tual Machine Xen Hypervi- and Demonstra- ing Xen Hypervisor
sor And Its Architecture tion
Week 11 VMware VSphere Kernel Explicit Teaching Demonstration for
Virtual Machine (KVM) and Demonstra- Kernel Virtual Ma-
Microsoft Hyper-V - Virtual tion chine (KVM)
Box
Week 12 Virtual machine sprawling, Explicit Teaching Analyzing the dif-
Hypervisor vulnerabilities, ferent VM attacks
Hypervisor attacks, VM at-
tacks, VM migration at-
tacks
Week 13 Cloud Management Ref- Explicit Teaching Working with Mi-
erence Architecture Data and Demonstra- crosoft Hyper-V.
Center Challenges And So- tion
lutions Goals Of Automat-
ing Virtualization Manage-
ment Automating
Week 14 The Data Center Benefits Demon-stration Data centre Virtu-
Of Data Center Automa- alization
tion Virtualization For Au-
tomatic Service Provision
Week 15 DVirtualization Man- Demon-stration Implementation of
agement Private cloud private cloud using
implementation using Eucalyptus
Eucalyptus,Hyper-V and
VMWare

260
EXPERIMENTS:
1. Virtual Machine Creation

2. Installation of vCenter

3. Working with automation tools: Puppet, chef

4. Working with Microsoft Hyper-V

5. Demonstration for Kernel Virtual Machine

6. Analyzing the different VM attacks

7. Implementation using Xen Hypervisor

8. Implementation of emulation binary translation

9. Implementation of private cloud using Eucalyptus

TEXT BOOK(S):
1. Rajkumar Buyya, James Broberg, Andrzej Goscinski, Cloud Computing principles
and Pradigms, John Wiley Sons, 2011..

REFERENCES:
1. James E.Smith, Ravi Nair, Virtual Machines , Elsevier, 2005.

2. Charles Pfleeger, Security in Computing, 5th Edition, Prentice Hall of India, 2015.

3. Mathew Portney, Virtualization Essentials, John Wiley Sons, 2012.

4. Time Cerfing, Jeff Buller, Check Enstall, Richard Ruiz, Mastering Microsoft Vir-
tualization, Wiley Publications, 2010.

5. Ventkata Josyula, Malcolm Orr, Greg Page, Cloud Computing: Automating the
Virtualized Data Center, Cisco Press, 2012.

6. William Von Hagen, Professional Xen Virtualization, Wiley Publications, 2008.

7. Cody Bunch, Automating vSphere with VMware vCenter Orchestrator: Technology

Hand-on, Pearson Education, 2012.

261
 4.29 213CSE2312: MOBILE AND WIRELESS SECURITY

213CSE2312 MOBILE AND WIRELESS SECU- L T P X C

RITY
3 0 2 0 4
Pre-requisite :COMPUTER NETWORK
Course Category :Program Elective
Course Type :Integrated Course - Theory

COURSE OBJECTIVES:
• To provide a comprehensive overview of all relevant aspects of security in mobile
and wireless networks and also to introduce to students advanced research topics.

• To provide possibilities for hands on experience with developing security features

COURSE OUTCOMES:
CO1: Understand the architecture and various attacks of mobile systems

CO2: Demonstrate the various attacks and security in wireless systems

CO3: Analyze the various security issues in different wireless networks

CO4: Analyze the various security models of mobile networks

CO5: Examine the various risks in different mobile devices and Apps

MAPPING OF COURSE OUTCOMES WITH PO, PSO:

PO’S PSO’S
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 S S
CO2 S M S M L L S
CO3 S M S S M L M S
CO4 S S M S S M L L M S
CO5 M S M L M M S

UNIT I: INTRODUCTION
Mobile system architecture mobile cellular systems GSM and UMTS security attacks
vulnerabilities in cellular services cellular jamming attacks and mitigation security in
VoIP services

UNIT II: WIRELESS SECURITY

Introduction to wireless security, types of security attacks, security policies, Symmetric
Encryption and Message Confidentiality, Public Key Cryptography, Managing security
in wireless devices

262
UNIT III: WIRELESS NETWORK SECURITY
Overview of wireless networking, WLAN security models- Security in Wireless Cellular
Networks, Security in Mobile Ad hoc and sensor Networks, Security in Software defined
Networks

UNIT IV: MOBILE SECURITY

Introduction to Mobile Security, Building Blocks, Basic security and cryptographic tech-
niques. Security of GSM Networks,Security of UMTS Networks,LTE Security, WiFi and
Bluetooth Security, SIM/UICC Security ,Mobile Malware and App Security, Android
Security Model, IOS Security Model,Security Model of the Windows Phone,SMS/MMS,
Mobile Geolocation and Mobile Web Security, Security of Mobile VoIP Communications

UNIT V: MOBILE DEVICE SECURITY

Types of mobile devices, Comparison of different mobile platforms, Mobile hardware
security, Mobile device risks Location tracking, Accessing Untrusted content, BYOD
risks, securing mobile devices Device setup, Device and App Management, Mobile device
App Security

15 WEEK COURSE PLAN

Week Lecture (2 hours) Pedagogy Practical (2 Pedagogy

hours)
Week 1 Mobile system archi- Explicit Teaching Hands-on ses- Demonstration
tecture mobile cellu- sion on NS3
lar systems GSM and
UMTS
Week 2 security attacks vul- Explicit Teaching Hands on session Demonstration
nerabilities in cellular for basics of Net-
services work Simulation
Week 3 cellular jamming at- Flipped Learning Hands on session Demonstration
tacks and mitigation for Evaluating
security in VoIP ser- the security
vices related perfor-
mance measures
Week 4 Introduction to wire- Explicit Teaching Implementation Problem based
less security, types of of Block hole Learning
security attacks attack
Week 5 security policies- Flipped Learning Implementation Project based
Symmetric Encryp- of Rushing Learning
tion and Message attack
Confidentiality
Week 6 Public Key Explicit Teaching Implementation Problem based
Cryptography- Man- of RSA Algo- Learning
aging security in rithm
wireless devices

263
Week 7 Overview of wireless Flipped Learning Implementaion Problem based
networking- WLAN of MD5 Algo- Learning
security models rithm
Week 8 Security in Wireless Explicit Teaching Implementation Project based
Cellular Networks – of Denial of Learning
Security in Mobile Ad service attack
hoc Network
Week 9 Security in Software Explicit Teaching Implementaion Problem based
defined Networks, Se- of Warmhole Learning
curity in Wireless Sen- attack
sor Networks
Week 10 Introduction to Explicit Teaching IDemonstrate Demonstration
Mobile Security -. how to provide
Building Blocks – secure data
Basic security and storage, secure
cryptographic tech- data transmis-
niques. Security sion and for
of GSM Networks- creating digital
Security of UMTS signatures
Networks -. LTE
Security . WiFi and
Bluetooth Security
Week 11 SIM/UICC Security - Flipped Learning Develop an Problem based
. Mobile Malware application that Learning
and App Security - writes data to
. Android Security the SD card
Model 10. IOS Secu- security
rity Model -. Security
Model of the Windows
Phone
Week 12 SMS/MMS, Mobile Explicit Teaching Develop a native Problem based
Geolocation and Mo- application that Learning
bile Web Security. uses GPS loca-
Security of Mobile tion information
VoIP Communica- and convert into
tions speech
Week 13 Types of mobile Flipped Learning Design a pro- Problem based
devices- Comparison gram for Cap- Learning
of different mobile ture image using
platforms- Mobile built in camera
hardware security and store it in
database
Week 14 Mobile device risks: Explicit Teaching Develop a bank- Problem based
Location tracking, Ac- ing application Learning
cessing Untrusted con- that registers
tent, BYOD risks- se- the user by
curing mobile devices verifying OTP

264
Week 15 Device setup, Device Explicit Teaching Design interac- Problem based
and App Manage- tive online shop- Learning
ment, Mobile device ping security
App Security

EXPERIMENTS:
1. Simulation of black hole attack

2. Simulation of denial of service attack

3. Simulation of rushing attack

4. Simulation of wormhole attack

5. Creating and intrusion detection system for wireless environment

6. Creating a mobile device security environment

7. Develop a banking application that registers the user by verifying OTP.

8. Design interactive online shopping security

9. Design a program for Capture image using built in camera and store it in database.

10. Develop a native application that uses GPS location information and convert into
speech

11. Develop an application that writes data to the SD card security

TEXT BOOK(S):
1. Wolfgang Osterhage, Wireless Security, CRC Press, Second Edition ,2018.

2. Hakima Chaouchi, Maryline Laurent-Maknavicius, Wireless and Mobile Networks

Security, Wiley, 2010

3. Anand R Prasad,Seung woo-seo,Security in next generation mobile networks, River

Publishers, Aalborg, 2011

265
 4.30 213CSE3313: GRAPH THEORY AND ITS APPLICA-
TIONS

213CSE3313 GRAPH THEORY AND ITS AP- L T P X C

PLICATIONS
3 0 2 0 4
Pre-requisite :NIL
Course Category :Program Elective
Course Type :Integrated Course - Theory

COURSE OBJECTIVES:
• Introduce the fundamental concepts in graph theory

• Train to use graphs as a modeling tool and solve non-trivial problems in computer
science

COURSE OUTCOMES:
CO1: Understand the basic concepts of graphs such as walks, paths and cycles

CO2: Apply the structural properties of graphs and design graph algorithms for finding
MST

CO3: Understanding of coloring techniques and knowledge of planarity of graphs

CO4: Reasonable know how of digraphs and ability to handle tournaments, critical paths,
flows and related supply and demand problems

CO5: Analyze the various computational issues and knowledge about small world phe-
nomenon

MAPPING OF COURSE OUTCOMES WITH PO, PSO:

PO’S PSO’S
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 S S
CO2 S S S S S S
CO3 S S S S S M M S
CO4 S S S S S M L M M S
CO5 S S S S S M L M M S

UNIT I: Basic Concepts

Sets, Binary Relations and Graphs, Degree, Radius, Diameter and Eccentricity, Weighted
Distance, Euler walks, Hamilton Cycles, Travelling Salesman Problem

266
UNIT II: Connectivity
Cut-points and Bridges, Blocks, connectivity, Characterizations of Trees, Spanning Trees,
Minimal Spanning Trees

UNIT III: Colorings and Planarity

Vertex Colorings, Brook’s Theorem, Counting Vertex Colorings, Edge Colorings, Class 2
Graphs, Representations and Crossings, Euler’s Formula, Maps, Graphs, and Planarity

UNIT IV: Directed Graphs

Basic Ideas, Orientations and Tournaments, Directed Euler Walks, Activity Graphs, Crit-
ical path Analysis, Critical Paths under uncertainty, Transportation networks and flows,
maximal flows, max flow-min-cut theorem, max-flow min-cut algorithm, supply and de-
mand problems

UNIT V: Computational Considerations

Computation time, data structures, graph algorithms, intractability, functions on graphs,
classes of graphs, small-world graphs

15 WEEK COURSE PLAN

Week Lecture (3 hours) Pedagogy Tutorial (1 hours)

Week 1 Sets, Binary Relations Explicit Teaching Binary relations
and Graphs, Degree problems
Week 2 Radius, Diameter Flipped Learning Weighted distance
and Eccentricity, problems
Weighted Distance
Week 3 Euler walks, Hamil- Explicit Teaching Hamilton cycles
ton Cycles, Travelling problems
Salesman Problem
Week 4 Cut-points and Explicit Teaching Cutpoints prob-
Bridges lems
Week 5 Blocks, connectivity, Flipped Learning Connectivity
Characterizations of problems
Trees
Week 6 Spanning Trees, Mini- Explicit Teaching Minimum Span-
mal Spanning Trees ning tree problems
Week 7 Vertex Colorings, Explicit Teaching Vertex coloring
Brook’s Theorem, problems
Counting Vertex
Colorings
Week 8 Edge Colorings, Class Flipped Learning Edge coloring
2 Graphs, Representa- problems
tions and Crossings

267
 Week 9 Euler’s Formula, Explicit Teaching Maps
Maps, Graphs, and
Planarity
Week 10 Basic Ideas, Orien- Explicit Teaching Activity Graphs
tations and Tourna-
ments, Directed Eu-
ler Walks, Activity
Graphs
Week 11 Critical path Anal- Explicit Teaching Critical paths
ysis, Critical Paths problems
under uncertainty,
Transportation net-
works and flows,
maximal flows
Week 12 max flow-min-cut the- Flipped Learning Supply and de-
orem, max-flow min- mand problems
cut algorithm, supply
and demand problems
Week 13 Computation time, Explicit Teaching Computation time
data structures
Week 14 Graph algorithms, in- Flipped Learning Graph algorithms
tractability, functions
on graphs
Week 15 Classes of graphs, Explicit Teaching Classes of graphs
small-world graphs

TEXT BOOK(S):
1. W.D. Wallis, A Beginner’s Guide to Graph Theory, Second Edition, Springer In-
ternational Edition, 2007, First Indian Edition 2011. Chapters 1-4, 7-8, 11-15.

REFERENCES:
1. Clark J. and Holton D.A, A First Look at Graph Theory, Allied Publishers, 1995.
2. Mott J.L., Kandel A. and Baker T.P. Discrete Mathematics for Computer Scientists
and Mathematicians , Prentice Hall of India, 1996.
3. Liu C.L., Elements of Discrete Mathematics, Mc Graw Hill, 1985.
4. Rosen K.H., Discrete Mathematics and Its Applications, Mc Graw Hill, 2007.
5. D.B.West, Introduction to Graph Theory, Prentice Hall of India, New Delhi, 2004.
6. J.A.Bondy and U.S.R Murty, Graph Theory, Springer, New York, 2008.
7. Santanu Saha Ray, Graph Theory with Algorithms and its Applications: In Applied
Science and Technology Springer, 2013.

268
 8. Jean-Claude Fournier, Graphs Theory and Applications: With Exercises and Prob-
lems John Wiley Sons.

9. Mamta Mittal, Graph Theory and Application, Anmol Publications Pvt. Ltd,2011.

10. Narsingh Deo, ”Graph Theory with Applications to Engineering and Computer
Science”, PHI Publisher, 2014.

11. Yellen J and Gross J, Graph Theory and its Applications, Chapman Hall, Boca
Raton, 2006

12. Grimaldi R.P. Discrete and Combinatorial Mathematics: An Applied Introduc-

tion,Addison Wesley, 1994.

269
 STREAM: ELECTRICAL AND ELECTRONICS COM-
MUNICATION
4.31 213CSE2313: EMBEDDED SYSTEMS

213CSE2313 EMBEDDED SYSTEMS L T P X C

3 0 2 0 4
Pre-requisite :NIL
Course Category :Program Elective
Course Type :Integrated Course - Theory

COURSE OBJECTIVES:
• To learn the architecture and programming of ARM processor.
• Understand the embedded computing platform design and analysis
• Get thorough knowledge in interfacing concepts and design an embedded system.

COURSE OUTCOMES:
CO1: Describe the architecture and programming of ARM processor.

CO2: Explain the concepts of embedded systems.

CO3: Understand the Concepts of peripherals and interfacing of sensors

CO4: Capable of using the system design techniques to develop firmware.

CO5: Illustrate the code for constructing a system.

CO6: Apply the concept of embedded System programming and explain the same exper-
imentally following the ethical norms as an individual or a team and express the
same in way of oral/written reports.
.

MAPPING OF COURSE OUTCOMES WITH PO, PSO:

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

270
UNIT I:INTRODUCTION TO EMBEDDED SYSTEMS AND
ARM PROCESSORS
Complex systems and microprocessors– Embedded system design process –Design ex-
ample: Model train controller- Instruction sets preliminaries - ARM Processor – CPU:
programming input and output- supervisor mode, exceptions and traps – Co-processors-
Memory system mechanisms – CPU performance- CPU power consumption.

UNIT II: EMBEDDED COMPUTING PLATFORM DESIGN

The CPU Bus-Memory devices and systems–Designing with computing platforms – con-
sumer electronics architecture – platform-level performance analysis - Components for
embedded programs- Models of programs- Assembly, linking and loading – compilation
techniques- Program level performance analysis – Software performance optimization –
Program level energy and power analysis and optimization – Analysis and optimization
of program size- Program validation and testing.

UNIT III: SENSOR INTERFACING WITH ARDUINO

Basics of hardware design and functions of basic passive components-sensors and actuators-
Arduino code - library file for sensor interfacing-construction of basic applications

UNIT IV: EMBEDDED FIRMWARE

Reset Circuit, Brown-out Protection Circuit-Oscillator Unit - Real Time Clock-Watchdog
Timer - Embedded Firmware Design Approaches and Development Languages.

UNIT V:EMBEDDED C PROGRAMMING

Introduction-Creating ‘hardware delays’ using Timer 0 and Timer 1-Reading Switches-
Adding Structure to the Code-Generating a minimum and maximum delay-Example:
Creating a portable hardware delay- Timeout mechanisms-Creating loop timeouts-Testing
loop timeouts- hardware timeouts-Testing a hardware timeout

15 WEEK COURSE PLAN

Week Lecture (3 hours) Pedagogy Practical (2 hours)

Complex systems and mi- Explicit Study of ARM evaluation
Week 1 croprocessors Teaching system
Embedded system design Explicit Study of ARM evaluation
process Teaching system
Design example: Model Demonstration Study of ARM evaluation
train controller system
Instruction sets preliminar- Explicit Study of ARM evaluation
Week 2
ies - Teaching system
ARM Processor Explicit Study of ARM evaluation
Teaching system

271
 CPU: programming input Problem solv- Interfacing ADC and DAC.
and output ing
Week 3
supervisor mode, exceptions Problem solv- Interfacing ADC and DAC.
and traps ing
Co-processors- Memory sys- Explicit Interfacing ADC and DAC.
tem mechanisms Teaching
CPU performance- CPU Explicit Interfacing ADC and DAC.
power consumption. Teaching
The CPU Bus Explicit Interfacing EPROM and in-
Teaching terrupt.
Week 4
Memory devices and sys- Explicit Interfacing EPROM and in-
tems Teaching terrupt.
Designing with computing Explicit Interfacing EPROM and in-
platforms Teaching terrupt.
consumer electronics archi- Explicit Interfacing EPROM and in-
tecture Teaching terrupt.
Platform-level performance Explicit Interfacing keyboard
analysis Teaching
Week 5
Components for embedded Explicit Interfacing keyboard
programs Teaching
Models of programs Explicit Interfacing keyboard
Teaching
Assembly, linking and load- Explicit Interfacing keyboard
ing Teaching
The CPU Bus Explicit Interfacing EPROM and in-
Teaching terrupt.
Week 6
Memory devices and sys- Explicit Interfacing EPROM and in-
tems Teaching terrupt.
Designing with computing Explicit Interfacing EPROM and in-
platforms Teaching terrupt.
consumer electronics archi- Explicit Interfacing EPROM and in-
tecture Teaching terrupt.
Compilation techniques Explicit Interfacing LCD.
Teaching
Program level performance Explicit Interfacing LCD.
Week 6
analysis Teaching
Software performance opti- Explicit Interfacing LCD.
mization Teaching
Program level energy and Explicit Interfacing LCD.
power analysis and opti- Teaching
mization
Analysis and optimization Explicit Interfacing LCD.
of program size Teaching
Program validation and Explicit Interfacing LCD.
testing Teaching

272
 Basics of hardware design Explicit Interfacing LED.
Week 7
and functions of basic pas- Teaching
sive components
Sensors and actuators Explicit Interfacing LED.
Teaching
Arduino code Demonstration, Interfacing stepper motor
Week 8
Problem
Solving
library file for sensor inter- Demonstration, Interfacing stepper motor
facing Problem
Solving
Week 9 Arduino code Demonstration, Interfacing temperature
Problem sensor.
Solving
Reset Circuit Demonstration, Interfacing serial port.
Week 10
Problem
Solving
Brown-out Protection Demonstration, Interfacing serial port.
Circuit-Oscillator Unit problem solv-
ing
Real Time Clock Demonstration, Interfacing real time clock
Week 11
Problem
Solving
Watchdog Timer Demonstration Interfacing real time clock
Week 12 Embedded Firmware De- Explicit Interrupt performance char-
sign Approaches and Devel- Teaching acteristics of ARM
opment Languages
Introduction-Creating Demonstration, Interrupt performance char-
‘hardware delays’ using Problem acteristics of FPGA.
Week 13
Timer 0 and Timer 1 Solving
Reading switches Demonstration, Interrupt performance char-
Problem acteristics of FPGA.
Solving
Adding Structure to the Demonstration, Interrupt performance char-
code Problem acteristics of FPGA.
Solving
Generating a minimum and Demonstration, Interrupt performance char-
maximum delay Problem acteristics of FPGA.
Solving
Example: Creating a Demonstration, Flashing of LEDS.
Week 14
portable hardware delay Problem
Solving
Timeout mechanisms Demonstration, Flashing of LEDS.
Problem
Solving

273
 Creating loop timeouts Demonstration, Interfacing seven segment
Problem LEDs
Week 15
Solving
Testing loop timeouts Demonstration, Interfacing seven segment
Problem LEDs
Solving
Jardware timeouts Demonstration, Interfacing seven segment
Problem LEDs
Solving
Testing a hardware timeout Demonstration, Interfacing seven segment
Problem LEDs
Solving

EXPERIMENTS:
1. Study of ARM evaluation system
2. Interfacing ADC and DAC.
3. Interfacing LED.
4. Interfacing real time clock and serial port.
5. Interfacing keyboard and LCD.
6. Interfacing EPROM and interrupt.
7. Interrupt performance characteristics of ARM and FPGA.
8. Flashing of LEDS.
9. Interfacing stepper motor and temperature sensor.

TEXT BOOK(S):
1. Marilyn Wolf, “Computers as Components - Principles of Embedded Computing
System Design”, 3rd Edition “Morgan Kaufmann Publisher, 2012.
2. Michael J. Pont, “Embedded C”, 2nd Edition, Pearson Education, 2008.

REFERENCES:
1. Shibu K.V, “Introduction to Embedded Systems”, McGraw Hill.2014
2. Jonathan W.Valvano, “Embedded Microcomputer Systems Real Time Interfacing”,
3rd Edition, Cengage Learning, 2012
3. Raj Kamal, “Embedded Systems-Architecture, programming and design”, 3rd Edi-
tion TMH.2015
4. David E. Simon, “An Embedded Software Primer”, Pearson Education,2000.

274
 4.32 213CSE2314: RFID AND ITS APPLICATIONS

213CSE2314 RFID and its Applications L T P X C

3 1 0 0 4
Pre-requisite :NIL
Course Category :Program elective
Course Type :Integrated Course - Theory

COURSE OBJECTIVES:
• To introduce students to the principles and concepts on the emerging technology of
Radio Frequency Identification (RFID) and to provide with the knowledge required
for designing, developing, implementing and administering RFID-based business or
industrial applications..

COURSE OUTCOMES:
CO1: Learn the basic components and applications of RFID systems.

CO2: Analyse and characterize RFID readers and Tags/

CO3: Analyse and appreciate various antennas used in RFID systems.

CO4: Analyse and characterize RFID protocols and Standards.

CO5: Analyse and characterize RFID security.

MAPPING OF COURSE OUTCOMES WITH PO, PSO:

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

UNIT I: RFID Basics

History and Practice of RFID – RFID Systems and Terminology – Types of RFID –
Frequency Bands for RFID – Tags-Passive, Semi passive, and Active Tags. Radio Basics
for UHF RFID -Signal Voltage and Power – Information – Modulation, and Multiplexing
– Backscatter Radio Links – Link Budgets – Effect of Antenna Gain and Polarization on
Range – Propagation in the Real World.

275
UNIT II: RFID Readers and Tags
UHF RFID Readers: Radio Architectures and Components - RFID Transmitters and
RFID Receivers - Digital-Analog Conversion and Signal Processing - Packaging and Power
UHF RFID Tags: Power and Powerlessness - RF to DC - Getting Data - Talking Back
- Tag IC Overall Design Challenges - Packaging

UNIT III: RFID Antennas

Reader Antennas: Antennas for Fixed Readers – Antennas for Handheld or Portable
Readers – Nearfield Antennas – Cables, and Connectors
Tag Antennas: Practical challenges of Tag antenna – Impedance Matching and Power
Transfer – Dipoles and Derivatives – Tags and the (local) Environment – Near-field and
Hybrid Tag Antennas

UNIT IV: RFID Protocols and Standards

EPC global Generation 1-EPC global Class 0, EPC global Class 1 Generation 1 – ISO
18000-6B (Intellitag), ISO 18000-6C (EPC global Class 1 Generation 2), RFID Standards,
Laws, Regulations, Policies, and Guidelines

UNIT V: RFID Security and Applications

RFID Security: Confidentiality, Integrity, Availability, Threats, Cryptography, and
Threat Modelling
RFID Applications: Aircraft Identification, Railcar Tracking, Automobile Tolling, An-
imal Tracking, Container Tracking, Supply Chain Tracking for Consumer Goods

15 WEEK COURSE PLAN

Weeks Lecture (3 Hours) Pedagogy

History and Practice of RFID –
Explicit Teaching
RFID Systems and Terminology
Week 1
Types of RFID – Frequency Bands for RFID Explicit Teaching
Tags-Passive, Semi passive, and Active Tags Explicit Teaching
Radio Basics for UHF RFID Explicit Teaching
Week 2 Signal Voltage and Power Explicit Teaching
Information – Modulation, and Multiplexing Explicit Teaching
Backscatter Radio Links Explicit Teaching
Link Budgets Explicit Teaching
Week 3
Effect of Antenna Gain and Polarization on Range Explicit Teaching
Propagation in the Real World Explicit Teaching
Radio Architectures Explicit Teaching
Week 4
Radio Components – Amplifier – power,
gain bandwidth, distortion, (concept only), Explicit Teaching
noise (concept only), mixers (concept only)

276
 Weeks Lecture (3 Hours) Pedagogy
conversion loss & Spurious Frequencies,
Oscillator, filters, Digital Analog Conversion,
Week 5 Explicit Teaching
Circulators and Directional Couplers
(basic concepts only)
RFID Transmitters Explicit Teaching
Week 6
Transmitter Architectures,
Transmit Power Efficiency,
Explicit Teaching
Phase and Amplitude Noise
(concepts only)
Receiver Architectures,
Week 7 Phase and Amplitude Noise Explicit Teaching
and Sensitivity, Friis equation
Digital-Analog Conversion and
Week 8 Explicit Teaching
Signal Processing, Packaging and power
UHF RFID Tags: Power and Powerlessness Explicit Teaching
RF to DC Explicit Teaching
Getting Data Explicit Teaching
Week 9
Talking Back Explicit Teaching
Tag IC Overall Design Challenges Explicit Teaching
Packaging Explicit Teaching
Antennas for Fixed Readers Explicit Teaching
Antennas for Handheld or Portable Readers Explicit Teaching
Week 10
Nearfield Antennas Explicit Teaching
Cables, and Connectors Explicit Teaching
Tag Antennas: Practical challenges of Tag antenna Explicit Teaching
Week 11
Impedance Matching and Power Transfer Explicit Teaching
Dipoles and Derivatives Explicit Teaching
Week 12 Tags and the (local) Environment Explicit Teaching
Near-field and Hybrid Tag Antennas Explicit Teaching
EPC global Generation 1-EPC global Class 0,
Explicit Teaching
Week 13 EPC global Class 1 Generation 1
ISO 18000-6B (Intellitag), ISO 18000-6C
Explicit Teaching
(EPC global Class 1 Generation 2)
RFID Applications - Aircraft Identification,
Railcar Tracking, Automobile Tolling,
Week 14 Explicit Teaching
Animal Tracking, Container Tracking,
Supply Chain Tracking for Consumer Goods
Things to Keep in Mind: Makers,
Week 15 Explicit Teaching
Things to Keep in Mind: Users

TEXT BOOK(S):
1. A1.Daniel M. Dobkin, The RF in RFID: UHF RFID in Practice, Elsevier/Newness,
U.S./India, 2012(2nd Edition), ISBN: 9780123945839.

277
 2. Jari-Pascal Curty, Michel Declercq, Catherine Dehollain, Norbert Joehl, Design and
Optimization of Passive UHF RFID Systems, Springer, 2007, ISBN: 9780387352749

REFERENCES:
1. 1.Tom Igoe, Getting Started with RFID: MAKE-OBJECTS, OReilly/Make: makezine.com,
2012, ISBN: 9781449324186

2. Amin Rida, Li Yang, Manos M. Tentzeris, RFID-Enabled Sensor Design and Ap-
plications, Artech House, 2010, ISBN: 9781607839811

278
 4.33 213CSE3314: COGNITIVE RADIO

213CSE3314 Cognitive Radio L T P X C

3 1 0 0 4
Pre-requisite :NIL
Course Category :Program Elective
Course Type :Integrated Course - Theory

COURSE OBJECTIVES:
• On completion of the course delegates will be able:
• To understand the evolving software defined radio and cognitive radio techniques
and their essential functionalities, study the basic architecture and standard for
cognitive radio, understand the physical, MAC and Network layer design of cogni-
tive radio and to expose the student to evolving applications and advanced features
of cognitive radio.

COURSE OUTCOMES:
CO1: Understand the principles of software defined radio and cognitive radio.

CO2: Relate hardware and software architecture of Cognitive radio

CO3: Analyse the user detection techniques and spectrum sensing in cognitive radio

CO4: Design the MAC and Network layer for Cognitive Radio.

CO5: Apply the knowledge of advanced features of cognitive radio for real world applica-
tions.

MAPPING OF COURSE OUTCOMES WITH PO, PSO:

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

UNIT I: Introduction to Cognitive Radio

Evolution of Software Defined Radio and Cognitive radio: goals, benefits, definitions,
architectures, relations with other radios, issues, enabling technologies, radio frequency
spectrum and regulations.

279
UNIT II: Cognitive Radio Architecture
Cognition cycle – orient, plan, decide and act phases, Organization, SDR as a platform
for Cognitive Radio – Hardware and Software Architectures, Overview of IEEE 802.22
standard for broadband wireless access in TV bands.

UNIT III: Spectrum Sensing and Dynamic Spectrum Access

Introduction – Primary user detection techniques – energy detection, feature detection,
matched filtering, cooperative detection and other approaches, Fundamental Tradeoffs in
spectrum sensing, Spectrum Sharing Models of Dynamic Spectrum Access - Unlicensed
and Licensed Spectrum Sharing, Fundamental Limits of Cognitive Radio.

UNIT IV: MAC and Network Layer Design for Cognitive Radio
MAC for cognitive radios – Polling, ALOHA, slotted ALOHA, CSMA, CSMA / CA, Net-
work layer design – routing in cognitive radios, flow control and error control techniques.

UNIT V: Advanced Topics in Cognitive Radio

Overview of security issues in cognitive radios, auction based spectrum markets in cog-
nitive radio networks, public safety and cognitive radio, cognitive radio for Internet of
Things.

15 WEEK COURSE PLAN

Week Lecture (3 Hours) Pedagogy

Evolution of Software
Explicit Teaching
Defined Radio
Week 1
Cognitive radio: goals,
Explicit Teaching
benefits, definitions
Architectures Demonstration
Relations with other radios,
Week 2 issues, Explicit Teaching
enabling technologies
Radio frequency spectrum
Week 3 Explicit Teaching
and regulations.
Cognition cycle – orient, plan,
Week 4 decide and act phases, Explicit Teaching
Organization
SDR as a platform for
Week 5 Cognitive Radio Explicit Teaching
Hardware and Software
Architectures
Overview of IEEE 802.22
Week 6 standard for broadband Explicit Teaching
wireless access in TV bands

280
 Week Lecture (3 Hours) Pedagogy
Introduction – Primary user
detection techniques –
energy detection, feature
Week 7 Explicit Teaching
detection, matched filtering,
cooperative detection and
other approaches
Fundamental Trade-offs in
spectrum sensing, Spectrum
Week 8 Explicit Teaching
Sharing Models of Dynamic
Spectrum Access
Unlicensed and Licensed
Week 9 Spectrum Sharing, Fundamental Explicit Teaching
Limits of Cognitive Radio.
MAC for cognitive radios –
Week 10 Demonstration
Polling, ALOHA, slotted ALOHA
CSMA, CSMA / CA,
Week 11 Demonstration
Network layer design
Routing in cognitive radios,
Week 12 flow control and error Explicit Teaching
control techniques
Overview of security issues
Week 13 Explicit Teaching
in cognitive radios
auction based spectrum markets
Week 14 Demonstration
in cognitive radio networks
public safety and cognitive radio,
Week 15 Explicit Teaching
cognitive radio for Internet of Things

TEXT BOOK(S):
1. Alexander M. Wyglinski, Maziar Nekovee, Thomas Hou, “Cognitive Radio Com-
munications and Networks”, Academic Press, Elsevier, 2010.

2. Huseyin Arslan (Ed.), “Cognitive Radio, Software Defined Radio, and Adaptive
Wireless Systems”, Springer, 2014.

REFERENCES:
1. Bruce Fette, “Cognitive Radio Technology”, Newnes, 2006.

2. Kwang-Cheng Chen, Ramjee Prasad, “Cognitive Radio Networks”, John Wiley and
Sons, 2009. Ezio Biglieri, Professor Andrea J. Goldsmith, Dr Larry J. Greenstein,
Narayan B. Mandayam, H. Vincent Poor, “Principles of Cognitive Radio”, Cam-
bridge University Press, 2012.

281
 4.34 213CSE3315: PRINCIPLES OF COMMUNICATION

213CSE3315 PRINCIPLES OF COMMUNICA- L T P X C

TION
3 0 2 0 4
Pre-requisite :NIL
Course Category :Program Elective
Course Type :Integrated Course - Theory

COURSE OBJECTIVES:
• To study the techniques of analog modulation.

• Pulse modulation and digital modulation.

• The principles behind information theory.

• Coding and digital communication techniques.

COURSE OUTCOMES:
CO1: Understand the Analog modulation techniques

CO2: Understand the Pulse modulation techniques

CO3: Apply digital communication techniques

CO4: Analyse Source and Error control coding

CO5: Analyse the Multiple Access techniques

CO6: Apply the concept of analog and digital modulation techniques experimentally fol-
lowing the ethical norms as an individual or a team and express the same in way
of oral/written reports
.

MAPPING OF COURSE OUTCOMES WITH PO, PSO:

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

282
UNIT I: ANALOG MODULATION
Amplitude Modulation – AM, DSBSC, SSBSC, VSB – PSD, modulators and demodula-
tors – Angle modulation – PM and FM – PSD, modulators and demodulators – Super-
heterodyne receivers.

UNIT II: PULSE MODULATION

Low pass sampling theorem – Quantization – PAM – Line coding – PCM, DPCM, DM,
and ADPCM and ADM, Channel Vocoder - Time Division Multiplexing, Frequency Di-
vision Multiplexing.

UNIT III: DIGITAL MODULATION AND TRANSMISSION

Phase shift keying – BPSK, DPSK, QPSK – Principles of M-Array signalling, M-array
PSK QAM – Comparison, ISI – Pulse shaping – Duo binary encoding – Cosine filters –
Eye pattern, equalizers.

UNIT IV: INFORMATION THEORY AND CODING

Measure of information – Entropy – Source coding theorem – Shannon–Fano coding,
Huffman Coding, LZ Coding – Channel capacity – Shannon-Hartley law – Shannon’s
limit – Error control codes – Cyclic codes, Syndrome calculation – Convolution Coding,
Sequential and Viterbi decoding

UNIT V: SPREAD SPECTRUM AND MULTIPLE ACCESS

PN sequences – properties – m-sequence – DSSS – Processing gain, Jamming – FHSS –
Synchronisation and tracking – Multiple Access – FDMA, TDMA, CDMA

283
15 WEEK COURSE PLAN

Week Lecture (3 hours) Pedagogy Practical (2 hours)

Week 1 Amplitude Modulation – Explicit Amplitude Modulation
AM, DSBSC, SSBSC, VSB Teaching/ techniques with DSBSC,
Demonstra- SSBSC using MATLAB
tion
Week 2 PSD, modulators and de- Explicit Design of modulators
modulators Teaching/ and demodulators for
Demonstra- Analog Modulation using
tion SIMULINK

Angle modulation – PM and Explicit Design of modulators

Week 3
FM PSD, modulators and Teaching/ and demodulators for
demodulators Demonstra- Phase Modulation using
tion SIMULINK
Superheterodyne receivers Explicit Design of modulators
Teaching/ and demodulators for
Demonstra- Phase Modulation using
tion SIMULINK
Week 4 Low pass sampling theo- Explicit PAM, PCM and DPCM us-
rem – Quantization – PAM, Teaching/ ing MATLAB
PCM, DPCM Demonstra-
tion
Line coding – DM, and AD- Explicit DM and ADPCM using
Week 5
PCM and ADM Teaching/ MATLAB
Demonstra-
tion
Week 6 Channel Vocoder - Time Explicit TDM and FDM using
Division Multiplexing, Fre- Teaching/ SIMULINK
quency Division Multiplex- Demonstra-
ing tion
Week 7 Phase shift keying – BPSK, Explicit BPSK, DPSK, QPSK using
DPSK, QPSK Teaching/ MATLAB
Demonstra-
tion
Week 8 Principles of M-Array sig- Explicit M-ary Signalling, M-ary
nalling, M-array PSK and Teaching/ PSK and QAM using MAT-
QAM Demonstra- LAB
tion
Week 9 Comparison, ISI – Pulse Explicit Synthesis of Eye pattern us-
shaping – Duo binary en- Teaching/ ing MATLAB
coding – Cosine filters – Eye Demonstra-
pattern, equalizers tion
Measure of information – Explicit Fano coding, Huffman Cod-
Week 10
Entropy Teaching/ ing and LZ coding using
Demonstra- MATLAB
tion

284
 Source coding theorem Explicit Fano coding, Huffman Cod-
– Shannon–Fano cod- Teaching/ ing and LZ coding using
ing, Huffman Coding, LZ Demonstra- MATLAB
Coding tion
Channel capacity – Explicit Cyclic codes using MAT-
Week 11
Shannon-Hartley law – Teaching/ LAB
Shannon’s limit Demonstra-
tion
Error control codes – Cyclic Explicit Cyclic codes using MAT-
codes, Syndrome calcula- Teaching/ LAB
tion Demonstra-
tion
Week 12 Convolution Coding, Se- Explicit Convolution coding using
quential and Viterbi decod- Teaching/ MATLAB
ing
Week 13 PN sequences – properties – Explicit Generation of PN sequences
m-sequence – DSSS Teaching/ using MATLAB
Demonstra-
tion
Week 14 Processing gain, Jamming Explicit Multiple Access Techniques
– FHSS – Synchronisation Teaching/ such as FDMA, TDMA us-
and tracking, Multiple Ac- ing MATLAB
cess
Week 15 FDMA, TDMA, CDMA Explicit Multiple Access Techniques
Teaching/ such as CDMA using MAT-
Demonstra- LAB
tion

EXPERIMENTS:
1. Amplitude Modulation techniques with DSBSC, SSBSC using MATLAB

2. Phase Modulations – FM, PM using MATLAB

3. PCM and DPCM

4. DM and ADPCM

5. Phase shift keying techniques

6. M-array PSK and QAM

7. Cyclic Codes

8. Convolution Coding

9. Multiple Access Techniques such as FDMA, TDMA and CDMA

285
TEXT BOOK(S):
1. H Taub, D L Schilling, G Saha, “Principles of Communication Systems” 3/e, TMH
2007

2. S. Haykin “Digital Communications” John Wiley 2005

REFERENCES:
1. B.P.Lathi, “Modern Digital and Analog Communication Systems”, 3rd edition,
Oxford University Press, 2007.

2. H P Hsu, Schaum Outline Series “Analog and Digital Communications” TMH,

2006.

3. B.Sklar, Digital Communications Fundamentals and Applications” 2/e Pearson Ed-

ucation 2007.

286
 4.35 213CSE3316–SIGNAL AND IMAGE PROCESSING

213CSE3316 SIGNAL AND IMAGE PROCESS- L T P X C

ING
3 0 2 0 4
Pre-requisite :NIL
Course Category :Program Elective
Course Type :Integrated Course - Theory

COURSE OBJECTIVES:
• To understand the basics of signal systems.

• Analyse signals using Fourier and Wavelet Transforms.

• Study the digital image fundamentals.

• Get exposed to image enhancement techniques.

• To study the image segmentation and representation techniques.

COURSE OUTCOMES:
CO1: Understand different types of Signals and Systems

CO2: Understand the different transform techniques of signals

CO3: Analyse the various types of images and analyse them

CO4: Analyse the methodologies for image enhancement and restoration

CO5: Analyse the methodologies for image enhancement and restoration

CO6: Apply the concept of signal and image processing experimentally following the
ethical norms as an individual or a team and express the same in way of oral/written
reports.
.

287
MAPPING OF COURSE OUTCOMES WITH PO, PSO:
PO’S PSO’S
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 S S
CO2 S S S S
CO3 S S M L S
CO4 S S S L S
CO5 S M L S
CO6 S S M S S M S

UNIT I: BASICS OF SIGNALS AND SYSTEMS

Definition of Signals and System, Classification of Signals and Systems, Signal Operations,
Basic Signals, Two Dimensional and Three-Dimensional Signals.

UNIT II: TRANSFORMS AND ITS APPLICATIONS

Introduction to Fourier Transform and its Properties, Discrete Time Fourier Transform
and its Properties, Fast Fourier Transform, Introduction to Wavelet Transform, types
and its properties. Application of transforms in one dimensional signal processing

UNIT III: BASICS OF IMAGE PROCESSING

Introduction –Steps in Image Processing Systems – Image Acquisition – Sampling and
Quantization – Pixel Relationships – File Formats – colour images and models - Image
Operations – Arithmetic, logical, statistical and spatial operations.

UNIT IV: IMAGE ENHANCEMENT AND RESTORATION

Spatial Domain Image Enhancement- Point Processing, Histogram, Histogram Equaliza-
tion. Frequency Domain: Filtering in Frequency Domain – Smoothing and Sharpening
filters – Homomorphic Filtering. Introduction to Image Restoration – Noise Models

UNIT V: IMAGE SEGMENTATION AND ANALYSIS

Detection of Discontinuities – Edge Operators – Edge Linking and Boundary Detection –
Thresholding – Region Based Segmentation – Motion Segmentation Features – Textures -
Boundary representations and Descriptions- Component Labeling – Regional descriptors
and Feature Selection Techniques. Feature extraction and representation, Statistical,
Shape, Texture, feature and statistical image classification.

15 WEEK COURSE PLAN

Week Lecture (3 hours) Pedagogy Practical (2 hours)

288
 Definition of Signals and Explicit Generation of Continuous
Week 1 System Teaching/ and Discrete Time Unit Im-
Demonstra- pulse, Unit Step and Unit
tion Ramp Signals, Rectangular,
Triangular and Exponential
Signals in MATLAB
Classification of Signals and Explicit Generation of Continuous
Systems Teaching/ and Discrete Time Unit Im-
Demonstra- pulse, Unit Step and Unit
tion Ramp Signals, Rectangular,
Triangular and Exponential
Signals in MATLAB
Properties of LTI System Explicit Generation of Signum Func-
Teaching/ tion, Sinusoidal Signals us-
Demonstra- ing MATLAB
tion
Signal Operations Explicit Addition, Subtraction and
Week 2
Teaching/ Multiplication of Signals us-
Demonstra- ing MATLAB
tion
Convolution Explicit Time Scaling, Time Shift-
Teaching/ ing, Amplitude Scaling and
Demonstra- Time Reversal on Signals
tion using MATLAB Convolu-
tion of two signals using
MATLAB
Basic Signals Explicit Generation of two dimen-
Week 3
Teaching/ sional signals using MAT-
Demonstra- LAB
tion
Two Dimensional and Explicit Generation of two dimen-
Three-Dimensional Signals Teaching/ sional signals using MAT-
Demonstra- LAB
tion
Introduction to Fourier Explicit Signal Transformation us-
Week 4
Transform and its Proper- Teaching/ ing Fourier Transform using
ties Demonstra- MATLAB
tion
Discrete Time Fourier Explicit Signal Transformation
Transform and its Proper- Teaching/ using Continuous Fourier
ties Demonstra- Transform using MATLAB
tion
Fast Fourier Transform Explicit Fast Fourier Transform us-
Week 5
Teaching/ ing MATLAB
Demonstra-
tion

289
 Introduction to Wavelet Explicit Signal Transformation us-
Transform, types and its Teaching/ ing Wavelet Transform in
properties Demonstra- MATLAB
tion
Week 6 Application of transforms in Explicit Analysis of one dimensional
one dimensional signal pro- Teaching/ signals using Transforms in
cessing Demonstra- MATLAB
tion
Week 7 Introduction. Steps in Im- Explicit Image sampling and Quan-
age Processing Systems, Im- Teaching/ tization
age Acquisition, Sampling Demonstra-
and Quantization – Pixel tion
Relationships
Week 8 File Formats – colour im- Explicit Image conversion from RGB
ages and models Teaching/ to Greyscale conversion and
Demonstra- Gray scale to Binary using
tion MATLAB
Week 9 Image Operations – Arith- Explicit Fast Fourier Transform us-
metic, logical, statistical Teaching/ ing MATLAB
and spatial operations Demonstra-
tion
Spatial Domain Image Explicit Image Enhancement in Spa-
Week 10
Enhancement- Point Pro- Teaching/ tial Domain
cessing Demonstra-
tion
Histogram, Histogram Explicit Image Enhancement in Spa-
Equalization Teaching/ tial Domain
Demonstra-
tion
Week 11 Filtering in Frequency Explicit Image Enhancement in Fre-
Domain, Smoothing and Teaching/ quency Domain
Sharpening filters Demonstra-
tion
Week 12 Homomorphic Filtering. Explicit Image Enhancement in Fre-
Introduction to Image Teaching/ quency Domain
Restoration – Noise Models
Week 13 Detection of Discontinuities Explicit Region Based Image Seg-
– Edge Operators – Edge Teaching/ mentation using MATLAB
Linking and Boundary De- Demonstra-
tection – Thresholding tion
Week 14 Region Based Segmenta- Explicit Boundary Based Image Seg-
tion – Motion Segmenta- Teaching/ mentation using MATLAB
tion Features – Textures Demonstra-
- Boundary representations tion
and Descriptions- Compo-
nent Labeling

290
Week 15 Regional descriptors and Explicit Feature Extraction and
Feature Selection Tech- Teaching/ Classification using MAT-
niques. Feature extraction Demonstra- LAB
and representation, Sta- tion
tistical, Shape, Texture,
feature and statistical
image classification

EXPERIMENTS:
1. Generation of Basic Signals using MATLAB / PYTHON

2. Operations on Basic Signals using MATLAB / PYTHON

3. Signal Transformation using Fourier transforms

4. Signal Transformation using Wavelet Transforms

5. RGB to Greyscale conversion

6. Greyscale to Binary Conversion

7. Image Enhancement in Frequency Domain

8. Image Enhancement in Spatial Domain

9. Region Based and Boundary Based Image Segmentation

10. Feature Extraction and Classification

TEXT BOOK(S):
1. Allan V.Oppenheim, S.Wilsky and S.H.Nawab, “Signals and Systems”, Pearson,
2015.(Unit I-II)

2. Rafael C. Gonzalez, Richard E. Woods, ‘Digital Image Processing’, Pearson, Third

Edition, 2010. (Unit III-V)

REFERENCES:
1. B. P. Lathi, “Principles of Linear Systems and Signals”, Second Edition, Oxford,
2009.

2. R.E.Zeimer, W.H.Tranter and R.D.Fannin, “Signals Systems - Continuous and

Discrete”, Pearson, 2007.

3. John Alan Stuller, “An Introduction to Signals and Systems”, Thomson, 2007.

4. Anil K. Jain, ‘Fundamentals of Digital Image Processing’, Pearson, 2002.

291
 STREAM: SOFTWARE DEVELOPMENT
4.36 213CSE1306: WEB TECHNOLOGY

213CSE1306 WEB TECHNOLOGY L T P X C

3 0 2 0 4
Pre-requisite :NIL
Course Category :Program Elective
Course Type :Integrated Course - Theory

COURSE OBJECTIVES:
• To make students to familiar with client server architecture and able to develop a
web application using various technologies.

• To assist students to gain skills and project-based experience needed for entry into
web application development careers.

• To learn the various installation procedure for embedding

• To design an interactive web site with various controls

COURSE OUTCOMES:
CO1: Interpret the technologies in web development

CO2: Develop programs using various scripting languages

CO3: Create an interactive web application using user interfaces

CO4: Understand the basics of server side scripting and learn the web server installation
procedure

CO5: Analyze various database connectives and create an interactive web application

MAPPING OF COURSE OUTCOMES WITH PO, PSO:

PO’S PSO’S
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 S M L L S S L M S
CO2 S S S S S M S M M M S
CO3 S S S S S M L L L L L L S
CO4 S S S S S M M M S S
CO5 S S S S S S M M M S L S S

292
UNIT I INTRODUCTION TO WEB TECHNOLOGIES
Evolution of the Internet and World Wide Web–Web Basics -Client-Side Scripting ver-
sus Server-Side Scripting-World Wide Web Consortium (W3C) -Web 2.0-Introduction to
HTML5- Editing HTML5- Validation Service- Headings - Linking - Images -alt Attribute-
Void Elements-Using Images as Hyperlinks - Special Characters and Horizontal Rules -
Lists - Tables - Forms- Internal Linking - meta Elements - New HTML5 Form input
Types- Page-Structure Elements -ARIA- attributes and roles - SEO techniques.

UNIT II CSS AND SCRIPTING LANGUAGES

Introduction to Cascading Style Sheets- Inline Styles - Embedded Style Sheets - Conflict-
ing Styles - Linking External Style Sheets - Positioning Elements-Backgrounds Element
Dimensions -Box Model and Text Flow Media Types and Media Queries - Drop-Down
Menus -User Style Sheets- JavaScript: Introduction to Scripting- Displaying a Line of
Text with JavaScript in a Web Page -Modifying Your First Script -Obtaining User In-
put with prompt Dialogs-Dynamic Welcome Page - Adding Integers-Memory Concepts-
Arithmetic -Decision Making: Equality and Relational Operators, Control Statements
,functions, arrays.

UNIT III XML AND INTERNET APPLICATION

XML -Introduction -XML Basics - Structuring Data -XML Namespaces-Document Type
Definitions (DTDs)-W3C XML Schema Documents-XML Vocabularies-Ajax-Enabled Rich
Internet Applications with XML and JSON-Introduction History of Ajax- “Raw” Ajax
Example Using the XMLHttpRequest Object - Asynchronous Requests-Exception Han-
dling -Callback Functions -XMLHttpRequest Object Event, Properties and Methods-
Using XML and the DOM- Creating a Full-Scale Ajax-Enabled Application-AJAX ser-
verset - Using JSON- Rich Functionality - Interacting with a Web Service on the Server-
Parsing JSON Data

UNIT IV WEB SERVERS WEB DATABASES

Introduction -HTTP Transactions-Multitier Application -architecture - Client-Side Script-
ing versus Server-Side Scripting Accessing Web Servers - Apache, MySQL and PHP In-
stallation XAMPP Installation ,running ,testing procedures, Microsoft IIS Express and
Web Matrix - Installing, running ,client side, PHP examples- -MySQL –mock databases -
Microsoft Language Integrate Query - Java DB/Apache Derby – Introduction of - REST
APIs

UNIT V WEB APPLICATION DEVELOPMENT

Introduction -Your First ASP.NET Application in C and Visual basic-Building the Web-
Time Application-Standard Web Controls: Designing a Form Validation Controls- Session
Tracking-Web Services-Case Study: Database-Driven ASP.NET Guestbook, Case Study:

293
Password-Protected Books Database Application– React - supporting interact with react
– dynamic react mock-ups -React Hooks- SCRATCH Frame work

15 WEEK COURSE PLAN

Week Lecture (3 hours) Pedagogy Practical(2 hours)

Week 1 TEvolution of the Internet Explicit Teach- Using HTML5 canvas with
and World Wide Web-Web ing JavaScript to draw lines,
Basics -Client-Side Script- rectangles, arcs, and circles
ing
Week 2 Introduction to HTML5- Explicit Teach- Using HTML5 to create a
Editing HTML5- Validation ing animated house using vari-
Service- Headings - Linking ous controls
- Images-alt Attribute- Void
Elements-Using Images as
Hyperlinks
Week 3 Special Characters and Hor- Explicit Teach- Use HTML to create a inter-
izontal Rules -Lists - Ta- ing active Website with course
bles - Forms- Internal Link- registration form
ing - meta Elements -
New HTML5 Form input
Types and Examples -Page-
Structure Elements
Week 4 Embedded Style Sheets - Explicit Teach- Using HTML5 canvas with
Conflicting Styles -Linking ing JavaScript to draw gradi-
External Style Sheets - ents and shadows
Positioning Elements-
Backgrounds Element
Dimensions
Week 5 Box Model and Text Flow Explicit Teach- Create a Time table for en-
Media Types and Me- ing tire class
dia Queries - Drop-Down
Menus -User Style Sheets -
JavaScript: Introduction to
Scripting- Displaying a Line
of Text with JavaScript in
a Web Page
Week 6 Modifying Your First Explicit Teach- Create a animated images
Script -Obtaining User ing with all controls
Input with prompt Dialogs-
Dynamic Welcome Page -
Adding Integers-Memory
Concepts-Arithmetic -
Decision Making: Equality
and Relational Operators

294
Week 7 Control Statements Explicit Teach- Design a scientific calcula-
,functions, arrays,XML ing tor
-Introduction -XML Basics
-Structuring Data -XML
Namespaces-Document
Type Definitions (DTDs)-
W3C
Week 8 XML Schema Documents- Explicit Teach- Write an XML file and DTD
XML Vocabularies-Ajax- ing file which will display the
Enabled Rich Internet Book information
Applications with XML -
JSON-Introduction His-
tory of Ajax- “Raw”
Ajax Example Using the
XMLHttpRequest
Week 9 Object - Asynchronous Explicit Teach- Usage of JavaScript func-
Requests-Exception Han- ing tion JSON.parse(text)
dling -Callback Functions which converts a JSON text
XMLHttpRequest Object into a JavaScript object.
Event, Properties and
Methods- Using XML and
the DOM
Week Creating a Full-Scale Ajax- Explicit Teach- Create a E- regsitration us-
10 Enabled Application- Using ing ing Ajax applications
JSON- Rich Functionality -
Interacting with a Web Ser-
vice on the Server- Parsing
JSON Data -Introduction -
HTTP Transactions
Week Introduction -HTTP Explicit Teach- Procedure to use JSON to
11 Transactions-Multitier ing read data from a web server,
Application - Server-Side and display it in a web page
Scripting Accessing Web using XMLHttp
Servers -Apache, MySQL
Week PHP Installation XAMPP Explicit Teach- Installation and Configura-
12 Installation ,running ,Ex- ing tion of APACHE
press and WebMatrix - test-
ing procedures, Microsoft
IIS - Installing, running
,client side, PHP examples

295
Week Introduction to Rela- Explicit Teach- Installation and Con-
13 tional Databases-MySQL ing figuration of WAMP
-Microsoft Language stack,ASP.NET
Integrate Query -Java
DB/Apache Derby - In-
troduction -Your First
ASP.NET Application in C
Week Visual basic-Building the Explicit Teach- Using JSON , HTML and
14 Web Time Application- ing XML to design a home au-
Standard Web Controls tomation system
Week Designing a Form Vali- Explicit Teach- Using JSON , HTML and
15 dation Controls- Session ing XML to design a shopping
Tracking management system

EXPERIMENTS:
1. Using HTML5 canvas with JavaScript to draw lines, rectangles, arcs, and circles.

2. Using HTML5 canvas with JavaScript to draw gradients and shadows.

3. Write an XML file and DTD file which will display the Book information

4. Installation Configuration of APACHE,WAMP stack

5. Procedure to use and configure Php MyAdmin to manage mySQL databases.

6. Create a Ajax-Enabled Rich Application with PHP and mySQL for course regis-
tration form

7. Design a web page for online cultural fest with interactive manner

8. Usage of JavaScript function JSON.parse(text) which converts a JSON text into a

JavaScript object.

9. Procedure to use JSON to read data from a web server, and display it in a web
page using XMLHttp.

10. Using JSON , HTML and XML to design a home automation system

11. Design a single page app using scratch from client side, backend and DB access

12. Design a app using open source DBs like MongoDB, MySQL.

TEXT BOOK(S):
1. Paul J. Deitel, Harvey M. Deitel, Abbey Deitel, “Internet World Wide Web How
to Program, 5/e, Pearson Education Asia, 2009

296
REFERENCES:
1. Eric Ladd, Jim O’ Donnel, “Java, XHTML, HTML, XML: magnum”, Prentice Hall
of India, QUE, 2000.

2. Rajkamal, “Web Technology”, Tata McGraw-Hill, 2007, 7th edition.

3. Jon Duckett,”Web Design with HTML, CSS, JavaScript and jQuery Set” Wiley,
First edition, 2014

297
 4.37 213CSE2315: SOFTWARE TESTING

213CSE2315 SOFTWARE TESTING L T P X C

3 0 2 0 4
Pre-requisite :NIL
Course Category :Program Elective
Course Type :Integrated Course - Theory

COURSE OBJECTIVES:
• To understand the basic knowledge in software development organization

• To know the various types of software testing for any real time project

• To analyse the importance of testing in various levels

• To learn the various test models and methods for validation

• To utilize various tools for validation

COURSE OUTCOMES:
CO1: Understand the basics of software testing and testing levels

CO2: Design and apply various software test process for a software testing project

CO3: Develop a test tool and able to categorise the software test automation

CO4: Ability to understand the various software testing problems, selecting software test
models and methods

CO5: Analyze various communication methods and skills for various practice-oriented
software testing projects

MAPPING OF COURSE OUTCOMES WITH PO, PSO:

PO’S PSO’S
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 M S L S S L S
CO2 M L S M M M S
CO3 M L S M M L L L S
CO4 L M M M S S S
CO5 S L L L L S M M M S L S S

298
UNIT I: INTRODUCTION
Testing as an Engineering Activity – Role of Process in Software Quality – Testing as a
Process –Basic Definitions – Software Testing Principles – The Tester‘s Role in a Software
development Organization – Origins of Defects – Defect Classes – The Defect Repository
and Test Design – Defect Examples – Developer/Tester Support for Developing a Defect
Repository

UNIT II TEST CASE DESIGN

Introduction to Testing Design Strategies – The Smarter Tester – Test Case Design Strate-
gies – Using Black Box Approach to Test Case Design Random Testing – Requirements
based testing – positive and negative testing - Boundary Value Analysis – decision tables -
Equivalence Class Partitioning state-based testing– cause-effect graphing – error guessing
- compatibility testing – user documentation testing – domain testing Using White–Box
Approach to Test design – Test Adequacy Criteria – static testing vs. structural testing
– code functional testing - Coverage and Control Flow Graphs – Covering Code Logic –
Paths – Their Role in White–box Based Test Design – code complexity testing – Evalu-
ating Test Adequacy Criteria.

UNIT - III LEVELS OF TESTING

The Need for Levels of Testing – Unit Test – Unit Test Planning –Designing the Unit
Tests. The Test Harness – Running the Unit tests and Recording results – Integration
tests – Designing -Integration Tests – Integration Test Planning – scenario testing – de-
fect bash elimination -System Testing – types of system testing - Acceptance testing –
performance testing – Regression Testing – internationalization testing – ad-hoc testing
- Alpha – Beta Tests – testing OO systems – usability and accessibility testing

UNIT IV – TEST MANAGEMENT

People and organizational issues in testing – organization structures for testing teams
– testing services - Test Planning – Test Plan Components – Test Plan Attachments –
Locating Test Items – test management – test process - Reporting Test Results – The
role of three groups in Test Planning and Policy Development – Introducing the test
specialist – Skills needed by a test specialist – Building a Testing Group

UNIT V - TEST AUTOMATION

Software test automation – skills needed for automation – scope of automation – design
and architecture for automation – requirements for a test tool – challenges in automation
– Measurements and milestones for controlling and monitoring – status meeting- reports
and control issues – criteria for test completion – SCM – Review program – Types of
review- Components of review plan – reporting review result – cucumber tool – selenium

299
tool - working principles

15 WEEK COURSE PLAN

Week Lecture (3 hours) Pedagogy Practical(2 hours)

Week 1 Testing as an Engineering Explicit Teach- Study of Selenium web test-
Activity ,Role of Process ing ing tool
in Software Quality,Testing
as a Process –Basic Defini-
tions,Software Testing Prin-
ciples
Week 2 The Tester‘s Role in a Soft- Explicit Teach- Write and test a program to
ware development Organi- ing login a specific web page.
zation,Origins of Defects –
Defect Classes,The Defect
Repository and Test Design
Week 3 Defect Exam- Explicit Teach- Write and test a program
ples,Developer/Tester ing to select the number of stu-
Support for Developing a dents who have scored more
Defect Repositor, Using than 60 in any one subject
Black Box Approach to
Test Case Design Random
Testing
Week 4 Requirements based test- Explicit Teach- Create and Develop the test
ing – positive and negative ing cases for banking applica-
testing – Boundary Value tion
Analysis – decision tables
-Equivalence Class Parti-
tioning state-based testing
cause
Week 5 effect graphing – error Explicit Teach- Write all test cases for bank-
guessing - compatibility ing ing
testing – user documen-
tation testing ,domain
testing Using White–Box
Approach to Test design –
Test Adequacy Criteria

300
Week 6 static testing vs. struc- Explicit Teach- Design a Control flow for
tural testing -code func- ing real time application
tional testing -Coverage and
Control Flow Graphs – Cov-
ering Code Logic – Paths
-Their Role in White–box
Based Test Design – code
complexity testing – Evalu-
ating Test Adequacy Crite-
ria
Week 7 The Need for Levels of Test- Explicit Teach- Create a test plan docu-
ing – Unit Test – Unit ing ment for Library Manage-
Test Planning -Designing ment System application
the Unit Tests. The Test
Harness – Running the Unit
tests and Recording results
Week 8 Integration tests – Design- Explicit Teach- Categorize the levels of test-
ing Integration Tests – In- ing ing with various tests for
tegration Test Planning - real time problem
scenario testing – defect
bash elimination -System
Testing – types of system
testing - Acceptance testing

Week 9 performance testing – Re- Explicit Teach- Develop and design a real
gression Testing – interna- ing time testing scenario and
tionalization testing – ad- categorize the levels of test-
hoc testing - Alpha -Beta ing
Tests – testing OO systems
– usability and accessibility
testing
Week People and organizational Explicit Teach- Test plan creation for var-
10 issues in testing – organi- ing ious real time application
zation structures for testing with schedule, report
teams – testing services -
Test Planning – Test Plan
Components -Test Plan At-
tachments – Locating Test
Items – test management

301
Week test process - Reporting Explicit Teach- Learn Cucumber tool for
11 Test Results -The role of ing testing
three groups in Test Plan-
ning and Policy Develop-
ment - Introducing the test
specialist – Skills needed by
a test specialist – Building a
Testing Group
Week Software test automation – Explicit Teach- Project team formation- de-
12 skills needed for automa- ing sign , scope and require-
tion – scope of automation- ment
design and architecture for
automation – requirements
for a test tool
Week challenges in automation Explicit Teach- Real time website automa-
13 – Measurements and mile- ing tion using selenium
stones for controlling and
monitoring -status meeting-
reports and control issues –
criteria for test completion
Week SCM – Review program – Explicit Teach- Apply selenium tool for on-
14 Types of review- Compo- ing line trading websites and
nents of review plan validate the report

Week reporting review result – cu- Explicit Teach- Apply cucumber tool for on-
15 cumber tool – selenium tool ing line trading websites and
- working principles validate the report

EXPERIMENTS:
1. Study of Selenium web testing tool

2. Using Selenium IDE, Write a test suite containing minimum 4 test cases.

3. Write and test a program to login a specific web page.

4. Write and test a program to select the number of students who have scored more
than 60 in any one subject

5. Write the test cases for banking application

6. Create a test plan document for Library Management System application

7. Create a test plan document for online shopping and validate the same using cu-
cumber

302
 8. Apply selenium tool for zomato website and prepare the test plan ‘

9. Apply selenium and cucumber tool for online trading websites and validate the
report

TEXT BOOK(S):
1. Ilene Burnstein,”Practical Software Testing”,6th Edition, Springer International
Edition Aditya P.Mathur, ?Foundations of Software Testing?, Pearson Education,
2014.

2. Srinivasan Desikan and Gopalaswamy Ramesh, “ Software Testing – Principles and

Practices”, Pearson education, 2010

REFERENCES:
1. Boris Beizer, Software Testing Techniques, Second Edition, Dreamtech, 2013

2. Elfriede Dustin, Effective Software Testing?, First Edition, Pearson Education,

2010.

3. Renu Rajani, Pradeep Oak, Software Testing Effective Methods, Tools and Tech-
niques?, Tata McGraw Hill, 2010

303
 4.38 213CSE2316: MOBILE APPLICATION DEVELOPMENT

213CSE2316 MOBILE APPLICATION DEVEL- L T P X C

OPMENT
3 0 2 0 4
Pre-requisite :NIL
Course Category :Program Elective
Course Type :Integrated Course - Theory

COURSE OBJECTIVES:
• To provide a basic idea on MOBILE APPLICATION DEVELOPMENT

• To explore the techniques by solving problems of student interest.

• To make students to learn application development and develop mobile app on

various mobile platform like ANDROID and IOS.

• To provide security in developed mobile app.

COURSE OUTCOMES:
CO1: Understand about the mobile application market and web services for various mobile
devices.

CO2: Understand about the various Mobile Information Design, design Tools, Mobile
Platforms and Mobile Web Option.

CO3: Create the User interface with various features of Android SDK like displaying
pictures, menus etc.

CO4: Evaluate the networking and location-based service in Android application

CO5: Apply security in mobile developed app

MAPPING OF COURSE OUTCOMES WITH PO, PSO:

PO’S PSO’S
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 S M L M S
CO2 S M M L S S
CO3 S S M L L S S
CO4 S S M M L L M S
CO5 S M S L S M M S S

UNIT I: INTRODUCTION
Preliminary Considerations Cost of Development Importance of Mobile Strategies in Busi-
ness World Mobile Web Presence Mobile Applications Marketing Web Services for Mobile
Devices Creating Example Web Service Debugging Web Service

304
UNIT II:MOBILE USER INTERFACE DESIGN
Effective Use of Screen Real Estate Understanding Mobile Application Users Under-
standing Mobile Information Design Understanding Mobile Platforms Using the Tools
for Mobile Interface Design Choosing a Mobile Web Option Adaptive Mobile Website
Dedicated mobile website Mobile Web Applications with HTML 5

UNIT III: ANDROID APPLICATION DEVELOPMENT

Getting started with Android Designing Your User interface using Views Displaying Pic-
tures and Menus with Views Using Image views to Display pictures Using menus with
views Data Persistence Saving and loading user performances - Persisting data to files
Creating and using Data bases Content Providers.

UNIT IV: ANDROID MESSAGING, NETWORKING, LOCA-

TION BASED SERVICES
SMS Messaging, Sending E-mail Networking Downloading Binary Data, Text Files-
Accessing Web Services Performing Asynchronous Calls Location Based Services Display-
ing Maps Getting Location Data Creating your own services Communicating between a
service and an activity Binding activities to Services

UNIT V: SECURITY IN MOBILE APPLICATIONS

Introduction to secure mobile application development, methods of protecting sensitive
data on mobile devices, Introduction to Android Security, iOS Security and Windows
Security.

15 WEEK COURSE PLAN

Week Lecture (3 hours) Pedagogy Practical (2 hours) Pedagogy

Week 1 Importance of Mobile Explicit Design elements and Demonstration
Strategies in Business teaching principles.Android ap-
World.Mobile Ap- plication design and
plications Marketing development basics
.Web Services for Mo-
bile Devices Creating
Example
Week 2 Debugging in Web Explicit Designing simple ap- Problem based learn-
Service.Effective Use teaching plications to convert ing
of Screen Real Estate drill and celsius to fahrenheit
Understanding Mobile practice
Application.Users
Understanding Mobile
Information Design

305
Week 3 Understanding Mobile Explicit Designing android Problem based learn-
Platforms Using the Teaching application to create ing
Tools for Mobile Inter- alarm clock
face Design.Choosing
a Mobile Web Option
Adaptive Mobile Web-
site
Week 4 Dedicated mobile drill and Designing interactive Problem based learn-
website Mobile Web practice android application to ing
Applications with perform simple calcu-
HTML 5. lator
Week 5 Getting started with drill and Designing interactive Problem based learn-
Android Designing practice android application to ing
Your User interface perform simple calcu-
using Views. lator
Week 6 Using menus with Explicit Designing android ap- Demonstration
views Data Persis- Teaching plication to create an
tence Saving and employee database.
loading user perfor-
mances
Week 7 Persisting data to files drill and Designing android ap- Problem based learn-
Creating and using practice plication to create an ing
Data bases Content employee database
Providers
Week 8 SMS Messaging, Explicit Design android appli- Problem based learn-
Sending E-mail Net- teaching cation to create a no- ing
working Downloading tification upon receiv-
Binary Data ing a message
Week 9 Text Files-Accessing Explicit Designing android Problem based learn-
Web Services. Per- Teaching application to locate ing
forming Asynchronous your service using
Calls Location Based GPS
Services
Week 10 Displaying Maps Get- drill and Designing android Problem based learn-
ting Location Data practice application to locate ing
Creating your own your service using
services GPS
Week 11 Communicating be- compare Create an android Independent study
tween a service and and application using SD
an activity Binding contrast card as the storage
activities to Services component
Week 12 Introduction to secure Explicit Design interactive on- Independent study
mobile application de- teaching line shopping securly
velopment
Week 13 Methods of protecting Explicit Develope an applica- Problem based learn-
sensitive data on mo- teaching tion that writes data ing
bile devices to the SD card securly

306
Week 14 Introduction to An- Explicit Building Your First Demonstration,Problem
droid Security.iOS Se- Teaching iOS 13 App,Learn based learning
curity and Windows how Xcode func-
Security. tions. How to build
an iOS application
structure.Create
a full-fledged iOS
application

EXPERIMENTS:
1. Create an android application to change the font shape and color
2. Create an android application to scroll
3. Create an android application to convert Celsius to Fahrenheit
4. Create an android application to show image transition using image view
5. Create an android application to create alarm clock
6. Create an android application to perform a simple calculator
7. Create an android application to create a notification upon receiving a message
8. Create an android application to create an employee database
9. Create an android application to locate your service using GPS
10. Create an android application using SD card as the storage component

TEXT BOOK(S):
1. 1. Jeff McWherter and Scott Gowell, Professional Mobile Application Development,
Wrox 2012.
2. 2. Wei-Meng Lee Beginning Android 4 Application Development March 2012

REFERENCES:
1. 1. Charlie Collins, Michael Galpin and Matthias Kappler, Android in Practice,
Dream Tech. 2012
2. 2. James Dovey and Ash Furrow, Beginning Objective C, Apress, 2012
3. 3. David Mark, Jack Nutting, Jeff LaMouche, and Fredric Olsson, Beginning iOS6
Development: Exploring the iOS SDK, Apress, 2013.
4. Kevin Tatroe, Peter MacIntyre, Rasmus Lerdorf, “Programming PHP”, O’Reilly
Media, 2012.

307
 4.39 213CSE3317: FREE AND OPEN SOURCE SOFTWARE

213CSE3317 FREE AND OPEN SOURCE SOFT- L T P X C

WARE
3 0 2 0 4
Pre-requisite :NIL
Course Category :Program Elective
Course Type :Integrated Course - Theory

COURSE OBJECTIVES:
• To provide a basic idea of Open source technology, their software development
process.

• • To understand the role and future of open source software in the industry along
with the impact of legal, economic and social issues for such software.

COURSE OUTCOMES:
CO1: Understand the fundamentals of open source and the basic concepts of LINUX.

CO2: Create a query to work with open source database.

CO3: Analyse the fundamentals concepts of RUBY ON RAILS.

CO4: Create web application on IBM BLUMIX

CO5: Evaluate web services and open source tool by using case study

MAPPING OF COURSE OUTCOMES WITH PO, PSO:

PO’S PSO’S
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 M L S M S S
CO2 S M S M L M S
CO3 L S L L S M L M S
CO4 L M L S M S M S M S
CO5 S M S L S M M S S

UNIT I: INTRODUCTION
Introduction to open sources- Need of Open Sources- Advantages of Open Sources-
Applications of Open Sources- commercial aspects of Open source movement- LINUX:
Introduction- General overview- Kernel mode and user mode-Process-Advanced Concepts-
Scheduling-Personalities- Cloning- Signals-Development with LINUX.

308
UNIT II:OPEN SOURCE DATABASE
MySQL: Introduction- Setting up account-Starting, terminating and writing your own
SQL programs Record selection technology- Working with strings-Date and Time- Sorting
Query Results- Generating Summary- Working with meta data- Using sequences- MySQL
and Web.

UNIT III: RUBY ON RAILS

Introduction- The Structure and Execution of Ruby Programs- Datatypes and Objects -
Expressions and Operators - Statements and Control Structures - Methods, Procs, Lamb-
das, and Closures - Classes and Modules The Ruby Platform - The Ruby Environment.

UNIT IV: IBM BLUMIX

BLUMIX: Introduction-Evolution of BlueMix how does work-infrastructure storage net-
work security Paas on the BlueMix - DBaas on the BlueMix - Web application on BlueMix
mobile application on BlueMix - javasript and java application on BlueMix.

UNIT V: SECURITY IN WEB APPLICATIONS

Recognizing web application security threats, Code Grinder, Building functional and
secure web applications, Security problems with Javascript, vulnerable GCI scripts, Code
Auditing and Reverse Engineering, types of security used in applications.

15 WEEK COURSE PLAN

Week Lecture (3 hours) Pedagogy Practical (2 hours) Pedagogy

Week 1 Introduction to open Explicit Basic Linux Com- Demonstration
sources,Need of Open teaching mands And Package
Sources.Advantages Management Sys-
of Open Sources, tem.Virtualization
Applications of Open Environment
Sources.Commercial
aspects of Open
source movement
Week 2 LINUX: Introduction- Explicit Linux Installa- Demonstration
General overview- teaching tion.Kernel Configu-
Kernel mode drill and ration, Compilation
and user mode- practice And Installation
Process.Advanced
Concepts, Schedul-
ing, Personalities,
Cloning, Signals,
Development with
LINUX

309
Week 3 MySQL: Explicit MYSQL INSTAL- Problem based learning
Introduction- Setting Teach- LATION.Simple
up account-Starting, ing,drill programs on MYSQL
terminating and writ- and
ing your own SQL practice
programs Record
selection technol-
ogy.Working with
strings, Date and
Time- Sorting Query
Results
Week 4 Generating Summary- drill and Retrieving data from Problem based learning
Working with practice web and storing it in
meta data- Using database
sequences- MySQL
and Web.
Week 5 RUBY ON RAILS: Explicit Basic about RUBY Problem based learning
Introduction- The teaching
Structure and Ex-
ecution of Ruby
Programs
Week 6 Data types and Ob- Explicit Simple programs on Demonstration
jects, Expressions Teaching RUBY Ruby program
and Operators, State- to print Hello World!,
ments and Control Ruby program to add
Structures, Methods, two integer numbers.
Procs, Lambdas, and
Closures
Week 7 Classes and Modules drill and Ruby on Rails: File Problem based learning
The Ruby Platform, practice uploading and send
The Ruby Environ- mails
ment.
Week 8 BLUMIX: Explicit Basics about BLU- Problem based learning
Introduction- teaching MIX
Evolution of BlueMix
how does work
Week 9 Infrastructure stor- Explicit Mini Project using Problem based learning
age network secu- Teaching IBM Blumix.Version
rity Paas on the Control system setup
BlueMix, DBaas on and usage
the BlueMix.Web ap-
plication on BlueMix
mobile application on
BlueMix
Week 10 Javasript and java ap- drill and Working with Eclipse Demonstration
plication on BlueMix. practice IDE

310
Week 11 Recognizing web Explicit Web Scrapping Independent study
application security teaching
threats, Code Grinder
Week 12 Building functional Explicit Web page authentica- Independent study
and secure web teaching tion using javascript
applications, Secu-
rity problems with
Javascript.
Week 13 Vulnerable GCI Explicit GUI programming us- Problem based learning
scripts, Code Au- teaching ing Qt Menus and
diting and Reverse Toolbars.
Engineering
Week 14 Types of security used Explicit Case study on differ- Demonstration
in applications. Teaching ent web security tools

EXPERIMENTS:
1. LINUX INSTALLATION

2. MYSQL INSTALLATION

3. 1.RUBY Ruby program to print Hello World!, 2.Ruby program to add two integer
numbers.

4. 1.Ruby program to find the area of the rectangle. 2.Ruby program to check leap
year.

5. 1.Ruby program to print power of a number. 2.Ruby program to print Fibonacci

series.

6. Ruby on Rails: File uploading and send mails.

7. Version Control system setup and usage.

8. Working with Eclipse IDE.

9. Mini Project using IBM Blumix

TEXT BOOK(S):
1. Introduction to Linux: Installation and Programming NRCFOSS Series, edited by
N.B.Venkateswarlu, 2010

2. Robert Sheldon and Geoff Moes, Beginning MySQL , Wiley India, 2009.

3. David Flanagan, Yukihiro Matsumoto The Ruby Programming Language O’Reilly

Media, 2010.

4. Christopher Negus, Linux Bible,Wiley Publishing Inc, Indianapolis, 2011.

311
 5. IBM Bluemix Architecture Series: Web Application Hosting on IBM Containers,
IBM Redbooks.

REFERENCES:
1. Sreetha sankaranarayanan Learning IBM BluMix, October 2016

2. Adam McDaniel, Perl and Apache: Your visual blueprint for developing dynamic
Web content, Wiley Publishing Inc, Indianapolis, 2010.

3. Dave.W.Mercer, Allan Kent, Steve D Nowicki, Dan squire and Wankyu choi, Be-
ginning PHP 5 , Wiley India,2010.

4. Kevin Tatroe, Peter MacIntyre, Rasmus Lerdorf, “Programming PHP”, O’Reilly

Media, 2012.

5. Michael Cross, “Developer’s Guide to Web Application Security”, Syngress Pub-

lishers, 2007.

312
 4.40 213CSE3318: USER INTERFACE DESIGN

213CSE3318 USER INTERFACE DESIGN L T P X C

3 0 2 0 4
Pre-requisite :NIL
Course Category :Program Elective
Course Type :Integrated Course - Theory

COURSE OBJECTIVES:
• To Understand the importance of user interface process

• Able to create a new website with various GUI icons and styles

• To learn the importance of mobile interface and its usability to the user

• Design a User interface with web application frameworks

COURSE OUTCOMES:
CO1: Understand the importance of User Interface and learn the basic principle of UI
design

CO2: Analyze various tools kits with object oriented approaches

CO3: Analyze the importance of various models, viewpoint of user, customer and designer

CO4: Create and develop and web interface design for real time applications

CO5: Design mobile application framework for mobile interface

MAPPING OF COURSE OUTCOMES WITH PO, PSO:

PO’S PSO’S
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 M S L S S L S
CO2 M L S M M M S
CO3 M L S M M L L L S
CO4 L M M M S S S
CO5 S L L L L S M M M S L S S

313
UNIT I HUMAN FACTORS AND USER INTERFACE DE-
SIGN PROCESS
The importance of User Interface – UI and Software Designer – Goals of UI design –
Motivations for human factors in Design – Understanding user needs and requirements.
Classes of UI design – Principles of good design – Evaluating design using the principles
– Choice of color – Task oriented approach for UI - Case study.

UNIT II OBJECT ORIENTED UI DESIGN

Design of icons – Use of metaphors – GUI style guides and toolkits – Portability – GUI
design and object oriented approach – CSCW characteristics – Examples – CSCW UI –
Method of specifying and designing UI for CSCW Case study

UNIT III USABILITY AND MODELS

The viewpoint of user, customer and designer –Usability specification – Description of
stages in usability specification and evaluation. - Mobile Design: Elements of Mobile
Design, Tools

UNIT IV WEB INTERFACE DESIGN

Interactive Design: Basics – process – scenarios – navigation – screen design – Iteration
and prototyping. Designing Web Interfaces –Drag and drop, direct selection, contextual
tools, overlays and virtual pages, process flow, case studies

UNIT V MOBILE UI
Mobile ecosystem: platforms and application frameworks: Types of mobile applications:
widgets, applications, information architecture, Mobile 2.0, Mobile design – Goals of
Mobile UX User centred approach to mobile design - power of mobile computing - case
studies

15 WEEK COURSE PLAN

Week Lecture (3 hours) Pedagogy Practical(2 hours)

314
Week 1 The importance of User In- Explicit Teach- Web page design & develop-
terface – UI and Software ing ment (scripting)
Designer,Goals of UI design
– Motivations for human
factors in Design - Under-
standing user needs and re-
quirements
Week 2 Classes of UI design - Explicit Teach- Designing UI for mobile ap-
Principles of good design - ing plications
Evaluating design using the
principles - Choice of color –
Task oriented approach for
UI - Case study
Week 3 Design of icons – Use Explicit Teach- Creating prototype of UI
of metaphors -GUI style ing
guides and toolkits – Porta-
bility -GUI design and ob-
ject oriented approach
Week 4 CSCW characteristics – Ex- Explicit Teach- Designing interactive Web
amples ing applications for student
course registration
Week 5 CSCW UI – Method of Explicit Teach- Designing interactive Web
specifying and designing -UI ing applications for student re-
for CSCW Case study sult management
Week 6 USABILITY AND Explicit Teach- GUI for applications
MODELS-The viewpoint of ing
user, customer and designer
-Usability specification
Week 7 Description of stages in Explicit Teach- Artificial Intelligence in de-
usability specification and ing veloping UI
evaluation
Week 8 Mobile Design: Elements of Explicit Teach- Design a scientific calcula-
Mobile Design, Tools ing tor
Week 9 Interactive Design: Basics – Explicit Teach- Design a interarive tic tac
process - scenarios – naviga- ing game
tion – screen design
Week Iteration and prototyping. Explicit Teach- Create a simple mobile apps
10 Designing Web Interfaces - ing with various interfaces
Drag and drop, direct selec-
tion, contextual tools, over-
lays
Week virtual pages, process flow, Explicit Teach- Create a mobile app for
11 case studies ing medical assistance

315
Week Mobile ecosystem: plat- Explicit Teach- Create a mobile app for
12 forms and application ing blood bank management
frameworks -Types of
mobile applications
Week widgets, applications, infor- Explicit Teach- Design interactive web ap-
13 mation architecture, Mobile ing plication for online shop-
2.0- ping
Week Mobile design – Mobile De- Explicit Teach- Design an interative mobile
14 sign ing apps for a course

Week Goals of Mobile UX User Explicit Teach- Design an interactive mo-

15 centred approach to mobile ing bile apps using UX for real
design - power of mobile time applications
computing

EXPERIMENTS:
1. Design elements and principles
2. Web page design development (scripting)
3. Designing UI for mobile applications
4. Creating prototype of UI
5. Designing interactive Web applications for student course registration
6. GUI for applications
7. Artificial Intelligence in developing UI
8. Design a scientific calculator
9. Create a mobile app for medical assistance
10. Design interactive web application for online shopping

TEXT BOOK(S):
1. Bill Scott and Theresa Neil, “designing Web Interfaces”, O’Reilly, USA, 2011
2. Brian Fling,” Mobile Design and Development”, O’Reilly, USA, 2010

REFERENCES:
1. Alan Dix Janet Finlay, Gregory Abowd, Russell Beale, ”Human - Computer Inter-
action”, Prentice Hall, USA, 2010.
2. Andrew Sears, Julie A Kacko, ‘’The HCI handbook” , Lawrence Earlbaum Asso-
ciates, New York, 2009.

316
 4.41 213CSE3319: AGILE METHODOLOGY

213CSE3319 AGILE METHODOLOGY L T P X C

3 0 2 0 4
Pre-requisite :NIL
Course Category :Program Elective
Course Type :Integrated Course - Theory

COURSE OBJECTIVES:
• To impart a thorough understanding of the principles and practices used in agile
software development

• To explore these techniques by solving problems of student interest.

• To design and build simple Graphical Representation

COURSE OUTCOMES:
CO1: Understand the basic concepts of Agile Software Process.

CO2: Analyze the significance of Agile Methodology in software development.

CO3: Analyze the process of Agile Methodology.

CO4: Understand Agile Practicing and Testing

CO5: Apply the concepts of Agile Methodology using SCRUM Tools.

MAPPING OF COURSE OUTCOMES WITH PO, PSO:

PO’S PSO’S
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 M S M S S
CO2 S L M S M S
CO3 S S S M L M S
CO4 M M L M S M S
CO5 S S L S S M S L S M S

UNIT I: INTRODUCTION
Software is new product development Iterative development Risk-Driven and Client-
Driven iterative planning Time boxed iterative development During the iteration, No
changes from external stakeholders Evolutionary and adaptive development - Evolution-
ary requirements analysis Early Top Ten high-level requirements and skillful analysis
Evolutionary and adaptive planning Incremental delivery Evolutionary delivery The most
common mistake Specific iterative and Evolutionary methods.

317
UNIT II:AGILE AND ITS SIGNIFICANCE
Agile development Classification of methods The agile manifesto and principles Agile
project management Embrace communication and feedback Simple practices and project
tools Empirical Vs defined and prescriptive process Principle-based versus Rule-Based
Sustainable discipline: The Human touch Team as a complex adaptive system Agile
hype Specific agile methods.

UNIT III: AGILE METHODOLOGY

Method overview Lifecycle Work products, Roles and Practices values Common mis-
takes and misunderstandings Sample projects Process mixtures Adoption strategies Fact
versus fantasy Strengths versus Other history.

UNIT IV: AGILE PRACTICING AND TESTING

Project management Environment Requirements Test The agile alliances The manifesto
Supporting the values Agile testing Nine principles and six concrete practices for testing
on agile teams.

UNIT V: AGILITY AND QUALITY ASSURANCE

Agile Product Development – Agile Metrics – Feature Driven Development (FDD) –
Financial and Production Metrics in FDD – Agile Approach to Quality Assurance – Test
Driven Development – Agile Approach in Global Software Development.

15 WEEK COURSE PLAN

Week Lecture (3 hours) Pedagogy Practical (2 hours) Pedagogy

Week 1 Software is new Explicit Understand the back- Demonstration
product development Teaching ground and driving
Iterative develop- forces for taking an
ment Risk-Driven Agile Approach to
and Client- Driven Software Develop-
iterative planning ment.
Time boxed iterative
development During
the iteration
Week 2 No changes from drill and Understand the busi- Demonstration
external stakeholders practice ness value of adopting
Evolutionary and agile approach.
adaptive develop-
ment Evolution- ary
requirements analysis

318
Week 3 Early Top Ten high- Explicit Understand agile de- Problem based learning
level requirements and Teaching velopment practices.
skilful analysis Evolu- Drive Development
tionary and adaptive with Unit Test using
planning Incremental Test Driven Develop-
delivery. Evolution- ment.
ary delivery The most
common mistake Spe-
cific iterative and Evo-
lutionary methods.
Week 4 Agile development Explicit Apply Design princi- Problem based learning
Classification of Teaching ple and Refactoring to
methods. The agile achieve agility
manifesto and prin-
ciples Agile project
management
Week 5 Embrace commu- drill and To study automated Demonstration
nication and feed- practice build tool.
back Simple prac-
tices and project
tools.Empirical Vs
defined and pre-
scriptive process
Principle-based versus
Rule-Based
Week 6 Sustainable discipline: Explicit To study version con- Problem based learning
The Human touch Teaching trol tool.
Team as a complex
adaptive system Agile
hype Specific agile
methods.Method
overview Life-cycle
Work products, Roles
and Practices values
Common mistakes
and misunderstand-
ings
Week 7 Sample projects Pro- Explicit To study Continuous Problem based learning
cess mixtures Adop- Teaching Integration tool.
tion strategies
Week 8 Fact versus fantasy drill and Perform Testing activ- Problem based learning
Strengths versus practice ities within an agile
Other history.Project project.
management Environ-
ment Requirements
Test

319
Week 9 The agile alliances Explicit Effective Practices Problem based learning
The manifesto Sup- Teaching and Federal Chal-
porting the values lenges in Applying
Agile testing. Nine Agile Methods
principles and six
concrete practices for
testing on agile teams.
Week 10 Agile Product Devel- drill and Distributed Scrum Demonstration
opment practice Project for Dutch
Railways
Week 11 Agile Metrics drill and Distributed Scrum Demonstration
practice Project for Dutch
Railways
Week 12 Feature Driven Devel- drill and Owning the Sky with Demonstration
opment (FDD) practice Agile
Week 13 Financial and Produc- drill and Owning the Sky with Demonstration
tion Metrics in FDD practice Agile
Week 14 Agile Approach to Explicit Rolling Out Agile in a Demonstration
Quality Assurance – Teaching Large Enterprise
Test Driven Develop-
ment
Week 15 Agile Approach in drill and A CIO’s Playbook for Problem based learning
Global Software practice Adopting the Scrum
Development. Method of Achieving
Software Agility:

EXPERIMENTS:
1. Understand the background and driving forces for taking an Agile Approach to
Software Development.

2. Understand the business value of adopting agile approach.

3. Understand agile development practices

4. Drive Development with Unit Test using Test Driven Development.

5. Apply Design principle and Refactoring to achieve agility

6. To study automated build tool.

7. To study version control tool.

8. To study Continuous Integration tool.

9. Perform Testing activities within an agile project.

10. A CIO’s Playbook for Adopting the Scrum Method of Achieving Software Agility:

320
11. Distributed Scrum Project for Dutch Railways

12. Effective Practices and Federal Challenges in Applying Agile Methods:

TEXT BOOK(S):
1. Craig Larman, Agile and Iterative Development A Managers Guide, Pearson Ed-
ucation 2010.

2. Elisabeth Hendrickson Quality Tree Software Inc, Agile Testing 2010.

3. David J. Anderson and Eli Schragenheim, —Agile Management for Software Engi-
neering: Applying the Theory of Constraints for Business Results, Prentice Hall,
2003.

4. Hazza and Dubinsky, —Agile Software Engineering, Series: Undergraduate Topics

in Computer Science, Springer, 2009.

REFERENCES:
1. John Hunt, Agile Software Construction, Springer, USA, 2005.

2. Robert Martin, ”Agile Software Development: Principles, Patterns, and Practices”

Prentice Hall, USA, 2003.

3. Ken Schwaber and Mike Beedle, ”Agile Software Development with SCRUM, Pren-
tice Hall, USA, 2002.

4. Alistair Cockburn, Agile Software Development: The Cooperative Game, Pearson

Education, 2007.

5. Kent Beck, Cynthia Andreas, Extreme Programming Explained: Embrace Change,

Pearson Education, 2005.

321
5 EXPERIENTIAL ELECTIVE

5.1 216CSE4301: APPLICATIONS OF MACHINE LEARN-

ING IN INDUSTRIES

216CSE4301 APPLICATIONS OF MACHINE L T P X C

LEARNING IN INDUSTRIES
0 0 4 0 2
Pre-requisite :NIL
Course Category :Experiential Elective
Course Type :Integrated Course - Theory

COURSE OUTCOMES:
Upon successful completion of this course, students will be able to
CO1:Applying Machine Learning in Financial Applications.
CO2:Applying Machine Learning in Entertainment, Communication and Life Sciences.
CO3:Applying Machine Learning in Education and Industries.
CO4:Applying Machine Learning in Government Sectors and Insurance.
CO5:Applying Machine Learing in Supply chain, Energy and Utilities.

MAPPING OF COURSE OUTCOMES WITH PO, PSO:

PO’S PSO’S
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 M S M S M L L L S
CO2 S S S S S M S M M M L S
CO3 S M S S M M M M L S
CO4 S M M M M M L L S
CO5 M S S S S S L M S M S

UNIT I: A Brief Introduction to Machine Learning, Machine Learning in

Banking and Securities Paradigms, Knowledge Representation, Data Acquisition,
Data Pre-Processing, Feature Extraction and Processing, Feature Ranking and Selection,
Feature Reduction, Model Learning, Evaluation and Deployment, Introduction- Analytics
and Machine Learning Applications in Banking and Securities, Fraud Detection, Effective
Application Screening, More Customer Acquisition and Retention, Better Knowledge
of Customer Buying Habits, Efficient Cross-Selling, Improved Collections, Marketing
Optimization, Increased Customer Lifetime Value, Effective Feedback Management.

UNIT II: Machine Learning in Communication, Media and Entertainment,

Healthcare and Life Sciences Introduction - Change in Landscape with the Advent
of Smartphone and Social Media, The Benefactors of Big Data in Media and Enter-
tainment Industry - Video Publishers, Media Owners, Gaming Companies, Television
Channels, Analytics and Machine Learning Applications in Communication, Media and

322
Entertainment Industries, Prediction of Audience Interests, Deriving Insights into Cus-
tomer Churn, Optimizing Media Program Schedules, Content Monetization, Effective
Targeting of Advertisements, Introduction - An Overview of Provider, Payer and Life
Sciences Analytics, Business Value of Health Analytics - Value Life Cycle, Healthcare
Analytics Framework- Key Drivers, Security, Privacy, and Risk Analytics in Healthcare,
Meaningful Use and Role of Analytics - Complying with Regulatory Imperatives, Mea-
suring the Impact of Social Media in Healthcare.

UNIT III: Machine Learning in Education, Manufacturing and Petroleum In-

dustries Introduction, Current Challenges in the Education Sector - Multiple Modes of
Education, Rapidly Changing Education Trends, Targeting the Right Population, Curb-
ing the Dropout Rate, Planning and Budgeting for Sustainable Expansion, Effective De-
velopment of Instructor and Curriculum, The Consequences of these Challenges - High
Dropout Rate, Higher Debt Pressure on Dropouts, Increasing Loan Defaults, Failure of
the Education System, Universities Lose Revenues, How Analytics Can Help? - What-
if Scenarios Creation for Planning, Budgeting and Forecasting, Analytics for Educators,
Analytics for Pupils, Smart Governance and Management of Education Programs, Career
Prediction and Assisting Students in Choosing their Career Paths, Introduction - Analyt-
ics and Machine Learning Approaches in Optimizing Production and Process Efficiency,
Optimizing Product Quality, Robust Risk Management, Enhancing Warranty Planning,
Improving Demand Planning and Inventory Management, Increasing Maintenance Effi-
ciency, Analytics Applications in Petroleum Industry – Introduction, Upstream Analytics
in Petroleum Industry - Exploration and Production Optimization, Oilfield Production
Forecasting, Predicting Failure of Field Assets, Reservoir Characterization, Analytics for
Unconventional Resource Recovery, Integrated Planning Capabilities, Downstream An-
alytics in Petroleum Industry - Demand Forecasting for Refining, Facility Integrity and
Reliability, Commodity Trading Risk Management, Customer Intelligence .

UNIT IV: Machine Learning in Government and Insurance Introduction- Ma-

chine Learning and Analytics for Government - An Overview, Emerging Technologies
for the Public Sector - Preparing for Big Data, Innovative Use Cases, Government
Applications of the Internet of Things - Smart Cities, Motivations and Challenges for
Government Use of the Internet of Things, Government Sponsored Healthcare and Life
Sciences Projects - Genomics, Neuroscience, Government Use of Big Data for Cyber se-
curity - Illustrative Cyber security Solutions, Illustrative Case Studies - Dubai’s Smart
City Initiative, San Diego Supercomputer Center, National Center for Supercomputing
Applications, Translational Genomics Research Institute, The Food and Drug Admin-
istration (FDA)’s Initiative to Detect and Study Patterns of Food Related Illness and
Diseases, Introduction - Insurance Industry Overview, Emerging Trends - New Product
Guidelines, Standard Proposal Forms and Need-Based Sales, Multi Tie-up for Banks,
Role of Machine Learning in Insurance, Sales and Channel Management - Channel Strat-
egy Optimization, Sales Reporting, Channel Management, Channel Analysis, Channel
Profitability, Operations Management - New Business Processing, New Business Leak-
ages, Customer Retention/Persistency, Attrition Analysis, Predicting Customer Behavior
- Social Media Analytics, Use of GPS-Enabled Devices and CCTV Footage, Claims Man-
agement - Claims Payment Management, Claims Analysis, Marketing Management in In-
surance Industry - Customer Segmentation, Product Management, Campaign Analysis,
Profitability Management in Insurance Industry - Premium Analysis, Financial Anal-

323
ysis, Product Profitability Analysis, Underwriting Loss Analysis, Risk Management in
Insurance - Reinsurance, Underwriting .

UNIT V:Machine Learning in Retail, Supply Chain, Transportation and Lo-

gistics, Energy and Utilities Introduction - Merchandising Analysis - Assortment
Planning, Product Placement, Space Allocation, Product Adjacency, Market Basket
Analysis, Marketing Analytics - Promotions, Pricing, Personalization, Campaigns, Store
Operations Analytics - Workforce Effectiveness, Shrinkage, Inventory, Store Performance,
Supply Chain Analytics - Logistics, Inventory, Supplier Performance, Demand Forecast-
ing, Bull-Whip Effect, Introduction - Applications for Government - Traffic Control,
Route Planning, Intelligent Transport Systems, Congestion Management, Applications
for Private Sector - Revenue Management, Technological Enhancements, Logistics and
for Competitive Advantage by Consolidating Shipments and Optimizing Freight Move-
ment, Applications for Individuals - Route Planning for Saving Fuel and Time, Travel
Arrangements in Tourism, Introduction - Smart Grids, Demand Response, Revenue Man-
agement, Fraud and Loss Prevention, Energy Efficiency, Compliance, Asset Maintenance
and Management, Customer Care and Management, Forecasting and Load Management.

TEXT BOOK(S):
1. Application of machine learning in industries (IBM ICE Publications)

324
5.2 216CSE4302: BA FOR INDUSTRIES

216CSE4302 BA FOR INDUSTRIES L T P X C

0 0 4 0 2
Pre-requisite :NIL
Course Category :Experiential Elective
Course Type :Integrated Course - Theory

Course Objectives:
• Understand basics of analytics,

• Identify Apply of Business Analytics Solutions against common Business scenar-

ios/problems/issues in Banking Arena,

• Identify Apply of Business Analytics Solutions against common Business scenar-

ios/problems/issues in Insurance Arena,

• Identify Apply of Business Analytics Solutions against common Business scenar-

ios/problems/issues in Telecom Arena &

• Understand and position key BA healthcare industry plays.

COURSE OUTCOMES:
Upon successful completion of this course, students will be able to
CO1:Understand the role of analytics in business optimization.
CO2:Understand the basic elements of User cases for a clear understanding of business
analytics.
CO3:Apply Business Analytics for Banking Case Studies (IBM Customer References),
Replicate/Apply/Develop Business Analytics Solutions for other banks, estimation mod-
els.
CO4:Apply Business Analytics for Insurance Case Studies (IBM Customer References),
Replicate/Apply/Develop Business Analytics Solutions for other Insurance Cos.
CO5:Apply Business Analytics for Telecom Case Studies (IBM Customer References),
Replicate/Apply/Develop Business Analytics Solutions for other Telecom Cos Key dif-
ferentiators within the context of critical healthcare industry pain points.

MAPPING OF COURSE OUTCOMES WITH PO, PSO:

PO’S PSO’S
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 S S S S M L S
CO2 M M L S M M S
CO3 L L S S S S L M S
CO4 S S M L S M S L M S
CO5 S M M S S S S

325
UNIT I: Introduction to Business Analytics Basics of analytics, Role of ana-
lytics in business optimization, The advantages of optimization, Reference architecture,
use of reference architecture in business analytics, user cases for understanding business
analytics.

UNIT II: Business Analytics for the Banking Industry The application of Busi-
ness Analytics Solutions against common Business, scenarios/problems/issues in Banking
Arena, business Analytics for Banking Case Studies (IBM Customer References), the pro-
cess of developing Business Analytics Solutions for other banks.

UNIT III: Business Analytics for the Insurance Industry The application of
business analytics solutions against common Business, scenarios/problems/issues in the
Insurance Arena, Business Analytics for Insurance Case Studies (IBM Customer Refer-
ences), the process of developing Business Analytics Solutions for other Insurance Com-
panies

UNIT IV: Business Analytics for the Telecom Industry The application of busi-
ness analytics solutions against common Business, scenarios/problems/issues in the Tele-
com Arena, Business Analytics for Telecom Case Studies (IBM Customer References),
the process of developing Business Analytics Solutions for other Telecom Companies.

UNIT V: Business Analytics for Healthcare The key healthcare trends business
challenges, key BA value propositions to healthcare industry pain points, the key health-
care industry play assets, the key differentiators within the context of critical healthcare
industry pain points.

TEXT BOOK(S):
1. BA for Industries (IBM ICE Publications)

326
5.3 216CSE4303: IOT FOR INDUSTRIES ( Use Case Scenar-
ios)

216CSE4303 IOT FOR INDUSTRIES ( Use Case L T P X C

Scenarios)
0 0 4 0 2
Pre-requisite :NIL
Course Category :Experiential Elective
Course Type :Integrated Course - Theory

COURSE OUTCOMES:
Upon successful completion of this course, students will be able to
CO1:Understand the woring principle of smarter wearables.
CO2:Analyse and design a suitable solution for employee safety and fire detector.
CO3:Analyse and design a suitable solution for healthcare sector.
CO4:Analyse and design a suitable solution for automative sector.
CO5:Analyse and design a suitable solution for retail and logistics sector.

MAPPING OF COURSE OUTCOMES WITH PO, PSO:

PO’S PSO’S
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 M M M S
CO2 M M S S S S M M S
CO3 M M S S S S S M S L M M S
CO4 M M S S S S M M S L M M S
CO5 M M S S S S M M S L M M S

UNIT I: Entertainment Wearables Entertainment- Bluetooth Headset, Fitness,

Smart Watch, location and Tracking – Personal navigation Device

UNIT II: Manufacturing Flow Optimization- Flow Transmitter, Real Time Inven-
tory – EPOS,ECR and Cash Drawer, Asset Tracking Process Analytics(pH, Gas, Con-
centration, Force Humidity)- portable data terminal, Employee safety – Fire and safety
detector, Predictive Maintenance, Firmware Updates.

UNIT III: Healthcare Remote Monitoring-ECG, Ambulance Telemetry, Drug Track-

ing, Hospital Asset Tracking, Access Control, Predictive Maintenance.

UNIT IV: Automotive Infotainment, Wire replacement, Telemetry, Predictive main-

tenance, Car –to-car and Car-to-infrastructures, logistics Supply chain.

327
UNIT V: Retail and Logistics Supply chain control, NFC Payment, Intelligent shop-
ping application, Smart product management, Green Houses, Golf courses, Meteorological
station network, Compost, Wine quality enhancing, Quality of shipment conditions, Item
Location, Storage In compatibility detection, Fleet tracking

TEXT BOOK(S):
1. IoT for Industries (IBM ICE Publications)

328
5.4 216CSE4304: INFORMATION SECURITY GOVERNANCE,
MANAGEMENT PRACTICES, SECURITY AUDIT & MON-
ITORING

216CSE4304 INFORMATION SECURITY GOV- L T P X C

ERNANCE, MANAGEMENT
PRACTICES, SECURITY AUDIT
& MONITORING
0 0 4 0 2
Pre-requisite :NIL
Course Category :Experiential Elective
Course Type :Integrated Course - Theory

COURSE OUTCOMES:
Upon successful completion of this course, students will be able to
CO1:Understand the information security goverence plocies in various levels of organi-
zation.
CO2:Apply the practical security measures for compiling the security using control frame-
works.
CO3:Understand the various security plans,skills and role to ensure the information se-
curuty for the computing environment.
CO4:Apply the different techniques for providing the security analysis, design and risk
management.
CO5:Analyze the various security solutions to the Security implementation and review
process.
CO6:Develop the security control framework by considereing the practical security con-
straints.
CO7:Implement the various methods for evaluating event analysis and response frame-
work.

MAPPING OF COURSE OUTCOMES WITH PO, PSO:

PO’S PSO’S
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 S M L M S
CO2 S S S M S S
CO3 S L L M S
CO4 S M S M S S
CO5 S S M M S
CO6 S S M S L L M M M L L S S
CO7 S S M S L L L M S L L S S

UNIT I: Getting Information Security Right: Top to Bottom Overview, Infor-

mation Security Governance, Tone at the Top, Tone at the Bottom, Governance, Risk,
and Compliance (GRC), The Compliance Dilemma, Overview, Evolution of Information

329
Security, Organization Historical Perspective, Understand the External Environment,
The Internal Company Culture, Prior Security Incidents, Audits , Security Strategy De-
velopment Techniques, Security Planning, History of the Security Leadership Role Is Rel-
evant, The New Security Officer, Mandate, Security Leader Titles, Techie versus Leader,
The Security Leaders Library, Security Leadership Defined, Security Leader Soft Skills,
Seven Competencies for Effective Security Leadership, Security Functions, Reporting
Model, Overview, Communication between the CEO, CIO, Other Executives, and CISO,
Building Grassroots Support through an Information Security Council, Overview, Risk
in Our Daily Lives, Accepting Organizational Risk, Just Another Set of Risks, Man-
agement Owns the Risk Decision, Qualitative versus Quantitative Risk Analysis, Risk
Management Process, Risk Mitigation Options, Why Information Security Policies Are
Important, Avoiding Shelfware, Electronic Policy Distribution, Canned Security Policies,
Policies, Standards, Guidelines Definitions, An Approach for Developing Information Se-
curity, Policies, Utilizing the Security Council for Policies, The Policy Review Process.

UNIT II: Security Compliance Using Control Frameworks And Managerial

Controls: Practical Security Considerations Overview, Security Control Conver-
gence, Security Control Methodology, Security Assessment and Authorization Controls,
Planning Controls, Risk Assessment Controls, System and Services Acquisition Controls,
Program Management Controls, Overview, Access Control Controls, Audit and Account-
ability, Controls, Identification and Authentication, System and Communications Protec-
tions, Overview, Awareness and Training Controls, Configuration Management Controls,
Contingency Planning Controls, Incident Response Controls, Maintenance Controls, Me-
dia Protection Controls, Physical and Environmental Protection Controls, Personnel Se-
curity Controls, System and Information Integrity Controls, Overview, Anatomy of an
Audit, Audit Planning Phase, On-Site Arrival Phase, Audit Execution Phase, Entrance,
Exit, and Status Conferences, Report Issuance and Finding Remediation Phase, Why a
Chapter Dedicated to Security Communications?, End User Security Awareness Train-
ing, Delivering the Message, Security Awareness Training Does Not Have to Be Boring,
Security Officer Communication Skills, Applying Personality Type to Security Communi-
cations, Overview, Security Control Convergence, Security Control Methodology, Security
Assessment and Authorization Controls, Planning Controls, Risk Assessment Controls,
System and Services Acquisition Controls, Program Management Controls. Recent Secu-
rity Incidents, Who Will Be Next?, Every Control Could Result in an Incident. 17 Ways
to Dismantle Information Security Governance Efforts

UNIT III: Introduction to Information Security Management, Concepts, Se-

curity Life Cycle and Security Plan Overview, Why Information Security Mat-
ters, Information Sensitivity Classification, Information Security Governance, The Com-
puting Environment, Security of Various Components in the Computing Environment,
Security Interdependence, CIA Triad, Security Goals versus Business Goals, The Secu-
rity Star, Parker’s View of Information Security, What Is Information Security Man-
agement?, Defense-In-Depth Security, Security Controls, The NSA Triad for Security
Assessment Brief History of Management, Traditional Management Skills and Security
Literacy, Managerial Skills, Redefining Mintzberg’s Managerial Roles, Strategic Manage-
ment Concepts, IS Security Management Activities, Do We Really Need an Independent
Information Security Functional Unit?, The Information Security Management Cycle,
IS Security Management versus Functional Management, Security Planning in the SLC,

330
Security Analysis, Security Design, Security Implementation, Security Review, Contin-
ual Security, Overview, SP Development Guidelines, SP Methodology, Security Policy
- Overview, Security Policy, Standards, and Guidelines, Security Policy Methodologies,
Business Continuity Planning - Business Disruptions, Business Continuity, Disaster Re-
covery, Responding to Business Disruptions, Developing a BCP

UNIT IV: Security Analysis, Security Design and Security Risk Manage-
ment Introduction, The Risk Management Life Cycle, The Preparation Effort for Risk
Management, A Sustainable Security Culture, Information Needed to Manage Risks,
Factors Affecting Security risk, The ALE Risk Methodology, Operational, Functional,
and Strategic Risks, Operational Risk Management: Case of the Naval Safety Center,
The ABLE methodology, Continual Security: Integrated Fault-Event Analysis and Re-
sponse Framework (IFEAR)- Introduction, IFEAR Methodology, Fault Tree Analysis,
Event Tree Analysis, FTA-ETA Integration, Risk Management, Simulation and Sensitiv-
ity Analysis, Active Security Assessment - Introduction, Standards for Active Security
Assessment, Limits of Active Security Assessment, Can You Hack Your Own System?,
Ethical Hacking of a Computing Environment, Ethics in Ethical Hacking, ASA through
Penetration Testing, Strategies for Active Security Assessment, Guidelines and Terms
between Testers and the Organization, The Active Security Assessment Project System
Availability - Introduction, Computer Clustering, Review of Cluster Concepts, Types of
Clusters, Web Site Availability, Application Centers No Longer the Only Sound Imple-
mentation, Computation of Availability in High-Availability Cluster, Related Availability
Definitions, How to Obtain Higher Availability: The Cisco Process, Common Configura-
tions for Clusters, Self-Healing and Availability. Nominal Security Enhancement Design
Based on ISQ/IEC 27002 - Introduction, History of the ISO/IEC 27002, ISO/IEC 27002,
How to Use the ISO/IEC 27002 to Enhance Security, Measurement and Implementa-
tions, Strategies to Enhance the ISO/IEC 27002-Based Security Posture, Comparing the
ISO/IEC 27002-Based Security Posture Enhancement Strategies Technical Security En-
hancement Based on ISO/IEC 27001 - Introduction, How Organizations Interact with
the Standards, General ISMS Framework, The ISMS Model, The Process Approach En-
sures the Continual Improvement of the ISMS, Development of the Information Security
Management System, Design of the ISMS, Security Inventory Needs, The Integration of
ISMS Subsystems, Self-Assessment for Compliance, Revisiting ISMS Scoping.

UNIT V: Security Implementation, Security Review and Continual Security

Security Solutions - Introduction, Security Solutions, The NIST Security Solution Taxon-
omy, The ISO Security Solution Taxonomy The Common Criteria - The Birth of the Com-
mon Criteria, Common Uses of the CC, The CC Document, The CC Security Approach,
Information Resource Evaluation Methodology, CC Security Evaluation Programs, The
American Model of CC Evaluation Programs, A National Model, Some Other CC Eval-
uation Requirements. Security Review through Security Audit - Introduction, Security
Audit Means Different Things to Different People, Some Security Audit Activities, Our
Definition of Security Audit, Main Features in Security Audit, Application Audit, How
Does Security Audit Relate to the Corporate Security Policy?, Structure of a Security
Audit, Security Audit versus IT Auditing, Applicable Security-Related Standards, Secu-
rity Audit Grades, Privacy Rights, Information Technology, and HIPAA - The Problem
of Privacy, The Meaning of Privacy, HIPAA, Regulatory Standards: The Privacy Rule,
The HIPAA Security Rule, Administrative Safeguards, NIST on HIPAA, Conducting

331
Effective Risk Analysis

TEXT BOOK(S):
1. Information Security Governance, Management Practices, Information Security Au-
dit Monitoring(IBM ICE Publications)

332
5.5 216CSE2201: COMPETITIVE PROGRAMMING

216CSE2201 COMPETITIVE PROGRAMMING L T P X C

0 0 2 0 1
Pre-requisite :Programming Language (C/Python/Java)
Course Category :Experiential Elective
Course Type :Practical

OBJECTIVE(S):
• Develop the skills for solving complex problems leveraging Computer Programming

• Prepare for the campus placements in top level industries requiring power coding
capabilities

• Obtain internship offers from the industries.

COURSE OUTCOMES:
Upon successful completion of this course, students will be able to
CO1:Understand the basic problems in mathematics and String processing.
CO2:Develop computationally efficient solutions using data structures.
CO3:Apply the different approaches for solving the problems using logical and design
thinking

MAPPING OF COURSE OUTCOMES WITH PO:

PO’S PSO’S
CO’S 1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 S S S S S S S S S
CO2 S S S S S M M S S S S
CO3 S S S S S S S L L S S

COURSE TOPIC(S):
MODULE I: ADHOC MATHEMATICS PROBLEMS AND STRING PRO-
CESSING Number Theory : Prime Numbers, GCD, LCM, Euler’s Totient (Phi) Func-
tion – Modulo Arithmetic – Fibonacci Numbers, Factorial Number – String Processing
with Dynamic Programming: String Alignment, Longest Common Sequence, Palindrome
– Suffix tree and Suffix array.

MODULE II: DATA STRUCTURES AND LIBRARIES Tips to the competi-

tive programming – Data structures with Built in Libraries: Linear Data Structure, Non
Linear Data Structure – Data Structures with our Own Libraries: Graph, Union-Find
Disjoint sets- Segment Tree.

333
MODULE III : PROBLEM SOLVING PARADIGMS AND GRAPHS Com-
plete Search – Examples – Divide and Conquer: Usage of Binary Search – Greedy Algo-
rithm: Classical and Non Classical Example – Dynamic Programming – Graph: Depth
First Search –Breadth First Search – Kruskal’s algorithm – Dijkstras’s algorithm – Bell-
man’s algorithm- Ford’s Algorithm – Floyd Warshall’s Algorithm.

TEXT BOOK(S):
1. Steven Halim, Felix Halim, Competitive Programming.

Credits will be earned if any one of the following is satisfied:

1. Participate in Industry level coding competition and get a recognition.

2. Participate in coding competitions organized in any of the Top-100 NIRF institu-

tions.

3. Participate in the coding competition conducted by KARE and reach Top-20 posi-
tion in dashboard

334
5.6 216CSE3201: MICRO PROJECT

216CSE3201 MICRO PROJECT L T P X C

0 0 2 0 1
Pre-requisite :NIL
Course Category :Experiential Elective
Course Type :Practical

OBJECTIVE(S):
• Understand state-of-the-art technologies pertaining to the areas of interest

• Get insights on the existing tools and methodologies for solving complex problems

COURSE OUTCOMES:
Upon successful completion of this course, students will be able to
CO1:Analyze the use cases of state-of-the-art technologies to solve complex problems
CO2:Demonstrate the applications of specific tool/technology in solving a particular
problem pertaining to the domain of study.

MAPPING OF COURSE OUTCOMES WITH PO:

PO’S PSO’S
CO’S 1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 S S S S S S S S S
CO2 S S S S S M M S S S S

Complete the following to earn the credit:

1. Survey and select courses pertaining to Mainstream technologies (Artificial Intelli-
gence & Machine Learning/ Cyber Security & Forensics/ Data Analytics/ Internet
of Things/ Networking/ Software Development)

2. With the approval by a mentor, complete the course with certification

3. Demonstrate the learnt technology through a working model

REFERENCES:
1. NPTEL: https://nptel.ac.in/

2. Coursera: https://www.coursera.org/in

3. EdX: https://www.edx.org/

4. Udemy: https://www.udemy.com/

335
 6 HONORS ELECTIVE

6.1 213CSE2101: ADVANCED WEB FRAMEWORKS

213CSE2101 Advanced Web Frameworks L T P X C

3 0 0 0 3
Pre-requisite :NIL
Course Category :Honors Elective
Course Type :Theory

COURSE OBJECTIVES:
Understand client server architecture and able to use the skills for web project
development Create job opportunities as a web developer.

COURSE OUTCOMES:
CO1: Develop a static, interactive and well-formed webpage using HTML.
CO2: Develop necessary skills for designing and developing web applications using JavaScript.
CO3: Analyze React JS and Angular JS to create reusable components for web and mobile
apps.
CO4: Apply Object Oriented concepts in developing PHP applications.
CO5: Create and deploy scalable web based system using Laravel

MAPPING OF COURSE OUTCOMES WITH PO, PSO:

PO’S PSO’S
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 S L S
CO2 S S S S S M S
CO3 S M S
CO4 S M M M M S
CO5 S S S S S L M M S

UNIT I: HTML Basics

HTML Introduction, HTML Elements, Attributes, HTML Headings, Paragraphs, HTML
Formatting, Fonts, Styles, HTML Links, Images, Tables, HTML Lists, Forms, Frames,
HTML Colors, Color names, Color values, HTML Quick List.

UNIT II: JavaScript Programming

Intro to JavaScript- Variables- JavaScript Programming- Writing Functions- Dynamic
Web Page Creation- JavaScript Graphics- Built in Functions Methods- Object Oriented
JavaScript- Javascript Loops- Events- IFRAME and jQuery- Windows and Javascript-
JavaScript Forms

336
UNIT III: Angular JS and React JS
Angular JS Basics- Angular Expressions- Angular JS Filters- Angular JS directives- An-
gular JS Modules- Angular JS Forms- Introduction to React JS- React Components-
Build a simple React component- React internals- Component composition- - Compo-
nent styling- Add styles to your components

UNIT IV: Object Oriented PHP

Object Oriented Programming with PHP – Classes, Properties, Methods, Constructor,
Destructor, Inheritance

UNIT V: PHP MVC Framework - Laravel

Introduction to Laravel and MVC, Environment Setup, Routes, Namespaces, Controllers,
Views, Request Response, Redirections, Forms, Session, Cookie, Database Connectivity
and CRUD operations.

15 WEEK COURSE PLAN

Week Lecture (3 hours) Pedagogy

Week 1 HTML Introduction HTML Power point presenta-
Elements, Attributes tion
HTML Headings, Para-
graphs
Week 2 HTML Formatting, Fonts, Explicit Teaching
Styles HTML Links, Im- Power point pre-
ages, Tables HTML Lists, sentation, Flipped
Forms, Frames videos
Week 3 HTML Colors, Color Explicit Teaching peer
names, Color values HTML learning
Quick List. Intro to
JavaScript- Variables
Week 4 JavaScript Programming- Seminar Self-Study
Writing Functions Dy- Topic Power Point
namic Web Page Creation presentation, case
JavaScript Graphics studies
Week 5 Built in Functions Meth- Explicit Teaching,
ods Object Oriented case studies
JavaScript- Javascript
Loops Events,IFRAME
and jQuery- Windows and
Javascript
Week 6 Case study: JavaScript Power point presenta-
Forms Angular JS Basics tion, Flipped videos,
Angular Expressions case studies

337
 Week 7 Angular JS Filters Angu- Power point presenta-
lar JS directives Angular JS tion
Modules
Week 8 Angular JS Forms Intro- Problem based Learn-
duction to React JS React ing Video presentation
Components
Week 9 Build a simple React com- Explicit Teaching
ponent React internals
Component composition
Week 10 Component styling Add Power point presenta-
styles to your compo- tion, Case Studies
nents Object Oriented
Programming with PHP
Week 11 Classes Properties Methods Power point presenta-
tion, Flipped videos
Week 12 Constructor Destructor In- Power point presenta-
heritance tion, Flipped videos
Week 13 Introduction to Laravel and peer learning, Case
MVC Environment Setup Studies
Routes
Week 14 Namespaces, Controllers Power point presenta-
Views, Request Response tion, Flipped videos
Redirections, Forms
Week 15 Session Cookie Database Explicit Teaching
Connectivity and CRUD
operations.

REFERENCES:
1. Web Technologies: HTML, JAVASCRIPT, PHP, JAVA, JSP, XML and AJAX,
Black BookKindle Edition, by Kogent Learning Solutions Inc, 2012.

2. PHP: The Complete Reference, By Steven Holzner. Publisher: Tata McGraw Hill,
2007.

3. Laravel: Up and Running, By Matt Stauffer. Publisher: O’Reilly Media, 2016.

338
 6.2 213CSE2102: BLOCKCHAIN TECHNOLOGY

213CSE2102 BlockChain Technology L T P X C

3 0 0 0 3
Pre-requisite :NIL
Course Category :Honors Elective
Course Type :Theory

COURSE OBJECTIVES:
Understand how block chain systems (mainly Bitcoin and Ethereum) work. To
securely interact with them. Design, build, and deploy smart contracts and dis-
tributed applications. Integrate ideas from block chain technology into their own
projects.

COURSE OUTCOMES:
CO1: Understand emerging abstract models for Blockchain Technology.

CO2: Analyze major research challenges and technical gaps existing between theory and
practice in crypto currency domain.

CO3: Understand the Bitcoin concepts clearly and persuasively.

CO4: Understand the function of Blockchain as a method of securing distributed ledgers,

how consensus on their contents is achieved, and the new applications that they
enable.

CO5: Apply hyperledger Fabric and Etherum platform to implement the Block chain
Application.

MAPPING OF COURSE OUTCOMES WITH PO, PSO:

PO’S PSO’S
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 S S S
CO2 S M M M M S L S
CO3 S M M S
CO4 S M M M M L S
CO5 S S S S S M M M M S

UNIT I: INTRODUCTION TO BLOCKCHAIN

Blockchain- Public Ledgers, Blockchain as Public Ledgers -Bitcoin, Blockchain 2.0, Smart
Contracts, Block in a Blockchain, Transactions-Distributed Consensus, The Chain and
the Longest Chain - Cryptocurrency to Blockchain 2.0 - Permissioned Model of Blockchain,
Cryptographic -Hash Function, Properties of a hash function-Hash pointer and Merkle
tree.

339
UNIT II: BITCOIN AND CRYPTOCURRENCY
A basic crypto currency, Creation of coins, Payments and double spending, FORTH – the
precursor for Bitcoin scripting, Bitcoin Scripts , Bitcoin P2P Network, Transaction in Bit-
coin Network, Block Mining, Block propagation and block relay, Consensus introduction,
Distributed consensus in open environments-Consensus in a Bitcoin network.

UNIT III: BITCOIN CONSENSUS

Bitcoin Consensus, Proof of Work (PoW)- Hashcash PoW , Bitcoin PoW, Attacks on
PoW ,monopoly problem- Proof of Stake- Proof of Burn - Proof of Elapsed Time - Bitcoin
Miner, Mining Difficulty, Mining Pool-Permissioned model and use cases, Design issues
for Permissioned Blockchains, Execute contracts- Consensus models for permissioned
blockchain-Distributed consensus in closed environment Paxos.

UNIT IV: DISTRIBUTED CONSENSUS

RAFT Consensus-Byzantine general problem, Byzantine fault tolerant system-Agreement
Protocol, Lamport-Shostak-Pease BFT Algorithm-BFT over Asynchronous systems, Prac-
tical Byzantine Fault Tolerance.

UNIT V: HYPER LEDGER FABRIC ETHERUM

Architecture of Hyperledger fabric v1.1-Introduction to hyperledger fabric v1.1, chain
code- Ethereum: Ethereum network, EVM, Transaction fee, Mist Browser, Ether, Gas,
Solidity, Smart contracts, Truffle Design and issue Crypto currency, Mining, DApps,
DAO.

15 WEEK COURSE PLAN

Week Lecture (3 hours) Pedagogy

Week 1 Blockchain- Public Ledgers Power point presen-
Bitcoin, Blockchain 2.0 tation and Flipped
Smart Contracts, Block in videos
a Blockchain
Week 2 Parallel Databases: Explicit Teaching
Transactions-Distributed
Consensus The Chain and
the Longest Chain Cryp-
tocurrency to Blockchain
2.0
Week 3 Permissioned Model of Explicit Teaching peer
Blockchain Cryptographic learning
Hash Function
Week 4 AProperties of a hash Seminar Self-Study
function Hash pointer and Topic Power Point
Merkle tree A basic crypto presentation
currency

340
Week 5 Creation of coins Pay- Power point presenta-
ments and double spending, tion Video presenta-
FORTH the precursor for tion
Bitcoin scripting, Bitcoin
Scripts
Week 6 Bitcoin P2P Network Power point presenta-
Transaction in Bitcoin Net- tion, Flipped videos
work, Block Mining Block
propagation and block relay
Week 7 Case Study:Consensus case studies, Power
introduction, Distributed point presentation
consensus in open envi-
ronments Consensus in a
Bitcoin network Bitcoin
Consensus, Proof of Work
(PoW)
Week 8 Hashcash PoW , Bitcoin Collaborative Teach-
PoW Attacks on PoW ing – Seminar Self-
,monopoly problem- Proof Study Topic
of Stake Proof of Burn -
Proof of Elapsed Time
Week 9 Bitcoin Miner, Mining Dif- Explicit Teaching
ficulty, Mining Pool Permis-
sioned model and use cases
Design issues for Permis-
sioned Blockchains
Week 10 Execute contracts- Consen- Power point presenta-
sus models for permissioned tion, Case Studies
blockchain Distributed con-
sensus in closed environ-
ment Paxos.RAFT Consen-
sus
Week 11 Byzantine general problem Power point presenta-
Byzantine fault tolerant tion, Flipped videos
system Agreement Protocol
Week 12 Lamport-Shostak Pease Power point presenta-
BFT Algorithm BFT over tion, Flipped videos
Asynchronous systems
Week 13 Practical Byzantine Fault Power point presenta-
Tolerance. Architecture of tion
Hyperledger fabric v1.1 In-
troduction to hyperledger
fabric v1.1
Week 14 chain code- Ethereum: Power point presenta-
Ethereum network EVM, tion, Flipped videos
Transaction fee Mist
Browser, Ether

341
 Week 15 Gas, Solidity, Smart con- Explicit Teaching,
tracts Truffle Design and is- Case Studies
sue Crypto currency, Min-
ing, DApps, DAO.

REFERENCES:
1. T1. Mastering Blockchain: Deeper insights into decentralization, cryptography,
Bitcoin, and popular Blockchain frameworks by Bashir, Imran, 2017.

2. 2. Arvind Narayanan, Joseph Bonneau, Edward Felten, Andrew Miller, and Steven
Goldfeder. Bitcoin and cryptocurrency technologies: a comprehensive introduction.
Princeton University Press, 2016.

3. Joseph Bonneau et al, SoK: Research perspectives and challenges for Bitcoin and
cryptocurrency, IEEE Symposium on security and Privacy, 2015.

342
 6.3 213CSE2103: VIDEO ANALYTICS

213CSE2103 Video Analytics L T P X C

3 0 0 0 3
Pre-requisite :NIL
Course Category :Honors Elective
Course Type :Theory

COURSE OBJECTIVES:
• To address the research issues towards developing algorithms for video Analysis
that can perform high-level problem solving.

• To do visual recognition tasks on real-world images and videos.

• To review and discuss current approaches to high-level visual recognition problems,

such as background modeling, object recognition and categorization, tracking, scene
understanding, human motion understanding, etc.

COURSE OUTCOMES:
CO1: Understand the basic features of modeling, shadowing and tracking.

CO2: Apply principles of Data Science to the . analysis of large-scale problems.

CO3: Understand the fundamental principles of video analytics and their application.

CO4: Understand behavioral analysis and identify suspicious activity of human.

CO5: Analyze the various human face recognition and gait algorithms

MAPPING OF COURSE OUTCOMES WITH PO, PSO:

PO’S PSO’S
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 S S S M S S S
CO2 M M M S
CO3 S S S S
CO4 M M M M S
CO5 L S S S

343
UNIT I: INTRODUCTION
Computer Vision: Challenges- Spatial Domain Processing – Frequency Domain Processing-
Background Modeling-Shadow Detection-Eigen Faces - Object Detection -Local Features-
Mean Shift: Clustering, Tracking - Object Tracking using Active Contours

UNIT II: Tracking and Video Analysis

Tracking and Motion Understanding – Kalman filters, condensation, particle, Bayesian
filters, hidden Markov models, change detection and model based tracking- Motion esti-
mation and Compensation-Block Matching Method, Hierarchical Block Matching, Over-
lapped Block Motion and compensation,Pel Recursive Motion Estimation, Mesh Based
Method, Optical Flow Method - Motion Segmentation -Thresholding for Change Detec-
tion, Estimation of Model parameters

UNIT III: VIDEO ANALYTICS ON FIELD

Introduction Video Basics Fundamentals for Video Surveillance Scene Artifacts Object
Detection and Tracking: Adaptive Background Modelling and Subtraction Pedestrian De-
tection and Tracking Vehicle Detection and Tracking Articulated Human Motion Tracking
in Low Dimensional Latent Spaces.

UNIT IV: BEHAVIOURAL ANALYSIS AND ACTIVITY RECOG-

NITION
Event Modelling Behavioural Analysis Human Activity Recognition Complex Activity
Recognition Activity modeling using 3D shape - Video summarization shape based ac-
tivity models Suspicious Activity Detection.

UNIT V: HUMAN FACE RECOGNITION AND GAIT ANAL-

YSIS
Introduction: Overview of Recognition algorithms Human Recognition using Face: Face
Recognition from still images Face Recognition from video Evaluation of Face Recogni-
tion Technologies Human Recognition using gait: HMM Framework for Gait Recognition
View Invariant Gait Recognition Role of Shape and Dynamics in Gait Recognition.

15 WEEK COURSE PLAN

Week Lecture (3 hours) Pedagogy

344
Week 1 Computer Vision: PPT, Demonstration
Challenges- Spatial Do-
main Processing – Fre-
quency Domain Processing-
Background Modeling-
Shadow Detection-Eigen
Faces - Object Detection
-Local Features
Week 2 Mean Shift: Clustering, Problem solving
Tracking - Object Track-
ing using Active Contours,
Tracking and Motion Un-
derstanding – Kalman fil-
ters, condensation, particle,
Bayesian filters
Week 3 hidden Markov models, Problem Solving,
change detection and model PPT
based tracking- Motion esti-
mation and Compensation-
Block Matching Method,
Hierarchical Block Match-
ing
Week 4 Overlapped Block Motion PPT,Problem Solv-
and compensation,Pel- ing, Flipped Learning
Recursive Motion Estima-
tion, Mesh Based Method
Week 5 Optical Flow Method - PPT,Problem Solv-
Motion Segmentation - ing, demonstration
Thresholding for Change
Detection, Estimation of
Model parameters
Week 6 Introduction Video Basics Case study, Seminar
Fundamentals for Video
Surveillance Scene Arti-
facts Object Detection and
Tracking
Week 7 Adaptive Background Flipped Learning,
Modelling and Subtraction Demonstration
Pedestrian Detection and
Tracking Vehicle Detection
and Tracking Articulated
Week 8 Human Motion Tracking PPT, case study
in Low Dimensional Latent
Spaces, , Natural Scene
Videos, Crowd Analysis

345
 Week 9 Event Modelling Be- Case Study
havioural Analysis Human
Activity Recognition Com-
plex Activity Recognition
Week 10 Activity modeling using 3D PPT
shape
Week 11 Video summarization shape Flipped Learning ,
based activity models PPT
Suspicious Activity Detec-
tion,Video Segmentation
and Key Frame Extraction
Week 12 introduction: Overview PPT, case study
of Recognition algorithms
Human Recognition using
Face: Face Recognition
from still images
Week 13 Face Recognition from Demonstration
video Evaluation of Face
Recognition Technologies.
Week 14 Human Recognition using Case study
gait: HMM Framework for
Gait Recognition View
Week 15 Invariant Gait Recognition Case study
Role of Shape and Dynam-
ics in Gait Recognition

REFERENCES:
1. Anand Rajaraman and Jeffrey David Ullman, Mining of Massive Datasets, Cam-
bridge University Press, 2012.

2. Yunqian Ma, Gang Qian, Intelligent Video Surveillance: Systems and Technology,
CRC Press (Taylor and Francis Group), 2009.

3. Michael Berthold, David J.Hand, Intelligent Data Analysis, Springer, 2007.

4. Rama Chellappa, Amit K.Roy Chowdhury, Kevin Zhou.S, Recognition of Humans

and theirActivities using Video, Morgan Claypool Publishers, 2005.

346
 6.4 213CSE3101:ADVANCED COMPUTER ARCHITECTURE

213CSE3101 ADVANCED COMPUTER ARCHI L T P X C

TECTURE
3 0 0 0 3
Pre-requisite :Nil
Course Category :Honors Elective
Course Type :Theory

COURSE OBJECTIVES:
• To introduce students about the principles of computer design, instruction set de-
sign concepts, performance enhancements, new and alternative computer architec-
tures, and the design and implementation of high performance computing systems.

• To equip students with the skills to undertake performance comparisons, improve

the performance of applications, and develop applications to solve computationally
intensive problems.

COURSE OUTCOMES:
CO1: Understand the fundamentals of computer design.

CO2: Demonstrate the knowledge of pipelining and ILP to solve the designing issues.

CO3: the various issues in architecture and thread level parallelism.

CO4: the various multiprocessor architecture.

CO5: Demonstrate the memory and I/O interface concepts

MAPPING OF COURSE OUTCOMES WITH PO, PSO:

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

347
UNIT I: FUNDAMENTALS OF COMPUTER DESIGN
Parallel Programming Techniques:Loop Splitting – Ideal Speedup – Spin-Locks, Con-
tention And Self Scheduling. Scheduling : Loop Scheduling – Variations On Loop
Scheduling – Self Scheduling – Variations On Self-Scheduling – Indirect Scheduling –
Block Scheduling

UNIT II: PIPELINING AND ILP

Fundamentals of Computer Design - Measuring and Reporting Performance - Instruction
Level Parallelism and Its Exploitation - Concepts and Challenges - Overcoming Data
Hazards with Dynamic Scheduling Dynamic Branch Prediction

UNIT III:THREAD LEVEL PARALLELISM

Multi-threading Multiprocessors - Centralized and Distributed Shared Memory Archi-
tectures Cache Coherence Issues - Performance Issues Synchronization Issues Models of
Memory Consistency Buses,-SMT Architecture and Performance

UNIT IV: MULTIPROCESSOR ARCHITECTURE

Taxonomy of Parallel Architectures - Centralized Shared Memory Architecture - Syn-
chronization - Memory Consistency - Symmetric and Distributed Shared Memory Archi-
tectures - SISD, MISD, MIMD, Single Instruction Multiple Data Stream (SIMD) Archi-
tectures

UNIT V:MEMORY AND I/O

Latency hiding technique, Principles of multithreading, fine grain multi computer, scal-
able and multithreaded architecture, Dataflow and hybrid architecture

TEXT BOOK(S):
1. John L. Hennessey and David A. Patterson, Computer Architecture A Quantitative
Approach, Morgan Kaufmann / Elsevier, Fifth edition, 2012.

2. Richard Y. Kain, Advanced Computer Architecture a Systems Design Approach,

PHI, 2011.

REFERENCES:
1. Kai Hwang and Faye Briggs, Computer Architecture and Parallel Processing, Mc
Graw-Hill International Edition, 2000.

2. John P.Hayes, Computer architecture and Organization, Tata McGraw Hill, Third
edition, 1998.

3. David E. Culler, Jaswinder Pal Singh, Parallel computing architecture : A hard-

ware/software approach , Morgan Kaufmann /Elsevier Publishers, 1999

348
 6.5 213CSE3102: AUGMENTED REALITY

213CSE3102 AUGMENTED REALITY L T P X C

3 0 0 0 3
Pre-requisite :NIL
Course Category :Honors Elective
Course Type :Theory

COURSE OBJECTIVES:
• To introduce students to augmented reality technology

• To expose students to the various capabilities of augmented reality technology

• To equip student with technical knowledge in creating an augmented reality appli-

cation

COURSE OUTCOMES:
CO1: Understand the basic concept and display devices used for augmented reality.

CO2: Understand and apply various tracking systems using in AR.

CO3: Understand the visualization through camera and analyze the visualization chal-
lenges.

CO4: Apply modeling, annotations and collaborating and navigating with AR environ-
ment.

CO5: Analyze the software engineering requirements for an AR developer and predict the
future of AR.

MAPPING OF COURSE OUTCOMES WITH PO, PSO:

PO’S PSO’S
1 2 3 4 56 7 8 9 10 11 12 1 2
CO1 S M S M S S S
CO2 S S S L M M S
CO3 S M M S M S
CO4 S S S L L S
CO5 S S M L L S

349
UNIT I: INTRODUCTION OF AUGMENTED REALITY
Definition and Scope, Examples, Related Fields, Displays Multimodal Displays, Visual
Perception, Spatial and Visual Displays, Primary Features and Present Development on
Virtual Reality. Applications in various fields, Threats.

UNIT II: TRACKING

Coordinate system, Characteristics of Tracking Technology, Stationary Tracking System,
Mobile Sensors, Optical Tracking, Computer Vision for Augmented Reality. Multiple
Models of Input and Output Interface in Virtual Reality: Input Tracker, Sensor, Digital
Glove, Movement Capture, Video-based Input, 3D Menus and 3DScanner etc. Output
Visual, Auditory, Haptic Devices.

UNIT III: CALIBRATION, REGISTRATION, COHERENCE,VISUALIZA

Camera and Display Calibration, Registration, Visual Coherence, Situated Visualization
Challenges and Registration, Annotations and Labeling, X-ray Visualization, Spatial Ma-
nipulation and Information Filtering.

UNIT IV: MODELING, ANNOTATIONS, AUTHORING, NAV-

IGATION AND COLLABORATION
Specifying Geometry and Appearance, Annotation, Requirements, Elements and Solu-
tions of AR Authoring, Navigation, Properties, Co-located and Remote Collaboration
and its case study.

UNIT V: SOFTWARE ARCHITECTURE AND FUTURE

AR Application and Software Engineering Requirements, Developer Support and Wish
List, Interfacing with Smart Objects, Augmented Human, AR as a Social Computing

15 WEEK COURSE PLAN

Week Lecture (3 hours) Pedagogy

Week 1 Definition and Scope, Ex- PPT, Video Presenta-
amples, Related Fields, Dis- tion
plays Multimodal Displays,
Visual Perception, Spatial
and Visual Displays, Ap-
plications in various fields,
Threats.

350
Week 2 Primary Features and PPT, Case study
Present Development on
Virtual Reality, Coordinate
system, Characteristics of
Tracking Technology, Sta-
tionary Tracking System,
Mobile Sensors, Optical
Tracking
Week 3 Multiple Models of Input PPT, Video Presenta-
and Output Interface in tion, Peer Learning
Virtual Reality,Computer
Vision for Augmented Real-
ity, Input Tracker, Sensor,
Digital Glove
Week 4 Movement Capture, Video- PPT, Video Presenta-
based Input, 3D Menus and tion, Peer Learning
3D Scanner etc.
Week 5 Output :Visual, Auditory, PPT, Flipped Learn-
Haptic Devices, Camera ing
and Display Calibration,
Registration, Visual Coher-
ence
Week 6 Situated Visualization PPT, Video Presenta-
Challenges and Registra- tion, Peer Learning
tion, X-ray Visualization,
Spatial Manipulation and
Information Filtering
Week 7 Annotations and Labeling PPT
Week 8 Specifying Geometry and PPT, Problem solving
Appearance
Week 9 Annotation, Require- PPT, Demonstration
ments,Elements and Solu-
tions of AR Authoring
Week 10 Navigation, Properties, Co- Demonstration,
located and Remote Collab- Flipped video, PPT
oration
Week 11 AR Application and Soft- Case Study, PPT,
ware Engineering Require- Problem Solving
ments
Week 12 Developer Support and Video Presentation,
Wish List, Interfacing with Demonstration
Smart Objects
Week 13 Augmented Human Case Study, Video
presentation

351
 Week 14 Interactive Techniques in PPT, Case study
Virtual Reality
Week 15 AR as a Social Computing PPT
Platform

REFERENCES:
1. D.Schmalstieg, T.Hollerer, ”Augmented Reality: Principles Practice”, Addison
Wesley - Pearson Education, 2016.

2. Helen Papagiannis, Augmented Human: How Technology Is Shaping the New Re-
ality, Oreiley, 2016.

3. Sean Morey , John Tinnell, Augmented Reality: Innovative Perspectives Across

Art, Industry, and Academia, Parlor Press, 2016.

4. Melissa Bosworth, Lakshmi Sarah, Crafting Stories for Virtual Reality, Routledge,
2018.

352
 6.6 213CSE3103: ADVANCED DATABASES

213CSE3103 ADVANCED DATABASES L T P X C

3 0 0 0 3
Pre-requisite :NIL
Course Category :Honors Elective
Course Type :Theory

COURSE OBJECTIVES:
To acquire knowledge on parallel and distributed databases and its applications.
To study the usage and applications of Object Oriented and Intelligent databases.
To understand the emerging databases like Mobile, XML, Cloud and Big Data

COURSE OUTCOMES:
CO1: Demonstrate the usage of high performance database like parallel and distributed
database.

CO2: Create the real world data using object oriented database.

CO3: Apply the rule set in the database to implement intelligent databases.

CO4: Organize the data using XML database for better interoperability.

CO5: Implement big data and store in a transparent manner in the cloud.

MAPPING OF COURSE OUTCOMES WITH PO, PSO:

PO’S PSO’S
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 S L S
CO2 S M M M M M S
CO3 S M M M S
CO4 S M M M M M M S
CO5 S M M M M L M S

UNIT I: PARALLEL AND DISTRIBUTED DATABASES

Database System Architectures: Centralized and Client-Server Architectures – Server
System Architectures – Parallel Systems- Distributed Systems – Parallel Databases: I/O
Parallelism – Inter and Intra Query Parallelism – Inter and Intra operation Parallelism
– Design of Parallel Systems Distributed Database Concepts - Distributed Data Storage
– Distributed Transactions – Commit Protocols – Concurrency Control – Distributed
Query Processing – Case Studies.

353
UNIT II: INTELLIGENT DATABASES
Active Databases: Syntax and Semantics (Starburst, Oracle, DB2) - Taxonomy – Appli-
cations - Design Principles for Active Rules - Temporal Databases: Overview of Temporal
Databases TSQL2- Deductive Databases - Recursive Queries in SQL - Spatial Databases-
Spatial Data Types – Spatial Relationships - Spatial Data Structures - Spatial Access
Methods - Spatial DB Implementation.

UNIT III: OBJECT AND XML DATABASES

Concepts for Object Databases: Object Identity – Object structure – Type Constructors
– Encapsulation of Operations – Methods – Persistence – Type and Class Hierarchies –
Inheritance. XML Databases: XML - Related Technologies - XML Schema - XML Query
Languages - Storing XML in Databases - XML and SQL.

UNIT IV: MOBILE AND MULTIMEDIA DATABASES

Mobile Databases: Location and Handoff Management - Effect of Mobility on Data Man-
agement -Location Dependent Data Distribution - Mobile Transaction Models - Concur-
rency Control -Transaction Commit Protocols - Multimedia Databases - Image Databases
– Audio Databases - Video Databases.

UNIT V: EMERGING TECHNOLOGIES

Web Databases - Geographic Information Systems - Biological Data Management - Cloud
Based Databases: Data Storage Systems on the Cloud - Cloud Storage Architectures -
Cloud Data Models- Query Languages - Introduction to Big Data-Storage - Analysis.

15 WEEK COURSE PLAN

Week Lecture (3 hours) Pedagogy

Week 1 Database System Archi- Power point presen-
tectures Centralized and tation and Flipped
ClientServer Architectures videos
Server System Architec-
tures Parallel Systems
Distributed Systems
Week 2 Parallel Databases: I/O Explicit Teaching
Parallelism Inter and Intra Power point pre-
Query Parallelism Inter and sentation, Flipped
Intra operation Parallelism videos
Distributed Transactions
Week 3 Distributed Database Con- Explicit Teaching peer
cepts Distributed Data learning
Storage Design of Parallel
Systems

354
Week 4 Active Databases Syntax Collaborative Teach-
and Semantics (Starburst, ing – Seminar Self-
Oracle, DB2) Taxonomy Study Topic Power
Spatial Databases, Recur- Point presesnattion,
sive Queries in SQL case studies
Week 5 Types Spatial Relationships Explicit Teaching,
Spatial Data Structures case studies
Spatial Access Methods
Case study: Spatial DB
Implementation
Week 6 Concepts for Object Power point presenta-
Databases: Object Identity tion, Flipped videos
Object structure Type
Constructors Methods
Persistence Type and Class
Hierarchies Inheritance
Week 7 Encapsulation of Oper- Power point presenta-
ations XML Databases: tion
XML Related Technologies
XML Schema XML Query
Languages
Week 8 Storing XML in Databases Problem based Learn-
Location Dependent Data ing Video presentation
Distribution Mobile Trans-
action Models
Week 9 Concurrency Control Trans- Explicit Teaching
action Commit Protocols
Multimedia Databases
Week 10 T Image Databases Au- Power point presenta-
dio Databases Case Study: tion, Case Studies
Video Databases
Week 11 Applications Control Dis- Power point presenta-
tributed Query Processing tion, Flipped videos
Web Databases
Week 12 Geographic Information Power point presenta-
Systems, Biological Data tion, Flipped videos
Management Cloud Based
Databases
Week 13 Data Storage Systems on peer learning, Case
the Cloud Cloud Storage Studies
Architectures Cloud Data
Models
Week 14 Query Languages , Intro- Power point presenta-
duction to Big Data Storage tion, Flipped videos
Week 15 Analysis XML and SQL Explicit Teaching
Commit Protocols Concur-
rency

355
TEXT BOOK(S):
1. Henry F Korth, Abraham Silberschatz, S. Sudharshan, “Database System Con-
cepts”,Sixth Edition, McGraw Hill, 2011.

2. R. Elmasri, S.B. Navathe, “Fundamentals of Database Systems”, Fifth Edition,

Pearson Education/Addison Wesley, 2007.

REFERENCES:
1. Thomas Cannolly and Carolyn Begg, “Database Systems, A Practical Approach
to Design, Implementation and Management”, Third Edition, Pearson Education,
2007

2. C.J.Date, A.Kannan and S.Swamynathan, ”An Introduction to Database Systems”,

Eighth Edition, Pearson Education, 2006.

3. Raghu Ramakrishnan, Johannes Gehrke, “Database Management Systems”, Mc-

Graw Hill, Third Edition 2004

356
 6.7 213CSE4101: HIGH PERFORMANCE COMPUTING

213CSE4101 HIGH PERFORMANCE COM- L T P X C

PUTING
3 0 0 0 3
Pre-requisite :NIL
Course Category :Honors Elective
Course Type :Theory

COURSE OBJECTIVES:
• The objective is to familiarize students with the fundamental concepts, techniques
and tools of parallel computing.

• It will enable the students to better understand parallel computing in the applica-
tion area, and will prepare you to take advanced courses in more specific areas of
parallel computing.

COURSE OUTCOMES:
CO1: Understand the evolution of High Performance Computing (HPC) with respect to
laws and the contemporary notion that involves mobility for data, hardware devices
and software agents.

CO2: Understand, appreciate and apply parallel and distributed algorithms in problem
Solving.

CO3: the impact of network topology on parallel/distributed algorithm formulations and

traffic their performance.

CO4: Obtain hand-on experience with the agent-based and Internet-based parallel and
distributed programming techniques.

CO5: Recognize the master skills to measure the performance of parallel and distributed
programs.

MAPPING OF COURSE OUTCOMES WITH PO, PSO:

PO’S PSO’S
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 S M S S M S S
CO2 S M M S
CO3 S M M S M S
CO4 L M S M S
CO5 S L S S S

357
UNIT I:Introduction and Process
Introduction: Parallel Processing – Shared Memory Multiprocessing – Distributed Shared
Memory – Message Passing Parallel Computers. Processes Shared Memory Program-
ming: Processes - Shared Memory Programming – General Model Of Shared Memory
Programming – Forking-Creating Processes – Joining Processes -Process Model Under
UNIX

UNIT II: Techniques and Scheduling

Parallel Programming Techniques:Loop Splitting – Ideal Speedup – Spin-Locks, Con-
tention And Self Scheduling. Scheduling : Loop Scheduling – Variations On Loop
Scheduling – Self Scheduling – Variations On Self-Scheduling – Indirect Scheduling –
Block Scheduling

UNIT III: Network and Memory

Taxonomy of parallel computing paradigms Shared memory computers- Cache coherance-
UMA - ccNUMA Distributed-memory computers- Hierarchical systems- NetworksBasic
performance characteristics- Buses- Switched and fat- tree networks- Mesh networks- Hy-
brids - Basics of parallelization - Why parallelize - Data Parallelism - Function Parallelism-
Parallel Scalability- Factors that limit parallel execution- Scalability metrics

UNIT IV: Message Passing Paradigm

Programming Using the Message Passing Paradigm, Principles of Message-Passing Pro-
gramming.The Building Blocks: Send and Receive Operations. MPI: The Message Pass-
ing Interface. Topologies and Embedding. Overlapping Communication with Computa-
tion. Collective Communication and Computation Operations

UNIT V:Algorithms For Parallel Machines

Models Of Computation – Analysis Of Parallel Algorithms – Prefix Computation – His-
togram Computation – Parallel Reduction – SortingNetworks - Matrix Multiplication

TEXT BOOK(S):
1. Introduction To Parallel Programming - By Steven Brawer.

2. Introduction to Parallel Computing, Ananth Grama, Anshul Gupta, George Karypis,

Vipin Kumar, By Pearson Publication.

3. Introduction To Parallel Processing – By M.Sasikumar, Dinesh Shikhare And P.

Ravi Prakash.

REFERENCES:
1. R. Buyya, High Performance Cluster Computing: Architectures and Systems, Vol:1,
Pearson Education, 2008.

358
2. I. Foster and C. Kesselman, The Grid: Blueprint for a New Computing Infrastruc-
ture, Morgan Kaufmann, Elsevier, 2004.

3. C.S.R.Prabhu, Grid and Cluster Computing, PHI, 2008.

4. B.Sosinsky, Cloud Computing Bible, Wiley, 2011.

5. D.Janakiram, Grid Computing, Tata McGraw-Hill, 2005.

6. R.Buyya, C.Vecchiola and S.T.Selvi, Mastering Cloud Computing Foundations and

Applications Programming, Morgan Kaufmann, Elsevier, 2013.

359
 6.8 213CSE4102: NEXT GENERATION NETWORKS

213CSE4102 NEXT GENERATION NET- L T P X C

WORKS
3 0 0 0 3
Pre-requisite :NIL
Course Category :Honors Elective
Course Type :Theory

COURSE OBJECTIVES:
To make students to understand the core technologies, theories, and dilemmas that
face next generation network engineers in this field. To introduce students the best
practices about how to design, deploy, and troubleshoot next generation networks.

COURSE OUTCOMES:
CO1: Understand the technical, economic and service advantages of next generation net-
works.

CO2: Understand with NGN Functional Architecture of a next generation network (NGN)
with reference.

CO3: Analyze various NGN key development areas such as Access Network Area, Core
Transport Network Area, Service Creation Area and Advanced Technologies for
Network and Service Management.

CO4: Compare various NGN Standards in the vein of TMF, NGOSS, 3GPP and LTE/SAE.

CO5: Analyze the various Wireless Application Protocol (WAP) WAP, MMS, GPRS ap-
plication, CDMA and 3G

MAPPING OF COURSE OUTCOMES WITH PO, PSO:

PO’S PSO’S
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 S L L S
CO2 S M M M M S
CO3 S M S
CO4 S M M M M L S
CO5 S M M M M M M S

UNIT I: INTRODUCTION
Next Generation Networks (NGN) Vision, Scenarios and Advances NGN Networks : Per-
spectives and Advances Some Possible Scenarios Virtual International Congress Virtual
Class Rooms e-Education and Experimental Laboratory Virtual Home Home Networks
Automatic Tra?c and Car Driving NGN Requirements on Technology and Management.

360
UNIT II: NGN FUNCTIONAL ARCHITECTURE
ITU NGN Functional Architecture Proposed NGN Functional Architecture NGN Net-
work Operator NGN Network Service Provider NGN Customer and CTE Network and
Service Evaluation towards NGN- Fixed Network Evaluation Mobile Network Evaluation
Internet Evaluation

UNIT III:NGN KEY DEVELOPMENT AREAS

Terminal Area Access Network Area Backhaul Network Area Core Transport Network
Area Service Creation Area Network Control and Managerial Area Service Control and
Management Advanced Technologies for Network and Service Management.

UNIT IV: NGN STANDARDIZATION

ITU and GSI NGN ETSI and TISPAN - NGN ATIS and NGN CJA and NGN - TMF
and NGOSS, NGMN Alliance and NGMN - 3GPP and LTE/SAE NGMN Alliance and
NGMN, 3GPP and LTE/SAE

UNIT V: WIRELESS APPLICATION PROTOCOL

Spread-spectrum Technology, FHSS, DSSS, CDMA versus GSM, Wireless data, third
generation networks, applications in 3G Wireless LAN, WiFi v/s 3G Voice over Internet
protocol and convergence, Voice over IP,H.323 framework 13 20 for voice over IP, SIP,
comparison between H.323 ad SIP, Real time protocols, convergence technologies, call
routing, call routing, voice over IP applications, IMS, Mobile VoIP, Security issues in
mobile Information security, security techniques and algorithms, security framework for
mobile environment

15 WEEK COURSE PLAN

Week Lecture (3 hours) Pedagogy

Week 1 Next Generation Networks Power point presen-
(NGN) Vision, Scenar- tation and Flipped
ios and Advances NGN videos
Networks : Perspectives
and Advances Some Pos-
sible Scenarios Virtual
International Congress
Week 2 Virtual Class Rooms Explicit Teaching
e-Education and Experi-
mental Laboratory Virtual
Home Home Networks
Automatic Tra?c and Car
Driving Driving NGN Re-
quirements on Technology
and Management

361
Week 3 ITU NGN Functional Ar- Explicit Teaching peer
chitecture Proposed NGN learning
Functional Architecture
NGN Network Operator
NGN Network Service
Provider NGN Customer
and CTE Network and
Service Evaluation towards
NGN
Week 4 Fixed Network Evaluation Demo-Experimental
Mobile Network Evaluation design of Mobile
Internet Evaluation network evalua-
tion,Power point
presentation
Week 5 Terminal Area Access Net- Power point presenta-
work Area Backhaul Net- tion Video presenta-
work tion
Week 6 Area Core Transport Net- Power point presenta-
work Area Service Cre- tion, Flipped videos
ation Area Network Control
and Managerial Area Ser-
vice Control and Manage-
ment
Week 7 Advanced Technologies for Power point presenta-
Network and Service Man- tion
agement ITU and GSI NGN
ETSI and TISPAN
Week 8 NGN ATIS and NGN Explicit Teaching
CJA and NGN TMF and
NGOSS NGMN Alliance
and NGMN
Week 9 3GPP and LTE/SAE Collaborative Teach-
NGMN Alliance and ing – Seminar Self-
NGMN 3GPP and Study Topic
LTE/SAE Spread-spectrum
Technology
Week 10 FHSS, DSSS, CDMA versus Power point presenta-
GSM Wireless data third tion, Video presenta-
generation networks tion
Week 11 applications in 3G Wireless Power point presenta-
LAN WiFi v/s 3G Voice tion, Flipped videos
over Internet protocol and
convergenc Voice over IP
Week 12 H.323 framework for voice Power point presenta-
over IP SIP comparison be- tion, Flipped videos
tween H.323 ad SIP

362
 Week 13 Real time protocols conver- Power point presenta-
gence technologies call rout- tion
ing
Week 14 call routing, voice over Power point presenta-
IP applications IMS Mobile tion, Flipped videos
VoIP
Week 15 Security issues in mobile In- Explicit Teaching,
formation security security Case Studies
techniques and algorithms,
security framework for mo-
bile environment.

REFERENCES:
1. Jingming Li Salina and Pascal Salina, Next Generation Networks, Prospective and
Potentials , John Wiley and Sons, 2007.

2. Thomas Plavyk, Next generation Telecommunication Networks, Services and Man-

agement, Wiley IEEE Press Publications, 2012.

3. Eldad Perahia and Robert Stacey, Next Generation Wireless LANs, Cambridge
University Press, 2008.

4. Monique J. Morrow, Next Generation Networks, CISCO Press, 2007

363
 6.9 213CSE4103: VISUAL CRYPTOGRAPHY

213CSE4103 VISUAL CRYPTOGRAPHY L T P X C

3 0 0 0 3
Pre-requisite :NIL
Course Category :Honors Elective
Course Type :Theory

COURSE OBJECTIVES:
• To understand the cryptography concept by Symmetrical key encryption which
allows visual information (pictures, text, etc.) to be encrypted in such a way that
the decryption can be performed by the human visual system, without the aid of
computers.

• To encrypts the visual information to be sent at the sender in to two shares in

(2, 2) model, in this two shares one act as a key for decryption and another as
encrypted message (transparency), at the receiver end no computation is required
it just required the stacking of the key and the encrypted message.

• To understand that decryption can be performed by the human visual system. This
technique can be extended for (k, n) model, gray level and for color images

COURSE OUTCOMES:
CO1: Identify the need and importance of visual cryptography

CO2: Demonstrate the concept of steganography and digital watermarking

CO3: Understand the various cryptographic schemes

CO4: Discuss the procedures for constructing visual cryptographic schemes

CO5: Discuss about visual cryptography and share generation using color images

MAPPING OF COURSE OUTCOMES WITH PO, PSO:

PO’S PSO’S
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 S M L S S S
CO2 S S L L S
CO3 M S S
CO4 M M S
CO5 M M M M S

364
UNIT I: FUNDAMENTALS OF VISUAL CRYPTOGRAPHY
Introduction, history, visual cryptography Vs traditional cryptography, common issues
in Visual Cryptography - Visual Secret Sharing scheme: Construction of Visual Secret
Shares, Halftone VSS Construction Using Error Diffusion, Share structure. - Distribution
of SIP and ABP: Generation of Halftone shares via Error Diffusion.

UNIT II: PRINCIPLES OF STEGANOGRAPHY

Principles of Steganography and Digital Watermarking and Their Applications. Secret
Sharing-Introduction - History of Secret Sharing - Principle of Secret Splitting - Phases of
Secret Sharing - Access Structures - Threshold Schemes - Shamirs Scheme, Applications.

UNIT III: VISUAL CRYPTOGRAPHY

Visual Cryptography-Introduction-History of Visual Cryptography - Construction of Vi-
sual Cryptography Schemes - Basis Matrices - Construction of 2-Out-of-2 Visual Cryptog-
raphy Schemes - Construction of 2-Out-of-2 Visual Cryptography Schemes With Square
Pixel Expansion - Construction of Visual Cryptography Schemes With Consistent Image
Size.

UNIT IV: VISUAL CRYPTOGRAPHY SCHEMES

Visual Cryptography Schemes-Construction of 2-Out-of-N Visual Cryptography Schemes
- Basis Matrices for 2-Out-Of-N Visual Cryptography Schemes - Construction of N-Outof-
N Visual Cryptography Schemes - Basis Matrices For N-Out-of-N Visual Cryptography
Schemes - Construction of K-Out-of-N Visual Cryptography Schemes - Basis Matrices
for K-Out-of-N Visual Cryptography Schemes.

UNIT V: VISUAL CRYPTOGRAPHY FOR COLOR IMAGES

Color Superposition and Darkening Problem - Formal Models for Colored VCS - Models
for B AND W VC and Color VC - Visual Cryptography Schemes for SC model, Appli-
cations of Visual Cryptography.

15 WEEK COURSE PLAN

Week Lecture (3 hours) Pedagogy

365
Week 1 Introduction, history, visual PPT, Video Presentation,
cryptography Vs traditional Demonstration
cryptography, common is-
sues in Visual Cryptogra-
phy - Visual Secret Sharing
scheme: Construction of Vi-
sual Secret Shares.
Week 2 Halftone VSS Construction PPT, Problem Solving
Using Error Diffusion,
Share structure. - Distri-
bution of SIP and ABP:
Generation of Halftone
shares via Error Diffusion.
Week 3 hPrinciples of Steganogra- PPT, Video Presentation
phy and Digital Water-
marking and Their Appli-
cations. Secret Sharing-
Introduction - History of
Secret Sharing - Principle
of Secret Splitting - Phases
of Secret Sharing - Access
Structures.
Week 4 Threshold Schemes -Naor PPT, Flipped Learning
and Shamir’s Basic Visual
Secret Sharing Scheme,
Visual Cryptography-
Introduction-History of
Visual Cryptography
Week 5 Construction of Visual demonstration
Cryptography Schemes -
Basis Matrices - Construc-
tion of 2-Out-of-2 Visual
Cryptography Schemes
Week 6 Construction of 2-Out- demonstration
of-2 Visual Cryptography
Schemes With Square Pixel
Expansion - Construction
of Visual Cryptography
Schemes With Consistent
Image Size.

366
 Week 7 Visual Cryptography Demonstration, Problem
Schemes-Construction of Solving, PPT
2-Out-of-N Visual Cryp-
tography Schemes - Basis
Matrices for 2-Out-Of-
N, Visual Cryptography
Schemes - Construction of
N-Outof-N Visual Cryp-
tography Schemes - Basis
Matrices For N-Out-of-
N Visual Cryptography
Schemes
Week 8 Construction of K-Out- PPT, Problem solving
of-N Visual Cryptography
Schemes - Basis Matrices
for K-Out-of-N Visual
Cryptography Schemes.
Week 9 Visual Multiple Secret PPT, Problem Solving
Sharing Schemes
Week 10 Color Superposition and problem solving
Darkening Problem
Week 11 Formal Models for Colored Peer Learning , PPT
VCS
Week 12 Models for B and W VC and PPT, Flipped Learning
Color VC .
Week 13 Visual Cryptography PPT
Schemes for SC model
Week 14 Applications of Visual PPT, Case study
Cryptography
Week 15 Case study on model imple- Case study
mentation

REFERENCES:
1. BorkoFurht, EdinMuharemagic and Daniel Socek, Multimedia Encryption and Wa-
termarking , Springer,2007

2. Rafael C. Gonzalez, Richard E. Woods, Digital Image Processing, Pearson Educa-

tion 3rd Edition, 2010

3. Jen-Shyang Pan, Hsiang-Cheh Huang and Lakhi C. Jain, Intelligent Watermarking

Techniques, World Scientific,2007

4. JosefPieprzyk, Thomas hardjino and Jennifer Sebberry,Fundamentals of computer

security, Springer International 2nd Edition,2004.

367
368
369