DAYANANDA SAGAR UNIVERSITY

SHAVIGE MALLESHWARA HILLS, KUMARASWAMY LAYOUT

BENGALURU–560 111, KARNATAKA.

SCHOOL OF ENGINEERING

SCHEME & SYLLABUS

FOR
BACHELOR OF TECHNOLOGY (B.Tech.) – 2019

COMPUTER SCIENCE & TECHNOLOGY

(CST)

(WITH EFFECT FROM 2019-20)

 SCHEME - B.TECH – 2019-20 ONWARDS

III SEM - COMPUTER SCIENCE & TECHNOLOGY

PROGRAM CR SCHEME OF TEACHING PREREQUISITE

S COURSE
CODE COURSE TITLE / S/ COURSE
L CODE L T P C SEM
AU P CODE
1 104 19CS2301 ENGINEERING MATHEMATICS – III – CSE & CST CR 04 -- -- -- 04 * ***
2 104 19CS2302 COMPUTATIONAL THINKING WITH PYTHON CR 02 -- 02 -- 03 * ***
3 104 19CS2303 DIGITAL ELECTRONICS & LOGIC DESIGN CR 03 -- 02 -- 04 * ***
4 104 19CS2304 DATA STRUCTURES AND APPLICATIONS CR 03 -- 02 -- 04 I 19EN1103
5 104 19ENC004 FUNDAMENTALS OF ENGINEERING ECONOMICS CR 03 -- -- -- 03 * ***
6 104 19CS2305 ANALOG ELECTRONICS CR 02 -- 02 -- 03 * ***
17 -- 08 -- 21

CR – Credit, AU – Audit, L – Lecture, T – Tutorial, P – Practical, S/P – Seminar/Project, C – No. of Credits,

 SCHEME - B.TECH – 2019-20 ONWARDS

IV SEM - COMPUTER SCIENCE & TECHNOLOGY

PROGRAM SCHEME OF TEACHING PREREQUISITE

COURSE CR /
SL CODE COURSE TITLE S/ COURSE
CODE AU L T P C SEM
P CODE
104 DISCRETE MATHEMATICAL CR 03 01 -- -- 04
1 19CS2401 * ***
STRUCTURES
104 19CS2402 PRINCIPLES OF MICROPROCESSORS & CR 03 01 02 -- 05
2 III 19CS2303
COMPUTER ORGANIZATION
3 104 19CS2403 DESIGN & ANALYSIS OF ALGORITHMS CR 03 01 02 -- 05 III 19CS2304
4 104 19CS2404 SIGNALS SYSTEMS CR 03 -- 02 -- 04 * ***
5 104 19CS2405 WEB TECHNOLOGIES CR 02 -- -- -- 02 * ***
6 104 19CS2406 SPECIAL TOPICS – II CR 01 -- 02 02 * ***
7 104 19CS2407 MANAGEMENT SCIENCES CR 02 -- -- -- 02 * ***
17 03 08 -- 24

CR – Credit, AU – Audit, L – Lecture, T – Tutorial, P – Practical, S/P – Seminar/Project, C – No. of Credits,

 SCHEME - B.TECH – 2019-20 ONWARDS

V SEM - COMPUTER SCIENCE & TECHNOLOGY

PROGRAM CR SCHEME OF TEACHING PREREQUISITE

COURSE
SL CODE COURSE TITLE / COURSE
CODE L T P S/P C SEM
AU CODE
1 104 19CS3501 FINITE AUTOMATA AND FORMAL LANGUAGES CR 03 01 02 -- 05 IV 19CS2401
2 104 19CS3502 OPERATING SYSTEMS + LAB CR 03 01 02 -- 05 * ***
104 19CS3503 OBJECT ORIENTED DESIGN AND PROGRAMMING CR
3 03 04 -- 05 * ***
WITH JAVA
4 104 19CS3504 DATABASE MANAGEMENT SYSTEMS + LAB CR 03 -- 02 -- 04 * ***
104 19CT3501 IDEA GENERATION & VALIDATION CR
5 -- -- -- 04 02 * ***
19CT3502 PRODUCT ENGINEERING & ENTREPRENUERSHIP
104 19CT3503 INNOVATIVE BUSINESSES & BREAKTHROUGH CR
6 -- -- -- 02 01 * ***
TECHNOLOGIES
104 19CT35XX TECHNOLOGY ELECTIVE – I CR AS INDICTED IN
7 -- -- -- 04 02
ELECTIVE LIST
12 02 10 10 24
CR – Credit, AU – Audit, L – Lecture, T – Tutorial, P – Practical, S/P – Seminar/Project, C – No. of Credits

LIST OF TECHNOLOGY ELECTIVE – I

STREAM COURSE COURSE TITLE PREREQUISITE
CODE SEM COURSE
CODE
INFORMATION AND COMMUNICATION TECHNOLOGY 19CT3511 DATA DRIVEN DECISION MAKING III 19CS2302
IMMERSIVE TECHNOLOGY 19CT3512 CREATIVE CODING * ***
DISTRIBUTED LEDGER TECHNOLOGY 19CT3513 CRYPTOGRAPHY & CYBER SECURITY * ***
INTERNET OF THINGS TOOLS & TECHNOLOGIES 19CT3514 APPLICATIONS OF IOT TECHNOLOGY STACK III 19CS2305
 SCHEME - B.TECH – 2019-20 ONWARDS

VI SEM - COMPUTER SCIENCE & TECHNOLOGY

PROGRAM CR SCHEME OF TEACHING PREREQUISITE
COURSE
SL CODE COURSE TITLE /
CODE L T P S/P C SEM COURSE CODE
AU
104 COMPILER DESIGN AND SYSTEMS CR 03 01 02 -- 05
1 19CS3601 * ***
SOFTWARE
2 104 19CS3602 COMPUTER NETWORKS CR 03 -- 02 -- 04 * ***
104 19CS3603 SOFTWARE ENGINEERING AND CR 04
3 03 -- 02 -- * ***
PROJECT MANAGEMENT
104 19CT3601 LEAN START-UP METHODOLOGY CR
4 -- -- 03 03 03 * ***
19CT3602 SMALL BUSINESS LAUNCH
5 104 19CT3603 CAREER SUCCESS STRATEGIES CR -- -- -- 02 01 * ***
6 104 19OEXXXX OPEN ELECTIVE - I CR 03 -- -- -- 03 * ***
104 19CT36XX TECHNOLOGY ELECTIVE-II CR -- -- -- 04 02 AS INDICTED IN
7
ELECTIVE LIST
12 01 09 09 22
CR – Credit, AU – Audit, L – Lecture, T – Tutorial, P – Practical, S/P – Seminar/Project, C – No. of Credits,

LIST OF TECHNOLOGY ELECTIVE – II

STREAM COURSE COURSE TITLE PREREQUISITE
CODE SEM COURSE
CODE
INFORMATION AND COMMUNICATION TECHNOLOGY 19CT3611 APPLICATIONS OF MACHINE LEARNING * ***
IMMERSIVE TECHNOLOGY 19CT3612 HUMAN COMPUTER INTERACTION * ***
DISTRIBUTED LEDGER TECHNOLOGY 19CT3613 CLOUD/IOT SECURITY SERVICES * ***
INTERNET OF THINGS TOOLS & TECHNOLOGIES 19CT3614 ROBOTIC PROCESS AUTOMATION * ***
 SCHEME - B.TECH – 2019-20 ONWARDS

VII SEM - COMPUTER SCIENCE & TECHNOLOGY

PROGRAM SCHEME OF TEACHING PREREQUISITE
COURSE CR /
SL CODE COURSE TITLE S/
CODE AU L T P C SEM COURSE CODE
P
104 19CT4701 PRODUCT DEVELOPMENT -- -- -- 04 02
1 19CT4702 THOUGHT LEADERSHIP IN CR * ***
ENTREPRENEURSHIP & INNOVATION
2 104 19CT4703 SPECIAL TOPICS CR -- -- -- 04 02 * ***
104 19CS4701 CYBER CRIMES, SECURITY POLICIES AND CR 02 - - - 02
4 * ***
LAW
5 104 19CT4704 CAPSTONE PROJECT CR - 01 01 01 02 * ***
6 104 19OEXXXX OPEN ELECTIVE – II CR 03 - - - 03 * ***
104 19CT47XX TECHNOLOGY ELECTIVE – III CR - - 02 02 02 AS INDICTED IN
7
ELECTIVE LIST
05 01 03 11 13

CR – Credit, AU – Audit, L – Lecture, T – Tutorial, P – Practical, S/P – Seminar/Project, C – No. of Credits,

LIST OF TECHNOLOGY ELECTIVE – III

STREAM COURSE COURSE TITLE PREREQUISITE
CODE SEM COURSE
CODE
INFORMATION AND COMMUNICATION TECHNOLOGY 19CT4711 BIG DATA ANALYTICS & DEEP LEARNING * ***
IMMERSIVE TECHNOLOGY 19CT4712 VIRTUAL REALITY & GAME-THEORETIC * ***
SIMULATION
DISTRIBUTED LEDGER TECHNOLOGY 19CT4713 BLOCK CHAIN & CRYPTO CURRENCY * ***
INTERNET OF THINGS TOOLS & TECHNOLOGIES 19CT4714 EDGE COMPUTING WITH IOT * ***
CLOUD TECHNOLOGIES 19CS4719 AWS WEB SERVICES * ***
 SCHEME - B.TECH – 2019-20 ONWARDS

VIII SEM - COMPUTER SCIENCE & TECHNOLOGY

PROGRAM SCHEME OF TEACHING PREREQUISITE
COURSE CR /
SL CODE COURSE TITLE S/
CODE AU L T P C SEM COURSE CODE
P
104 19CT4801 MAJOR PROJECT -- -- -- 18 09
1 * ***
19CT4802 SETTING UP A VENTURE CR
2 104 19CT4803 TECHNOLOGY STRATEGY CR -- -- 02 02 02 * ***
104 19CT48XX TECHNOLOGY ELECTIVE – IV CR - - 02 02 02 AS INDICTED IN
4
ELECTIVE LIST
- - 04 22 13

CR – Credit, AU – Audit, L – Lecture, T – Tutorial, P – Practical, S/P – Seminar/Project, C – No. of Credits,

LIST OF TECHNOLOGY ELECTIVE – IV

STREAM COURSE COURSE TITLE PREREQUISITE
CODE SEM COURSE
CODE
INFORMATION AND COMMUNICATION TECHNOLOGY 19CT4811 ARTIFICIAL INTELLIGENCE AS A SERVICE * ***
IMMERSIVE TECHNOLOGY 19CT4812 AUGMENTED & MIXED REALITY * ***
DISTRIBUTED LEDGER TECHNOLOGY 19CT4813 QUANTUM CRYPTOGRAPHY * ***
INTERNET OF THINGS TOOLS & TECHNOLOGIES 19CT4814 INDUSTRIAL INTERNET OF THINGS * ***
 OPEN ELECTIVES LIST - B.TECH PROGRAMME – 2019-20 Batch
SL.No COURSE CODE COURSE TITLE OFFERING
DEPARTMENT
1 19OE0001 ARTIFICIAL INTELLIGENCE CSE
2 19OE0002 DATA STRUCTURES & ALGORITHMS CSE
3 19OE0003 WEB TECHNOLOGIES CSE
4 19OE0004 SOCIAL NETWORKS & ANALYTICS CSE
5 19OE0005 MANAGEMENT INFORMATION SYSTEM CSE
6 19OE0006 FUNDAMENTALS OF CLOUD COMPUTING CSE
7 19OE0007 MACHINE LEARNING WITH PYTHON CSE
8 19OE0008 BUSINESS INTELLIGENCE CSE
9 19OE0009 EVOLUTION OF TELECOM ECE
10 19OE0010 SENSORS AND TRANSDUCERS ECE
11 19OE0011 DIGITAL SYSTEM DESIGN ECE
12 19OE0012 SENSORS, NETWORKS AND PROTOCOLS ECE
13 19OE0013 IMAGE PROCESSING AND COMPUTER VISION ECE
14 19OE0014 AUTOMOTIVE EMBEDDED SYSTEMS ECE
15 19OE0015 AUTOMOBILE ENGINEERING MECH
16 19OE0016 RAPID MANUFACTURING TECHNOLOGIES MECH
17 19OE0017 ROBOTICS ENGINEERING MECH
18 19OE0018 PRODUCT DESIGN & MANUFACTURING MECH
19 19OE0019 RENEWABLE ENERGY SOURCES MECH
20 19OE0020 MICRO ELECTRO MECHANICAL SYSTEMS (MEMS) MECH
21 19OE0021 PRODUCT ENGINEERING AND ENTREPRENEURSHIP CST
22 19OE0022 SMALL BUSINESS LAUNCH CST
23 19OE0023 INTRODUCTION TO AEROSPACE ENGINEERING ASE
24 19OE0024 AIRCRAFT SYSTEMS AND INSTRUMENTATION ASE
 SPECIAL TOPICS
Innovative
Creativity,
Business & Career Success Technology
Innovation &
Breakthrough Strategies Strategy
Applied Design
Technologies

INTENT
In the past years of learning, the teaching/learning has been teacher centric. In the general university system, the teacher follows the prescribed
syllabus, delivers the lectures as per a well scheduled timetable and completes the teaching process. The prescribed labs also have a routine
structure where students carry out well laid out experiments’ week on week.

The expectations and demands in today's contest are mainly in terms of problem solving. The conventional classroom engagement on its own is
found to be inadequate for students to solve real world problems when they start working in an industry. The 1-credit ‘special topic’ course will
generally have involved design and implementation components.

DELIVERABLE(S)
1. Students organize hackathons/competitions/webinar/workshops/TEDx talks/talks by CST alumni/project exhibition
under the supervision of a faculty member.
2. Creating New Product/Service – Student or team creates a new product/service by applying the concepts learned thus
far.
3. Testing Product/Service – Students thoroughly test all the features and validate the products/services developed by their
CST peers and recommend a set of features that may be added to the product/service. They assist their peers involved in
start-ups in the design and implementation of the new features.
4. Visit to a University Abroad - A group of students participate in a well-structured program in a university abroad and
complete the requirements of the university.
5. Working under a Research Professor within DSU or from Premium Institutes such as IISc, IIT, IIIT on a specific
project/task.
SEMESTER/YEAR : III SEM/II YEAR
COURSE CODE : 19CS2301
TITLE OF THE COURSE : ENGINEERING MATHEMATICS – III – CSE & CST
L: T: P: S/P : C : 4:0: 0:0 :4

MODULE 1: INTEGRATION IN THE COMPLEX PLANE

Complex Integrals, Cauchy-Goursat Theorem, Independence of Path, Cauchy’s Integral Formulas and
Their Consequences, Cauchy’s Two Integral Formulas, Some Consequences of the Integral Formulas,
Applications. [10 hours]

MODULE 2: SEQUENCES AND SERIES

Sequences and Series, Taylor Series, Laurent Series, Zeros and Poles, Residues and Residue Theorem,
Some Consequences of the Residue Theorem, Evaluation of Real Trigonometric Integrals, Evaluation
of Real Improper Integrals, Applications. [10 hours]

MODULE 3: INTRODUCTION TO PROBABILITY THEORY

Basic Probability: Probability spaces, conditional probability, independence; Discrete random
variables, Independent random variables, the multinomial distribution, Poisson approximation to the
binomial distribution infinite sequences of Bernoulli trials, sums of independent random variables;
Expectation of Discrete Random Variables, Moments, Variance of a sum, Correlation coefficient,
Chebyshev’s Inequality. [12 hours]

MODULE 4: CONTINUOUS PROBABILITY DISTRIBUTIONS AND BIVARIATE DISTRIBUTIONS

Continuous random variables and their properties, distribution functions and densities, normal,
exponential and gamma densities. Bivariate distributions and their properties, distribution of sums
and quotients, conditional densities, Bayes’ rule. [ 8hours]

MODULE 5: BASIC STATISTICS

Measures of Central tendency: Moments, skewness and Kurtosis - Probability distributions: Binomial,
Poisson and Normal - evaluation of statistical parameters for these three distributions, Correlation and
regression - Rank correlation. Small samples: Test for single mean, difference of means and correlation
coefficients, test for ratio of variances - Chi-square test for goodness of fit and independence of
attributes. [ 12 hours]

Textbooks:

1. A First course in complex analysis with applications, Dennis Zill and Patrick Shanahan, Jones and
Bartlett publishers.

2. A First Course in Probability, S. Ross, Pearson International Edition, 9th Edition

3. Fundamentals of Mathematical Statistics, S. C. Gupta and V. K. Kapoor, Sultan Chand & Sons, 11th
Edition
Reference Books:

1. Complex Variables and applications, Brown and Churchill, Mc Graw Hill Education, Eighth Edition.

2. Probability, Statistics and Statistics with Reliability, Queuing, and Computer Science Applications,
Kishore Trivedi, Prentice Hall, 2nd Edition

3. Probability and Random Processes, S. Miller and Childers, Elsevier Inc.,Second Edition
 SEMESTER/YEAR : III SEM/II YEAR
COURSE CODE : 19CS2302
TITLE OF THE COURSE : COMPUTATIONAL THINKING WITH PYTHON
L: T: P: S/P : C : 2:0:2:0:3

Course Objectives:

The objectives of the Course are:

1. To understand basic concepts of computational thinking.

2. To introduce python programming for problem solving.
3. To introduce different debugging and unit testing tools.
4. To solve real world problems using python data structures.
5. Learn to handle files and exception handling in python.
6. To explore Python's object-oriented features.
7. To build Web services and Networked programs in python.
8. To train students to design an application as part of the course mini- project
using computational thinking with python.
Course Outcomes
After undergoing this course, students will be able to:

 Understand basic concepts of computational thinking.

 Outline basic python programming for problem solving.
 Apply computational thinking to solve real world programs using python.
 Build python programs using core data structures like
 list, dictionaries and tuples
 Implement object oriented concepts using python
 Design applications related to web services and network Programming.

Course Content

Module 1: Introduction to Computational Thinking and Python:

Introduction to computational thinking: Stages of Computational thinking, Design
using Flowcharts, Implementation, Testing
Python Basics: Values, expressions and statements, Conditional execution,
Functions Iterations

Module 2: Python Environment and Data Structures

Python Environment: Usage of Debugging and Unit Testing tools in python,
Introduction to Github, Executing the python programs using Jupyter notebooks,
Python Data Structures: Strings, Arrays, Lists, Tuples, Sets and Dictionaries
Module 3: Python Files and Exception Handling
Files: File types, modes, File functions, File attributes, File positions, Looping over file,.
Exception Handling: Try-Except, Exception syntax, examples, Types of exception
with except, multiple exceptions with except, Try-Finally, Raise exceptions with
arguments, Python built-in exceptions, User-defined exceptions, Assertions.

Module 4: Python Objects

Classes and Objects: Creating classes, Using Objects, Accessing attributes, Classes as
Types, Introduction to Multiple Instances, Inheritance.

Module 5: Applications of Python

Applications: Networked Programs, Using web services

Text Book and References

Text Books:
1. “ Python for Everybody-Exploring Data Using Python 3”, Dr. Charles R. Severance, Shroff
Publishers; First edition (10 October 2017)
2. “Introduction to Computing & Problem Solving with Python”,Jeeva Jose,P.Sojan Lal, Khanna
Book Publishing; First edition (2019).

Reference Books:
1. “Computer Science Using Python: A Computational Problem- Solving Focus”,
Charles Dierbach, Introduction John Wiley, 2012.
2.“Introduction to Computation and Programming Using Python”, John V Guttag,
Prentice Hall of India, 2015.
3."How to think like a Computer Scientist, Learning with Python", Allen Downey,
Jeffrey Elkner and Chris Meyers, Green Tea Press, 2014.
4.“Learning to Program with Python”, Richard L. Halterman, 2011.
SEMESTER/YEAR : III SEM/II YEAR
COURSE CODE : 19CS2303
TITLE OF THE COURSE : DIGITAL ELECTRONICS & LOGIC DESIGN
L: T: P: S/P : C : 3:0:2:0:4

Course Objectives
The objectives of the Course are:
● To understand various number systems and conversion from one to other number
systems
● To understand the difference between analog and digital signals
● To cite the basic characteristics of TTL and CMOS logic families
● To familiar with basic logic gates and their truth tables
● To introduce basic postulates of Boolean algebra
● To manipulate expressions into POS or SOP form.
● To introduce the methods for simplifying Boolean expressions like K-Map and Quine
Mclusky
● To understand the concept of don’t care conditions and how they can be used to further
optimize the logical functions
● To design simple combinational circuits such as multiplexers, decoders, encoders
● To understand the differences between combinational and sequential Logic circuits
● To familiar with basic sequential logic component-SR Latch
● To understand the basics of various types of memories.
● To present the working of various Flip- Flops (T flip-flop, D flip-flop, R-S flip-flop, JK flip-
flop)
● To design combinational circuits using programmable logic devices.
● To design sequential circuits such as different types of Counters, Shift Registers

2.1 Course Outcomes

After undergoing this course, students will be able to:
 Demonstrate the knowledge of binary number systems, logic families, boolean
algebra and logic gates
 Analyze different methods used for simplification of Boolean expressions.
 Design combinational logic circuits using combinational logic elements
 Design combinational circuits using Programmable Logic Devices
 Analyze sequential logic elements in the design of synchronous and asynchronous
systems
 Design sequential systems composed of standard sequential modules, such as
counters and registers

Course Content
Module 1: NUMBER SYSTEMS, BOOLEAN ALGEBRA AND LOGIC GATES:
Review of number systems-Binary, Octal, Hexadecimal. Introduction to Analog
and Digital signals. TTL and CMOS technology, TTL and CMOS Parameters.
 Truth table of Basic Gates: NOT, OR, AND, Universal Logic Gates: NOR, NAND,
Positive and Negative Logic, Laws of Boolean algebra, Theorems of Boolean
algebra, Boolean/Switching functions and their implementation.
SIMPLIFICATION OF BOOLEAN EXPRESSIONS AND FUNCTIONS:
Sum-of-Products Method, Truth Table to Karnaugh Map, Pairs Quads, and
Octets, Karnaugh Simplifications, Don’t-care Conditions.
Practical:
1. Study and verification of Basic gates with Truth Tables
2. Simplification of expressions using Karnaugh Maps and realizing circuits
using Basic Gates
3. Realize binary to gray code converter and vice versa
Module 2: SIMPLIFICATION OF BOOLEAN EXPRESSIONS AND FUNCTIONS:
Product-of-sums Method, Product-of-sums simplifications, Simplification by
Quine-McClusky Method.
DESIGN OF COMBINATIONAL LOGIC CIRCUITS:
Modular combinational logic elements- Multiplexers and Demultiplexers,
Decoders, Encoders, Priority encoders, Magnitude comparator – BCD converter,
Parity Generators and Checkers.
Practicals:
1. Simplify the given expression using tabular method and to realize
circuits using Multiplexers.
2. Design and implementation parallel adder and subtractor
3. Design and implementation of comparators
4. Design various combinational logic circuits like encoders, decoders

Module 3: PROGRAMMABLE LOGIC:

Memories: RAM, ROM, SRAM, DRAM, Addressing schemes, Design of
Combinational Circuits using Programmable Logic Devices (PLDs):
Programmable Read Only Memories (PROMs), Programmable Logic Arrays
(PLAs), Programmable Array Logic (PAL) devices.
SEQUENTIAL CIRCUITS:
Introduction to Sequential Circuits. Combinational v/s Sequential circuits.
Asynchronous v/s Synchronous circuits. State table and state diagram
Module 4: SEQUENTIAL CIRCUITS (continued):
State assignment – Memory elements and their excitation functions –T flip-flop,
D flip-flop, R-S flip-flop. JK flip-flop and their excitation requirements – Design
of synchronous sequential circuits like Sequence Detectors and binary counters.

Module 5: APPLICATION OF SEQUENTIAL CIRCUITS:

Registers-Types of Registers, Serial In - Serial Out, Serial In - Parallel out,
Parallel In - Serial Out, Parallel In -Parallel Out, Universal Shift Register,
Applications of Shift Registers, Asynchronous and Synchronous Counters,
Changing the Counter Modulus, Decade Counters, Presettable Counters,
Counter Design.
 Practicals:
1. Design and implementation of shift register
2. Design and implementation synchronous counters
3. Design and implementation ring counter and Johnson counter
4. Study of 7490 BCD counter
5. Design and implementation of asynchronous counters

Textbooks and References

Text Books:
1. M. Morris Mano and Michael D. Ciletti, “Digital Design”, 6th Edition, Pearson Education, 2018
2. Donald.P. Leach, Albert Paul Malvino & Goutam Saha: Digital Principles and Applications, 8th
Edition, Tata McGraw Hill, 2015

References:

1. R D Sudhaker Samuel: Illustrative Approach to Logic Design, Sanguine-Pearson, 2010.

2. Charles H. Roth: Fundamentals of Logic Design, Jr., 7th Edition, Cengage Learning, 2014
3. John M Yarbrough, “Digital Logic Applications and Design”, Thomson Learning, 2006.
 SEMESTER/YEAR : III SEM/II YEAR
COURSE CODE : 19CS2304
TITLE OF THE COURSE : DATA STRUCTURES AND APPLICATIONS
L: T: P: S/P : C : 3:0:2:0:4

Course Objectives
The objectives of the course are
● To introduce the concept of data structure and its applications
● To introduce C language concepts required for data structures
● To design data structure operations to solve problems
● To introduce applications of data structures
● To introduce non-primitive data structures
● To analyse the complexity of a data structure
● To introduce static and dynamic memory allocation using C language
● To explain linear data structures – stack, queue, linked list
● To explain non-linear data structures – trees and graphs
● To train students to design an application as part of the course mini- project using their
choice of data structure using C language.
Course Outcomes
After completing this course, students will be able to
 Outline basic C program design for data structures
 Implement stack & queue data structure and their applications
 Apply concepts of dynamic memory allocation to real-time
problems
 Implement tree data structure and its applications
 Implement graph data structure and its applications
 Outline the concepts of file structures

Course Content

Module -1 Introduction to Data structures

Definition, Types, Algorithm Design, C Pointers, C Structure, Array Definition, Representation of Linear
Array in Memory, Array Operations (Insertion, Deletion, Search and Traversal), Single Dimensional
Arrays, Two Dimensional Arrays, Function Associated with Arrays, Arrays as Parameters, Recursive
Functions. 11 Hours

Module-2 Introduction to Stack and Queue

Stack: Definition, Array Representation of Stack, Operations Associated with Stacks- Push & Pop,
Applications of Stack: Recursion, Polish expressions, Conversion of Infix to Postfix, Infix to Prefix,
Postfix Expression Evaluation, Tower of Hanoi.
Queue: Definition, Representation of Queues, Operations of Queues- QInsert, QDelete,
Priority Queues, Circular Queue. 11 Hours

Module-3 Dynamic Data Structure

Linked List: Types, Introduction to Singly Linked lists: Representation of Linked Lists in Memory,
Traversing, Searching, Insertion & Deletion from Linked List. Doubly Linked List, Operations on Doubly
Linked List (Insertion, Deletion, Traversal). Applications: Polynomial Representation & Basic
Operations, Stack & Queue Implementation using Linked Lists.
11 Hours

Module-4 Trees & Graphs

Trees: Basic Terminology, Binary Trees and their Representation, Complete Binary Trees, Binary
Search Trees, Operations on Binary Trees (Insertion, Deletion, Search & Traversal), Application:
Expression Evaluation.
Graphs: Terminology and Representations, Graphs & Multigraphs, Directed Graphs, Sequential
Representation of Graphs, Adjacency Matrices, Graph Transversal, Connected Components and
Spanning Trees. 12 Hours

Module-5 File Structures: Physical storage media, File Organization, Linked Organization of File,
Inverted File, Organization Records into Blocks, Sequential Blocks, Indexing & Hashing, Multilevel
Indexing, Tree Index, Random File, Primary Indices, Secondary Indices.
11 Hours
Laboratory Experiments

1. To perform arithmetic operations on tables

2. To search element(s) in a multidimensional array
3. To implement stack and queue using array & linked list
4. To implement graph & binary tree traversal techniques
5. To evaluate infix/prefix/postfix expressions

Open-Ended Experiments

6. A man in an automobile searches for another man who is located at some point of a certain road.
He starts at a given point and knows in advance the probability that the second man is at any
given point of the road. Since the man being sought might be in either direction from the starting
point, the searcher will, in general, must turn around many times before finding his target. How
does he search to minimize the expected distance travelled? When can this minimum
expectation be achieved?

7. The computing resources of a cloud are pooled and allocated according to customer demand.
This has led to increased use of energy on the part of the service providers due to the need to
maintain the computing infrastructure. What data structure will you use for allocating
resources which addresses the issue of energy saving? Why? Design the solution.

8. Mini-Project on applying suitable data structure to a given real-world problem

Textbooks & References:

Textbooks
1. A M Tannenbaum, Y Langsam, M J Augentien “Data Structures using C”, Pearson, 2013
2. R.L. Kruse, B.P. Leary, C.L. Tondo, “Data Structure and Program Design in C” PHI
Reference Books
1. Horowitz Anderson-Freed, and Sahni, “Fundamentals of Data structures in C”, 2nd Edition, Orient
Longman, 2008
2. Data Structures and Algorithm analysis in C by Mark Allen Weiss, Published by Addison Wesley (3rd
Indian Reprint 2000).
3. D E Knuth, The Art of Computer Programming, Volume 1, Addison-Wesley Publishing, 2013
SEMESTER/YEAR : III SEM/II YEAR
COURSE CODE : 19ENC004
TITLE OF THE COURSE : FUNDAMENTALS OF ENGINEERING ECONOMICS
L: T: P: S/P : C : 3:0:0:0:3

Course Objectives
The objectives of the Course are:
● To familiarize the prospective engineers with elementary
● To give an introduction to market/firm structure.
● To understand tools that they are likely to find useful in their profession
● To introduce various economic concepts such as microeconomics and
macroeconomics
● To explain monetary and fiscal policy and Banking system.
● To introduce inventory analysis, cash control and cash flow
● To develop budgets and break even points
● To introduce the concept of linear programming
● To introduce the Indian economy.

Course Outcomes
After undergoing this course, students will be able to:
 Outline basic concepts of Principles of Economics
 Understand basic concepts of micro and macro economics
 Outline aggregate models and financial system
 Demonstrate Fiscal and Monetary tools
 Solve the problems of Investment analysis
 Outline concepts of Indian Economy

Course Content
Module 1:
Basic Principles and Methodology of Economics. Demand/Supply–elasticity Government Policies and
Application. Theory of the Firm and Market Structure. Basic Macro-economic Concepts (including
GDP/GNP/NI/Disposable Income) and Identities for both closed and open economies.
8 Hours

Module 2:
Aggregate demand and Supply(IS/LM).Price Indices (WPI/CPI),Interest rates ,Direct
and Indirect Taxes, Public Sector Economics–Welfare, Externalities, Labour Market-Components of
Monetary and Financial System, Central Bank–Monetary Aggregates; Commercial Banks& their
functions; Capital and Debt Markets. 8 Hours

Module 3
Monetary and Fiscal Policy Tools & their impact on the economy – Inflation and Phillips Curve -
Elements of Business/Managerial Economics and forms of organizations. Cost & Cost Control–
Techniques, Types of Costs, Budgets, Break even Analysis, Capital Budgeting, Application of Linear
Programming. 8 Hours
Module 4
Investment Analysis– NPV, ROI, IRR, Payback Period, Depreciation, Time value of money-Business
Forecasting–Elementary techniques. Statements – Cash flow, Financial. Case - Study Method.
9 Hours

Module 5
Indian economy Brief overview of post-independence period–plans. Post reform Growth, Structure of
productive activity. Issues of Inclusion–Sectors, States/Regions, Groups of people (M/F), Urbanization.
Employment–Informal, Organized, Unorganized, Public, Private - Challenges and Policy Debates in
Monetary, Fiscal, Social, External sectors.
9 Hours

Text Book and References

Text Book:

1. Mankiw Gregory N.(2002), Principles of Economics, Thompson Asia

2. V. Mote, S. Paul, G. Gupta, Managerial Economics, Tata MGH, 2004

References:

1. Misra, S.K. and Puri, Indian Economy, Himalaya, 2009

2. Pareek Saroj, Text book of Business Economics, Sunrise Publishers, 2003
SEMESTER/YEAR : IV SEM/II YEAR
COURSE CODE : 19CS2401
TITLE OF THE COURSE : DISCRETE MATHEMATICAL STRUCTURES
L: T: P: S/P : C : 3:1:0:0:4

Course Objectives

The objectives of the Course are:

● Solve problems using relations and generating functions.
● Understand and Construct mathematical arguments
● Use propositional and predicate logic in knowledge representation and program
verification.
● Develop recursive algorithms based on mathematical induction.
● Know essential concepts in graph theory and related algorithms.
● Apply knowledge of discrete mathematics in Elementary Number Theory and
problem solving.

Course Outcomes

After undergoing this course student will be able to:

 Classify functions, basic set theory relations

 Demonstrate the correctness of an argument using propositional and predicate logic ,
laws and truth tables
 Solve Algebraic Structures like groups, rings, domains
 Compare and differentiate graphs in different geometries related to edges.
 Apply mathematical induction, counting principles, recursion, elementary number
theory
 Apply and solve Euclidean Division Algorithm and Chinese Remainder Theorem

Course Content

Module 1: Relations , Types of relations, Closure Properties, Equivalence Relations, Partial

Ordering Relations, n-ary relations, Functions: one-to-one, onto and invertible
functions, sequences, indexed classes of sets, recursively defined functions,
cardinality,
Counting Principles: Permutation, combination, the pigeon hole principle,
inclusion-exclusion
principle

Module 2 : Logic and Propositional Calculus: Propositions and truth tables, tautologies and
contradictions, logical equivalence, algebra of propositions, logical implications ,
Introduction to Predicate Calculus

Module 3: Graph Theory: Introduction, data structures, graphs and multi-graphs, sub-graphs,
isomorphic and homomorphic graphs, paths, connectivity, the bridges of
Konigsberg,
 traversable multi-graphs, labelled and weighted graphs, complete, regular and
bipartite graphs.

Module 4: Properties of Integers: Introduction, order and inequalities, absolute value,

mathematical induction, division algorithm, divisibility, primes, greatest common
divisor, Euclidean algorithm, fundamental theorem of arithmetic, congruence
relation, congruence equations.

Module 5: Algebraic Structures : Introduction, operations, semi-groups, groups, subgroups,

normal subgroups, isomorphism and homomorphism, rings, integral domains and
fields, polynomials over a field.

Text Book and References

Text books:
● S. Lipschutz and M. L Lipson, Discrete Mathematics, Schaum’s outline, 3rd Edition, McGraw Hill
Higher Education, 2006.
● C L Liu, Elements of Discrete Mathematics, 2nd Edition, Tata McGraw Hill, 2000.
Reference books:
● K. Rosen. Discrete Mathematics and Its Applications (4th edition). McGraw-Hill. 1999
● Ronald R Graham, D. E. Knuth, and Oren Patashnik, Concrete Mathematics, 2nd Edition,
Addision- Wesley Publishing Company, 1994
SEMESTER/YEAR : IV SEM/II YEAR
COURSE CODE : 19CS2402
TITLE OF THE COURSE : PRINCIPLES OF MICROPROCESSORS & COMPUTER
ORGANIZATION
L: T: P: S/P : C : 3:1:2:0:5

Course Objectives
The objectives of the Course are:
● To introduce the architecture of 8086
● To understand the importance and function of each pin of 8086 Microprocessor
● To familiarize with the architecture of 8086 microprocessor and its operation
● To understand the various addressing modes required for assembly language
Programming and to calculate the physical address.
● To learn the 8086 instruction set and write 8086 Assembly level programs
● To understand the importance of different peripheral devices and their interfacing to
8086
● Understand the concepts of Hardwired control and micro programmed control.
● To explain the current state of art in memory system design
● Discuss the concept of memory organization.
● Summarize the types of memory.
● Learn about various I/O devices and the I/O interface.
● Learn the different types of serial communication techniques.
● To understand DMA technique
● To provide the knowledge on Instruction Level Parallelism
● To understand the concepts of pipelining techniques.

Course Outcomes
After undergoing this course, students will be able to:
 Identify the basic building blocks of 8086 microprocessor and use the addressing
modes for executing programs efficiently
 Develop 8086 assembly language programs using modern assembler tools
 Design interfacing of IO devices to 8086
 Design data part and control part of a processor
 Design different memory blocks
 Understand pipeline Processing

Course Content
Module-1

Introduction to Microprocessor & its Architecture:

Introduction-Evolution of Microprocessor, The Microprocessor-Based Personal Computer Systems,
Internal Microprocessor Architecture, Real mode memory addressing, Memory paging, 8086 pin
diagram, Internal Architecture of 8086,Registers, Addressing Modes-Immediate addressing, Register
addressing, direct addressing, indirect addressing, relative addressing, Instruction formats
8hrs

Module-2
Programming 8086 and its Interfacing with I/O devices
Assembler directives, Data Movement Instructions, String Data Transfers, Miscellaneous Data Transfer
Instructions, Arithmetic and Logic Instructions, BCD and ASCII Arithmetic, Basic Logic Instructions,
Shift and Rotate, String Comparisons. Program Control Instructions: The Jump Group, Assembly
language programming with 8086, macros, procedures.
8255 - Programmable Peripheral Interface; Features, Pin diagram, block diagram, 8255 programming,
DC/Stepper motor interfacing, Keyboard and display interfacing. 9hrs

Module- 3
Basic organization of computers, Block level description of the functional units as related to the
execution of a program; Fetch, decode and execute cycle. Execution cycle in terms machine
instructions.
Information representation, Floating point representation (IEEE754), computer arithmetic and their
implementation;
Data Part Design: Fixed-Point Arithmetic-Addition, Subtraction, Multiplication and Division, Arithmetic
Logic Units control and data path, data path components, design of ALU and data-path, Control Part
Design: Control unit design; Hardwired and Micro programmed Control unit.
Discussions about RISC versus CISC architectures. 10hrs

Module-4
Memory Technology: Memory hierarchy, static and dynamic memory, RAM and ROM chips, Memory
address map, Auxiliary Memory, Associative Memory, Cache Memory and organization.

I/O subsystems: Input-Output devices such as Disk, CD-ROM, and Printer etc.; interfacing with IO
devices, Isolated versus Memory Mapped I/O
Synchronous and Asynchronous data transfer: Strobe pulse and Handshaking
Modes of data transfer: Programmed I/O, Interrupt-initiated I/O and Direct memory access (DMA)
10hrs

Module - 5
Pipeline Processing, Instruction and Arithmetic Pipeline, Pipeline hazards and their resolution, Parallel
Processing Systems, Multi-core Architectures 5hrs

Text Book and References

Text Book:

1. Barry B Brey: The Intel Microprocessors, 8th Edition, Pearson Education, 2009
2. Douglas V Hall, “MICROPROCESSORS AND INTERFACING, PROGRAMMING AND
HARDWARE” TMH, 2006.
3. Mano, Morris M. Computer system architecture. Dorling Kindesley Pearson, 2005.
References:

1. Krishna Kant, “MICROPROCESSORS AND MICROCONTROLLERS Architecture,

programming and system design using 8085, 8086, 8051 and 8096”. PHI 2007.
2. Kenneth J. Ayala, “The 8086 Microprocessor: Programming & Interfacing The PC”,
Delmar Publishers, 2007
3. Muhammad Ali Mazidi, Janice Gillispie Mazidi, Danny Causey, The x86 PC Assembly
Language Design and Interfacing, 5th Edition, Pearson, 2013.
4. V. Carl Hamacher, Safwat G. Zaky and Zvonko G. Vranesic , Computer Organization ,
McGraw-Hill series 2002
5. Hayes, J.P , Computer Architecture and Organization, McGraw-Hill, 1998
6. Vincent P. Heuring and Harry F. Jordan , Computer Systems Design and Architecture
(2nd Edition), Dec, 2003
7. David Patterson and John Hennessey , Computer Organization and Design, Elsevier.
2008
8. Comer, Douglas. Essentials of computer architecture. Chapman and Hall/CRC, 2017.
9. Hord, R. Michael. Parallel supercomputing in MIMD architectures. CRC press, 2018.
10. Tanenbaum, Andrew S. Structured computer organization. Pearson Education India,
2016.
SEMESTER/YEAR : IV SEM/II YEAR
COURSE CODE : 19CS2403
TITLE OF THE COURSE : DESIGN & ANALYSIS OF ALGORITHMS
L: T: P: S/P : C : 3:1:2:0:5

Course Objectives
The objectives of the Course are:
1. Understand the Algorithm criteria
2. Ability to analyze time and space complexity
3. Analyze the asymptotic performance of algorithms.
4. Write rigorous correctness proofs for algorithms.
5. Understand the limitations of Algorithm power
6. Become familiar with the different algorithm design techniques.
7. Demonstrate a familiarity with major algorithms and data structures.
8. To apply Substitution method, Recursion tree method and Master’s method for
solving the recurrence relations
9. Understand the Divide and conquer design strategy
10. To Analyze the Time complexities of Divide and conquer Applications
11. To understand the Greedy Technique
12. To apply Greedy technique to Optimal storage on tapes- Minimum cost spanning
tree, Knapsack problem, Single Source Shortest Path Algorithm.
13. To learn the Dynamic programming techniques
14. To understand the difference between dynamic programming and divide and
conquer
15. To understand the concepts of Dynamic Programming Applications
16. To critically analyze the efficiency of alternative algorithmic solutions for the same
problem
17. To understand the Graph searching and Traversal methods
18. To learn about Strongly connected components, Graph matching, Network flow
Algorithm
19. To understand the Back tracking concept
20. To demonstrate the N queen’s problem
21. To understand the LC Branch and bound techniques
22. To apply LCBB for solving 0/1 Knapsack and TSP problem
23. Apply important algorithmic design paradigms and methods of analysis.
24. To understand the complexity measures
25. To compare the Polynomial vs Non-Polynomial time complexity
26. To understand the P, NP-hard and NP-Complete classes
27. Synthesize efficient algorithms in common engineering design situations.

Course Outcomes
After undergoing this course, students will be able to:
 Outline the overview of Data structures and Algorithms
 Understand the different Algorithmic Design strategies
 Apply the Design principles and concepts to Algorithmic design
 Describe the DAA paradigms and when an Algorithmic Design situation calls for it.
 Analyze the efficiency of Algorithms using Time and Space complexity theory
 Implement an existing algorithms to improve the run time efficiency
Course Content

Module 1 : INTRODUCTION
Notion of an Algorithm, Concept of algorithmic efficiency, Algorithm performance
Analysis- Insertion sort, Linear search. Asymptotic Notations, Analysis of
recursive algorithms through recurrence relations: Substitution method,
Recursion tree method, Master’s method.

Module 2 : DIVIDE AND CONQUER

Structure of divide-and-conquer algorithms: Analysis of divide and conquer
run time Recurrence relations: Examples-Binary search, Quick sort, Merge
sort, Strassen’s Matrix Multiplication

GREEDY METHOD
General method – Optimal storage on tapes- Minimum cost spanning tree,
Knapsack problem, Single Source Shortest Path Algorithm.

Module 3 : DYNAMIC PROGRAMMING

Overview, difference between dynamic programming and divide and conquer-
Applications: All pair shortest path in graph, Matrix chain multiplication,
Travelling salesman Problem, Longest Common subsequence, 0/1 knapsack
problem, Optimal binary search tree.

Module 4 : GRAPH SEARCHING AND TRAVERSAL

Strongly connected components, Graph matching, Network flow Algorithm
BACK TRACKING
Overview, N-queen’s problem, sum of subset and Graph coloring.
BRANCH AND BOUND
LC Searching Bounding, FIFO branch and bound, LC branch and bound
application: 0/1 Knapsack problem, Travelling Salesman Problem

Module 5 : COPING WITH THE LIMITATIONS OF ALGORITHMIC POWER

Complexity measures, Polynomial vs Non-Polynomial time complexity, P, NP-
hard and NP-Complete classes, Cook’s theorem, Standard NP-complete
problems and Reduction techniques.

Text Book and References

Text Books:
1. T. H. Cormen, Leiserson, Rivest and Stein, “Introduction of Computer algorithm,” , 3rd
Edition, The MIT Press, 2015
2. Anany Levitin, ―Introduction to the Design and Analysis of Algorithms, Third Edition,
Pearson Education, 2012
Reference Books:
1. E. Horowitz, S. Sahni, and S. Rajsekaran, “ Fundamentals of Computer Algorithms,”
Galgotia Publication, 2015
2. Sara Basse, A. V. Gelder, “Computer Algorithms : Introduction Design &
Analysis”, 3rd Edition, Addison Wesley
3. J.E Hopcroft, J.D Ullman, “Design and analysis of Computer algorithms”,
Pearson Education, 2009
4. D. E. Knuth, “ The Art of Computer Programming , Volume 3” 2nd Edition,
Addison Wesley, 2014
5. Steven S. Skiena, “The Algorithm Design Manual”, Second Edition, Springer,
2008.
SEMESTER/YEAR : IV SEM/II YEAR
COURSE CODE : 19CS2404
TITLE OF THE COURSE : SIGNALS & SYSTEMS
L: T: P: S/P : C : 3:0:2:0:4

Course Objectives
The objectives of the Course are:
● Understand Continuous and Discrete Signals and Systems
● How to apply Fourier series, Laplace Transforms, Z transforms for signal
processing/representation
● Time Invariant System and Convolution its application to Image Processing
● To give the students’ knowledge about the most important issues in sampling and
● reconstruction

Course Outcomes

After undergoing this course, students will be able to:

 Understand Various signals in CTS and DTS

 How to Apply Convolution to Image Processing
 How to use Fourier series for Periodic signal and Fourier Transform and Laplace
Transform for Non Periodic signals
 Application of convolution CNN Networks
 Conversion of Signals from Time domain to Frequency Domain
 How to Convert Analog signals to Digital and Usage of Analog Filters (Lowpass, Highpass,
Bandpass)

Course Content
Module 1: Introduction to Signals and Systems (10 hours):
Signals and systems as seen in everyday life, and in various branches of engineering and science. Signal
properties: periodicity, absolute integrability, determinism and stochastic character. Some special
signals of importance: the unit step, the unit impulse, the sinusoid, the complex exponential, some
special time-limited signals; continuous and discrete time signals, continuous and discrete amplitude
signals. System properties: linearity: additivity and homogeneity, shift-invariance, causality, stability,
realizability. Examples.

Module 2: Behavior of continuous and discrete-time LTI systems (10 hours)

Impulse response and step response, convolution, input-output behavior with aperiodic convergent
inputs, cascade interconnections. Characterization of causality and stability of LTI systems. System
representation through differential equations and difference equations. State-space Representation of
systems. State-Space Analysis, Multi-input, multi-output representation. State Transition Matrix and
its Role. Periodic inputs to an LTI system, the notion of a frequency response and its relation to the
impulse response.

Module 3: Fourier, Laplace and z- Transforms (10 hours)

Fourier series representation of periodic signals, Waveform Symmetries, Calculation of Fourier
Coefficients. Fourier Transform, convolution/multiplication and their effect in the frequency domain,
magnitude and phase response, Fourier domain duality. The Discrete-Time Fourier Transform (DTFT)
and the Discrete Fourier Transform (DFT). Parseval's Theorem. Review of the Laplace Transform for
continuous time signals and systems, system functions, poles and zeros of system functions and signals,
Laplace domain analysis, solution to differential equations and system behavior. The z-Transform for
discrete time signals and systems, system functions, poles and zeros of systems and sequences, z-
domain analysis.

Module 4: Sampling and Reconstruction (10 hours)

The Sampling Theorem and its implications. Spectra of sampled signals. Reconstruction: ideal
interpolator, zero-order hold, first-order hold. Aliasing and its effects. Relation between continuous
and discrete time systems. Introduction to the applications of signal and system theory: modulation
for communication, filtering, feedback control systems.

Text/References:
1. A. V. Oppenheim, A. S. Willsky and S. H. Nawab, “Signals and systems”, Prentice Hall India,
1997.
2. J. G. Proakis and D. G. Manolakis, “Digital Signal Processing: Principles, Algorithms, and
Applications”, Pearson, 2006.
3. H. P. Hsu, “Signals and systems”, Schaum’s series, McGraw Hill Education, 2010.
4. S. Haykin and B. V. Veen, “Signals and Systems”, John Wiley and Sons, 2007.
5. A. V. Oppenheim and R. W. Schafer, “Discrete-Time Signal Processing”, Prentice Hall,
2009.
6. M. J. Robert “Fundamentals of Signals and Systems”, McGraw Hill Education, 2007.
7. B. P. Lathi, “Linear Systems and Signals”, Oxford University Press, 2009
SEMESTER/YEAR : IV SEM/II YEAR
COURSE CODE : 19CS2405
TITLE OF THE COURSE : WEB TECHNOLOGIES
L: T: P: S/P : C : 2 : 0 : 2 : 0 :3

Course Objectives
● Understand the major areas and challenges of web programming.
● To create websites using HTML5, CSS3, JavaScript
● To create dynamic, interactive web pages using JavaScript
● Understand client-side JavaScript libraries and frameworks
● Understand server-side scripting language
● Use the techniques for creating data-driven websites using modern web technologies

Course Outcomes
After undergoing this course, students will be able to:
 Know the fundamentals of web application architecture and front end technologies
like HTML5 and CSS3
 Use JavaScript for client-side scripting and add dynamic content to pages.
 Use of XML and JSON for data transfer between client and server
 Use of Nodejs for server side programming
 Use React for web development

Course Content

Module 1 WWW, HTML5 and CSS3 (9 Hours)

INTRODUCTION TO WWW: Overview of HTTP, HTTP request – response

Markup Language (HTML5): Introduction to HTML and HTML5 - Formatting and Fonts -Commenting
Code – Anchors – Backgrounds – Images – Hyperlinks – Lists – Tables – HTML Forms.

CSS3: Levels of style sheets; Style specification formats; Selector forms; Property value forms; Font
properties; List properties; Color; Alignment of text; Background images, Conflict Resolution, CSS3
features: Box Shadow, Opacity, Rounded corners, Attribute selector.

Module 2 JAVASCRIPT (9 Hours)

Overview of Javascript; Object orientation and Javascript; General syntactic characteristics; Primitives,
operations, and expressions; Screen output and keyboard input. Control statements; Arrays;
Functions; Constructor; Pattern matching using regular expressions; DOM Events, Introduction to
asynchronous javascript-examples and applications, Introduction to callbacks-understanding
callbacks with an example

Introduction to Progressive web apps

Module – 3 XML and JSON (08 Hours)
XML: Syntax; Document structure; Document Type definitions; Namespaces; XML schemas; Displaying
raw XML documents; Displaying XML documents with CSS; XSLT style sheets; XML processors;
JSON: JSON syntax, data types, JSON vs XML,JSON parse, JSON file as database

Module –4 Node JS (08 Hours)

Introduction to Node JS, Setup Dev Environment, Node JS Modules, Node Package Manger, File System,
Debugging Node JS Application, Events, Express.JS, Database Connectivity, MVC Architecture In Node
Js Applications.

Module –5 React (08 Hours)

React -- Overview, Environment Setup, JSX, React -- Components, React -- State, Properties Overview,
Properties Validation, Component API, Component life cycle, Forms, Events, Refs and Keys. Progressive
Web Apps with React

Text Books:

1. Programming the World Wide Web – Robert W. Sebesta, 7th Edition, Pearson Education,
2008.
2. Beginning JSON, BEN SMITH, 2015
3. Kirupa Chinnathambi, “Learning React”, 1 Edition, Addison-Wesley Professional
4. Ethan Brown, First Edition, “Web Development with Node and Express”, O’Reilly Media

Reference Books:

1. Internet & World Wide Web How to H program – M. Deitel, P.J. Deitel, A. B. Goldberg, 3rd Edition,
Pearson Education / PHI, 2004.
2. Web Programming Building Internet Applications – Chris Bates, 3rd Edition, Wiley India, 2006.
3. The Web Warrior Guide to Web Programming – Xue Bai et al, Thomson, 2003.
4. Thomas A Powell, Fritz Schneider, “JavaScript: The Complete Reference”, Third
Edition, Tata McGraw Hill, 2013.
5. Mike Mcgrath, “PHP & MySQL in easy Steps”, Tata McGraw Hill, 2012.
SEMESTER/YEAR : IV SEM/II YEAR
COURSE CODE : 19CS2407
TITLE OF THE COURSE : MANAGEMENT SCIENCES
L: T: P: S/P : C : 2 : 0 : 0 : 0 :2

Course Objectives
The objectives of the Course are:
● Acquire knowledge about the fundamental concepts of organization and management
● Make decision strategies, planning process, tools and techniques
● Inculcate the traits needed to be an effective leader and familiarize with the
organizational structures and design
● Gain valuable insights into strategic process, formulation and implementation
● Utilize the intricacies involved in cultural and ethical issues of people
● Utilize the dimensions of the planning-organizing-leading-controlling (P-O-L-C)
framework
● Gain knowledge of Micro and Small Enterprises (with the help of case studies ) and
Know the Institutional Support

Course Outcomes
After undergoing this course, students will be able to:
 Observe and evaluate the various influencing factors on the current practice of organization
and management
 Use the techniques and tools of planning and make prudent decisions
 Identify how organizations adapt to uncertain environment, identify techniques managers
use to influence and control the internal environment
 Apply and execute management goals and Managing Projects
 Manage people and deal with cultural and ethical issues
 Understand and use the knowledge of Micro and Small Enterprises (with the help of case
studies ) and know the Institutional Support for setting up Micro and Small Enterprises

Course Content
Module 1: Organization
The Individual and the Organization, Management, Primary Functions of Management, Role of
management in organisation, Advantages of Managing People Well, Types of Managers, Role of
managers, management Thought, Management Roles, Environmental Factors, Internal and External
Factors 6 hrs

Module 2: Organisational control

Control in the Business Setting, Motivation, Importance of Employee Motivation, Leadership, Effective
Leader, Organising, Purpose of Organization, organisational design, Common Organizational
Structures, Factors Impacting Organizational Design, and Contingencies
5 hrs
Module – 3: Project Management
Preparation of project - meaning of project, project identification, project selection, project report,
need and significance of project report, contents, formulation, guidelines by planning commission for
project report, Enterprise Resource Planning: Meaning and Importance- Enterprise Resource Planning
and Functional areas of Management – Marketing / Sales- Supply Chain Management – Finance and
Accounting – Human Resources – Types of reports and methods of report generation
7 hrs

Module 4: People Management

Importance of people, attracting a Quality Workforce, Recruiting process, Employee Diversity, Conflict
Management, Organisational Culture, Influences on Organizational Culture, Initiating and Fostering
Cultural Change, Putting It Together: Culture and Diversity, Ethics, Cultural Issues.
6 hrs

Module – 5 Micro and Small Enterprises

Micro and Small Enterprises: Definition of micro and small enterprises, characteristics and advantages
of micro and small enterprises, steps in establishing micro and small enterprises, Government of India
industrial policy 2007 on micro and small enterprises, case study (Microsoft), Case study(Captain G R
Gopinath), case study (N R Narayana Murthy & Infosys),
Institutional support: MSME-DI, NSIC, SIDBI, KIADB, KSSIDC, TECSOK, KSFC, DIC and District level
single window agency, Introduction to IPR. 6 hrs

Text Book
1. Schermerhorn, J.R., Introduction to Management, 13th ed., Wiley; 2017
2. P. C. Tripathi, P. N. Reddy; Principles of Management , Tata McGraw Hill, 4th / 6th Edition,
2010.
3. Harold Koontz, Heinz Weihrich, Essentials of management: An International & Leadership
Perspective, 10th ed., Tata McGraw -Hill Education, 2015
5. Poornima M Charantimath, Entrepreneurship Development -Small Business Enterprises – Pearson
Education – 2006

Reference Book:
1. Samuel C. Certo, Tervis Certo, Modern management: concepts and skills, 12th ed., Pearson, 2012
2. Charles W. L. Hill, Steven Mcshane, Principles of Management McGraw Hill Education,
2017
3. Stephen Robbins, Mary Coulter, Fundamentals of Management, 9th ed., Pearson
Education, 2016
 SEMESTER V
YEAR III
COURSE CODE 19CS3501
TITLE OF THE COURSE FINITE AUTOMATA AND FORMAL LANGUAGES
Lecture Tutorial Practical Seminar/Projects Total Credits
SCHEME OF Instruction Hours Hours Hours Hours Hours
3 1 2 - 50 5

Perquisite Courses (if any)

# Sem/Year Course Code Title of the Course
1 IV/II 19CS2401 DISCRETE MATHEMATICAL STRUCTURES

COURSE OBJECTIVES :
 To learn general theory of automata, properties of regular sets and regular
expressions.
 To understand basics of formal languages.
 To know push-down automata, context- free languages, Turing machines.

COURSE OUTCOMES:
Bloom’s
CO
Outcomes Taxonomy
No. Level
CO1 Understand the concept of Automata L1
CO2 Explain the concept of Regular Expression, languages and L2
abstract machines to recognize them
CO3 Know the generalized computation model and different types L2
Computation

COURSE CONTENT:

MODULE 1 9Hrs
Introduction to Finite Automata: Study and Central concepts of automata theory, An informal
picture of finite automata, deterministic and non-deterministic finite automata, applications
of finite automata, finite automata with epsilon – transitions.

MODULE 2 12Hrs
Regular expression and languages: Regular expressions, finite automata and regular
expressions, algebraic laws of regular expressions. applications of regular expressions such
as Grep, and Lex etc.. Properties of Regular Languages: closure properties of regular
languages, Pumping Lemma, equivalence and minimization of automata
.
MODULE 3 10Hrs
Context – free Grammars and Languages: Context free grammars, Context-free languages,
Parse trees, Ambiguity in grammars and languages Pushdown Automata: Pushdown
automation (PDA), the language of PDA, equivalence of PDA’s and CFG’s, Deterministic
Pushdown Automata,

MODULE 4 9Hrs

Properties of Context – Free Languages: Normal forms of context free grammars, pumping
lemma for context free languages, closure properties of context free languages.
Applications of CFG - such as spec of programming languages, parsing techniques, and Yacc

MODULE 5 10Hrs

Introduction to Turing Machine- The Turing machine, programming techniques for Turing
machine, extensions to the basic Turing machine, restricted Turing Machines,
Turing Machines and Computers. Chomsky hierarchy

TEXT BOOKS :
1. Daniel I. A. Cohen, Introduction to Computer Theory, 2nd Edition, Wiley
India Student Edition, 2008.
2. J.E. Hopcroft , R. Motwani, and J. D. Ullman, Introduction to Automata
Theory, Languages and Computation, 3rd Edn. Pearson Education , New
Delhi 2008

REFERENCES :
1. K.L.P. Misra and N. Chandrashekaran. Theory of Computer Science-
Automata, Languages and Computation, 3rd Edn. PHI, New Delhi, 2007

2. C. Martin - Introduction to Languages and the Theory of Computation

2ndEdn, TMH, New Delhi, 2000.
SEMESTER V
YEAR III
COURSE CODE 19CS3502
TITLE OF THE COURSE Operating Systems + Lab
Lecture Tutorial Practical Seminar/Projects Total Credits
SCHEME OF Instruction Hours Hours Hours Hours Hours
3 1 2 - 50 5

Perquisite Courses (if any)

# Sem/Year Course Code Title of the Course
* *** *** ***

COURSE OBJECTIVES:

 To impart fundamental understanding of the purpose, structure, functions of

Operating system
 To introduce the notion of a process -- a program in execution, which forms the
basis of all computation.
 To introduce CPU scheduling, which is the basis for multi programmed
operating systems
 To understand different approaches to memory management.
 To present a number of different methods for preventing or avoiding deadlocks
in a computer system.
 To explores various techniques of allocating memory to processes.
 To discuss file system including access methods, file locking, and directory
structures.
 To describe the details of implementing local file systems and directory
structures
 To discuss the goals and principles of protection in a modern computer system.

COURSE OUTCOMES:
CO Bloom’s
No. Outcomes Taxonomy
Level
CO1 Describe the basic structure and functionality of Operating L2
System.
CO2 Analyse the performance of scheduling algorithms for the L4
given problems.
CO3 Apply the deadlock handling mechanisms to solve the given L3
problem.
CO4 Apply suitable techniques for management of different L3
Resources
CO5 L2
Understand the structure and organization of the file system.
 CO6 Understand the principles of protection and security L2
Mechanisms

COURSE CONTENT:

MODULE 1 9Hrs
Operating System Overview Goals of an OS, What Operating Systems Do, Basic functions,
Computing environments, classes of Operating-System; Batch, Multiprogramming, Time
sharing, Real time, Distributed systems, Operating-System Operations, Virtualization,
Operating-System Services, System Calls, Types of System Calls, Operating-System Design
and Implementation, Operating-System Structure, System Boot, Case studies; Architecture
of Unix, The kernel of Linux, Architecture of windows

MODULE 2 12Hrs
Process Management Process Concept, Process Scheduling, Process synchronization; The
critical section problem, Peterson’s solution; Synchronization hardware, Mutex locks,
Semaphores, Classical problems of synchronization; Monitors, Inter process
Communication; Shared-Memory Systems, Message-Passing Systems, Threads Overview,
Multithreading models – Pthreads.

MODULE 3 10Hrs
Deadlocks, Memory Management :System Model, Deadlock Characterization, Methods
for Handling Deadlocks, Deadlock Prevention, Deadlock Avoidance, Deadlock Detection,
Recovery from Deadlock
Memory management strategies: Contiguous Memory Allocation, Segmentation, Paging,
Demand Paging, Page-Replacement algorithms

MODULE 4 9Hrs
File System & Implementation: File concept, Access methods, Directory structure, File-
System Mounting, Protection, Directory Implementation, Allocation Methods, Free-Space
Management, Disk Structure, Disk Scheduling

MODULE 5: Security and Protection 10Hrs

Goals of security and protection, security and protection threats, security attacks; Trojan
horses, Viruses and Worms, Encryption, Encryption techniques, Authentication and
Password Security, Protection Structures, capability based computer systems, Security and
Protection in Windows

TEXT BOOKS :

1. Operating System Concepts- Abraham Silberchatz, Peter B. Galvin, Greg Gagne 9th
Edition, John Wiley
2. Operating systems- A Concept based Approach-D.M.Dhamdhere, 2nd Edition, TMH.
 REFERENCES :

1. William Stallings. ''Operating Systems: Internals and Design Principles'', 7th

Edition, Prentice Hall, 2013.
2. Andrew S. Tanenbaum. ''Modern Operating Systems'', Addison Wesley, Fourth
Edition, 2014.
 SEMESTER V
YEAR III
COURSE CODE 19CS3503
TITLE OF THE Object Oriented Design and Programming with Java
COURSE
SCHEME OF Lecture Tutorial Practical Seminar/Projects Total Credits
INSTRUCTION Hours Hours Hours Hours Hours
3 - 4 - 42 5

Perquisite Courses (if any)

# Sem/Year Course Code Title of the Course
*** *** *** ***

COURSE OBJECTIVES:
 Understand the basic concepts of object-oriented design techniques.
 Understand the fundamentals of object-oriented programming with Java.
 Draw UML diagrams for the software system.
 Impart basics of multi-threading and database connectivity.
 Develop GUI using event handling techniques in Java.

COURSE OUTCOMES:
Outcomes Bloom’s
CO No.
Taxonomy
Level
CO1 Apply the concepts of object-oriented programming in software L3
design process.
CO2 Develop Java programs using Java libraries and construct to L3
solve real-time problems.
CO3 Understand, develop and apply various object-oriented L2
features using Java to solve computational problems
CO4 Implement exception handling and JDBC connectivity in Java. L3

CO5 Build an event-oriented GUI (graphical user interface). L6

COURSE CONTENT:

MODULE 1 09 Hrs
An Overview of Object-Oriented Systems Development: Introduction; Two Orthogonal
Views of the Software; Object-Oriented Systems Development Methodology; Why an
Object-Oriented? Overview of the Unified Approach. Object Basics: Introduction; An
Object-Oriented Philosophy; Objects; Objects are Grouped in Classes; Attributes: Object
State and Properties; Object behaviour and Methods; Object Respond to Messages;
Encapsulation and Information Hiding; Class Hierarchy: Inheritance; Multiple Inheritance;
Polymorphism; Object Relationships and Associations: Consumer-Producer Association;
Aggregation and Object Containment; Case Study - A Payroll Program; Object-Oriented
Systems Development Life Cycle: Introduction; Software Development Process; Building
High-Quality Software; Object-Oriented Systems Development: A Use Case Driven
Approach; Reusability.

MODULE 2 08 Hrs
Unified Modelling Language :Introduction; Static and Dynamic models; Why Modeling?
Introduction to the UML; UML Diagrams; UML Class Diagram; Use-Case Diagram.
Introduction to Java: Java’s Magic: The Bytecode; JVM; Object-Oriented Programming;
Simple Java programs; Two Control Statements; Lexical Issues; Data Types; Variables,
Arrays and String constructors; Operators; Control Statements; Introducing Classes:
Class Fundamentals; objects; methods; constructors; this Keyword; Garbage Collection;
finalize() method; Parameter Passing; Overloading; Access Control Keywords. Inheritance
basics; method overriding; abstract classes; Packages and interfaces. Exception handling
fundamentals; multiple catch; nested try statements.

MODULE 3 09 Hrs
Multi-Threaded Programming :Multi-Threaded Programming: Java Thread Model; The
main Thread; Creating a thread and multiple threads; Extending threads; Implementing
Runnable; Synchronization; Inter Thread Communication; producer consumer problem.
Input/Output: I/O Basic; Reading console input Writing Console output.

MODULE 4 08 Hrs
Event and GUI Programming:Introducing Swing; The Origins of Swing; Swing Is Built
on the AWT; Two Key Swing Features; The MVC Connection; Components and
Containers; The Swing Packages; A Simple Swing Application; Event Handling; JLabel;
JTextField; JButton

MODULE 5 08 Hrs
Database Access:
The Concept of JDBC; JDBC Driver Types; JDBC Packages; A Brief Overview of the JDBC
process; Database Connection; Associating the JDBC/ODBC Bridge with the Database;
Statement Objects; ResultSet.
TEXT BOOK:
1. Bahrami A.; Object Oriented Systems Development using the Unified Modeling Language; McGraw
Hill; 1999.
2. Schildt; Herbert. Java The Complete Reference; 8th Edition. US: McGraw-Hill Osborne Media; 2011.
3. Jim Keogh; J2EE: The Complete Reference; McGraw Hill Education in 2002.

REFERENCES:

1. Barclay K., J. Savage, Object Oriented Design with UML and Java, Elsevier, 2004.

2.Y. Daniel Liang, Introduction to Java Programming, 7th edition, Pearson, 2013.
 SEMESTER V
YEAR III
COURSE CODE 19CS3504
TITLE OF THE COURSE DATABASE MANAGEMENT SYSTEMS + Lab
SCHEME OF INSTRUCTION Lecture Tutorial Practical Seminar/Projects Total Credits
Hours Hours Hours Hours Hours
3 - 2 - 42 4

Perquisite Courses (if any)

# Sem/Year Course Code Title of the Course
*** *** *** ***

COURSE OBJECTIVES:
 To learn data models, conceptualize and depict a database system using ER diagram
 To understand the internal storage structures in a physical DB design
 To know the fundamental concepts of transaction processing techniques

COURSE OUTCOMES:
Outcomes Bloom’s
CO No.
Taxonomy
Level
CO1 Demonstrate the basic elements of a relational database management L2
system
CO2 Identify the data models for relevant problems L2
CO3 Apply normalization for the development of application software’s L3
CO4 Use Structured Query Language (SQL) for database manipulation. L3
CO5 Understand transactions and their properties (ACID) L2
CO6 Design and develop a large database with optimal query processing L6

COURSE CONTENT:

MODULE 1 8Hrs
Introduction: Purpose of Database System-–Views of data–data models, database
management system, three-schema architecture of DBMS, components of DBMS. E/R Model
- Conceptual data modeling - motivation, entities, entity types, attributes, relationships,
relationship types, E/R diagram notation, examples.

MODULE 2 9 Hrs
Relational Model: Relational Data Model - Concept of relations, schema-instance distinction,
keys, referential integrity and foreign keys, relational algebra operators, SQL -Introduction,
data definition in SQL, table, key and foreign key definitions, update behaviors. Querying in
SQL, notion of aggregation, aggregation functions group by and having clauses.

MODULE 3 10 Hrs
Database Design: Dependencies and Normal forms, dependency theory – functional
dependencies, Armstrong's axioms for FD's, closure of a set of FD's, minimal covers,
definitions of 1NF, 2NF, 3NF and BCNF, decompositions and desirable properties of them,
algorithms for 3NF and BCNF normalization, 4NF, and 5NF

MODULE 4 9 Hrs
Transactions: Transaction processing and Error recovery - concepts of transaction processing,
ACID properties, concurrency control, locking based protocols for CC, error recovery and
logging, undo, redo, undo-redo logging and recovery methods.

MODULE 5 9 Hrs
Embedded SQL: triggers, procedures and database connectivity. Introduction to NoSQL

TEXT BOOK:
1. Silberschatz, Henry F. Korth, and S. Sudharshan, “Database System Concepts”,
5thEd, Tata McGraw Hill, 2006.
2. J. Date, A. Kannan and S. Swamynathan, “An Introduction to Database Systems”,
8thed, Pearson Education, 2006.

REFERENCES:
1. Ramez Elmasri and Shamkant B. Navathe, “Fundamentals of Database Systems”,
Fourth Edition, Pearson/Addision Wesley, 2007
2. Raghu Ramakrishnan, “Database Management Systems”, Third Edition, McGraw Hill, 2003
3. S. K. Singh, “Database Systems Concepts, Design and Applications”, First Edition,
Pearson Education, 2006
SEMESTER V
YEAR III
COURSE CODE 19CT3501
TITLE OF THE COURSE IDEA GENERATION & VALIDATION
Lecture Tutorial Practical Seminar/Projects Total Credits
SCHEME OF Instruction Hours Hours Hours Hours Hours
-- -- -- 04 39 02

COURSE OBJECTIVES:
 Generate, develop, and pitch innovative new venture ideas
 Evaluate the attractiveness and feasibility of new venture opportunities
 Analyze industries, markets, and competitors

COURSE OUTCOMES:
Bloom’s
CO
Outcomes Taxonomy
No.
Level
CO1 Generate, develop, and pitch innovative new venture ideas L3
CO2 Analyze industries, markets, and competitors L3

CO3 Evaluate the attractiveness and feasibility of new venture L3

opportunities

COURSE CONTENT:
Process of Idea Generation; Problem Identification, Idea formation, Idea Generation
Techniques: Brainstorming, Mind Mapping, Story Boarding, Attribute Listing, Idea
Validation and Risk Assessment

List of Laboratory/Practical Experiments activities to be conducted (if any) :

Get out of the Building Exercise – Meet at least 20 persons in your targeted segment and
understand their pain points and propose ideas that may solve their problems.
Discuss with mentors and zero in on one idea.
Make a hand drawn functional sketch of the proposed solution
Idea Validation with potential customers - Meet at least 20 customers and validate the
proposed idea with them.
Prepare a comprehensive report, highlighting the learnings and the implications on the
proposed solution and pivots (if any).

TEXT BOOKS :
1. Kotter, J.P. and Whitehead, L.A. (2010). Buy-In: Saving Your Good Idea from Getting
Shot Down.
2. Belsky, S. (2010). Making Ideas Happen: Overcoming the Obstacles between Vision
and Reality.
SEMESTER V
YEAR III
COURSE CODE 19CT3502
TITLE OF THE COURSE PRODUCT ENGINEERING & ENTREPRENEURSHIP
Lecture Tutorial Practical Seminar/Projects Total Credits
SCHEME OF Instruction Hours Hours Hours Hours Hours
-- -- -- 04 39 02

COURSE OBJECTIVES:
 Experience with a set of tools and methods for product engineering
 Knowledge of the role of multiple functions in creating a new product
 Ability to coordinate multiple, interdisciplinary tasks to achieve a common objective
 Emphasis of specific knowledge from other courses through practice and reflection in
an action-oriented setting

COURSE OUTCOMES:
Bloom’s
CO
Outcomes Taxonomy
No.
Level
CO1 Identify customer needs and pain points L1

CO2 Generate concept & validate idea L3

CO3 Use design thinking to architect a product L3

CO4 Create a new product/prototype L3

CO5 Pitch the product to Incubation Centres @ DSU L2

COURSE CONTENT:

MODULE 1 06 Hrs
Introduction, Product Development Process and Organization, Opportunity Identification,
Product Planning, Identifying Customer Needs

MODULE 2 06 Hrs
Product Specifications, Concept Generation, Lean Thinking, Concept Selection, Concept
Testing, Value on Product Development, Waste in Product Development

MODULE 3 06 Hrs
Product Architecture, Industrial Design, Design for Environment, Design for Manufacturing and
Supply Chain
MODULE 4 04 Hrs
Prototyping, Robust Design, Patents and Intellectual Property, Service Design, Product
Development Economies, Product Management
MODULE 5 04 Hrs
 Business Plan, Business Model Canvas

PROJECT DELIVERABLES
1. Proposal Handout & Presentation
a. The Problem
b. Need
c. Existing Alternatives
d. Potential Market
2. Wireframe Sketches, Target Specifications
a. List Critical Customer Needs
b. For a., Prepare a List of Target Specifications
c. Prepare Wireframe
3. Create App/Website
4. Business Model
5. Register your business
6.
TEXT BOOKS
1. Ulrich Karl T, Eppinger Steve D., and Yang, Maria C., Product Design and Development, 7th Edition,
McGraw-Hill Education 2020
2. Robin McKenzie, Design Theory: An Introduction for Product Design and Engineering, 1st Edition, July
2014
REFERENCE BOOKS
1. Pessoa, Marcus, Trabasso, Luis Gonzaga, The Lean Product Design and Development Journey – A Practical
View, Springer International Publishing, 2017
2. Ali Jamnia, Introduction to Product Design and Development for Engineers, 1st Edition, CRC Press, June
2018
3. Product Design and Development, MIT Open Courseware - https://ocw.mit.edu/courses/sloanschool-of-
management/15-783j-product-design-and-development-spring-2006/index.htm
SEMESTER V
YEAR III
COURSE CODE 19CT3511
TITLE OF THE COURSE DATA DRIVEN DECISION MAKING
Lecture Tutorial Practical Seminar/Projects Total Credits
SCHEME OF Instruction Hours Hours Hours Hours Hours
-- -- 02 02 39 02

Perquisite Courses (if any)

# Sem/Year Course Code Title of the Course
1 III/II 19CS2302 COMPUTATIONAL THINKING WITH PYTHON

COURSE OBJECTIVES :
 To perform data cleaning & pre-processing on real-time datasets
 To work on live projects on modelling data
 To visualize data

COURSE OUTCOMES :
Bloom’s
CO
Outcomes Taxonomy
No.
Level
CO1 Write programs to clean and pre-process data L3
CO2 Write programs to process and model data L3

CO3 Derive insights from data through data visualization and L3

storyboarding

COURSE CONTENT:

MODULE 1 7 Hrs
Overview, Data Science Lifecycle and Process, Types of Analytics, Making Business-
Defined Decisions using Data Analytics, Steps to Clean and Pre-process Data, Data
Processing Techniques, Data Modelling, Ensemble Models

MODULE 2 7 Hrs
Cleaning and Data Pre-processing
Scrapy – Linear Algebra, Integration, Calculus, Ordinary Differential Equations, Signal
Processing
NumPy – Basic Array Operations (Multiply Slice, Flatten, Reshape, Index Arrays),
Advanced Array Operations (Stack, Split, Broadcast), Linear Algebra Pandas – Indexing,
Manipulating, Renaming, Sorting, Merging Data Frame, Impute Missing Files, Handle
Missing Data

MODULE 3 8 Hrs
Data Processing - Statsmodels – Linear Regression, Correlation, Ordinary Least Squares,
Survival Analysis, Generalized Linear Models, Bayesian Models, Univariate and Bi-variate
Analysis, Hypothesis Testing
MODULE 4 8 Hrs
Modelling
Scikit-Learn – Classification (Spam Detection, Image Recognition), Clustering (Drug
Response, Stock Price),
Regression (Customer Segmentation, Grouping Experiment Outcomes), Decision Tree, K-
NN and Naïve Bayes

MODULE 5 9 Hrs
Data Visualization
Matplotlib – Line Plots, Scatter Plots, Area Plots, Bar Charts & Histograms, Pie Charts,
Stem Plots, Contour plots, Quiver Plots, Spectrograms
Seaborn – Correlation, Aggregate Statistics, Uni-Variate & Bi-Variate Distributions,
Linear Regression Models,
Multi-Plot Grids

List of Laboratory/Practical Experiments activities to be conducted (if any) :

Considering any data set apply the functionalities of pandas like merging sorting, indexing,
and manipulating.
Consider any data set and apply data pre-processing methods like identifying missing data
and filling missing data.
Write a program for Sales prediction using linear regression analysis. Dataset.
Write a program to demonstrate the working of the decision tree based ID3 algorithm. Use
an appropriate data set for building the decision tree and apply this knowledge to classify a
new sample.
Write a program to implement the naïve Bayesian classifier for a sample training data set
stored as a .CSV file. Compute the accuracy of the classifier, considering few test data sets.
Assuming a set of documents that need to be classified, use the naïve Bayesian Classifier
model to perform this task. Calculate the accuracy, precision, and recall for your data set.
Write a program to implement k-means clustering algorithm to predict iris flower species.

TEXT BOOKS :
1. Cathy O’Neil and Rachel Schutt, Doing Data Science, O’Reilly Publications, 2014.
2. Han, Kambar and Pei, Data Mining Concepts and Techniques, MK Publications, 3rd
Edition.

REFERENCES :
1 Data Pre-Processing https://scikit-learn.org/stable/modules/preprocessing.html
2 Python Data Science Handbook:
https://tanthiamhuat.files.wordpress.com/2018/04/pythondatasciencehandbook.pdf
SEMESTER V
YEAR III
COURSE CODE 19CT3512
TITLE OF THE COURSE CREATIVE CODING
Lecture Tutorial Practical Seminar/Projects Total Credits
SCHEME OF Instruction Hours Hours Hours Hours Hours
-- -- 02 02 39 02

COURSE OBJECTIVES:
 The fundamentals of computational thinking applied through p5.js
 Best practices for designing software within an event-driven, object-oriented, real-time
framework
 How to ideate, conceptualize, and design original creative works in the medium of
software

COURSE OUTCOMES:
Bloom’s
CO
Outcomes Taxonomy
No.
Level
CO1 Examine fundamentals of computational thinking L2
CO2 Write scripts using p5.js L3

CO3 Ideate, conceptualize, and design original creative works L3

COURSE CONTENT:

MODULE 1 7 Hrs
Computational Thinking: Overview, Stages, Cornerstones, Pillars, Expressing and
Analyzing Algorithms, Concepts of Computational Thinking, Techniques Associated with
Computational Thinking, Computational Thinking in a Classroom

MODULE 2 7 Hrs
p5.js: Overview, Creative Graphics & Interactive Experiences, p5.js Web Editor, p5.js and
Processing, Using a Local Server, First Sketch, Color, Constants, DOM, Data,
Environment, Events, Foundation, I/O, Image, Lights, Camera, Math, Rendering, Shape

MODULE 3 8 Hrs
p5.js-contd: node.js and socket.io, 3D/WebGL, Coordinate System and Shapes, Structure,
Transform, Typography, Anatomy of Functions, Built-in p5.js Functions, Touch, Unit
Testing and Test-Driven Development
MODULE 4 8 Hrs
p5.js – Advanced Data, Sound, Mobile – Acceleration Ball Bounce, Simple Draw,
Acceleration Color, Shake Ball Bounce, Titled 3D Box, p5.js libraries, Linking p5.js to
HTML file
MODULE 5 9 Hrs
p5.ble.js – Overview, Introduction to Arduino and Bluetooth, Usage, p5.ble.js using
Arduino, Bluetooth Le and p5.ble
p5.bots – Overview, APIs, Servers, Functions
p5.clickable – Overview, Creating, Moving & Resizing a Clickable, Clickable Events

List of Laboratory/Practical Experiments activities to be conducted (if any) :

Download and install sketch.js and setup a sketch to handle mouse/touch input.
Setup a sketch to spawn particles with your mouse.
Use three.js to setup a screen with a spinning cube.
Create a web-based VR application made with three.js
How do you update an object’s transformation using three.js?
Design an animation system using three.js

TEXT BOOKS:
1. Lauren McCarthy, Casey Reas, Ben Fry, Getting Started with p5.js: Making
Interactive Graphics in JavaScript and Processing, Maker Media Inc.
2. Karl Beecher, Computational Thinking: A Beginner's Guide to Problem Solving and
Programming, The Chartered Institute for IT

REFERENCES:
1 Creative Coding and Data Visualization with p5.js”, Scott Muray, O′Reilly (13 January
2017)
2 “Processing: Creative Coding and Computational Art”, Ira Greenberg Apress; 2nd
Printing Edition (June 1, 2007)
SEMESTER V
YEAR III
COURSE CODE 19CT3513
TITLE OF THE COURSE CRYPTOGRAPHY & CYBER SECURITY
Lecture Tutorial Practical Seminar/Projects Total Credits
SCHEME OF Instruction Hours Hours Hours Hours Hours
-- -- 02 02 39 02

COURSE OBJECTIVES:
 Protect data with encryption and hashing
 Make hashes, crack them, and understand why they are so different
 Understand common errors in encryption, various encryption methods and how to
exploit them
 Learn how to use three NIST-recommended systems: AES, SHA, and RSA
 Explore the threat landscape and practical skillset in defeating basic online threats

COURSE OUTCOMES:
Bloom’s
CO
Outcomes Taxonomy
No.
Level
CO1 Protect data with encryption and hashing L2
CO2 Make hashes, crack them, and understand why they are so L3
different
CO3 Compare various encryption methods L3

CO4 Use three NIST-recommended systems: AES, SHA, and L3

RSA in their project work
CO5 Defeat basic online threats and explore threat landscape L3

COURSE CONTENT:

MODULE 1 7 Hrs
Introduction, Caesar Cipher, Other Shift Values and Modular Arithmetic, ROT13, Base64
& ASCII , Encoding, Binary Data and Encoding, XOR Truth Tables, XOR for Bytes,
Single-Byte and Multi-Byte XOR along with Looping

MODULE 2 7 Hrs
Strong Encryption – AES and Private-Key Encryption, Key and Block Size, Confusion and
Diffusion, ECB and CBC Modes, AES-CBC, Padding Oracle Attack, Public Key
Encryption

MODULE 3 8 Hrs
RSA Algorithm, Security, Vulnerabilities, Threats and Adversaries, Security Attributes,
Threat Modelling and Risk Assessments, Zero Trust Model, Malware, Viruses, Rootkits,
RATs
MODULE 4 8 Hrs
Hashing – MD5 and SHA-1/2/3 Hashes, MD4 and Unicode, Getting Hashes with Cain,
Cracking Hashes with Google and with Wordlists, Salting and Stretching Hashes, Hashing
Algorithms

MODULE 5 9 Hrs
Malwares – Spyware, Adware, Scareware, PUPs and Browser Hijacking, Darknets and
Dark Markets, Social Engineering – Scams, Cons, Tricks and Fraud

List of Laboratory/Practical Experiments activities to be conducted (if any) :

Symmetric encryption – Usage of AES
pip install pyaes
pip install pbkdf2
import pyaes, pbkdf2, binascii, os, secrets
https://cryptobook.nakov.com/symmetric-key-ciphers/aes-encrypt-decrypt-examples

Asymmetric encryption- Usage of RSA

pip install pycryptodome
from Crypto.PublicKey import RSA
from Crypto.Cipher import PKCS1_OAEP
import binascii
https://cryptobook.nakov.com/asymmetric-key-ciphers/rsa-encrypt-decrypt-examples

Hashing Techniques
import hashlib, binascii
https://cryptobook.nakov.com/cryptographic-hash-functions/hash-functions-examples

TEXT BOOKS:
1. Samuel Bowne, Hands-On Cryptography with Python: Leverage the Power of Python
to Encrypt and Decrypt Data, June 29, 2018
2. Nielson, Seth James, and Christopher K. Monson, Practical Cryptography in Python:
Learning Correct Cryptography by Example, Apress, 2019

REFERENCES:
1 Modern Cryptography Theory and Practice, Wenbo Mao, Pearson Education 2008
2 Network Security: The complete reference, Robert Bragg, Mark Rhodes, TMH
SEMESTER V
YEAR III
COURSE CODE 19CT3514
TITLE OF THE COURSE APPLICATIONS OF IoT TECHNOLOGY STACK
Lecture Tutorial Practical Seminar/Projects Total Credits
SCHEME OF Instruction Hours Hours Hours Hours Hours
-- -- 02 02 39 02

Perquisite Courses (if any)

# Sem/Year Course Code Title of the Course
1 III/II 19CS2305 ANALOG ELECTRONICS

COURSE OBJECTIVES:
 Identify the sensors and other devices needed for different IoT solutions
 Understand and map out an IoT system incorporating specific devices

COURSE OUTCOMES:
Bloom’s
CO
Outcomes Taxonomy
No.
Level
CO1 Identify the sensors and other devices needed for different L2
IoT solutions
CO2 Design Basic IoT Systems L3

CO3 Map out an IoT System incorporating Specific Devices L3

COURSE CONTENT:

MODULE 1 7 Hrs
Introduction to Internet of Things, IOT Architecture, Definition & Characteristics of IoT,
Physical Design of IoT, IoT Levels & Deployment Templates. Application of IOT in
different domains – Agriculture, Medical, Smart Cities, Home Automation, Logistics,
Weather Forecasting.

MODULE 2 7 Hrs
Electrical Circuits and Electronics – Basic IoT System, Electricity, Basic Electronics,
Analogue and Digital Electronics, Electronics Kits, Sensors and Actuators, Micro-
controllers and Micro-Processors, Programming Concepts, Selecting a Micro Platform,
Sensor Communication

MODULE 3 8 Hrs
Application layer Protocols – COAP, AMQP, MQTT, DDS, HTTP, REST, Transport layer
Protocols – TCP, UDP, Network Layer – 6LowPAN, IPv6, ZigBee, Lora, Datalink Layer –
802.15 set of standards, Physical Layer – Wi-Fi, Bluetooth Low Energy, Ethernet, NFC,
RFID, LTE, 5G, Introduction to M2M, NFV, SDN
MODULE 4 8 Hrs
Device Programming using Embedded C & MicroPython, An Introduction to Data
Analytics for IoT , IoT Data Analytics Overview, IoT Data Analytics Challenges , Big
Data Architectures for IoT Analytics, System Communication, Cloud, Fog and Edge
Processing, Processes and Systems, PID, Design a System, IoT Design Implications

MODULE 5 9 Hrs
Need for IoT Systems Management, Simple Network Management Protocol (SNMP),
Limitations of SNMP, Network Operator Requirements, Introduction to NETCONF,
YANG, IoT Systems Management with NETCONF-YANG, NETOPEER. Introduction to
DevOps and tools – Jenkin, Mavin, Selenium (System Test Automation), Unit Test (Junit),
GIT, Puppet and Chef, Docker, Storm, Kafka

List of Laboratory/Practical Experiments activities to be conducted (if any) :

Design an IoT system to control a microcontroller using Octoblu and Tentacle library.
Design an Arduino-controlled smart hydroponic modular system

TEXT BOOKS:
1. Qusay F. Hassan, Internet of Things A to Z – Technologies and Applications, IEEE
Press, Wiley, 2018
2. Ovidiu Vermesa, Peter Friess, Internet of Things – From Research and Innovation to
Market Deployment, River Publishers, 2014

REFERENCES:
1 Ian G Smith, The Internet of Things 2012 New Horizons, IERC - Internet of Things
European Research Cluster, 2012.
2 M. Wang, G. Zhang, C. Zhang, J. Zhang, C. Li, An IoT-based Appliance Control
System for Smart Homes, ICICIP 2013.
 SEMESTER VI
YEAR III
COURSE CODE 19CS3601
TITLE OF THE COURSE Compiler Design and System Software
SCHEME OF INSTRUCTION Lecture Tutorial Practical Seminar/Projects Total Credits
Hours Hours Hours Hours Hours
3 1 2 - 52 5

Perquisite Courses (if any)

# Sem/Year Course Code Title of the Course
* *** * ***

COURSE OBJECTIVES:
 To discuss the techniques of scanning, parsing & semantic elaboration well enough to build or modify
front end.
 To expose the critical issues in modern compilers & provide them with the background to tackle those
problems.

COURSE OUTCOMES:
Outcomes Bloom’s
CO No.
Taxonomy
Level
CO1 Understand the major phases of compilation and to understand L2
the knowledge of Lex tool & YAAC tool
CO2 Develop the parsers and experiment the knowledge of L3
different parsers design without automated tools
CO3 Construct the intermediate code representations and L3
generation
CO4 Convert source code for a novel language into machine code for L3
a novel computer
CO5 Apply for various optimization techniques for dataflow analysis L3

COURSE CONTENT:

MODULE 1 10Hrs
Introduction to System Software, Machine Architecture of SIC and SIC/XE.
ASSEMBLERS: Basic assembler functions: A simple assembler, Assembler algorithm and
data structures, Machine dependent assembler features: Instruction formats and addressing
modes – Program relocation, Machine independent assembler features: Literals, Symbol-
defining statements, Expressions, Program blocks, Control Sections and Program Linking.

MODULE 2 9 Hrs
LOADERS AND LINKERS Basic loader functions: Design of an Absolute Loader, A
Simple Bootstrap Loader, Machine dependent loader features :Relocation, Program Linking
,Algorithm and Data Structures for Linking Loader, Machine-independent loader features:
Automatic Library Search, Loader Options, Loader design options :Linkage Editors, Dynamic
Linking

MODULE 3 11 Hrs
COMPILERS: Introduction: Language Processors, Structure of compiler, The science of
building a compiler, Applications of compiler technology.
LEXICAL AND SYNTAX ANALYSIS: Role of lexical Analyser, Specification of Tokens,
Lexical Analyzer generator Lex.
SYNTAX ANALYSIS I: Role of Parser, Syntax error handling, Error recovery strategies,
Writing a grammar: Lexical vs Syntactic Analysis, Eliminating ambiguity, Left recursion,
Left factoring.

MODULE 4: 12 hrs
SYNTAX ANALYSIS II-:Top down parsing: Recursive Descent Parsing, First and follow,
LL (1), –Bottom up parsing:Shift Reduce Parsing ,Introduction to LR parsing Simple LR:
Why LR Parsers, Items and LR0 Automaton, The LR Parsing Algorithm, Constructing SLR
Parsing Tables.
SYNTAX-DIRECTED TRANSLATION: Syntax-Directed Definitions: Inherited and
Synthesized Attributes, Evaluation orders for SDDs: Dependency graphs, Ordering the
evaluation of Attributes, S-Attributed Definition, L-Attributed Definition, Application:
Construction of Syntax Trees.

MODULE 5 10 Hrs
INTERMEDIATE CODE GENERATION: Three Address Code: Addresses and
Instructions, Quadruples, Triples, Static Single Assignment form.
CODE GENERATION: Issues in the design of code generator, Basic Blocks, Optimization
of Basic Blocks, The Code Generation Algorithm, Peephole optimization.
MACHINE INDEPENDENT OPTIMIZATION: The Principal Sources of Optimization

TEXT BOOK:

1. Leland L. Beck, “System Software – An Introduction to Systems Programming”, 3rd Edition,

Pearson Education Asia, 2006.
2. Alfred V Aho, Monica S. Lam, Ravi Sethi and Jeffrey D Ullman, “Compilers – Principles,
Techniques and Tools”, 2nd Edition, Pearson Education, 2007.

REFERENCES:
1. V. Raghavan, Principles of Compiler Design‖, Tata McGraw Hill Education Publishers, 2010.
2. Keith D Cooper and Linda Torczon, Engineering a Compiler‖, Morgan Kaufmann Publishers
Elsevier Science, 2004.
3. D.M.Dhamdhere, Systems Programming and operating systems, Second Revised edition,
Tata McGraw Hill.
 SEMESTER VI
YEAR III
COURSE CODE 19CS3602
TITLE OF THE COURSE COMPUTER NETWORKS
SCHEME OF INSTRUCTION Lecture Tutorial Practical Seminar/Projects Total Credits
Hours Hours Hours Hours Hours
3 - 2 - 42 4

Perquisite Courses (if any)

# Sem/Year Course Code Title of the Course
*** *** *** ***

COURSE OBJECTIVES:
 To introduce the fundamental aspects of various types of computer networks.
 To demonstrate the TCP/IP and OSI models with merits and demerits.

COURSE OUTCOMES:
Outcomes Bloom’s
CO No.
Taxonomy
Level
CO1 Understand and explore the basics of Computer Networks and L2
Various Protocols.
CO2 Administrate a network and flow of information L2
CO3 Understand the concepts of network security, mobile, and ad hoc L2
network

COURSE CONTENT:
MODULE 1 9Hrs
Overview of the Internet: Protocol, Layering Scenario, TCP/IP Protocol Suite: The OSI
Model, Internet history standards and administration; Comparison of the OSI and TCP/IP
reference model.
Physical Layer: Introduction to Guided transmission media and wireless transmission media.
Transmission mode, Classification of networks. Parallel & Serial Transmissions, Analog &
Digital Signals, Periodic & Aperiodic Signals, Encoding Schemes. RS-233C Protocol.
Data Link Layer - Design issues, CRC codes, Elementary Data Link Layer Protocols, stop
and wait, sliding window, go-back-N protocols.

MODULE 2 9 Hrs
Multi Access Protocols - ALOHA, CSMA, Collision free protocols, Ethernet- Physical
Layer, Ethernet Mac Sub layer, data link layer switching & use of bridges, learning bridges,
spanning tree bridges, repeaters, hubs, bridges, switches, routers and gateways. LLC, WiFi,
Bluetooth Protocols.
MODULE 3 8 Hrs
Network Layer: Network Layer Design issues, store and forward packet switching
connection less and connection oriented networks-routing algorithms-optimality principle,
shortest path, flooding, Distance Vector Routing, Control to Infinity Problem, Hierarchical
Routing, Congestion control algorithms, admission control, Classful IP addresses(A,B,C,D)
,QoS, Details of IP Packet

MODULE 4 9 Hrs
The Internet Transport Protocols: Introduction to TCP and UDP, The TCP Service Model,
The TCP Segment Header, The Connection Establishment, The TCP Connection Release,
The TCP Connection Management Modeling, The TCP Sliding Window, The TCP
Congestion Control, The future of TCP.

MODULE 5 7 Hrs
Application Layer- Introduction, providing services, Applications layer paradigms, Client
server model, Standard client-server application-HTTP, FTP, electronic mail, TELNET,
DNS, SSH, SNMP. Socket Programming using TCP and UDP.
Introduction to Internet of Things, Introduction to Sensors, Actuator, Transducers,
Gateway, IOT Architecture, Introduction to Node MCU and Arduino. Overview of Edge, Fog
and Cloud computing and application of IOT in Home Automation

TEXT BOOK:

1. Behrouz A. Forouzan, Data Communications and Networking -, Fifth Edition TMH, 2013.
2. Computer Networks - Andrew S Tanenbaum, 4th Edition, Pearson Education.

REFERENCES:

1. Computer Networking- A top down approach- James F Kurose and Keith W Ross,6th Edition,
Pearson Education.
2. W. Tomasi, “Advanced Electronic Communication Systems”, 2000
3. James Martin, “Telecommunications & the Computer”, 3rd Edition, PHI. 2001
4. P. C. Gupta, “Data Communications, PHI, 2001.
SEMESTER VI
YEAR III
COURSE CODE 19CS3603
TITLE OF THE COURSE Software Engineering and Project Management
Lecture Tutorial Practical Seminar/Projects Total Credits
SCHEME OF Instruction Hours Hours Hours Hours Hours
3 - 2 - 42 4

Perquisite Courses (if any)

# Sem/Year Course Code Title of the Course
*** *** *** ***

COURSE OBJECTIVES :
 This course is introduced to give the students necessary knowledge.
 Understanding and Design aspects in Software Engineering
 To understand the Software Project Planning and Evaluation techniques

COURSE OUTCOMES :
Bloom’s
CO
Outcomes Taxonomy
No.
Level
CO1 Understand software development life cycle models, L2
process models, and various design engineering
techniques.
CO2 Understand the importance of testing and use different L3
types of testing techniques.
CO3 Understand Project Management principles while L2
developing software.

COURSE CONTENT:

MODULE 1 9Hrs
Introduction to Software Engineering: FAQs about software engineering, Professional
and ethical responsibility. Socio-Technical systems: Emergent system properties,
Organizations, people and computer systems; Legacy systems, the evolving role of
software, Changing Nature of Software, Software myths.
A Generic view of process: Software engineering- A layered technology, a process
framework, The Capability Maturity Model Integration (CMMI), Process patterns, process
assessment, personal and team process models. Software Cost Estimation: Productivity;
Estimation techniques

MODULE 2 7Hrs
Process models: A simple safety- critical system; System dependability; Availability and
reliability, the waterfall model, Incremental process models, Evolutionary process models,
The Unified process. Comparison of different models with case studies, Agile
Development: Agile Tech, Extreme Programming, and other Agile Process Models: Scrum
Methodology
MODULE 3 9Hrs
Software Requirements: Functional and non-functional requirements, User requirements,
System requirements, Interface specification, the software requirements document.
Requirements engineering process: Feasibility studies, Requirements elicitation and
analysis, Requirements validation, Requirements management. System models: Context
Models, Behavioural models, Data models, Object models, structured methods.
MODULE 4 9Hrs
Testing Strategies: Verification and Validation: Planning; Software inspections;
Automated static analysis; Verification and formal methods. A strategic approach to
software testing, System testing, the art of Debugging; Component testing; Test case design;
Test automation - Selenium, Test strategies for conventional software: Black-Box and
White-Box testing, Validation tests, System testing.
MODULE 5 8Hrs
Software Project Management
Introduction to Software Project Management – all life cycle activities – Methodologies –
Categorization of Software Projects – Setting objectives – Management Principles –
Management Control – Project portfolio Management – Cost-benefit evaluation technology
– Risk evaluation – Strategic program Management – Stepwise Project Planning.

TEXT BOOKS :

1. Software Engineering, by Ian Sommerville Eighth edition, International Computer

Science Series.
2. Software Engineering, A practitioner’s Approach- Roger S. Pressman, 6th edition.
McGraw Hill International Edition.

REFERENCES :

1. Bob Hughes, Mike Cotterell and Rajib Mall: Software Project Management – Fifth Edition, Tata
McGraw Hill, New Delhi, 2012.
2. SoftwareEngineering-K.K.Agarwal&YogeshSingh,NewAgeInternationalPublishers
3. Software Engineering, an Engineering approach-JamesF. Peters, WitoldPedrycz, John Wiley.
4. Systems Analysis and Design –Shelly Cashman Rosenblatt, Thomson Publications.
5. Software Engineering principles and practice-Waman Jawadekar,The McGraw-Hill Companies
SEMESTER VI
YEAR III
COURSE CODE 19CT3601
TITLE OF THE COURSE LEAN START-UP METHODOLOGY
Lecture Tutorial Practical Seminar/Projects Total Credits
SCHEME OF Instruction Hours Hours Hours Hours Hours
- -- 03 03 52 03

COURSE OBJECTIVES:
 Use the Business Model Canvas innovation tool to approach either a personal or
corporate challenge or opportunity.
 Identify and communicate the nine key elements of a business model.
 Explain how to develop a strategic business plan

COURSE OUTCOMES:
Bloom’s
CO
Outcomes Taxonomy
No.
Level
CO1 Communicate nine key elements of a Business Model L1

CO2 Use Business Model Canvas Tool L3

CO3 Develop Strategic Business Plan L3

COURSE CONTENT:
Exposure to Business Model Techniques like, Channels, Customer Segments, Relationships,
Key Resources, Key Activities, Cost structures, Pain, and Gain Relief of Core Customers.

List of Laboratory/Practical Experiments activities to be conducted (if any) :

Build the various elements of the lean model canvas to your business proposition with inputs
and data from field survey
Develop key hypothesis for your proposed solution
Work with founders to finalize the business model

TEXTBOOKS
1. Timmons, Jeffry A. and Spinelli, Stephen Jr. (2009). New Venture Creation: Entrepreneurship for the 21st
Century, 8th edition. McGraw-Hill Irwin, Boston. Chapter 3
2. Lindsay, Noel (2010). Business Plan Template
SEMESTER VI
YEAR III
COURSE CODE 19CT3602
TITLE OF THE COURSE SMALL BUSINESS LAUNCH
Lecture Tutorial Practical Seminar/Projects Total Credits
SCHEME OF Instruction Hours Hours Hours Hours Hours
- -- 03 03 52 03

COURSE OBJECTIVES:
 Experience with a set of tools and methods for setting up an online service
 Knowledge of the role of multiple functions in creating a small business
 Ability to coordinate multiple, interdisciplinary tasks to achieve a common objective
 Emphasis of specific knowledge from other courses through practice and reflection in
an action-oriented setting

COURSE OUTCOMES:
Bloom’s
CO
Outcomes Taxonomy
No.
Level
CO1 Identify customer needs and pain points L1

CO2 Generate concept & validate idea L3

Use design thinking to create a wireframe of your online
CO3 L3
service
CO4 Launch your App/Website L3

CO5 Register your small business L2

COURSE CONTENT:

MODULE 1 10 Hrs
Introduction, Identifying Customer Needs, Opportunity Identification & Planning, Idea
Generation and Validation, Entrepreneurial Culture, Digital Business Opportunity

MODULE 2 10 Hrs
Business Plan & its Components, Business Model and Strategies, Selection of Appropriate
Business Model, Business Model Canvas, Feasibility Study

MODULE 3 10 Hrs
Lean Thinking, Specifications, Wireframe Generation & Validation
MODULE 4 11 Hrs
Bootstrap Themes and Templates, Basics of HTML, CSS & JavaScript, Meteor, Apache
Cordova, UI Frameworks – Blaze, Angular, React, Google Firebase, Firebase Realtime
 Database
MODULE 5 11 Hrs

Service-Market Fit, legal Aspects & Entrepreneurial Law, New Venture Creation & Launch,
Sustainability Goals

PROJECT DELIVERABLES
7. Proposal Handout & Presentation
a. The Problem
b. Need
c. Existing Alternatives
d. Potential Market
8. Wireframe Sketches, Target Specifications
a. List Critical Customer Needs
b. For a., Prepare a List of Target Specifications
c. Prepare Wireframe
9. Create App/Website
10. Business Model
11. Register your business

TEXTBOOKS
1. Fisher, Steven, Duane, Ja-Nae (2016). Start-up Equation – A Visual Guidebook for Building your Start-
up, New Delhi: Tata McGraw-Hill
2. Houssem Yahiaoui, Firebase Cookbook: Over 70 Recipes to help you create real-time web and mobile
applications with Firebase, Packt Publishing, November 2017.

REFERENCE BOOKS
1. Holt H., David (2017). Entrepreneurship: New Venture Creation, New Delhi: Pearson Education
Zimmerer, W. Thomas and Scarborough, M. Norman and Doug Wilson (2009). Essentials of Entrepreneurship
and Small Business Management, 5/e; New Delhi: Prentice Hall India
SEMESTER VI
YEAR III
COURSE CODE 19CT3611
TITLE OF THE COURSE APPLICATIONS OF MACHINE LEARNING
Lecture Tutorial Practical Seminar/Projects Total Credits
SCHEME OF Instruction Hours Hours Hours Hours Hours
-- -- 02 02 52 04

Perquisite Courses (if any)

# Sem/Year Course Code Title of the Course
* *** * ***

COURSE OBJECTIVES:
 The difference between the two main types of machine learning methods: supervised
and unsupervised
 Supervised learning algorithms, including classification and regression
 Unsupervised learning algorithms, including Clustering and Dimensionality Reduction
 How statistical modelling relates to machine learning and how to compare them
 Real-life examples of the different ways machine learning affect society

COURSE OUTCOMES:
Bloom’s
CO
Outcomes Taxonomy
No.
Level
CO1 Differentiate between the two main types of machine L2
learning methods: supervised and unsupervised
CO2 Program Supervised learning algorithms, including L3
classification and regression
CO3 Program Unsupervised learning algorithms, including L3
Clustering and Dimensionality Reduction

COURSE CONTENT:

MODULE 1 10 Hrs
Introduction to Machine Learning – Overview, Applications, Supervised Vs. Unsupervised
Learning, Linear Algebra Review, Machine Learning System Design, Principal Component
Analysis, Basics of Model Learning

MODULE 2 10 Hrs
Linear Regression, Non-Linear Regression, Model Evaluation Methods (Scikit-Learn),
Regularization, Anomaly Detection, Naïve Bayes, Feature Scaling

MODULE 3 11 Hrs
K-Nearest Neighbour, Decision Trees, Logistic Regression, Support Vector Machines, Model
Evaluation (Scikit-Learn), Association Analysis
MODULE 4 11 Hrs
K-Means Clustering, Hierarchical Clustering, Density-Based Clustering, Recommender Systems –
Content-Based Recommender Systems, Collaborative Filtering, Avoiding False Discoveries, Class
Imbalance Problem

MODULE 5 10 Hrs
Overview, Types of Reinforcement, Q-Learning, Epsilon-Greedy Algorithm, Neural Logic,
Applications, Large Scale Machine Learning, Transfer Learning for Natural Language Processing

TEXT BOOKS:
1. Tom M. Mitchell, Machine Learning, India Edition 2013, McGraw Hill Education
2. Pang-Ning Tan, Michael Steinbach, Vipin Kumar, Introduction to Data Mining, Pearson, First
impression, 2014

REFERENCES:
1 Rudolph Russell: Machine Learning: Step-By-Step Guide to Implement Machine
Learning Algorithms with Python, Createspace Independent Publishing Platform, May
2018
2 Shai Shalev-Shwartz, Shai Ben-David: Understanding Machine Learning from Theory
to Algorithms, Cambridge University Press, 2014
SEMESTER VI
YEAR III
COURSE CODE 19CT3612
TITLE OF THE COURSE HUMAN COMPUTER INTERACTION
Lecture Tutorial Practical Seminar/Projects Total Credits
SCHEME OF Instruction Hours Hours Hours Hours Hours
-- -- 02 02 52 04

COURSE OBJECTIVES:
 Illustrate overall goals of human-computer interaction.
 Map relationship between HCI, user experience design, human factors engineering,
and psychology.
 Discuss trends in HCI technology including virtual reality, augmented reality, and
robotics.
 Elaborate the role of design principles and heuristics in user interface design.

COURSE OUTCOMES:
Bloom’s
CO
Outcomes Taxonomy
No.
Level
CO1 Map relationship between HCI, user experience design, L2
human factors engineering, and psychology.
CO2 Analyze the use of HCI to domains like healthcare, L3
education, and cybersecurity.
CO3 Discuss trends in HCI technology including virtual reality, L3
augmented reality, and robotics.
CO4 Explore emerging ideas in HCI research, such as context- L3
sensitive computing, gesture-based interaction, and social
computing.

COURSE CONTENT:

MODULE 1 10 Hrs
Introduction, Design Principles and Feedback Cycles, Direct Manipulation & Invisible Interfaces,
Human Abilities, Design Principles and Heuristics

MODULE 2 10 Hrs
Characteristics of Interaction Design, Digital Materials and Interaction Design, Contextual
Design – Overview, Key Principles, Process, Task-Artifact Cycle, GOMS Model

MODULE 3 11 Hrs
Unity 3D – Basics of C#, Variables, Functions, Logic & Operators, Inheritance, Class
Constructors, Arrays, Overview, Unity 3D for HCI, Asset Workflow, Creating Gameplay,
Importing Models, Input – Input Manager, Mobile Device Input, Unity XR Input
MODULE 4 11 Hrs
Graphics – Render Pipelines, Visual Effects Components, Optimizing Graphics Performance,
Animation – Clips and Controllers, Performance and Optimization, User-Interfaces – Unity UI,
Immediate Mode GUI, Navigation and Pathfinding, 3D Physics for Object-Oriented Projects

MODULE 5 10 Hrs
Overview of JavaScript for Unity, Starting with Coding Physics, Using Advanced Physics
Concepts, Particle Emitters and Special Effects, Enhancing User Experience: GUI & Sound

TEXT BOOKS:
1. Andrew Monk, Fundamentals of Human-Computer Interaction, 1st Edition, ,
Academic Press, 28th January 1985
2. Alan DIX, Janet Finlay, Gregory D. Abowd, Russell Beale, Human-Computer
Interaction

REFERENCES:
1 Learning C# Programming with Unity 3D, Alex Okita, 1st Edition, CRC Press,
Routledge; 1 Edition
2 Learning Unity 3D Programming with Unity Script: Unity’s JavaScript for Beginners,
Janine Suvak, Technology in Action, Apress; 1st ed. edition
SEMESTER VI
YEAR III
COURSE CODE 19CT3613
TITLE OF THE COURSE CLOUD SECURITY SERVICES
Lecture Tutorial Practical Seminar/Projects Total Credits
SCHEME OF Instruction Hours Hours Hours Hours Hours
-- -- 02 02 52 04

COURSE OBJECTIVES:
 Explain basics concepts of Cloud Computing.
 Evaluate security issues with cloud infrastructure
 Implement cloud features to secure and harden the infrastructure
 Use tools to analyze system logs to detect possible security or performance problems

COURSE OUTCOMES:
Bloom’s
CO
Outcomes Taxonomy
No.
Level
CO1 Evaluate security issues with cloud infrastructure L2
CO2 Implement cloud features to secure and harden the L3
infrastructure
CO3 Use tools to analyze system logs to detect possible security L3
or performance problems

COURSE CONTENT:

MODULE 1 10 Hrs
Basics of Cloud Computing – Foundations and Models, Types, Designing a Cloud Computing
Infrastructure or Service, Deployment and Configuration, Insuring Cloud Security and
Mitigating Risks

MODULE 2 10 Hrs
Shared Responsibility Model, Security Compliance, Identify and Access Services, Directory
Services, Network Isolation-Fort and Beehive

MODULE 3 11 Hrs
Network Isolation VPC, VPC Endpoints and Private Link, Detective Controls, Auditing,
CloudWatch and CloudWatch Logs, Guard Duty
MODULE 4 11 Hrs
Security Hub, Encryption in Transit, Encryption at Rest, Database Encryption, Protecting
Compute Resources, Protecting & Securing Endpoints

MODULE 5 10 Hrs
Cloud Security Managed Services, Security Strategy, Intelligent Log Management, Security
Intelligence, Operations Consulting, Threat Insights

TEXT BOOKS:
1. Ronald L. Krutz , Cloud Security: A Comprehensive Guide to Secure Cloud Computing,
30 July 2010
2. John R. Vacca, Cloud Computing Security: Foundations and Challenges, 30 August
2016
3. Chris Dotson, Practical Cloud Security: A Guide for Secure Design and Deployment,
31 March 2019

REFERENCES:
1 Vic (J.R.) Winkler, Securing the Cloud: Cloud Computer Security Techniques and
Tactics Paperback – 1 June 2011
2 Adrian Pruteanu and Zeal Vora, Enterprise Cloud Security and Governance: Efficiently
set data protection and privacy principles Paperback – Import, 29 December 2017
3 Routavaara, Ilkka. "Security monitoring in AWS public cloud." (2020)
4 NIST Special Publication 500-292, NIST Cloud Computing Reference Architecture,
September 2011
SEMESTER VI
YEAR III
COURSE CODE 19CT3614
TITLE OF THE COURSE ROBOTIC PROCESS AUTOMATION
Lecture Tutorial Practical Seminar/Projects Total Credits
SCHEME OF Instruction Hours Hours Hours Hours Hours
-- -- 02 02 52 04

COURSE OBJECTIVES:
 Overview of Robotic Process Automation
 The pros and cons of the RPA technology
 The working of UiPath Studio developer software
 Building a simple software robot
 Simulating RPA in an enterprise setting (high level)

COURSE OUTCOMES:
Bloom’s
CO
Outcomes Taxonomy
No.
Level
CO1 Analyze the pros and cons of software bots in an enterprise L3
setting
CO2 Build Simple Software Robot L3

CO3 Simulate RPA in an Enterprise Setting (High-Level) L3

COURSE CONTENT:

MODULE 1 10 Hrs
Introduction, What is RPA? Why RPA? Scope and Techniques of Automation, Pros and Cons,
UiPath, UiPath Studio, Types of Robots, Activities, Variables and Data Types, Control Flow,
Data Manipulation, Sequence, Flowchart and Control Flow

MODULE 2 10 Hrs
Components of RPA – Recorder, Extensions and Plugins, Bot Runner, Control Center, RPA
Platforms – Automation Anywhere, UiPath, Blue Prism, Work Fusion, Thoughtonomy, Task
Recorder, Loops and Decision Making, Data Manipulation – Variables & Scope, Collections,
Arguments, Data Tables

MODULE 3 11 Hrs
Excel Automation, User-Interface Automation, Recording, Advanced UI Automation,
Selectors, Virtual Environment Automation, PDF Automation, Email Automation, File
Operations, Finding and Attaching Windows, Taking Control of Controls, Working with
UiExplorer
MODULE 4 11 Hrs
Debugging and Exceptions, Agent Assisted Automation, User Events, Orchestrator, Chatbots,
UiPath and ThingsSpeak, Screen Scraping, Java Plugin, Handling User-Events and Assistant
Bots, Exception Handling, Debugging and Logging, Managing and Maintaining the Code,
Deploying and Maintaining the Bot

MODULE 5 10 Hrs
Use-Cases – Food and Beverage, Public Sector, Healthcare, Retail, Transportation, Financial
Services, Insurance, Chemicals, Pharmaceuticals

TEXT BOOKS:
1. Learning Robotic Process Automation: Create Software robots and automate business
processes with the leading RPA tool- UiPath: By Alok Mani Tripathi
2. Audacity of Automation: Catalyst for Third World Development by Osei Badu-
Nkansah
3. The Robotic Process Automation Handbook: A Guide to Implementing RPA Systems
by Tom Taulli
SEMESTER VII
YEAR IV
COURSE CODE 19CT4701
TITLE OF THE COURSE PRODUCT DEVELOPMENT
Lecture Tutorial Practical Seminar/Projects Total Credits
SCHEME OF Instruction Hours Hours Hours Hours Hours
03 -- -- 03 45 02

COURSE OBJECTIVES:

 Learners will be trained to strategies for building solutions

 Learners will be enabled to develop a Prototype/ MVP
 Learn to develop a product-market fit strategy and support it with a valid business case
 Learn to improve customer-product intimacy by leveraging various social signals to build
productfeatures and how to market them.
 Learn how to create measures and indicators that may be used to drive and ensure
product-marketfit.

COURSE OUTCOMES:
Bloom’s
CO
Outcomes Taxonomy
No.
Level
CO1 Build solutions using various strategies L2
CO2 Develop a Prototype/MVP L3
CO3 Develop Product-Market Fit Strategy & Support it with Valid L3
Business Case
CO4 Improve Customer-Product Intimacy L1
CO5 Create Measures and Indicators to Drive Product-Market Fit L3

COURSE CONTENT:

Building Product Architect, Conceptual Design, and Visual principles, interactive prototypes, usability
testing with the experts.

Concept and Definition of the Customer Voice; Key factors that facilitate listening to the Customer
Voice; Concept and Definition of Customer Engagement; Customer Engagement Strategies and
Techniques to help gain competitive advantage; Concept and Definition of Customer Validation.
Measures and Indicators for Product Market Fit using Customer Validation
TEXT BOOKS:
1. Knowledge Perspectives of New Product Development: A Comparative Approach

2. Selling New Technology: Tips, Tactics and Tales from a Technology Salesperson

3. Beyond Product, By Jill Solley, Todd Wilms

4. Lean Product Playbook by Dan Olsen

SEMESTER VII
YEAR IV
COURSE CODE 19CT4702
TITLE OF THE COURSE THOUGHT LEADERSHIP IN ENTREPRENEURSHIP &
INNOVATION
Lecture Tutorial Practical Seminar/Projects Total Credits
SCHEME OF Instruction Hours Hours Hours Hours Hours
03 -- -- 03 45 02

COURSE OBJECTIVES:
• To expose students to various perspectives and concepts of Business environment and
StrategicManagement
• The course would enable the students to understand the principles of strategy formulation,
implementation, and control in organizations
• To help students develop skills for applying these concepts to the solution of business problems

COURSE OUTCOMES:
Bloom’s
CO
Outcomes Taxonomy
No.
Level
CO1 Understand and appreciate the context in which his/her L2
engineering learning would be used in products or services.

CO2 Know how organisations would intend to engage with their L3

environment and consequently develop capabilities and
competencies to provide competitive advantages and fulfil their
organisational objectives.
CO3 Get an overview insight and create interest to come out of the L3
traditional silo-oriented- functional expertise mindset and look
at business, industry, and life in general, in an integrative
fashion, as it ought to be.

CO4 Have broad understanding and importance of some of the major L1

concepts and techniques of strategic analysis, strategy
formulation, strategic actions/choices, strategy
implementation, organization structure design, culture, and
ethics.

Sl. No. Session Details (Each Session = 1 Hour)

Introduction - Implications of Globalisation, Hyper Competition Landscape
Session 1
Contemporary Business Environment - Disruptive Tech Development,
Session 2
Uncertain Energy Outlook
Session 3 Societal and Cultural Business Environment
 Session 4 & 5 Economic & Financial
Session 6 Business Environment - Geopolitical & Legal
Session 7 Business Environment - Climate Change, Ecology, Pandemics,

Session 8 Case Study - Business Environmental Analysis

External Environment Analysis and Strategy Planning - Tools and
Session 9
Techniques
Hierarchy of Strategic Intent (Vision & Mission, Business Definition &
Session 10 & 11 Business Model, Goals & Objectives)
Session 12 & 13 Industry Life Cycle Analysis, Five Forces Model and Competitive Dynamix
Internal Environment Analysis for Capabilities, Competencies and Sustained
Session 14, 15, 16 Competitive Advantage
Session 17 During-SEM-Assignment 1
Creative and Strategic Decision-Making Process, with in-Class Group
Session 18
Exercise
Session 19 Value Chain Analysis and Outsourcing
Session 20 Business Level Strategies
Session 21 Functional Level Strategies
Session 22 Technological Paradigm shifts and Strategy Implications
Session 23 & 24 Corporate Level Strategies
Session 25 Mergers, Acquisition & Restructuring - Strategic Implications
Drivers of Profitability, Weighted Average Cost of Capital, Return on Capital
Session 26
Employed, Implications of Industry Average Profitability
Session 27 Mergers, Acquisition & Restructuring - Financial Implications
Session 28 Corporate Governance, Business Ethics
Session 29 Strategic actions/choices and Strategy implementation
Session 30 & 31 Strategic Control Systems & Organisational Structure
Session 32 International Business Strategies
Session 33 Leadership Implications for Strategy
Session 34 Entrepreneurial Implications for Strategy
Session 35 During-SEM-Assignment 2
Open House Moderated Discussion - Contemporary Business Environment -
Session 36
Challenges and Opportunities for New Business Models and Strategies

TEXT BOOKS:
1. Strategic Management- Hitt, Ireland, Hoskisson, Manikutty, Cengage

2. Strategic Management- Hill, Jones, Cengage

SEMESTER VII
YEAR IV
COURSE CODE 19CS4701
TITLE OF THE COURSE CYBER CRIMES, SECURITY POLICIES AND LAW

SCHEME OF Instruction Lecture Tutorial Practical Seminar/Projects Total Credits

Hours Hours Hours Hours Hours
2 -- -- -- 30 2

COURSE OBJECTIVES:
 To learn the information technology laws
 To provide insight into the applicability of laws in the digital environment.
 To understand the provisions of Information Technology laws to facilitate
electronic commerce – electronic signatures, data protection, cyber security;
penalties & offencesunder the IT Act, dispute resolution, and other contemporary
issues.
COURSE OUTCOMES:
CO No. Outcomes Bloom’s
Taxonomy
Level
Apply the knowledge of the Cyber literacy to become aware of L2
CO1
the fundamental rights and duties in their role as Engineers.
CO2 Understanding of ethical and legal aspects of Information L2
Technology Act and their redressal mechanism related Cyber
issues.
CO3 Demonstrate an advanced and integrated understanding of the L2
nature and extent of the e-governance, e-commerce principle
and to interpret various other Legislation and Act associated
with it.
CO4 Critically evaluate the extent and application of the Cyber L5
Laws, the security aspect.
COURSE CONTENT:
MODULE 1 6Hrs
INTRODUCTION:
Conceptual and theoretical perspective of cyber law - Computer and Web Technology -
Development of Cyber Law – National and International Perspective.
Regulatory Body; ICCAN Regulations.
Need of Information Technology Law; Harmonization and unification of I T Laws;

MODULE 2 6Hrs
INFORMATION TECHNOLOGY LAW:
Information Technology Act 2000 (with up to date amendments), Nature and Scope;
Regulatory bodies and dispute settlement Mechanism under the Act;
Privacy issues in the Cyber World; Data Protection Principles; Privacy rights of Data Subjects;
Protection of sensitive Data; Regulation of Trans Border Data;
E-governance: Legal recognition of Electronic records and electronic evidence; Digital
Signature Certificates; records; Cyber Law issues in E-governance; E-Records; E-Documents;
Dispute Resolution under IT Act.

MODULE 3 6Hrs
CYBER CRIME AND THE LAW
Introduction, Meaning and Definition of Cyber Crime; Crime on the Net; Cyber Criminals and
Victims of Cyber Crime. Online Games.
Cyber Crimes – financial frauds - money laundering, credit card frauds, social crimes – cyber
hacking, cyber stalking, Data Theft; Cyber Fraud; pornography, identity theft, Intellectual
Property related crimes, cyber terrorism, defamation; spams and virus; online lottery and
cheating etc.
Cyber Torts: - Civil and Tortious Liability; Defective Software; Negligence in Creating
software; Remedies and Damages:
Damage to computer and computer system – (s.43 read with s.66) – access/facilitates access,
data theft, virus attacks, email bombings, denial of service attack, damage to computer source
code

MODULE 4 6Hrs
E-Commerce
E-Banking; Relationship of Customer and Banker under IT Laws; Legal issues of E-Money;
Credit and Debit Cards; E-Fund transferring;

MODULE 5 6Hrs
E- Contracts; Trade Marks and Domain Names; and Jurisdiction in Cyber Space
Kinds of Contracts - email, web contracts, Standard form contracts Formation of E-contracts –
application of The Contract Act, 1872 and Information and Technology Act, 2005, United
Nations Convention on the Use of Electronic Communications in International Contract 2005;
Trade Marks and Domain Names, Jurisdiction of Cyber Space
TEXT BOOKS:
1. Yatindra Singh: Cyber Laws

2. Ajit Narayanan and Bennum (ed.): Law, Computer Science and

Artificial Intelligence
3. Linda Brennan and Victoria Johnson: Social, ethical and policy
implication of InformationTechnology.
4. Kamath Nandan: Law relating to Computer, Internet and E-
Commerce.

5. Arvind Singhal and Everett Rogers: India's Communication

Revolution: From Bullock Carts to Cyber Marts.

6. Lawrence Lessing: Code and other Laws of cyberspace.

Mike Godwin: Cyber Rights Defencing free speech in the Digital Age
SEMESTER VII
YEAR IV
COURSE CODE 19CT4711
TITLE OF THE COURSE BIG DATA ANALYTICS & DEEP LEARNING

SCHEME OF Instruction Lecture Tutorial Practical Seminar/Projects Total Credit

Hours Hours Hours Hours Hours s
2 -- -- 02 30 02

COURSE OBJECTIVES:
• Use Apache Spark & Deep Learning to perform data analysis
• Use parallel programming to explore data sets
• Apply log mining, textual entity recognition and collaborative filtering techniques to real-world data
questions

COURSE OUTCOMES:
CO No. Outcomes Bloom’s
Taxonomy
Level
Use Apache Spark & Deep Learning to perform data analysis L2
CO1

CO2 Use parallel programming to explore data sets L2

CO3 Apply log mining, textual entity recognition and collaborative filtering L2
techniques to real-world data questions

COURSE CONTENT:
MODULE 1 6Hrs
INTRODUCTION:

Introduction to Big Data Analytics – Overview, Types, Characteristics, Lifecycle, Process,

Models, Tools, Hadoop Distributed File Systems, MapReduce Framework

MODULE 2 6Hrs
Introduction to Spark – Overview, Components, Resilient Distributed Dataset (RDD), Data
Frames, RDD Operations, Shared Variables and Key-Value Pairs, Spark Context, Functions,
Spark Libraries, Properties
MODULE 3 6Hrs
Introduction to Deep Learning – Overview, Neural Networks & Types, Deep Neural Networks

MODULE 4 6Hrs
Deep Learning Models – Restricted Boltzmann Machines, Deep Belief Nets, Convolutional
Networks, Recurrent Nets, Autoencoders, Recursive Neural Tensor Nets;

MODULE 5 6Hrs
Regularization, Multi-Layer Perceptions, Long-Short-Term Memory Networks, Deep
Reinforcement Learning, Transfer Learning, Self-Organizing Maps

TEXT BOOKS:
1. Learning Apache Spark with Python, Wenqiang
Feng, February 2020 -
https://runawayhorse001.github.io/LearningApacheSpark/pyspark.pdf
2. Big Data Analytics – Turning Big Data into Big Money, Frank Ohlhorst, John Wiley & Sons Inc.,
2013

3. Deep Learning with Python, Francois Chollet, Manning Shelter Island, Manning Publications Co.,
2018
SEMESTER VII
YEAR IV
COURSE CODE 19CT4712
TITLE OF THE COURSE Virtual Reality & Game-Theoretic
Simulation
SCHEME OF Instruction Lecture Tutorial Practical Seminar/Projects Total Credit
Hours Hours Hours Hours Hours s
2 -- -- 02 30 02

COURSE OBJECTIVES:
• Develop professional VR apps using Unity 3D
• Run Unity 3D applications in VR on a smartphone
• Build tools to help users navigate 3D environments
• Learn key usability goals and pitfalls for Virtual Reality

COURSE OUTCOMES:
CO No. Outcomes Bloom’s
Taxonomy
Level
Develop professional VR apps using Unity 3D L2
CO1
CO2 Run Unity 3D applications in VR on a smartphone L2

CO3 Create a 3D environment from scratch in game engines L2

COURSE CONTENT:
MODULE 1 6Hrs
INTRODUCTION:
Introduction to VR – Definition, Difference between VR & AR, Applications versus Games,
Types of VR Experiences, Types of Head-Mounted Displays, How Virtual Reality Works? The
Benefits of VR, 3D Computer
Graphics, Human Factors

MODULE 2 6Hrs
VR & Game Engines – Overview, Unity3D, VR and 3D Environments, Physics and Gaze
Interaction, Virtual World Generator, Human Senses, Perceptual Psychology, Psychophysics,
Geometric Modelling, Transforming Rigid Bodies, Game-Theoretic Systems
MODULE 3 6Hrs
3D UI and Locomotion – Overview, 3D Menus, Locomotion, Building Interfaces and
Locomotion

Systems, 3D Rotation Inverses and Conversions, Look-at & Eye Transforms, Canonical
View
and Perspective Transforms, Viewport Transforms

MODULE 4 6Hrs
3D User Interaction – Overview, 3D Interaction Design, Selection and Manipulation, Building
Manipulation Systems, Graphical Rendering, Ray Tracing, Rasterization, Barycentric
Coordinates, Anti-Aliasing, Image Warping, Panoramic Rendering

MODULE 5 6Hrs
Wayfinding and VR Input – Overview, Implementing Wayfinding, Building Wayfinding Tools,
VR Usability and Pitfalls, Velocities, Tracking Systems, Drift Errors, Camera-Feature Detection
Model, Perspective npoint Problem, Brain-Machine Interfaces

TEXT BOOKS:
1. Virtual Reality - Steven M. LaValle, Cambridge University Press

2. Complete Virtual Reality and Augmented Reality Development with Unity - Jesse Glover,
Jonathan Linowes, Packt Publishing (April 17, 2019)
3. Understanding Virtual Reality: Interface, Application and Design - William R. Sherman, Alan B.
Craig, 1st Edition, September 2002
SEMESTER VII
YEAR IV
COURSE CODE 19CT4713
TITLE OF THE COURSE Blockchain & Cryptocurrency

SCHEME OF Instruction Lecture Tutorial Practical Seminar/Projects Total Credit

Hours Hours Hours Hours Hours s
2 -- -- 02 30 02

COURSE OBJECTIVES:
• The alternative consensus mechanisms to Bitcoin’s Proof-of-work, including Proof-of-Stake, voting
based consensus algorithms, and federated consensus.
• The various enterprise-level blockchain implementations, such as JP Morgan’s Quorum, Ripple,
Tender Mint, and Hyperledger, including the industry use cases for blockchain, ICOs, and the
increasing regulations surrounding blockchain.
• The challenges with scaling and obstacles to widespread blockchain adoption, as well as the possible
solutions within vertical scaling (e.g. block size increases, Segregated Witness, and the Lightning
Network) and horizontal scaling (e.g. sidechains, sharding).

COURSE OUTCOMES:
CO No. Outcomes Bloom’s
Taxonomy
Level
Illustrate alternative consensus mechanisms to Bitcoin’s Proof-of- L2
CO1 work, including Proof-of-Stake, voting-based consensus algorithms,
and federated consensus.
CO2 Describe the properties of crypto economics as it relates to its two L2
compositional fields: cryptography and economics, as well as the
goals for crypto economics with respect to
distributed systems fundamentals
CO3 Analyse enterprise-level blockchain implementations, such as JP L1
Morgan’s Quorum, Ripple, Tender Mint, and Hyperledger

COURSE CONTENT:
MODULE 1 6Hrs
Distributed Systems and Alternative Consensus – Overview, Blockchain Architecture, CAP
Theorem, Byzantine General Problem, Alternative Consensus Mechanisms of Bitcoin’s Proof-
of-Work, Proof-of-Stake, Voting based Consensus Algorithms, Federated Consensus

MODULE 2 6Hrs
Crypto economics – Overview, Properties, Attacks, Enterprise Blockchain Overview, Platforms,
Getting
Started with Bitcoin – Setting up a Regtest Environment, Building a Payment Gateway, Bitcoin
Smart Contracts,

Rootstock, Building your own Cryptocurrency, Readercoin, Peer-to-Peer Auctions in Ethereum,

Building an Auction
DApp – Ganache

MODULE 3 6Hrs
Scaling Blockchain – Vertical Scaling on-Chain, Vertical Scaling Off-Chain, Horizontal Scaling,
Advanced Scaling and Generalizations, Tontine Game with Truffle and Drizzle, Tontine
Contract, Cplayer as a
CRUD Contract, Tontine Interfaces, Ctontine Contract, Truffle Unit Tests, Frontend with
Drizzle,

MODULE 4 6Hrs
Use Cases and Industries, Regulation and Caveats, Anonymity through Altcoins, Advanced
Anonymity & Generalizations, Connecting Ganache to MetaMask, Blockchain-Based
Futures System, Futures Smart Contract, Web3j, Initial Coin Offering, Token Contracts

MODULE 5 6Hrs
Enterprise Blockchain Implementations - JP Morgan’s Quorum, Ripple, Tender mint, and
Hyperledger,
Blockchains in Business – Public versus Private and Permissioned versus Permission less
Blockchains, The Ethereum Enterprise Alliance, Blockchain-as-a-Service, Quorum

TEXT BOOKS:
1. Mastering Bitcoin: Unlocking Digital Crypto-Currencies- Andreas M. Antonopoulos, O’Reilly
Media Inc. 2020

2. Mastering Blockchain – Expert

Insight- Imran Bashir, Second Edition, Packt, 2018

3. Blockchain: Ultimate guide to understanding Blockchain, Bitcoin,

Cryptocurrencies, Smart Contracts- Mark Gates, Wise Fox Publishing, June 2017

4. Programming Bitcoin: Learn How to Program Bitcoin from Scratch, Jimmy Song, O’Reilly
Media Inc.
5. Blockchain for Dummies, Manav Gupta, IBM Limited Edition, John Wiley & Sons, Inc. 2017
SEMESTER VII
YEAR IV
COURSE CODE 19CT4714
TITLE OF THE COURSE Edge Computing with IoT

SCHEME OF Instruction Lecture Tutorial Practical Seminar/Projects Total Credit

Hours Hours Hours Hours Hours s
2 -- -- 02 30 02

COURSE OBJECTIVES:
• Provides insights on transitioning from current Cloud-centric and 4G/5G wireless environments to
FogComputing
• Examines methods to optimize virtualized, pooled, and shared resources
• Identifies potential technical challenges and offers suggestions for possible solutions
• Discusses major components of Edge computing architectures such as middleware, interaction
protocols, andautonomic management

COURSE OUTCOMES:
CO No. Outcomes Bloom’s
Taxonomy
Level
Discuss insights on transitioning from current Cloud-centric and L4
CO1 4G/5G wireless environments to Fog Computing.
CO2 Examine methods to optimize virtualized, pooled, and shared L2
resources
CO3 Identify potential technical challenges and offers suggestions for L2
possible solutions
C04 Explain major components of Edge computing architectures such as L4
middleware, interaction protocols, and autonomic
management
C05 Deploy edge systems using Amazon IoT Greengrass Software L3
Development Kit

COURSE CONTENT:
MODULE 1 6Hrs
Internet of Things and New Computing Paradigms – Overview of Edge Computing, Edge
Methodology,
Addressing the Challenges in Federating Edge Resources, Management and Orchestration of
Network Slices, Network Slicing Management in Edge, Optimization Problems in Edge
Computing
MODULE 2 6Hrs

Edge Middleware, Middleware Infrastructures, System Model, Clusters for

Lightweight EdgeClouds, Architecture Management – Storage and Orchestration, IoT
Integration, Security Management for Edge Cloud
Architectures

MODULE 3 6Hrs
How 5G is driving Edge Adoption, Open Source Edge IoT Projects – Eclipse Kura, EdgeX
Foundry,
StarlingX, OpenEdge, MS IoT Edge, KubeEdge, Eclipse ioFog, Comparison of IoT Hardware
Boards and Frameworks, IOT Data Analysis: Data Source, Ingestion, Stream Processing,
Presentation

MODULE 4 6Hrs
Microsoft Azure: Event Hubs, Stream Analytics, Azure Cosmos DB, Power BI, Google:
Pub/Sub, Cloud Data
Flow, Big Query, Cloud data Labs and Data Studio, Amazon IoT Greengrass – Overview,
Architecture, Lambda Runtime, Shadows Implementation, Message Manager, Group
Management, Discovery Service, Stream Manager,
Local Resource Access

MODULE 5 6Hrs
Amazon: Kinesis Steaming, Kinesis Analytics, S3/Dynamo DB, Amazon Quick Sight, IOT
hardware Boards
Study, Intel Edison, Intel Galileo, Samsung Artik, Microsoft IOT Boar, Amazon IoT Greengrass
– Local Machine
Learning Inference, Local Secrets Manager, Connectors with built-in Integration with Services,
Protocols and
Software

TEXT BOOKS:
1. Principles of Fog and Edge Computing: With Applications and Case Studies, June 21, 2018 by S.
Balamurugan
2. Fog and Edge Computing: Principles and Paradigms (Wiley Series on Parallel and Distributed
Computing) Hardcover – 1 March 2019 by Rajkumar Buyya & Satish Narayana Srirama

3. Practical Internet of Things Security (Kindle Edition) by Brian Russell, Drew Van
Duren

4. Securing the Internet of Things Elsevier 3. Security and Privacy in Internet of Things (IoTs):
Models, Algorithms, and Implementations
 SEMESTER VII
YEAR IV
COURSE CODE 19CS4719
TITLE OF THE AWS Web Services
COURSE
SCHEME OF Lecture Tutorial Practical Seminar/Projects Total Credits
INSTRUCTION Hours Hours Hours Hours Hours
3 - - - 39 3

Perquisite Courses (if any)

# Sem/Year Course Code Title of the Course
*** *** *** ***

COURSE OBJECTIVES:
1. To understand fundamental concepts and hands-on knowledge of Cloud Computing using
AWS Platform
2. Conceive, Design and Develop state-of-the-art AWS Networking, Database, Storage Services
3. Ability to understand and apply evolve Security and privacy in AWS Cloud across various
domains like Storage, Database and applications.

COURSE OUTCOMES:

CO Outcomes Bloom’s
No. Taxonomy
Level
CO1 To understand fundamentals of Cloud computing, Amazon L2
EC2, load balancing and Auto scaling.

CO2 Understand state-of-the-art AWS platforms for running L2

compute, network and storage services.

CO3 Categorize, Design and Develop state- of-the-art AWS L4

Networking, Database, Storage Services.

CO4 Demonstrate hands-on knowledge of Storage services, S3, L3

EFS, Glacier, EBS storage gateway by designing any AWS
application.
 CO5 Apply AWS database services design principles, framework L3
and protocols to develop dependable systems and appropriate
projects for real-world problems.

COURSE CONTENT:

MODULE 1: Introduction 8Hrs

What is Cloud Computing? How Does Cloud Computing Work? What is AWS? AWS Free
Tier, Compute Services: Amazon EC2, Elastic Load Balancing, Auto Scaling

MODULE 2: Networking Services 6 Hrs

Amazon VPC, Amazon Route 53

MODULE 3: AWS Security 6Hrs

Shared Responsibility Model, AWS IAM and KMS

MODULE 4 : Storage Services 9 Hrs

Amazon S3, Amazon EBS, Amazon EFS, Amazon Glacier, AWS Storage Gateway, Amazon Cloud
Front

MODULE 5: AWS Database Services, Application Services 10 Hrs

Amazon RDS, Amazon DynamoDB, Amazon ElastiCache, Amazon Simple Email Service (Amazon
SES ), Amazon Simple Notification Service (Amazon SNS), Amazon Simple Queue Service
(Amazon SQS), Amazon Simple Workflow Service (Amazon SWF)

TEXT BOOK:
1. Ben Piper, David Clinton, ‘AWS Certified Solutions Architect Study Guide: Associate SAA-C02 Exam (Aws
Certified Solutions Architect Official: Associate Exam)” Paperback – 22 February 2021
SEMESTER VIII
YEAR IV
COURSE CODE 19CT4802
TITLE OF THE COURSE EXPERIENTIAL PRACTICUM - 4
Setting up a Venture
SCHEME OF Instruction Lecture Tutorial Practical Seminar/Projects Total Credit
Hours Hours Hours Hours Hours s
18 - -- 18 270 19
-

COURSE OBJECTIVES:

 Understand the concept of setting up a venture

 Finalize a GTM strategy, business channels
 Learners will be capable to face the real business world with confidence
 Ready for student venture with the DERBI Hatchery

COURSE OUTCOMES:
CO No. Outcomes Bloom’s
Taxonomy
Level
Finalize a GTM Strategy L5
CO1
CO2 Finalize Business Channels L5

COURSE CONTENT:

1. Fundamentals of choosing the Business Organization form for Start-up

(partnership, LLP & Pvt Ltd)
2. Financing the Venture - Sources of Investment - Bootstrapping, Angels & VCs
and Institutional Investments, Understanding the Term Sheet
3. Strategies for Sales & Marketing including Acquisition Strategies and
Distribution Models
4. Team Building, Allocation of Roles and Responsibilities and Building
Hierarchy in a Team Structure

TEXT BOOKS:
1.
Venture Deals: Be Smarter Than Your Lawyer and Venture Capitalist by Brad Feld, Jason
Mendelson

2. Starting Your Own Venture Investment Fund: Kevin Moore

SEMESTER VIII
YEAR IV
COURSE CODE 19CT4803
TITLE OF THE COURSE Technology Strategy

SCHEME OF Instruction Lecture Tutorial Practical Seminar/Projects Total Credit

Hours Hours Hours Hours Hours s
-- -- -- 08 48 03

COURSE OBJECTIVES:

 Create awareness on strategic frameworks, tools for development of technical strategy

 Understand the art of technology decision making, anticipate and respond to the

 Behavior of competitors, suppliers, and customers with cross industrial examples.

 Understand how the high technology firms create, capture, and deliver value through

 Inter-firm relationships such as alliances, collaborations, and joint ventures

COURSE OUTCOMES:
CO No. Outcomes Bloom’s
Taxonomy
Level
It helps students on how to prepare and manage technology L4
CO1
strategy
CO2 Students get the knowledge on strategic frameworks, tools L2
for development of technical strategy.
CO3 Students will get to know nuances in technology strategy based L2
on cross industry
examples
C04 This subject brings in awareness on alliances, collaborations & L4
joint ventures as part of
technology strategy based on examples.
C05 By doing the intermediate and final write-ups students will get to know L3
how to manage
Technology strategy

COURSE CONTENT:
MODULE 1 9Hrs
Introduction to Technology and Technology Strategy
What is Technology and Technology strategy, Roles, Technology Push and market Pull,
Performance Dynamics & S-Curves

MODULE 2 10Hrs
Adoption and Industry Dynamics – Adoption Dynamics & Diffusion, Drivers of Diffusion
rates, Roger’s categories of adoption, Industry Dynamics - Industry patterns of entry/exit,

MODULE 3 10Hrs
Capturing Value from Technology – Drivers of Value capture, Patents, Standards,
Mechanism for appropriation

MODULE 4 10Hrs
Technology, Social Systems, and Society – Impact of Technology , Open Innovation, First
mover advantage

MODULE 5 9Hrs
Disruptions of incumbents, make or buy decision making, Innovation frontier,
Technology ecosystems

TEXT BOOKS:
1. Constantinos C. Markides and Paul A. Geroski. 2005. Fast Second: How Smart
Companies Bypass Radical Innovation to Enter and Dominate New Markets. Jossey-
Bass. San Francisco
2. The Innovator's DNA: Mastering the Five Skills of Disruptive Innovators, by

Dyer, Gregersen, and Christensen, Harvard Business Press.

SEMESTER VIII
YEAR IV
COURSE CODE 19CT4811
TITLE OF THE COURSE ARTIFICIAL INTELLIGENCE AS A SERVICE

SCHEME OF Instruction Lecture Tutorial Practical Seminar/Projects Total Credit

Hours Hours Hours Hours Hours s
03 -- 01 02 45 02

COURSE OBJECTIVES:
 graph search algorithms
 adversarial search
 knowledge representation
 logical inference

COURSE OUTCOMES:
CO No. Outcomes Bloom’s
Taxonomy
Level
Analyse Graph-Search Algorithms L1
CO1
CO2 Derive Logical Inference from Knowledge L4

CO3 Perform Adversarial Search L4

C04 Model Bayesian Networks & Markov Models L4

C05 Process Text using NLP L4

COURSE CONTENT:
MODULE 1 9Hrs
AI Overview, Data for AI, Key Concepts – Models, Error, Cost Functions, Types of Search
Algorithms – A* Search, Adversarial Search, Search Problems, Heuristic Functions,
Optimization – Local Search, Alpha-Beta Pruning

MODULE 2 9Hrs
Knowledge Base, Knowledge-based Agents, Propositional Logic, First-Order Logic, Inference
Algorithms, Knowledge Engineering, Logic Puzzles, De-Morgan’s Law, Inference by
Resolution
MODULE 3 9Hrs
Probability, Bayes’ Rule, Marginalization, Approximate Inference, Markov Chain, Hidden
Markov Chain, Hill-Climbing, Simulated Annealing, Constraint Satisfaction Problem

MODULE 4 9Hrs
Markov Decision Process, Q-Learning, Greedy Decision-Making, Artificial Neural
Networks, Tensor Flow, Minimum Remaining Values (MRV) Heuristic

MODULE 5 9Hrs
Natural Language Processing, Semantics, Syntax, Formal Grammar, Tokenization, Markov
Models, Text Categorization, Bag-of-Words Model, Topic Modelling, Wordnet, Skip-Gram
Architecture

TEXT BOOKS:
1. Artificial Intelligence- Elaine Rich, Kevin K and S B Nair, 3rd Edition, McGraw Hill Education,
2017
2. Artificial Intelligence: A Modern Approach- Stuart Russell and Peter Norvig, Prentice Hall 3rd,
2009

3. Natural Language Processing and Information Retrieval- Tanveer Siddiqui, U.S. Tiwary, Oxford
University Press 2008

4. Artificial Intelligence: Structures and Strategies for Complex Problem-Solving George F Luger
Pearson Addison Wesley 6th Ed, 2008

5. Artificial Intelligence E Rich, K Knight, and S B Nair Tata Mc-Graw Hill 3rd Edition
SEMESTER VIII
YEAR IV
COURSE CODE 19CT4812
TITLE OF THE COURSE Augmented & Mixed Reality

SCHEME OF Instruction Lecture Tutorial Practical Seminar/Projects Total Credit

Hours Hours Hours Hours Hours s
03 -- 01 02 45 02

COURSE OBJECTIVES:
 Explore ARKit to create augmented reality scenes and objects for your apps
 Build and debug your AR app

COURSE OUTCOMES:
CO No. Outcomes Bloom’s
Taxonomy
Level
Use ARKit to create augmented reality scenes and objects for your L1
CO1 apps
CO2 Test and debug your AR app L1

CO3 Connect to web services to fetch or send info to and from your app L1

COURSE CONTENT:
MODULE 1 9Hrs
Basics of Augmented Reality, Difference between Augmented Reality and Virtual Reality,
Hardware Requirements, Google AR, AR Applications – Shopping and Retail, Business, Social
Media, gaming, Education,
Healthcare, Non-profits

MODULE 2 9Hrs
Basics of AR Functionality – AR Core – Placing and Positioning Assets, Scale and the Size of
Assets,
Occlusion, Lighting for Increased Realism, Solid Augmented Assets, Context Awareness,
Tracking in AR, Outside-in Tracking, Inside-out Tracking, Motion Tracking

MODULE 3 9Hrs
Feature Points and Plane-Finding, Light Estimation, Anchors, Interface Issues and Lack of UI
Metaphors, AR’s Technical Constraints, 3D Barrier, User-flow, Design Drafting
MODULE 4 9Hrs
Surface Detection and Creating Planes, Hit-Testing and Pose, Placing with Anchor Points,
Occlusion Between Virtual Assets, Light Estimation: Matching Virtual Light to Real Light

MODULE 5 9Hrs
Multi-Plane Detection and Spatial Mapping, Processing Needs in Mobile AR, Breaking
Immersion, Framing as a Creative Device, Introduction to Poly, Poly Examples, Introduction to
Mixed reality, Mixed Reality using Unity

TEXT BOOKS:
1. Practical Augmented Reality: A Guide to the Technologies, Applications and
Human Factors for AR and VR- Steve Aukstakalnis, Addison-Wesley
Professional; 1 Edition (8
September 2016)
2. Augmented and Virtual Reality in
Libraries- Jolanda-Pieta van
Arnhem, Christine
Elliott, Marie Rose, Rowman & Littlefield Publishers (May 24, 2018

3. Augmented Reality for Developers: Build

Practical Augmented Reality Applications with Unity, ARCore, ARKit, and Vuforia- Jonathan
Lonowes, Krystian Babilinski, October 9, 2017, Packt Publishing

4. Unity Virtual Reality Projects: Learn Virtual Reality by developing more than 10 engaging
projects with unity 2018 – second edition by Jonathan Linowes

5. Designing for Mixed Reality, Kharis O’Connell, September 2016, O’Reilly Media Inc.
SEMESTER VIII
YEAR IV
COURSE CODE 19CT4813
TITLE OF THE COURSE Quantum Cryptography

SCHEME OF Instruction Lecture Tutorial Practical Seminar/Projects Total Credit

Hours Hours Hours Hours Hours s
03 -- 01 02 45 02

COURSE OBJECTIVES:
 Be armed with a fundamental toolbox for understanding, designing and analysing quantum protocols.
 Understand quantum key distribution protocols.
 Understand how untrusted quantum devices can be tested.

 Be familiar with modern quantum cryptography – beyond quantum key distribution

COURSE OUTCOMES:
CO No. Outcomes Bloom’s
Taxonomy
Level
Use fundamental toolbox for designing and analysing quantum L1
CO1 protocols.
CO2 Explain quantum key distribution protocols. L1

CO3 Test untrusted quantum devices. L1

COURSE CONTENT:
MODULE 1 9Hrs
Introduction to Quantum Computing, Qubits, Quantum Gates, Measuring Qubits in a Basis,
Pure and Mixed Quantum States, The Partial Trace, Classical-Quantum States, Generalized
Measurements, Encrypting Quantum Bits with Quantum One-Time Pad

MODULE 2 9Hrs
The Power of Entanglement, Separable States, Entangled States and Purification, Sharing a
Classical Secret using Quantum States, Verifying Entanglement using a Bell Experiment,
Monogamy of Entanglement

MODULE 3 9Hrs
Quantifying Information, Trace Distance, Min-Entropy, Uncertainty Principles as a Guessing
Game, Introduction to Privacy Amplification, Strong Randomness Extractors, Randomness
Extraction using Two-
Universal Hashing

MODULE 4 9Hrs
Construction of Two-Universal Hash Functions, Introduction to Key Distribution, Challenge of
Being Correct and Secure, Key Distribution over a Noisy Channel, Practical Error Correction in
Key Distribution
Protocols

MODULE 5 9Hrs
BB84 Protocol, Warmup: Security Against a Classical Eavesdropper, E91 Protocol: Purifying
Protocols using Entanglement, Quantum Key Distribution: Definition and Concepts,
Introduction to Device Independent Quantum Cryptography

TEXT BOOKS:
1. Quantum Computing – A Gentle Introduction- Eleanor Rieffel and Wolfgang Polak, MIT Press,
2011

2. Introduction to Quantum Computing- Philip Kaye, Raymond Laflamme, Michele, Oxford

University Press, 2007

3. Applied Quantum Cryptography- Kollmitzer, Christian, Pivk, Mario, Springer-Verlag Berlin

Heidelberg, 2010

4. Quantum Cryptography and Computing, Ryszard Horodecki, Sergei Ya. Kilin, Janusz Kowalik,
IOS Press, 2010

5. https://qiskit.org/textbook/preface.html.
SEMESTER VIII
YEAR IV
COURSE CODE 19CT4814
TITLE OF THE COURSE Industrial Internet of Things

SCHEME OF Instruction Lecture Tutorial Practical Seminar/Projects Total Credit

Hours Hours Hours Hours Hours s
03 -- 01 02 45 02

COURSE OBJECTIVES:
 Explain the implementation of industrial processes, specialized control devices
and protocols
 Connect basic sensors to AWS IoT, Azure IoT, OEM IoT, Google IoT platforms
and extract this data fromthe cloud itself to your devices
COURSE OUTCOMES:
CO No. Outcomes Bloom’s
Taxonomy
Level
Explain the implementation of industrial processes, specialized L4
CO1 control devices and protocols
CO2 Connect basic sensors to AWS IoT, Azure IoT, OEM IoT, Google IoT L5
platforms and extract this data from the cloud itself to your
devices

COURSE CONTENT:
MODULE 1 9Hrs
Introduction to Industrial IoT, IoT Key Technologies, IoT and I-IoT – Similarities and
Differences, Industry Environments and Scenarios covered by I-IoT, Industrial Process and
Devices

MODULE 2 9Hrs
CIM Pyramid – CIM Pyramid Architecture – Devices and Networks, I-IoT Data Flow –
Measurements and the Actuator Chain, Controllers, Industrial Protocols, Supervisory Control
and Data Acquisition (SCADA)

MODULE 3 9Hrs
Implementing the Industrial IoT Data Flow, Discovering OPC, IoT Edge versus the I-IoT Edge,
I-IoT Data Sources and Data Gathering, Securing I-IoT Data Flow

MODULE 4 9Hrs
 eveloping I-IoT and Architecture – OSGi, Microservice, Containers and Serverless Computing,
Standard I-IoT Flow, Implementing a Custom Industrial IoT Platform – An Open Source
Platform in Practice, Mosquitto as MQTT Connector, Apache Kafta Overview, Kafta as a
Data Dispatcher

MODULE 5 9Hrs

Apache Cassandra Overview, Storing Time-Series Data on Apache Cassandra, Industrial OEM
Platforms, Predix Platform, MindSphere Platform, Open System Architecture, Overview of
Digital Twin

TEXT BOOKS:
1. Hands-On Industrial Internet of Things- Giacomo Veneri, Antonio Capasso, 2018

2. Industrial Internet of Things: Cyber Manufacturing Systems- Sabina Jeschke, Christian Brecher,
Houbing Song, Danda B. Rawat, Springer), 2017

3. Industrial Internet of Things and Cyber-Physical Systems:

Transforming the Conventional to Digital-Pardeep Kumar, Vasaki
Ponnusamy, Vishal Jain, Advances in Computer and Electrical
Engineering, 2020

4. Sravani Bhattacharjee, Practical Industrial Internet of Things Security: A practitioner's

guide to securing connected industries,2018

5. Cristina Alcaraz, Security and Privacy Trends in the Industrial Internet of Things, 2019

6. Ioana Culic, Alexandru Radovici, Cristian Rusu, Commercial and Industrial Internet of Things
Applications with the Raspberry Pi: Prototyping IoT Solutions,2020

7. Gerardus Blokdyk, Industrial internet of things Standard Requirements,2018