Table V: Credit structure -Semester-V

Course Code Course Teaching Scheme

Credits Assigned
Name (Contact Hours)

Theory Practical Tutorial Theory PR Tutorial Total

Software -
CEC501 03 - - 03 - 03
Engineering
CECDLO501X DLO1 03 - - 03 - - 03
CECDLO502X DLO2 03 - - 03 - - 03
Institute -
Level Open
ILOT501X Elective 03 - - 03 - 03
Technical
ILOT1
Institute -
Level Open
ILON501X Elective Non- 03 - - 03 - 03
Technical
ILON1
Software - -
CEL501 Engineering 02 - - 01 01
Lab
CELDLO501X DLO1 Lab - 02 - - 01 - 01
CELDLO502X DLO2 Lab - 02 - - 01 - 01
Professional - -
CEL502 Communicati 04 - - 02 02
on and Ethics
Skill Based - -
CESL501 Lab III – 02 - - 01 01
Python
Mini Project - -
CEMP501 04 - 02 02
III
Financial -
*HBSO501 accounting - - - - - 01*
(online)
Total 15 16 - 15 08 - 23
 Table V: Evaluation Scheme: Semester-V

Exam OR
Course Code Course Name IA1 IA2 AVG MSE ESE TW PR Total
Hrs
Software - - -
CEC501 20 20 20 20 60 02 100
Engineering
CECDLO501X DLO1 20 20 20 20 60 02 - - - 100
CECDLO502X DLO2 20 20 20 20 60 02 - - - 100
Institute Level - - -
Open Elective
ILOT501X 20 20 20 20 60 02 100
Technical
ILOT1
Institute Level - - -
Open Elective
ILON501X 20 20 20 20 60 02 100
Non-
Technical
ILON1
Software - - - - - -
CEL501 Engineering 25 25 - 50
Lab
CELDLO501X DLO1 Lab - - - - - - 25 - 25 50
CELDLO502X DLO2 Lab - - - - - - 25 - 25 50
Professional - - - - - -
CEL502 Communicatio 25 - 25 50
n and Ethics
Skill Based - - - - - -
CESL501 Lab III – 25 25 - 50
Python
Mini Project - - - - - -
CEMP501 25 - 25 50
III
Total 800
 Table VI: Semester V Elective List

Elective Course Code Course name

CECDLO5011 Microprocessor and Microcontroller

CECDLO5012 Advanced Database Management

CECDLO5013 Computer Graphics

CECDLO5014 Cloud Computing

CECDLO5021 Advanced Algorithms

Statistical Data Analytics
CECDLO5022

CECDLO5023 Digital Signal and Image Processing

CECDLO5024 Advanced Computer Network

 Table VII: Credit structure -Semester-VI

Course Teaching Scheme

Course Code Credits Assigned
Name (Contact Hours)
PR/
Theory Practical Tutorial Theory Tutorial Total
OR
Machine - -
CEC601 03 - 03 - 03
Learning
CECDLO603X DLO3 03 - - 03 - - 03
CECDLO 604X DLO4 03 - - 03 - - 03
Institute
Level Open
ILOT602X Elective 03 - - 03 - - 03
Technical
ILOT2
Machine - - - -
CEL601 02 01 01
Learning Lab
CELDLO603X DLO3 Lab - 02 - - 01 - 01
CELDLO604X DLO4 Lab - 02 - - 01 - 01
Skill Based
CESL601 Lab IV – - 04 - - 02 - 02
DevOPs
Mini Project
CEMP601 - 04 - - 02 - 02
IV
Economics
*HBSO601 for Manager - - - - - - 01*
(online)
Total 12 14 - 12 07 - 19
 Table VI: Evaluation Scheme: Semester-VI

Course Exam PR/

Course Code IA1 IA2 AVG MSE ESE TW Oral Total
Name Hrs OR
Machine
CEC601 20 20 20 20 60 02 100
Learning
CECDLO603X DLO3 20 20 20 20 60 02 100
CECDLO604X DLO4 20 20 20 20 60 02 100
Institute
Level Open
ILOT602X Elective 20 20 20 20 60 02 100
Technical
ILOT2
Machine
CEL601 Learnin 25 25 50
g Lab
CELDLO603X DLO3 Lab 25 25 50

CELDLO604X DLO4 Lab 25 25 50

Skill Based
CESL601 Lab IV – 25 25 50
Devops
Mini
CEMP601 25 25 50
Project IV
Total 650
 Table VIII: Semester VI Elective List
Elective Course Code Course Name

CECDLO6031 Compiler Design

CECDLO6032 Data Warehousing and Mining

CECDLO6033 Computer Vision

CECDLO6034 Cryptography and Network

Security
CECDLO6041 Mobile Computing

CECDLO6042 Artificial Intelligence

CECDLO6043 Augmented Reality / Virtual Reality

CECDLO6044 Cyber Security

Semester V
 Theory Practical Tutorial Theory Practical/Oral Tutorial Total
Hrs Hrs Hrs Credit Credit Credits Credits
CEC501 Software
03 - - 03 - - 03
Engineering

Examination Scheme

Term
Theory Marks Practical Oral Total
Work
Course Course
Code Name In-Sem Evaluations
End
Mid Sem
IA1 IA2 AVG Sem Exam
Exam

Software
CEC501 20 20 20 20 60 - - - 100
Engineering

Course Objectives:

1. To introduce fundamentals of software engineering including requirement

specifications, software design, testing and maintenance.
2. To present software engineering methodologies for the development of quality, cost
effective, schedule- meeting software.

Course Outcomes: At the end of the course learner will able to

1. Comprehend software development life cycle.

2. Construct/Compose SRS document for a SEP (software engineering project).
3. Plan, Schedule and Track SEP.
4. Apply design and development techniques to the SEP.
5. Explore SCM, SQA and RMMM plan for SEP.
6. Understand ethical and professional issues related to Software Project Delivery.

Prerequisites:

1. Web Programming
Sr. Detailed Content CO
Module Hours
No. Mapping

Evolving role of software, Type of

Software,
1 Software Process SW Components:4 Ps (Process, People,
Models Project, Product),
SDLC methods/models: Build & Fix,
Waterfall, Prototype (Evolutionary &
6 CO1
Throw-away), V model, Incremental
iterative, Spiral, RAD.
Introduction to agility, agile process
models: Scrum, Kanban, Extreme
Programming
Introduction to Devops

Industry Requirement elicitation, Software

8 CO2
Requirements: requirement specification (SRS),
2
Analysis and Dataflow (DFD) Diagram, Data
Specification dictionaries, UML diagrams

Project planning and Project

scheduling. Software Metrics: Size
3 Software Project 5 CO3
Metrics like LOC, Token Count,
planning and
Function Count. Cost estimation using
management
models like COCOMO. The
management spectrum

Design concepts and principles:

8 CO4
Effective modular design Cohesion
4 Software Design
and Coupling, UML diagrams, design
model, Data designing, Architectural
styles and design, User interface
design, Component level design

Reliability issues, Reliability metrics,

Software
reliability models, SQA, ISO 9000
Configuration
5 certification for software industry, 6 CO5
Management,
Software Risk identification, Risk
Quality Assurance
projection, Risk refinement, RMMM
and Risk
plans, Software Configuration
management
Management
 Software testing techniques
Testing for specialized environment,
Software testing and
6 Software maintenance and its types, 6 CO6
maintenance
Software Re-engineering,
Reverse-engineering.

Text Books:
1. R. S. Pressman and Bruce Maxim, “Software Engineering – A practitioner’s approach”,
McGraw Hill 9th Edition, 2020.
2. Ian Sommerville, “Software Engineering”, Pearson Education (10th edition).

Reference Books:
1. Hans Van Vliet, “Software Engineering: Principles and Practice” Wiley, 3rd Edition.
2. Bernd Bruegge, Allen H. Dutoit, “Object-Oriented Software Engineering using UML
Patterns and Java”, (2e), Pearson Publication, 2011.
3. Ivar Jacobson, Grady Booch, James Rumbaugh, “The Unified Development Process”,
Pearson.
4. Pankaj Jalote, "An integrated approach to Software Engineering", Springer/Narosa.
5. Jennifer Davis, Katherine Daneils, “Effective Devops: Building a culture of
collaboration, affinity, and tooling at scale”, O’Reilly Publications.

Evaluation Scheme:
3. In-Semester Assessment:
• Assessment consists of two Internal Assessments (IA1, IA2) out of which; one should
be compulsory class test (on minimum 02 Modules) and the other is a class test /
assignment on case studies / course project.
• Mid Semester Examination (MSE) will be based on 40-50% of the syllabus.

4. End-Semester Examination:
• Question paper will comprise of full syllabus.
• In the question paper, weightage of marks will be proportional to the total number of
lecture hours as mentioned in the syllabus.
 Practical/
Theory Practical Tutorial Theory Tutorial Total
Oral
Hrs Hrs Hrs Credit Credits Credits
Credit
Microprocessor
CECDLO
and 03 - - 03 - - 03
5011
Microcontrolle

Examination Scheme
Term Practical
Theory Marks Oral Total
Work & Oral
Course Code Course Name
In-Sem Evaluations End
Mid Sem
IA1 IA2 AVG Sem
Exam
Exam

Microprocessor
CECDLO5011 and 20 20 20 20 60 – – - 100
Microcontroller

Course Objectives:

1. To adequate students with fundamental knowledge and basic technical concepts of

microprocessor and microcontroller.
2. To familiarize the instruction set and logic of assembly language programming.
3. To appraise the architecture of advanced processor and embedded system.

Course Outcomes: At the end of the course learner will able to

1. Adequate students with fundamental knowledge and basic technical concepts of

microprocessors.
2. Familiarize the instruction set and logic of assembly language programming.
3. Design an 8086 based system using memory and peripherals chips.
4. Adequate student with fundamental knowledge and basic technical concepts of
8051Microcontroller.
5. Familiarize the instruction set and logic 8051 programming in embedded C.
6. Describe the concepts of 8051 interfacing and its applications.
Prerequisites:

1. Computer Organization and Architecture

Sr. Module Detailed Content CO

Hours
No. Mapping

Introduction to 8086 architecture- functional diagram,

8086 Register organization, memory
Microprocessor segmentation, programming model,
1 Memory addresses, physical memory 06 CO1
organization, Signal descriptions of 8086-
common function signals, timing diagrams,
Interrupts of 8086.

Assembly Instruction formats. Addressing modes,

Language instruction set, assembler directives.
Programming Macros, Simple programs involving logical,
2 06 CO2
branch and call instructions. Sorting,
evaluating arithmetic expressions, string
manipulations.

Interfacing of Memory interfacing to 8086, Interrupts of

8086 with 8086, Vector interrupt table, Interrupt
3 08 CO3
memory and service routine, 8255 PPI, various modes of
I/O operation and interfacing to 8086

Introduction to Introduction, Microprocessor and

8051 Microcontrollers, Introduction, 8051
Microcontroller Microcontroller hardware, input / output
4 06 CO4
pins, Ports and circuits, External Memory,
Timers, Serial Communication and
Interrupts. addressing Modes

8051 Data types and time delays in 8051C, I/O

Programming programming, logic operations, data
in embedded C conversion programs, accessing code ROM
5 space, data serialization. Timer/Counter 06 CO5
Programming in 8051: Programming 8051
Timers in C, Counter Programming timers 0
and 1 in 8051 C

8051 Interfacing 8051 to LCD, ADC, DAC,

6 Interfacing and stepper motor interfacing and DC motor 07 CO6
Applications interfacing and PWM
 Text Books:

1. Barry B. Brey, “Intel Microprocessors”, 8th Edition, Pearson Education India.

2. K M Bhurchandani, A k Ray, “Advanced Microprocessors and Peripherals”, McGraw
Hill.
3. Muhammad Ali Mazidi and Janice Gillespie Mazidi and Rollin D. McKinlay, “The
8051 Microcontroller and embedded systems – using assembly and C”, Prentice Hall
India, Pearson.
4. Kenneth Ayala, “The 8051 Microcontroller”, Thomson Delmar Learning, 3rd Edition.

Reference Books:

1. Douglas Hall, “Microprocessor and Interfacing”, Tata McGraw Hill.

2. John Uffenbeck, “8086/8088 family: Design Programming and Interfacing”, PHI.
3. Predko, “Programming and customizing the 8051-micro controller”, Tata McGraw
Hill.
4. Frank Vahid, Tony Givargis, “Embedded System design”, John Wiley, 2002.
5. Michael J. Pont, “Embedded C”, Pearson Education, 2002.

Evaluation Scheme:
1. In-Semester Assessment:
• Assessment consists of two Internal Assessments (IA1, IA2) out of which; one should
be compulsory class test (on minimum 02 Modules) and the other is a class test /
assignment on case studies / course project.
• Mid Semester Examination (MSE) will be based on 40-50% of the syllabus.

2. End-Semester Examination:
• Question paper will comprise of full syllabus.
• In the question paper, weightage of marks will be proportional to the total number of
lecture hours as mentioned in the syllabus.
 Practical/
Theory Practical Tutorial Theory Tutorial Total
Oral
Hrs Hrs Hrs Credit Credits Credits
Credit

Advanced
CECDLO5012 03 - - 03 - - 03
Databases

Examination Scheme

Term
Theory Marks Practical Oral Total
Work
Course
Course Code In-Sem Evaluations
Name
End
Mid Sem
IA1 IA2 AVG Sem Exam
Exam

Advanced
CECDLO5012 20 20 20 20 60 - - - 100
Databases

Course objectives:

1. To understand the use of object relational database using Procedural Language - SQL (PL-
SQL).
2. To provide insights into distributed and parallel database designing.
3. To learn about the trends in advance databases.
4. To learn advanced representations of databases suited for real-time applications.

Course Outcomes: On successful completion of course, learner will be able to

1. Design and Query database using object relational database concepts.

2. Compare different types of NoSQL databases.
3. Design parallel database using the various techniques for query processing.
4. Design distributed database using the various techniques for query processing.
5. Understand and Analyze the concept of graph based using case studies.
6. Describe various trends in advance databases through temporal and spatial based
databases.

Prerequisites:

1. Data Structure
2. Database Management System
Sr. Detailed Content CO
Module Hours
No. Mapping

Object-based databases – Complex data

Introduction types, structured types and inheritance in
to Object SQL, table inheritance, array and multiset
1 based types in SQL, object identity and reference 06 CO1
Relational types in SQL, implementing O-R features,
Databases Persistent programming languages, OO vs
OR.

NoSQL database concepts: NoSQL data

modeling, Benefits of NoSQL, comparison
between SQL and NoSQL database system.
Introduction
Types of NoSQL databases: Key-value data
2 to NoSQL 07 CO2
store, Document database and Column
Databases
Family Data store, Comparison of NoSQL
databases w.r.t CAP theorem and ACID
properties.

Introduction, Parallel database architecture,

speedup, scale-up I/O parallelism, Inter-
query and Intra-query parallelism, Inter-
Introduction operational and Intra-operational
3 to Parallel parallelism, parallel query evaluation, 06 CO3
Databases Design of parallel systems, Implementation
issues of Parallel query evaluation, Design of
parallel systems, Comparison of Inter-query
and Intra-query parallelism.

Distributed Databases, Study of DDBMS

architectures, Comparison of Homogeneous
and Heterogeneous Databases, Data
Fragmentation, Replication and Allocation
Introduction Techniques for Distributed Database Design.
to Implementation of Distributed query
4 08 CO4
Distributed processing. Distributed Concurrency
Databases Control- Taxonomy, Locking based, Basic
TO algorithm,
Recovery in Distributed Databases: Failures
in distributed database, 2PC and 3PC
protocol.
 Graph Database:
Introduction
Introduction, Features, Transactions,
5 to Graph 06 CO5
consistency, Availability, Querying, Case
Databases
Study Neo4J

Temporal database: Concepts, time

Introduction representation, time dimension,
to Temporal incorporating time in relational databases.
6 06 CO6
and Spatial Spatial database :
Databases Introduction, data types, models, operators
and queries

Text Books:

1. G. K. Gupta, “Database Management Systems”, McGraw Hill.

2. Korth, Slberchatz, Sudarshan, “Database System Concepts”, 6th Edition, McGraw –
Hill
3. Elmasri and Navathe, “Fundamentals of Database Systems”, 5th Edition, Pearson
Education.
4. Ozsu, M. Tamer, Valduriez, Patrick, “Principles of Distributed Database Systems”, 3rd
Edition, Pearson Education.

Reference Books:
1. P. S. Deshpande, “SQL and PL/SQL for Oracle 10g, Black Book”, Dreamtech Press.
2. Gillenson, Paulraj Ponniah, “Introduction to Database Management”, Wiley
Publication.
3. Shashank Tiwari, “Professional NOSQL”, John Willy & Sons. Inc.
4. Raghu Ramkrishnan and Johannes Gehrke, “Database Management Systems”,TMH.

Evaluation Scheme:
1. In-Semester Assessment:
• Assessment consists of two Internal Assessments (IA1, IA2) out of which; one should
be compulsory class test (on minimum 02 Modules) and the other is a class test /
assignment on case studies / course project.
• Mid Semester Examination (MSE) will be based on 40-50% of the syllabus.

2. End-Semester Examination:
• Question paper will comprise of full syllabus.
• In the question paper, weightage of marks will be proportional to the total number of
lecture hours as mentioned in the syllabus.
 Theo Tutori
Theor Practic Tutori Practic Total
ry al
y al al al/Oral Credi
Credi Credit
Hrs Hrs Hrs Credit ts
t s
Comput
CECDLO5 er
3 - - 3 - - 3
013 Graphic
s

Examination Scheme
Term Practic
Ora Tota l
Theory Marks Wor al &
l
Course Course k Oral
Code Name In-Sem Evaluations End
Mid Sem
IA AV Sem
IA1 Exa
2 G Exa
m
m
Compute
CECDL
r 20 20 20 20 60 - - - 100
O5013
Graphics

Course Objectives:

1. To equip students with the fundamental knowledge and basic technical

competence in the field of Computer Graphics.
2. To emphasize on implementation aspect of Computer Graphics algorithms.
3. To prepare the student for advance areas and professional avenues in the field of
Computer Graphics.

Course Outcomes: At the end of the course learner will able to

1. Describe the basic concepts of Computer Graphics.

2. Demonstrate various algorithms for basic graphics primitives.
3. Apply 2-D geometric transformations on graphical objects.
4. Use various Clipping algorithms on graphical objects.
5. Apply 3-D geometric transformations, curve representation techniques and
projections methods.
6. Explain visible surface detection techniques and animation.

Prerequisites:

1. C Programming
2. Engineering Mathematics:

Sr. CO
Module Detailed Content Hours
No. Mapping
Definition and Representative uses of computer
Introduction graphics, Overview of coordinate system,
1 and Overviewof Definition of scan conversion, Rasterization and
Graphics Rendering. Raster scan & Random scan
03 CO1
System: displays, Architecture of Raster graphics system
with display processor, Architecture of Random
scan systems.

Scan conversions of point, line, circle and

Output ellipse: DDA algorithm and Bresenham
2
Primitives algorithm for line drawing, midpoint algorithm
for circle, midpoint algorithm for ellipse
drawing (Mathematical derivation for above
algorithms is expected)
Aliasing, Antialiasing techniques like Pre and 12 CO2
post filtering, super sampling, and pixel
phasing).
Filled Area Primitive: Scan line Polygon Fill
algorithm, inside outside tests, Boundary Fill
and Flood fill algorithm.

Two Basic transformations: Translation, Scaling,

Dimensional Rotation Matrix representation and
3
Geometric Homogeneous Coordinates Composite
4 CO3
Transformations transformation, other transformations:
Reflection and Shear

Two- Dimensiona Viewing transformation pipeline and Window to

Viewing and Viewport coordinate transformation
4 Clipping operations: Point clipping, Line clipping
Clipping
algorithms: Cohen-Sutherland, Liang: Barsky,
6 CO4
Polygon Clipping
Algorithms: Sutherland- Hodgeman, Weiler-
Atherton.

5 3D Transformations: Translation, 8 CO5

Three
Rotation, Scaling and Reflection.
 Dimensional Composite transformations: Rotation about an
Geometric arbitrary axis Projections – Parallel,
Transformations Perspective. (Matrix
Representation)
ns, Curves and
Bezier Curve, B-Spline Curve, Fractal-
Fractal
Geometry:Fractal Dimension, Koch Curve,
Generation
Hilbert Curve
Visible Surface Detection: Classification of
Visible Surface Detection algorithm, Back Surface
detection method, Depth Buffer method, Area
Visible Subdivision method Animation: Introduction to
6 Surface Animation, Traditional Animation Techniques, 6 CO6
Detection and Principles of Animation, Key framing: Character
Animation and Facial Animation, Deformation, Motion
capture

Text Books:

1. Hearn & Baker, “Computer Graphics C version”, 2nd Edition, Pearson Publication.
2. James D. Foley, Andries van Dam, Steven K Feiner, John F. Hughes, “Computer Graphics
Principles and Practice in C”, 2nd Edition, Pearson Publication.
3. Samit Bhattacharya, “Computer Graphics”, Oxford publication.

Reference Books:

1. D. Rogers, “Procedural Elements for Computer Graphics”, Tata McGraw-Hill Publications.

2. Zhigang Xiang, Roy Plastock, “Computer Graphics”, Schaum‟s Outlines McGraw-Hill
Education.
3. Rajesh K. Maurya, “Computer Graphics”, Wiley India Publication.
4. F. S. Hill, “Computer Graphics using OpenGL”, Third edition, Pearson Publications.

Evaluation Scheme:
1 In-Semester Assessment:
● Assessment consists of two Internal Assessments (IA1, IA2) out of which; one should
be compulsory class test (on minimum 02 Modules) and the other is a class test /
assignment on case studies / course project.
● Mid Semester Examination (MSE) will be based on 40-50% of the syllabus.

2 End-Semester Examination:
● Question paper will comprise of full syllabus.
● In the question paper, weightage of marks will be proportional to the total number of
lecture hours as mentioned in the syllabus
 Practical/
Theory Practical Tutorial Theory Tutorial Total
Oral
Hrs Hrs Hrs Credit Credits Credits
Credit
Cloud
CECDLO5014 Computing 03 - - 03 - - 03

Examination Scheme
Term Practical
Theory Marks Oral Total
Course Course Work & Oral
Code Name In-Sem Evaluations End
Mid Sem
IA1 IA2 AVG Sem
Exam
Exam
Cloud
CECDLO
Computing 20 20 20 20 60 - - - 100
5014

Course Objectives:

1. Differentiate between on-premises, hybrid-cloud, and all-in cloud.

2. Describe the basic global infrastructure of the AWS Cloud.
3. Understand the networking and security components in cloud environment.
4. Understand the database as a service.
5. Use of monitoring service.

Course Outcomes: At the end of the course learner will able to

1. Identify the benefits of cloud computing models with traditional IT infrastructure with
different cloud service providers.
2. Apply the concept of SAAS, PAAS and IAAS and create EC2 instances with S3 as a
storage.
3. Use different database services and AWS Elastic BeansTalk to design real time
application.
4. Design a VPC with rounding table, subnets and NAT gateway.
5. Design and apply security on cloud.
6. Analyze monitoring services for pricing alters.

Prerequisites:

1. Computer Network
2. Operating System
Sr. CO
Module Detailed Content Hours
No Mapping

Cloud components, Essential

characteristics, Comparing cloud providers 4 CO1
with traditional IT service providers, Cloud
Cloud Overview scenarios – Benefits: scalability ,simplicity
1 ,vendors ,security, Limitations,Service
& Insights
providers, challenges and risks in cloud
adoption , cloud computing titans: Google,
Amazon, Microsoft

Layers in cloud architecture, Software as a

Service (SaaS), features and benefits, 6 CO2
Platform as a Service
( PaaS ), features and benefits,
Cloud Infrastructure as a Service ( IaaS), features
2 Architecture and benefits, Amazon Elastic cloud
and Storage Compute(EC2) Cloud Storage and its
providers, Amazon Simple Storage
Service(S3), Cloud Storage and its
providers

Key advantages of Database as a service

offerings, Amazon Dynamo DB, Amazon 5 CO3
Database as
3 Elastic Cache - Redis/MemCache,
a Service
Elastic Beanstalk Service

Hardware and Infrastructure, Clients ,

Advanced Networking Basics, VPC, VPC 10 CO4
computing Networking, Route 53, CloudFront Service
4
solutions & Elastic Load Balancing.
Networking Containers and Container Orchestration

Basic concepts, AWS IAM user, group,

role, policy, Security token services (STS), 10 CO5
Single Sign-on (SSO), Design Key
Cloud management & its use, data encryption
5
Security solution for data at rest and data in transit,
Troubleshoot key management. VPC
Security,
 Need for Monitoring and Alarms in Cloud
ecosystem, Overview to Cloud pricing 4 CO6
Monitoring
6 models and alerts Cloud Config and
and Pricing
CloudWatch Services,

Text Books

1. Anthony T. Velte, Toby J. Velte, Robert Elsenpeter, “Cloud Computing: A Practical

Approach”, McGraw Hill Publication.

Reference Books

1. Joe Baren, Hisham Baz, Tim Bixler, Biff Gaut, Kevin E. Kally, Sean Senior, John
Stamper, “AWS Certified solutions Architect : Official Study Guide”, Sybex
publications.

Evaluation Scheme:
1. In-Semester Assessment:
• Assessment consists of two Internal Assessments (IA1, IA2) out of which; one should
be compulsory class test (on minimum 02 Modules) and the other is a class test /
assignment on case studies / course project.
• Mid Semester Examination (MSE) will be based on 40-50% of the syllabus.

2. End-Semester Examination:
• Question paper will comprise of full syllabus.
• In the question paper, weightage of marks will be proportional to the total number of
lecture hours as mentioned in the syllabus.
 Practical/
Theory Practical Tutorial Theory Tutorial Total
Oral
Hrs Hrs Hrs Credit Credits Credits
Credit

Advanced
CECDLO5021 03 - - 03 - - 03
Algorithms

Examination Scheme
Term
Theory Marks Practical Oral Total
Course Work
Course Code
Name In-Sem Evaluations
End
Mid Sem
IA1 IA2 AVG Sem Exam
Exam
Advanced
CECDLO5021 20 20 20 20 60 - - - 100
Algorithms

Course Objectives:

1. To provide mathematical approach for Analysis of Algorithms.

2. To explore advanced data structures.
3. To solve complex problems in real life applications.

Course Outcomes: At the end of the course learner will able to

1. Describe analysis techniques for algorithms.

2. Identify appropriate data structure and design techniques for different problems.
3. Understand and apply dynamic programming for various graph-based algorithms.
4. Appreciate the role of probability and randomization in the analysis of algorithm.
5. Analyze various algorithms.
6. Differentiate polynomial and non deterministic polynomial algorithms.

Prerequisites:

1. Data structure
2. Discrete Structures
3. Analysis of Algorithm
 Sr. CO
Module Detailed Content Hours
No. Mapping

Introduction- Complexity-
complexity of recursive
algorithms, finding complexity by
tree method, master method,
Fundamental of proving technique (contradiction, CO1
1 mathematical induction). 07
Algorithms
Amortized analysis- aggregate
analysis, accounting analysis,
potential analysis dynamic tables

Introduction to trees and heap

Red-Black Trees: properties
of red-black trees , Operations on
2 Advanced Data Red-black trees 07 CO2
Structure Binomial Heaps: Binomial trees
and binomial heaps, Operation on
Binomial heaps.
Analysis of all above operations
Matrix Chain Multiplication,
Dynamic
3 Cutting Rod Problem, Johnson’s 05 CO3
Programming and
All Pair, Shortest Path Algorithm,
Graph Algorithms
Topological Sorting
Probabilistic The hiring problem Indicator
Analysis and random variables Randomized
4 07 CO4
Randomized algorithms Probabilistic analysis
Algorithm and further uses of indicator
random variable
Flow networks , the ford
Fulkerson method ,max bipartite
5 07 CO5
Maximum Flow matching , push Relabel
Algorithm , The relabel to front
algorithm
NP-Completeness: NP-
NP-Completeness and Completeness and reducibility,
6 Approximation NP- Completeness proofs, NP- 06 CO6
Algorithms Complete problems-The vertex-
cover problem, The travelling
salesman problem

Text Books:
1. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein,
“Introduction to Algorithms”, PHI, India, Second Edition.
 2. Horowitz, Sahani and Rajsekaran, “Fundamentals of Computer Algorithms”, Galgotia.
3. Harsh Bhasin, “Algorithms – Design and Analysis”, Oxford, 2015.

Reference Books:
1. Rajeev Motwani, Prabhakar Raghavan, “Randomized Algorithm”, Cambridge
University.
2. S. K. Basu, “Design Methods and Analysis of Algorithm”, PHI.
3. Vijay V. Vajirani, “Approximation Algorithms”, Springer.

Evaluation Scheme:
1. In-Semester Assessment:
• Assessment consists of two Internal Assessments (IA1, IA2) out of which; one should
be compulsory class test (on minimum 02 Modules) and the other is a class test /
assignment on case studies / course project.
• Mid Semester Examination (MSE) will be based on 40-50% of the syllabus.

2. End-Semester Examination:
• Question paper will comprise of full syllabus.
• In the question paper, weightage of marks will be proportional to the total number of
lecture hours as mentioned in the syllabus.
 Practical/
Theory Practical Tutorial Theory Tutorial Total
Oral
Hrs Hrs Hrs Credit Credits Credits
Credit
Statistical
CECDLO5022 Data 3 - - 3 - - 3
Analytics

Examination Scheme
Term
Theory Marks Practical Oral Total
Course Work
Course Code In-Sem Evaluations
Name End
Mid
Sem
IA1 IA2 AVG Sem
Exam
Exam
Statistical
CECDLO5022 Data 20 20 20 20 60 - - - 100
Analytics

Course Objectives:
1. To understand descriptive analysis of multivariate data.
2. To comprehend techniques for correlation.
3. To understand data reduction techniques.
4. To draw inference using statistical methods.

Course Outcomes: At the end of the course learner will able to,

1. Understand descriptive statistics of raw data.

2. Analyze multivariate data using regression methods.
3. Identify correlation between data.
4. Explore various reduction techniques.
5. Apply various tests of significance.
6. Apply testing of hypotheses.

Prerequisites:
1. Data Base Management System
2. Engineering Mathematics
 Sr. CO
Module Detailed Content Hours
No. Mapping
Introduction to Statistics, Collection of data,
classification and tabulation of data, Types of
Descriptive data, Presentation of data, Diagrammatic and
1 06 CO1
Statistics Graphical Representation, Measures of
Central Tendency and Dispersion, Means of
transformed data
Bivariate normal distribution, Multivariate
2 Regression Normal Distribution, Conditional 07 CO2
Distribution, Multiple Linear Regression
Model, Multivariate Regression
Methods of measuring correlation-scatter
diagram, Karl Pearson’s Coefficient of
3 Correlation Correlation and Spearman’s rank 07 CO3
Correlation, Multivariate Analysis of
variance and covariance
Reduction
4 LDA,PCA,ICA and Factor Analysis 08 CO4
Techniques
Sampling
Methods of sampling, stratified random
theory and
5 sampling, systematic sampling. Tests of 06 CO5
tests of
significance – z, t, chi-square and F.
significance
Null and Alternative hypotheses. Types of
Tests of
6 errors. Neyman-Pearson lemma-MP and 05 CO6
hypotheses
UMP tests.

Text Books:
1. Johnson and Wichern, “Applied Multivariate Statistical Analysis”, Pearson, Sixth
Edition.
2. B. L. Agarwal, “Basic Statistics”, Wiley Eastern Ltd., New Delhi, 2006.
3. T.W. Anderson, “An Introduction to Multivariate Statistical Analysis”, Wiley, Third
Edition.

Reference Books:
1. S. P. Gupta, “Statistical Methods”, Sultan Chand & Sons, New Delhi, 2011.
2. G James, D. Witten, T Hastie, and R. Tibshirani, “An Introduction to Statistical
Learning: with Applications R”, Springer, 2013.

Evaluation Scheme:
1. In-Semester Assessment:
● Assessment consists of two Internal Assessments (IA1, IA2) out of which; one should
be a compulsory class test (on minimum 02 Modules) and the other is a class test /
assignment on case studies / course project.
● Mid Semester Examination (MSE) will be based on 40-50% of the syllabus.

2. End-Semester Examination:
● Question paper will comprise a full syllabus.
● In the question paper, weightage of marks will be proportional to the total number of
lecture hours as mentioned in the syllabus
 Practical/
Theory Practical Tutorial Theory Tutorial Total
Oral
Hrs Hrs Hrs Credit Credits Credits
Credit
Digital
Signal and
CECDLO5023 3 - - 3 - - 3
Image
Processing

Examination Scheme
Term Practical
Theory Marks Oral Total
Course Work & Oral
Course Code
Name In-Sem Evaluations End
Mid Sem
IA1 IA2 AVG Sem
Exam
Exam
Digital
Signal and
CECDLO5023 20 20 20 20 60 - - - 100
Image
Processin

Course Objectives:

1. To understand the fundamental concepts of digital signal processing and image

processing.
2. To explore DFT for 1-D and 2-D signal and FFT for 1-D signal.
3. To apply processing techniques on 1-D and image signals.
4. To apply digital image processing techniques for edge detection.

Course Outcomes: At the end of the course learner will able to

1. Understand the concept of DT Signal and DT Systems.

2. Illustrate Discrete Fourier Transform and Fast Fourier Transform Techniques.
3. Explore Cosine and Wavelet transform and their applications.
4. Perceive fundamentals of digital image processing and image representation
techniques.
5. Apply and compare spatial domain image enhancement techniques.
6. Apply various image segmentation methods and analyse their appropriateness in real
world applications.

Prerequisites:

1. Engineering Mathematics
Sr. CO
Module Detailed Content Hours
No. Mapping
Introduction to Digital Signal Processing,
Sampling and Reconstruction, Standard DT
Discrete- Signals, Signal Manipulations (shifting,
Time Signal reversal, scaling, addition, multiplication),
and Classification of Discrete-Time Signals, LTI
1 7 CO1
Discrete- System
Time System
Linear Convolution formulation for 1-D and
2-D signal, Circular Convolution, Linear
convolution using Circular Convolution. Auto
and Cross Correlation formula evaluation
Introduction to DTFT, DFT, Relation between
DFT and DTFT, IDFT
Properties of DFT (Scaling and Linearity,
Periodicity, Time Shift and Frequency Shift,
Time Reversal, Convolution Property and
Parseval’s Energy Theorem). DFT
Fourier computation using DFT properties.
2 Transform 8 CO2
Transfer function of DT System in frequency
domain using DFT. Linear and Circular
Convolution using DFT, Introduction to 2-D
DFT
Need of FFT, Radix-2 DIT-FFT algorithm,
DIT-FFT, DIF-FFT, Flow graph for N=4 and
8, Inverse FFT algorithm.
Other
Introduction to transform functions, Cosine
3 Transforms 4 CO3
Transform and Wavelet transform

Introduction to Digital Image, Digital Image

Digital Image
processing System, Sampling and
4 Fundamentals 4 CO4
Quantization,
Representation of Digital Image, Connectivity
Gray Level Transformations, Zero Memory
Point Operations, Histogram Processing,
Histogram equalization.
Image
5 Neighborhood Processing, Spatial Filtering, 8 CO5
Enhancement
Smoothing and Sharpening Filters, Median
Filter, Image enhancement in frequency
domain
 Segmentation based on Discontinuities (point,
Line, Edge)
Image Image Edge detection using Robert, Sobel,
6 Segmentation Prewitt masks, Image Edge detection using 8 CO6
Laplacian Mask
Segmentation based on similarities- Region
Growing, Merging

Text Books:

1. John G. Proakis, Dimitris and G. Manolakis, “Digital Signal Processing: Principles,

Algorithms, and Applications”, 4th Edition 2007, Pearson Education.
2. Anil K. Jain, “Fundamentals and Digital Image Processing”, Prentice Hall of India
Private Ltd, 3rd Edition.
3. Rafel C. Gonzalez and Richard E. Woods, “Digital Image Processing”, Pearson
Education Asia, 3rd Edition, 2009.

Reference Books:

1. Sanjit Mitra, “Digital Signal Processing: A Computer Based Approach”, TataMcGraw

Hill, 3rd Edition.
2. S. Salivahanan, A. Vallavaraj, and C. Gnanapriya, “Digital Signal Processing”, Tata
McGraw Hill Publication 1st Edition (2010).
3. A. Anand Kumar, “Digital Signal Processing”, PHI Learning Pvt. Ltd. 2013.
4. S. Jayaraman, E. Esakkirajan and T. Veerkumar, “Digital Image Processing”,
TataMcGraw Hill Education Private Ltd, 2009.
4. S. Sridhar, “Digital Image Processing”, Oxford University Press, Second Edition, 2012.

Evaluation Scheme:
1 In-Semester Assessment:
● Assessment consists of two Internal Assessments (IA1, IA2) out of which; one should
be compulsory class test (on minimum 02 Modules) and the other is a class test /
assignment on case studies / course project.
● Mid Semester Examination (MSE) will be based on 40-50% of the syllabus.

2 End-Semester Examination:
● Question paper will comprise of full syllabus.
● In the question paper, weightage of marks will be proportional to the total number of
lecture hours as mentioned in the syllabus
 Practical/
Theory Practical Tutorial Theory Tutorial Total
Oral
Hrs Hrs Hrs Credit Credits Credits
Credit

Advanced
CECDLO5024 Computer 03 - - 03 - - 03
Network

Examination Scheme
Term Practical
Theory Marks Oral Total
Course Work & Oral
Course Code
Name In-Sem Evaluations End
Mid Sem
IA1 IA2 AVG Sem
Exam
Exam

Advanced
CECDLO5024 Computer 20 20 20 20 60 - - - 100
Network

Course Objectives:
1. To make learners aware about advances in computer networking technologies.
2. To give overview of advance Internet, QoS based and management protocols.
3. To introduce issues related to traffic engineering and capacity planning.

Course Outcomes: At the end of the course learner will able to

1. Demonstrate the understanding of fundamental network concepts.
2. Explore switching concepts used in packet forwarding.
3. Apply advanced routing concepts in latest network environments.
4. Employ various technologies and protocols to manage the network.
5. Design networks to solve the enterprise network issues.
6. Analyze the flexibility and scalability of using SDN in terms of innovation and network
management.

Prerequisites:

1. Computer Networks
Sr. Detailed Content CO
Module Hours
No. Mapping

1 Introduction Introduction to Routing and Switching 4 CO1

Before Layer 2 Switching, Switching Services,

Layer 2
2 Spanning Tree Protocol (STP), LAN Switch- 5 CO2
Switching
Types.

Intra and interdomain routing; Unicast Routing

Protocols: RIP, OSPF, BGP, Multi-protocol
Routing in
Label switching (Fundamentals of Labels, Label
the Internet
3 Stack, VC Merging, Label Distribution Protocol, 10 CO3
and Routing
Explicit routing for Traffic Engineering).
Technique
Introduction to traffic Engineering, IP over
ATM, Multiprotocol Label Switching,

Network Concept, Management Components, SMI, MIB,

4 Management SNMP format, Messages. 6 CO4
& Services

DMZ, NAT, SNAT, DNAT, Port Forwarding,

Proxy, Transparent Proxy, Packet Filtering and
Enterprise
Layer 7 Filtering. Backbone Network Design:
5 Network 8 CO5
Backbone Requirements, Network Capacities
Security
Topologies, Topologies Strategies, Tuning
Network, VPN

Software Defined Network: SDN Implication for

research and innovation, Genesis of SDN,
Characteristics of SDN, SDN Operations, SDN
Introduction Devices, SDN Controllers, SDN Application,
6 6 CO6
to SDN OpenFLow Overview, Network Function
Virtualization: Introduction, Applications,
Network Neutrality: Need, Requirements (e-
Reference from research papers and web)

Text Books:

1. M. A. Gallo and W. M. Hancock, “Computer Communications and Networking

Technologies”, Cengage Learning, 1st Edition.
2. Leon-Garcia, “Communication Networks”, Tata McGraw-Hill.
3. Darren L. Spohn, “Data Network Design”, Tata McGraw-Hill.
4. Behrouz Forouzan, “TCP/IP Protocol Suite”, McGraw-Hill, 5th Edition.
 5. William Stallings, “High-Speed Networks and Internets”, Pearson Education, 2nd
Edition.

Reference Books:

1. Andrew Tanenbaum, “Computer Networks”, Prentice Hall, 5th Edition.

2. Todd Lammle, “Cisco Certified Network Analyst Study Guide”, Wiley Publishing
House, 7th Edition.
3. Douglas E. Comer, “Internetworking with TCP/IP”, Volume One, Pearson, 6th Edition.
4. James F. Kurose, Keith W. Ross, “Computer Networking, A Top-Down Approach
Featuring the Internet”, Addison Wesley, 5th Edition.
5. Paul Goransson, Chuck Black, “Software Defined Networks: A Comprehensive
Approach”, Morgan Kaufmann, ISBN: 978-0124166752
6. Behrouz Forouzan, “Data Communication and Networking”, McGraw-Hill, 5th Edition.

Evaluation Scheme:
1 In-Semester Assessment:
● Assessment consists of two Internal Assessments (IA1, IA2) out of which; one should
be compulsory class test (on minimum 02 Modules) and the other is a class test /
assignment on case studies / course project.
● Mid Semester Examination (MSE) will be based on 40-50% of the syllabus.

2 End-Semester Examination:
● Question paper will comprise of full syllabus.
● In the question paper, weightage of marks will be proportional to the total number of
lecture hours as mentioned in the syllabus
 Theor Practic Tutori Theor Practical/O Tutori Total
y al al y ral al Credi
Hrs Hrs Hrs Credi Credit Credit ts
t s

CEL5 Software
- 02 - - 01 - 01
01 Engineeri
ng Lab

Course Course Examination Scheme

Code Name
Theory Marks Ter Practica Ora Tota
m l & Oral l l
Wor
k

In-Sem Evaluations End

Sem
IA IA AV Mid Exa
1 2 G Sem m
Exa
m

Software
CEL50
Engineerin - - - - - 25 25 - 50
1
g Lab

Course Objectives:
1. To introduce fundamentals of software engineering including requirement specifications,
software design, testing and maintenance.
2. To present software engineering methodologies for the development of quality, cost
effective, schedule- meeting software.

Course Outcomes: At the end of the course learner will able to

1. Comprehend software development life cycle.
2. Construct/Compose SRS document for a SEP (software engineering project).
3. Use software engineering tools to plan, schedule & track the progress of the project
(Plan, Schedule and Track SEP).
4. Apply UML modeling design and development techniques to the SEP.
5. Apply SCM tool and RMMM plan for SEP.
6. Validate the software project (Understand ethical and professional issues related to
Software Project Delivery).
Prerequisites:

1 Web Programming

Sr No. Title CO Meet

Prepare detailed Problem statement of

1 problem for the selected/ allotted mini project CO1
and identify suitable process model for the
same with justification

Develop Software Requirement

2 Specification (SRS) document in IEEE CO2
format for the project.

3 Draw DFD (up to 2 levels) and prepare Data

CO2
dictionary for the project

4 Use a project management tool to prepare the

CO3
schedule of the project.eg. Gantt chart

5 Installation of JIRA agile project

CO3
management tool

6 Identify Scenarios & Develop UML use case

CO4
& class Diagram for the project.

7 Develop Activity diagram for the project CO4

Develop Sequence & collaboration diagram

8 CO4
for the project

Compute Cohesion & coupling for given case

9 CO4
study

10 Prepare RMMM plan for the project CO5

Change specification & make different

11 CO5
versions using any SCM Tool

12 Develop test cases for the project using white

CO6
box testing
Text Books:

1. R. S. Pressman and Bruce Maxim, “Software Engineering – A practitioner’s approach”,

McGraw Hill 9th Edition, 2020
2. Ian Sommerville, “Software Engineering”, Pearson Education, 10th Edition.

Reference Books:
1. Hans Van Vliet, “Software Engineering: Principles and Practice” Wiley, 3rd Edition.
2. Bernd Bruegge, Allen H. Dutoit, “Object-Oriented Software Engineering using UML
Patterns and Java”, (2e), Pearson Publication, 2011.
3. Ivar Jacobson, Grady Booch, James Rumbaugh, “The Unified Development Process”,
Pearson.
4. Pankaj Jalote, "An integrated approach to Software Engineering", Springer/Narosa.

Term Work:
The Term work Marks are based on the weekly experimental performance of the students, Oral
performance and regularity in the lab.
Students are expected to be prepared for the lab ahead of time by referring the manual and
perform the experiment under the guidance and discussion. Next week the experiment write-
up to be corrected along with oral examination.

End Semester Examination:

End of the semester, there will be Practical and Oral examination based on the laboratory work
and the corresponding theory syllabus.
 Practical/
Theory Practical Tutorial Theory Tutorial Total
Oral
Hrs Hrs Hrs Credit Credits Credits
Credit

Microprocessor
CELDLO
and
- 02 -- - 01 - 01
5011 Microcontroller
Lab

Examination Scheme
Term Practical
Theory Marks Oral Total
Work & Oral
Course Code Course Name
In-Sem Evaluations End
Mid Sem
IA1 IA2 AVG Sem
Exam
Exam

Microprocessor
CELDLO5011 and
- - - - - 25 – 25 50
Microcontrolle
r Lab

Course Objectives:
1. To develop background knowledge of microprocessor and microcontrollers.
2. To understand peripheral devices and their interfacing to microcontrollers.
3. To write programs for microcontrollers and their applications in Assembly and Embedded
C Language.

Course Outcomes: At the end of the course learner will able to

1. Understand the detailed architecture of 8086.

2. Understand and use assembly language Instruction set.
3. Learn the microcontroller and their Instruction set.
4. Design interfacing of various peripheral devices to the microcontroller.
5. Understand the detailed architecture of ARM 7.
6. Write Embedded C program for Microcontrollers.

Prerequisites:
1. Computer Architecture and Organization

Sr CO
Title
No. Meet

a) Study architecture of 8086 Microprocessor.

1 b)Perform addition and subtraction of two numbers using CO1
different addressing modes

a) Perform addition and subtraction of two numbers using

8051 instructions.
2 CO2
b) Perform to perform multiplication and division of two
numbers using 8051 instructions.

Program to arrange ten numbers in ascending order using

3 CO2
8051.

Program to generate a square wave on port of 8051 using s/w

4 CO3
and h/w delay.

a) Interface 8051 with seven segments led wap to display hex

5 counters. CO3
b) Program to interface 8051 with LED.

6 Study data flow model of ARM 7 in detail. CO4

Program to add, subtract, multiply and division of two

7 CO4
numbers using ARM 7 instruction set.

a) Program to find the largest number using ARM 7

instructions.
8 CO5
b) Program to find even and odd numbers using ARM 7
instructions.

Interface ARM 7 with LED and write a program to turn on

9 CO5
and off.

10 Program to send and receive data serially using ARM7 CO6

Text Books:

1. Barry B. Brey, “Intel Microprocessors”, 8th Edition, Pearson Education India.

2. K M Bhurchandani, A k Ray, “Advanced Microprocessors and Peripherals”,
McGraw Hill.
3. Muhammad Ali Mazidi and Janice Gillespie Mazidi and Rollin D. McKinlay, “The
8051 Microcontroller and embedded systems – using assembly and C”, Prentice
Hall India, Pearson.
4. Kenneth Ayala, “The 8051 Microcontroller”, Thomson Delmar Learning, 3rd
Edition.

Reference Books:

1. Douglas Hall, “Microprocessor and Interfacing”, Tata McGraw Hill.

2. John Uffenbeck, “8086/8088 family: Design Programming and Interfacing”, PHI.
3. Predko, “Programming and customizing the 8051-micro controller”, Tata McGraw
Hill.
4. Frank Vahid, Tony Givargis, “Embedded System design”, John Wiley, 2002.

Term Work:
The Term work Marks are based on the weekly experimental performance of the students, Oral
performance and regularity in the lab.
Students are expected to be prepared for the lab ahead of time by referring the manual and
perform the experiment under the guidance and discussion. Next week the experiment write-
up to be corrected along with oral examination.

End Semester Examination:

End of the semester, there will be Oral examination based on the laboratory work and the
corresponding theory syllabus.
 Theo Practic Tutori Theo Practical/O Tutori Total
ry al al ry ral al Credi
Hrs Hrs Hrs Credi Credit Credit ts
t s
Advanc
CELDLO5 ed - 02 - - 01 - 01
012 Databas
es Lab

Course Code Course Examination Scheme

Name
Theory Marks Ter Practic Ora Tota
m al & l l
Wor Oral
k

In-Sem Evaluations End

Sem
IA 1 IA 2 AVG Mid Exam
Sem
Exam

Advanced
CELDLO5012
Databases - - - - - 25 - 25 50
Lab

Course Objectives:

1. To understand the use of object relational database using Procedural Language -

SQL.
2. To provide insights into distributed and parallel database designing.
3. To learn about the trends in advance databases.
4. To learn advanced representations of databases suited for real-time applications.

Course Outcomes: At the end of the course learner will able to

1. Implement object oriented and object relational concepts using PL/SQL

2. Design and analyse the importance of parallel databases.
3. Implement NoSQL commands using MongoDB.
 4. Design and implement queries in parallel databases.
5. Design and implement queries in distributed databases.
6. Design and implement queries in Temporal and Spatial databases.

Prerequisites:

1. Data Structure
2. DBMS

Suggested Experiments:

Experiment CO
Experiments Name
No. Mapping

1 Construct object type and method using concepts CO1

of object relational database management system.

2 Implement Inheritance and collections using CO1

concepts of object relational database management
system.

3 Install and configure MongoDB to execute NoSQL CO2

commands.

4 Design and Implement Query Processing on CO3

parallel databases.

5 Design distributed database on any one case study C04

to showcase difference between centralize database
to distributed database.

6 Perform Fragmentation (PHF, DHF, VF, and HF) CO4

and allocation in DDBS design.

7 Design Graph Database using any one application. CO5

8 Implement and analyse Graph Database using open CO5

source tool. Eg. Neo4J.

9 Design and Implement queries on Temporal CO6

Database.

10 Design and Implement queries on Spatial CO6

Database.
Text Books:

1. G. K. Gupta, “Database Management Systems”, McGraw Hill.

2. Korth, Slberchatz, Sudarshan, “Database System Concepts”, 6th Edition, McGraw –
Hill
3. Elmasri and Navathe, “Fundamentals of Database Systems”, 5th Edition, Pearson
Education.
4. Ozsu, M. Tamer, Valduriez, Patrick, “Principles of Distributed Database Systems”, 3rd
Edition, Pearson Education.

Reference Books:
1. P. S. Deshpande, “SQL and PL/SQL for Oracle 10g, Black Book”, Dreamtech Press.
2. Gillenson, Paulraj Ponniah, “Introduction to Database Management”, Wiley
Publication.
3. Shashank Tiwari, “Professional NOSQL”, John Willy & Sons. Inc.
4. Raghu Ramkrishnan and Johannes Gehrke, “Database Management Systems”, TMH.

Term Work:
The Term work Marks are based on the weekly experimental performance of the students,
Oral performance and regularity in the lab.
Students are expected to be prepared for the lab ahead of time by referring the manual and
perform the experiment under the guidance and discussion. Next week the experiment write-
up to be corrected along with oral examination.

End Semester Examination:

End of the semester, there will be oral evaluation based on the laboratory work and the
corresponding theory syllabus.
 Practical/
Theory Practical Tutorial Theory Tutorial Total
Oral
Hrs Hrs Hrs Credit Credits Credits
Credit
Computer
CELDLO5013 Graphics - 02 - - 01 - 01
Lab

Examination Scheme
Term Practical
Theory Marks Oral Total
Course Work & Oral
Course Code
Name In-Sem Evaluations End
Mid Sem
IA1 IA2 AVG Sem
Exam
Exam
Computer
CELDLO5013 Graphics - - - - -- 25 - 25 50
Lab

Course Objectives:

1. To understand the need of developing graphics application.

2. To learn algorithmic development of graphics primitives like: line, circle, polygon etc.
3. To learn the representation and transformation of graphical images and picture.

Course Outcomes: At the end of the course learner will able to

1. Understand the basic concepts of computer graphics using graphical tools to build an
application.
2. Implement various output and filled area primitive algorithm using C.
3. Acquire knowledge about geometric transformations and apply it on graphical
objects.
4. Gain basic knowledge of viewing and clipping and apply it on graphical objects.
5. Implement curve, fractal generation and projection.
6. Understand visible surface detection techniques and animation.

Prerequisites:
1. Programming in C
Suggested Experiments:

Experiment Experiments Name CO Mapping

No.
1 Study and apply basic OpenGL functions to draw basic CO1
primitives

2 To implement DDA Line drawing algorithm and CO2

Bresenham algorithm.

3 To implement midpoint circle algorithm. CO2

4 To implement midpoint ellipse algorithm CO2

5 To implement boundary fill and flood fill algorithm CO2

6 To implement 2D Transformations: Translation, CO3

Scaling, Rotation, Reflection and Shearing.

7 To implement Cohen Sutherland line clipping CO4

algorithm.

8 To implement Sutherland Hodgeman polygon clipping CO4

algorithm.

9 To implement Bezier curve for n control Points. CO5

10 To create animation using any open-source tool. CO6

Text Books:

1. James D. Foley, Andries van Dam, Steven K Feiner, John F. Hughes, “Computer
Graphics Principles and Practice in C”, 2nd Edition, Pearson Publication
2. Samit Bhattacharya, “Computer Graphics”, Oxford publication

Reference Books:

1. F. S. Hill, “Computer Graphics using OpenGL”, Third edition, Pearson Publications.

Term Work:
The Term work Marks are based on the weekly experimental performance of the students, Oral
performance and regularity in the lab.
Students are expected to be prepared for the lab ahead of time by referring the manual and
perform the experiment under the guidance and discussion. Next week the experiment write-
up to be corrected along with oral examination.

End Semester Examination:

End of the semester, there will be oral evaluation based on the laboratory work and the
corresponding theory syllabus.
 Practical/
Theory Practical Tutorial Theory Tutorial Total
Oral
Hrs Hrs Hrs Credit Credits Credits
Credit
Cloud
CELDLO5014 Computing - 02 - - 01 - 01
Lab

Examination Scheme
Term Practical
Theory Marks Oral Total
Course Work & Oral
Course Code
Name In-Sem Evaluations End
Mid Sem
IA1 IA2 AVG Sem
Exam
Exam
Cloud
CELDLO5014 Computing - - - - - 25 - 25 50
Lab

Course Objectives:

1. To differentiate between on-premises, hybrid-cloud, and all-in cloud.

2. To describe the basic global infrastructure of the AWS Cloud.
3. To understand the Networking and security components in cloud environment.
4. To understand the database as a service.
5. To use of monitoring service.

Course outcomes: At the end of the course learner will able to

1. Understand AWS Cloud Computing Infrastructure.

2. Launch an EC2 instance in AWS cloud with storage.
3. Use of DynamoDB and AWS RDS for database design.
4. Apply the AWS Beanstack to deploy the static website with database and security
groups.
5. Use of AWS IAM for user, role and Policy.
6. Use of Monitoring tools.

Experiment CO
Name of the Experiment
No. Mapping
1 Overview of AWS Cloud computing Infrastructure CO1
2 Create AWS Free Trial Account CO1
3 Launch an EC2 instance in AWS cloud with storage block CO2
Develop a static website and store in S3 bucket using version
4 control CO2
 Create an Amazon RDS relational database, create at least 2 or 3
5 tables , insert few records and query using SQL CO3
Create a DynamoDB database and demonstrate how big-data
6 cluster can be facilitated as a service by AWS platform CO3

7 Create a simple web app using elastic beanstalk CO4

8 Load balancing between two or more EC2 instances using ELB CO4
Create a Virtual Private cloud, create custom subnets and
9 demonstrate the usage of security groups CO4
Introduction to AWS IAM, Task to perform
1. Exploring pre-created IAM Users and Groups
2. Inspecting IAM policies as applied to the pre-created
groups
3. Following a real-world scenario, adding users to groups
10 with specific capabilities enabled CO5
4. Locating and using the IAM sign-in URL
5. Experimenting with the effects of policies on service
access
6. Creating a Role for Single Sign-on (SSO)
7. Data Encryption solution for data at rest and data in transit
8. Design the policy for user requirements using Policy
11 CO5
Builder
Create a AWS cloud config instance and asses configurations of
12 CO6
AWS resources like EC2 and Database
Set a cloud watch alarm on CPU utilization of an EC2 instance
13 CO6
and monitor the Graphs

Text Books

1. Anthony T. Velte, Toby J. Velte, Robert Elsenpeter, “Cloud Computing: A Practical

Approach”, McGraw Hill Publication.

Reference Books

1. Joe Baren, Hisham Baz, Tim Bixler, Biff Gaut, Kevin E. Kally, Sean Senior, John
Stamper, “AWS Certified solutions Architect : Official Study Guide”, Sybex
publications.

Term Work:
The Term work Marks are based on the weekly experimental performance of the students, Oral
performance and regularity in the lab.
Students are expected to be prepared for the lab ahead of time by referring the manual and
perform the experiment under the guidance and discussion. Next week the experiment write-
up to be corrected along with oral examination.

End Semester Examination:

End of the semester, there will be oral evaluation based on the laboratory work and the
corresponding theory syllabus.
 Practical/
Theory Practical Tutorial Theory Tutorial Total
Oral
Hrs Hrs Hrs Credit Credits Credits
Credit
Advanced
CELDLO5021 Algorithms - 02 - - 01 - 01
Lab

Examination Scheme
Term Practical
Theory Marks Oral Total
Course Work & Oral
Course Code
Name In-Sem Evaluations End
Mid Sem
IA1 IA2 AVG Sem
Exam
Exam
Advanced
CELDLO5021 Algorithms - - - - - 25 - 25 50
Lab

Course Objectives:

1. To provide mathematical approach for Analysis of Algorithms.

2. To explore advanced data structures.
3. To solve complex problems in real life applications.

Course Outcomes: At the end of the course learner will able to

1. Describe analysis techniques for algorithms.

2. Identify appropriate data structure and design techniques for different problems.
3. Understand, apply and implement different applications using Greedy and Dynamic
Programming strategy.
4. Understand and implement network flow algorithms.
5. Appreciate the role of probability and randomization in the analysis of algorithm.
6. Understand the classes of complexity and interpret the tractable or intractable
problem.

Prerequisites:

1. Data structure
2. Analysis of Algorithm

Suggested Experiments:
 Experiment Experiments Name CO
No. Mapping
1 Implement all sorting algorithms and do the
comparison of best, worst and average running CO1
time.

2 Implement red black tree and perform all

CO2
operations on it.

3 Implement matrix chain multiplication

CO3
problem.

4 Implement Johnson’s algorithm for sparse

CO3
graphs.

5 Implementation of Knapsack Problem using

CO3
Dynamic Programming.

6 Implement Ford Fulkerson algorithm. CO4

7 Implementation of Randomized Quick sort

CO5
algorithm.

8 To study Vertex Cover problem as NP-

CO6
Complete problem.

Text Books:
1. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein,
“Introduction to Algorithms”, PHI, India, Second Edition.
2. Horowitz, Sahani and Rajsekaran, “Fundamentals of Computer Algorithms”, Galgotia.
3. Harsh Bhasin, “Algorithms – Design and Analysis”, Oxford, 2015.

Reference Books:
1. Rajeev Motwani, Prabhakar Raghavan, “Randomized Algorithm”, Cambridge
University.
2. S. K. Basu, “Design Methods and Analysis of Algorithm”, PHI.
3. Vijay V. Vajirani, “Approximation Algorithms”, Springer.

Term Work:
The Term work Marks are based on the weekly experimental performance of the students, Oral
performance and regularity in the lab.
Students are expected to be prepared for the lab ahead of time by referring the manual and
perform the experiment under the guidance and discussion. Next week the experiment write-
up to be corrected along with oral examination.
End Semester Examination:
End of the semester, there will be oral evaluation based on the laboratory work and the
corresponding theory syllabus.
 Theory Practical Tutorial Theory Practical/Oral Tutorial Total
Hrs Hrs Hrs Credit Credit Credits Credits
Statistica
l Data
CELDLO5022 - 02 - - 01 - 01
Analytics
Lab

Course Code Course Examination Scheme

Name
Theory Marks Term Practical Oral Total
Work & Oral

In-Sem Evaluations End

Sem
IA1 IA2 AVG Mid Exam
Sem
Exam

CELDLO5022 Statistical - - - - - 25 - 25 50
Data
Analytics
Lab

Lab Objectives:

1. To understand the basic concepts and importance of preprocessing of data analysis.

2. To apply descriptive techniques in data analytics.
3. To understand regression, correlation and sampling techniques.

Lab Outcomes: At the end of the course, the students will be able to

1. Implement and understand descriptive analysis of data.

2. Understand multilinear and multivariate regression.
3. Find correlation coefficients.
4. Implement reduction techniques.
5. Implement various tests to understand its significance.
6. Understand use of test of hypothesis.

Prerequisite:
1. Basics of Statistics

Suggested List of Experiments (programming in R)

Experiment Experiments Name CO

No. Mapping

1 Implementation of techniques of data CO1

representation.

2 Implementation of measures of central CO1

tendency

3 Implementation of multilinear regression CO2

4 Implementation of multivariate linear CO2

regression

5 Implementation of determining Correlation CO3

coefficient without using standard function

6 Implementation of MANOVA CO3

7 Implementation of PCA using real time data CO4

8 Implementation of LDA using real time data CO4

9 Implementation of comparison of various CO5

sampling techniques

10 Implementation of significance test CO5

11 Case study on null hypothesis and alternate CO6

hypothesis.

12 Case study on type of errors using real time CO6

data.

Text Books:

1. Mark Gardener, “Beginning R: The Statistical Programming Language”, Wiley, 2013.

2. Gupta, S. P., “Statistical Methods”, Sultanchand & Sons, New Delhi, 2011.

Reference Books:
1. Dawn M. McBride, J. Cooper Cutting, “Lab Manual for Statistical Analysis”, SAGE
Publication, 1st Edition, 2017.

Term Work:
The Term work Marks are based on the weekly experimental performance of the students, Oral
performance and regularity in the lab.
Students are expected to be prepared for the lab ahead of time by referring the manual and
perform the experiment under the guidance and discussion. Next week the experiment write-
up to be corrected along with oral examination.

End Semester Examination:

End of the semester, there will be oral evaluation based on the laboratory work and the
corresponding theory syllabus.
 Practical/
Theory Practical Tutorial Theory Tutorial Total
Oral
Hrs Hrs Hrs Credit Credits Credits
Credit
Digital
Signal and
CELDLO5023 Image - 02 - - 01 - 01
Processing
Lab

Examination Scheme
Term Practical
Theory Marks Oral Total
Course Work & Oral
Course Code
Name In-Sem Evaluations End
Mid Sem
IA1 IA2 AVG Sem
Exam
Exam
Digital
Signal and
CELDLO5023 Image - - - - - 25 - 25 50
Processing
Lab

Course Objectives:
1. To understand the fundamental concepts of digital signal processing and Image
processing.
2. To explore DFT and FFT for 1D and 2D signal.
3. To apply enhancement techniques on images.
4. To apply digital image processing techniques for edge detection.

Course Outcomes: At the end of the course learner will able to

1. Illustrate convolution and corelation.

2. Apply Discrete Fourier Transform and Fast Fourier Transform Techniques.
3. Apply wavelet transform on an image.
4. Apply and compare spatial domain image enhancement techniques.
5. Analyse the effect of various edge detection methods on image.
6. Apply basic image processing techniques for object detection.

Prerequisites:
1. Programming in C / Python

Suggested Experiments:
 Experiment Experiments Name CO Mapping
No.
1 To perform Discrete Convolution and Correlation CO1

2 To perform Discrete Fourier Transform CO2

3 To perform Fast Fourier Transform CO2

4 To implement Wavelet transform CO3

5 Implementation of Image negative, gray level Slicing CO4

and thresholding

6 Implementation of Contrast Stretching, Dynamic CO4

range compression & Bit plane Slicing

7 Implementation of Histogram Processing CO4

8 Implementation of Image smoothing/ Image sharpening CO4

9 Implementation of Edge detection using Sobel and CO5

Prewitt masks

10 Real world application on Object detection CO6

Text Books:

1. Rafel C. Gonzalez and Richard E. Woods, “Digital Image Processing”, Pearson

Education Asia, 3rd Edition, 2009.
2. S. Sridhar, “Digital Image Processing”, Oxford University Press, Second Edition, 2012.

Reference Books:

1. S. Salivahanan, A. Vallavaraj, and C. Gnanapriya, “Digital Signal Processing”, Tata

McGraw Hill Publication 1st Edition (2010).
2. S. Jayaraman, E. Esakkirajan and T. Veerkumar, “Digital Image Processing”,
TataMcGraw Hill Education Private Ltd, 2009.

Term Work:
The Term work Marks are based on the weekly experimental performance of the students, Oral
performance and regularity in the lab.
Students are expected to be prepared for the lab ahead of time by referring the manual and
perform the experiment under the guidance and discussion. Next week the experiment write-
up to be corrected along with oral examination.

End Semester Examination:

End of the semester, there will be oral evaluation based on the laboratory work and the
corresponding theory syllabus.
 Practical/
Theory Practical Tutorial Theory Tutorial Total
Oral
Hrs Hrs Hrs Credit Credits Credits
Credit
Advanced
Computer
CELDLO5024 - 02 - - 01 - 01
Network
Lab

Examination Scheme
Term Practical
Theory Marks Oral Total
Course Work & Oral
Course Code
Name In-Sem Evaluations End
Mid Sem
IA1 IA2 AVG Sem
Exam
Exam
Advanced
Computer
CELDLO5024 - - - - - 25 - 25 50
Network
Lab

Course Objectives:

1. To make learners aware about advances in computer networking technologies.

2. To give overview of advance internet, QoS based and management protocols.
3. To introduce issues related to traffic engineering and capacity planning.

Course Outcomes: At the end of the course learner will able to

1. Explore the features of standard Network Simulation Tools with the understanding
of fundamental network concepts.
2. Apply network configuration skills to design network scenarios and apply switching
concepts to forward the packets.
3. Use internetworking devices to design networks and apply advanced routing
concepts to forward the packets in latest network environments.
4. Employ various technologies and protocols to manage the network.
5. Design networks to solve the enterprise network issues.
6. Analyze the flexibility and scalability of using SDN in terms of innovation and
network management.
Prerequisites:

1. Computer Networks
2. Programming in C/Java
3. Cisco Packet Tracer

Suggested Experiments:

Experiment Experiments Name CO

No. Mapping
1. Overview of Packet Tracer, basic router operation and LAN CO1
environment setup.
(Design Problem will be given)
2. Implementation of Static Routing to connect computers of 5 CO2
different locations in WAN environment.
(Design Problem will be given)
3. Implementation of Dynamic Routing using RIP to connect CO3
computers of 5 different locations in WAN environment
(Intra-domain Routing) using CLI.
(Design Problem will be given)
4. Implementation of OSPF routing protocol to connect routers CO3
in WAN environment.
(Design Problem will be given)
5. Implement Dynamic Routing using BGP connect 5 different CO3
locations in WAN environment (Interdomain Routing).
(Design Problem will be given)
6. Simulate the transmission of ping messages over a network CO4
topology consisting of 6 nodes and find the number of
packets dropped due to congestion.
7. Implement VLAN and VTP configuration and Firewall CO5
Implementation using Router Access Control List (ACL).
8. Configure Records on the DNS Server CO5
9. Configure SNMP CO5
10. Practical on SDN using openflow CO6

Text Books:

1. Behrouz Forouzan, “TCP/IP Protocol Suite”, McGraw-Hill, 5th Edition.

2. Todd Lammle, “Cisco Certified Network Analyst Study Guide”, Wiley Publishing
House, 7th Edition.
 3. Paul Goransson, Chuck Black, “Software Defined Networks: A Comprehensive
Approach”, Morgan Kaufmann, ISBN: 978-0124166752
4. M. A. Gallo and W. M. Hancock, “Computer Communications and Networking
Technologies”, Cengage Learning, 1st Edition.
5. Leon-Garcia, “Communication Networks”, Tata McGraw-Hill.
6. Darren L. Spohn, “Data Network Design”, Tata McGraw-Hill.
7. William Stallings, “High-Speed Networks and Internets”, Pearson Education, 2nd
Edition.

Reference Books:

1. Behrouz Forouzan, “Data Communication and Networking”, McGraw-Hill, 5th Edition.

2. Douglas E. Comer, “Internetworking with TCP/IP”, Volume One, Pearson, 6th Edition.
3. James F. Kurose, Keith W. Ross, “Computer Networking, A Top-Down Approach
Featuring the Internet”, Addison Wesley, 5th Edition.

Important Links:

1) CCNA Concept: Routing Information Protocol (RIP) | CertificationKits.com

2) IP Routing: RIP Configuration Guide, Cisco IOS Release 15M&T - Configuring
Routing Information Protocol [Cisco IOS 15.4M&T] - Cisco
3) Open Shortest Path First (OSPF) - Cisco
4) Configure Transmission Control Protocol (TCP) and User Datagram Protocol (UDP)
Service Settings on a Switch - Cisco
5) Understanding How DNS Works - the Domain Name System (cloudacademy.com)
6) https://www.udemy.com/course/beginners-sdn-course-with-ryu-controller-practical-
handson/
7) https://www.linkedin.com/learning/practical-software-defined-networking-1-sdn-and-
openflow-quick-start/openflow-patch-panel-example-part-
1?autoplay=true&resume=false
8) https://www.netacad.com/courses/packet-tracer

Term Work:
The Term work Marks are based on the weekly experimental performance of the students, Oral
performance and regularity in the lab.Students are expected to be prepared for the lab ahead of
time by referring the manual and perform the experiment under the guidance and discussion.
Next week the experiment write- up to be corrected along with oral examination.

End Semester Examination:

End of the semester, there will be Practical examination along with oral evaluation based on
the laboratory work and the corresponding theory syllabus.
 Teaching Scheme (Contact
Credits Assigned
Course Hours)
Course Name
Code Pr/
Theory Pract. Tut. Theory Tut. Total
Oral.
Signal
ILOT5011 Processing & 3 - - 3 - - 3
Applications

Examination Scheme
Term Practical
Theory Marks Oral Total
Course Work & Oral
Course Code
Name In-Sem Evaluations End
Mid Sem
IA1 IA2 AVG Sem
Exam
Exam
Signal
Processing
ILOT5011 20 20 20 20 60 2 - - 100
&
Applications

Course Prerequisite

1. Engineering Mathematics

Course Objectives

The aim of this course is to provide in-depth treatment on methods and techniques in

1. Introduction to discrete signals and time domain analysis of signals

2. Frequency domain analysis of signals
3. Applications of Signal Processing to real world problems

Course Outcomes After successful completion of the course student will be able to

1. To understand the sampling theorem and reconstruction of the signals. Aliasing effect in sampling th
2. To analyze the signals in time domain.
3. To understand concept of correlation and convolution.
4. To analyze the signals in time domain.
5. To analyze the concept of FIR and IIR digital filters.
6. To apply appropriate signal processing tools for different applications.
 Module Detailed Content Hours
1 Discrete Signals: Basics of discrete signals, Operations on discrete
signals, standard elementary signals, sampling theorem, signal 6
reconstruction and aliasing.
2 Time domain analysis: Discrete time systems, Time invariance,
causality and memory, Impulse response. System representation in 6
various forms, Application oriented examples.
3 Discrete convolution and correlation: Analytical evaluation of
discrete convolution, convolution of finite sequences, Stability and 8
causality, system response to periodic inputs, discrete correlation.
4 Frequency domain analysis: Introduction, Fourier Series:
Representation of Periodic Signals, Fourier Transform:
Representation of Nonperiodic Signals, Discrete Fourier Transform,
8
Short-Time Fourier Transform, Fast Fourier Transform (FFT), DIT-
FFT, Discrete Cosine Transform (DCT), Applications of the Fourier
Transform.
5 Digital Filters: Introduction to digital filters, IIR filters, IIR filter
design, linear phase FIR filters, FIR filter design, and problems on 6
filter design.
6 Applications of digital signals: Audio Equalizer, digital audio
5
effect, removal of artefacts from ECG and EEG signals using filters.
Total 39

Text books:
1. Ashok Amberdar, “Digital signal processing: a modern Introduction”, Cengage
learning.
2. Emmanuel C. Ifeachor, Barrie W. Jervis, “Digital Signal Processing, A Practical
Approach”, Pearson Education.
3. Alan V. Oppenheim, Ronald Schafer, “Discrete Time signal Processing”, Pearson
Education.

Reference Books:
1. J. Proakis, D. G. Manolakis, D. Sharma, “Digital Signal Processing, Principles,
algorithms and applications”, Pearson Education.
2. Rafeal C. Gonzalez, Richard E. Woods, Steven L. Eddins, “Digital Image Processing
using Matlab”, Pearson Education.

Evaluation Scheme:
1. In-Semester Assessment:
 a. Assessment consists of two Internal Assessments (IA1, IA2) out of which; one
should be compulsory class test (on minimum 02 Modules) and the other is a
class test / assignment on case studies / course project.
b. Mid Semester Examination (MSE) will be based on 40-50% of the syllabus.

2. End-Semester Examination:
• Question paper will comprise of full syllabus.
• In the question paper, weightage of marks will be proportional to the total
number of lecture hours as mentioned in the syllabus.
 Teaching Scheme (Contact
Credits Assigned
Hours)
Course Course
Pr/
Code Name Tut Tota
Theory Pract. Tut. Theory Oral
. l
.
Biomedic
al Signal
ILOT501 and Image
3 - - 3 - - 3
2 Processing

Examination Scheme
Theory
Course Course Internal Assessment Pr/
End Exam. Tota
Code Name Mid Sem Duratio TW Oral l
Test Test Avg Sem .
Exa n
1 2 . Exa (in Hrs)
m
m
Biomedical
Signal and
ILOT501 Image
20 20 20 20 60 2 - - 100
2 Processing

Course Prerequisite

1. Signals and Systems

Course Objectives

The aim of this course is to provide in-depth treatment on methods and techniques in

1. To understand the fundamentals of Biomedical Signal and Image Processing.

2. To explore different types of filters to remove artifacts from biomedical signals.
3. To introduce the latest imaging modalities.
4. To study biomedical image processing techniques.

Course Outcomes After successful completion of the course student will be able to

1. Have basic knowledge about the various bioelectric potentials.

2. Apply digital filters to remove noise from biomedical signals.
 3. Implementation of various methods to analyze biosignals.
4. Apply the concept of image processing.
5. Have knowledge of imaging modalities such as X-ray, CT, MRI and Ultrasound.
6. Understand the biomedical image processing concepts for real time applications.

Module Detailed Content Hours

1 Bio-Potential measurements: Human Cell: Structure of Cell, Origin
of Bio-potentials (ECG, EEG, EMG), Generation of Action Potentials 04
2 Filtering for Removal of artifacts: Digital filters - IIR and FIR - Notch
07
filters, Filters to remove noise from electrocardiogram (ECG) signals
and Electroencephalogram (EEG) signals
3 Biomedical signal Analysis: Derivative based Approach for QRS
Detection: Pan Tompkins Algorithm, 06
Analysis of EEG Signal.
4 Introduction to Digital Image Processing: Introduction – Origin –
08
Steps in Digital Image Processing – Components, Methods of Image
enhancement: Spatial Domain and frequency domain, Segmentation
5 Biomedical Imaging: Introduction to Xray, CT scan, MRI, Ultrasonic
08
Imaging, Molecular Imaging, SPECT and PET, Texture in Medical
Images,
6 Applications: A survey of different applications of medical image
06
processing, Role of Artificial Intelligence and Machine Learning in
biomedical signal and image processing.
Total 39

Text books:
1. W. J. Tompkins, “Biomedical Digital Signal Processing”, Prentice Hall, 1993.
2. Eugene N Bruce, “Biomedical Signal Processing and Signal Modeling”, John Wiley &
Son’s publication, 2001.
3. Rafael C. Gonzales, Richard E. Woods, “Digital Image Processing”, Third Edition,
Pearson Education, 2010.
4. Handbook of Biomedical Instrumentation: R S. Khandpur. (PH Pub)
5. Medical Instrumentation, Application and Design: J G. Webster. (John Wiley)
Reference Books:
1. Paul Suetens, “Fundamentals of Medical Imaging”, 2017, 3rd edition, Cambridge
University Press, Cambridge, New York.
2. D C Reddy, “Biomedical Signal Processing”, McGraw Hill, 2005.
3. Katarzyn J. Blinowska, Jaroslaw Zygierewicz, “Practical Biomedical Signal Analysis
Using MATLAB”, 1st Edition, CRC Press, 2011.
 4. Pianykh, Oleg S., Digital Imaging and Communications in Medicine (DICOM), A
Practical Introduction and Survival Guide, Springer
5. Branstetter IV, Barton F., Practical Imaging Informatics Foundations and Applications
for Medical Imaging, Springer

Evaluation Scheme:
1. In-Semester Assessment:
a. Assessment consists of two Internal Assessments (IA1, IA2) out of which; one
should be compulsory class test (on minimum 02 Modules) and the other is a
class test / assignment on case studies / course project.
b. Mid Semester Examination (MSE) will be based on 40-50% of the syllabus.

2. End-Semester Examination:
• Question paper will comprise of full syllabus.
• In the question paper, weightage of marks will be proportional to the total
number of lecture hours as mentioned in the syllabus.
 Teaching Scheme (Contact
Credits Assigned
Hours)
Course Course
Pr/
Code Name Tut Tota
Theory Pract. Tut. Theory Oral
. l
.
Theory of
Automata
and Formal
ILOT501
Languages 3 - - 3 - - 3
3

Examination Scheme
Theory
Course Course Internal Assessment Pr/
End Exam. Total
Code Name Mid Sem Duration TW Oral
Test 1 Test 2 Avg Sem Exam (in Hrs) .
. Exam
Theory of
Automata
and
ILOT501
Formal 20 20 20 20 60 2 - - 100
3
Languag
es

Course Prerequisite

1. Engineering Mathematics

Course Objectives

The aim of this course is to provide in-depth treatment on methods and techniques in

1. To explore the formal languages and classify machines by their power to recognize languages
2. To focus on the study of abstract models of computation.
3. To understand computability theory as well as the complexity theory.
 4. To develop the ability to form abstract computing models.
5. To solve complex problems in science and engineering through computing.
6. To design computation models and understand their properties.

Course Outcomes After successful completion of the course student will be able to

1. Design deterministic and non-deterministic finite Automata for given problem.

2. Design regular expressions representing or generating a certain language
3. Simplify automata and context-free grammars
4. Design push down automata for given complex CFL.
5. Design Turing machine as acceptor and verifier for mathematical computations.
6. Understand the concept decidability.

Module Detailed Content Hours

1 Finite Automata: Alphabets, strings, languages, Deterministic finite
automata, non-deterministic finite automata, finite automata with epsilon
transitions, DFA minimization, finite automata with output: Mealy and 10
Moore machines

2 Regular Expressions and Regular Grammar: Regular expressions,

DFA to regular expressions, regular expressions to finite automata,
Regular Grammar, Right linear grammar, left linear grammar, 6
interconversion.

3 Context-Free Grammars and Languages: CFGs, Properties of

Context-Free Languages derivation trees(parse tree), Ambiguous
grammar, simplification, Chomsky normal forms, Greibach normal 6
forms

4 Pushdown Automata: Formal Definition, designing PDA’s, acceptance

by empty stack, acceptance by final state relationship between PDA and 6
context free languages

5 Turing Machine: Turing Machines: The Turing machine model,

computable languages and functions, techniques for Turing machine
construction, modification of Turing machines, Universal Turing 6
Machine

6 Un-decidability: Properties of recursive and recursively enumerable

languages, universal Turing machines, post correspondence problem 5
Chomsky Hierarchy: regular grammars

Total 39

Text books:
1. Introduction to Automata Theory, Languages and Computation, Hopcroft, Motwani,
and Ullman, Pearson Publishers, Third Edition, 2006
 2. P. Linz, Introduction to Formal Language and Computation, Narosa, 2nd Ed, 2006.

Reference Books:
1. Automata and Computability, Dexter C. Kozen, Springer Publishers, 2007.
2. Mishra & Chandrasekharan, Theory of computer science: Automata language and
computation, Prentice Hall of India, 3rd Ed, 2007.

Evaluation Scheme:
1. In-Semester Assessment:
a. Assessment consists of two Internal Assessments (IA1, IA2) out of which; one
should be compulsory class test (on minimum 02 Modules) and the other is a
class test / assignment on case studies / course project.
b. Mid Semester Examination (MSE) will be based on 40-50% of the syllabus.

2. End-Semester Examination:
• Question paper will comprise of full syllabus.
• In the question paper, weightage of marks will be proportional to the total
number of lecture hours as mentioned in the syllabus.
 Teaching Scheme (Contact
Credits Assigned
Hours)
Course Course
Pr/
Code Name Tut Tota
Theory Pract. Tut. Theory Ora
. l
l.
ILOT5014 Mechatroni
3 - - 3 - - 3
cs
Examination Scheme
Theory
Course Course Internal Assessment Pr/
End Exam. T Tota
Code Name Mid Ora
Sem Duratio W l
Test Test Avg Sem l.
Exa n
1 2 . Exa m (in Hrs)
m
ILOT5014 Mechatroni
20 20 20 20 60 2 - - 100
cs

Course Prerequisite

None

Course Objectives

The aim of this course is to provide in-depth treatment on methods and techniques in

1. To learn the architecture of the mechatronics system design

2. To introduce broad spectrum characteristics of the mechanical
3. and electrical actuators and their selection for mechatronic systems.
4. To familiarize development of process plan and templates for design of mechatronic systems.

Course Outcomes After successful completion of the course student will be able to …

1. Develop the mechatronic system.

2. Analyze the concept of system modeling.
3. Identify the suitable sensor and actuator for a mchatronic system.
4. Design feedback and intelligent controllers.
5. Implement mechatronic system validation.
6. Integrate the components in mchatronics system.

Module Detailed Content Hours

1 Introduction to mechatronics systems:
Definition and evolution levels of mechatronics, integrated design issues 06
in mechatronics, key elements of mechatronics, mechatronics design
 process- modeling and simulation, prototyping, deployment /life cycle,
advanced approaches in mechatronics.

2 Modeling and Simulation of physical systems:

Simulation and block diagrams, Analogies and impedance diagrams,
electrical system-bridge circuit system, transformer, mechanical
translational and rotational systems-sliding block with friction, elevator
cable system, mass-damper system, automobile suspension system, 09
mechanical lever system, geared elevator system, electromechanical
coupling- DC motor, fluid systems-three tank liquid system, hydraulic
actuator and hydraulic pressure regulator.

3 Hardware components:
Sensors: motion and position measurement, force, torque and tactile
sensors, ultrasonic and range sensors, fiber optic sensors, micro sensors.
Actuators: Pneumatic and hydraulic-directional and pressure control
valves, cylinders, servo proportional control valves, rotary actuators,
Electrical actuation: A.C and DC motors, stepper motors, mechanical 09
switches and solid state switches.
Mechanical Actuation: types of motion, kinematic chain, cams, gears,
ratchets and pawl, belt and chain drives, bearings, mechanical aspects of
motor selection, piezoelectric actuators, magnetostrictive actuators,
memory metal actuators, Programmable Logic Controller

4 Intelligent control:
Automatic control methods, Artificial Neural Network(ANN) –
Modeling, basic model of neuron, characteristics of ANN, perceptron,
learning algorithms, fuzzy logic – propositional logic, membership 07
function, fuzzy logic and fuzzy rule generation, defuzzification, time
dependent and temporal fuzzy logic.

5 Components based modular design and system validation:

Components based modular design view, system validation, validation
methodology- integrated and design dependence, distributed local level, 04
validation schemes, fusion technique

6 Integration:
Advanced actuators, consumer mechatronic products, hydraulic fingers,
surgical equipment, industrial robot, autonomous guided vehicle, drilling 04
machine
Total 39

Text books:
1. Devdas Shetty and Richard Kolk, “Mechatronics System Design”, Thomson Learning,
2nd reprint, 2010.
2. W. Bolton, “Mechatronics - Electronic Control Systems in Mechanical and Electrical
Engineering”, Pearson Education Ltd, 6th edition,
 2018.
3. Nitaigour Mahalik, “Mechatronics- Principles, Concepts and Applications”, Tata
McGraw Hill, 2004.

Reference Books:
1. Stamatios V. Kartalopoulos, “Understanding Neural Networks and fuzzy Logic”,PHI,3rd
reprint, 2013.
2. Zhijun Li, Shuzhi Sam Ge, “Fundamentals in Modeling and Control of Mobile
Manipulators", March 30, 2017, by CRC Press.
3. Sergey Edward Lyshevski, “Mechatronics and Control of Electromechanical Systems",May 30,
2017, by CRC Press.
4. Bodgan Wilamowski, J. David Irwin, “Control and Mechatronics", October 12, 2017, by
CRC Press.
5. Takashi Yamaguchi, Mitsuo Hirata, Justin Chee Khiang Pang, "High-Speed Precision
Motion Control", March 29, 2017, by CRC Press.
6. David Allan Bradley, Derek Seward, David Dawson, Stuart Burge, “Mechatronics and the
Design of Intelligent Machines and Systems", November 17, 2000, by CRC Press.
7. Clarence W. de Silva, Farbod Khoshnoud, Maoqing Li, Saman K.
Halgamuge,“Mechatronics: Fundamentals and Applications", December 12, 2018, by CRC Press.
8. Clarence W. de Silva, “Mechatronics: A Foundation Course", June 4, 2010 by CRCPress.

Evaluation Scheme:
1. In-Semester Assessment:
a. Assessment consists of two Internal Assessments (IA1, IA2) out of which; one
should be compulsory class test (on minimum 02 Modules) and the other is a
class test / assignment on case studies / course project.
b. Mid Semester Examination (MSE) will be based on 40-50% of the syllabus.

2. End-Semester Examination:
• Question paper will comprise of full syllabus.
• In the question paper, weightage of marks will be proportional to the total
number of lecture hours as mentioned in the syllabus.
 Teaching Scheme (Contact
Credits Assigned
Hours)
Course Course
Pr/
Code Name Tut Tota
Theory Pract. Tut. Theory Oral
. l
.
AI for
ILOT5015 Business
3 - - 3 - - 3
Applications

Examination Scheme
Theory
Course Course Internal Assessment Pr/
End Exam. T Tota
Code Name Mid Oral
Sem Duratio W l
Test Test Sem Exa n .
Avg.
1 2 Exa m (in Hrs)
m
AI for
ILOT5015 Business
20 20 20 20 60 2 - - 100
Applications

Course Prerequisite

1. None

Course Objectives

The aim of this course is to provide in-depth treatment on methods and techniques in

1. To understand the carious AI technologies and analyse their role in business

applications.
2. To understand the Cognitive AI, analyse various strategies and their role in business
applications
3. To understand and analyse the AI technology impact on companies, business
processes, jobs, success and failure, disruption and future.

Course Outcomes After successful completion of the course student will be able to …

1. To select right AI technologies, analyse their role and apply them to business
applications.
2. To analyse Cognitive AI and apply various strategies to business applications.
3. To analyse the AI technology impact on companies’ performance.
4. To analyse AI Tasks, Organizational Structures, and Business Processes
 5. To analyse the impact of AI on Jobs and Skills in a World of Smart Machines and
will be able to use technology intelligently.
6. To understand the implications of AI on Organization, Society and Ethics. Also, able
to judge the AI’s Success and Failure, Disruption and its Future.

Module Detailed Content Hours

1 Introduction to AI
Introduction, Machine Learning, Neural Networks, Deep Learning,
7
Natural Language Processing (NLP), Rule-Based Expert Systems,
Recommendation Engines, Employing AI in Business
2 Cognitive AI
Cognitive technologies, working, key attributes, Technical
7
Approaches to Cognitive Technologies, Cognitive AI: Usecase,
Applications, Enterprise Strategy, Economy Strategy.
3 AI for Companies
AI in the Vendor Community, AI in the Enterprise, AI capabilities,
Engaging in Cognitive Work Redesign, Cognitive strategies-
7
Customer-Focused Strategies, Making Better Internal Decisions,
Developing New or Enhanced Product/Service Offerings, AI-Driven
Business Models.
4 AI Tasks, Organizational Structures, and Business Processes
Prediction and Classification Models, Perform Structured Digital
Tasks, Manipulate Information, Understand Human Speech and Text, 7
Plan and Optimize Operations, Perceive and Recognize Images,
Assess Human Emotions, The Need for Process Architecture.
5 Jobs and Skills in a World of Smart Machines
Large-Scale Automation, Large-Scale Augmentation, Moving
5
Forward with Augmentation or Automation, Company and Job-
Specific Skills Strategies,
6 Implications of AI
Organizational, Social and Ethical implications, AI Success and 6
Failure, Disruption, Future.
Total 39

Text books:
1. Thomas H. Davenport, “THE AI ADVANTAGE How to Put the Artificial Intelligence
Revolution to Work”, The MIT Press, 2018.
2. Ajit K Jha, “Artificial Intelligence for Business Leaders”, Amazon Asia-Pacific
Holdings Private Limited, 2020.
 3. Rajendra Akerkar, “Artificial Intelligence for Business”, Springer Nature, 2019.

Evaluation Scheme:
1. In-Semester Assessment:
a. Assessment consists of two Internal Assessments (IA1, IA2) out of which; one
should be compulsory class test (on minimum 02 Modules) and the other is a
class test / assignment on case studies / course project.
b. Mid Semester Examination (MSE) will be based on 40-50% of the syllabus.

2. End-Semester Examination:
• Question paper will comprise of full syllabus.
• In the question paper, weightage of marks will be proportional to the total
number of lecture hours as mentioned in the syllabus.
 Teaching Scheme
Credits Assigned
(Contact
Course Course
Pr/
Code Name Tut Tota
Theor Pract. Tut. Theory Oral
. l
y .
Project
ILON5011
Management 3 - - 3 - - 3

Examination Scheme
Theor
Course Course Internal Assessment Pr/
End Exam. T Tota
Code Name Mid Sem Duratio Oral
Te Test Sem W l
Avg. Exa n .
st 2 Exa m (in Hrs)
1 m
Project
ILON5011
Management 20 20 20 20 60 2 - - 100

Course Prerequisite

1. None

Course Objectives

1. To familiarize the students with the use of a Project Management techniques and
tools used in various industry sectors for achieving success in projects.
2. To understand and be able to apply processes and techniques throughout the life
cycle of a project from initiation to closure.

Course Outcomes After successful completion of the course student will be able to …

1. Understand what projects are and what the importance of management and the project
manager is.
2. Analyse and initiate projects based on numeric and non-numeric criteria. Design a
project proposal and build project teams.
3. Analyze the effect of different organizational structures on the execution of projects.
Perform Project estimation and budgeting. Understand role of project management
office.
4. Perform project planning activities including risk planning, scheduling, team building
and resource allocation.
5. Perform project control activities like monitoring & control, auditing, reporting,
tracking, risk mitigation & control.
 6. Perform proper closure of different types of projects. Apply the techniques learned in
the course in the execution of real-life projects.

Module Detailed Content Hours

1 Project Management Fundamentals: Definition of a project, Necessity of
project management, Triple constraints, Project life cycles, Project
phases, Qualities of project manager, Role of project manager. 06
Leadership and Ethics, Project management in various organization
structures.
2 Project Initiation: How to get a project started? Selecting project
strategically, Project selection models (Numeric /Scoring Models and
Non-numeric models), Project portfolio process, Project sponsor and 06
creating charter; Project proposal. Effective project team, Stages of team
development & growth, Conflicts and Negotiations.
3 Project Budgeting and Estimation: Project Plan, Work Breakdown
structure (WBS) and linear responsibility chart, Interface Co-ordination,
06
Project cost estimation and budgeting, Top down and bottoms up
budgeting. Work element costing
4 Project Planning and Management: Project Scheduling, GANTT Chart,
Networking and Scheduling techniques. PERT and CPM. Crashing
project time, Resource loading and leveling, Goldratt's critical chain,
Project Stakeholders and Communication plan. Risk Management in 09
projects: Risk management planning, Risk identification and risk
register. Qualitative and quantitative risk assessment, Project
procurement management. Change Management
5 Project Monitoring and Control: Planning monitoring and controlling
cycle. Information needs and reporting, engaging with all stakeholders of
the projects. Team management, communication and project meetings.
06
Earned Value management techniques for measuring value of work
completed. Using milestones for measurement change requests and scope
creep. Project audits.
6 Project Closure: Customer acceptance. Reasons of project termination,
Various types of project terminations, Process of project termination.
Completing a final report, doing a lessons learned analysis, 06
acknowledging successes and failures. Project management templates
and other resources. Case studies of successful and failed projects.
Total 39

Text books:
1. Jack Meredith & Samuel Mantel, Project Management: A managerial approach,
WileyIndia, 10th Ed.
 2. A Guide to the Project Management Body of Knowledge (PMBOK® Guide), 6th ed.,
Project Management Institute PA, USA.

Reference Books:
1. Harold Kerzner, Project Management: A Systems Approach to Planning, Scheduling,
and Controlling, 12th Ed, Wiley

Evaluation Scheme:
1. In-Semester Assessment:
a. Assessment consists of two Internal Assessments (IA1, IA2) out of which; one
should be compulsory class test (on minimum 02 Modules) and the other is a
class test / assignment on case studies / course project.
b. Mid Semester Examination (MSE) will be based on 40-50% of the syllabus.

2. End-Semester Examination:
• Question paper will comprise of full syllabus.
• In the question paper, weightage of marks will be proportional to the total
number of lecture hours as mentioned in the syllabus.
 Teaching Scheme (Contact
Credits Assigned
Hours)
Course Course
Pr/
Code Name Tut Tota
Theory Pract. Tut. Theory Oral
. l
.
Research
ILON5012
Methodology 3 - - 3 - - 3

Examination Scheme
Theory
Course Course Internal Assessment Pr/
End Exam. T Tota
Code Name Mid Sem Duratio Oral
Test Test Sem W l
Avg. Exa n .
1 2 Exa m (in Hrs)
m
Research
ILON50 12
Methodology 20 20 20 20 60 2 - - 100

Course Prerequisite

1. None

Course Objectives

1. To understand Research and Research Process

2. To acquaint students with identifying problems for research and develop research
strategies
3. To familiarize students with the techniques of data collection, analysis of data and
interpretation
4. To understand and apply different techniques for formulating research problem

Course Outcomes After successful completion of the course student will be able to …

1. Understand basics of research concepts including objectives, issues and problems

2. Summarize and compare different types of research
3. Prepare a preliminary research design for projects in their Course matter areas
4. Accurately collect, analyze and report data
5. Present complex data or situations clearly
6. Review and analyze research findings
Module Detailed Content Hours
1 Introduction and Basic Research Concepts
Research – Definition; Concept of Construct,
Postulate, Proposition, Thesis, Hypothesis, Law, Principle.
Research methods vs Methodology
Need of Research in Business and Social Sciences 09
Objectives of Research
Issues and Problems in Research
Characteristics of Research: Systematic, Valid,
Verifiable, Empirical and Critical
2 Types of Research
Basic Research
Applied Research
Descriptive Research 07
Analytical Research
Empirical Research
2.6 Qualitative and Quantitative Approaches
3 Research Design and Sample Design
Research Design – Meaning, Types and Significance
Sample Design – Meaning and Significance Essentials 07
of a good sampling
Stages in Sample Design Sampling
methods/techniques Sampling Errors
4 Research Methodology
4.1 Meaning of Research Methodology
Stages in Scientific Research Process:
A. Identification and Selection of Research Problem
B. Formulation of Research Problem
C. Review of Literature
D. Formulation of Hypothesis 08
E. Formulation of research Design
F. Sample Design
G. Data Collection
H. Data Analysis
I. Hypothesis testing and Interpretation of Data
J. Preparation of Research Report
5 Formulating Research Problem
5.1 Considerations: Relevance, Interest, Data Availability, 04
Choice of data,
 5.2 Analysis of data, Generalization and Interpretation of
analysis
6 Outcome of Research
Preparation of the report on conclusion reached
04
Validity Testing & Ethical Issues
Suggestions and Recommendation
Total 39

Text books:
1. Dawson, Catherine, 2002, Practical Research Methods, New Delhi, UBS Publishers
Distributors.
2. Kothari, C.R.,1990, Research Methodology-Methods and Techniques, New Delhi,
Wiley Eastern Limited.
3. Kumar, Ranjit, 2005, Research Methodology-A Step-by-Step Guide for Beginners, (2nd
ed), Singapore, Pearson Education
4. Best and Kahn, Research Methodology, PHI Limited.

Reference Books:
1. Garg, B.L., Karadia, R., Agarwal, F. and Agarwal, U.K., 2002. An introduction to
Research Methodology, RBSA Publishers.
2. Sinha, S.C. and Dhiman, A.K., 2002. Research Methodology, EssEssPublications. 2
volumes.

Evaluation Scheme:
1. In-Semester Assessment:
a. Assessment consists of two Internal Assessments (IA1, IA2) out of which; one
should be compulsory class test (on minimum 02 Modules) and the other is a
class test / assignment on case studies / course project.
b. Mid Semester Examination (MSE) will be based on 40-50% of the syllabus.

2. End-Semester Examination:
• Question paper will comprise of full syllabus.
• In the question paper, weightage of marks will be proportional to the total
number of lecture hours as mentioned in the syllabus.
 Teaching Scheme (Contact
Credits Assigned
Course Course Hours)
Code Name Pr/
Theory Pract. Tut. Theory Tut. Total
Oral.
IPR and
ILON5013 3 - - 3 - - 3
Patenting
Examination Scheme
Theory
Course Course Internal Assessment
Code Name End Exam. Pr/
Mid Sem TW Total
Duration Oral.
Test1 Test2 Avg. Sem Exam (in Hrs)
Exam
IPR and
ILON5013 20 20 20 20 60 2 - - 100
Patenting

Course Prerequisite

1. None

Course Objectives

1. To understand intellectual property rights protection system

2. To promote the knowledge of Intellectual Property Laws of India as well as
International treaty procedures
3. To get acquaintance with Patent search and patent filing procedure and
applications
4. To get familiarize with different patent databases

Course Outcomes After successful completion of the course student will be able to …

1. Understand Intellectual Property Rights and importance

2. Demonstrate enforcement of intellectual property rights
3. Work for development, promotion, protection, compliance, and enforcement of
Intellectual Property and Patenting
4. Inspect emerging issues in IPR
5. Assist individuals and organizations in capacity building
6. Understand national and international patent filing procedure
 Module Detailed Content Hours
1 Introduction to Intellectual Property Rights (IPR): Meaning of IPR,
Different category of IPR instruments - Patents, Trademarks, Copyrights,
Industrial Designs, Plant variety protection, Geographical indications,
Transfer of technology etc.
06
Importance of IPR in Modern Global Economic Environment:
Theories of IPR, Philosophical aspects of IPR laws, Need for IPR, IPR as
an instrument of development.

2 Enforcement of Intellectual Property Rights: Introduction, Magnitude

of problem, Factors that create and sustain counterfeiting/piracy,
International agreements, International organizations (e.g. WIPO, WTO)
activein IPR enforcement
05
Indian Scenario of IPR: Introduction, History of IPR in India, Overview
of IP laws in India, Indian IPR, Administrative Machinery, Major
international treaties signed by India, Procedure for submitting patent and
Enforcement of IPR at national level etc.
3 Emerging Issues in IPR: Challenges for IP in digital economy, e-
commerce, human genome, biodiversity and traditional knowledge etc. 07

4 Basics of Patents: Definition of Patents, Conditions of patentability,

Patentable and non-patentable inventions, Types of patent applications
(e.g. Patent of addition etc.), Process Patent and Product Patent,
07
Precautions while patenting, Patent specification Patent claims,
Disclosures and non-disclosures, Patent rightsand infringement, Method
of getting a patent
5 Patent Rules: Indian patent act, European scenario, US scenario,
Australia scenario, Japan scenario, Chinese scenario, Multilateral treaties
where India is a member (TRIPS agreement, Paris convention etc.) 07

6 Procedure for Filing a Patent (National and International):

Legislation and Salient Features, Patent Search, Drafting and Filing Patent
Applications, Processing of patent, Patent Litigation, Patent
Publicationetc, Time frame and cost, Patent Licensing, Patent 07
Infringement
Patent databases: Important websites, Searching international databases

Total 39

Text books:
1. Rajkumar S. Adukia, 2007, A Handbook on Laws Relating to Intellectual Property Rights
in India, The Institute of Chartered Accountants of India.
 2. Keayla B K, Patent system and related issues at a glance, Published by National
Working Group on Patent Laws
3. T Sengupta, 2011, Intellectual Property Law in India, Kluwer Law International
4. Tzen Wong and Graham Dutfield, 2010, Intellectual Property and Human
Development: Current Trends and Future Scenario, Cambridge University Press
5. Cornish, William Rodolph&Llewelyn, David. 2010, Intellectual Property: Patents,
Copyrights, Trade Marks and Allied Right, 7th Edition,Sweet & Maxwell.

Reference Books:
1. LousHarns, 2012, The enforcement of Intellactual Property Rights: A Case Book, 3rd
Edition, WIPO
2. PrabhuddhaGanguli, 2012, Intellectual Property Rights, 1st Edition, TMH
3. R Radha Krishnan & S Balasubramanian, 2012, Intellectual Property Rights, 1st
Edition, Excel Books
4. M Ashok Kumar and mohd Iqbal Ali, 2-11, Intellectual Property Rights, 2nd
Edition,Serial Publications
5. Kompal Bansal and Praishit Bansal, 2012, Fundamentals of IPR for Engineers, 1st
Edition, BS Publications
6. Entrepreneurship Development and IPR Unit, BITS Pilani, 2007, A Manual on
Intellectual Property Rights.
7. Mathew Y Maa, 2009, Fundamentals of Patenting and Licensing for Scientists and
Engineers, World Scientific Publishing Company
8. Indian Patent Acts and Rules (Online – Indian patent office)

Evaluation Scheme:
1. In-Semester Assessment:
a. Assessment consists of two Internal Assessments (IA1, IA2) out of which; one
should be compulsory class test (on minimum 02 Modules) and the other is a
class test / assignment on case studies / course project.
b. Mid Semester Examination (MSE) will be based on 40-50% of the syllabus.

2. End-Semester Examination:
• Question paper will comprise of full syllabus.
• In the question paper, weightage of marks will be proportional to the total
number of lecture hours as mentioned in the syllabus.
 Teaching Scheme (Contact
Credits Assigned
Course Hours)
Course Name
Code Pr/
Theory Pract. Tut. Theory Tut. Total
Oral.
-Entrepreneurship
ILON5014 Development and 3 - - 3 - - 3
Management
Examination Scheme
Theory
Course Internal Assessment
Course Name End Exam. Pr/
Code Mid Sem TW Total
Duration Oral.
Test1 Test2 Avg. Sem Exam (in Hrs)
Exam
Entrepreneurship
ILON5014 Development and 20 20 20 20 60 2 - - 100
Management
Course Prerequisite

1. None

Course Objectives

1. To motivate the students to become and/or work for entrepreneurship and start-ups
2. To understand and be able to apply processes, problem-solving techniques and legal clauses for
success in venture

Course Outcomes After successful completion of the course student will be able to …

1. Understand the ideation process and the importance of innovative thinking

2. Develop Business plans, financial analysis and perform market analysis for their venture
3. Familiarize with Legal matters
4. Understanding government schemes and support
5. Prepare proper pitch for funding
6. Use tools and techniques for solving problems
Module Detailed Content Hours
1 Ideation: Idea Identification and Assessment. Idea Validation. Documentation of Ideas
6
and Feasibility Analysis. Introduction to Entrepreneurship and Business Startups.
2 Business Planning and Financial Basics: Learn how to build an effective Business Plan
for your venture. Understand the fundamentals of finance & accounting comprising of
financial statements. Break-even analysis. Risk Assesment. Marketing Plans,
9
Management and Personnel, Start-up Costs and Financing as well as Projected Financial
Statements. Capital and its Importance to the Entrepreneur Starting a New Business,
Buying an Existing Business, New Product Development, Business Growth.
3 Legal Foundations: Define the right legal foundation for your company and explore
fundamentals like Company Registration, Compliances and Patents. Entrepreneur Law 6
and its Relevance to Business Operations.
4 Government support: Indian Environment for Entrepreneurship: key regulations and
legal aspects, Schemes and policies of the Ministry of MSME, role and responsibilities
of various government organisations, departments, banks etc., Role of State governments
6
in terms of infrastructure developments and support etc., Public private partnerships,
National Skill development Mission, Credit Guarantee Fund, PMEGP, discussions, group
exercises etc.
5 Fund Raising: Company valuation, Fundraising, Equity Management. Role of Money
and Capital Markets in Entrepreneurial Development: Contribution of Government 6
Agencies in Sourcing information for Entrepreneurship.
6 Small Business: Achieving Success In The Small Business: Stages of the small business
life cycle, four types of firm-level growth strategies, Options – harvesting or closing small
6
business Critical Success factors of small business rectangular games without saddle point
– mixed strategy for 2 X 2 games, 2Xn and mX2 games.
Total 39

Text books:
1. PoornimaCharantimath, Entrepreneurship development- Small Business Enterprise,
Pearson
2. Education Robert D Hisrich, Michael P Peters, Dean A Shapherd, Entrepreneurship,
latest edition, The McGrawHill Company
3. Dr TN Chhabra, Entrepreneurship Development, Sun India Publications, New Delhi
4. Dr CN Prasad, Small and Medium Enterprises in Global Perspective, New century
Publications, New Delhi
Reference Books:
1. Law and Practice relating to Micro, Small and Medium enterprises, Taxmann
Publication Ltd.
2. Kurakto, Entrepreneurship- Principles and Practices, Thomson Publication

Evaluation Scheme:
1. In-Semester Assessment:
a. Assessment consists of two Internal Assessments (IA1, IA2) out of which; one
should be compulsory class test (on minimum 02 Modules) and the other is a
class test / assignment on case studies / course project.
b. Mid Semester Examination (MSE) will be based on 40-50% of the syllabus.

2. End-Semester Examination:
• Question paper will comprise of full syllabus.
• In the question paper, weightage of marks will be proportional to the total
number of lecture hours as mentioned in the syllabus.
 Teaching Scheme (Contact
Credits Assigned
Hours)
Course Course
Pr/
Code Name Tut Tota
Theory Pract. Tut. Theory Oral
. l
.
Product
ILON5015 Lifecycle
3 - - 3 - - 3
Management

Examination Scheme
Theory
Course Course Internal Assessment Pr/
End Exam. T Tota
Code Name Mid Oral
Sem Duratio W l
Test Test Sem Exa n .
Avg.
1 2 Exa m (in Hrs)
m
Product
ILON5015 Lifecycle
20 20 20 20 60 2 - - 100
Management

Course Prerequisite

1. None

Course Objectives

1. To familiarize the students with the need, benefits and components of PLM.
2. To acquaint students with Product Data Management & PLM strategies.
3. To give insights into new product development program and guidelines for
designing and developing a product.
4. To familiarize the students with Virtual Product Development.

Course Outcomes After successful completion of the course student will be able to …

1. Gain knowledge about phases of PLM, PLM strategies and methodology for PLM
Feasibility study and PDM implementation.
2. Illustrate various approaches and techniques for designing and developing products.
3. Apply product engineering guidelines / thumb rules in designing products for
molding, machining, sheet metal working etc.
4. Acquire knowledge in applying virtual product development tools for components,
machining and manufacturing plan.
5. Integration of environmental aspects in product design.
 6. Carry out Life Cycle Assessment and Life Cycle Cost Analysis.

Module Detailed Content Hours

1 Introduction to Product Lifecycle Management (PLM): Product
Lifecycle Management (PLM), Need for PLM, Product Lifecycle Phases,
Opportunities of Globalization, Pre-PLM Environment, PLM Paradigm,
Importance & Benefits of PLM, Widespread Impact of PLM, Focus and
Application, A PLM Project, Starting the PLM Initiative, PLM
09
Applications.
PLM Strategies: Industrial strategies, Strategy elements, its
identification, selection and implementation, Developing PLM Vision
and PLM Strategy, Change management for PLM.
2 Product Design: Product Design and Development Process,
Engineering Design, Organization and Decomposition in Product
Design, Typologies of Design Process Models, Reference Model,
Product Design in the Context of the Product Development Process,
Relation with the Development Process Planning Phase, Relation with
the Post design Planning Phase, Methodological Evolution in Product
08
Design, Concurrent Engineering, Characteristic Features of Concurrent
Engineering, Concurrent Engineering and Life Cycle Approach, New
Product Development (NPD) and Strategies, Product Configuration and
Variant Management, The Design for X System, Objective Properties
and Design for X Tools, Choice of Design for X Tools and Their Use in
the Design Process.
3 Product Data Management (PDM): Product and Product Data, DM
systems and importance, Components of PDM, Reason for implementing
04
a PDM system, financial justification of PDM, barriers to PDM
implementation.
4 Virtual Product Development Tools: For components, machines, and
manufacturing plants, 3D CAD systems and realistic rendering
06
techniques, Digital mock-up, Model building, Model analysis, Modeling
and simulations in Product Design, Examples/Case studies.
5 Integration of Environmental Aspects in Product Design: Sustainable
Development, Design for Environment, Need for Life Cycle
Environmental Strategies, Useful Life Extension Strategies, End-of-Life
06
Strategies, Introduction of Environmental Strategies into the Design
Process, Life Cycle Environmental Strategies and Considerations for
Product Design.
6 Life Cycle Assessment and Life Cycle Cost Analysis: Properties, and
Framework of Life Cycle Assessment, Phases of LCA in ISO Standards, 06
Fields of Application and Limitations of Life Cycle Assessment, Cost
 Analysis and the Life Cycle Approach, General Framework for LCCA,
Evolution of Models for Product Life Cycle Cost Analysis.
Total 39

Text books:

1. John Stark, “Product Lifecycle Management: Paradigm for 21st Century Product
Realisation”, Springer-Verlag, 2004. ISBN: 1852338105.
2. Fabio Giudice, Guido La Rosa, AntoninoRisitano, “Product Design for the
environment-A life cycle approach”, Taylor & Francis 2006,
ISBN: 0849327229.

Reference Books:

1. Saaksvuori Antti, Immonen Anselmie, “Product Life Cycle Management”, Springer,

Dreamtech, ISBN: 3540257314.
2. Michael Grieve, “Product Lifecycle Management: Driving the next generation of lean
thinking”, Tata McGraw Hill, 2006.

Evaluation Scheme:

In-Semester Assessment:

a. Assessment consists of two Internal Assessments (IA1, IA2) out of which; one
should be compulsory class test (on minimum 02 Modules) and the other is a
class test / assignment on case studies / course project.
b. Mid Semester Examination (MSE) will be based on 40-50% of the syllabus.

End-Semester Examination:

• Question paper will comprise of full syllabus.

• In the question paper, weightage of marks will be proportional to the total
number of lecture hours as mentioned in the syllabus.
 Teaching Scheme (Contact
Credits Assigned
Hours)
Course
Course Name Pr/
Code Tut Total
Theory Pract. Tut. Theory Oral.
.
Professional
CEL502
Communicati - 4 - - - 2 2
on & Ethics
Examination Scheme
Theory
Internal Assessment Pr/
Course End Exam. Oral.
Course Name Mid Sem Duration TW Tota l
Code
Test Test Avg Sem
Exam (in Hrs)
1 2 . Exam

Professional
CEL502
Communicati - - - - - - 25 25 50
on & Ethics

Course Prerequisite

1. None

Course Objectives

1. Discern and develop an effective style of writing important technical/business

documents.
2. Investigate possible resources and plan a successful job campaign.
3. Analyze personal traits, interests, values, aptitudes and skills.
4. Understand the dynamics of professional communication required for career
enhancement.
5. Develop creative and critical thinking required for effective workplace
communication.
6. Understand what it means to act with integrity and have a personal code of ethics
for regulating organizational behaviour.

Course Outcomes After successful completion of the course student will be able to …

1. Plan and prepare effective business/ technical documents which will in turn provide
solid foundation for their future managerial roles.
2. Strategize their personal and professional skills to build a professional image and
meet the demands of the industry.
3. Gain expertise in preparing job search documents meeting the industry trends.
4. Merge successful in professional project presentations, group discussions and result
 oriented agreeable solutions in group communication situations.
5. Apply critical and creative thinking to overcome workplace challenges by
understanding professional relationships.
6. Apply codes of ethical conduct, personal integrity and norms of organizational
behaviour.

Module Detailed Content Hours

1 ADVANCED TECHNICAL WRITING
Purpose and Classification of Reports
Parts of a Long Formal Report
Language, Formatting and Referencing of a Report 8
Definition, Purpose & Types of Proposals
Parts of a Memorandum Format Proposal
Technical Paper Writing
2 EMPLOYMENT SKILLS
Group Discussions
5
Cover Letter & Resume
2.3 Personal Interviews
3 MANAGING BUSINESS MEETINGS AND DOCUMENTATION
Understanding Business Meetings
2
Planning & Scheduling Meetings
Meeting Documentation
4 TECHNICAL/ BUSINESS PRESENTATION SKILLS
Effective Presentation Strategies 3
Ways to Make Effective Slides
5 DEVELOPING INTERPERSONAL SKILLS & WORK ETHICS
Interpersonal Skills & Organisational Behaviour 8
Introduction to Intellectual Property Rights
6 Etiquette and Manners
2
6.1. Etiquette and Manners
Total 28

LIST OF ASSIGNMENTS FOR TERMWORK

1. Synopsis of Report, Questionnaire, Memo Report/ Letter Report

2. Short Proposal
3. Meeting Documentation (Notice, Agenda & Minutes)
 4. Paraphrasing a Technical Paper/ Analysing an existing Technical Paper
5. Aptitude test (Verbal Ability), Cover Letter and Resume
6. Case studies and Role Plays on Interpersonal Skills, IPR, Corporate Ethics and
Etiquettes (Evaluation will be based on the active participation of the students during
classroom interactive sessions)

Note:

1. The project report Main Body should be minimum 25 pages (excluding Front and
Back matter).
2. The group size for the final report presentation should not be less than 7 students or
exceed 10 students.
3. Keep the same students in a group for both the proposal presentation and the final
report presentation so as to encourage better team dynamics.
4. There will be an Internal oral evaluation for the final report submission and project
presentation.
 Theory Tutori
Theory Practical Tutorial Practical/O Total
Credit al
Hrs Hrs Hrs r al Credits
Credit
Credit
s
Skill
Based
CESL501 Lab
- 02 - - 01 - 01
III –
Pytho
n

Examination Scheme
Term
Practical Oral Total
Theory Marks Work
& Oral
Subject Subjec
Code t Name In-Sem Evaluations End
Mid Sem
IA IA AV Sem Exa
1 2 G Exa
m
m
Skill
CESL501 Based
Lab - - - - - 25 25 - 50
III –
Python

Lab Objectives:

1. To learn basics of Python programming

2. To explore decision making and functions in Python
3. To implement Object Oriented features using Python
4. To investigate Files Handling in Python
5. To perform GUI Programming and Databases operations in Python

Lab Outcomes: At the end of the course, the learner will be able to

1. Describe the Numbers, Math functions, different Decision Making statements and
Functions.
2. Express Strings, List, Tuples and Dictionaries in Python.
3. Interpret Object oriented programming in Python.
4. Apply different exception handling functions.
5. Understand and summarize different File handling operations.
6. Understand different database operations.
Prerequisite:
1. Data Structures

Suggested List of Experiments (programming in python)

Experiment Experiments Name CO
No. Mapping
1 Write python programs to understand Expressions, CO1
Variables, Basic Math operations and different decision-
making statements and Functions.
2 Write python programs to understand Strings: Basic String CO2
Operations, String Methods and List.
3 Write python programs to understand Tuples, Dictionaries, CO2
Arrays.
4 Write python programs to understand different Object- CO3
oriented features in Python programs based on Classes,
objects and constructors.
5 Write python programs to understand different Object CO3
oriented features in Python programs based on Inheritance.
6 Write python programs to understand different Object CO3
oriented features in Python programs based on
polymorphism.
7 Write python programs to understand different Object- CO4
oriented features in Python programs based on Exception
handling.
8 Write python programs to understand different File handling CO5
operations.
9 Write python programs to understand different plotting CO6
functions using any dataset.
10 Write python programs to understand GUI designing and CO6
database operations programs based on Tkinter.
11 Write python programs to understand GUI designing and CO6
database operations programs based on Mysql database
creation & Database connectivity with DML operations
using python.
12 Case Study on any Machine Learning Algorithim. CO6

Text Books:

1. James Payne, ”Beginning Python: Using Python 2.6 and Python 3.1”,Wrox
Publication
2. Dr. R. Nageswara Rao,”Core Python Programming” , Dreamtech Press, Wiley
Publication
 3. Magnus Lie Hetland,”Beginning Python From Novice to Professional”, Second
Edition”, Apress Publication

Reference Books:

1. Wesley J Chun,” Core Python Applications Programming”, Third Edition, Pearson

Publication.
2. E. Balguruswamy, “Introduction to Computing and Problem-Solving using Python”,
McGraw Hill Publication
3. Learn to Master Python, from Star EDU solutions , by ScriptDemicsTerm Work.

Term Work:
The Term work Marks are based on the weekly experimental performance of the students, Oral
performance and regularity in the lab.
Students are expected to be prepared for the lab ahead of time by referring the manual and
perform the experiment under the guidance and discussion. Next week the experiment write-
up to be corrected along with oral examination.

End Semester Examination:

End of the semester, there will be Practical examination along with oral evaluation based on
the laboratory work and the corresponding theory syllabus.
 Theor Practica Tutoria Theor Practical/Ora Tutoria Total
y l l y l l Credit
Hrs Hrs Hrs Credit Credit Credits s
Mini
CEMP50
Projec - 04 - - 02 - 02
1
t III

Examination
Scheme
Subjec
Theory Marks Ter Practica Ora Tota
Subject Name
m l & Oral l l
Code
Wor
k
End
In-Sem Evaluations Sem
Exa
m
Mi
IA IA Avg.o
d
1 2 f 2
IAs Se
m
Exam
Mini
CEMP50
Project - - - - - 25 - 25 50
1
III

Prerequisites: Technology Stack

Lab Description:
The students will undergo the experience of developing a project using the latest
ntechnology and tools by applying all stages of project development life cycle.
They are expected to learn the skills of teamwork, survey of the problem domain,
understand the issues to be addressed and implement any real life application
which will meet societal requirements. A quality report exploring technical report
writing skills will be generated as a part of activity.

Objectives :

1. To inculcate the process of self-learning and research.

2. To acquaint with the process of identifying the needs by performing the
problem analysis and literature survey
3. To select the relevant technologies and design a solution.
 4. To implement the solution and perform validation and anlaysis of the results.

Outcomes: After successful completion of this lab, the learner will be able to,

1. Identify the issues in the society related to preferred domain of study.

2. Conduct survey and analysis of existing systems for identified issue.
3. Formulate the problem and design a solution for solving it
4. Systematically plan and implement the solution.
5. Perform validation and anlaysis of the results.
6. Prepare a technical report and present the findings of the study

Guidelines:
1. Students shall form a group of 3 to 4 students.
2. Students should do survey and identify needs, which shall be converted
into problem statement for mini project in consultation with faculty
supervisor/head of department/internal committee of faculties.
3. Faculty supervisor will give inputs to students during mini project
activity; however, focus shall be on self-learning.
4. Students in a group shall understand problem effectively, propose
multiple solutions and select best possible solution in consultation with
guide / supervisor.
5. Students have to develop an application based on programming language
they have learned during course.
6. Students can develop project using the latest tools and techniques of their
choice.

Term Work:
The review/ progress monitoring committee shall be constituted by head of departments
of the institute. There will be 2 reviews to evaluate the progress of mini project.
In continuous assessment focus shall also be on each individual student, assessment
based on individual’s contribution in group activity, their understanding, contribution
and response to questions.
The Term work Marks are based on the weekly performance of the students, review
performances, quality of the report, Oral performance and regularity.

End Semester Examination:

End of the semester, a panel of examiners will take a presentation and demonstration
on the Mini Project along with oral evaluation.
 Teaching Scheme (Contact
Credits Assigned
Hours)
Course Course
Pr/
Code Name Tut Tota
Theory Pract. Tut. Theory Oral
. l
.
Financial
HBSO501
Accounting - - - 1* - - 1*
(Online)
Examination Scheme
Theory
Course Course Internal Assessment Pr/
End Exam. Tota
Code Name Mid Sem Duratio TW Oral
Test Test Avg Sem l
Exa n .
1 2 . Exa m (in Hrs)
m
Financial
HBSO501
Accountin - - - - - - - - -
g (Online)

Course Objectives

1. This course will teach you the fundamentals of financial accounting from the
ground up.
2. You will learn how to prepare a balance sheet, income statement, and cash flow
statement, analyze financial statements, and calculate and interpret critical ratios.
3. You will also learn the role of managerial judgment in choosing accounting
estimates and methods.
4. The course concludes with an introduction to forecasting and valuation.

Module Lessons Key Takeaways

• Accounting Equation
Components
• Understand the accounting equation
• Basic Transactions and
and demonstrate how different
01: The the Equation
transactions impact it
Accounting • Accounting Principles
• Define key accounting concepts and
Equation and Rules
principles
• Formal Definitions of
Accounting
Terms
 • Journal Entries and T-
Accounts • Understand where financial statement
02: Recording
information originates by recording
Transactions • Advanced Journal Entries
business transactions as journal entries
• The Trial Balance
• Construct the balance sheet and income
03: Financial • The Balance Sheet
statement to learn their purpose and
Statements • The Income Statement
format
• Understand complex accounting
• Accruals and Deferrals transactions and how they relate to
04: Adjusting • Long-Lived Assets accounting principles
Journal Entries • Inventory • Recognize the impact of judgment and
• Deferred Taxes bias on financial statements and
accounting practices
• Operating: Direct Method
05: The • Use the statement of cash flows to
• Operating: Indirect
Statement of evaluate the financial health and life-
Method
Cash Flows cycle stage of a business
• Investing and Financing
• Profitability
• Efficiency
06: Analyzing • Analyze ratios and use the DuPont
• Leverage
Financial Framework to evaluate the financial
• Other Ratios state of a business
Statements
• Impact of Policy
Differences
• Pro-Forma Financial • Prepare and evaluate financial
Statements forecasts used to make strategic
• Projecting Free Cash decisions
07: Forecasting
Flows • Calculate and forecast free cash flows
and Valuation
• Valuation • Learn how to value a venture, project,
• Determining Relevant or investment opportunity and perform a
Cash Flows sensitivity analysis of key assumptions
Semester VI
 heory ractical utorial heory Total
Hrs Hrs Hrs redit actical/Oral utorial Credits
Credit redits

Machine
CEC601 03 – – 03 – – 03
Learning

Examination Scheme
Term
Practica Ora Tota
Theory Marks Wor
l & Oral l l
Course Course k
Code Name In-Sem Evaluations End
Mid Sem
IA IA AV Sem Exa
1 2 G Exa
m
m
Machine
CEC60
Learnin 20 20 20 20 60 - - - 100
1
g

Course Objectives:

1. To understand human learning aspects and relate it with machine learning concepts.
2. To understand the nature of the problem and apply machine learning algorithms.
3. To apply machine learning techniques to solve real world problems.

Course Outcomes: After completion of this course learner will be able to

1. Understand the basic concepts of machine learning.

2. Extract different feature vectors from the given data.
3. Apply different regression techniques on the input data.
4. Apply and analyse the performance of classification algorithms.
5. Form clusters using various similarity measures.
6. Understand the working of reinforcement learning.

Prerequisites:

1. Linear Algebra
2. Statistics
3. Programming Language
Sr. Detailed Content CO
Module Hours
No. Mapping

Introduction, Categories of Learning

Introduction to Algorithms, Machine Learning tasks,
1 Machine Issues, Applications, Key 04 CO1
Learning terminologies, Steps in developing
machine learning applications.

Need, creating training and test sets,

managing categorical data, Managing
Data missing features, Data scaling and
2 05 CO2
Preprocessing normalization, Feature selection and
Filtering, Dimension Reduction-
Principal Component Analysis (PCA)

Linear models, Linear Regression and

higher dimensionality
Logistic Regression, Classification
metrics.

Learning for Decision Tree, Random forest

3 08 CO3
Regression Introduction to Neural Networks, NN
for Regression
Model selection, evaluation and
validation

Naïve Bayes Classifiers,

Support Vector Machine (SVM)-
Linear SVM,
Supervised Decision Tree, Construction of
4 10 CO4
Learning Decision tree for rule-based
classification,
Ensemble Learning- Random Forest.
HMM
 NN for classification- feed forward
network
Model selection, evaluation and
validation

Fundamentals, K-means, Hierarchical

Clustering, Expectation maximization
clustering.
Unsupervised NN for clustering- SOM
5 06 CO5
learning
Model selection, evaluation and
validation

Introduction, Learning Task, Q

Learning, Temporal Difference
Reinforcement Learning, Generalization
6 06 CO6
Learning Time series forecasting
Model selection, evaluation and
validation

Text Books:
1. Tom M Mitchell, “Machine Learning”, McGraw Hill Education.
2. Peter Harrington “Machine Learning in Action”, DreamTech Press.

Reference Books:
1. Giuseppe Bonaccorso, “Machine Learning Algorithms”, Packt Publishing
Limited, ISBN-10: 1785889621, ISBN-13: 978-1785889622.

Evaluation Scheme:
1. In-Semester Assessment:
• Assessment consists of two Internal Assessments (IA1, IA2) out of which; one
should be compulsory class test (on minimum 02 Modules) and the other is a
class test / assignment on case studies / course project.
• Mid Semester Examination (MSE) will be based on 40-50% of the syllabus.

2. End-Semester Examination:
• Question paper will comprise of full syllabus.

• In the question paper, weightage of marks will be proportional to the total

number of lecture hours as mentioned in the syllabus.
 Theo Tutori
Theo Practic Tutori Practical/O Total
ry al
ry al al ral Credi
Credi Credit
Hrs Hrs Hrs Credit ts
t s

CECDLO6 Compiler 03 – — 03 – — 03
031 Design

Examination Scheme

Term Practical
Work &Oral Oral Total
Theory Marks
Course Course
Code Name
In-Sem Evaluations End
Mid Sem
IA IA 2 AVG Sem
Exa
1 Exam
m

CECDLO6031 Compiler
Design 20 20 20 20 60 – – – 100

Course Objectives:

1. To learn the process of translating a modern high-level language to executable code.

2. To provide understanding of the fundamental principles in compiler design.
3. To explore the concepts of run time storage environment.

Course Outcomes: At the end of the course learner will able to

1. Describe design of compilers along with phases and perform lexical analysis on various
programs.
2. Develop understanding of the different types of parsing techniques and to construct
parsers according to given grammar.
3. Apply semantic analysis over the program to design efficient applications.
4. Evaluate the different run time storage management techniques with respect to efficient
application development.
5. Analyze different types of intermediate code to design efficient applications.
6. Apply the optimization techniques to produce an efficient intermediate and machine code.
Prerequisites:

1. Theoretical Computer Science

2. Data Structure
3. Programming Language Fundamentals

Sr. CO
Module Detailed Content Hours
No. Mapping

Foundation Foundation of System Software, Introduction

of System to Compilers.
Software Lexical Analysis: Role, Specification and
1 5 CO1
and Recognition of Tokens, LEX.
Introduction
to Compiler

Overview of Context Free Grammar, Left

Syntax Recursion, Left Factoring.
2 9 CO2
Analysis Top Down Parsing, Bottom up Parsing,
YACC.

Introduction, Need, Type checking and Type

Semantic
3 conversion. Syntax Directed Translation, 5 CO3
Analysis
Syntax Directed Definition (SDD).

Storage Organization, Storage Allocation

Run Time Strategies, Activation Records, Handling
4 4 CO4
Environment Recursive calls, Parameter Passing, Dynamic
Storage Allocation Strategies

Intermediate Need, Types, Intermediate code generation

5 code for various constructs, Translation Scheme, 8 CO5
Generation Back Patching.

Code Optimization: Need, Machine

Code dependent and machine independent
Optimization optimization techniques
6 8 CO6
and code Code Generation: Issues, Basic blocks, Flow
Generation Graphs, Simple code generator, optimization
of basic blocks.
Text Books:

1. A.V. Aho, R. Shethi, Ulman, “Compilers - Principles, Techniques and Tools'‘, Pearson
Education, 1st Edition.
2. John R. Levine, Tony Mason, Doug Brown, “LEX & YACC”, O ‘Reilly, 2nd Edition.
3. Dick Grune, Henri E. Bal, Ceriel J. H. Jacobs, Koen G. Langendoen, “Modern Compiler
Design”, Wiley.

Reference Books:

1. Kenneth C. Louden, “Compiler Construction: Principles and practices”, Cengage

Learning.
2. K Muneeswaran, “Compiler Design”, Oxford University press.
3. D. M Dhamdhere, “Systems programming and Operating Systems”, Tata McGraw Hill,
Revised Second Edition.
4. J. J. Donovan, “Systems Programming”, Tata McGraw Hill, Edition 1991.

Evaluation Scheme:
1 In-Semester Assessment:
● Assessment consists of two Internal Assessments (IA1, IA2) out of which; one should
be compulsory class test (on minimum 02 Modules) and the other is a class test /
assignment on case studies / course project.
● Mid Semester Examination (MSE) will be based on 40-50% of the syllabus.

2 End-Semester Examination:
● Question paper will comprise of full syllabus.
● In the question paper, weightage of marks will be proportional to the total number of
lecture hours as mentioned in the syllabus
 Theo Practical Tutorial
Theory Practical Tutorial Total
ry / Credits
Hrs Hrs Hrs Credits
Credi Oral
t Credit
Data
CECDLO60 Warehousi
03 - - 03 - - 03
32 ng and
Mining

Examination Scheme

Term Practical
Oral Total
Theory Marks Work & Oral
Course
Course Code
Name
In-Sem Evaluations End
Mid Sem
IA 1 IA 2 AVG Sem
Exam
Exam

Data
CECDLO6032 Warehoui
20 20 20 20 60 – – – 100
ng Mining

Course objectives:

1. To identify the scope and essentiality of Data Warehousing and Mining.

2. To analyse data, choose relevant models and algorithms for respective applications.
3. To study spatial and web data mining.
4. To develop research interest towards advances in data mining.

Course outcomes: On successful completion of course learner will be able to:

1. Understand Data Warehouse fundamentals with dimensional modelling
2. Understand OLAP operations in Multidimensional Data Model
3. Understand Data Mining and Data Pre-processing steps.
4. Explore frequent patterns and Association mining algorithms.
5. Apply various classification and clustering techniques on real world scenario.
6. Describes social network in Web Mining and apply web mining algorithm.

Prerequisites:
Database Management Systems
 Sr. CO
Module Detailed Content Hours
No. Mapping

Introduction to Introduction to Data Warehouse, Data

1 Data- Warehouse architecture, Data Marts, 05 CO1
Warehousing Datawarehouse schema- Data Cubes, Stars,
Snowflakes and Fact Constellations.
Need for Online Analytical Processing;
Online OLTP V/s OLAP,OLAP Operations in
Analytical Multidimensional Data Model, OLAP
2 Processing Models, 07 CO2
(OLAP) and ETL: Steps in ETL Process, Data
ETL Extraction; Task involved in Data
Transformation, Techniques of Data
Loading
Data Mining Process- Task Primitives,
Data Mining Data mining architecture, Knowledge Data
3 and Data Pre- Discovery (KDD), Issues and applications 07 CO3
processing of Data mining, Steps in Data pre-
processing.
Market Basket Analysis, Frequent Item
Introduction to sets, Closed Item sets, and Association
4 Association Rule, Frequent Pattern, Mining, Apriori 08 CO4
Mining Algorithm, FP-growth, Mining Multilevel
Association Rules, Multidimensional
Association Rules.
Basic concepts in classification, Decision
Tree Induction, Bayesian Classification
method –evaluating the accuracy of
Classification classifier.
5 08 CO5
and Clustering Clustering techniques, Hierarchical
Methods(Agglomerative and Divisive
Clustering) ,Density based clustering,
Outlier Analysis.
Introduction, Web Content Mining:
Crawlers, Harvest System, Virtual Web
6 Web Mining View, Personalization, Web Structure 04 CO6
Mining: Page Rank, Clever, Web Usage
Mining

Text Books:

1. Han, Kamber, "Data Mining Concepts and Techniques", Morgan Kaufmann 3rd
edition.
2. Data Warehousing Fundamentals, P. Ponnian, John Wiley.
3. ReemaTheraja ―Data warehousing‖, Oxford University Press.
Reference Books:

1. Paul Zikopoulos, Chris Eaton, Dirk DeRoos, Tom Deutsch, George Lapis,
Understanding Big Data: Analytics for Enterprise Class Hadoop and Streaming,
McGraw-Hill Osborne Media, 2011.
2. Ian H. Witten, Eibe Frank and Mark A. Hall " Data Mining ", 3rd Edition Morgan
kaufmann publisher.
3. Pang-Ning Tan, Michael Steinbach and Vipin Kumar, Introduction to Data Mining",
Person Publisher.

Evaluation Scheme:
1. In-Semester Assessment:
● Assessment consists of two Internal Assessments (IA1, IA2) out of which; one should
be a compulsory class test (on minimum 02 Modules) and the other is a class test /
assignment on case studies / course project.
● Mid Semester Examination (MSE) will be based on 40-50% of the syllabus.

2. End-Semester Examination:
● Question paper will comprise a full syllabus.
● In the question paper, weightage of marks will be proportional to the total number of
lecture hours as mentioned in the syllabus
 Theory Practical/ Tutorial Total
Theory Practical Tutorial
Credit Oral Credits Credits
Hrs Hrs Hrs
Credit

Comput
CECDLO6
er 3 - - 3 - - 3
033
Vision

Examination Scheme
Term
Practial
Work Oral Total
Theory Marks & Oral
Course Course
Code Name
In-Sem Evaluations End
Mid Sem
IA 1 IA2 AVG Sem
Exa
Exa
m
m
Computer
CECDLO60
Vision 20 20 20 20 60 - - - 100
33

Course Objectives:

1. To recognize and describe both the theoretical and practical aspects of computing
with images.
2. To connect issues from computer vision to human vision.
3. To explore various vision techniques and build computer vision applications.

Course Outcomes: At the end of the course learner will able to

1. Describe the foundation of image formation and image analysis.

2. Explore various advance approaches in image segmentation.
3. Illustrate ways to describe and represent images.
4. Represent objects using different area features.
5. Apply recognition steps to identify objects.
6. Perceive detailed mechanisms for image alignment and matching.

Prerequisites:

1. Engineering Mathematics
2. Digital Signal and Image Processing
 Sr. CO
Module Detailed Content Hours
No. Mapping
Introduction, Photometric Image Formation,
Image Image formation Models, Camera Model,
1 Camera Calibration and Parameters (location, 4 CO1
Formation
orientation)
Thresholding, connected component labeling,
Binary
Hierarchal segmentation, Spatial clustering,
Machine
2 Graph based segmentation, Rule-based 8 CO2
Vision /
Segmentation, Motion-based segmentation,
Segmentation
Semantic Segmentation
Morphological Image Processing:
Image
Morphological Operations and algorithms,
Representation
3 Representation schemes, Boundary 7 CO3
and
descriptors, Region descriptors, SIFT, HoG
Description
descriptor
Region properties, External points, Spatial
Area Extraction
moments, Mixed spatial gray-level moments
4 and Region 8 CO4
Edge, Line-Linking, Hough transform, Line
Analysis
fitting, Curve fitting (Least-square fitting)
Recognition Methodology, labeling lines,
understanding line drawings, Classification of
Facet Model
5 shapes by labeling of edges, Recognition of 6 CO5
Recognition
shapes, Consisting labeling problem, Back-
tracking Algorithm
Object representation: Global vs. Local
features, General Frameworks for Matching:
Object Models
6 Distance relational approach, ordered 6 CO6
and Matching
structural matching, View class matching,
stereo image matching

Text Books:

1. Shah M., “Fundamentals of Computer Vision”, 1997.

2. Szeliski R., “Computer Vision: Algorithms and Applications”, Springer, 2011

Reference Books:

1. Robert Haralick and Linda Shapiro, "Computer and Robot Vision", Vol I, II, Addison-
Wesley, 1993.
2. David A. Forsyth, Jean Ponce, "Computer Vision: A Modern Approach"
Evaluation Scheme:
1. In-Semester Assessment:
● Assessment consists of two Internal Assessments (IA1, IA2) out of which; one should
be compulsory class test (on minimum 02 Modules) and the other is a class test /
assignment on case studies / course project.
● Mid Semester Examination (MSE) will be based on 40-50% of the syllabus.

2. End-Semester Examination:
● Question paper will comprise of full syllabus.
● In the question paper, weightage of marks will be proportional to the total number of
lecture hours as mentioned in the syllabus
 Practical/
Theory Practical Tutorial Theory Tutorial Total
Oral
Hrs Hrs Hrs Credit Credits Credits
Credit

Cryptography
CECDLO6034 & Network 03 - - 03 - - 03
Security

Examination Scheme
Term Practical
Theory Marks Oral Total
Work & Oral
Course Code Course Name
In-Sem Evaluations End
Mid Sem
IA1 IA2 AVG Sem
Exam
Exam

Cryptography
CECDLO6034 & System 20 20 20 20 60 - - - 100
Security

Course Objectives

1. To introduce classical encryption techniques and concepts of modular arithmetic and

number theory.
2. To explore the working principles and utilities of various cryptographic algorithms.
3. To explore the design issues and working principles of various authentication protocols,
PKI standards and various secure Communication standards.
4. To develop existing cryptographic utilities to build programs for secure
communication.

Course Outcomes: On successful completion of course, learner will be able to:

1. Perceive system security goals and concepts, classical encryption techniques and
acquire fundamental knowledge on the concepts of modular arithmetic and number
theory.
2. Compare and apply different encryption and decryption techniques to solve problems
related to confidentiality and authentication.
3. Apply the Key distribution and Management techniques
 4. Apply the knowledge of cryptographic checksums and evaluate the performance of
different message digest algorithms for verifying the integrity of varying message sizes.
5. Apply different digital signature algorithms to achieve authentication and design secure
applications.
6. Perceive network security basics, analyze different attacks on networks and evaluate
the performance of firewalls and security protocols.

Prerequisites:

1. Engineering Mathematics
2. Computer Networks
3. Operating Systems

CO
SNo Module Detailed Contents Hours
Mapping

Security Goals, Attacks, Services and

Mechanisms, Techniques. Modular
Arithmetic: Euclidean Algorithm,
Fermat’s and Euler’s theorem
Number Theory Classical Encryption techniques,
1 and Basic Symmetric cipher model, mono-alphabetic 08 CO1
Cryptography and polyalphabetic substitution
techniques: Vigenere cipher, playfair
cipher, Hill cipher, transposition
techniques: keyed and keyless
transposition ciphers

Block cipher principles, block cipher

modes of operation, DES, Double DES,
Triple DES, Advanced Encryption
Symmetric and Standard (AES), RC5, Stream Ciphers:
2 Asymmetric key RC4 algorithm. 10 CO2
Cryptography Public key cryptography: Principles of
public key cryptosystems-The RSA
Cryptosystem, The knapsack
cryptosystem

Symmetric Key Distribution: KDC,

Needham-schroeder protocol. Kerberos:
Key Management Kerberos Authentication protocol,
3 06 CO3
Symmetric key agreement: Diffie
Hellman, Public key Distribution: Digital
Certificate: X.509, PKI
 Cryptographic hash functions, Properties
Cryptographic
4 of secure hash function, MD5, SHA-1, 04 CO4
Hash Functions
MAC, HMAC, CMAC.

User Authentication, Entity

Authentication
Authentication: Password Base, Challenge
Protocols &
5 Response Based 04 CO5
Digital Signature
Digital Signature, Attacks on Digital
Schemes
Signature, Digital Signature Scheme: RSA

Network security basics: TCP/IP

vulnerabilities (Layer wise), Network
Attacks: Packet Sniffing, ARP spoofing,
port scanning, IP spoofing
Network Security
6 Denial of Service, Internet Security 07 CO6
and Applications
Protocols: PGP, SSL, IPSEC. Network
security: IDS, Firewalls, system security:
malicious Programs: Worms and Viruses,
SQL injection

Text Book:
1. Bruce Schneier, “Applied Cryptography, Protocols Algorithms and Source Code in C”,
Second Edition, Wiley.

References Book:

1. Atul Kahate, “Cryptography and Network Security”, Tata McGraw-Hill Education,

2003.
2. Eric Cole, “Network Security Bible”, Second Edition, Wiley, 2011.

Evaluation Scheme:
1. In-Semester Assessment:
• Assessment consists of two Internal Assessments (IA1, IA2) out of which; one should
be compulsory class test (on minimum 02 Modules) and the other is a class test /
assignment on case studies / course project.
• Mid Semester Examination (MSE) will be based on 40-50% of the syllabus.

2. End-Semester Examination:
• Question paper will comprise of full syllabus.
• In the question paper, weightage of marks will be proportional to the total number of
lecture hours as mentioned in the syllabus.
 Practical Tutori Total
Theory Practical Tutorial Theory
/ Oral al Credits
Hrs Hrs Hrs Credit
Credit Credit
s
Mobile 03 - - 03 - - 03
Computing
CECDLO6041

Examination Scheme
Ter
Practic
m Ora Tota l
Theory Marks al &
Wor l
Course Course Oral
k
Code Name
In-Sem Evaluations End
Mid Sem
IA IA AV Sem
Exa
1 2 G Exa
m
m
Mobile
CECDLO6041 Computing 20 20 20 20 60 - - - 100

Course Objectives:
1. To introduce the basic concepts and principles in mobile computing.
2. To explore both theoretical and practical issues of mobile computing.
3. To understand the key components and technologies involved and to gain hands-on
experiences in building mobile applications.

Course Outcomes: On successful completion of the course, the learner will be able:

1. To identify basic concepts and principles in mobile communication cellular architecture

and describe the telecommunications systems.
2. To recognize the significance of Mobile IP, Mobile TCP, and micro-mobility support in
mobile environments.
3. To compare and contrast various IEEE 802. x standards.
4. To analyse 4G/5G mobile networks and apply this knowledge to predict network
performance.
5. To understand the concept of the Internet of Things.
Prerequisites:

1. Computer Networks

Sr. Module Detailed Content Hours CO

No. Mapping

Introduction, Wireless transmission:

Frequencies for radio transmission,
Signals, Antennas, Signal propagation,
Introduction Multiplexing, Spread spectrum,
1 to Mobile Cellular systems, Comparison of 1G, 08 CO1
Networks 2G, 3G, 4G, 5G, Telecommunications
systems (GSM, GPRS, UMTS),
Handover
Motivation for specialized MAC
,SDMA,FDMA,TDMA,CDMA
Mobile IP: IP Packet Delivery
Advertisement, Discovery,
Registration, Tunneling and
Encapsulation, Reverse Tunneling,
Mobile Routing (DSDV, DSR)
Networking Mobile TCP: Traditional TCP,
2 08 CO2
and Mobility Classical TCP Improvements (Indirect
Management TCP, Snooping TCP & Mobile TCP)
Introduction, IP Mobility, Optimization,
IPv6,
Macro Mobility: MIPv6, FMIPv6,
Micro-Mobility: Cellular IP, HAWAII,
HMIPv6
IEEE technologies :
IEEE 802.15: WPAN/Bluetooth,
WBAN
Wireless IEEE 802.11: WLAN (Infrastructure &
3 04 CO3
Technologies Ad-hoc mode, Comparison of 802.11
a/b/g/n/ac )
IEEE 802.16: WiMAX

LTE: Relevant features of LTE,

Long-Term
Network architecture and protocols,
Evolution
4 Control and user planes, Multimedia 09 CO4
(LTE) and
broadcast and multicast service, Stream
LTE-A
Control Transmission Protocol,
 Network discovery and selection, Radio
resource management, Authentication
and authorization, Fundamentals of the
MAC layer in LTE, Fundamentals of the
LTE physical layer

LTE-A: Features of LTE-A, LTE vs.

LTE-A, HetNet in LTE Advanced,
Small cell concepts, Femtocell and
macrocell integration architecture,
Picocell and macrocell integration
architecture, Interference mitigation in
heterogeneous networks, Interference
mitigation in the context of two-tier
macropicocells, Coordinated multi-
point transmission/reception, Carrier
aggregation

From LTE Advanced to 5G: the big

5th Genration transition, Some characteristics
5 Mobile envisioned for 5G, 5G frequencies, 05 CO5
Network High and low platforms, Cloud-RAN

Introduction Introduction, Things in IoT, IoT

to Internet of
6 Protocols, IoT Communication Models, 05 CO6
Things ….
IoT Communication APIs.

Textbooks:
1. Jochen Schiller, “Mobile Communication,” Addison wisely, Pearson Education.
2. Khaldoun Al Agha, Guy Pujolle, Tara Ali-Yahiya, “Mobile and Wireless Networks,”
Wiley Publications.

References:
1. William Stallings, “Wireless Communications & Networks,” Second Edition, Pearson
Education.
2. Christopher Cox, “An Introduction to LTE: LTE, LTE-Advanced, SAE and 4G Mobile
Communications,” Wiley publications.
3. Ashutosh Dutta, Henning Schulzrinne, “Mobility Protocols and Handover Optimization:
Design, Evaluation, and Application” IEEE Press, Wiley Publication.
4. Andreas F. Molisch, “Wireless Communications,” Wiley Publications, 2nd edition.

Evaluation Scheme:
1. In-Semester Assessment:
● Assessment consists of two Internal Assessments (IA1, IA2) out of which; one should
be a compulsory class test (on minimum 02 Modules) and the other is a class test /
assignment on case studies / course project.
● Mid Semester Examination (MSE) will be based on 40-50% of the syllabus.

2. End-Semester Examination:
● Question paper will comprise a full syllabus.
● In the question paper, weightage of marks will be proportional to the total number of
lecture hours as mentioned in the syllabus
 Practical/
Theory Practical Tutorial Theory Tutorial Total
Oral
Hrs Hrs Hrs Credit Credits Credits
Credit

CECDLO6042 Artificial
03 - - 03 - - 03
Intelligence

Examination Scheme
Term Practical
Theory Marks Oral Total
Course Work & Oral
Course Code
Name In-Sem Evaluations End
Mid Sem
IA1 IA2 AVG Sem
Exam
Exam

Artificial
CECDLO6042 20 20 20 20 60 - - - 100
Intelligence

Course Objectives:

1. To conceptualize the basic ideas and techniques of AI.

2. To understand and distinguish uninformed and informed search techniques.
3. To understand and apply knowledge representation and planning techniques.
4. To become familiar with basics of Propositional, Predicate and Fuzzy Logic and
develop Fuzzy inference systems.

Course Outcomes: At the end of the course learner will able to

1. Identify the various characteristics of Artificial Intelligence techniques.

2. Choose an appropriate uninformed problem solving.
3. Apply informed search techniques for real world problem solution.
4. Analyze and apply the knowledge representation and reasoning to AI problem
solving.
5. Design fuzzy inference system.
6. Understand and apply various planning strategies to perceive the real world.
Prerequisites:

1. Engineering Maths
2. Discrete Structures
3. Analysis of algorithms

Sr. CO
Module Detailed Content Hours
No. Mapping

Introduction, AI Representation, Non-AI

&AI Techniques, Representation of
Knowledge, Knowledge Base Systems,
Fundamentals State Space Search, Production Systems,
of Artificial Problem Characteristics, types of
1 6 CO1
Intelligence production systems, Intelligent Agents
and Environments, concept of rationality,
the nature of environments, structure of
agents, problem solving agents, problem
formulation

Formulation of real-world problems,

Breadth First Search, Depth First Search,
Uninformed Depth Limited Search, Iterative
2 Search Deepening Depth First Search, 6 CO2
Strategies Bidirectional Search, Comparison of
Uninformed search Strategies, Searching
with partial information.

Best First Search, Iterated Hill Climbing,

Informed
Simulated Annealing, Genetic Algorithm,
3 Search 8 CO3
A* and AO* Algorithm, Game playing:
Strategies
Minimax Search, Alpha-Beta Cutoffs.

Knowledge based agents, Propositional

Logic: Representation, Inference,
Reasoning Patterns, Resolution, Forward
Knowledge,
4 and Backward Chaining. First order 7 CO4
Reasoning
Logic: Representation, Inference,
Reasoning Patterns, Resolution, Forward
and Backward Chaining.

Fuzzy set theory, Fuzzy logic, Fuzzy

5 Fuzzy Logic Relations, Fuzzy Rules and Fuzzy 8 CO5
Reasoning, Fuzzy inference systems,
 Fuzzification and Defuzzification, Fuzzy
controllers

Types of Planning: Partial Order,

6 Planning Hierarchical Order Conditional Order, 4 CO6
Blocks world, STRIPS

Text Books:
1. Deepak Khemani, “A First Course in Artificial Intelligence”, McGraw Hill Publication.
2. Stuart J. Russell and Peter Norvig, "Artificial Intelligence A Modern Approach”,
Second Edition, Pearson Education.
3. Samir Roy and Chakraborty, “Introduction to soft computing”, Pearson Edition.

Reference Books:
1. Kevin Knight, Elaine Rich, Shivashankar B. Nair, “Artificial Intelligence" Third
Edition, McGraw Hill.
2. Nils J Nilsson, “Artificial Intelligence: A New Synthesis”, Morgan Kaufmann
Publications, 2000.
3. Zimmermann H.S, "Fuzzy Set Theory and its Applications", Kluwer Academic
Publishers.

Evaluation Scheme:

2. In-Semester Assessment:

Assessment consists of two Internal Assessments (IA1, IA2) out of which; one should be
compulsory class test (on minimum 02 Modules) and the other is a class test / assignment on
case studies / course project.

Mid Semester Examination (MSE) will be based on 40-50% of the syllabus.

3. End-Semester Examination:

Question paper will comprise of full syllabus.

In the question paper, weightage of marks will be proportional to the total number of lecture hours as mentioned in
the syllabus.
 Theory Practic Tutori
Theory Practical Tutorial Total
Course Course Credit al/ Oral al
Hrs Hrs Hrs Credits
Code Name Credit Credits

Augmented
Reality/
CECDLO6043
Virtual 3 - - 3 - - 3
Reality

Examination Scheme
Ter
Practic
m Or Tot
Theory Marks al &
Wor al al
Course Course Oral
k
Code Name
In-Sem Evaluations End
Mid Sem
IA IA AV Sem
Exa
1 2 G Exa
m
m
Augmented
Reality /
CECDLO6043
Virtual 20 20 20 20 60 - - - 100
Reality

Course Objectives:

1. To understand the immersive technologies.

2. To learn AR and VR concepts.
3. To analyse and develop AR and VR apps.
4. To demonstrate projects using AR/VR toolkits.

Course Outcomes: At the end of the course learner will able to

1. Compare and Contrast VR and AR experiences

2. Understand and develop VR apps in Unity
3. Understand and develop AR apps in Unity
4. Demonstrate various tools and programming languages to develop AR/VR applications.
5. Acquire knowledge in VR and AR technologies in terms of used devices, building of the
virtual environment and modalities of interaction and modeling.
6. Acquire knowledge about the application of VR and AR technologies in medicine,
education, cultural heritage and games.
Prerequisites: Basic knowledge on any Programming Language

Sr. CO
Module Detailed Content Hours
No. Mapping
Defining Virtual Reality, History of VR,
Visual Representation in VR, Aural
Representation in VR and Haptic
Representation in VR
Defining augmented reality, history of
augmented reality, The Relationship
Between Augmented Reality and Other
1 Introduction Technologies Spectrum Between Real and 5 CO1
Virtual Worlds, AR toolkits with existing
IDE’s (Unity-Vuforia, Visual Studio,
Netbeans, intellij IDEA, Android, iOS),
connectivity of smart devices with AR.
Case study of a single application using
both VR and AR technologies
Geometric Models, Rotation, Viewing
Transformations, Chaining the
Transformations, Human Eye, eye
movements & implications for VR.
VR concepts Visual Perception - Perception of Depth,
2 and app Perception of Motion, Perception of Color, 7 CO2
Development Motion in Real and Virtual Worlds,
Interaction
Case study on creating 3D objects using
Blender.
The Relationship Between Augmented
Reality and Other Technologies Concepts
Related to Augmented Reality, Ingredients
AR concepts and
of an Augmented Reality Experience,
3 App 7 CO3
Computer Vision for Augmented Reality
Development
Marker-based approach, Tracking methods
Case study on use of OpenCV for AR
App Development
VR Devices, Game scene AR Devices
Working with
Virtual retinal systems, monitor based
4 VR & AR 7 CO4
systems, Projection displays, Video see-
Devices
through systems. Advantages and
 Disadvantages of AR and VR
technologies.
Case Study on Google Daydream /
AjnaLense
C# with Unity – OOL concepts, classes in
C#, setting up visual studio or code editor
for C#, 3D models compatibility with C#,
5 Programming C# for AR and VR C++ with 7 CO5
Languages for AR Case study on a C# script which plays a
& VR applications video when an image is scanned using
AR App (use ARCore & Unity)
Trending Application Areas - Gaming and
Entertainment, Architecture and
Construction, Science and Engineering,
Health and Medicine, Aerospace and
Use Cases for Defence, Education, Telerobotics and
AR and VR Telepresence Human Factors, Legal and 6 CO6
6
applications Social Considerations - Human Factors
Considerations, Legal and Social
Considerations, The Future
Case Study on Google Maps AR
navigation and how it is used?

Text Books:

1. Steve Aukstakalnis, “Practical Augmented Reality: A Guide to the Technologies,

Applications, and Human Factors for AR and VR”, Addison-Wesley Professional,
September 2016,
2. Allan Fowler, William Sherif, “Beginning iOS AR Game Development: Developing
Augmented Reality Apps with Unity and C#”, 1st Edition, Apress Publications, 2018

3. Steven M. LaValle, “Virtual Reality”, Cambridge University Press, 2016

4. William R Sherman and Alan B Craig, “Understanding Virtual Reality: Interface,
Application and Design”, Morgan Kaufmann Publishers, San Francisco, CA, 2002
5. Alan B Craig, William R Sherman and Jeffrey D Will, “Developing Virtual Reality
Applications: Foundations of Effective Design”, Morgan Kaufmann, 2009.
6. Allan Fowler, “AR Game Development”, 1st Edition, A press Publications, 2018.
7. Schmalstieg / Hollerer, “Augmented Reality: Principles & Practice” by, Pearson
Education India; First edition 2016.

Reference Books:
1. Jesse Glover, Jonathan Linowes, “Complete Virtual Reality and Augmented Reality
Development with Unity: Leverage the power of Unity and become a pro at creating mixed
reality applications”, Packt publishing, 2019.
2. Jonathan Linowes, Krystian Babilinski, “Augmented Reality for Developers: Build
practical augmented reality applications with Unity”, Packt Publishing, 2017.
 1. MOOC Courses:
https://www.coursera.org/learn/augmented-reality
https://www.coursera.org/specializations/unity-xr

Evaluation Scheme:
1 In-Semester Assessment:
● Assessment consists of two Internal Assessments (IA1, IA2) out of which; one should
be compulsory class test (on minimum 02 Modules) and the other is a class test /
assignment on case studies / course project.
● Mid Semester Examination (MSE) will be based on 40-50% of the syllabus.

2 End-Semester Examination:
● Question paper will comprise a full syllabus.
● In the question paper, weightage of marks will be proportional to the total number of
lecture hours as mentioned in the syllabus.

Theory Practical Tutori Theory Practical/ Tutori al Total

Hrs Hrs al Hrs Credit Oral Credits Credits
Credit

Cyber
CECDLO6044
Securi 03 - - 03 - - 03
ty

Course Course Examination Scheme

Code Name
Theory Marks Term Practical Oral Tota l
Work

In-Sem Evaluations End

Sem
IA 1 IA 2 AVG Mid Exam
Sem
Exam

CECDLO604 4 Cyber
Security 20 20 20 20 60 - - - 100
Course Objectives:

1. To understand fundamentals of cyber security in cloud.

2. To understand the background of cryptography.
3. To study various types of Cyber threats.
4. To explore the working of Data centre and Data Protection techniques.
5. To investigate the Cloud Native Security.
6. To study Compliance and Security Audits policies for data centres.

Course Outcomes: After completion of the course, learner should be able to:

1. To identify security challenges in cloud environment.

2. To apply the knowledge of different cryptographic algorithms.
3. To identify different Cyber attacks and apply Cyber Security mechanism.
4. To apply different data protection techniques in data centers.
5. To demonstrate cloud security tools.
6. To interpret and appropriately apply the policies on Compliance and Security Audits for
data centres.

Prerequisites:
1. Operating System
2. Database Management System
3. Computer Networks

Sr. CO
Module Detailed Content Hours
No. Mapping

Modern Computing Trends, New

Cyber security Application threat vectors,
6
1 Landscape Turbulence in cloud, SaaS CO1
Application Risk.

CIA Traid, Cryptographic

Applied
Algorithm-Symmetric (DES, AES),
Cryptography
2 Asymmetric algorithm (RSA), Key 6 CO2
for Cyber
Defence exchange protocol (DH), Elliptical
Curve Cryptography, El-gamal
 cryptosystem, Hash (MD5 and SHA,
SHA256), Basics of Authentication,
Authorization and Access Control,
Cryptographic tools.

Modern cyber attack strategy, types

of threats, Malwares (virus, worm,
3 Cyber threats trojan, etc), bot and botnets, 6 CO3
Vulnerability exploitation, detection,
prevention mechanism.

Traditional Data security solutions,

Data center Implementation of security in Virtual
4 Security and Data centers, East-west Traffic 8 CO4
Data Protection
Protections, Types of firewalls, IDS
and IPS, DMZ

Cloud Native 4C’s of cloud native security,

DevOps and DevSecOps, Hybrid 8 CO5
5 Security
Data Center Security

Privacy Protection Principle, Security

Compliance
and Security Audit
6 5 CO6
Audits at data
centers

Text Books:

1. Atul Kahate, “Cryptography and Network Security”, Tata Mc Graw Hill.

2. Behrouz A. Ferouzan, “Cryptography & Network Security”, Tata Mc Graw Hill.
3. T. J. Klevinsky, Scott Laliberte and Ajay Gupta, Addison-Wesley, “Hack I.T. - Security
Through Penetration Testing”, ISBN: 0-201-71956-8.

Reference Books:

1. David Kennedy, Jim O'Gorman, Devon Kearns, Mati Aharoni, “Metasploit: The
Penetration Tester's Guide”, No Starch Press.
2. Wm. Arthur Conklin, “CompTIA Security+ All-in-One Exam Guide”, McGraw Hill.

Evaluation Scheme:
1. In-Semester Assessment:
● Assessment consists of two Internal Assessments (IA1, IA2) out of which; one should
be compulsory class test (on minimum 02 Modules) and the other is a class test /
assignment on case studies / course project.
● Mid Semester Examination (MSE) will be based on 40-50% of the syllabus.

End-Semester Examination:
● Question paper will comprise a full syllabus.
● In the question paper, weightage of marks will be proportional to the total number of
lecture hours as mentioned in the syllabus.
Course Course Theo Practic Tutori Theo Practical/O Tutori Total
Code Name ry al al ry ral al Credi
Hrs Hrs Hrs Credi Credit Credit ts
t s
Mobile
Emerging
ILOT60 Technolog
03 - - 03 - - 03
21 ies and
Smart
Devices

Examination Scheme
Course Course
Code Name Theory Marks Ter Practica Ora Tota
m l l l
Wor
k

In-Sem Evaluations End

Sem
IA IA AV Mid Exa
1 2 G Sem m
Exa
m

Mobile
ILOT602 Emerging
1 Technologies 20 20 20 20 60 - - - 100
and Smart
Devices

Course Prerequisite

1. Engineering Mathematics
2. Logic Circuits

Course Objectives

1. To make students aware about the evolution of mobile technologies.

2. To expose students to the latest mobile technology architectures from 2G to 5G.
3. To study core technological advancements in smart devices.

Course Outcomes After successful completion of the course student will be able to …
 1. Understand the cellular fundamentals and different types of multiple access technologies.
2. Study the system architecture of 2G and 2.5G.
3. Study the system architecture of 3G.
4. To develop the concepts of emerging technologies for 4G standards and beyond
5. Understand the global market trends and future forecasts of Smart devices.
6. To study the core technology and components of the world’s most popular smartphones.

Module Detailed Content Hours

1 Fundamentals of Mobile communication
: Cellular concept design fundamentals, Frequency reuse, Channel
Assignment Strategies, Interference and System Capacity, Improving
Coverage and Capacity in Cellular Systems
06
: Multiple access techniques: Frequency division multiple access
(FDMA), time division multiple access (TDMA), space spectrum
multiple access (SSMA), space division multiple access (SDMA),
OFDM-PAPR.
2 2G Technologies
: GSM, GPRS And EDGE- architecture, IS-95 , GSM Network
architecture, GSM signaling
protocol architecture, identifiers used in GSM system, GSM 08
channels, frame structure for GSM.
: GPRS And EDGE- architecture, Architecture of CDMA system,
CDMA air interface, power control in CDMA system, power control,
handoff, rake receiver.
3 3G Technologies:
: UMTS: Objectives, standardization and releases, network
architecture. 05
: Cdma2000 cellular technologies: Forward And Reverse
Channels, Handoff And Power Control.
4 4G & 5G Technology:
: Advanced techniques for 4G deployment: Multi-antenna
Techniques, Smart antennas, multiple input multiple output
systems.
: Cognitive radio: Architecture, spectrum sensing, Relaying 08
multi-hop and cooperative communications: Principles of relaying,
fundamentals of relay.
: 5G network architecture: The NR (New Radio) access network
and NGC (Next Generation Core), types of 5G deployment
scenarios based on various NSA (Non-standalone) options, the flat,
 flexible, distributed and sliced 5G network characteristics along
with the enabling SDN.
5 Mobile Business Rankings & Analysis:
: Smart Device & Mobile Services Rankings & Products: future
trend of smart devices and mobile services based on rankings and
products.
: CAGR (Compound Annual Growth Rate): Definition, market
06
analysis, market analysis of the global market share based on
market share by country, smartphone venders and global mobile
subscription technology.
: Forecast of the global mobile application: APP (Application)
download, in-APP payment, and in-APP advertisements.
6 Smart Devices:
: Core technology & components: Samsung Galaxy Note, Apple
iPhone and smart watches.
06
: Functionality of thread based multi-core scheduling,
processing, and relations with the smartphone OS (Operating
System) Android and iOS.
Total 39

Text books:
1. Theodore S. Rappaport ―wireless communications - principles and practice‖,
PEARSON, Second edition.
2. T L Singal ―wireless communications‖, Mc Graw Hill Education.
3. Andreas F. Molisch ―wireless communications‖ WILEY INDIA PVT LTD, Second
edition.

Reference Books:
1. Upena Dalal ―Wireless and Mobile Communications‖, Oxford University Press.
2. Vijay K. Garg ―Wireless Communications and Networking, Morgan–Kaufmann series
in Networking-Elsevier

esources:
1. https://www.my-mooc.com/en/mooc/smart-device-mobile-emerging-technologies/
2. NPTEL: http://nptel.ac.in/courses/117104099/
3. Coursera: https://www.coursera.org/learn/smart-device-mobile-emerging-technologies

Evaluation Scheme:
1. In-Semester Assessment:
 a. Assessment consists of two Internal Assessments (IA1, IA2) out of which; one
should be compulsory class test (on minimum 02 Modules) and the other is a
class test / assignment on case studies / course project.
b. Mid Semester Examination (MSE) will be based on 40-50% of the syllabus.

2. End-Semester Examination:
• Question paper will comprise of full syllabus.
• In the question paper, weightage of marks will be proportional to the total
number of lecture hours as mentioned in the syllabus.
 Theo Practic Tutori Theo Practical/ Tutori Total
ry al al ry O ral al Credi
Hrs Hrs Hrs Credi Credit Credit ts
t s
Renewab
le and
ILOT6022 Distribut
03 -- - 03 -- - 03
ed
Energy
Systems

Examination Scheme

Ter
m Practica Ora Tota
Theory Marks
Wor l l l
Course Course k
Code Name In-Sem Evaluations
End
Mid Sem
IA IA AV Sem Exa
1 2 G Exa m
m

Renewable
and
ILOT6022
Distributed 20 20 20 20 60 -- -- -- 100
Energy
Systems

Course Prerequisite

1. Environmental Study
2. Fundamentals of Energy

Course Objectives
 1. Recognize current and possible future role of renewable energy sources.
2. Adequate inputs on a variety of issues in harnessing renewable Energy.
3. Awareness’ about renewable Energy Sources and technologies.

Course Outcomes After successful completion of the course student will be able to …

1. Understand the renewable energy source

2. Analyse wind power plants
3. Understand and analyse Solar Photo Voltaic (SPV) systems
4. Explore the use of biomass energy as a renewable energy source
5. Apply Knowledge of working principle of geothermal energy systems
6. Evaluate and explore the capability of tidal, hydrogen and hybrid energy systems

Module Detailed Content Hours

1 Global and National Energy Scenario: Overview of
conventional & renewable energy sources, need,
potential & development of renewable energy sources,
types of renewable energy systems, Future of Energy
Use, Global and Indian Energy scenario, Energy for 08
sustainable development, renewable electricity and key
elements, Global climate change, CO2 reduction
potential of renewable energy- concept of Hybrid
systems.
2 Wind Energy: Power in the Wind, Nature of the wind,
Wind Energy Conversion, Wind Data and Energy
Estimation, Site selection, Types of wind turbines, Wind
farms, Wind Generation and Control, classification of
wind, characteristics, offshore wind energy, Types of 07
Wind Power Plants (WPPs), Components of WPPs,
Working of WPPs, Grid integration issues of WPPs,
Hybrid systems, wind energy potential and installation in
India. Automation in Wind Farm.
 3 Solar Energy: Solar energy system, Solar Radiation,
Availability, Measurement and Estimation, Solar
Thermal Conversion Devices and Storage, Solar
Electrical Power Generation, general Solar Photo Voltaic
(SPV) system components and their characteristics, Stand
alone and Grid Connected SPV systems.
Solar Photovoltaic systems: Basic Principle of solar 07
photovoltaic conversion, types of PV Systems, Types of
Solar Cells, Photovoltaic cell concepts: Cell, module,
array, PV Module I-V Characteristics, Efficiency &
Quality of the Cell, series and parallel connections,
maximum power point tracking, applications.
Automation in Solar Plant.
4 Biomass Energy and Geothermal Energy:
Introduction, Biomass resources, Principles of Bio-
Conversion, Biomass Cogeneration, Environmental
Benefits, Anaerobic/aerobic digestion, types of Bio-gas 06
digesters, gas yield, combustion characteristics of bio-
gas, utilization for cooking.

5 Geothermal Energy: Resources, types of wells, methods

06
of harnessing the energy, potential in India.
6 Other Energy Sources: Tidal Energy: Energy from the
tides, Types of Tidal power systems, wave power
devices, Ocean Thermal Energy Conversion
05
(OTEC).Hydrogen Production and Storage: Principle of
working, various types, construction and applications,
Energy Storage System, Hybrid Energy Systems.
Total 39

Text books:
1. S. P. Sukhatme and J. K. Nayak, Solar Energy: Principles of Thermal Collection and
Storage, TMH, New Delhi, 3rd Edition.
2. John Twidell and Tony Weir, Renewable Energy Resources, Taylor and Francis -
second edition, 2013.
3. G.D. Rai, Non-Conventional Energy Sources, Khanna Publishers

Reference Books:
1. Edited by Godfrey Boyle, Renewable Energy, oxford University, press, 3rd edition,
2013.
2. Ahmed and Zobaa, Ramesh C Bansal, Handbook of renewable technology, World
scientific, Singapore.
3. Ramesh & Kumar, Renewable Energy Technologies, Narosa.
 4. Chetong Singh Solanki, Renewable energy technologies – A practical guide for
beginners, PHI.
5. B.H. Khan, Non-conventional energy source, TMH-2nd edition.
6. Karlsson, Kenneth Bernard; Skytte, Klaus Morthorst, Integrated energy systems
modeling, Published in: DTU International Energy Report 2015.

Evaluation Scheme:
1. In-Semester Assessment:
a. Assessment consists of two Internal Assessments (IA1, IA2) out of which; one
should be compulsory class test (on minimum 02 Modules) and the other is a
class test / assignment on case studies / course project.
b. Mid Semester Examination (MSE) will be based on 40-50% of the syllabus.

2. End-Semester Examination:
• Question paper will comprise of full syllabus.
• In the question paper, weightage of marks will be proportional to the total
number of lecture hours as mentioned in the syllabus.
 Theory Practical Tutorial Theory Practical/Oral Tutorial Total
Hrs Hrs Hrs Credit Credit Credits Credits

Industrial
ILOT6023 03 -- - 03 -- - 03
Automation

Course Course Examination Scheme

Code Name
Theory Marks Term Practical Oral Total
Work

In-Sem Evaluations End

Sem
IA1 IA2 Avg. Mid Exam
of Sem
IAs Exam

ILOT6023 Industrial
20 20 20 20 60 -- -- -- 100
Automation

Course Prerequisite

1. None

Course Objectives

1. To articulate acquaintance about the fundamentals of automation and various

automation systems used in the industry.
2. To impart information about the architecture, working, and applications of PLC,
DCS, and SCADA.
3. To comprehend the requirements of industrial automation in contemporary industries.

Course Outcomes After successful completion of the course student will be able to …

1. Demonstrate automation, need, importance, and applications in the industry.

2. Identify components of PLC and study the architecture of PLC, proper selection, and
sizing criteria.
3. Implement various applications using PLC simulator software.
4. Design SCADA-based applications along with GUI.
5. Recognize the evolution, architecture, and hierarchical control in DCS.
6. Implement industrial applications using DCS programming, and develop graphics.
Module Detailed Content Hours
1 Automation Fundamentals
Automation: Need and its importance, Types, applications,
Expectations of automation. Process and factory automation.
4
Types of plant and control – categories in industry,
Automation hierarchy – large control system hierarchy, data
quantity & quality and hierarchical control.
2 Programmable Logic Controller Hardware
Definition, functions of PLC, Architecture, Scan cycle &
Specifications, I/O modules, local and remote I/O expansion
7
modules, Memory & I/O addressing- memory organization,
hardware to software interface. PLC selection and
configuration for process application.
3 Programmable Logic Controller Software
Concept of Relay Logic Ladder Diagram, introduction to
PLC Programming, programming devices, IEC standard
PLC programming languages, LD programming-basic LD 8
instructions, PLC Timers and Counters: Types and
examples, data transfer & advanced PLC instructions, PID
Control using PLC.
4 Supervisory Control and Data Acquisition (SCADA)
Introduction, elements, features, MTU- functions of MTU,
RTU- Functions of RTU, Protocols, Specifications
Communications in SCADA- types & methods used,
8
components, Protocol structure and Mediums used for
communications. SCADA-based development for typical
applications. Programming for GUI development using
SCADA software.
5 Distributed Control System Hardware
Introduction, architecture, Controller, I/O modules,
Communication module, data highway, local I/O bus,
Workstations, Specifications of DCS,
Introduction of Hierarchical control of memory: Task listing,
7
Supervisory computer tasks, DCS configuration,
Supervisory computer functions, Control techniques, DCS &
Supervisory computer displays, computer interface with
DCS.
6 Distributed Control System Software
DCS System integration with PLCs computer: HMI, Man- 5
machine interface sequencing, Supervisory control, and
 integration with PLC, Introduction to DCS Programming,
Function Block Diagram method for DCS programming
and graphics design.
Total 39

Text books:
1. Frank D. Petruzella, “Programmable logic controllers”, McGraw-Hill Education, Fifth
Edition. 2019.
2. Stuart A. Boyer, “ SCADA: Supervisory Control and Data Acquisition”, Fourth Edition
4th Edition, February 2016
3. Khushdeep Goyal, “Industrial Automation & Robotics”, Publisher S.K. Kataria &
Sons, Fifth Edition, 2015.
4. B.R. Mehta, Y. Jaganmohan Reddy, “Industrial Process Automation Systems Design
and Implementation”, Elsevier Science, 2014
Reference Books:
1. Bela G. Liptak, “Instrument engineer ‘s handbook- Process control”, Butterworth-
Heinemann, 3rd edition. 2013
2. R.K. Rajput, “Robotics And Industrial Automation”, S. Chand publication, Second
Revised Edition 2014.
3. Krishna Kant, “Computer-Based Process Control”, Prentice Hall of India, 2nd Revised
edition 2011.
4. Hackworth, “Programmable Logic Controllers Programming Methods and
Applications”, Pearson India, January 2011.
5. Gary Dunning, “Introduction to Programmable Logic controller”, Cengage Learning
India, Third Edition 2007.
6. S.K. Singh, “Computer-Aided Process Control”, Prentice Hall of India, 2004.
7. John. W. Webb, Ronald A Reis, “Programmable Logic Controllers – Principles and
Applications”, 5th edition, Prentice Hall Inc. 2002.

Evaluation Scheme:
1. In-Semester Assessment:
a. Assessment consists of two Internal Assessments (IA1, IA2) out of which; one
should be compulsory class test (on minimum 02 Modules) and the other is a
class test / assignment on case studies / course project.
b. Mid Semester Examination (MSE) will be based on 40-50% of the syllabus.

2. End-Semester Examination:
• Question paper will comprise of full syllabus.
• In the question paper, weightage of marks will be proportional to the total
number of lecture hours as mentioned in the syllabus.
 Theory Practical Tutorial Theory Practical/Oral Tutorial Total
Hrs Hrs Hrs Credit Credit Credits Credits

Wireless
ILOT6024 03 -- - 03 -- - 03
Networking

Course Course Examination Scheme

Code Name
Theory Marks Term Practical Oral Total
Work

In-Sem Evaluations End

Sem
IA1 IA2 AVG Mid Exam
Sem
Exam

ILOT6024 Wireless
20 20 20 20 60 -- -- -- 100
Networking

Course Prerequisite

1. Modulation and Demodulation

2. Computer Network and Security

Course Objectives

1. Understand the fundamentals of wireless networks.

2. Learn and analyze the different wireless technologies.
3. Evaluate Ad-hoc networks and wireless sensor networks.
4. Understand and evaluate emerging wireless technologies and standards
5. Understand design considerations for wireless networks
6. Learn and analyze and evaluate the security threats and related security standards

Course Outcomes After successful completion of the course student will be able to …

1. Explain the basic concepts of wireless network and wireless generations.

2. Demonstrate the different wireless technologies such as CDMA, GSM, GPRS etc
3. Appraise the importance of Ad-hoc networks such as MANET
4. Describe and judge the emerging wireless technologies standards such as WLL, WLAN, WPA
WMAN.
5. Explain the design considerations for deploying the wireless network infrastructure.
6. Differentiate and support the security measures, standards. Services and layer wise secur
considerations.
 Module Detailed Content Hours
1 Fundamentals of Wireless Communication: Introduction to
Wireless Communication - Advantages, Disadvantages and
Applications; Multiple Access Techniques - FDMA, TDMA,
CDMA, OFDMA; Spread Spectrum Techniques – DSSS, FHSS;
06
Evolution of wireless generations –1G to 5G (Based on
technological differences and advancements); 5G – Key
requirements and drivers of 5G systems, Use cases, Massive
MIMO.
2 Wide Area Wireless Networks: Principle of Cellular
Communication – Frequency Reuse concept, cluster size and system
capacity, co-channel interference and signal quality; GSM-System 07
Architecture, GSM Radio Subsystem, Frame Structure; GPRS and
EDGE – System Architecture; UMTS – Network Architecture;
CDMA 2000 –Network Architecture; LTE – Network Architecture.
3 Wireless Personal Area Networks and Adhoc Networks: WLL,
WLAN- 802.11 (Wi-Fi), WPAN- 802.15.1/3/4 (Bluetooth,
Zigbee), WMAN-802.16a (Wimax) , Wi-max and LTE /3GPP
06
comparison, Mi-fi, Ly-fi, Wireless Sensor Network – Design
Considerations, Issues and Challenges, WSN Architecture,
Applications.
4 Ad hoc Networks: Introduction of Ad hoc Networks – MANET –
Characteristics, Applications, Advantages and Limitations;
Routing algorithms – Proactive routing: destination sequenced
08
Distance Vector Routing (DSDV), Reactive routing: Dynamic
Source Routing (DSR), Ad hoc On-Demand Distance Vector
Routing (AODV), Hybrid Routing: Zone Based Routing (ZRP).
5 Wireless Network Design Considerations: Wireless technology,
Cisco Unified Wireless Network, Designing Wireless Networks 08
with Lightweight Access Points and Wireless LAN Controllers.
6 Wireless Network Security: Security in GSM; UMTS Security;
Bluetooth Security; WEP; WPA2. 04
Mobile IP, VPN (PPTP, LLTP, IPSec).
Total 39

Text books:
1. Cellular Communications: A Comprehensive and Pratical Guide, Nishith Tripathi,
Jeffery H Reed, Wiley
2. Wireless Mobile Internet Security, 2nd Edition, Man, Young Rhee, Wiley- IEEE press
3. Designing for Cisco Internetwork Solutions (DESGN), 2nd Edition, CCDA, Diane
Teare, cisco Press.
Reference Books:
1. Introduction to Digital mobile communication, 2nd Edition, Yoshihiko Akaiwa
2. Wireless Communications and networks, William Stallings, Pearson / Prentice Hall
3. Wireless communication and networking, Vijay Garg

Evaluation Scheme:
1. In-Semester Assessment:
a. Assessment consists of two Internal Assessments (IA1, IA2) out of which; one
should be compulsory class test (on minimum 02 Modules) and the other is a
class test / assignment on case studies / course project.
b. Mid Semester Examination (MSE) will be based on 40-50% of the syllabus.

2. End-Semester Examination:
• Question paper will comprise of full syllabus.
• In the question paper, weightage of marks will be proportional to the total
number of lecture hours as mentioned in the syllabus.
 Theory Practical Tutorial Theory Practical/Oral Tutorial Total
Hrs Hrs Hrs Credit Credit Credits Credits
ILOT6025 Online 03 -- -- 03 -- 03 03
Awareness
&
Security

Examination Scheme
Term Practical
Theory Marks Oral Total
Course Course Work & Oral
Code Name In-Sem Evaluations
End
Mid
Sem
IA1 IA2 AVG Sem
Exam
Exam

Online
ILOT6025 Awareness 20 20 20 20 60 – – – 100
& Security

Course Objectives:
1. To understand and identify different types cybercrime and cyber law
2. To recognized Indian IT Act 2008 and its latest amendments
2. To learn various types of security standards compliances

Course Outcomes: At the end of the course learner will able to

1. Understand the concept of online crime and its effect on outside world
2. Interpret various online frauds & Attacks patterns
3. Understand and Analyzed various tools use in online frauds
4. Interpret and apply IT law in various legal issues
5. Distinguish different aspects of cyber law
6. Apply Information Security Standards compliance during software design and
development

Prerequisites: Computer Network, Operating System

CO
Sr. No Module Detailed Content Hours
Mapping
 Introduction to Online crime: Cybercrime
1 Introduction 5 CO1
definition and origins of the world,
Cybercrime and information security,
Classifications of cybercrime, A global
Perspective on cybercrimes.

criminal attacks plan, Social Engg, Cyber

2 Online 8 CO2
stalking, Cyber café and Cybercrimes,
offenses &
crime Credit Card Frauds in Mobile and Wireless
Computing Era, Security Challenges Posed
by Mobile Devices, Attacks on
Mobile/Cell Phones, Mobile Devices:
Security Implications for Organizations

3 Tools and Tools and Methods Used in Cyberline 7 CO3

Methods Phishing, Password Cracking, Keyloggers
and Spywares, Virus and Worms,
Steganography, DoS and DDoS Attacks,
SQL Injection, Buffer OverFlow, Attacks on
Wireless Networks, Phishing, Identity Theft
(ID Theft)

The Security Aspect of Cyber Law ,The

4 Security 8 CO4
Intellectual Property Aspect in Cyber Law ,
Aspect of
Cyber Law The Evidence Aspect in Cyber Law , The
Criminal Aspect in Cyber Law, Global
Trends in Cyber Law , Legal Framework
for Electronic Data Interchange Law
Relating to Electronic Banking , The Need
for an Indian Cyber Law

5 IT Act, Indian IT Act. Cyber Crime and Criminal 6 CO5

2000 & Justice: Penalties, Adjudication and Appeals
2008 Under the IT Act, 2000, IT Act. 2008 and its
Amendments
 Information Security Standard compliances
6 Security 5 CO6
SOX, GLBA, HIPAA, ISO, FISMA,
Standard
compliances NERC, PCI

Total 39

Text Books

1. Nina Godbole, Sunit Belapure, Cyber Security, Wiley India, New Delhi
2. The Indian Cyber Law by Suresh T. Vishwanathan; Bharat Law House New Delhi

Reference Books

1. The Information technology Act, 2000; Bare Act- Professional Book Publishers, New
Delhi.
2. Cyber Law & Cyber Crimes By Advocate Prashant Mali; Snow White Publications,
Mumbai
3. Nina Godbole, Information Systems Security, Wiley India, New Delhi

Evaluation Scheme:

1. In-Semester Assessment:
● Assessment consists of two Internal Assessments (IA1, IA2) out of which; one should
be compulsory class test (on minimum 02 Modules) and the other is a class test /
assignment on case studies / course project.
● Mid Semester Examination (MSE) will be based on 40-50% of the syllabus.

2. End-Semester Examination:
● Question paper will comprise of full syllabus.
● In the question paper, weightage of marks will be proportional to the total number of
lecture hours as mentioned in the syllabus
 Theory Practical Tutorial Theory Practical/Oral Tutorial Total
Hrs Hrs Hrs Credit Credit Credits Credits

Machine
CEL601 Learning - 02 - - 01 - 01
Lab

Course Course Examination Scheme

Code Name
Theory Marks Term Practical Oral Total
Work & Oral

In-Sem Evaluations End

Sem
Exam
IA1 IA2 AVG Mid
Sem
Exam

Machine
CEL601 Learning - - - - - 25 25 - 50
Lab

Course Objectives:

1. To design and implement various machine learning algorithms.

2. To explore various machine learning tools and techniques.
3. To use appropriate machine learning techniques for real world applications.

Course Outcomes: At the end of the course learner will able to

1. Understand and implement data preprocessing techniques.

2. Apply different regression techniques for prediction.
3. Use neural network techniques for learning.
4. Apply classification algorithms and analyse the performance.
5. Identify pattern similarity and form clusters using clustering techniques.
6. Understand working of reinforcement learning.

Prerequisites:

1 Linear Algebra
2 Statistics
3 Programming Language

Suggested Experiments:
 Experiment Experiments Name CO Mapping
No.

1 Perform data preprocessing on a dataset. CO1

2 Implement Linear Regression algorithm for prediction CO2

3 Implement Perceptron based NN algorithm for prediction CO3

4 Implement Bayesian Classification for CO4

5 Implement Support Vector Machine for binary CO4

classification.
6 Use ID3 to construct decision tree (Use Weka tool) CO4
7 Implement Agglomerative Clustering. CO5
8 Case study on Reinforcement Learning. CO6

Text Books:

1. Tom M Mitchell, “Machine Learning”, McGraw Hill, 2017.

2. Aurelien Geron, “Hands-on Machine Learning with Scikit-Learn, Keras, and TensorFlow:
Concepts, Tools, and Techniques to Build Intelligent Systems”, O’Reilly, ISBN
1492032646

Reference Books:

1. Ian H. Witten, Eibe Frank, Mark A. Hall and Christopher Pal, “Data Mining: Practical
Machine Learning Tools and Techniques”, Morgan Kaufmann Series in Data Management
Systems, 4th Edition.
2. Sebastian Raschka and Vahid Mirjalili, “Python Machine Learning: Machine Learning and
Deep Learning with Python, scikit-learn, and TensorFlow 2”, Packt Publishing Limited,
3rd Edition

Term Work:
The Term work Marks are based on the weekly experimental performance of the students,
Oral performance and regularity in the lab.
Students are expected to be prepared for the lab ahead of time by referring the manual and
perform the experiment under the guidance and discussion. Next week the experiment write-
up to be corrected along with oral examination.

End Semester Examination:

End of the semester, there will be Practical and Oral examination based on the laboratory
work and the corresponding theory syllabus.
 Practical/
Theory Practical Tutorial Theory Tutorial Total
Oral
Hrs Hrs Hrs Credit Credits Credits
Credit

Compiler
CELDLO6031 Design - 02 - - 01 - 01
Lab

Examination Scheme
Term Practical
Theory Marks Oral Total
Course Work & Oral
Course Code
Name In-Sem Evaluations End
Mid Sem
IA1 IA2 AVG Sem
Exam
Exam

Compiler
CELDLO6031 Design - - - - - 25 - 25 50
Lab

Course Objectives:

1. To explore various automated compiler generator tools like LEX and YACC etc.
2. To understand, design and implement analysis phase of compiler.
3. To understand, design and implement synthesis phase of compiler.
4. To explore modern compiler tools and techniques.

Course Outcomes: At the end of the course learner will able to

1. Design lexical analyzer and parser using the automated tools like LEX and YACC.
2. Recognize need for tokenization and identify the lexical errors.
3. Construct the appropriate parser for the given input code.
4. Find suitable intermediate code representation for high level program statements.
5. Develop the optimized intermediate code from the given intermediate code.
6. Generate the target code for specific machine architecture.

Prerequisites:
1. Theoretical Computer Science
2. Data Structure
3. Programming Language Fundamentals
Suggested Experiments:

Experiment Experiments Name CO Mapping

No.
1 Program to implement lexical analyzer for given CO1
language.

2 Program to implement lexical analyzer for given CO2

language using LEX

3 Program to implement removal of left recursion. CO3

4 Program to implement computation of FIRST and CO3

FOLLOW set for given grammar

5 Program to implement any parsing technique. CO3

6 Program to implement parser generator using YACC CO1

7 Program to generate intermediate code. CO4

8 Program to implement any code optimization technique. CO5

9 Program to generate target code. CO6

10 Case study on modern compiler construction tools. CO1

e.g. LLVM, JavaCC etc.

Text Books:

1. A.V. Aho, R. Shethi, Ulman, “Compilers - Principles, Techniques and Tools”,

Pearson Education, 1st Edition.
2. John R. Levine, Tony Mason, Doug Brown, “LEX & YACC”, O‘Reilly, 2nd Edition.
3. Dick Grune, Henri E. Bal, Ceriel J. H. Jacobs, Koen G. Langendoen, “Modern
Compiler Design”, Wiley.

Reference Books:

1. Kenneth C. Louden, “Compiler Construction: Principles and practices”, Cengage

Learning.
2. K Muneeswaran, “Compiler Design”, Oxford University press.
Term Work:
The Term work Marks are based on the weekly experimental performance of the students, Oral
performance and regularity in the lab.
Students are expected to be prepared for the lab ahead of time by referring the manual and
perform the experiment under the guidance and discussion. Next week the experiment write-
up to be corrected along with oral examination.

End Semester Examination:

End of the semester, there will be Oral examination based on the laboratory work and the
corresponding theory syllabus.
 Practical/
Theory Practical Tutorial Theory Tutorial Total
Oral
Hrs Hrs Hrs Credit Credits Credits
Credit

Data
Warehousing
CELDLO6032 - 02 - - 01 - 01
and Mining
Lab

Examination Scheme
Term Practical
Theory Marks Oral Total
Work & Oral
Course Code Course Name
In-Sem Evaluations End
Mid Sem
IA1 IA2 AVG Sem
Exam
Exam

Data
Warehousing
CELDLO6032 - - - - - 25 - 25 50
and Mining
Lab

Course Objectives:

1. To understand principles, concepts and applications of data warehousing and data

mining.
2. Demonstrate the working of algorithms for data mining tasks such Classification,
clustering, Association rule mining & Web mining
3. Apply the data mining techniques with varied input values for different parameters.
4. Explore open source software to perform data mining tasks.

Course Outcomes:

1. Understand and Design models of data warehouse.

2. Apply OLAP operations on multidimensional data model.
3. Apply steps of data pre-processing, data mining tasks using appropriate tools.
4. Identify and implement association mining algorithms in real world scenario.
5. Apply various classification and clustering algorithms in real world scenario.
6. Describe social network with respect web mining and implement web mining
algorithm.
Prerequisites:

1. Database Management System

Sr CO Weightage
Name of Experiment
No. Meet (in marks)

Build Data Warehouse/Data Mart for a given problem statement

i)Write detail problem statement and design dimensional
1 CO1 10
modeling(creation of star schema and snow flake schema)
ii) Design dimensional data model i.e. Star schema and
Snowflake schema

2 To perform various OLAP operations such as slice, dice, CO2 10

drilldown, rollup, pivot.

3 Implementation of Apriori Association Rule Mining algorithm. CO4 05

4 Implementation of F-P Growth tree algorithm. CO4 05

5 Implementation of Classification algorithm(Decision Tree/ CO5 03

Bayesian classifier)

6 Implementation of Clustering algorithm for outlier detection. CO5 03

7 Implementation of Agglomerative, hierarchical Clustering CO5 04

method

Perform data Pre-processing task and Demonstrate performing

8 Classification, Clustering, and Association algorithm on data CO3 10
sets using data mining using any open source data mining tool.
(like WEKA tool/R tool)

9 Implementation of web mining, page rank algorithm CO6 05

 10 Case study on social network analysis CO6 05

Text Books:

1. Paulraj Ponniah, “Data Warehousing: Fundamentals for IT Professionals”, Wiley India.

2. Han, Kamber, “Data Mining Concepts and Techniques”, Morgan Kaufmann 2nd
edition.
3. M.H. Dunham, “Data Mining Introductory and Advanced Topics”, Pearson Education.

Reference Books:

1. Reema Theraja, “Data warehousing”, Oxford University Press 2009.

2. Pang-Ning Tan, Michael Steinbach and Vipin Kumar, “Introduction to Data Mining”,
Pearson Publisher 2nd edition.
3. Ian H. Witten, Eibe Frank and Mark A. Hall, “Data Mining”, Morgan Kaufmann 3rd
edition.

Term Work:
The Term work Marks are based on the weekly experimental performance of the students, Oral
performance and regularity in the lab.
Students are expected to be prepared for the lab ahead of time by referring the manual and
perform the experiment under the guidance and discussion. Next week the experiment write-
up to be corrected along with oral examination.

End Semester Examination:

End of the semester, there will be Oral examination based on the laboratory work and the
corresponding theory syllabus.
 Theor Practic Tutori
Theor Practic Tutori Total
y al/ al
y al al Credi
Credi Oral Credit
Hrs Hrs Hrs ts
t Credit s
Comput
CELDLO60 er
- 02 - - 01 - 01
33 Vision
Lab

Examination Scheme
Ter
Practic
m Ora Tot
Theory Marks al &
Wor l al
Course Course Oral
k
Code Name
In-Sem Evaluations End
Mid Sem
IA IA AV Sem
Exa
1 2 G Exa
m
m
Comput
CELDLO60 er
- - - - - 25 - 25 50
33 Vision
Lab

Course Objectives:
1. To Recognize and describe practical aspects of computing with images.
2. To connect issues from Computer Vision to Human Vision
3. To explore various vision techniques and build Computer vision application

Course Outcomes: At the end of the course learner will able to

1. Understand basic statistical analysis of images.

2. Explore various advance approaches in image segmentation
3. Illustrate ways to describe and represent images.
4. Represent objects using different area features.
5. Apply region analysis using extracted features.
6. Apply recognition steps to identify objects.

Prerequisites:
1. Programming in C / Python

Suggested Experiments:
 Experiment Experiments Name CO Mapping
No.
1 Basic Statistical Analysis of Images CO1

2 To perform Image Segmentation (Connected CO2

Component Labeling, spatial clustering)

3 To perform various Morphological Operations on CO3

Images

4 To extract SIFT features from Images CO3

5 To perform Feature Extraction from Images CO4

6 To perform Basic Shape Analysis Implementation CO5

7 Binary Classification application CO6

8 OCR/ Face Detection / Disease detection application CO6

Text Books:

1. Robert Haralick and Linda Shapiro, “Computer and Robot Vision”, Vol I, II,
Addison- Wesley, 1993.
2. Adrian Rosebrock, “Practical Python and OpenCV: An Introductory, Example Driven
Guide to Image Processing and Computer Vision”, pyimagesearch, 2016.

Reference Books:
1. Szeliski R., “Computer Vision: Algorithms and Applications”, Springer, 2011.

Term Work:
The Term work Marks are based on the weekly experimental performance of the students, Oral
performance and regularity in the lab.
Students are expected to be prepared for the lab ahead of time by referring the manual and
perform the experiment under the guidance and discussion. Next week the experiment write-
up to be corrected along with oral examination.
End Semester Examination:
End of the semester, there will be oral evaluation based on the laboratory work and the
corresponding theory syllabus.
 Theory Practical Tutorial Theory Practical/ Tutorial Total
Hrs Hrs Hrs Credit Oral Credits Credits
Credit
CELDLO6034 Cryptography
& Network - 02 - - 01 - 02
Security Lab

Examination Scheme
Term
Theory Marks Practical Oral Total
Work
Course Code Course Name
In-Sem Evaluations
End
Mid Sem
IA1 IA2 AVG Sem Exam
Exam
CELDLO6034 Cryptography
& Network - - - - - 25 25 -- 50
Security Lab

Course Objectives:
1. To introduce classical encryption techniques.
2. To explore the working principles and utilities of various cryptographic algorithms.
3. To develop the ability to use existing cryptographic utilities to build programs for
secure communication.
4. To explore various Network attacks.

Course Outcomes: After completion of the course, student should be able to

1. Apply the knowledge of symmetric cryptography to implement simple ciphers.

2. Analyse and implement public key cryptosystem and Digital signature schemes like RSA
and El Gamal.
3. Analyse and evaluate performance of hashing algorithms.
4. Explore the different network reconnaissance tools like sniffers, port scanners and other
related tools to gather network related information.
5. Set up firewalls and transport layer security using open-source technologies.
6. Explore various attacks like buffer-overflow, and web-application attacks.

Prerequisites:
1. Operating System
2. Computer Networks
 Sr. CO
Module Detailed Content Hours
No. Mapping
Design and Implementation of a product
Basic
1 cipher using Substitution and 2 LO1
Cryptography
Transposition ciphers
Symmetric
and
Implementation and analysis of RSA
2 Asymmetric 2 LO2
public key cryptosystem
key
Cryptography
Key Implementation of Diffie Hellman Key
3 2 LO3
Management exchange algorithm (Virual Lab)
Cryptographic 1.For varying message sizes, test integrity
Hash of message using MD-5, SHA-1, and
4 Functions analyses the performance of the two 2 LO4
protocols. Use crypt API

Authentication
Protocols &
Implement Digital signature scheme usng
5 Digital 2 LO5
RSA Algo
Signature
Schemes
Study and use network reconnaissance
tools like WHOIS, dig, traceroute,
nslookup, nmap to gather information
about networks and domain registrars

Study and install a packet sniffer tool

(Wireshark) to capture packets in
Network promiscuous mode based on different
6 Security and filters. Study of packet sniffer tools: 06 LO6
Applications Wireshark:

Download and install Wireshark and

capture icmp, tcp, and http packets in
promiscuous mode. Explore how the
packets can be traced based on different
filters.
6 2 LO6

Text/Reference Books:
1. Cryptography and Network Security, Aul Kahate, Tata Mc Graw Hill.
2. Behrouz A. Ferouzan, “Cryptography & Network Security”, Tata Mc Graw Hill.
3. Hack I.T. - Security Through Penetration Testing, T. J. Klevinsky, Scott Laliberte and
Ajay Gupta, Addison-Wesley, ISBN: 0-201-71956-8
 4. Metasploit: The Penetration Tester's Guide, David Kennedy, Jim O'Gorman, Devon
Kearns, Mati Aharoni
5. CompTIA Security+ All-in-One Exam Guide By Wm. Arthur Conklin

Term Work:
The Term work Marks are based on the weekly experimental performance of the students, Oral
performance and regularity in the lab.
Students are expected to be prepared for the lab ahead of time by referring the manual and
perform the experiment under the guidance and discussion. Next week the experiment write-
up to be corrected along with oral examination.
End Semester Examination:
End of the semester, there will be oral evaluation based on the laboratory work and the
corresponding theory syllabus.
 Theo Practic Tutori Theo Practic Tutorial Total
ry Hrs al Hrs al Hrs ry al/ Oral Credit s Credits
Credi Credit
t
CELDLO604 Mobile
1 Computi - 02 - - 01 - 01
ng Lab

Examination Scheme
Ter
m Practic Ora Tota
Theory Marks
Wor al l l
Course Course k
Code Name
In-Sem Evaluations
End
Mid Sem
IA IA AV Sem Exa
1 2 G Exa m
m
CELDLO60 Mobile
41 Computi - - - - - 25 25 - 50
ng Lab

Course Objectives:
1. To learn mobile computing tools and software for implementation.
2. To understand security algorithms in mobile networks.
3. To learn security concepts.

Course Outcomes: At the end of the course, the students will be able to
1. Carry out simulation of frequency reuse, hidden/exposed terminal problem.
2. Articulate the knowledge of GSM, CDMA & Bluetooth technologies and demonstrate it.
3. Implement and demonstrate mobile node discovery and route maintenance.
4. Demonstrate and compare the performance of Wireless LAN.
5. Develop and demonstrate mobile applications using various tools.
6. Explore different generations of mobile networks and their applications.
 Sr. No. Title CO Meet
To understand the cellular frequency reuse concept CO1
to find the co-channel cells for a particular cell.
1
Visualize & understand the behavior of cellular
network on virtual lab environment.
To understand the cellular frequency reuse concept
to find the cell clusters within certain geographic
2 CO1
area. Visualize & understand the behavior of
cellular network on virtual lab environment.
Implementation a Bluetooth network with
3 application as transfer of a file from one device to CO2
another.
To implement a basic function of Code Division
Multiple Access (CDMA) to test the orthogonality
4 and autocorrelation of a code to be used for CDMA CO2
operation. Write an application based on the above
concept.
To implement Mobile node discovery (discover
5 client device address on Server device) CO3

Implementation of GSM security algorithms

6 (A3/A5/A8) CO2

Illustration of Hidden Terminal Problem (NS-2)

6 CO4

Develop an application that uses GUI components.

7 CO5

Write an application that draws basic graphical

8 CO5
primitives on the screen.
Implementation of income tax/loan EMI calculator
9 CO5
and deploy the same on real devices
Case Study on comprehensive & detail study of
10 1G, 2G, 2.5G, 3G, 4G, 4GLTE & 5G (content CO6
Beyond Syllabus)

Textbooks:

1. Jochen Schiller, “Mobile Communication,” Addison wisely, Pearson Education

2. Khaldoun Al Agha, Guy Pujolle, Tara Ali-Yahiya, “Mobile and Wireless Networks,”
Wiley Publications.

Reference Books:
1. William Stallings, “Wireless Communications & Networks,” Second Edition, Pearson
Education.
2. Christopher Cox, “An Introduction to LTE: LTE, LTE-Advanced, SAE and 4G Mobile
Communications,” Wiley publications
3. Mobility Protocols and Handover Optimization: Design, Evaluation, and Application By
Ashutosh Dutta, Henning Schulzrinne, IEEE Press, Wiley Publication
4. Andreas F. Molisch, “Wireless Communications,” Wiley Publications, 2nd edition.

Term Work:
The Term work Marks are based on the weekly experimental performance of the students,
Oral performance and regularity in the lab.
Students are expected to be prepared for the lab ahead of time by referring the manual and
perform the experiment under the guidance and discussion. Next week the experiment write-
up to be corrected along with oral examination.

End Semester Examination:

End of the semester, there will be oral evaluation based on the laboratory work and the
corresponding theory syllabus.
 Theory Practical Tutorial Theory Practical/Oral Tutorial Total
Hrs Hrs Hrs Credit Credit Credits Credits

CELDLO6042 Artificial - 02 - - 01 - 01
Intelligence
Lab

Course Code Course Examination Scheme

Name
Theory Marks Term Practical Oral Total
Work & Oral

In-Sem Evaluations End

Sem
IA1 IA2 AVG Mid Exam
Sem
Exam

Artificial
CELDLO6042 Intelligence - - - - - 25 - 25 50
Lab

Course Objectives:

1. To understand the basic concepts for building the intelligent systems.

2. To apply appropriate search techniques used in problem solving.
3. To apply fuzzy logic in real life problems.
4. To understand planning problem for any real-world problem.

Lab Outcomes: At the end of the course, the students will be able to

1. Identify languages and technologies for Artificial Intelligence.

2. Understand and implement uninformed searching techniques for real world problems.
3. Plan and design a simple game.
4. Design fuzzy logic-based system.
5. Design and implement expert systems for real world problems.
6. Design and implement expert systems for real world problems.

Prerequisite: Discrete Mathematics, Data Structure

Suggested List of Experiments (programming in python)

 Experiment Experiments Name CO
No. Mapping

1 Case study on State space formulation and PEAS CO1

representation for anyone AI application.

2 Implement Breadth First Search method. CO2

3 Implement Depth First Search method. CO2

4 Implement Heuristic search method. CO3

5 Implement A* algorithm. CO3

6 Implement Resolution logic using first order logic CO4

7 Implement Resolution Logic using predicate logic. CO4

8 Implement Program on Fuzzy Logic CO5

9 One case study on AI applications as Expert Systems CO6

10 Implement Block world problem. CO6

Text Books:

1. Dr Deepak Khemani, “A First Course in Artificial Intelligence” McGraw Hill

Publication India Limited

Reference Books:

1. Kevin Knight, Elaine Rich, Shivashankar B. Nair, “Artificial Intelligence" Third

Edition, McGraw Hill

Term Work:

The Term work Marks are based on the weekly experimental performance of the students, Oral
performance and regularity in the lab.

Students are expected to be prepared for the lab ahead of time by referring the manual and
perform the experiment under the guidance and discussion. Next week the experiment write-
up to be corrected along with oral examination.

End Semester Examination:

End of the semester, there will be Practical examination along with oral evaluation based on
the laboratory work and the corresponding theory syllabus.
 Theory Practical Tutorial Theory Practical/ Tutorial Total
Hrs Hrs Hrs Credit Oral Credits Credits
Credit
CELDLO6043 Augmented - 02 - - 01 - 01
Reality /
Virtual
Reality
Lab

Course Code Course Name Examination Scheme

Theory Marks Term Practical Oral Total

Work & Oral

In-Sem Evaluations End

Sem
IA1 IA2 AVG Mid Exam
Sem
Exam

CELDLO6043 Augmented - - - - - 25 - 25 50
Reality /
Virtual
Reality Lab

Course Objectives:

1. To experience the immersive technologies.

2. To implement AR and VR concepts.
3. To develop AR and VR applications.
4. To implement projects using AR/VR toolkits.

Course Outcomes: At the end of the course, the students will be able to

1. Compare and Contrast VR and AR experiences

2. Understand and develop VR apps in Unity
3. Understand and develop AR apps in Unity
4. Demonstrate various tools and programming languages to develop AR/VR applications.
5. Acquire knowledge in VR and AR technologies in terms of used devices, building of the
virtual environment and modalities of interaction and modeling.
6. Acquire knowledge about the application of VR and AR technologies in medicine,
education, cultural heritage and games.

Suggested List of Experiments

 Experiment Experiments Name CO Mapping
No.

Weekly Experiments - PART-A

1 CO1
Create a multiplayer VR/AR game . The game should
keep track of score, no. of chances/lives, levels(created
using different scenes), involve interaction, animation
and immersive environment

Installation of Unity and Visual Studio, setting up

Unity for VR/AR development, understanding
documentation of the same.

Develop a VR scene in Unity that includes: i. a cube,

2 plane and sphere, apply transformations on the 3 game CO2
objects. ii. add a video and audio source.

Write a C# program in visual studio to change the colour

3 and material/texture of the game objects dynamically on CO4
button click.

4 Develop a VR game in Unity such that on each gun CO2

trigger click, destroy the cubes placed on the plane and
gain a score point. Make a score UI and display it on
the screen.

Develop a AR Game to visualise the models and and

5 solve puzzles. The developed game should be a single CO3
player game.

6 Develop a AR text book application to scan and CO6

visualise the images.

Mini-Projects/ Case Study - PART-B

7 CO1, CO2,
Create a multiplayer VR/AR game. The game should CO3, CO4,
keep track of score, no. of chances/lives, levels (created CO5, CO6
using different scenes), involve interaction, animation
and immersive environment

Text Books:
 1. Steve Aukstakalnis, “Practical Augmented Reality: A Guide to the Technologies,
Applications, and Human Factors for AR and VR”, Addison-Wesley Professional,
September 2016,
2. Allan Fowler, William Sherif, “Beginning iOS AR Game Development: Developing
Augmented Reality Apps with Unity and C#”, 1st Edition, Apress Publications, 2018

3. Steven M. LaValle, “Virtual Reality”, Cambridge University Press, 2016

4. William R Sherman and Alan B Craig, “Understanding Virtual Reality: Interface,
Application and Design”, Morgan Kaufmann Publishers, San Francisco, CA, 2002
5. Alan B Craig, William R Sherman and Jeffrey D Will, “Developing Virtual Reality
Applications: Foundations of Effective Design”, Morgan Kaufmann, 2009.
6. Allan Fowler, “AR Game Development”, 1st Edition, A press Publications, 2018.
7. Schmalstieg / Hollerer, “Augmented Reality: Principles & Practice” by, Pearson
Education India; First edition 2016.

Reference Books:
3. Jesse Glover, Jonathan Linowes, “Complete Virtual Reality and Augmented Reality
Development with Unity: Leverage the power of Unity and become a pro at creating mixed
reality applications”, Packt publishing, 2019.
4. Jonathan Linowes, Krystian Babilinski, “Augmented Reality for Developers: Build
practical augmented reality applications with Unity”, Packt Publishing, 2017.

Term Work:
The Term work Marks are based on the weekly experimental performance of the students, Oral
performance and regularity in the lab.
Students are expected to be prepared for the lab ahead of time by referring the manual and
perform the experiment under the guidance and discussion. Next week the experiment write-
up to be corrected along with oral examination.

End Semester Examination:

End of the semester, there will be oral evaluation based on the laboratory work and the
corresponding theory syllabus.
 Theory Practical Tutorial Theory Practical/Oral Tutorial Total
Hrs Hrs Hrs Credit Credit Credits Credits
CELDLO6044 Cyber - 02 - - 01 - 02
Security
Lab

Course Code Course Examination Scheme

Name
Theory Marks Term Practical Oral Total
Work

In-Sem Evaluations
End
Mid Sem
IA1 IA2 AVG Sem Exam
Exam

CELDLO6044 Cyber - - - - - 25 25 - 50
Security
Lab

Course Objectives:

1. To understand fundamentals of cyber security in cloud.

2. To understand the background of cryptography.
3. To study various types of Cyber threats.
4. To understand the working of Data center and Data Protection techniques.
5. To understand the Cloud Native Security.
6. To study Compliance and Security Audits policies for data centres.

Course Outcomes: After completion of the course, learner should be able to:

1. Identify security challenges in cloud environment.

2. Implement different cryptographic algorithm.
3. Simulate different Cyber-attacks and apply Cyber Security mechanism.
4. Apply different data protection techniques in data centers.
5. Demonstrate cloud security tools.
6. Interpret and appropriately apply the policies on Compliance and Security Audits for data
centres.

Prerequisites:

1. Operating System
2. Database Management System
3. Computer Networks

Expt No. Expermiment Name CO Mapping

1. Analysis of different security attacks on cloud and

1 its applications CO1
2. Demonstration of DoS attack.

1. Implementation of symmetric and asymetric

2 algorithm CO2
2. Configuring Authentication and two factor
authentication

1. Network monitoring and analysis using wireshark

3 and nmap tool. CO3
2. Demonstration of Securing Endpoints using
Vulnerability Profiles
3. Demonstration of Decrypting SSH Traffic

1. Configuration of Threats prevention from the

4 Internet with File Blocking CO4
2. Demonstration of Data breaching and prevention
techniques.
3. Configuration of Intrusion detection and prevention
system

1. Case study on Secure the Cloud (Prisma)

5 2. Demonstration of SQL Injection, Cross-site CO5
scripting using burp suite, OpenVAS, Nessus.
Owasp zap etc.(OWAPS Top 10 attack)

1. Study of Governance, Risk , Compliance Concepts

6 2. Study about standards like HIPAA, PCIDSS , ISO CO6
27001, SOX etc.

Text/Reference Books:

1. Atul Kahate, “Cryptography and Network Security”, Tata Mc Graw Hill.

2. Behrouz A. Ferouzan, “Cryptography & Network Security”, Tata Mc Graw Hill.
3. T. J. Klevinsky, Scott Laliberte and Ajay Gupta, Addison-Wesley, “Hack I.T. - Security
Through Penetration Testing”, ISBN: 0-201-71956-8.

Reference Books:

1. David Kennedy, Jim O'Gorman, Devon Kearns, Mati Aharoni, “Metasploit: The
Penetration Tester's Guide”, No Starch Press.
2. Wm. Arthur Conklin, “CompTIA Security+ All-in-One Exam Guide”, McGraw Hill.

Term Work:
The Term work Marks are based on the weekly experimental performance of the students, Oral
performance and regularity in the lab.
Students are expected to be prepared for the lab ahead of time by referring the manual and
perform the experiment under the guidance and discussion. Next week the experiment write-
up to be corrected along with oral examination.

End Semester Examination:

End of the semester, there will be oral evaluation based on the laboratory work and the
corresponding theory syllabus.
Subject Subject Name Theory Practical TutorialTheory Tutorial Total
Code Hrs Hrs Hrs Credit Practical Credits Credits
Credits
CESL601 Skill Based Lab IV 02+02* - - 02 - 02
– DevOPs

Examination Scheme
Theory Marks Term Practical Oral Total
Subject Subject Name Work &
Code Oral
In-Sem Evaluations End
Mid Sem
IA1 IA2 AVG Sem Exam
Exam
CESL601 Skill Based Lab
IV – DevOPs - - - - - 25 25 - 50

Course Objectives:

1. To understand DevOps practices which aims to simplify Software Development

Life.
2. To be aware of different Version Control tools like GIT, CVS or Mercurial
3. To Integrate and deploy tools like Jenkins and Maven, which is used to build, test
and deploy applications in DevOps environment
4. To be familiarized with selenium tool, which is used for continuous testing of
applications deployed.
5. To use Docker to Build, ship and manage applications using containerization
6. To understand the concept of Infrastructure as a code and install and configure
Ansible tool.

Course outcomes: After completion of the course, learner should be able to

1. To understand the fundamentals of DevOps engineering and be fully proficient with
DevOps terminologies, concepts, benefits, and deployment options to meet your
business requirements.
2. To obtain complete knowledge of the “version control system” to effectively track
changes augmented with Git and GitHub.
3. To understand the importance of Jenkins to Build and deploy Software Applications
on server environment.
4. Understand the importance of Selenium and Jenkins to test Software Applications.
5. To understand concept of containerization and Analyze the Containerization of OS
 images and deployment of applications over Docker.
6. To Synthesize software configuration and provisioning using Ansible.

Prerequisites:

• Software Engineering
• Operating System
• Skill Based LabI: Java (OOPM) Programming Lab
• Skill Based Lab II: Python Programming Lab
• Computer Networks

Suggested List of Experiments:

Sr. Detailed Syllabus Hours CO

No. Mapping

Introduction to DevOps: 2 CO1

1 • Learn about the concept of DevOps and the practices
and principles followed to implement it in any
company’s software development life cycle.
 Understand why DevOps evolved as a prominent
culture in most of the modern-day startups to achieve
agility in the software development process

Version Control System: 4 CO2

2 • GIT Installation, Version Control, Working with
remote repository
• GIT Cheat sheet
• Create and fork repositories in GitHub
• Apply branching, merging and rebasing concepts.
• Implement different Git workflow strategies in real-
time scenarios
• Understand Git operations in IDE

Continuous Integration using Jenkins: 5 CO3

3 • To perform Continuous Integration using Jenkins by
building and automating test cases using Maven /
Gradle / Ant.
• Introduction to Jenkins (With Architecture)
• Introduction to Maven / Gradle / Ant
• Jenkins Management Adding a slave node to Jenkins
 • Build the pipeline of jobs using Maven / Gradle / Ant
in Jenkins, create a pipeline script to deploy an
application over the tomcat server

Continuous Testing with Selenium: 2 CO4

4 • Introduction to Selenium
• Installing Selenium
• Creating Test Cases in Selenium WebDriver
• Run Selenium Tests in Jenkins Using Maven

Continuous Deployment: Containerization with Docker: 6 CO5

5 • Introduction to Docker Architecture and Container
Life Cycle
• Understanding images and containers
• Create and implement docker images using
Dockerfile.
• Container Lifecycle and working with containers.
• To Build, deploy and manage web or software
application on Docker Engine.
• Publishing image on Docker Hub

Continuous Deployment: Configuration Management 7 CO6

6 with Ansible:
• To install and configure Software Configuration
Management using Chef/Puppet/Ansible or Saltstack.
• To Perform Software Configuration Management and
provisioning using Chef/Puppet/Ansible or Saltstack.

Text Book:
1. Karl Matthias & Sean P. Kane, Docker: Up and Running, O'Reilly Publication.
2. Len Bass, Ingo Weber, Liming Zhu, ”DevOps, A Software Architects Perspective”,
Addison Wesley, Pearson Publication.
3. John Ferguson Smart,” Jenkins, The Definitive Guide”, O'Reilly Publication.
Reference Book:
1. Sanjeev Sharma and Bernie Coyne,” DevOps for Dummies”, Wiley Publication
2. Httermann, Michael, “DevOps for Developers”, A press Publication.
3. Joakim Verona, “Practical DevOps”, Pack publication

Term Work:
The Term work Marks are based on the weekly experimental performance of the students,
Oral performance and regularity in the lab.
Students are expected to be prepared for the lab ahead of time by referring the manual
 and perform the experiment under the guidance anddiscussion. Next week the experiment
write-up to be corrected along with oral examination.

End Semester Examination:

End of the semester, there will be Practical examination along with oral evaluation based on
the laboratory work and the corresponding theory courseSyllabus.
 Theor Practical Tutorial Theory Practical/Oral Tutorial Total Credits
y Hrs Hrs Hrs Credit Credit Credits

Mini
CEMP601
Projec - 04 - - 02 - 02
t IV

Course Code Course Examination Scheme

Name
Theory Marks Term Practical Oral Total
Work

In-Sem Evaluations
End
Mid Sem
IA 1 IA 2 AVG Sem Exa
Exa m
m

CEMP601 Mini - - - - - 25 25 - 50
Project IV

Prerequisites: Technology Stack

Lab Description: The students will undergo the experience of developing a project using the
latest ntechnology and tools by applying all stages of project development life cycle. They are
expected to learn the skills of teamwork, survey of the problem domain, understand the issues
to be addressed and implement any real-life application which will meet societal requirements.
A quality report exploring technical report writing skills will be generated as a part of activity.
Objectives:
1. To inculcate the process of self-learning and research.
2. To acquaint with the process of identifying the needs by performing the problem
analysis and literature survey
3. To select the relevant technologies and design a solution.
4. To implement the solution and perform validation and anlaysis of the results.
Outcomes: After successful completion of this lab, the learner will be able to,
1. Identify the issues in the society related to preferred domain of study.
2. Conduct survey and analysis of existing systems for identified issue.
3. Formulate the problem and design a solution for solving it
4. Systematically plan and implement the solution.
5. Perform validation and anlaysis of the results.
6. Prepare a technical report and present
Guidelines:
1. Students shall form a group of 3 to 4 students.
2. Students should do survey and identify needs, which shall be converted into
problem statement for mini project in consultation with faculty supervisor/head
of department/internal committee of faculties.
3. Faculty supervisor will give inputs to students during mini project activity;
however, focus shall be on self-learning.
4. Students in a group shall understand problem effectively, propose multiple
solutions and select best possible solution in consultation with guide /
supervisor.
5. Students have to develop an application based on programming language they
have learned during course.
6. Students can develop project using the latest tools and techniques of their
choice.

Term Work:
The review/ progress monitoring committee shall be constituted by head of departments of
the institute. There will be 2 reviews to evaluate the progress of mini project.
In continuous assessment focus shall also be on each individual student, assessment based
on individual’s contribution in group activity, their understanding, contribution and
response to questions.
The Term work Marks are based on the weekly performance of the students, review
performances, quality of the report, Oral performance and regularity.

End Semester Examination:

End of the semester, a panel of examiners will take a presentation and demonstration on
the Mini Project along with oral evaluation.