SEMESTER 3

ELECTRONICS & COMPUTER

ENGINEERING
 SEMESTER S3
Mathematics for Electrical Science and Physical Science – 3
(Common to B & C Groups)

Course Code GYMAT301 CIE Marks 40

Teaching Hours/Week (L:

3:0:0:0 ESE Marks 60
T:P: R)

Credits 3 Exam Hours 2 Hrs. 30 Min.

Basic knowledge in
Prerequisites (if any) Course Type Theory
complex numbers.

Course Objectives:

1. To introduce the concept and applications of Fourier transforms in various engineering fields.
2. To introduce the basic theory of functions of a complex variable, including residue integration
and conformal transformation, and their applications

SYLLABUS
Module Contact
Syllabus Description
No. Hours
Fourier Integral, From Fourier series to Fourier Integral, Fourier Cosine and
Sine integrals, Fourier Cosine and Sine Transform, Linearity, Transforms of

1 Derivatives, Fourier Transform and its inverse, Linearity, Transforms of 9

Derivative.
(Text 1: Relevant topics from sections 11.7, 11.8, 11.9)
Complex Function, Limit, Continuity, Derivative, Analytic functions, Cauchy-
Riemann Equations (without proof), Laplace’s Equations, Harmonic functions,

2 Finding harmonic conjugate, Conformal mapping, Mappings of w=z2, 9

w=ez,w=1z, w=sinz.
(Text 1: Relevant topics from sections 13.3, 13.4, 17.1, 17.2, 17.4)
Complex Integration: Line integrals in the complex plane (Definition & Basic

3 properties), First evaluation method, Second evaluation method, Cauchy’s 9

integral theorem (without proof) on simply connected domain, Independence of
 path, Cauchy integral theorem on multiply connected domain (without proof),
Cauchy Integral formula (without proof).
(Text 1: Relevant topics from sections 14.1, 14.2, 14.3)
Taylor series and Maclaurin series, Laurent series (without proof), Singularities
and Zeros – Isolated Singularity, Poles, Essential Singularities, Removable
singularities, Zeros of Analytic functions – Poles and Zeros, Formulas for
4 9
Residues, Residue theorem (without proof), Residue Integration- Integral of
Rational Functions of cosθ and sinθ.
(Text 1: Relevant topics from sections 15.4, 16.1, 16.2, 16.3, 16.4)

Course Assessment Method

(CIE: 40 marks , ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

Internal Examination- Internal Examination-

Assignment/
Attendance 1 2 Total
Microproject
(Written) (Written )

5 15 10 10 40

End Semester Examination Marks (ESE)

In Part A, all questions need to be answered and in Part B, each student can choose any one full
question out of two questions

Part A Part B Total

 2 Questions from each  Each question carries 9 marks.
module.  Two questions will be given from each module, out
 Total of 8 Questions, of which 1 question should be answered.
60
each carrying 3 marks  Each question can have a maximum of 3 sub
divisions.
(8x3 =24marks) (4x9 = 36 marks)
 Course Outcomes (COs)
At the end of the course students should be able to:

Bloom’s Knowledge
Course Outcome
Level (KL)
Determine the Fourier transforms of functions and apply them to solve
CO1 K3
problems arising in engineering.
Understand the analyticity of complex functions and apply it in
CO2 K3
conformal mapping.
Compute complex integrals using Cauchy's integral theorem and
CO3 K3
Cauchy's integral formula.
Understand the series expansion of complex function about a
CO4 K3
singularity and apply residue theorem to compute real integrals.

Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create
CO-PO Mapping Table:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 3 - 2 - - - - - - - 2
CO2 3 3 - 2 - - - - - - - 2
CO3 3 3 - 2 - - - - - - - 2
CO4 3 3 - 2 - - - - - - - 2

Text Books
Sl. Name of the Name of the Edition and
Title of the Book
No Author/s Publisher Year
Advanced Engineering
1 Erwin Kreyszig John Wiley & Sons 10 edition, 2016
th

Mathematics
 Reference Books
Sl. Name of the Edition and
Title of the Book Name of the Author/s
No Publisher Year
Dennis G. Zill, Patrick D. 3rd edition,
1 Complex Analysis Jones & Bartlett
Shanahan 2015
Higher Engineering McGraw-Hill 39th edition,
2 B. V. Ramana
Mathematics Education 2023
Higher Engineering 44th edition,
3 B.S. Grewal Khanna Publishers
Mathematics 2018
Fast Fourier Transform -
K.R. Rao, Do Nyeon Kim, 1st edition,
4 Algorithms and Springer
Jae Jeong Hwang 2011
Applications
 SEMESTER S3

DATA STRUCTURES
Course Code PCERT 302 CIE Marks 40
Teaching Hours/Week (L:
T:P: R)
3:1:0:0 ESE Marks 60

Credits 4 Exam Hours 2 Hrs. 30 Min.

UCEST105-
Algorithmic thinking
Prerequisites (if any) with python Course Type Theory
GBEST204 –
Programming in C

Course Objectives:

1. To impart a thorough understanding of linear data structures such as arrays, stacks,

queues and linked lists and their applications.
2. To impart a thorough understanding of non-linear data structures such as trees,
graphs and their applications.
3. To impart familiarity with various sorting, searching and hashing techniques and
their performance comparison.
SYLLABUS

Module Contact
Syllabus Description
No. Hours
Basic Concepts of Data Structures: Algorithms, Performance Analysis,
Space Complexity, Time Complexity, Asymptotic Notations
1 11
Arrays: Linear Search and Binary Search, Stacks, Queues-Circular
Queues,Priority Queues, Double Ended Queues, Evaluation of Expressions
Linked List: Self-Referential Structures, Dynamic Memory Allocation,
Singly Linked List- Operations on Linked List. Doubly Linked List, Circular
2 11
Linked List, Stacks and Queues using Linked List, Polynomial
representation using Linked List
Trees and Graphs: Trees, Binary Trees-Tree Operations, Binary Tree
Representation, Tree Traversals, Binary SearchTrees- Binary Search Tree
3 11
OperationsGraphs, Representation of Graphs, Depth First Search and
Breadth First Search on Graphs, Applications of Graphs
Sorting and Hashing: Sorting Techniques – Selection Sort, Insertion Sort,
4 11
Quick Sort, Merge Sort and Heap Sort
 Hashing- Hashing Techniques, Collision Resolution, Overflow handling,
Hashing functions – Mid square, Division,Folding, Digit Analysis

Course Assessment Method

(CIE: 40 marks,ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

Internal Internal
Assignment/
Attendance Examination-1 Examination- 2 Total
Microproject
(Written) (Written)

5 15 10 10 40

End Semester Examination Marks (ESE)

In Part A, all questions need to be answered and in Part B, each student can choose any one
full question out of two questions

Part A Part B Total

 2 Questions from each  Each question carries 9 marks.
module.  Two questions will be given from each module, out
 Total of 8 Questions, each of which 1 question should be answered.
60
carrying 3 marks  Each question can have a maximum of 3 sub
divisions.
(8x3 =24marks) (4x9 = 36 marks)

Course Outcomes (COs)

At the end of the course students should be able to:

Bloom’s
Course Outcome Knowledge
Level (KL)
CO1 Compare performance of algorithms using asymptotic notations K2
Solve real world problems efficiently using appropriate data structures
CO2 K3
like arrays, linked list, stacks and queues.
Make use of nonlinear data structures like trees and graphs to design
CO3 K3
algorithms for various applications.

CO4 Apply and compare various techniques for searching and sorting. K3

CO5 Apply appropriate hash function to store and access a given dataset K3
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create
 CO-PO Mapping Table (Mapping of Course Outcomes to Program Outcomes)

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 2 2 2 1 - 1 - - - - - -
CO2 3 2 3 1 - 1 - - - - - -
CO3 3 2 3 1 - 1 - - - - - -
CO4 2 2 3 1 - 1 - - - - - -
CO5 3 2 2 1 - 1 - - - - - -
Note: 1: Slight (Low), 2: Moderate (Medium), 3: Substantial (High), -: No Correlation

Text Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Ellis
Fundamentals of Data Horowitz,SartajSahni
1 Universities Press 2/e,2008
Structures in C and Susan Anderson-
Freed

2 Classic Data Structures Samanta D Prentice Hall India 2/e, 2009

Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Data Structures: A Pseudocode Richard F. Gilberg,
1 Cengage Learning 2/e, 2007
Approach with C Behrouz A. Forouzan
Aho A. V., J. E. Hopcroft
2 Data Structures and Algorithms Pearson Publication 1983
and J. D. Ullman
Introduction to Data Structures Tremblay J. P. and P. G.
3 Tata McGraw Hill 1995
with Applications Sorenson
Cambridge University
4 Advanced Data Structures Peter Brass 2008
Press
Theory and Problems of Data
5 Lipschuts S. Schaum’s Series 1986
Structures
 Video Links (NPTEL, SWAYAM…)
Module
Link ID
No.
https://nptel.ac.in/courses/106102064
https://youtu.be/zWg7U0OEAoE
1
https://youtu.be/g1USSZVWDsY
https://youtu.be/PGWZUgzDMYI
https://nptel.ac.in/courses/106102064
2
https://youtu.be/PGWZUgzDMYI
https://nptel.ac.in/courses/106102064
https://youtu.be/tORLeHHtazM
3
https://youtu.be/eWeqqVpgNPg
https://youtu.be/9zpSs845wf8
https://youtu.be/KW0UvOW0XIo
4
https://youtu.be/gtWw_8VvHjk
 SEMESTER S3

DIGITAL SYSTEM DESIGN USING VERILOG

Course Code PCERT 303 CIE Marks 40

Teaching Hours/Week (L:

3:1:0:0 ESE Marks 60
T:P: R)

Credits 4 Exam Hours 2 Hrs. 30 Min.

Prerequisites (if any) Digital Electronics Course Type Theory

Course Objectives:

1. This course enables students to design/model Digital systems, consisting of combinational

and sequential circuits, using Verilog HDL.

SYLLABUS
Module Contact
Syllabus Description
No. Hours

Introduction to Verilog HDL: Evolution of CAD, emergence of HDLs,

typical HDL-based design flow, Importance of Verilog HDL, trends in
1
HDLs. Hierarchical Modelling Concepts -Top-down and bottom-up design
10
methodology. Basic Concepts of Lexical conventions, data types.

Verilog for Digital Logic Design: Dataflow, behavioural, structural

modelling. Verilog implementation of basic gates &combinational circuits
2 (Half adder& full adder, Half subtractor & full subtractor, decoder, encoder,
multiplexer, demultiplexer), simple test bench for combinational circuits. 12
Modelling of flipflops in Verilog (with test bench).

Finite State machine: State diagram, State Table, State assignments, state
graphs, capabilities and limitations of FSM. Mealy and Moore machines,
3 12
Modelling of clocked synchronous circuits as Mealy and Moore machines:
Serial binary adder, sequence detector design examples.
 Introduction to FPGAs: Evolution of Programmable Devices, what is an
FPGA - Logic Blocks, Interconnection Resources, Applications of FPGAs,
Implementation Process. Programming Technologies - Static RAM
4
Programming Technology, Anti-fuse Programming Technology, EPROM 10
and EEPROM Programming Technology. Xilinx FPGA - Xilinx XC2000.
FPGA Design Flow Example.

Course Assessment Method

(CIE: 40 marks , ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

Internal Internal
Assignment/
Attendance Examination-1 Examination- 2 Total
Microproject
(Written) (Written )

5 15 10 10 40

End Semester Examination Marks (ESE)

In Part A, all questions need to be answered and in Part B, each student can choose any one
full question out of two questions

Part A Part B Total

● 2 Questions from each ● Each question carries 9 marks.
module. ● Two questions will be given from each module, out of
● Total of 8 Questions, each which 1 question should be answered.
60
carrying 3 marks ● Each question can have a maximum of 3 sub
divisions.
(8x3 =24marks) (4x9 = 36 marks)
 Course Outcomes (COs)

At the end of the course students should be able to:

Bloom’s
Course Outcome Knowledge
Level (KL)

CO1 Understand the programming concepts in Verilog HDL. K2

Design and implement combinational and sequential digital circuits
CO2 K3
using Verilog HDL, incorporating test benches for verification.
Apply the concepts of finite state machines (FSMs) to design
CO3 K3
synchronous digital circuits.
Explain the fundamental principles of Field-Programmable Gate
CO4 Arrays (FPGAs), including their architecture, programming K2
technologies, and design flow.
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create

CO-PO Mapping Table:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 2 2 2 2

CO2 3 2 2 2 2

CO3 3 2 2 2

CO4 2 1 1 1 2

Text Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Thomson Press (India) 7th Edition,
1 Fundamentals of Digital Design Charles H. Roth
Ltd 2015

Verilog HDL A Guide to 2nd Edition,

2 Samir Palitkar Pearson
Digital Design & Synthesis 2003

Field-Programmable Gate 1st Edition,

3 Stephen D. Brown Springer
Arrays 2012

Digital Design with an

6th Edition,
4 Introduction to the Verilog Mano M.M, Ciletti M.D Pearson
2022
HDL
 Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
1 Introduction to digital systems Milos D. Ercegovac John Wiley Sons 1/e 1998

10th
2 Digital Fundamentals Thomas L Floyd Pearson Education Edition,
2009

1st Edition,
3 Digital Principles and Design Donald D Givone Tata McGraw Hill
2003

2nd Edition,
4 Fundamentals of Digital Circuits A. Ananthakumar Prentice Hall
2016

Fundamentals of Digital Logic S Brown & Z. 2nd Edition,

5 Mc Graw Hill.
with Verilog HDL Varanestic, 2007

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
NPTEL : Computer Science and Engineering - NOC: Hardware Modeling Using Verilog;
1 Prof. Indranil Sen Gupta, IIT Kharagpur; Lecture 9
https://archive.nptel.ac.in/courses/106/105/106105165/

NPTEL : Electrical Engineering - NOC: Digital System Design; Prof. Neeraj Goel, IIT
2 Ropar; Lecture 20
https://archive.nptel.ac.in/courses/108/106/108106177/

NPTEL : Electrical Engineering - NOC: Digital System Design; Prof. Neeraj Goel, IIT
3 Ropar; Lecture 51
https://archive.nptel.ac.in/courses/108/106/108106177/

NPTEL : Electrical Engineering - NOC: Digital System Design; Prof. Neeraj Goel , IIT
4 Ropar; Lecture 65
https://archive.nptel.ac.in/courses/108/106/108106177/
 SEMESTER S3

ELECTRONIC DEVICES AND CIRCUITS

Course Code PBERT 304 CIE Marks 60

Teaching Hours/Week (L:

3:0:0:1 ESE Marks 40
T:P: R)

Credits 4 Exam Hours 2 Hrs. 30 Min.

Prerequisites (if any) None Course Type Theory

Course Objectives:

1. To develop the skill of the design of various analog circuits.

SYLLABUS

Module Contact
Syllabus Description
No. Hours

Wave shaping circuits and Transistors: First order RC low pass and high
pass filters. First order RC differentiating and integrating circuits, Diode
Clipping circuits. Diode Clamping circuits. Bipolar Junction Transistors:
1 9
Review of BJT characteristics- Operating point of BJT – Factors affecting
stability of Q-point. DC Biasing–Biasing circuits: fixed bias, collector to
base bias, voltage divider bias. Stability factor. Transistor as switch

BJT Amplifiers: RC coupled amplifier (CE configuration)–need of

various components and design, Concept of AC load lines, voltage gain
and frequency response. Small signal analysis of CE configuration using
small signal hybrid-pi model for mid frequency and low frequency.
(Gain, input and output impedance). High frequency equivalent circuits of
2 9
BJT
Multistage amplifiers: Direct, RC, transformer coupled Amplifiers,
Applications. Power amplifiers using BJT: Class A, Class B, Class AB,
Class C and Class D. Conversion efficiency – Derivation (Class A and Class
B). Distortion in power amplifiers.

3 Wave Generating circuits: Multivibrator and Oscillator Circuits: 9

 Multivibrators - Types of multivibrators (Astable and monostable) -
Feedback concepts, Barkhausen’s criterion for oscillation - Types of
oscillators – RC phase shift, Wien bridge, crystal oscillators. (Analysis of RC
phase shift and Wien bridge oscillator required)

Feedback amplifiers and Power supplies: Effect of positive and

negative feedback on gain, frequency response and distortion. The four
basic feedback topologies, Analysis of discrete BJT circuits in voltage-
series and voltage-shunt feedback topologies - voltage gain, input and
4 9
output impedance.
Regulated power supply: Shunt voltage regulator, series voltage regulator,
Short circuit protection and fold back protection, Output current boosting,
SMPS.

Suggestion on Project Topics

Course Assessment Method

(CIE: 60 marks, ESE: 40 marks)

Continuous Internal Evaluation Marks (CIE):

Attendance Project Internal Ex-1 Internal Ex-2 Total

5 30 12.5 12.5 60

End Semester Examination Marks (ESE)

In Part A, all questions need to be answered and in Part B, each student can choose any one
full question out of two questions

Part A Part B Total

 2 Questions from each 2 questions will be given from each module, out of
module. which 1 question should be answered. Each question
 Total of 8 Questions, can have a maximum of 2 sub divisions. Each question 40
each carrying 2 marks carries 6 marks.
(8x2 =16 marks) (4x6 = 24 marks)
 Course Outcomes (COs)

At the end of the course students should be able to:

Bloom’s
Course Outcome Knowledge
Level (KL)

Design analog signal processing circuits using diodes and first order RC K3
CO1
circuits.

CO2 Analyse various transistor biasing circuits and BJT amplifier circuits. K3
Design and analyse the wave-shaping multivibrator and oscillator K3
CO3
circuits using BJT

CO4 Design and develop feedback amplifiers and regulated power supplies K3

Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create

CO-PO Mapping Table:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 2 3 3

CO2 3 3 3 2 3 2 3

CO3 3 3 3 3 3 2 3

CO4 3 3 3 3 3 2 3

Text Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Electronic Devices and Circuit Robert Boylestad and L
1 Pearson 11/e, 2015
Theory Nashelsky

Sedra A.S and K.C. Oxford University

2 Microelectronic Circuits 6/e,2013
Smith Press

Electronic Circuits, Analysis Neamen D TMH 3/e,2007

3
and Design
 Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Fundamentals of Razavi B Wiley 2015
1
Microelectronics
2 Integrated Electronics Millman J.andC.Halkias McGraw-Hill 2/e, 2010.

Microelectronic Circuits-
3 Rashid M.H., Cengage Learning 2/e, 2011
Analysis and Design

Oxford University
4 Electronic Devices and Circuits David A Bell 2008.
Press

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
1 https://archive.nptel.ac.in/courses/117/103/117103063

2 https://archive.nptel.ac.in/courses/117/103/117103063

3 https://archive.nptel.ac.in/courses/117/103/117103063

4 https://archive.nptel.ac.in/courses/117/103/117103063

PBL Course Elements

L: Lecture R: Project (1 Hr.), 2 Faculty Members

(3 Hrs.) Tutorial Practical Presentation

Simulation/ Presentation
Lecture delivery Project identification Laboratory Work/ (Progress and Final
Workshops Presentations)
Group discussion Project Analysis Data Collection Evaluation
Question answer
Project Milestone Reviews,
Sessions/ Analytical thinking and
Testing Feedback,
Brainstorming self-learning
Project reformation (If required)
Sessions
Poster Presentation/
Guest Speakers
Case Study/ Field Video Presentation: Students
(Industry Prototyping
Survey Report present their results in a 2 to 5
Experts)
minutes video
 Assessment and Evaluation for Project Activity

Allotted
Sl. No Evaluation for
Marks

1 Project Planning and Proposal 5

2 Contribution in Progress Presentations and Question Answer 4

Sessions

3 Involvement in the project work and Team Work 3

4 Execution and Implementation 10

5 Final Presentations 5

6 Project Quality, Innovation and Creativity 3

Total 30

1. Project Planning and Proposal (5 Marks)

 Clarity and feasibility of the project plan

 Research and background understanding
 Defined objectives and methodology

2. Contribution in Progress Presentation and Question Answer Sessions (4 Marks)

 Individual contribution to the presentation

 Effectiveness in answering questions and handling feedback

3. Involvement in the Project Work and Team Work (3 Marks)

 Active participation and individual contribution
 Teamwork and collaboration

4. Execution and Implementation (10 Marks)

 Adherence to the project timeline and milestones
 Application of theoretical knowledge and problem-solving
 Final Result
5. Final Presentation (5 Marks)
 Quality and clarity of the overall presentation
 Individual contribution to the presentation
 Effectiveness in answering questions

6. Project Quality, Innovation, and Creativity (3 Marks)

 Overall quality and technical excellence of the project
 Innovation and originality in the project
 Creativity in solutions and approaches
 SEMESTER S3

INTRODUCTION TO ARTIFICIAL INTELLIGENCE AND DATA

SCIENCE

Course Code GNEST305 CIE Marks 40

Teaching Hours/Week (L:

3:1:0:0 ESE Marks 60
T:P: R)

Credits 4 Exam Hours 2 Hrs. 30 Min.

Prerequisites (if any) None Course Type Theory

Course Objectives:

1. Demonstrate a solid understanding of advanced linear algebra concepts, machine learning

algorithms and statistical analysis techniques relevant to engineering applications, principles
and algorithms.
2. Apply theoretical concepts to solve practical engineering problems, analyze data to extract
meaningful insights, and implement appropriate mathematical and computational techniques
for AI and data science applications.

SYLLABUS
Module Contact
Syllabus Description
No. Hours

Introduction to AI and Machine Learning: Basics of Machine Learning -

types of Machine Learning systems-challenges in ML- Supervised learning
model example- regression models- Classification model example- Logistic
1 regression-unsupervised model example- K-means clustering. Artificial 11
Neural Network- Perceptron- Universal Approximation Theorem (statement
only)- Multi-Layer Perceptron- Deep Neural Network- demonstration of
regression and classification problems using MLP.(Text-2)

Mathematical Foundations of AI and Data science: Role of linear algebra

in Data representation and analysis – Matrix decomposition- Singular Value
2 11
Decomposition (SVD)- Spectral decomposition- Dimensionality reduction
technique-Principal Component Analysis (PCA). (Text-1)
 Applied Probability and Statistics for AI and Data Science: Basics of
probability-random variables and statistical measures - rules in probability-
Bayes theorem and its applications- statistical estimation-Maximum
3 11
Likelihood Estimator (MLE) - statistical summaries- Correlation analysis-
linear correlation (direct problems only)- regression analysis- linear
regression (using least square method) (Text book 4 )

Basics of Data Science: Benefits of data science-use of statistics and

Machine Learning in Data Science- data science process - applications of
Machine Learning in Data Science- modelling process- demonstration of
4 ML applications in data science- Big Data and Data Science. (For 11
visualization the software tools like Tableau, PowerBI, R or Python can be
used. For Machine Learning implementation, Python, MATLAB or R can
be used.)(Text book-5)

Course Assessment Method

(CIE: 40 marks , ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

Internal Internal Examination-

Assignment/
Attendance Examination-1 2 Total
Microproject
(Written) (Written )

5 15 10 10 40

End Semester Examination Marks (ESE)

In Part A, all questions need to be answered and in Part B, each student can choose any one
full question out of two questions

Part A Part B Total

● 2 Questions from each ● Each question carries 9 marks.
module. ● Two questions will be given from each module, out of
● Total of 8 Questions, each which 1 question should be answered.
60
carrying 3 marks ● Each question can have a maximum of 3 sub
divisions.
(8x3 =24marks) (4x9 = 36 marks)
 Course Outcomes (COs)

At the end of the course students should be able to:

Bloom’s
Course Outcome Knowledge
Level (KL)

Apply the concept of machine learning algorithms including neural

CO1 networks and supervised/unsupervised learning techniques for K3
engineering applications.
Apply advanced mathematical concepts such as matrix operations,
CO2 singular values, and principal component analysis to analyze and solve K3
engineering problems.
Analyze and interpret data using statistical methods including descriptive
CO3 statistics, correlation, and regression analysis to derive meaningful K3
insights and make informed decisions.
Integrate statistical approaches and machine learning techniques to ensure
CO4 K3
practically feasible solutions in engineering contexts.
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create

CO-PO Mapping Table:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
3 3 3 3
CO1
3 3 3 3
CO2
3 3 3 3
CO3
3 3 3 3
CO4
3 3 3 3
CO5
 Text Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Wellesley-Cambridge 6th edition,
1 Introduction to Linear Algebra Gilbert Strang
Press 2023

Hands-on machine learning 2nd

2 with Scikit-Learn, Keras, and Aurélien Géron O'Reilly Media, Inc. edition,202
TensorFlow 2

Deisenroth, Marc Peter,

Mathematics for machine Cambridge University 1st edition.
3 A. Aldo Faisal, and
learning Press 2020
Cheng Soon Ong

Fundamentals of mathematical Gupta, S. C., and V. K. 9th edition,

4 Sultan Chand & Sons
statistics Kapoor 2020

Introducing data science: big

Cielen, Davy, and Arno 1st edition,
5 data, machine learning, and Simon and Schuster
Meysman 2016
more, using Python tools
 Reference Books
Edition
Title of the
Sl. No Name of the Author/s Name of the Publisher and
Book
Year
Data science: 2nd
Kotu, Vijay, and Bala
1 concepts and Morgan Kaufmann edition,
Deshpande
practice 2018

Probability and
1st edition,
2 Statistics for Carlos Fernandez-Granda Center for Data Science in NYU
2017
Data Science

Foundations of Avrim Blum, John Hopcroft, 1st edition,

3 Cambridge University Press
Data Science and Ravi Kannan 2020

1st
Statistics For
4 James D. Miller Packt Publishing edition,
Data Science
2019

Probability and
Statistics -The Michael J. Evans and Jeffrey S. 1st edition,
5 Science of
University of Toronto
Rosenthal 2009
Uncertainty

An Introduction
chrome-
to the Science of
extension://efaidnbmnnnibpcajpcg Preliminar
6 Statistics: From Joseph C. Watkins
lclefindmkaj/https://www.math.ari y Edition.
Theory to
zo
Implementation

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
1 https://archive.nptel.ac.in/courses/106/106/106106198/

https://archive.nptel.ac.in/courses/106/106/106106198/
2 https://ocw.mit.edu/courses/18-06-linear-algebra-spring-2010/resources/lecture-29-singular-
value-decomposition/
https://ocw.mit.edu/courses/18-650-statistics-for-applications-fall-2016/resources/lecture-19-
3
video/

4 https://archive.nptel.ac.in/courses/106/106/106106198/
 SEMESTER S3/S4

ECONOMICS FOR ENGINEERS

Course Code UCHUT346 CIE Marks 50

Teaching Hours/Week (L:

2:0:0:0 ESE Marks 50
T:P: R)

Credits 2 Exam Hours 2 Hrs. 30 Min.

Prerequisites (if any) None Course Type Theory

Course Objectives:

1. Understanding of finance and costing for engineering operation, budgetary planning

and control
2. Provide fundamental concept of micro and macroeconomics related to engineering
industry
3. Deliver the basic concepts of Value Engineering.

SYLLABUS
Module Contact
Syllabus Description
No. Hours

Basic Economics Concepts - Basic economic problems – Production

Possibility Curve – Utility – Law of diminishing marginal utility – Law of
Demand - Law of supply – Elasticity - measurement of elasticity and its
1 6
applications – Equilibrium- Changes in demand and supply and its effects

Production function - Law of variable proportion – Economies of Scale –

Internal and External Economies – Cobb-Douglas Production Function

Cost concepts – Social cost, private cost – Explicit and implicit cost – Sunk
cost - Opportunity cost - short run cost curves - Revenue concepts
2 Firms and their objectives – Types of firms – Markets - Perfect Competition 6
– Monopoly - Monopolistic Competition - Oligopoly (features and
equilibrium of a firm)
 Monetary System – Money – Functions - Central Banking –Inflation -
Causes and Effects – Measures to Control Inflation - Monetary and Fiscal
policies – Deflation

Taxation – Direct and Indirect taxes (merits and demerits) - GST

3 6
National income – Concepts - Circular Flow – Methods of Estimation and
Difficulties - Stock Market – Functions- Problems faced by the Indian stock
market-Demat Account and Trading Account – Stock market Indicators-
SENSEX and NIFTY

Value Analysis and value Engineering - Cost Value, Exchange Value, Use
Value, Esteem Value - Aims, Advantages and Application areas of Value
4 6
Engineering - Value Engineering Procedure - Break-even Analysis - Cost-
Benefit Analysis - Capital Budgeting - Process planning

Course Assessment Method

(CIE: 40 marks , ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

Assignment/ Internal Internal

Attendance Case Study/ Examination-1 Examination- 2 Total
Microproject (Written) (Written )

5 15 10 10 40

End Semester Examination Marks (ESE)

In Part A, all questions need to be answered and in Part B, each student can choose any one
full question out of two questions

Part A Part B Total

● 2 Questions from each ● Each question carries 9 marks.
module. ● Two questions will be given from each module, out
● Total of 8 Questions, each of which 1 question should be answered.
60
carrying 3 marks ● Each question can have a maximum of 3 sub
divisions.
(8x3 =24marks) (4x9 = 36 marks)
 Course Outcomes (COs)

At the end of the course students should be able to:

Bloom’s
Course Outcome Knowledge
Level (KL)

Understand the fundamentals of various economic issues using laws K2

CO1 and learn the concepts of demand, supply, elasticity and production
function.
Develop decision making capability by applying concepts relating to K3

CO2 costs and revenue, and acquire knowledge regarding the functioning of
firms in different market situations.
Outline the macroeconomic principles of monetary and fiscal systems, K2
CO3
national income and stock market.
Make use of the possibilities of value analysis and engineering, and K3

CO4 solve simple business problems using break even analysis, cost benefit
analysis and capital budgeting techniques.
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create

CO-PO Mapping Table:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 - - - - - 1 - - - - 1 -

CO2 - - - - - 1 1 - - - 1 -

CO3 - - - - 1 - - - - - 2 -

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

Text Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Geetika, Piyali Ghosh
1 Managerial Economics Tata McGraw Hill, 2015
and Chodhury

H. G. Thuesen, W. J.
2 Engineering Economy PHI 1966
Fabrycky

3 Engineering Economics R. Paneerselvam PHI 2012

 Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Leland Blank P.E,
1 Engineering Economy Mc Graw Hill 7TH Edition
Anthony Tarquin P. E.

2 Indian Financial System Khan M. Y. Tata McGraw Hill 2011

Engineering Economics and Donald G. Newman,

3 Engg. Press, Texas 2002
analysis Jerome P. Lavelle

Contemporary Engineering Prentice Hall of India

4 Chan S. Park 2001
Economics Ltd
 SEMESTER S3/S4
ENGINEERING ETHICS AND SUSTAINABLE DEVELOPMENT

Course Code UCHUT347 CIE Marks 50

2:0:0:0
Teaching Hours/Week
ESE Marks 50
(L: T:P: R)
2
Credits Exam Hours 2 Hrs. 30 Min.
None
Prerequisites (if any) Course Type Theory

Course Objectives:

1. Equip with the knowledge and skills to make ethical decisions and implement gender-
sensitive practices in their professional lives.
2. Develop a holistic and comprehensive interdisciplinary approach to understanding
engineering ethics principles from a perspective of environment protection and
sustainable development.
3. Develop the ability to find strategies for implementing sustainable engineering
solutions.
SYLLABUS
Module Contact
Syllabus Description
No. Hours
Fundamentals of ethics - Personal vs. professional ethics, Civic
Virtue, Respect for others, Profession and Professionalism,
Ingenuity, diligence and responsibility, Integrity in design,
development, and research domains, Plagiarism, a balanced outlook
on law - challenges - case studies, Technology and digital
revolution-Data, information, and knowledge, Cybertrust and
cybersecurity, Data collection & management, High technologies:
1 6
connecting people and places-accessibility and social impacts,
Managing conflict, Collective bargaining, Confidentiality, Role of
confidentiality in moral integrity, Codes of Ethics.
Basic concepts in Gender Studies - sex, gender, sexuality, gender
spectrum: beyond the binary, gender identity, gender expression,
gender stereotypes, Gender disparity and discrimination in
education, employment and everyday life, History of women in
 Science & Technology, Gendered technologies & innovations, Ethical
values and practices in connection with gender - equity, diversity &
gender justice, Gender policy and women/transgender
empowerment initiatives.
Introduction to Environmental Ethics: Definition, importance and
historical development of environmental ethics, key philosophical
theories (anthropocentrism, biocentrism, ecocentrism). Sustainable
Engineering Principles: Definition and scope, triple bottom line
(economic, social and environmental sustainability), life cycle analysis
and sustainability metrics. Ecosystems and Biodiversity: Basics of
2 6
ecosystems and their functions, Importance of biodiversity and its
conservation, Human impact on ecosystems and biodiversity loss, An
overview of various ecosystems in Kerala/India, and its significance.
Landscape and Urban Ecology: Principles of landscape ecology,
Urbanization and its environmental impact, Sustainable urban
planning and green infrastructure.
Hydrology and Water Management: Basics of hydrology and water
cycle, Water scarcity and pollution issues, Sustainable water
management practices, Environmental flow, disruptions and disasters.
Zero Waste Concepts and Practices: Definition of zero waste and its
principles, Strategies for waste reduction, reuse, reduce and recycling,
Case studies of successful zero waste initiatives. Circular Economy
and Degrowth: Introduction to the circular economy model,

3 Differences between linear and circular economies, degrowth 6

principles, Strategies for implementing circular economy practices and
degrowth principles in engineering. Mobility and Sustainable
Transportation: Impacts of transportation on the environment and
climate, Basic tenets of a Sustainable Transportation design,
Sustainable urban mobility solutions, Integrated mobility systems, E-
Mobility, Existing and upcoming models of sustainable mobility
solutions.
Renewable Energy and Sustainable Technologies: Overview of
4 6
renewable energy sources (solar, wind, hydro, biomass), Sustainable
 technologies in energy production and consumption, Challenges and
opportunities in renewable energy adoption. Climate Change and
Engineering Solutions: Basics of climate change science, Impact of
climate change on natural and human systems, Kerala/India and the
Climate crisis, Engineering solutions to mitigate, adapt and build
resilience to climate change. Environmental Policies and
Regulations: Overview of key environmental policies and regulations
(national and international), Role of engineers in policy
implementation and compliance, Ethical considerations in
environmental policy-making. Case Studies and Future Directions:
Analysis of real-world case studies, Emerging trends and future
directions in environmental ethics and sustainability, Discussion on
the role of engineers in promoting a sustainable future.

Course Assessment Method

(CIE: 50 marks , ESE: 50)

Continuous Internal Evaluation Marks (CIE):

Continuous internal evaluation will be based on individual and group activities undertaken
throughout the course and the portfolio created documenting their work and learning. The
portfolio will include reflections, project reports, case studies, and all other relevant
materials.
● The students should be grouped into groups of size 4 to 6 at the beginning of the
semester. These groups can be the same ones they have formed in the previous
semester.
● Activities are to be distributed between 2 class hours and 3 Self-study hours.
● The portfolio and reflective journal should be carried forward and displayed during
the 7th Semester Seminar course as a part of the experience sharing regarding the
skills developed through various courses.
Sl. Item Particulars Group Mark
No. /Indivi s
dual
(G/I)
1 Reflective Weekly entries reflecting on what was learned, I 5
Journal personal insights, and how it can be applied to local
contexts.
2 Micro project 1 a) Perform an Engineering Ethics Case Study G 8
analysis and prepare a report
(Detailed 1 b) Conduct a literature survey on ‘Code of Ethics
documentatio for Engineers’ and prepare a sample code of
n of the ethics
project, 2. Listen to a TED talk on a Gender-related topic, do G 5
including a literature survey on that topic and make a report
methodologie citing the relevant papers with a specific analysis
s, findings, of the Kerala context
and 3. Undertake a project study based on the concepts G 12
reflections) of sustainable development* - Module II, Module
III & Module IV
3 Activities 2. One activity* each from Module II, Module III & G 15
Module IV
4 Final A comprehensive presentation summarising the key G 5
Presentation takeaways from the course, personal reflections, and
proposed future actions based on the learnings.
Total Marks 50

*Can be taken from the given sample activities/projects

Evaluation Criteria:
● Depth of Analysis: Quality and depth of reflections and analysis in project reports
and case studies.
● Application of Concepts: Ability to apply course concepts to real-world
problems and local contexts.
● Creativity: Innovative approaches and creative solutions proposed in projects and
reflections.
● Presentation Skills: Clarity, coherence, and professionalism in the final
presentation.
 Course Outcomes (COs)

At the end of the course students should be able to:

Bloom’s
Course Outcome Knowledge
Level (KL)
Develop the ability to apply the principles of engineering ethics K3
CO1
in their professional life.
Develop the ability to exercise gender-sensitive practices in their K4
CO2
professional lives
Develop the ability to explore contemporary environmental K5
CO3
issues and sustainable practices.
Develop the ability to analyse the role of engineers in promoting K4
CO4
sustainability and climate resilience.
Develop interest and skills in addressing pertinent environmental K3
CO5 and climate-related challenges through a sustainable engineering
approach.
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create

CO-PO Mapping Table:

PO1 PO1 PO1

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9
0 1 2
CO1 3 2 3 3 2 2
CO2 1 3 2 3 3 2 2
CO3 3 3 2 3 2 2
CO4 1 3 3 2 3 2 2
CO5 3 3 2 3 2 2
 Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
2nd
Cambridge
Ethics in Engineering edition &
1 Caroline Whitbeck University Press &
Practice and Research August
Assessment
2011
Cambridge
Virtue Ethics and Professional November
2 Roles
Justin Oakley University Press &
2006
Assessment
2nd
Cambridge
edition &
3 Sustainability Science Bert J. M. de Vries University Press &
December
Assessment
2023
Cambridge
Sustainable Engineering
4 Bhavik R. Bakshi, University Press & 2019
Principles and Practice
Assessmen
M Govindarajan, S PHI Learning
5 Engineering Ethics Natarajan and V S Private Ltd, New 2012
Senthil Kumar Delhi
New age
Professional ethics and human
6 RS Naagarazan international (P) 2006.
values
limited New Delhi
Tata McGraw Hill
Mike W Martin and 4" edition,
7 Ethics in Engineering Publishing Company
Roland Schinzinger, 2014
Pvt Ltd, New Delhi

Suggested Activities/Projects:
Module-II
● Write a reflection on a local environmental issue (e.g., plastic waste in Kerala backwaters or
oceans) from different ethical perspectives (anthropocentric, biocentric, ecocentric).
● Write a life cycle analysis report of a common product used in Kerala (e.g., a coconut,
bamboo or rubber-based product) and present findings on its sustainability.
● Create a sustainability report for a local business, assessing its environmental, social, and
economic impacts
● Presentation on biodiversity in a nearby area (e.g., a local park, a wetland, mangroves,
college campus etc) and propose conservation strategies to protect it.
● Develop a conservation plan for an endangered species found in Kerala.
● Analyze the green spaces in a local urban area and propose a plan to enhance urban ecology
using native plants and sustainable design.
● Create a model of a sustainable urban landscape for a chosen locality in Kerala.
 Module-III
● Study a local water body (e.g., a river or lake) for signs of pollution or natural flow disruption
and suggest sustainable management and restoration practices.
● Analyse the effectiveness of water management in the college campus and propose
improvements - calculate the water footprint, how to reduce the footprint, how to increase
supply through rainwater harvesting, and how to decrease the supply-demand ratio
● Implement a zero waste initiative on the college campus for one week and document the
challenges and outcomes.
● Develop a waste audit report for the campus. Suggest a plan for a zero-waste approach.
● Create a circular economy model for a common product used in Kerala (e.g., coconut oil,
cloth etc).
● Design a product or service based on circular economy and degrowth principles and present a
business plan.
● Develop a plan to improve pedestrian and cycling infrastructure in a chosen locality in Kerala
Module-IV
● Evaluate the potential for installing solar panels on the college campus including cost-benefit
analysis and feasibility study.
● Analyse the energy consumption patterns of the college campus and propose sustainable
alternatives to reduce consumption - What gadgets are being used? How can we reduce
demand using energy-saving gadgets?
● Analyse a local infrastructure project for its climate resilience and suggest improvements.
● Analyse a specific environmental regulation in India (e.g., Coastal Regulation Zone) and its
impact on local communities and ecosystems.
● Research and present a case study of a successful sustainable engineering project in
Kerala/India (e.g., sustainable building design, water management project, infrastructure
project).
● Research and present a case study of an unsustainable engineering project in Kerala/India
highlighting design and implementation faults and possible corrections/alternatives (e.g., a
housing complex with water logging, a water management project causing frequent floods,
infrastructure project that affects surrounding landscapes or ecosystems).
 SEMESTER S3
DATA STRUCTURES LAB
Course Code PCERL307 CIE Marks 50
Teaching Hours/Week
0:0:3:0 ESE Marks 50
(L: T:P: R)
Credits 2 Exam Hours 2 Hrs. 30 Min.
GBEST204: Programming in
Prerequisites (if any) Course Type Lab
C

Course Objectives:
1. To implement various linear data structures and applications using them
2. To implement various non-linear data structures and applications using them
3. To implement algorithms for various sorting techniques

Details of Experiment
Expt. No Experiment
1 Implementation of linear search and binary search *
2 Implementation of Stack and linear Queue using arrays *
3 Implementation of Priority Queues, DEQUEUE and Circular Queues using arrays *
4 Conversion of expression from one notation to another notation *
5 Implementation of various operations on singly linked list *
6 Implementation of stack and queue using linked list *
7 Polynomial addition using linked list *
8 Polynomial multiplication using linked list.
9 Implementation of binary search tree – creation, insertion, deletion, search *
10 Implementation of tree traversals – inorder, preorder, postorder
11 Implementation of sorting algorithms bubble sort, insertion sort and selection sort *
12 Implementation of Merge sort *
13 Implementation of Quick sort *
14 Implementation of BFS and DFS on graph *
*Mandatory programs
 Course Assessment Method (CIE: 50 Marks, ESE 50 Marks)
Continuous Internal Evaluation Marks (CIE):
Preparation/Pre-Lab Work, experiments, Viva and
Internal
Attendance Timely completion of Lab Reports / Record. (Continuous Total
Exam
Assessment)

5 25 20 50

End Semester Examination Marks (ESE):

Procedure/ Result with
Conduct of experiment/
Preparatory valid inference/ Viva
Execution of work/ Record Total
work/Design/ Quality of voce
troubleshooting/ Programming
Algorithm Output
10 15 10 10 5 50

Mandatory requirements for ESE:

 Submission of Record: Students shall be allowed for the end semester examination only upon
submitting the duly certified record.
 Endorsement by External Examiner: The external examiner shall endorse the record.

Course Outcomes (COs)

At the end of the course the student will be able to:
Bloom’s
Course Outcome Knowledge
Level (KL)
Implement and analyze various searching and sorting algorithms, evaluating
CO1 K3
their efficiency and applicability in different scenarios.
Efficiently implement array-based data structures and perform expression
CO2 notation conversions, demonstrating proficiency in algorithmic design and data K3
structure utilization.
Effectively utilize linked lists for implementing various operations such as
CO3 stacks, queues, and polynomial manipulations, demonstrating practical skills in K3
data structure application and algorithmic problem-solving.
Master the implementation of binary search trees, tree traversals, and graph
CO4 traversal algorithms, demonstrating proficiency in fundamental data structure K3
operations and algorithmic techniques.
K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create
 CO-PO Mapping Table

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 3 3 1 2 2 3 3
CO2 3 3 3 1 2 2 3 3
CO3 3 3 3 1 2 2 3 3
CO4 3 3 3 1 2 2 3 3
1: Slight (Low),2: Moderate (Medium),3: Substantial (High), : No Correlation

Text Books

Name of the Edition

Sl. No Title of the Book Name of the Author/s
Publisher and Year
Ellis Horowitz,Sartaj
Fundamentals of Data
1 Sahni and Susan Universities Press 2e, 2008
Structures in C
Anderson-Freed

2 Classic Data Structures Samanta D Prentice Hall India 2/e, 2009

Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Data Structures: A Pseudocode Richard F. Gilberg,
1 Cengage Learning 2/e, 2005
Approach with C Behrouz A. Forouzan
Aho A. V., J. E. Hopcroft
2 Data Structures and Algorithms Pearson Publication 1983
and J. D. Ullman
Introduction to Data Structures Tremblay J. P. and P. G.
3 Tata McGraw Hill 1995
with Applications Sorenson
Cambridge University
4 Advanced Data Structures Peter Brass 2008
Press

Video Links (NPTEL, SWAYAM…)

Sl. No. Link ID

1 https://nptel.ac.in/courses/106102064
 Continuous Assessment (25 Marks)
1. Preparation and Pre-Lab Work (7 Marks)

 Pre-Lab Assignments: Assessment of pre-lab assignments or quizzes that test understanding of

the upcoming experiment.

 Understanding of Theory: Evaluation based on students’ preparation and understanding of the

theoretical background related to the experiments.

2. Conduct of Experiments (7 Marks)

 Procedure and Execution: Adherence to correct procedures, accurate execution of experiments,

and following safety protocols.

 Skill Proficiency: Proficiency in handling equipment, accuracy in observations, and

troubleshooting skills during the experiments.

 Teamwork: Collaboration and participation in group experiments.

3. Lab Reports and Record Keeping (6 Marks)

 Quality of Reports: Clarity, completeness and accuracy of lab reports. Proper documentation of
experiments, data analysis and conclusions.

 Timely Submission: Adhering to deadlines for submitting lab reports/rough record and
maintaining a well-organized fair record.

4. Viva Voce (5 Marks)

 Oral Examination: Ability to explain the experiment, results and underlying principles during a
viva voce session.

Final Marks Averaging: The final marks for preparation, conduct of experiments, viva, and
record are the average of all the specified experiments in the syllabus.

Evaluation Pattern for End Semester Examination (50 Marks)

1. Procedure/Preliminary Work/Design/Algorithm (10 Marks)

 Procedure Understanding and Description: Clarity in explaining the procedure and understanding
each step involved.

 Preliminary Work and Planning: Thoroughness in planning and organizing materials/equipment.

  Algorithm Development: Correctness and efficiency of the algorithm related to the experiment.

 Creativity and logic in algorithm or experimental design.

2. Conduct of Experiment/Execution of Work/Programming (15 Marks)

 Setup and Execution: Proper setup and accurate execution of the experiment or programming
task.

3. Result with Valid Inference/Quality of Output (10 Marks)

 Accuracy of Results: Precision and correctness of the obtained results.

 Analysis and Interpretation: Validity of inferences drawn from the experiment or quality of
program output.

4. Viva Voce (10 Marks)

 Ability to explain the experiment, procedure results and answer related questions
 Proficiency in answering questions related to theoretical and practical aspects of the subject.

5. Record (5 Marks)

 Completeness, clarity, and accuracy of the lab record submitted

 SEMESTER S3
DIGITAL SYSTEM DESIGN LAB
Course Code PCERL 308 CIE Marks 50
Teaching
Hours/Week (L: T:P: 0:0:3:0 ESE Marks 50
R)
Credits 2 Exam Hours 2 Hrs. 30 Min.
None
Prerequisites (if any) Course Type Lab

Course Objectives:
1. Familiarize with the implementation of Logic Circuits using basiclogic gates ICs.
2. Familiarize with the Verilog HDL based Digital Design Flow.

Details of Experiment
Expt. No Experiment
1 Familiarization of logic gates
2
Realization of functions using basic and universal gates (SOP and POS forms).
3
Half adder and full adder using NAND
4 Realization of 8:1 MUX and 1:8 DEMUX
5 Flip-flop circuits (SR, JK,T,D &Master slave)
6 Asynchronous up/down counter
7 Familiarization of FPGA devices and Verilog HDL
8 Implementation of basic gates using Verilog & simulate the result using test bench
9 Implementation of half adder & full adder using Verilog & simulate the result using test
bench
10 Implementation of MUX & DEMUX using Verilog & simulate the result using test bench
11 Implementation of encoder & decoder using Verilog & simulate the result using test bench
12 Implementation of flip-flops using Verilog & simulate the result using test bench
 Course Assessment Method (CIE: 50 Marks, ESE 50 Marks)
Continuous Internal Evaluation Marks (CIE):

Preparation/Pre-Lab Work, experiments, Viva and

Internal
Attendance Timely completion of Lab Reports / Record. (Continuous Total
Exam
Assessment)

5 25 20 50

End Semester Examination Marks (ESE):

Procedure/ Result with

Conduct of experiment/
Preparatory valid inference/ Viva
Execution of work/ Record Total
work/Design/ Quality of voce
troubleshooting/ Programming
Algorithm Output

10 15 10 10 5 50

Mandatory requirements for ESE:

 Submission of Record: Students shall be allowed for the end semester examination only upon
submitting the duly certified record.

 Endorsement by External Examiner: The external examiner shall endorse the record.

Course Outcomes (COs)

At the end of the course the student will be able to:
Bloom’s
Course Outcome Knowledge
Level (KL)
CO1 Realize digital circuits with Logic Gates and Hardware Description Language Apply (K3)

CO2 Design and implement combinational logic circuits. Apply (K3)

CO3 Design and implement sequential logic circuits. Apply (K3)

K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create
 CO-PO Mapping Table
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12

CO1 3 2 2 1 2 2

CO2 3 2 2 2 2 2

CO3 3 2 2 2 2 2

1: Slight (Low),2: Moderate (Medium),3: Substantial (High), : No Correlation

Text Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
2nd
Verilog HDL: A Guide to
1 Samir Palnitkar Pearson Edition,
Digital Design and Synthesis
2003
2 A Verilog HDL Primer Bhasker J BS Publication
4th
3 Modern digital Electronics R.P. Jain Tata McGraw Hill edition,
2009
2nd
Fundamentals of Digital
4 A. Ananthakumar Prentice Hall edition,
Circuits
2016

Continuous Assessment (25 Marks)

5. Preparation and Pre-Lab Work (7 Marks)

 Pre-Lab Assignments: Assessment of pre-lab assignments or quizzes that test understanding of

the upcoming experiment.

 Understanding of Theory: Evaluation based on students’ preparation and understanding of the

theoretical background related to the experiments.

6. Conduct of Experiments (7 Marks)

 Procedure and Execution: Adherence to correct procedures, accurate execution of experiments,

and following safety protocols.
  Skill Proficiency: Proficiency in handling equipment, accuracy in observations, and
troubleshooting skills during the experiments.

 Teamwork: Collaboration and participation in group experiments.

7. Lab Reports and Record Keeping (6 Marks)

 Quality of Reports: Clarity, completeness and accuracy of lab reports. Proper documentation of
experiments, data analysis and conclusions.

 Timely Submission: Adhering to deadlines for submitting lab reports/rough record and
maintaining a well-organized fair record.

8. Viva Voce (5 Marks)

 Oral Examination: Ability to explain the experiment, results and underlying principles during a
viva voce session.

Final Marks Averaging: The final marks for preparation, conduct of experiments, viva, and
record are the average of all the specified experiments in the syllabus.

Evaluation Pattern for End Semester Examination (50 Marks)

6. Procedure/Preliminary Work/Design/Algorithm (10 Marks)

 Procedure Understanding and Description: Clarity in explaining the procedure and understanding
each step involved.

 Preliminary Work and Planning: Thoroughness in planning and organizing materials/equipment.

 Algorithm Development: Correctness and efficiency of the algorithm related to the experiment.

 Creativity and logic in algorithm or experimental design.

7. Conduct of Experiment/Execution of Work/Programming (15 Marks)

 Setup and Execution: Proper setup and accurate execution of the experiment or programming
task.

8. Result with Valid Inference/Quality of Output (10 Marks)

 Accuracy of Results: Precision and correctness of the obtained results.

 Analysis and Interpretation: Validity of inferences drawn from the experiment or quality of
program output.
9. Viva Voce (10 Marks)

 Ability to explain the experiment, procedure results and answer related questions
 Proficiency in answering questions related to theoretical and practical aspects of the subject.

10. Record (5 Marks)

 Completeness, clarity, and accuracy of the lab record submitted

 SEMESTER 4
ELECTRONICS AND COMPUTER
ENGINEERING
 SEMESTER S4

MATHEMATICS FOR ELECTRICAL SCIENCE – 4

(B Group)

Course Code GBMAT401 CIE Marks 40

Teaching Hours/Week
3:0:0:0 ESE Marks 60
(L: T:P: R)

Credits 3 Exam Hours 2Hrs. 30 Min.

Prerequisites (if any) Basic calculus Course Type Theory

Course Objectives:

1. To familiarize students with the foundations of probabilistic and statistical analysis mostly
used in varied applications in engineering and science.
2. To expose the students to the basics of random processes essential for their subsequent study
of analog and digital communication

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Random variables, Discrete random variables and their probability
distributions, Cumulative distribution function, Expectation, Mean and
variance, Binomial distribution, Poisson distribution, Poisson distribution as

1 a limit of the binomial distribution, Joint pmf of two discrete random 9

variables, Marginal pmf, Independent random variables, Expected value of a
function of two discrete variables.
[Text 1: Relevant topics from sections 3.1 to 3.4, 3.6, 5.1, 5.2]
Continuous random variables and their probability distributions, Cumulative
distribution function, Expectation, Mean and variance, Uniform, Normal and
Exponential distributions, Joint pdf of two Continuous random variables,
2 9
Marginal pdf, Independent random variables, Expectation value of a function
of two continuous variables.
[Text 1: Relevant topics from sections 3.1, 4.1, 4.2, 4.3, 4.4, 5.1, 5.2]
 Confidence Intervals, Confidence Level, Confidence Intervals and One-side
confidence intervals for a Population Mean for large and small samples
(normal distribution and t-distribution), Hypotheses and Test Procedures,
Type I and Type II error, z Tests for Hypotheses about a Population Mean
3 9
(for large sample), t Test for Hypotheses about a Population Mean (for small
sample), Tests concerning a population proportion for large and small
samples.
[Text 1: Relevant topics from 7.1, 7.2, 7.3, 8.1, 8.2, 8.3, 8.4]
Random process concept, classification of process, Methods of Description
of Random process, Special classes, Average Values of Random Process,
Stationarity- SSS, WSS, Autocorrelation functions and its properties,
4 9
Ergodicity, Mean-Ergodic Process, Mean-Ergodic Theorem, Correlation
Ergodic Process, Distribution Ergodic Process.
[Text 2: Relevant topics from Chapter 6]
Course Assessment Method
(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

Internal Internal
Assignment/
Attendance Examination-1 Examination- 2 Total
Microproject
(Written) (Written )

5 15 10 10 40

End Semester Examination Marks (ESE)

In Part A, all questions need to be answered and in Part B, each student can choose any one full
question out of two questions

Part A Part B Total

● 2 Questions from each ● Each question carries 9 marks.
module. ● Two questions will be given from each module, out
● Total of 8 Questions, each of which 1 question should be answered.
60
carrying 3 marks ● Each question can have a maximum of 3 sub
divisions.
(8x3 =24marks) (4x9 = 36 marks)
 Course Outcomes (COs)

At the end of the course students should be able to:

Bloom’s
Course Outcome Knowledge
Level (KL)
Understand the concept, properties and important models of discrete
CO1 K3
random variables and to apply in suitable random phenomena.
Understand the concept, properties and important models of continuous
CO2 K3
random variables and to apply in suitable random phenomena.
Estimate population parameters, assess their certainty with confidence
CO3 intervals, and test hypotheses about population means and proportions K3
using z-tests and the one-sample t-test.
Analyze random processes by classifying them, describing their
properties, utilizing autocorrelation functions, and understanding their
CO4 K3
applications in areas like signal processing and communication
systems.
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create

CO-PO Mapping Table:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 3 2 2 - - - - - - - 2
CO2 3 3 2 2 - - - - - - - 2
CO3 3 3 2 2 - - - - - - - 2
CO4 3 3 2 2 - - - - - - - 2

Text Books
Name of the Edition and
Sl. No Title of the Book Name of the Author/s
Publisher Year
9th edition,
Probability and Statistics for
1 Devore J. L Cengage Learning 2016
Engineering and the Sciences

Probability, Statistics and The McGraw-Hill 3rd edition,

2 T Veerarajan
Random Processes 2008
 Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Probability, Random Variables Papoulis, A. & Pillai, 4th edition,
1 McGraw Hill.
and Stochastic Processes, S.U., 2002
Introduction to Probability and
6th edition,
2 Statistics for Engineers and Ross, S. M. Academic Press
2020
Scientists
Probability and Random PHI Learning Private 3rd edition,
3 Palaniammal, S.
Processes Limited 2015
David F. Anderson, 1st edition,
4 Introduction to Probability Cambridge
Timo, Benedek 2017

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
1 https://archive.nptel.ac.in/courses/117/105/117105085/

2 https://archive.nptel.ac.in/courses/117/105/117105085/

3 https://archive.nptel.ac.in/courses/117/105/117105085/
 SEMESTER S4

COMPUTER ORGANIZATION AND ARCHITECTURE

Course Code PCERT 402 CIE Marks 40

Teaching Hours/Week
3:1:0:0 ESE Marks 60
(L: T:P: R)

Credits 4 Exam Hours 2 Hrs. 30 Min.

PCERT 205 Digital
Prerequisites (if any) Course Type Theory
Electronics

Course Objectives:

1. Discuss the basic concepts and structure of computers.

2. Describe the various addressing modes and memory structure kinds.
3. Define interrupts and their role in managing I/O operations and system events.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Basic Structure of computers –functional units - basic operational concepts
- bus structures. Memory locations and addresses - memory operations,
Instructions and instruction sequencing, addressing modes.
1 10
Basic processing unit – fundamental concepts – instruction cycle –
execution of a complete instruction - single bus and multiple bus
organization.
Register transfer logic: Inter register transfer – arithmetic, logic and shift
micro-operations.
Processor logic design: - processor organization – Arithmetic logic unit -
2 11
design of arithmetic circuit - design of logic circuit – Design of arithmetic
logic unit - status register – design of shifter - processor unit – design of
accumulator (Basic Concept Only).
Control Logic Design: Hardwired control-microprogrammed control-

3 Microinstructions, Microprogram Sequencing. 12

Arithmetic algorithms: Signed-Operand multiplication, Booth Algorithm,
 fast multiplication-bit pair recoding of multipliers.
Pipelining: Basic principles, classification of pipeline processors, instruction
and arithmetic pipelines (Design examples not required), hazard detection
and resolution.
Memory system: Types of memory (Concepts only), Virtual memory,
Content addressable memory, cache memories - mapping functions.
I/O organization: Characteristics of I/O devices, Data transfer schemes -

4 Programmed controlled I/O transfer, Interrupt controlled I/O transfer. 11

Organization of interrupts - vectored interrupts – Servicing of multiple
input/output devices – Polling and daisy chaining schemes. Direct memory
accessing (DMA)

Course Assessment Method

(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

Internal Internal
Assignment/
Attendance Examination-1 Examination- 2 Total
Microproject
(Written) (Written)

5 15 10 10 40

End Semester Examination Marks (ESE)

In Part A, all questions need to be answered and in Part B, each student can choose any one full
question out of two questions

Part A Part B Total

● 2 Questions from each ● Each question carries 9 marks.
module. ● Two questions will be given from each module,
● Total of 8 Questions, each out of which 1 question should be answered.
60
carrying 3 marks ● Each question can have a maximum of 3 sub
divisions.
(8x3 =24marks) (4x9 = 36 marks)
 Course Outcomes (COs)

At the end of the course students should be able to:

Bloom’s
Course Outcome Knowledge
Level (KL)
CO1 Understand Functional Units and Basic Operational Concepts K2
Describe various micro-operations including arithmetic, logic, and shift
CO2 K2
operations.
Analyze existing processor architectures to understand the
CO3 K3
implementation of pipelining and control strategies.
Define interrupts and their role in handling I/O operations and system
CO4 K2
events.
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create

CO-PO Mapping Table (Mapping od Course Outcomes to Program Outcomes)

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 2 2 1 2 3
CO2 3 2 2 1 2 3
CO3 3 2 2 1 2 3
CO4 3 2 2 1 2 3
Note: 1: Slight (Low), 2: Moderate (Medium), 3: Substantial (High), -: No Correlation

Text Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Hamacher C., Z.
1 Computer Organization McGraw Hill 5/e,2011
Vranesic and S. Zaky
Digital Logic & Computer
2 Mano M. M PHI 2004
Design
Computer System
3 Mano M. M PHI 2007
Architecture
 Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Computer Organization and Patterson D.A. and J. Morgan Kaufmann
1 5/e,2013
Design L. Hennessy Publishers
Computer Organization and

2 Architecture: Designing for William Stallings Pearson, 9/e, 2013.

Performance
Computer Organization and
3 Chaudhuri P Prentice Hall 2/e, 2008.
Design

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
https://www.youtube.com/watch?v=msqxkEKFg8I&list=PLgHucKw979AvcnTpPNZMZyORdL5
HvTr9m,,
1
https://www.youtube.com/watch?v=k_QgyvsqtwA&list=PLgHucKw979AvcnTpPNZMZyORdL5
HvTr9m&index=12
2 https://www.youtube.com/watch?v=0B-y1RPDXjs&list=PL59E5B57A04EAE09C&index=17
https://www.youtube.com/watch?v=AgoC0mlL6eQ&list=PLdS3u59E0DKjUKPcnCYxVxssEkX
2zo-kV&index=8
3 https://www.youtube.com/watch?v=6CCwWCstDGc&list=PL1A5A6AE8AFC187B7&index=9ht
tps://www.youtube.com/watch?v=IQql2ojVzsU&list=PLEAYkSg4uSQ3dmkbCah82ek0KJnpz_D
xL&index=5
4 https://www.youtube.com/watch?v=Wfau1WC5m4c
 SEMESTER S4

COMPUTER NETWORKS

Course Code PCERT403 CIE Marks 40

Teaching Hours/Week
3-1-0-0 ESE Marks 60
(L: T:P: R)

Credits 4 Exam Hours 2 Hrs. 30 Min.

Prerequisites (if any) None Course Type Theory

Course Objectives:

1. To acquire practical skills in network design, configuration, and management which include
learning about different network topologies, transmission media, routing algorithms, and
quality of service techniques.

SYLLABUS

Modul Contact
Syllabus Description
e No. Hours
Introduction – Uses of computer networks, Network hardware, Network
Software. Reference models – The OSI reference model, The TCP/IP

1 reference model, Comparison of OSI and TCP/IP reference models.

Physical Layer – Modes of communication, Physical topologies, 8
Transmission media.
Data link layer - design issues, Error detection and correction, Sliding
window protocols, High-Level Data Link Control (HDLC) protocol.

2 Medium Access Control (MAC) sublayer –Channel allocation problem,

Multiple access protocols, Ethernet, Wireless LANs - 802.11. Repeaters, 10
Hubs, Bridges, Switches, Routers and Gateways.
Network layer Services. Routing algorithms - Shortest path routing,
Flooding, Distance Vector Routing, Link State Routing, Congestion control

3 algorithms. Quality of Service (QoS) - requirements, Techniques for 14

achieving good QoS.
Internet Protocols - IPv4-IPv4 addresses-IPv6 -The Internet Control
 Message Protocol - The Address Resolution Protocol-The Dynamic Host
Configuration Protocol - Network Address Translation - Internet
multicasting.
Transport service – Services provided to the upper layers, Transport service
primitives. User Datagram Protocol (UDP). Transmission Control Protocol
(TCP) – Overview of TCP, TCP segment header, Connection establishment
& release, Connection management modelling, TCP retransmission policy,

4 TCP congestion control.

12
Application Layer –File Transfer Protocol (FTP), Domain Name System
(DNS), Electronic Mail (SMTP), Simple Network Management Protocol
(SNMP), World Wide Web(WWW), Multimedia in the Internet, Real time
interactive protocols-RTP,RTCP,SIP.

Course Assessment Method

(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

Internal Internal
Assignment/
Attendance Examination-1 Examination- 2 Total
Microproject
(Written) (Written )

5 15 10 10 40

End Semester Examination Marks (ESE)

In Part A, all questions need to be answered and in Part B, each student can choose any one full
question out of two questions

Part A Part B Total

● 2 Questions from each ● Each question carries 9 marks.
module. ● Two questions will be given from each module, out
● Total of 8 Questions, each of which 1 question should be answered.
60
carrying 3 marks ● Each question can have a maximum of 3 sub
divisions.
(8x3 =24marks) (4x9 = 36 marks)
 Course Outcomes (COs)

At the end of the course students should be able to:

Bloom’s
Course Outcome Knowledge
Level (KL)
Understand the uses of computer networks, their hardware, software,
CO1 K2
and different reference models.
Analyze data link layer design issues, error detection, correction and
CO2 K3
various medium access control protocols.
Design and evaluate network layer solutions characterized by routing
CO3 K2
and congestion control algorithms and implement IP protocols.
Comprehend the concepts of TCP/UDP protocols and connection
CO4 K2
management including congestion control and retransmission policy.
Understand the application layer protocols and techniques for
CO5 K2
implementing web based applications.
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create

CO-PO Mapping Table (Mapping of Course Outcomes to Program Outcomes)

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 2 3 - - - - - - - - - 1

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

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

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

CO5 2 2 1 - - - - - - - - 2
Note: 1: Slight (Low), 2: Moderate (Medium), 3: Substantial (High), -: No Correlation

Text Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
PHI (Prentice Hall
1 Computer Networks Andrew S. Tanenbaum 4/e,2008
India)
Data Communication and
2 Behrouz A Forouzan Tata McGraw Hill 5/e,2013
Networking
 Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Computer Networks – A Larry L Peterson and Morgan Kaufmann.
1 5/e,2011
Systems Approach Bruce S Dave
Computer Networking and the
2 Fred Halsall Addison-Wesley. 5/e,2005
Internet
James F. Kurose, Keith W. Computer Networking:
3 Pearson Education 6/e,2012
Ross A Top-Down Approach
Computer Networking with
4 William Stallings Prentice-Hall, 4/e,2004
Internet Protocols.
Data Communications
Course Technology,
5 and Computer Networks Curt M. White 7/e, 2013
Cengage Learning
A Business User’s Approach

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
1 https://nptel.ac.in/courses/106105183
2 https://nptel.ac.in/courses/106106091
3 https://onlinecourses.swayam2.ac.in/cec21_cs04/preview
4 https://onlinecourses.nptel.ac.in/noc22_cs19/preview
 SEMESTER S4

INTEGRATED CIRCUITS

Course Code PBERT 404 CIE Marks 60

Teaching Hours/Week
3:0:0:1 ESE Marks 40
(L: T:P: R)

Credits 4 Exam Hours 2 Hrs. 30 Min.

PBERT 304
Prerequisites (if any) Electronics Devices Course Type Theory
and Circuits

Course Objectives:

1. To introduce students about integrated circuits and teach them how to construct and analyze
circuits with the help of op-amps and other specialized ICs.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Operational amplifiers
Introduction of op-amp – block diagram of op-amp –Basic information of
op-amp (741 op-amp) - Power supply requirements. Characteristics of

1 Operational Amplifiers Ideal op amp characteristics - DC characteristics - 9

input bias current, input offset current, input offset voltage, thermal drift,
CMRR, PSRR - AC characteristics - frequency response, slew rate. Basic
applications-inverting amplifier, non-inverting amplifier.
Applications of Operational amplifiers
Differential amplifier, summing amplifier, scale changer, voltage follower,
V-I converter (grounded load type and floating load type), I-V converter.
Instrumentation amplifier (3 op amp) - op amp integrator - op amp

2 differentiator, precision rectifier (half and full wave), peak detector, sample 9
and hold circuit, Comparator (inverting and non-inverting type) –
applications of comparator - zero crossing detector, Schmitt trigger, window
detector
 Waveform generators and Oscillators
Timer IC 555- Functional block diagram – Waveform generators –
Astable and mono stable – Design and working (using 555 and 741).
Triangular and sawtooth –RC phase shift and Wien bridge oscillators (No
3 9
analysis required)
Voltage regulator - Introduction, series op amp regulator -IC regulators -
78XX and 79XX characteristics - voltage regulator as current source using
7805, Low voltage and high voltage regulators using 723 general purpose IC.
Filters, PLL and Data Converters
Types of filters, first and second order LPF and HPF.
Phase Locked Loop – Operation, Lock and capture range (No analysis),
PLL IC 565, Applications - frequency multiplier, frequency translation.
4 9
Data Converters: Digital to Analog converters, Specifications, Weighted
resistor type and R-2R Ladder type. Analog to Digital Converters:
Specifications, ADC –Direct type – Flash type, counter type, successive
approximation type - Integrating type ADC - Single slope type.

Suggestion on Project Topics

Course Assessment Method

(CIE: 60 marks, ESE: 40 marks)

Continuous Internal Evaluation Marks (CIE):

Attendance Project Internal Ex-1 Internal Ex-2 Total

5 30 12.5 12.5 60
 End Semester Examination Marks (ESE)

In Part A, all questions need to be answered and in Part B, each student can choose any one full
question out of two questions

Part A Part B Total

● 2 Questions from each  2 questions will be given from each module,

module. out of which 1 question should be answered.
● Total of 8 Questions, Each question can have a maximum of 2 sub 40
each carrying 2 marks divisions. Each question carries 6 marks.
(8x2 =16 marks) (4x6 = 24 marks)
Course Outcomes (COs)

At the end of the course students should be able to:

Bloom’s
Course Outcome Knowledge
Level (KL)

CO1 Describe basics of operational amplifier and characteristics of op-amps. K2

CO2 Design linear and nonlinear circuits using op-amp. K3

CO3 Design op-amp oscillators, waveform generators and voltage regulators. K3

CO4 Design circuits using Filters, PLL, DAC and ADC. K3

Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create

CO-PO Mapping Table:

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

CO1 3 2 3

CO2 3 2 3 2 3 2 3

CO3 3 2 3 3 3 2 3

CO4 3 2 3 3 3 2 3
 Text Books

Name of the Edition

Sl. No Title of the Book Name of the Author/s
Publisher and Year
D Roy Choudhury and New Age International
1 Linear Integrated Circuits 4/e, 2017
Shail B Jain Publishers

Op-Amps and Linear

2 Ramakant A. Gayakwad Pearson 4/e, 2015
Integrated Circuits

Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Op-amps and Linear Integrated
1 Coughlin & Driscoll Prentice Hall 6/e, 2009
circuits
Design with operational

2 Amplifiers & Analog Sergio Franco Mc Graw Hill India 4/e, 2016
Integrated Circuits

3 Integrated Circuits K R Botkar Khanna Publishers 10/e, 2010

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.

1 https://archive.nptel.ac.in/courses/108/108/108108111

2 https://archive.nptel.ac.in/courses/108/108/108108111

3 https://archive.nptel.ac.in/courses/108/108/108108111

4 https://archive.nptel.ac.in/courses/108/106/108106184
 PBL Course Elements

L: Lecture R: Project (1 Hr.), 2 Faculty Members

(3 Hrs.) Tutorial Practical Presentation
Simulation/
Laboratory Work/ Presentation
Lecture delivery Project identification Workshops (Progress and Final
Presentations)

Group discussion Project Analysis Data Collection Evaluation

Question answer
Project Milestone Reviews,
Sessions/ Analytical thinking and
Testing Feedback,
Brainstorming self-learning
Project reformation (If required)
Sessions
Poster Presentation/
Guest Speakers
Case Study/ Field Video Presentation: Students
(Industry Prototyping
Survey Report present their results in a 2 to 5
Experts)
minutes video

Assessment and Evaluation for Project Activity

Sl. No Evaluation for Allotted

Marks
1 Project Planning and Proposal 5
2 Contribution in Progress Presentations and Question Answer 4
Sessions
3 Involvement in the project work and Team Work 3
4 Execution and Implementation 10
5 Final Presentations 5
6 Project Quality, Innovation and Creativity 3
Total 30

1. Project Planning and Proposal (5 Marks)

● Clarity and feasibility of the project plan

● Research and background understanding
● Defined objectives and methodology

2. Contribution in Progress Presentation and Question Answer Sessions (4 Marks)

● Individual contribution to the presentation

● Effectiveness in answering questions and handling feedback
 3. Involvement in the Project Work and Team Work (3 Marks)

● Active participation and individual contribution

● Teamwork and collaboration

4. Execution and Implementation (10 Marks)

● Adherence to the project timeline and milestones

● Application of theoretical knowledge and problem-solving
● Final Result

5. Final Presentation (5 Marks)

● Quality and clarity of the overall presentation

● Individual contribution to the presentation
● Effectiveness in answering questions

6. Project Quality, Innovation, and Creativity (3 Marks)

● Overall quality and technical excellence of the project

● Innovation and originality in the project

Creativity in solutions and approaches

 SEMESTER S4

COMMUNICATION ENGINEERING

Course Code PEERT411 CIE Marks 40

Teaching Hours/Week
3:0:0:0 ESE Marks 60
(L: T:P: R)

Credits 3 Exam Hours 2 Hrs. 30 Min.

GYEST104
Introduction to
Prerequisites (if any) Electrical and Course Type Theory
Electronics
Engineering

Course Objectives:

1. To introduce the basic principles of analog and digital communication systems.

2. To familiarize with the satellite communication and cellular communication systems.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Analog Communication: Introduction, elements of communication
systems, need for modulation. Amplitude modulation: modulation index,
average power, equation and spectrum of AM signal. Concept of DSB-SC
and SSB.
1 9
Angle modulation- frequency and phase modulation. FM frequency
spectrum, modulation index, equation and spectrum of FM signal Narrow
and wide band FM, Comparison of AM and FM.
Digital Communication: Principles of digital communication – sampling
theorem, Nyquist criterion, quantization, encoding techniques-unipolar,

2 bipolar and Manchester. Pulse modulation techniques- sampling process - 9

PAM, PWM and PPM concepts, block diagram of PCM encoder and
decoder.
Satellite communication: Introduction to satellite communication, types

3 of satellite orbits. Space segment - introduction, power supply, Attitude 9

and Orbit Control System (AOCS), thermal control subsystem, TT&C
 subsystem, transponders, antenna subsystem.

Earth segment - types of earth station, Multiple Access (MA) techniques -

FDMA, TDMA, CDMA, SDMA.
Cellular Communication: Basic concepts, frequency reuse, interference,

4 cell splitting, sectoring, cell system layout, Hand off-types and strategies, 9
Bluetooth, Zig-Bee, GPS, Wi-Fi, Wi-Max based communication.

Course Assessment Method

(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

Internal Internal
Assignment/
Attendance Examination-1 Examination- 2 Total
Microproject
(Written) (Written )

5 15 10 10 40

End Semester Examination Marks (ESE)

In Part A, all questions need to be answered and in Part B, each student can choose any one full
question out of two questions

Part A Part B Total

● 2 Questions from each ● Each question carries 9 marks.
module. ● Two questions will be given from each module, out
● Total of 8 Questions, each of which 1 question should be answered.
60
carrying 3 marks ● Each question can have a maximum of 3 sub
divisions.
(8x3 =24marks) (4x9 = 36 marks)
 Course Outcomes (COs)

At the end of the course students should be able to:

Bloom’s
Course Outcome Knowledge
Level (KL)
CO1 Understand basic elements of AM and FM communication systems. K2

CO2 Understand the concepts of digital communication systems. K2

Understand various subsystems and multiple access techniques used in K2
CO3
satellite communication systems
Understand various aspects of frequency reuse, Handoffs, cell splitting K2
CO4
and channel assignment
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create

CO-PO Mapping Table (Mapping od Course Outcomes to Program Outcomes)

PO1 PO1 PO1

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9
0 1 2
CO1 3 3

CO2 3 3

CO3 3 2 3

CO4 3 2 3
Note: 1: Slight (Low), 2: Moderate (Medium), 3: Substantial (High), -: No Correlation

Text Books
Sl. Name of the Edition
Title of the Book Name of the Author/s
No Publisher and Year
Electronic Communication McGraw-Hill, New 6th edition,
1 Kennedy G.
Systems York, 2017
2nd edition,
2 Digital Communications Bernard Sklar Pearson
2009

4th edition
3 Satellite Communication Dennis Roddy McGraw-Hill
2017

Wireless Communication 2nd edition,

4 Theodore S Rappaport Pearson
Principles and practice 2010
 Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Electronic Communication Prentice Hall of India 4th edition,
1 William Scheweber
Systems LTD, New Delhi 2004
Prentice Hall of India
Electronic Communication 5th edition,
2 Wayne Tomasi LTD, New Delhi,
Systems 2003
2004.
4th edition,
3 Electronic Communication Roody and Coolen Prentice Hall of India
2008
th
4 edition,
4 Communication Systems Simon Haykins John Wiley
2006

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
1 http://acl.digimat.in/nptel/courses/video/117105143/L16.html
2 https://nptel.ac.in/courses/117101051
3 https://archive.nptel.ac.in/courses/117/105/117105131
4 https://nptel.ac.in/courses/106106167
 SEMESTER S4

BASIC VLSI DESIGN

Course Code PEERT 412 CIE Marks 40

Teaching Hours/Week
3:0:0:0 ESE Marks 60
(L: T:P: R)

Credits 3 Exam Hours 2 Hrs. 30 Min.

None
Prerequisites (if any) Course Type Theory

Course Objectives:

1. To bring circuits and system views on design together.

2. To understand the design of digital VLSI circuits for hardware design.
3. To develop the skill to design various VLSI circuits.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Overview of CMOS device fundamentals (Pre-requisite). The CMOS
inverter: - Voltage Transfer Characteristics, Static Behavior - Switching
1 9
Threshold - Noise Margins, Dynamic behavior - Device Capacitances -
Propagation Delay - Power Consumption-SPICE code of an Inverter
CMOS fabrication Processes: -N-Tub, P-Tub and Twin Tub.Layout design
of static MOS circuits -MOS Circuit Layout – Use of Stick diagrams,
2 9
Layout design rules, Transistor layout - PMOS and NMOS, Gate Layout -
Inverter, NAND, NOR.
Combinational logic Circuits: - Static MOS - Complementary MOS -
Ratioed logic - Pass Transistor logic - Differential Pass Transistor Logic -
3 9
Transmission gate logic, Dynamic MOS - Basic Principles - Speed and
power Dissipation, Domino Logic
Design of the Memory Core - Read Only Memories - Non-volatile Read

4 Write Memories - Read Write memories - SRAM and DRAM. Scaling of

9
MOS circuits: scaling models and scaling factors for device parameters.
 Course Assessment Method
(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

Internal Internal
Assignment/
Attendance Examination-1 Examination- 2 Total
Microproject
(Written) (Written )

5 15 10 10 40

End Semester Examination Marks (ESE)

In Part A, all questions need to be answered and in Part B, each student can choose any one full
question out of two questions

Part A Part B Total

● 2 Questions from each ● Each question carries 9 marks.
module. ● Two questions will be given from each module, out
● Total of 8 Questions, each of which 1 question should be answered.
60
carrying 3 marks ● Each question can have a maximum of 3 sub
divisions.
(8x3 =24marks) (4x9 = 36 marks)

Course Outcomes (COs)

At the end of the course students should be able to:

Bloom’s
Course Outcome Knowledge
Level (KL)

CO1 Explain static and dynamic characteristics of CMOS Inverters K2

Explain physical layout for various MOS Circuits K2
CO2
Explain various Combinational Logic Circuits K2
CO3
Explain various types of Memory Elements K2
CO4
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create
 CO-PO Mapping Table (Mapping od Course Outcomes to Program Outcomes)

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

CO1 3 2 3 3

CO2 3 2 3 3

3 2 3
CO3

CO4 3 2 3

Note: 1: Slight (Low), 2: Moderate (Medium), 3: Substantial (High), -: No Correlation

Text Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
J.M. Rabaey, A. Second
Digital Integrated Circuits- A
1 Chandrakasan and B. Pearson Edition,
Design Perspective
Nikolic 2003
Third
Douglas A. Pucknell&
2 Basic VLSI Design PHI Edition,
Kamran Eshraghian
1995
Third
CMOS digital integrated Sung-Mo Kang, Yusuf
3 TATA McGraw-Hill Edition,
circuits: Analysis and design Lablebici
2002

Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
First

1 CMOS Logic Circuit Design John P. Uyemura Springer India Pvt. Ltd Edition,
1999
Fourth
CMOS VLSI Design, a Circuits Neil H. E. Weste, David
2 PEARSON Edition,
and Systems Perspective Money Harris
2015
 Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
1 https://nptel.ac.in/courses/117106092

2 https://onlinecourses.nptel.ac.in/noc22_ee08/preview

3 https://nptel.ac.in/courses/117106092

4 https://onlinecourses.nptel.ac.in/noc22_ee08/preview
 SEMESTER S4

BIOMEDICAL SIGNALS &TRANSDUCERS

Course Code PEERT413 CIE Marks 40

Teaching Hours/Week
3:0:0:0 ESE Marks 60
(L: T:P: R)

Credits 3 Exam Hours 2 Hrs. 30 Min.

Prerequisites (if any) None Course Type Theory

Course Objectives:

1. This course is intended to provide students an insight into cellular electrophysiology and
variousbiomedical transducers used for signal acquisition
SYLLABUS

Module Contact
Syllabus Description
No. Hours
Cell Potentials: Cell membrane- Action potentials – ionic basis of
generation – Nernst potential, Goldman Hodgkin Katz equation. Auto
1 9
rhythmic cells - cardiac action potentials.Synapses&Neuronal Integration
Synaptic potentials – EPSP & IPSP -Neurotransmitters – types
Biosignals and Acquisition Methods: ECG- Generation of cardiac action
potentials -Characteristics of ECG Signal -Lead systems- Clinical

2 applications of ECG. EEG- Brain action potentials- characteristics of signal- 9

Electrode system - Clinical applications of EEG. EMG-Electrical activity of
muscles –Characteristics of EMG signal- Clinical applications of EMG
Biosensors: Photochemistry of vision--Hearing- endo cochlear potentials.
Biosensors-Types-Bio recognition elements in biosensors-immobilization
methods-ISFET- Enzyme electrodes. Nanomaterial based biosensors-

3 Applications of biosensors-Biosensors for clinical diagnostics 9

Biomedical Transducers and Electrodes: Temperature transducers-
Displacement &Pressure transducers- piezo electric transducers- Electrodes
for biopotential measurement- catheter tip transducers
Diagnostic Radiology: Production of diagnostic X-ray-X-ray tubes-principle

4 of image formation-Functional blocks of X-ray machine – tubes for various 9

applications.
 Course Assessment Method
(CIE: 40 marks,ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

Internal Internal
Assignment/
Attendance Examination-1 Examination- 2 Total
Microproject
(Written) (Written )

5 15 10 10 40

End Semester Examination Marks (ESE)

In Part A, all questions need to be answered and in Part B, each student can choose any one full
question out of two questions

Part A Part B Total

 2 Questions from each  Each question carries 9 marks.
module.  Two questions will be given from each module, out
 Total of 8 Questions, each of which 1 question should be answered.
60
carrying 3 marks  Each question can have a maximum of 3 sub
divisions.
(8x3 =24marks) (4x9 = 36 marks)

Course Outcomes (COs)

At the end of the course students should be able to:

Bloom’s
Course Outcome Knowledge
Level (KL)
CO1 Understand the cellular mechanism of production of action potentials K2
Understand the characteristics of bio signals and biomedical signal
CO2 K2
acquisition systems

CO3 Understand the fundamentals of biosensors and its applications K2

Apply the knowledge of electrodes& transducers for various
CO4 K3
biomedical measurements

CO5 Understand the basic principles of diagnostic radiology K2

Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create
 CO-PO Mapping Table (Mapping of Course Outcomes to Program Outcomes)

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 2 2 2 2

CO2 1 2 2 2 2 2 2

CO3 2 2 2 2 2 2

CO4 2 2 2 2 2 2 2

CO5 2 2 2 2 2 2
Note: 1: Slight (Low), 2: Moderate (Medium), 3: Substantial (High), -: No Correlation

Text Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Saunders, an imprint
Text book of Medical 12thedn,
1 Guyton and Hall: of Elsevier Inc.
Physiology 2011

Principles of Biomedical
2 Instrumentation and Richard Aston:
measurements
Biosensors Fundamentals Bansi DharMalhotra, Chandra Ist
3 Smithersrapra,
and Applications, Mouleypandy: edn,2017

Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Biosensors an introductory text JagrithiNarang, Pan Stanford
1 Istedn, 2017
book, ChandrashekharPundir Publishing,
Hand book of biomedical Mc Graw Hill, 2nd
2 R S Khandpur: 2nd edition
Instrumentation, edition
Principles of Applied Wiley Inter science
3 Geddes and Baker: 1989
Biomedical Instrumentation, publications,
A Manual of radiographic
4 Sybil M Stockly; Churchil Living Stone, , 1986
equipment,
 SEMESTER S4

FOUNDATIONS OF MACHINE LEARNING

Course Code PEERT 414 CIE Marks 40

Teaching Hours/Week
3:0:0:0 ESE Marks 60
(L: T:P: R)

Credits 3 Exam Hours 2 Hrs. 30 Min.

Prerequisites (if any) None Course Type Theory

Course Objectives:

1. Understand the basic principles of machine learning

2. To study the basics of supervised and unsupervised learning.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Introduction to Machine Learning- Machine learning paradigms-
supervised, semi-supervised, unsupervised, reinforcement learning.

1 Features: Types of Data (Qualitative and Quantitative), Scales of 9

Measurement (Nominal, Ordinal, Interval, Ratio), Concept of Feature,
Feature Construction, Feature Selection and Transformation.
Supervised Learning - Classification: K-Nearest Neighbour,
Naïve Bayes, Decision Tree algorithm ID3, Support Vector

2 Machine,Regression: Linear regression, logistic regression, 9

Neural Networks- The Perceptron, Activation Functions, Training Feed
Forward Network by Back Propagation.
Unsupervised Learning - Clustering Methods - K-means
clustering,Hierarchical Clustering Methods, Density based
3 9
clustering.Dimensionality Reduction Techniques- Principal component
analysis, Linear Discriminant Analysis.
Evaluating model performance-Confusion matrices, Precision and
recall, Sensitivity and specificity, F-measure, ROC curves, Cross
4 9
validation, K-fold cross validation, Bootstrap sampling. Improving
model performance - Bagging, Boosting, Random forests.
 Course Assessment Method
(CIE: 40 marks, ESE: 60 marks)
Continuous Internal Evaluation Marks (CIE):

Internal Internal
Assignment/
Attendance Examination-1 Examination- 2 Total
Microproject
(Written) (Written )

5 15 10 10 40

End Semester Examination Marks (ESE)

In Part A, all questions need to be answered and in Part B, each student can choose any one
full question out of two questions

Tota
Part A Part B
l
● 2 Questions from each ● Each question carries 9 marks.
module. ● Two questions will be given from each module, out
● Total of 8 Questions, each of which 1 question should be answered.
60
carrying 3 marks ● Each question can have a maximum of 3 sub
divisions.
(8x3 =24marks)
(4x9 = 36 marks)
Course Outcomes (COs)

At the end of the course students should be able to:

Bloom’s
Course Outcome Knowledge
Level (KL)
Illustrate Machine Learning concepts (Cognitive Knowledge Level:
CO1 K2
Understand)
Illustrate the concepts of classification methods (Cognitive Knowledge
CO2 K3
Level: Apply)
analyze clusters using different methods (Cognitive Knowledge Level:
CO3 K3
Apply)
Evaluate & improve the performance of machine learning
CO4 K3
classification models (Cognitive Knowledge Level: Apply)
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create
 CO-PO Mapping Table (Mapping of Course Outcomes to Program Outcomes)

PO1 PO1 PO1

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9
0 1 2
CO1 3 1
CO2 3 3 3 2
CO3 3 3 3 2
CO4 3 3 3 2
Note: 1: Slight (Low), 2: Moderate (Medium), 3: Substantial (High), -: No Correlation

Text Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
3𝑟𝑑
Edition,
Introduction to Machine MIT Press
1 EthemAlphaydin MIT
Learning,
Press,2014

1997.
New York, NY: ISBN:
2 Machine Learning Mitchell, Tom
McGraw-Hill 978007042
8072

Reference Books
Name of the Name of the Edition
Sl. No Title of the Book
Author/s Publisher and Year
Pattern Recognition and Machine
1 Christopher M. Bishop Springer 2006
Learning
Machine Learning: A MIT Press
2 Kevin P. Murphy. 2012
Probabilistic Perspective

3 Elements of Machine Learning, P. Langley Morgan Kaufmann 1995

First
Data Mining and Analysis: Cambridge South
Mohammed J. Zaki
4 Fundamental University Press, Asia
and Wagner Meira
Concepts and Algorithms edition,
2016
Introduction to Machine
Learning with Python: A Guide Andreas Muller and
5 Shroff/O’Reilly 2016
for Data Sarah Guido,
Scientists
 Video Links (NPTEL, SWAYAM…)
Module
Link ID
No.
https://www.youtube.com/watch?v=fC7V8QsPBec&list=PL1xHD4vteKYVpaIiy295pg6_SY5
qznc77&index=2
1
https://www.youtube.com/watch?v=9vMpHk44XXo&list=PL1xHD4vteKYVpaIiy295pg6_SY
5qznc77&index=5
https://www.youtube.com/watch?v=OTAR0kT1swg&list=PL1xHD4vteKYVpaIiy295pg6_SY
5qznc77&index=3

2 https://www.youtube.com/watch?v=_M7Km1XZERU&list=PL1xHD4vteKYVpaIiy295pg6_S
Y5qznc77&index=9

https://www.youtube.com/watch?v=yG1nETGyW2E
https://www.youtube.com/watch?v=HTSCbxSxs-g
3
https://www.youtube.com/watch?v=tlIv3IT_hHk
https://www.youtube.com/watch?v=sosZp0cUsIk&list=PL1xHD4vteKYVpaIiy295pg6_SY5qz
nc77&index=45

https://www.youtube.com/watch?v=9Iq6pz9XJ7w&list=PL1xHD4vteKYVpaIiy295pg6_SY5q
znc77&index=46

4 https://www.youtube.com/watch?v=foWzsWFAmas&list=PL1xHD4vteKYVpaIiy295pg6_SY
5qznc77&index=54

https://www.youtube.com/watch?v=NrdtKndsC1I&list=PL1xHD4vteKYVpaIiy295pg6_SY5q
znc77&index=55

https://www.youtube.com/watch?v=6K48CbOm99Y&list=PL1xHD4vteKYVpaIiy295pg6_SY
5qznc77&index=57
 SEMESTER S4

OBJECT ORIENTED PROGRAMMING USING JAVA

Course Code PEERT416 CIE Marks 40

Teaching Hours/Week
3:0:0:0 ESE Marks 60
(L: T:P: R)

Credits 3 Exam Hours 2 Hrs. 30 Min.

Prerequisites (if any) GBEST204 Course Type Theory

Course Objectives:

1. Understand and apply foundational object-oriented programming concepts in Java, including

classes, objects, inheritance, polymorphism, encapsulation, and abstraction.
2. Design and implement Java applications that leverage OOP principles to achieve modularity,
reusability, and scalability in software development.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Basic Object-Oriented concepts, Introduction to Java - Java programming
and Runtime Environment, Development Platforms- Java Virtual Machine
(JVM), Java compiler, Bytecode, Java Buzzwords, Java program
structure, Comments.

1 Primitive Data types - Integers, Floating Point Types, Characters,

Boolean. Literals, Operators - Arithmetic Operators, Bitwise Operators, 9
Relational Operators, Boolean Logical Operators, Assignment Operator,
Conditional (Ternary) Operator, Operator Precedence. Control Statements
- Selection Statements, Iteration Statements and Jump Statements.
Object Oriented Programming in Java - Class Fundamentals, Declaring
Objects, Introduction to Methods, Constructors, this Keyword, Method
Overloading, Using Objects as Parameters, Returning Objects. Static

2 Members, Final Variables, Inner Classes.

Inheritance - Super Class, Sub Class, The Keyword super, protected 9
Members, Calling Order of Constructors, Method Overriding, the Object
class, Abstract Classes and Methods, using final with Inheritance.
 Packages and Interfaces - Defining Package, CLASSPATH, Access
Protection, Importing Packages, Interfaces.
Exception Handling - Checked Exceptions, Unchecked Exceptions, try
Block and catch Clause, Multiple catch Clauses, Nested try Statements,
throw, throws and finally.
Java Library - String Handling – String Constructors, String Length,

3 Special String Operations -Character Extraction, String Comparison, 9

Searching Strings, Modifying Strings.
Multithreaded Programming - The Java Thread Model, The Main Thread,
Creating Thread, Creating Multiple Threads, Synchronization,
Suspending, Resuming and Stopping Threads.
Event handling - Event Handling Mechanisms, Delegation Event Model,
Event Classes, Sources of Events, Event Listener Interfaces.
Swings fundamentals-Swing Controls, Components and Containers,

4 Swing Packages, Event Handling in Swings, Swing Layout Managers,

9
Exploring Swings –JFrame, JLabel , Swing Buttons, JText Field.
Java Database Connectivity (JDBC) - JDBC overview, Creating and
Executing Queries – create table, delete, insert, select.

Course Assessment Method

(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

Internal Internal
Assignment/
Attendance Examination-1 Examination- 2 Total
Microproject
(Written) (Written )

5 15 10 10 40
 End Semester Examination Marks (ESE)

In Part A, all questions need to be answered and in Part B, each student can choose any one full
question out of two questions

Part A Part B Total

● 2 Questions from each ● Each question carries 9 marks.
module. ● Two questions will be given from each module, out
● Total of 8 Questions, each of which 1 question should be answered.
60
carrying 3 marks ● Each question can have a maximum of 3 sub
divisions.
(8x3 =24marks) (4x9 = 36 marks)
Course Outcomes (COs)

At the end of the course students should be able to:

Bloom’s
Course Outcome Knowledge
Level (KL)
Understand and apply fundamental Java programming concepts,
including the runtime environment, primitive data types, operators, and
CO1 K2
control statements, to develop efficient and well-structured Java
applications.
Apply key object-oriented programming principles in Java, leveraging
CO2 packages and interfaces effectively to design and implement Java K3
applications.
Confidently handle Java exceptions, manipulate strings effectively, and
CO3 K3
implement multithreaded programming techniques.
Develop Java applications that integrate event handling, Swing-based
CO4 graphical user interfaces, and JDBC database connectivity to create K3
robust and user-friendly software solutions.
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create

CO-PO Mapping Table (Mapping od Course Outcomes to Program Outcomes)

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 3 3 2

CO2 3 3 3 2

CO3 3 3 3 2 2

CO4 3 3 3 2 2

CO5 3 3 3 2 2
Note: 1: Slight (Low), 2: Moderate (Medium), 3: Substantial (High), -: No Correlation
 Text Books

Name of the Edition

Sl. No Title of the Book Name of the Author/s
Publisher and Year
1 Java: The Complete reference Herbert Schildt Tata McGraw Hill 8/e, 2011.

Java How to Program, Early Paul Deitel, Harvey

2 Pearson 11/e, 2018
Objects Deitel

Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Introduction to Java
1 Y. Daniel Liang Pearson 7/e, 2013
Programming

2 Programming JAVA a Primer Balagurusamy E Tata McGraw Hill 5/e, 2014

Core Java: An Integrated
3 Nageswararao R Dreamtech Press 2008
Approach

4 Java in A Nutshell Flanagan D O'Reilly 5/e, 2005

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
1 https://onlinecourses.nptel.ac.in/noc24_cs105
2 https://onlinecourses.nptel.ac.in/noc24_cs105
3 https://onlinecourses.nptel.ac.in/noc24_cs105
4 https://onlinecourses.nptel.ac.in/noc24_cs105
 SEMESTER 4

JAVA PROGRAMMING AND APPLICATION DEVELOPMENT

Course Code PEERT 415 CIE Marks 40

Teaching Hours/Week
3-0-0-0 ESE Marks 60
(L: T:P: R)
Credits 5/3 Exam Hours 2 Hrs. 30 Min.
UCEST105:
Algorithmic Thinking
Prerequisites (if any) with Python Course Type Theory
GYEST204:
Programming in C

Course Objectives:

1. Understand and apply foundational object-oriented programming concepts in Java, including

classes, objects, inheritance, polymorphism, encapsulation, and abstraction.
2. Design and implement Java applications that leverage OOP principles to achieve modularity,
reusability, and scalability in software development.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Basic Object-Oriented concepts, Introduction to Java - Java programming
and Runtime Environment, Development Platforms- Java Virtual Machine
(JVM), Java compiler, Bytecode, Java Buzzwords, Java program structure,
Comments.

1 Primitive Data types - Integers, Floating Point Types, Characters, Boolean. 9

Literals, Operators - Arithmetic Operators, Bitwise Operators, Relational
Operators, Boolean Logical Operators, Assignment Operator, Conditional
(Ternary) Operator, Operator Precedence. Control Statements - Selection
Statements, Iteration Statements and Jump Statements.
Object Oriented Programming in Java - Class Fundamentals, Declaring

2 Objects, Introduction to Methods, Constructors, this Keyword, Method 9

Overloading, Using Objects as Parameters, Returning Objects. Static
 Members, Final Variables, Inner Classes.
Inheritance - Super Class, Sub Class, The Keyword super, protected
Members, Calling Order of Constructors, Method Overriding, the Object
class, Abstract Classes and Methods, using final with Inheritance.
Packages and Interfaces - Defining Package, CLASSPATH, Access
Protection, Importing Packages, Interfaces.
Exception Handling - Checked Exceptions, Unchecked Exceptions, try Block
and catch Clause, Multiple catch Clauses, Nested try Statements, throw,
throws and finally.
Java Library - String Handling – String Constructors, String Length, Special

3 String Operations -Character Extraction, String Comparison, Searching 9

Strings, Modifying Strings.
Multithreaded Programming - The Java Thread Model, The Main Thread,
Creating Thread, Creating Multiple Threads, Synchronization, Suspending,
Resuming and Stopping Threads.
Event handling - Event Handling Mechanisms, Delegation Event Model,
Event Classes, Sources of Events, Event Listener Interfaces.
Swings fundamentals-Swing Controls, Components and Containers, Swing

4 Packages, Event Handling in Swings, Swing Layout Managers, Exploring 9

Swings –JFrame, JLabel, Swing Buttons, JText Field.
Java Database Connectivity (JDBC) - JDBC overview, Creating and
Executing Queries – create table, delete, insert, select.

Course Assessment Method

(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

Attendance Internal Ex Evaluate Analyse Total

5 15 10 10 40

Criteria for Evaluation(Evaluate and Analyse): 20 marks

Assignment: 20 Marks

Students should design and implement a real-world application using object-oriented programming
principles, evaluate and refine their class structures and relationships, provide a conclusion on the
effectiveness of their design, and demonstrate the functionality of their application using Java.
Criteria for evaluation:
1. Problem Definition (K4 - 4 points)
1. Clearly defines the real-world problem.
2. Examine and identifies relevant contextual factors (constraints, resources, objectives).
2. Problem Analysis (K4 - 4 points)
1. Break-down and presents a well-reasoned solution approach.
2. Compare and justify the proposed solutions with evidence and logical reasoning.
3. Evaluate (K5 - 4 points)
1. Thoroughly evaluate the proposed solutions.
2. Compares trade-offs, advantages, and disadvantages.
3. Considers feasibility, scalability, and practical implications.
4. Implementation (K5 - 4 points)
1. Select the most feasible solution by implementing the proposed solutions.
2. Successfully translates the chosen solution into code.
3. Demonstrates proficiency in coding practices (readability, efficiency, error handling).
5. Conclusion (K4- 2 points, K5 – 2 points)
1. Summarizes findings and insights. State which solution is most appropriate for the
problem. (K4)
2. Reflects critical thinking and informed decision-making. (K5)
Scoring:
1. Accomplished (4 points): Exceptional analysis, clear implementation, and depth of
understanding.
2. Competent (3 points): Solid performance with minor areas for improvement.
3. Developing (2 points): Adequate effort but lacks depth or clarity.
4. Minimal (1 point): Incomplete or significantly flawed.
End Semester Examination Marks (ESE):

In Part A, all questions need to be answered and in Part B, each student can choose any one full
question out of two questions

Part A Part B Total

 2 Questions from each  2 questions will be given from each
module. module, out of which 1 question should be
 Total of 8 Questions, each answered. Each question can have a
60
carrying 3 marks maximum of 3 sub divisions. Each question
(8x3 =24marks) carries 9 marks.
(4x9 = 36 marks)
 Course Outcomes (COs)

At the end of the course students should be able to:

Bloom’s
Course Outcome Knowledge
Level (KL)
Understand and apply fundamental Java programming concepts,
including the runtime environment, primitive data types, operators, and
CO1 Apply
control statements, to develop efficient and well-structured Java
applications.
Apply key object-oriented programming principles in Java, leveraging
CO2 packages and interfaces effectively to design and implement Java Analysis
applications.
Confidently handle Java exceptions, manipulate strings effectively, and
CO3 Apply
implement multithreaded programming techniques.
Develop Java applications that integrate event handling, Swing-based
CO4 graphical user interfaces, and JDBC database connectivity to create Analysis
robust and user-friendly software solutions.
Evaluate any real-world problem and propose a solution using the
CO5 Evaluate
concepts learned in this course.
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create

CO-PO Mapping Table (Mapping of Course Outcomes to Program Outcomes)

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 3 3 2
CO2 3 3 3 2
CO3 3 3 3 2 2
CO4 3 3 3 2 2
CO5 3 3 3 2 2
Note: 1: Slight (Low), 2: Moderate (Medium), 3: Substantial (High), -: No Correlation
 Text Books

Name of the Edition

Sl. No Title of the Book Name of the Author/s
Publisher and Year
1 Java: The Complete reference Herbert Schildt Tata McGraw Hill 8/e, 2011.

Java How to Program, Early Paul Deitel, Harvey

2 Pearson 11/e, 2018
Objects Deitel

Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Introduction to Java
1 Y. Daniel Liang Pearson 7/e, 2013
Programming
2 Programming JAVA a Primer Balagurusamy E Tata McGraw Hill 5/e, 2014
Core Java: An Integrated
3 Nageswararao R Dreamtech Press 2008
Approach
4 Java in A Nutshell Flanagan D O'Reilly 5/e, 2005

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
1 https://archive.nptel.ac.in/courses/106/105/106105191/
2 https://archive.nptel.ac.in/courses/106/105/106105191/
3 https://archive.nptel.ac.in/courses/106/105/106105191/
4 https://archive.nptel.ac.in/courses/106/105/106105191/
 SEMESTER S3/S4
ECONOMICS FOR ENGINEERS
(Common to All Branches)

Course Code UCHUT346 CIE Marks 50

Teaching Hours/Week (L: T:P: R) 2:0:0:0 ESE Marks 50

Credits 2 Exam Hours 2 Hrs. 30 Min.

Prerequisites (if any) None Course Type Theory

Course Objectives:
1. Understanding of finance and costing for engineering operation, budgetary planning and
control
2. Provide fundamental concept of micro and macroeconomics related to engineering
industry
3. Deliver the basic concepts of Value Engineering.

SYLLABUS
Module Contact
Syllabus Description
No. Hours
Basic Economics Concepts - Basic economic problems – Production
Possibility Curve – Utility – Law of diminishing marginal utility – Law
of Demand - Law of supply – Elasticity - measurement of elasticity and

1 its applications – Equilibrium- Changes in demand and supply and its 6

effects Production function - Law of variable proportion – Economies
of Scale – Internal and External Economies – Cobb-Douglas Production
Function

Cost concepts – Social cost, private cost – Explicit and implicit cost –

2 Sunk cost - Opportunity cost - short run cost curves - Revenue concepts 6
Firms and their objectives – Types of firms – Markets - Perfect
 Competition – Monopoly - Monopolistic Competition - Oligopoly
(features and equilibrium of a firm)

Monetary System – Money – Functions - Central Banking –Inflation -

Causes and Effects – Measures to Control Inflation - Monetary and
Fiscal policies – Deflation

Taxation – Direct and Indirect taxes (merits and demerits) - GST

3 6
National income – Concepts - Circular Flow – Methods of Estimation
and Difficulties - Stock Market – Functions- Problems faced by the
Indian stock market-Demat Account and Trading Account – Stock
market Indicators- SENSEX and NIFTY
Value Analysis and value Engineering - Cost Value, Exchange Value,
Use Value, Esteem Value - Aims, Advantages and Application areas of
4 6
Value Engineering - Value Engineering Procedure - Break-even
Analysis - Cost-Benefit Analysis - Capital Budgeting - Process planning

Course Assessment Method

(CIE: 40 marks , ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

Internal Internal
Assignment/Case
Attendance Examination-1 Examination- 2 Total
Study/ Microproject
(Written) (Written )
10 15 12.5 12.5 50
End Semester Examination Marks (ESE)
In Part A, all questions need to be answered and in Part B, each student can choose any one full
question out of two questions

Part A Part B Total

● Minimum 1 and Maximum  2 questions will be given from each module, out
2 Questions from each of which 1 question should be answered. Each
module. question can have a maximum of 2 sub
50
● Total of 6 Questions, each divisions. Each question carries 8 marks.
carrying 3 marks (4x8 = 32 marks)
(6x3 =18marks)
 Course Outcomes (COs)
At the end of the course students should be able to:

Bloom’s
Course Outcome Knowledge Level
(KL)
Understand the fundamentals of various economic issues using laws

CO1 and learn the concepts of demand, supply, elasticity and production K2
function.
Develop decision making capability by applying concepts relating to
CO2 costs and revenue, and acquire knowledge regarding the functioning of K3
firms in different market situations.
Outline the macroeconomic principles of monetary and fiscal systems,
CO3 K2
national income and stock market.
Make use of the possibilities of value analysis and engineering, and
CO4 solve simple business problems using break even analysis, cost benefit K3
analysis and capital budgeting techniques.
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create
CO-PO Mapping Table:

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

CO1 - - - - - 1 - - - - 1 -

CO2 - - - - - 1 1 - - - 1 -

CO3 - - - - 1 - - - - - 2 -

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

Text Books
Sl. Name of the Edition and
Title of the Book Name of the Author/s
No Publisher Year
Geetika, Piyali Ghosh and
1 Managerial Economics Tata McGraw Hill, 2015
Chodhury
H. G. Thuesen, W. J.
2 Engineering Economy PHI 1966
Fabrycky

3 Engineering Economics R. Paneerselvam PHI 2012

 Reference Books
Sl. Name of the Edition
Title of the Book Name of the Author/s
No Publisher and Year
Leland Blank P.E, Anthony
1 Engineering Economy Mc Graw Hill 7TH Edition
Tarquin P. E.

2 Indian Financial System Khan M. Y. Tata McGraw Hill 2011

Engineering Economics Donald G. Newman, Engg. Press,

3 2002
and analysis Jerome P. Lavelle Texas

Contemporary Engineering Prentice Hall of

4 Chan S. Park 2001
Economics India Ltd
 SEMESTER S3/S4

ENGINEERING ETHICS AND SUSTAINABLE DEVELOPMENT

Course Code UCHUT347 CIE Marks 50

Teaching Hours/Week 2:0:0:0

ESE Marks 50
(L: T:P: R)

Credits 2 Exam Hours 2 Hrs. 30 Min.

Prerequisites (if any) None Course Type Theory

Course Objectives:

1. Equip with the knowledge and skills to make ethical decisions and implement gender-
sensitive practices in their professional lives.
2. Develop a holistic and comprehensive interdisciplinary approach to understanding
engineering ethics principles from a perspective of environment protection and sustainable
development.
3. Develop the ability to find strategies for implementing sustainable engineering solutions.
SYLLABUS

Module Contact
Syllabus Description
No. Hours
Fundamentals of ethics - Personal vs. professional ethics, Civic Virtue,
Respect for others, Profession and Professionalism, Ingenuity, diligence
and responsibility, Integrity in design, development, and research domains,
Plagiarism, a balanced outlook on law - challenges - case studies,
Technology and digital revolution-Data, information, and knowledge,
Cybertrust and cybersecurity, Data collection & management, High
1 technologies: connecting people and places-accessibility and social 6
impacts, Managing conflict, Collective bargaining, Confidentiality, Role
of confidentiality in moral integrity, Codes of Ethics.

Basic concepts in Gender Studies - sex, gender, sexuality, gender

spectrum: beyond the binary, gender identity, gender expression, gender
stereotypes, Gender disparity and discrimination in education,
employment and everyday life, History of women in Science & Technology,
 Gendered technologies & innovations, Ethical values and practices in
connection with gender - equity, diversity & gender justice, Gender policy
and women/transgender empowerment initiatives.

Introduction to Environmental Ethics: Definition, importance and

historical development of environmental ethics, key philosophical theories
(anthropocentrism, biocentrism, ecocentrism). Sustainable Engineering
Principles: Definition and scope, triple bottom line (economic, social and
environmental sustainability), life cycle analysis and sustainability metrics.
2 Ecosystems and Biodiversity: Basics of ecosystems and their functions, 6
Importance of biodiversity and its conservation, Human impact on
ecosystems and biodiversity loss, An overview of various ecosystems in
Kerala/India, and its significance. Landscape and Urban Ecology:
Principles of landscape ecology, Urbanization and its environmental impact,
Sustainable urban planning and green infrastructure.

Hydrology and Water Management: Basics of hydrology and water cycle,

Water scarcity and pollution issues, Sustainable water management practices,
Environmental flow, disruptions and disasters. Zero Waste Concepts and
Practices: Definition of zero waste and its principles, Strategies for waste
reduction, reuse, reduce and recycling, Case studies of successful zero waste
initiatives. Circular Economy and Degrowth: Introduction to the circular
3 economy model, Differences between linear and circular economies, 6
degrowth principles, Strategies for implementing circular economy practices
and degrowth principles in engineering. Mobility and Sustainable
Transportation: Impacts of transportation on the environment and climate,
Basic tenets of a Sustainable Transportation design, Sustainable urban
mobility solutions, Integrated mobility systems, E-Mobility, Existing and
upcoming models of sustainable mobility solutions.

Renewable Energy and Sustainable Technologies: Overview of renewable

energy sources (solar, wind, hydro, biomass), Sustainable technologies in
energy production and consumption, Challenges and opportunities in
renewable energy adoption. Climate Change and Engineering Solutions:
4 6
Basics of climate change science, Impact of climate change on natural and
human systems, Kerala/India and the Climate crisis, Engineering solutions to
mitigate, adapt and build resilience to climate change. Environmental
Policies and Regulations: Overview of key environmental policies and
 regulations (national and international), Role of engineers in policy
implementation and compliance, Ethical considerations in environmental
policy-making. Case Studies and Future Directions: Analysis of real-
world case studies, Emerging trends and future directions in environmental
ethics and sustainability, Discussion on the role of engineers in promoting a
sustainable future.

Course Assessment Method

(CIE: 50 marks , ESE: 50)

Continuous Internal Evaluation Marks (CIE):

Continuous internal evaluation will be based on individual and group activities undertaken throughout
the course and the portfolio created documenting their work and learning. The portfolio will include
reflections, project reports, case studies, and all other relevant materials.

● The students should be grouped into groups of size 4 to 6 at the beginning of the semester.
These groups can be the same ones they have formed in the previous semester.
● Activities are to be distributed between 2 class hours and 3 Self-study hours.
● The portfolio and reflective journal should be carried forward and displayed during the 7th
Semester Seminar course as a part of the experience sharing regarding the skills developed
through various courses.
Sl. Item Particulars Group/ Mark
No. Individ s
ual
(G/I)

1 Reflective Weekly entries reflecting on what was learned, personal I 5

Journal insights, and how it can be applied to local contexts.

2 Micro project 1 a) Perform an Engineering Ethics Case Study analysis G 8

and prepare a report

1 b) Conduct a literature survey on ‘Code of Ethics for

(Detailed Engineers’ and prepare a sample code of ethics
documentation
of the project, 2. Listen to a TED talk on a Gender-related topic, do a G 5
including literature survey on that topic and make a report citing
methodologies, the relevant papers with a specific analysis of the
findings, and Kerala context
reflections)
3. Undertake a project study based on the concepts of G 12
sustainable development* - Module II, Module III &
Module IV

3 Activities 2. One activity* each from Module II, Module III & G 15
Module IV

4 Final A comprehensive presentation summarising the key G 5

Presentation takeaways from the course, personal reflections, and
proposed future actions based on the learnings.

Total Marks 50

*Can be taken from the given sample activities/projects

Evaluation Criteria:
● Depth of Analysis: Quality and depth of reflections and analysis in project reports and
case studies.
● Application of Concepts: Ability to apply course concepts to real-world problems and
local contexts.
● Creativity: Innovative approaches and creative solutions proposed in projects and reflections.
● Presentation Skills: Clarity, coherence, and professionalism in the final presentation.
 Course Outcomes (COs)

At the end of the course students should be able to:

Bloom’s
Course Outcome Knowledge
Level (KL)

Develop the ability to apply the principles of engineering ethics in their K3

CO1
professional life.

Develop the ability to exercise gender-sensitive practices in their K4

CO2
professional lives

Develop the ability to explore contemporary environmental issues and K5

CO3
sustainable practices.

Develop the ability to analyse the role of engineers in promoting K4

CO4
sustainability and climate resilience.

Develop interest and skills in addressing pertinent environmental and K3

CO5
climate-related challenges through a sustainable engineering approach.

Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create

CO-PO Mapping Table:

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

CO1 3 2 3 3 2 2

CO2 1 3 2 3 3 2 2

CO3 3 3 2 3 2 2

CO4 1 3 3 2 3 2 2

CO5 3 3 2 3 2 2
 Reference Books

Name of the Edition

Sl. No Title of the Book Name of the Author/s
Publisher and Year

2nd edition
Ethics in Engineering Practice Cambridge University
1 Caroline Whitbeck & August
and Research Press & Assessment
2011

Cambridge University November

2 Virtue Ethics and Professional Justin Oakley
Roles Press & Assessment 2006

2nd edition
Cambridge University &
3 Bert J. M. de Vries
Sustainability Science Press & Assessment December
2023

Sustainable Engineering Cambridge University

4 Bhavik R. Bakshi, 2019
Press & Assessmen
Principles and Practice
M Govindarajan, S
PHI Learning Private
5 Natarajan and V S 2012
Engineering Ethics Ltd, New Delhi
Senthil Kumar

New age international

6 Professional ethics and human RS Naagarazan 2006.
values (P) limited New Delhi

Tata McGraw Hill

Mike W Martin and 4" edition,
7 Publishing Company
Ethics in Engineering Roland Schinzinger, 2014
Pvt Ltd, New Delhi

Suggested Activities/Projects:
Module-II
● Write a reflection on a local environmental issue (e.g., plastic waste in Kerala backwaters or oceans)
from different ethical perspectives (anthropocentric, biocentric, ecocentric).
● Write a life cycle analysis report of a common product used in Kerala (e.g., a coconut, bamboo or
rubber-based product) and present findings on its sustainability.
● Create a sustainability report for a local business, assessing its environmental, social, and economic
impacts
● Presentation on biodiversity in a nearby area (e.g., a local park, a wetland, mangroves, college campus
etc) and propose conservation strategies to protect it.
● Develop a conservation plan for an endangered species found in Kerala.
● Analyze the green spaces in a local urban area and propose a plan to enhance urban ecology using
native plants and sustainable design.
● Create a model of a sustainable urban landscape for a chosen locality in Kerala.

Module-III
● Study a local water body (e.g., a river or lake) for signs of pollution or natural flow disruption and
suggest sustainable management and restoration practices.
● Analyse the effectiveness of water management in the college campus and propose improvements -
calculate the water footprint, how to reduce the footprint, how to increase supply through rainwater
harvesting, and how to decrease the supply-demand ratio
● Implement a zero waste initiative on the college campus for one week and document the challenges
and outcomes.
● Develop a waste audit report for the campus. Suggest a plan for a zero-waste approach.
● Create a circular economy model for a common product used in Kerala (e.g., coconut oil, cloth etc).
● Design a product or service based on circular economy and degrowth principles and present a
business plan.
● Develop a plan to improve pedestrian and cycling infrastructure in a chosen locality in Kerala
Module-IV
● Evaluate the potential for installing solar panels on the college campus including cost-benefit analysis
and feasibility study.
● Analyse the energy consumption patterns of the college campus and propose sustainable alternatives
to reduce consumption - What gadgets are being used? How can we reduce demand using energy-
saving gadgets?
● Analyse a local infrastructure project for its climate resilience and suggest improvements.
● Analyse a specific environmental regulation in India (e.g., Coastal Regulation Zone) and its impact on
local communities and ecosystems.
● Research and present a case study of a successful sustainable engineering project in Kerala/India (e.g.,
sustainable building design, water management project, infrastructure project).
● Research and present a case study of an unsustainable engineering project in Kerala/India highlighting
design and implementation faults and possible corrections/alternatives (e.g., a housing complex with
water logging, a water management project causing frequent floods, infrastructure project that affects
surrounding landscapes or ecosystems).
 SEMESTER S4

COMPUTER NETWORKING LAB

Course Code PCERL407 CIE Marks 50

Teaching Hours/Week
0:0:3:0 ESE Marks 50
(L: T:P: R)

Credits 2 Exam Hours 2 Hrs. 30 Min.

Prerequisites (if any) GBEST204 Course Type Lab

Course Objectives:

1. To analyze and implement various network communication and flow control protocols.
2. To simulate network congestion control and routing mechanisms alongside studying traffic
analysis to develop skills in identifying and mitigating network congestion issues in diverse
network environments...

Expt.
Experiments
No.
Familiarize and understand basics of network configuration files, networking commands
1
and the functioning of system calls used for network programming in Linux.*
Implement client-server communication using socket programming and TCP as transport
2
layer protocol*
Implement client-server communication using socket programming and UDP as transport
3
layer protocol*
Implement the framing methods employed in Data link layer.*

4 a. Bit stuffing
Character stuffing
Simulate sliding window flow control protocols.*

5 a. Stop and Wait

b. Go back N
Selective Repeat
6 Implement and simulate algorithm for Distance Vector Routing protocol.*
7 Implement Simple Mail Transfer Protocol.
8 Implement File Transfer Protocol.*
 9 Understanding the Wireshark tool.*
10 Implement congestion control using a leaky bucket algorithm.*
11 Study of NS2 simulator*
Design and configure a network with multiple subnets with wired and wireless LANs
12 using required network devices. Configure commonly used services in the network.

Course Assessment Method

(CIE: 50 marks, ESE: 50 marks)

Continuous Internal Evaluation Marks (CIE):

Preparation/Pre-Lab Work
experiments, Viva and Timely Internal
Attendance Total
completion of Lab Reports / Record Examination
(Continuous Assessment)

5 25 20 50

End Semester Examination Marks (ESE):

Procedure/ Conduct of experiment/ Result with valid

Preparatory Execution of work/ inference/ Viva
Record Total
work/Design/ troubleshooting/ Quality of voce
Algorithm Programming Output

10 15 10 10 5 50

● Submission of Record: Students shall be allowed for the end semester examination only upon
submitting the duly certified record.

● Endorsement by External Examiner: The external examiner shall endorse the record
 Course Outcomes (COs)
At the end of the course students should be able to:

Bloom’s
Course Outcome Knowledge
Level (KL)
Familiarize the fundamentals of networking commands, configuration files
CO1 K2
and the use of system calls for network programming.
Implement and interpret client-server communication through socket
CO2 K3
programming, employing TCP and UDP as transport layer protocols.
Implement simulation of sliding window flow control protocols routing
CO3 K3
protocols and framing methods using programmatic approach.
Implement and simulate file transfer protocols and congestion control
CO4 K3
algorithms for networking
Familiarize network configuration tools for configuring network with
CO5 K3
multiple subnets.
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create

CO- PO Mapping (Mapping of Course Outcomes with Program Outcomes)

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 2 2

CO2 3 2 2 2 2 2

CO3 3 2 2 2 2 2

CO4 3 2 2 2 2 2

CO5 3 2 2 2 2
1: Slight (Low), 2: Moderate (Medium), 3: Substantial (High), -: No Correlation

Text Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
PHI (Prentice Hall
1 Computer Networks Andrew S. Tanenbaum 4/e,2008
India)

Data Communication and

2 Behrouz A Forouzan Tata McGraw Hill 4/e,2007
Networking
 Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Computer Networking and the
1 Fred Halsall Addison-Wesley. 5/e,2005
Internet
James F. Kurose, Keith W. Computer Networking:
2 Pearson Education 6/e,2012
Ross A Top-Down Approach
Morgan Kaufmann
3 TCP/IP Sockets in C Michael J Donahoo 2/e
Publishers
Hands-On Network
4 Lewis Van Winkle Packt Publishing 2019
Programming with C

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.

1 https://nptel.ac.in/courses/106105183

2 https://nptel.ac.in/courses/106106091

3 https://onlinecourses.swayam2.ac.in/cec21_cs04/preview

4 https://onlinecourses.nptel.ac.in/noc22_cs19/preview

Continuous Assessment (25 Marks)

1. Preparation and Pre-Lab Work (7 Marks)

● Pre-Lab Assignments: Assessment of pre-lab assignments or quizzes that test understanding

of the upcoming experiment.
● Understanding of Theory: Evaluation based on students’ preparation and understanding of
the theoretical background related to the experiments.

2. Conduct of Experiments (7 Marks)

● Procedure and Execution: Adherence to correct procedures, accurate execution of

experiments, and following safety protocols.
● Skill Proficiency: Proficiency in handling equipment, accuracy in observations, and
troubleshooting skills during the experiments.
 ● Teamwork: Collaboration and participation in group experiments.

3. Lab Reports and Record Keeping (6 Marks)

● Quality of Reports: Clarity, completeness and accuracy of lab reports. Proper documentation
of experiments, data analysis and conclusions.
● Timely Submission: Adhering to deadlines for submitting lab reports/rough record and
maintaining a well-organized fair record.

4. Viva Voce (5 Marks)

● Oral Examination: Ability to explain the experiment, results and underlying principles
during a viva voce session.

Final Marks Averaging: The final marks for preparation, conduct of experiments, viva, and record
are the average of all the specified experiments in the syllabus.

Evaluation Pattern for End Semester Examination (50 Marks)

1. Procedure/Preliminary Work/Design/Algorithm (10 Marks)

● Procedure Understanding and Description: Clarity in explaining the procedure and

understanding each step involved.
● Preliminary Work and Planning: Thoroughness in planning and organizing
materials/equipment.
● Algorithm Development: Correctness and efficiency of the algorithm related to the
experiment.
● Creativity and logic in algorithm or experimental design.

2. Conduct of Experiment/Execution of Work/Programming (15 Marks)

● Setup and Execution: Proper setup and accurate execution of the experiment or
programming task.

3. Result with Valid Inference/Quality of Output (10 Marks)

● Accuracy of Results: Precision and correctness of the obtained results.

● Analysis and Interpretation: Validity of inferences drawn from the experiment or quality of
program output.
4. Viva Voce (10 Marks)

● Ability to explain the experiment, procedure results and answer related questions
● Proficiency in answering questions related to theoretical and practical aspects of the subject.

5. Record (5 Marks)

● Completeness, clarity, and accuracy of the lab record submitted

 SEMESTER S4

INTEGRATED CIRCUITS LAB

Course Code PCERL 408 CIE Marks 50

Teaching Hours/Week
0:0:3:0 ESE Marks 50
(L: T:P: R)

Credits 2 Exam Hours 2 Hrs. 30 Min.

PBERT
304:Electronic
Prerequisites (if any) Course Type Lab
Devices and
Circuits

Course Objectives:

1. To impart ability to handle the various electronic instruments and trouble shoot circuits.
2. To gain hands-on experience in designing electronic circuits using integrated circuits,
transistors and diodes.

Expt.
Experiments
No.
Measurement of current, voltage, frequency and phase shift of signal in a RC network
1
using oscilloscope.
2 Rectifier circuits with and without C filter.
3 Clipping and clamping circuits using diodes.
RC coupled amplifier using BJT in CE Configuration-Measurement of gain, BW and
4
plotting of frequency response.
5 Op-amp circuits – Design and set up of inverting and non-inverting amplifier
6 Op-amps circuits – adder, integrator, and differentiator.
7 Precision rectifier using Op-amps.
8 Phase shift oscillator and Wien’s Bridge oscillator using Op-amps.
Waveform generation– Square, triangular and saw tooth waveform generation using Op-
9
amps.
10 Basic comparator and Schmitt trigger circuits using Op-amp
11 Astable and Monostable circuits using 555 IC.
12 D/A Converters - R-2R ladder circuit.
 Course Assessment Method
(CIE: 50 marks, ESE: 50 marks)

Continuous Internal Evaluation Marks (CIE):

Preparation/Pre-Lab Work
experiments, Viva and Timely Internal
Attendance Total
completion of Lab Reports / Record Examination
(Continuous Assessment)
5 25 20 50

End Semester Examination Marks (ESE):

Procedure/ Conduct of experiment/ Result with valid

Preparatory Execution of work/ inference/ Viva
Record Total
work/Design/ troubleshooting/ Quality of voce
Algorithm Programming Output
10 15 10 10 5 50

● Submission of Record: Students shall be allowed for the end semester examination only upon
submitting the duly certified record.

● Endorsement by External Examiner: The external examiner shall endorse the record

Course Outcomes (COs)

At the end of the course students should be able to:

Bloom’s
Course Outcome Knowledge
Level (KL)

CO1 Use the various electronic instruments for conducting experiments Apply

CO2 Design and develop various electronic circuits using diodes. Apply

CO3 Design and implement amplifier and oscillator circuits using BJT Apply

CO4 Design and implement basic circuits using IC (OPAMP and 555 timers). Apply

Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create
 CO- PO Mapping (Mapping of Course Outcomes with Program Outcomes)

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

3 3
CO1
3 3 3 3
CO2
3 3 3 3
CO3
3 3 3 3
CO4
1: Slight (Low), 2: Moderate (Medium), 3: Substantial (High), -: No Correlation

Text Books
Sl. Name of the Name of the Edition
Title of the Book
No Author/s Publisher and Year
Electronic Devices and Circuit R E Boylstead and L
1 Pearson Education 11/e, 2015
Theory Nashelsky
Pulse, digital and Switching
2 Millman and Taub Tata McGraw Hill 2007
Waveforms,
Opamps and Linear Integrated
3 Coughlin & Driscoll Prentice Hall 6/e, 2009
circuits
New Age
4 Linear Integrated Circuits, Choudhury R., International 4/e, 2017
Publishers

Video Links (NPTEL, SWAYAM…)

Sl. No. Link ID

1 archive.nptel.ac.in/courses/108/108/108108111

Continuous Assessment (25 Marks)

1. Preparation and Pre-Lab Work (7 Marks)

● Pre-Lab Assignments: Assessment of pre-lab assignments or quizzes that test understanding

of the upcoming experiment.
● Understanding of Theory: Evaluation based on students’ preparation and understanding of
the theoretical background related to the experiments.
 2. Conduct of Experiments (7 Marks)

● Procedure and Execution: Adherence to correct procedures, accurate execution of

experiments, and following safety protocols.
● Skill Proficiency: Proficiency in handling equipment, accuracy in observations, and
troubleshooting skills during the experiments.
● Teamwork: Collaboration and participation in group experiments.

3. Lab Reports and Record Keeping (6 Marks)

● Quality of Reports: Clarity, completeness and accuracy of lab reports. Proper documentation
of experiments, data analysis and conclusions.
● Timely Submission: Adhering to deadlines for submitting lab reports/rough record and
maintaining a well-organized fair record.

4. Viva Voce (5 Marks)

● Oral Examination: Ability to explain the experiment, results and underlying

principles during a viva voce session.

Final Marks Averaging: The final marks for preparation, conduct of experiments, viva,
and record are the average of all the specified experiments in the syllabus.

Evaluation Pattern for End Semester Examination (50 Marks)

1. Procedure/Preliminary Work/Design/Algorithm (10 Marks)

● Procedure Understanding and Description: Clarity in explaining the procedure and

understanding each step involved.
● Preliminary Work and Planning: Thoroughness in planning and organizing
materials/equipment.
● Algorithm Development: Correctness and efficiency of the algorithm related to the
experiment.
● Creativity and logic in algorithm or experimental design.

2. Conduct of Experiment/Execution of Work/Programming (15 Marks)

● Setup and Execution: Proper setup and accurate execution of the experiment or
programming task.
3. Result with Valid Inference/Quality of Output (10 Marks)

● Accuracy of Results: Precision and correctness of the obtained results.

● Analysis and Interpretation: Validity of inferences drawn from the experiment or quality of
program output.

4. Viva Voce (10 Marks)

● Ability to explain the experiment, procedure results and answer related questions
● Proficiency in answering questions related to theoretical and practical aspects of the subject.

5. Record (5 Marks)

● Completeness, clarity, and accuracy of the lab record submitted

 SEMESTER 5
ELECTRONICS & COMPUTER ENGINEERING
 SEMESTER S5

DIGITAL SIGNAL PROCESSING

Course Code PCERT 501 CIE Marks 40
Teaching Hours/Week
3:1:0:0 ESE Marks 60
(L: T:P: R)

Credits 4 Exam Hours 2 Hrs. 30 Min.

Prerequisites (if any) None Course Type Theory

Course Objectives:

1. To understand the various design techniques and realization methods of FIR and IIR filters.
2. To describe signals mathematically and understand how to perform mathematical operations
on signals.
3. To understand the analytical tools such as Discrete Time Fourier Transforms, Discrete
Fourier Transforms, Fast Fourier Transforms and Z-Transforms required for digital signal
processing.
SYLLABUS

Module Contact
Syllabus Description
No. Hours
Introduction to Signals, Systems and Digital Signal Processing:
Continuous and Discrete Time Signals, Generation of Discrete Time Signals
– Sampling, Elementary Discrete Time Signals. Classification of signals
(Continuous and Discrete) - Periodic and Non-Periodic Signals, Energy and
Power Signals, Even and odd signals. Operations on Signals (Continuous
and Discrete) - Shifting, Folding, Scaling. Discrete Time Systems-Properties
1 11
of Discrete Time Systems-Linearity, Time invariance, Causality, Stability.
Linear Time Invariant (LTI) Systems – Convolution sum, Impulse response.
Difference Equation representation of LTI Systems. Z-transform-Properties
of Z-transform, Inverse Z-transform, System Transfer function. Basic
Elements of Digital Signal Processing (DSP) System, Typical DSP
applications.
Frequency Domain Representation of Discrete-Time Signals: Discrete
2 10
Time Fourier Transform (DTFT), Discrete Fourier Transform (DFT)-
 Properties. Circular convolution and its relationship with linear convolution;
Relationship between DTFT and DFT
Efficient Computation of DFT: Fast Fourier Transform (FFT) Algorithms-
Radix-2 Decimation in Time (DIT) and Decimation in Frequency (DIF) FFT
Algorithms, IDFT computation using Radix-2 FFT Algorithms
Design of Digital Filters: Classification of Digital filters: FIR Filter, IIR
Filter. Types of filters-LPF, HPF, BPF, BSF
Design of FIR Filters: Linear Phase FIR filters-Symmetric and Anti-
symmetric FIR Filters, Gibbs Phenomenon, Design of linear phase FIR
3 filters using Window method (Rectangular, Hamming and Hanning). 11
Design of IIR Digital Filters: Analog Filters (Butterworth), Analog
Butterworth Prototype LPF filter design, IIR Filter Design using Impulse
Invariance, and Bilinear Transformation, Frequency Transformations in the
Analog domain (LPF and HPF only)
Realization of Digital Filters: Structures for the realization of Discrete
Time Systems: Block diagram and signal flow graph representations of
filters.
FIR Filter Structures: Linear Phase realization, Direct Form, Cascade Form.
IIR Filter Structures: Direct Form, Cascade Form and Parallel Form.
4 12
DSP architecture: Introduction to TMS320C67xx digital signal processor,
Functional Block Diagram and Description.
Finite word length effects in DSP systems: Introduction (analysis not
required), fixed-point and floating- point DSP arithmetic, ADC quantization
noise, Round-off error

Course Assessment Method

(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

Internal Internal
Assignment/
Attendance Examination-1 Examination- 2 Total
Microproject
(Written) (Written)

5 15 10 10 40
 End Semester Examination Marks (ESE)

In Part A, all questions need to be answered and in Part B, each student can choose any one full
question out of two questions

Part A Part B Total

 2 Questions from each  Each question carries 9 marks.
module.  Two questions will be given from each module, out of
 Total of 8 Questions, each which 1 question should be answered.
60
carrying 3 marks  Each question can have a maximum of 3 sub divisions.
(4x9 = 36 marks)
(8x3 =24marks)
Course Outcomes (COs)

At the end of the course students should be able to:

Bloom’s
Course Outcome Knowledge
Level (KL)
Summarize the fundamental concepts of discrete-time signals, systems,
CO1 digital signal processing and obtain the transfer function of system using K2
Z-transform.
CO2 Illustrate the fundamental concepts of DFT and compute DFT and IDFT. K2
CO3 Design FIR filters and IIR filters for the given specifications. K3
Realize the various FIR and IIR filter structures for given the system
CO4 K2
function
Explain the architecture ofTMS320C67xxDSPprocessorandthe finite word
CO5 K2
length effects in DSP systems.
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create

CO-PO Mapping Table (Mapping of Course Outcomes to Program Outcomes)

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 2 2 1 2
CO2 2 3 3 2
CO3 2 3 3 2
CO4 2 2 2 2
CO5 2 1 1 3
Note: 1: Slight (Low), 2: Moderate (Medium), 3: Substantial (High), -: No Correlation
 Text Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Proakis J. G. and
1 Digital Signal Processing Pearson Education 4/e, 2007
Manolakis D. G.
Discrete-Time Signal Alan V Oppenheim,
2 Pearson Education 3/e, 2014
Processing Ronald W. Schafer
Digital Signal Processing: A
3 Mitra S. K. McGraw Hill 4/e, 2014
Computer Based Approach

Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Digital Signal Processing: A Ifeachor E.C. and Jervis
1 Pearson Education 2/e,2009
Practical Approach B. W
Understanding Digital Signal
2 Lyons, Richard G. Pearson Education 3/e,2004
Processing
McGraw - Hill
3 Digital Signal Processing Salivahanan S 4/e,2019
Education
DSP applications using C and
4 Chassaing, Rulph John Wiley & Sons 2003
the TMS320C6x DSK.
Vinay K. Ing1e, John G.
5 Digital Signal Processing Thomson 2004
Proakis

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
1 https://onlinecourses.nptel.ac.in/noc21_ee28/preview
2 https://nptel.ac.in/courses/117105134
3 https://nptel.ac.in/courses/117102060
4 https://onlinecourses.nptel.ac.in/noc22_ee99/preview
 SEMESTER S5

THEORY OF COMPUTATION
Course Code PCERT 502 CIE Marks 40
Teaching Hours/Week
3:1:0:0 ESE Marks 60
(L: T:P: R)

Credits 4 Exam Hours 2 Hrs. 30 Min.

Prerequisites (if any) None Course Type Theory

Course Objectives:

1. Design and implement Java applications that leverage OOP principles to achieve
modularity, reusability, and scalability in software development.
2. Understand and apply foundational object-oriented programming concepts in Java,
including classes, objects, inheritance, polymorphism, encapsulation, and abstraction.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Introduction to formal language theory – Alphabets, Strings, Concatenation
of strings, Languages.
Regular Languages - Deterministic Finite State Automata (DFA),
1 11
Nondeterministic Finite State Automata (NFA), Equivalence of DFA and
NFA (Proof not required), Regular Grammar (RG), Equivalence of RGs and
DFA (Proof not required).
Regular Expression (RE), Equivalence of REs and DFA (proof not
required), Pumping Lemma for regular languages. Closure Properties of
2 11
Regular Languages,
DFA state minimization (Myhill-Nerode Theorem). Applications of MNT
Context Free Grammar (CFG), derivation trees and ambiguity.
Nondeterministic Pushdown Automata (PDA), Deterministic Pushdown
3 11
Automata (DPDA). Pumping Lemma for Context-Free Languages (Proof not
required), Closure Properties of Context Free Languages.
 Context Sensitive Languages - Context Sensitive Grammar (CSG), Linear
Bounded Automata.
4 Turing Machines - Standard Turing Machine, Robustness, Recursive and 11
Recursively Enumerable Languages.
Chomsky classification of formal languages.

Course Assessment Method

(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

Internal Internal
Assignment/
Attendance Examination-1 Examination- 2 Total
Microproject
(Written) (Written)

5 15 10 10 40

End Semester Examination Marks (ESE)

In Part A, all questions need to be answered and in Part B, each student can choose any one
full question out of two questions

Part A Part B Total

 2 Questions from each  Each question carries 9 marks.

module.  Two questions will be given from each module, out
 Total of 8 Questions, each of which 1 question should be answered.
60
carrying 3 marks  Each question can have a maximum of 3 sub
divisions.
(8x3 =24marks) (4x9 = 36 marks)
 Course Outcomes (COs)

At the end of the course students should be able to:

Bloom’s
Course Outcome Knowledge
Level (KL)
Design and analyze deterministic and nondeterministic finite automata
CO1 K2
and understand their equivalence with regular grammars.
Apply regular expressions, finite automata, the pumping lemma,
CO2 closure properties, and the Myhill-Nerode Theorem for DFA K3
minimization.
Understand and apply context-free grammars, derivation trees, and
ambiguity resolution, along with the design and analysis of
CO3 K3
nondeterministic and deterministic pushdown automata, the pumping
lemma, and closure properties of context-free languages.
Understand and apply context-sensitive grammars, linear bounded
CO4 automata, standard Turing machines, and the classification of formal K3
languages, including recursive and recursively enumerable languages.
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create

CO-PO Mapping Table (Mapping of Course Outcomes to Program Outcomes)

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 3 3 2
CO2 3 3 3 2
CO3 3 3 3 2
CO4 3 3 3 2
Note: 1: Slight (Low), 2: Moderate (Medium), 3: Substantial (High), -: No Correlation

Text Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year

1 Automata and Computability Dexter C. Kozen Springer 2007

 Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Introduction to Automata John E Hopcroft,
1 Theory, Languages, and Rajeev Motwani and Pearson Education 3/e, 2008

Computation Jeffrey D Ullman,

Introduction To Theory of
2 Michael Sipser, Cengage Publishers 2014
Computation

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
1 https://archive.nptel.ac.in/courses/106/104/106104148/
2 https://archive.nptel.ac.in/courses/106/104/106104148/
3 https://archive.nptel.ac.in/courses/106/104/106104148/
4 https://archive.nptel.ac.in/courses/106/104/106104148/
 SEMESTER S5

MICROCONTROLLERS AND INTERFACING

Course Code PCERT 503 CIE Marks 40

Teaching Hours/Week
3:0:0:0 ESE Marks 60
(L: T:P: R)

Credits 3 Exam Hours 2 Hrs. 30 Min.

PCERT 402 Computer

Prerequisites (if any) Organization and Course Type Core
Architecture

Course Objectives:

1. To introduce the students to the architectural features of microcontrollers, capabilities of

microcontroller and their utilisation.

SYLLABUS

Module Contact
Syllabus Description
No. Hours

8051 Microcontroller: Introduction, comparison of Microprocessor and

microcontroller, Evolution of microcontrollers from 4-bit to 32-bit, Selection
1 of microcontrollers, Applications of microcontrollers. 8051 Architecture- 9
Registers, Pin diagram, I/O ports functions, Internal Memory organization.
External Memory (ROM & RAM) interfacing.
Addressing modes and accessing memory using various addressing modes,
instruction set: Arithmetic, Logical, Simple bit, jump, loop and call
2 9
instructions, Stack, Stack and Subroutine instructions. Assembly language
program examples
Timers and Counters, Interrupts, interfacing seven segment displays,
displaying information on an LCD, control of a stepper Motor, ADC, DAC.
3 8051 Serial Communication- Basics of Serial Data Communication, RS- 232 9
standard, 9 pin RS232 signals, Simple Serial Port programming to transmit a
message and to receive data serially.
 ARM processor fundamentals – Registers, Current Program Status Register,
Pipeline, Exceptions, Interrupts, and the Vector Table, Core Extensions,
4 Architecture Revisions. Introduction to ARM family, ARM7 register 9
architecture, ARM programmer's model. Raspberry pi 4 board - Introduction
and brief description.

Course Assessment Method

(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

Internal Internal
Assignment/
Attendance Examination-1 Examination- 2 Total
Microproject
(Written) (Written)

5 15 10 10 40

End Semester Examination Marks (ESE)

In Part A, all questions need to be answered and in Part B, each student can choose any one
full question out of two questions

Part A Part B Total

 2 Questions from each  Each question carries 9 marks.

module.  Two questions will be given from each module, out
 Total of 8 Questions, each of which 1 question should be answered.
60
carrying 3 marks  Each question can have a maximum of 3 sub
divisions.
(8x3 =24marks) (4x9 = 36 marks)
 Course Outcomes (COs)

At the end of the course students should be able to:

Bloom’s
Course Outcome Knowledge
Level (KL)

CO1 Identify features of various microcontroller K2

CO2 Write and execute assembly language programs for given application K3
CO3 Interface microcontroller with hardware for given application K3
CO4 Able to understand architecture of the ARM Processor K2
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create

CO-PO Mapping Table:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 2
CO2 3 3 3
CO3 3 3 3 3 2
CO4 3 2

Text Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
The 8051 Microcontroller Muhammad Ali Mazidi
1 and Embedded Systems – Janice Gillespie Mazidi and Pearson 2e, 2007
using assembly and C Rollin D. McKinlay
2 The 8051 Microcontroller Kenneth J. Ayala Cengage 3e, 2007
ARM System - on-chip
3 Steve Furber Pearson Education 2e, 2001
Architecture
ARM System Developer’s Andrew N. Sloss, Dominic
4 Morgan Kaufman 2004
guide Symes, Chris Wright
Microcontrollers:
Architecture, Programming,
5 Raj Kamal Pearson Education 2005
Interfacing and System
Design
 Reference Books

Name of the Edition

Sl. No Title of the Book Name of the Author/s
Publisher and Year

The 8051 Microcontroller

1 Manish K Patel McGraw Hill 2014
Based Embedded Systems

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
1 https://archive.nptel.ac.in/courses/108/105/108105102/
2 https://archive.nptel.ac.in/courses/108/105/108105102/
3 https://archive.nptel.ac.in/courses/108/105/108105102/
4 https://archive.nptel.ac.in/courses/108/105/108105102/
 SEMESTER S5

DATABASE MANAGEMENT SYSTEMS

Course Code PBERT504 CIE Marks 60
Teaching Hours/Week
3:0:0:1 ESE Marks 40
(L: T:P: R)

Credits 4 Exam Hours 2 Hrs. 30 Min.

Prerequisites (if any) Course Type Theory

Course Objectives:

1. Gain a comprehensive understanding of database fundamentals, including the architecture,

languages, and classification of database management systems (DBMS).
2. Develop skills in designing and implementing databases using the Entity-Relationship (ER)
model and relational model, including translating ER diagrams into relational schema and
performing normalization.
3. Acquire knowledge of database concepts such as transaction processing, concurrency control,
recovery mechanisms, and the characteristics and types of NoSQL databases.
SYLLABUS

Module Contact
Syllabus Description
No. Hours
Basics of Database - Introduction and applications of DBMS, Purpose of
database, View of Data, Database Languages, Database architecture and
Classification, Database users and Administrators.

1 ER model - Entity Sets, Relationship Sets, Attributes, Constraints, Removing 10

Redundant Attributes in Entity Sets, Entity-Relationship Diagrams.
Introduction to Relational Model - Structure of Relational Databases,
Database Schema, Keys, Schema Diagrams, Relational Query Languages,
Relational Algebra, Synthesizing ER diagram to relational schema.
Introduction to Structured Query Language (SQL) - Overview of the SQL

2 Query Language, SQL Data Definition, Basic Structure of SQL Queries, 9

Additional Basic Operations, Set Operations, Null Values, Aggregate
Functions, Nested Subqueries, Views, assertions, Triggers.
 Relational Database Design - Different anomalies in designing a database,
the idea of normalization, Functional dependency, Armstrong’s Axioms
(proofs not required), Closures and their computation, Equivalence of
3 8
Functional Dependencies (FD), Minimal Cover (proofs not required). First
Normal Form (1NF), Second Normal Form (2NF), Third Normal Form
(3NF), Boyce Codd Normal Form (BCNF).
Transaction Processing Concepts - overview of concurrency control,
Transaction Model, Significance of concurrency Control & Recovery,
Transaction States, System Log, Desirable Properties of transactions. Serial
schedules, Concurrent and Serializable Schedules, Conflict equivalence and
4 9
conflict serializability, Recoverable and cascade-less schedules, Locking,
Two-phase locking and its variations. Log-based recovery, check-pointing.
NoSQL Databases - Introduction, properties of NoSQL Databases, types of
No SQL Databases.

Course Assessment Method

(CIE: 60 marks, ESE: 40 marks)

Continuous Internal Evaluation Marks (CIE):

Internal Internal Examination-

Assignment/
Attendance Examination-1 2 Total
Microproject
(Written) (Written)

5 30 12.5 12.5 60

End Semester Examination Marks (ESE)

In Part A, all questions need to be answered and in Part B, each student can choose any one
full question out of two questions
 Part A Part B Total
● 2 Questions from each ● Each question carries 6 marks.
module. ● Two questions will be given from each module, out of
● Total of 8 Questions, each which 1 question should be answered.
carrying 2 marks ● Each question can have a maximum of 3 sub 40
divisions.
(8x2 =16 marks) (4x6 = 24 marks)

Course Outcomes (COs)

At the end of the course students should be able to:

Bloom’s
Course Outcome Knowledge
Level (KL)

Comprehend and exemplify the fundamental nature and characteristics of

CO1 database systems, and model real-world scenarios using Entity- Apply
Relationship diagrams.

Develop and execute efficient queries to create, manage, and retrieve

CO2 data in relational databases. Apply

Demonstrate the features of Normalization in database applications.

CO3 Apply

Discuss and compare the aspects of Concurrency Control and Recovery

CO4 in Database systems. Apply

CO5 Explain various types of NoSQL databases. Understand

Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create

CO-PO Mapping Table:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 2 3 3 2 3
CO2 2 3 3 2 3
CO3 2 3 3 2 3
CO4 2 3 3 1 3
CO5 1 1 1 2 1 3
 Text Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Database Systems: Models, Elmasri R. and S.
Pearson Education
1 Languages, Design and Navathe 6/e, 2013
Application Programming

Sliberschatz A., H. F.
2 Database System Concepts McGraw Hil 6/e, 2011
Korth and S. Sudarshan

Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
NoSQL Data Models: Trends
1 Olivier Pivert (Editor) Wiley 2018
and Challenge
2 NoSQL for Dummies Adam Fowler John Wiley & Sons 2015

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
1 https://nptel.ac.in/courses/106105175
2 https://www.coursera.org/learn/sql-data-science
3 https://www.udemy.com/course/database-normalization-simplified
4 https://archive.nptel.ac.in/courses/106/104/106104135/
 SEMESTER S5

WIRELESS SENSOR NETWORKS

Course Code PEERT 521 CIE Marks 40

Teaching Hours/Week
3:0:0:0 ESE Marks 60
(L: T:P: R)

Credits 4/3 Exam Hours 2 Hrs. 30 Min.

Prerequisites (if any) None Course Type Theory

Course Objectives:

1. To understand the fundamentals of wireless sensor networks and its applications.

2. To study the various protocols at various layers.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Introduction and Overview of Wireless Sensor Networks: Background of
Sensor Network Technology – Application of Sensor Networks-Basic
overview of the technology- Basic Sensor Network Architectural Elements-
1 Survey of Sensor Networks - Applications of Sensor Networks: Introduction- 9
Background-Range of Applications-Examples of Category 2 WSN
Applications- Examples of Category 1 WSN Applications-Taxonomy of
WSN Technology.
Basic Wireless Sensor Technology: Introduction-Sensor Node Technology-
Sensor Taxonomy. WN Operating Environment- WN Trends -Wireless
2 Transmission Technology and Systems: Radio Technology Primer- 9
Propagation and Propagation Impairments- Available Wireless
Technologies-Campus Applications- MAN/WAN Applications.
Medium Access Control Protocols for Wireless Sensor Networks:
Introduction- BackgroundFundamentals of MAC Protocols-Performance
3 9
Requirements-Common Protocols-MAC Protocols for WSNs-Sensor-MAC
Case Study-IEEE 802.15.4 LR –WPANs Standard Case Study-PHY Layer-
 MAC Layer.

Routing Protocols for Wireless Sensor Networks: Data Dissemination and

Gathering-Routing Challenges and Design Issues in Wireless Sensor
Networks-Routing Strategies in Wireless Sensor Networks- Transport
Control Protocols for Wireless Sensor Networks: Traditional Transport
4 9
Control Protocols- Transport Protocol Design Issues- Examples of Existing
Transport Control Protocols-Performance of Transport Control Protocols-
Middleware for Wireless Sensor Networks : WSN Middleware Principles-
Middleware Architecture-Existing Middleware.

Course Assessment Method

(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

Internal Internal
Assignment/
Attendance Examination-1 Examination- 2 Total
Microproject
(Written) (Written )

5 15 10 10 40

End Semester Examination Marks (ESE)

In Part A, all questions need to be answered and in Part B, each student can choose any one
full question out of two questions

Part A Part B Total

● 2 Questions from each ● Each question carries 9 marks.
module. ● Two questions will be given from each module, out
● Total of 8 Questions, each of which 1 question should be answered.
60
carrying 3 marks ● Each question can have a maximum of 3 sub
divisions.
(8x3 =24marks) (4x9 = 36 marks)
 Course Outcomes (COs)

At the end of the course students should be able to:

Bloom’s
Course Outcome Knowledge
Level (KL)
Describe the overview of wireless sensor networks and wireless sensor
CO1 K2
node architectures.
CO2 Discuss the basic Wireless Sensor Technology and its applications. K2
CO3 Explain the MAC protocols developed for WSN. K2
Describe the infrastructure, topology, routing, Challenges and Design
CO4 K2
Issues for wireless sensor networks
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create

CO-PO Mapping Table (Mapping of Course Outcomes to Program Outcomes)

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 2 2 2 2 2
CO2 3 2 1 2 2 1 2
CO3 2 2 1 1 1 2 1
CO4 2 2 1 1 1 1 1 1
Note: 1: Slight (Low), 2: Moderate (Medium), 3: Substantial (High), -: No Correlation

Text Books
SL Name of the Edition
Title of the Book Name of the Author/s
No Publisher and Year
Wireless Sensor Networks:
Kazem Sohraby, Daniel
1 Technology, John Wiley & Sons 2007
Minoli and Taieb Znati
Protocols, and Applications
 Reference Books
Name of the Name of the Edition
Sl. No Title of the Book
Author/s Publisher and Year
Protocols and Architectures for Holger Karl and
1 John Wiley & Sons 2007
Wireless Sensor Networks Andreas Willig
Handbook of Sensor
Mohammad Ilyas and
2 Networks:Compact Wireless and CRC Press
Imad MahGoub 2005
Wire Sensing System

Video Links (NPTEL, SWAYAM…)

Module No. Link ID

1 https://nptel.ac.in/courses/106/105/106105160/
2 https://onlinecourses.swayam2.ac.in/arp19_ap52/preview
3 https://cse.iitkgp.ac.in/~smisra/course/wasn.html
https://youtu.be/ycaz99NogS4?si=TemMsONNFER22HeQ,
4
https://youtu.be/PssAY3wgQqE?si=qRTYWduHXZRb4-6-
 SEMESTER S5

CMOS VLSI DESIGN

Course Code PEERT 522 CIE Marks 40

Teaching Hours/Week
3:0:0:0 ESE Marks 60
(L: T:P: R)

Credits 3 Exam Hours 2 Hrs. 30 Min.

Prerequisites (if any) None Course Type Theory

Course Objectives:

1. To understand the basic MOS inverter and its characteristics

2. To outline the performance parameters of CMOS circuits
3. To discuss the various combinational and sequential CMOS circuits
4. To explain the static and dynamic logic circuits

SYLLABUS

Module Contact
Syllabus Description
No. Hours
The MOS Inverter: Principle, Depletion and enhancement load inverters. The
basic CMOS inverter, logic threshold, Noise margins, and Dynamic
behaviour. Propagation Delay, Power Consumption, Latch-up in CMOS
1 9
circuits, Tristate inverter, Bi CMOS inverter. Performance parameters:
Static, dynamic and short circuit power dissipations; Propagation delay;
Power delay product
Combinational MOS Logic Circuits: MOS logic circuits with NMOS loads
Primitive CMOS logic gates – NOR & NAND gate, Complex Logic circuits
design –Realizing Boolean expressions using NMOS gates and CMOS gates,
2 9
AOI and OAI gates. Sequential MOS Logic Circuits: Behaviour of bi-stable
elements, SR Latch, Clocked latch and flip flop circuits, CMOS D latch and
edge triggered flip-flop.
 Static Logic Circuits: Pseudo-NMOS – Full complementary CMOS, Ratioed
logic, Pass Transistor Logic Pass Transistor Logic (PTL) families: DPTL,
3 9
CPTL - DCVS, CMOS transmission gates, Designing with Transmission
gates
Dynamic pass transistor circuits, Dynamic CMOS transmission gate logic
High performance Dynamic CMOS circuits, N-P Dynamic logic - Domino
4 9
logic - NORA logic - TSPC logic - Multiple output Domino logic - Dynamic
NORA

Course Assessment Method

(CIE: 40 marks , ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

Internal Internal
Assignment/
Attendance Examination-1 Examination- 2 Total
Microproject
(Written) (Written )

5 15 10 10 40

End Semester Examination Marks (ESE)

In Part A, all questions need to be answered and in Part B, each student can choose any one
full question out of two questions

Part A Part B Total

● 2 Questions from each ● Each question carries 9 marks.
module. ● Two questions will be given from each module, out
● Total of 8 Questions, each of which 1 question should be answered.
60
carrying 3 marks ● Each question can have a maximum of 3 sub
divisions.
(8x3 = 24marks) (4x9 = 36 marks)
 Course Outcomes (COs)

At the end of the course students should be able to:

Bloom’s
Course Outcome Knowledge
Level (KL)
CO1 Analyse CMOS Inverter characteristics K3
CO2 Explain various combinational and sequential circuits K2
CO3 Explain static logic circuits K2
CO4 Explain dynamic logic circuits K2
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create

CO-PO Mapping Table:

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

CO1 2 3 2 2 2

CO2 2 3 2 2

CO3 2 3 2 2 2

CO4 2 3 2 2 2

Text Books

Name of the Edition

Sl. No Title of the Book Name of the Author/s
Publisher and Year

CMOS Digital Integrated Sung- Mo- Kang, Yusuf

1 TATA McGraw-Hill 3e, 2003
Circuits-Analysis and Design Leblebici

CMOS VLSI Design, a Circuits Neil H. E. Weste, David

2 PEARSON 4e, 2015
and Systems Perspective Money Harris
 Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
J.M. Rabaey, A.
Digital Integrated Circuits- A
1 Chandrakasan and B. PHI 2e, 2016
Design Perspective
Nikolic

2 CMOS Logic Circuit Design John P. Uyemura Springer India Pvt. Ltd 2005

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.

1,2,3,4 https://archive.nptel.ac.in/courses/108/107/108107129/
 SEMESTER S5

SENSORS AND ACTUATORS

Course Code PCECT523 CIE Marks 40

Teaching Hours/Week
3:0:0:0 ESE Marks 60
(L: T:P: R)

Credits 3 Exam Hours 2 Hrs. 30 Min.

Prerequisites (if any) None Course Type Theory

Course Objectives:

1. The course aims to provide students with comprehensive knowledge in the principles, design,
and application of various sensors and actuators used in real-world applications..

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Introduction to Sensors and actuators: Block diagram of a closed loop
control System, Sensors and Transducers, Sensors Classification, Sensor
1 Characteristics - Transfer Function, Calibration, Span (Full Scale Input),
Full-Scale Output, Accuracy, Precision, Hysteresis, Nonlinearity, Saturation, 9
Repeatability, Dead Band, Sensitivity, Resolution.
Position and Displacement Sensors - Potentiometric Sensors, Capacitive
Sensors, LVDT, Hall Effect Sensors
Pressure Sensors -Mercury Pressure Sensor, Bellows, Membranes, and
Thin plates, Piezoresistive Sensors, Capacitive Sensors.
2 9
Force, Strain, and Tactile Sensors - Strain Gauges, Tactile Sensors - Switch
Sensors, Piezoelectric Sensors,Piezoresistive Sensors, Capacitive Touch
Sensors, Acoustic Touch Sensors, Optical Touch Sensors, Piezoelectric
Force Sensors.

Flow Sensors - Ultrasonic FlowSensors, Electromagnetic FlowSensors.

3 Temperature Sensors - Resistance Temperature Detectors, Thermistors, 9
Thermocouple.
 Proximity Sensors - PIR sensors. Ultrasonic proximity sensors.
Smart Sensors - Block Diagram, Difference between Normal Sensor &
Smart Sensor, Advantages, Disadvantages and Applications.

Actuators: - Definition- classification-Electric, Hydraulic, Pneumatic

actuators.
Hydraulic System - Physical Components and typical circuit. Hydraulic
actuators - Linear actuators, Rotary actuators - Gear motor, vane motor.
Pneumatic System - Components and typical circuit. Pneumatic Actuators
4 9
- Bellows actuator, Flapper-nozzle, Diaphragm actuators for industrial
control valves.
Electric actuators- Solenoids, Stepper motors, DC motors, DC servo
motors.
Electro-Pneumatic actuator; rotary output actuators, Linear output actuators.

Course Assessment Method

(CIE: 40 marks , ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

Internal Internal
Assignment/
Attendance Examination-1 Examination- 2 Total
Microproject
(Written) (Written )

5 15 10 10 40

End Semester Examination Marks (ESE)

 In Part A, all questions need to be answered and in Part B, each student can choose any one
full question out of two questions

Part A Part B Total

● 2 Questions from each ● Each question carries 9 marks.
module. ● Two questions will be given from each module, out
● Total of 8 Questions, each of which 1 question should be answered.
60
carrying 3 marks ● Each question can have a maximum of 3 sub
divisions.
(8x3 =24marks) (4x9 = 36 marks)

Course Outcomes (COs)

At the end of the course students should be able to:

Bloom’s
Course Outcome Knowledge
Level (KL)
CO1 Understand Sensor Fundamentals K2
Explain the basic principles and concepts of commonly used different
CO2 types of sensors, including their purpose, how they work, and the K2
various types of sensors available.
CO3 Understand the working principles of smart sensors K2
Understand the basic idea of Actuator Fundamentals and the working
CO4 K2
principle of different types of actuators.
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create

CO-PO Mapping Table:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 2 2 3 2 2
CO2 3 2 2 2 2
CO3 2 2 2 2 2
CO4 3 2 3 2 2

Text Books
 Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Fourth
1 Handbook of Modern Sensors Jacob Fraden Springer Edition,
2010
Second
2 Hydraulics and Pneumatics Andrew Parr Elsevier Science edition,
1999
Second
3 Process Control K. Krishnaswamy New Age International edition,200
9

Reference Books
Name of the Name of the Edition
Sl. No Title of the Book
Author/s Publisher and Year
Sensors and Actuators in
Taylor & Francis
1 Mechatronics, Design and Andrzej M. Pawlak 2006
Group
Applications
Mechatronic systems, Sensors
Taylor & Francis
2 and Actuators Fundamentals and Robert H. Bishop 2007
Group
Modelling
Process Control Instrumentation
3 Curtis D. Johnson Pearson/Prentice Hall 2006
Technology
4 Sensors and Transducers D. Patranabis PHI Learning 2004

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.

1 https://onlinecourses.nptel.ac.in/noc21_ee32/preview

2 https://onlinecourses.nptel.ac.in/noc21_ee32/preview
3 https://onlinecourses.nptel.ac.in/noc21_ee32/preview
4 https://onlinecourses.nptel.ac.in/noc21_ee32/preview
 SEMESTER S5
CLOUD COMPUTING

Course Code PEERT524 CIE Marks 60

Teaching Hours/Week
3:0:0:0 ESE Marks 40
(L: T:P: R)

Credits 3 Exam Hours 2 Hrs. 30 Min.

Prerequisites (if any) None Course Type Theory

Course Objectives:

1. Understand Cloud Computing Fundamentals.

2. Explore Cloud Technologies and Platforms.
3. Apply Cloud Solutions and Ensure Security.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Traditional computing- Limitations. Overview of Computing Paradigms-
Grid Computing, Cluster Computing, Distributed Computing, Utility
Computing, Cloud Computing. NIST reference Model-Basic terminology
and concepts. Cloud characteristics, benefits and challenges, Roles and
1 8
Boundaries. Cloud delivery (service) models-Infrastructure-as-a-Service
(IaaS), Platform-as-a-Service (PaaS), Software-as-a-Service (SaaS), XaaS
(Anything-as-a-service) - Cloud deployment models- Public cloud,
Community cloud, Private cloud, Hybrid cloud.
Introduction to virtualization-Virtualizing physical computing resources,
Virtual Machines (Machine virtualization), non-virtualized v/s virtualized
machine environments. Types of VMs- process VM v/s system VM,
Emulation, interpretation and binary translation. Hardware-level
2 8
virtualization- Hypervisors/VMM. Types of Hypervisors. Full Virtualization,
Para- Virtualization, Hardware-assisted virtualization, OS level
virtualization. Basics of Network Virtualization, Storage Virtualization and
Desktop Virtualization, Pros and cons of virtualization.
 Broadband networks and internet architecture- Internet Service Providers
(ISPs), Data center technology, Web technology, Multitenant technology,
Service technology. Resource provisioning techniques-static and dynamic
provisioning.
3 Open-source software platforms for private cloud-OpenStack, Cloud Stack, 8
Basics of Eucalyptus, Open Nebula, Nimbus.
Cloud Programming- Parallel Computing and Programming Paradigms. Map
Reduce – Hadoop Library from Apache, HDFS, Pig Latin High Level
Languages, Apache Spark.
Basic terms and concepts in security- Threat agents, Cloud security
threats/risks, Trust. Operating system security-Virtual machine security-
Security of virtualization- Security Risks Posed by Shared Images, Security
Risks Posed by Management OS. Infrastructure security- Network Level
Security, Host Level Security, Application level security, Security of the
Physical Systems. Identity & Access Management- Access Control.
Amazon Web Services (AWS):- AWS ecosystem- Computing services,
Amazon machine images, Elastic Compute Cloud (EC2), Advanced compute
4 12
services. Storage services-Simple Storage System (Amazon S3), Elastic
Block Store (Amazon EBS).
Google Cloud Platform:- IaaS Offerings: Compute Engine (GCE), Cloud
Storage, PaaS Offerings: Google App Engine (GAE), Storage services,
Application services, Compute services, Database Services, SaaS Offerings:
Gmail, Docs, Google Drive.
Microsoft Azure: Azure Platform Architecture, Hyper-V, Azure Virtual
Machine, Compute services, Storage services.

Course Assessment Method

(CIE: 60 marks, ESE: 40 marks)

Continuous Internal Evaluation Marks (CIE):

Internal Internal
Assignment/
Attendance Examination-1 Examination- 2 Total
Microproject
(Written) (Written)

5 30 12.5 12.5 60
 End Semester Examination Marks (ESE)

In Part A, all questions need to be answered and in Part B, each student can choose any one
full question out of two questions

Part A Part B Total

● 2 Questions from each ● Each question carries 6 marks.
module. ● Two questions will be given from each module, out
● Total of 8 Questions, each of which 1 question should be answered.
40
carrying 2 marks ● Each question can have a maximum of 3 sub
divisions.
(8x2 =16 marks) (4x6 = 24 marks)

Course Outcomes (COs)

At the end of the course students should be able to:

Bloom’s
Course Outcome Knowledge
Level (KL)
CO1 Explain the various cloud computing models and services. K2
Demonstrate the significance of implementing virtualization
CO2 techniques. K2

Explain different cloud enabling technologies and compare private

CO3 cloud platforms K2
Apply appropriate cloud programming methods to solve big data
CO4 K3
problems
Describe the need for security mechanisms in cloud and compare the
CO5 K2
different popular cloud computing platforms
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create

CO-PO Mapping Table:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 3
CO2 2 2 3 3
CO3 3 3
CO4 2 2 3 3 2 3
CO5 3 3 3 3
 Text Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Cloud Computing Concepts, Thomas, E., Zaigham M.,
1 Prentice Hall 2013
Technology &Architecture Ricardo P
Mastering cloud computing:
Buyya, R., Vecchiola, C.,
2 foundations and applications Morgan Kaufmann 2017
& Selvi, S. T.
programming
Cambridge University
3 Cloud computing Bhowmik, S 2017
Press

Reference Books
Sl. Name of the Edition
Title of the Book Name of the Publisher
No Author/s and Year
Cloud computing: theory and
1 Marinescu, D. C Morgan Kaufmann 2017
practice
Cloud computing: Principles Buyya, R., Broberg, J.,
2 John Wiley & Sons. 2011
and paradigms & Goscinski, A. M

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
1 https://archive.nptel.ac.in/courses/106/105/106105167/

2 https://onlinecourses.nptel.ac.in/noc23_cs90/preview

3 https://onlinecourses.nptel.ac.in/noc22_cs18/preview

4 https://archive.nptel.ac.in/courses/106/105/106105167/
 SEMESTER S5
PYTHON BASICS FOR MACHINE LEARNING

Course Code PEERT526 CIE Marks 40

Teaching Hours/Week
2:1:0:0 ESE Marks 60
(L: T:P: R)

Credits 3 Exam Hours 2 Hrs. 30 Min.

Prerequisites (if any) UCEST105 Course Type Theory

Course Objectives:

1. To provide foundational Python programming skills and data manipulation techniques.

2. Enabling learners to handle data, create visualizations, and apply basic machine learning
algorithms using Python.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Programming Environment and Python Basics:
Getting Started with Python Programming - interactive shell, Editing,
Saving, and Running a script. How python works? Using editors - IDLE,
Jupyter.
1 8
Basic coding skills - Working with data types, Numeric data types and
Character sets, Strings, Keywords, Variables and Assignment statement,
Operators, Expressions. Type conversions, Comments in the program. Input,
Processing, and Output. Formatting text for output.
Building Python Programs:
Data representation: List, tuple, Sets, Dictionary. Work with dates and times.
Control statements - Selection structure (if-else, switch-case), Iteration with
2 for/while loop, Testing the control statements. 9
Functions - Hiding redundancy and complexity, Arguments and return
values, Variable scopes and parameter passing, Named arguments, Main
function, Working with recursion, Lambda functions.
 Object Oriented Programming:
Design with classes - Objects and Classes, Methods, Instance Variables,
3 Constructor, Accessors and Mutators. Structuring classes with Inheritance 9
and Polymorphism. Abstract Classes, Interfaces.
Exceptions - Handle a single exception, handle multiple exceptions.
Data Processing:
The os and sys modules. Introduction to file I/O - Reading and writing text
files, Manipulating binary files.
4 NumPy - Basics, Creating arrays, Arithmetic, Slicing, Matrix Operations, 10
Random numbers. Plotting and visualization. Working with CSV files.
Pandas - Reading, Manipulating, and Processing Data. Introduction to Micro
service using Flask.

Course Assessment Method

(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

Internal Internal
Assignment/
Attendance Examination-1 Examination- 2 Total
Microproject
(Written) (Written )

5 15 10 10 40

End Semester Examination Marks (ESE)

In Part A, all questions need to be answered and in Part B, each student can choose any one
full question out of two questions

Part A Part B Total

● 2 Questions from each ● Each question carries 9 marks.
module. ● Two questions will be given from each module, out
● Total of 8 Questions, each of which 1 question should be answered.
60
carrying 3 marks ● Each question can have a maximum of 3 sub
divisions.
(8x3 =24marks) (4x9 = 36 marks)
 Course Outcomes (COs)

At the end of the course students should be able to:

Bloom’s
Course Outcome Knowledge
Level (KL)
CO1 Write, test and debug Python programs K3
Illustrate uses of conditional, and iterative statements in Python
CO2 K3
programs
Develop programs by utilizing the modules Lists, Tuples, Sets and
CO3 K3
Dictionaries in Python
CO4 Implement Object Oriented programs with exception handling K3
Write programs in Python to process data stored in files by utilizing the
CO5 K3
modules Numpy, Pandas
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create

CO-PO Mapping Table (Mapping od Course Outcomes to Program Outcomes)

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 3 3 3 3
CO2 3 3 3 3 3
CO3 3 3 3 2 3 3
CO4 3 3 3 2 3 3
CO5 3 3 3 2 3 2 3
Note: 1: Slight (Low), 2: Moderate (Medium), 3: Substantial (High), -: No Correlation

Text Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Fundamentals of Python : First
1 Kenneth A Lambert. Cengage Publishing 2/e, 2016
Programs
Shroff / O’Reilly
2 Python for Data Analysis Wes McKinney 2/e, 2017
Publishers
Flask: Building Python web Jack Stouffer, Shalabh PACKT Publishing
3 2018
services Aggarwal, Gareth Dwyer Limited
 Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
1 Learn Python 3 The Hard Way Zed A Shaw Addison-Wesley 2017
Think Python: How to Think
2 Allen B. Downey Schroff 2/e, 2016
Like a Computer Scientist
Michael Urban and Joel
3 Python Programming Shroff/Murach 2016
Murach
Addison-Wesley
4 Python Essential Reference David M.Baezly 4/e, 2009
Professional
CreateSpace
Python for Informatics:
5 Charles Severance Independent 2013
Exploring Information
Publishing Platform

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
1 https://onlinecourses.swayam2.ac.in/cec22_cs20/preview

2 https://onlinecourses.nptel.ac.in/noc22_cs32/preview

3 https://onlinecourses.nptel.ac.in/noc19_cs52/preview
 SEMESTER S5

COMPUTATIONAL FUNDAMENTALS FOR MACHINE LEARNING

Course Code PEERT525 CIE Marks 40

Teaching Hours/Week
3:0:0:0 ESE Marks 60
(L: T:P: R)

Credits 5/3 Exam Hours 2 Hrs. 30 Min.

Prerequisites (if any) None Course Type Theory

Course Objectives:

1. The purpose of this course is to introduce mathematical foundations of basic Machine

Learning concepts among learners, on which Machine Learning systems are built.
2. This course helps the learners to understand the mathematical principles in Machine Learning
and aid in the creation of new Machine Learning solutions, understand & debug existing ones,
and learn about the inherent assumptions & limitations of the current methodologies.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
LINEAR ALGEBRA: Systems of Linear Equations – Matrices, Solving
Systems of Linear Equations. Vector Spaces –Vector Spaces, Linear
Independence, Basis and Rank. Linear Mappings – Matrix Representation of
Linear Mappings, Basis Change, Image and Kernel.
1 12
OPTIMIZATION: Optimization Using Gradient Descent - Gradient Descent
with Momentum, Stochastic Gradient Descent. Constrained Optimization
and Lagrange Multipliers - Convex Optimization - Linear Programming -
Quadratic Programming.
ANALYTIC GEOMETRY, MATRIX DECOMPOSITIONS: Norms, Inner
Products, Lengths and Distances, Angles and Orthogonality, Orthonormal
2 8
Basis, Orthogonal Complement, Orthogonal Projections – Projection into
One Dimensional Subspaces, Projection onto General Subspaces, Gram-
 Schmidt Orthogonalization. Determinant and Trace, Eigenvalues and
Eigenvectors, Cholesky Decomposition, Eigen decomposition and
Diagonalization, Singular Value Decomposition, Matrix Approximation.
VECTOR CALCULUS: Differentiation of Univariate Functions - Partial
Differentiation and Gradients, Gradients of Vector Valued Functions,
Gradients of Matrices, Useful Identities for Computing Gradients. Back
3 8
propagation and Automatic Differentiation – Gradients in Deep Network,
Automatic Differentiation. Higher Order DerivativesLinearization and
Multivariate Taylor Series.
Probability and Distributions: Construction of a Probability Space - Discrete
and Continuous Probabilities, Sum Rule, Product Rule, and Bayes’ Theorem.
4 8
Summary Statistics and Independence – Gaussian Distribution - Conjugacy
and the Exponential Family - Change of Variables/Inverse Transform.

Course Assessment Method

(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

Attendance Internal exam Evaluate Analyse Total

5 15 10 10 40

Assignment: 20 Marks
Students should evaluate and analyze a real-world problem, assess the proposed solutions,
provide a conclusion on which solution is most appropriate for the problem.
Criteria for evaluation:
1. Problem Definition (K4 - 4 points)
a. Clearly defines the real-world problem.
b. Examine and identifies relevant contextual factors (constraints, resources,
objectives).
2. Problem Analysis (K4 - 4 points)
a. Break-down and presents a well-reasoned solution approach.
b. Compare and justify the proposed solutions with evidence and logical reasoning.
3. Evaluate (K5 - 4 points)
a. Thoroughly evaluate the proposed solutions.
 b. Compares trade-offs, advantages, and disadvantages.
c. Considers feasibility, scalability, and practical implications.
4. Implementation (K5 - 4 points)
a. Select the most feasible solution by implementing the proposed solutions.
b. Successfully translates the chosen solution into code.
c. Demonstrates proficiency in coding practices (readability, efficiency, error
handling).
5. Conclusion (K4- 2 points, K5 – 2 points)
a. Summarizes findings and insights. State which solution is most appropriate for the
problem. (K4)
b. Reflects critical thinking and informed decision-making. (K5)

Scoring:
1. Accomplished (4 points): Exceptional analysis, clear implementation, and depth of
understanding.
2. Competent (3 points): Solid performance with minor areas for improvement.
3. Developing (2 points): Adequate effort but lacks depth or clarity.
4. Minimal (1 point): Incomplete or significantly flawed.

End Semester Examination Marks (ESE)

In Part A, all questions need to be answered and in Part B, each student can choose any one
full question out of two questions

Part A Part B Total

 2 Questions from each  Each question carries 9 marks.
module.  Two questions will be given from each module, out
 Total of 8 Questions, each of which 1 question should be answered.
60
carrying 3 marks  Each question can have a maximum of 3 sub
divisions.
(8x3 =24marks) (4x9 = 36 marks)
 Course Outcomes (COs)

At the end of the course students should be able to:

Bloom’s
Course Outcome Knowledge
Level (KL)
Make use of the concepts, rules and results about linear equations,
CO1 matrix algebra, vector spaces, eigenvalues & eigenvectors and Apply
orthogonality & diagonalization to solve computational problems.
Perform calculus operations on functions of several variables and
CO2 Apply
matrices, including partial derivatives and gradients.
Utilize the concepts, rules and results about probability, random
variables, additive & multiplicative rules, conditional probability,
CO3 Apply
probability distributions and Bayes’ theorem to find solutions of
computational problems.
Train Machine Learning Models using unconstrained and constrained
CO4 Evaluate
optimization methods.
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create

CO-PO Mapping Table (Mapping of Course Outcomes to Program Outcomes)

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 3 3 3 3
CO2 3 3 3 3
CO3 3 3 3 3 3
CO4 3 3 3 3 3 3 3
Note: 1: Slight (Low), 2: Moderate (Medium), 3: Substantial (High), -: No Correlation

Text Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Marc Peter Deisenroth,
Mathematics for Machine Cambridge University
1 A. Aldo Faisal, and 2020
Learning Press
Cheng Soon Ong
 Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Linear Algebra and Its Cengage India Private
1 Gilbert Strang 4e/2014
Applications Limited
2 Linear Algebra Done Right Axler, Sheldon Springer 2015
Introduction to Applied Linear Stephen Boyd and Cambridge University
3 2018
Algebra Lieven Vandenberghe Press
Stephen Boyd and Cambridge University
4 Convex Optimization 2004
Lieven Vandenberghe Press
Pattern Recognition and
5 Christopher M Bishop Springer 2009
Machine Learning
Learning with Kernels –
Bernhard Scholkopf and
Support Vector Machines,
6 Smola, Alexander J MIT Press 2002
Regularization, Optimization,
Smola
and Beyond
Information Theory, Inference, Cambridge University
7 David J. C MacKay 2003
and Learning Algorithms Press
Machine Learning: A
8 Kevin P Murphy MIT Press 2012
Probabilistic Perspective
The Nature of Statistical
9 Vladimir N Vapnik Springer 2000
Learning Theory

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
1 https://archive.nptel.ac.in/courses/106/106/106106139/
 SEMESTER: S5

DIGITAL SIGNAL PROCESSING LABORATORY

Course Code PCERL 507 CIE Marks 50

Teaching Hours/Week (L: ESE Marks
0:0:3:0 50
T:P: R) (Internal only)
Credits 2 Exam Hours 2 Hrs. 30 Min.
PCERT 501 Digital
Signal Processing
Prerequisites (if any) Course Type Lab
GYEST 204
Programming in C

Course Objectives:

1. Simulate DSP algorithms using MATLAB/PYTHON/OCTAVE/SCILAB

2. Perform real time DSP computing on development boards

Expt.
Experiments
No.
PART-A
Experiments based on MATLAB/PYTHON/SCILAB/OCTAVE
(7 experiments are mandatory
1 Generation of Waveforms (Continuous and Discrete).
2 Time and Frequency Response of LTI systems (First and second order).
Linear Convolution, Circular Convolution and Linear Convolution using Circular
3
Convolution.
4 To find the DFT and IDFT for the given input sequence.
5 Linear convolution using DFT.
6 To find FFT and IFFT for the given input sequence.
7 FIR and IIR filter design using Filter Design Toolbox.
8 FIR Filter (Low-pass, High-pass and Band-pass) design (Window method).
9 IIR Filter (Low-pass, High-pass) design (Butterworth).
Part -B
 Experiments on Digital Signal Processor/ DSP kits
(3 experiments are mandatory)

1.
Generation of sine wave and standard test signals.
2. Convolution: Linear and Circular.
3. Real time FFT of the signal using a real-time input signal.
Real Time FIR Filter implementation (Low-pass, High-pass) using a real-time input
4.
Signal

Course Assessment Method

(CIE: 50 marks, ESE: 50 marks)

Continuous Internal Evaluation Marks (CIE):

Preparation/Pre-Lab Work experiments,

Viva and Timely Internal
Attendance Total
completion of Lab Reports / Record Examination
(Continuous Assessment)

5 25 20 50

End Semester Examination Marks (ESE):

Procedure/ Conduct of experiment/ Result with valid

Preparatory Execution of work/ inference/ Viva
Record Total
work/Design/ troubleshooting/ Quality of voce
Algorithm Programming Output
10 15 10 10 5 50

 Submission of Record: Students shall be allowed for the end semester examination only upon
submitting the duly certified record.

 Endorsement by External Examiner: The external examiner shall endorse the record
 Course Outcomes (COs)

At the end of the course students should be able to:

Bloom’s
Course Outcome Knowledge
Level (KL)
CO1 Simulate digital signals. K2
CO2 Understand LTI systems and its properties K2
CO3 Simulate efficient DFT algorithms and digital filters K2
CO4 Familiarize the DSP hardware and interface with computer. K2
CO5 Understand the spectrum of real time signals. K2
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create

CO- PO Mapping (Mapping of Course Outcomes with Program Outcomes)

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 3 3 3 3 1
CO2 3 3 3 3 3 1
CO3 3 3 3 3 3 1
CO4 3 3 3 3 3 1
CO5 3 3 3 3 3 1
1: Slight (Low), 2: Moderate (Medium), 3: Substantial (High), -: No Correlation

Text Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Tata McGraw Hill
Digital Signal Processing, A
1 Sanjit K. Mitra Publishing Company 2005
Practical approach
Limited
Digital signal processing using Ingle, Vinay K., and John Brooks/Cole
2 1999
MATLAB. G. Proakis Publishing Co.,
Think DSP: digital signal
3 Downey, Allen O'Reilly Media, Inc. 2016
processing in Python.
 Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Digital Signal Processing Prentice Hall India
John G Proakis, G.
1 Principles, Algorithms, Private Limited, 2007
Manolakis,
Applications Fourth Edition
Prentice Hall India
Allen V. Oppenheim,
2 Discrete time Signal Processing Private Limited, Fifth 200
Ronald W. Schafer
Edition
DSP applications using C and
3 Chassaing, Rulph John Wiley & Sons 2003
the TMS320C6x DSK.

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.

1 https://onlinecourses.nptel.ac.in/noc19_ee50/preview

2 https://onlinecourses.nptel.ac.in/noc21_ee20/preview
3 https://onlinecourses.nptel.ac.in/noc22_ee62/preview

Continuous Assessment (25 Marks)

1. Preparation and Pre-Lab Work (7 Marks)

 Pre-Lab Assignments: Assessment of pre-lab assignments or quizzes that test understanding

of the upcoming experiment.
 Understanding of Theory: Evaluation based on students’ preparation and understanding of
the theoretical background related to the experiments.

2. Conduct of Experiments (7 Marks)

 Procedure and Execution: Adherence to correct procedures, accurate execution of

experiments, and following safety protocols.
 Skill Proficiency: Proficiency in handling equipment, accuracy in observations, and
troubleshooting skills during the experiments.
  Teamwork: Collaboration and participation in group experiments.

3. Lab Reports and Record Keeping (6 Marks)

 Quality of Reports: Clarity, completeness and accuracy of lab reports. Proper documentation
of experiments, data analysis and conclusions.
 Timely Submission: Adhering to deadlines for submitting lab reports/rough record and
maintaining a well-organized fair record.

4. Viva Voce (5 Marks)

 Oral Examination: Ability to explain the experiment, results and underlying principles
during a viva voce session.

Final Marks Averaging: The final marks for preparation, conduct of experiments, viva, and record
are the average of all the specified experiments in the syllabus.

Evaluation Pattern for End Semester Examination (50 Marks)

1. Procedure/Preliminary Work/Design/Algorithm (10 Marks)

 Procedure Understanding and Description: Clarity in explaining the procedure and

understanding each step involved.
 Preliminary Work and Planning: Thoroughness in planning and organizing
materials/equipment.
 Algorithm Development: Correctness and efficiency of the algorithm related to the
experiment.
 Creativity and logic in algorithm or experimental design.

2. Conduct of Experiment/Execution of Work/Programming (15 Marks)

 Setup and Execution: Proper setup and accurate execution of the experiment or
programming task.

3. Result with Valid Inference/Quality of Output (10 Marks)

 Accuracy of Results: Precision and correctness of the obtained results.

 Analysis and Interpretation: Validity of inferences drawn from the experiment or quality of
program output.
4. Viva Voce (10 Marks)

 Ability to explain the experiment, procedure results and answer related questions
 Proficiency in answering questions related to theoretical and practical aspects of the subject.

5. Record (5 Marks)

 Completeness, clarity, and accuracy of the lab record submitted

 SEMESTER S5

DATABASE MANAGEMENT SYSTEMS LAB

Course Code PCERL508 CIE Marks 50

Teaching Hours/Week
0:0:3:0 ESE Marks 50
(L: T:P: R)
Credits 2 Exam Hours 2 Hrs. 30 Min.
PBERT504 Database
Prerequisites (if any) Course Type Lab
Management Systems

Course Objectives:

1. Enable students to design, create, and manage databases using practical tools.
2. Equip students with the skills to write and execute SQL queries for various database
operations.
3. Introduce students to NoSQL databases and Big Data technologies like MongoDB for
handling large datasets
Details of Experiment

Expt. No Experiment
1 Design a database schema for an application with ER diagram from a problem description
2 Creation, modification, configuration, and deletion of databases using UI and SQL
Commands
3 Creation of database schema - DDL (create tables, set constraints, enforce relationships,
create indices, delete and modify tables)
4 Database initialization - Data insert, Data import to a database
5 Practice SQL commands for DML (insertion, updating, altering, deletion of data, and
viewing/querying records based on condition in databases)
6 Implementation of built-in functions in RDBMS
7 Implementation of various aggregate functions in SQL
8 Implementation of Order By, Group By & Having clause
9 Implementation of set operators nested queries, and join queries
10 Practice of SQL TCL commands like Rollback, Commit, Save point
11 Practice of SQL DCL commands for granting and revoking user privileges
 12 Practice of SQL commands for creation of views and assertions
13 Implementation of various control structures like IF-THEN, IF-THEN-ELSE, IF-THEN-
ELSIF, CASE, WHILE using PL/SQL
14 Creation of Procedures, Triggers and Functions
15 Creation of Packages
16 Creation of Cursors
17 Familiarization of NoSQL Databases and CRUD operations
18 Design a database application using any front-end tool for any problem selected. The
application constructed should have five or more tables

Course Assessment Method (CIE: 50 Marks, ESE 50 Marks)

Continuous Internal Evaluation Marks (CIE):

Preparation/Pre-Lab Work, experiments, Viva and

Internal
Attendance Timely completion of Lab Reports / Record. Total
Exam
(Continuous Assessment)
5 25 20 50

End Semester Examination Marks (ESE):

Procedure/ Result with

Conduct of experiment/
Preparatory valid inference/ Viva
Execution of work/ Record Total
work/Design/ Quality of voce
troubleshooting/ Programming
Algorithm Output
10 15 10 10 5 50

Mandatory requirements for ESE:

 Submission of Record: Students shall be allowed for the end semester examination only upon
submitting the duly certified record.

 Endorsement by External Examiner: The external examiner shall endorse the record.
 Course Outcomes (COs)

At the end of the course the student will be able to:

Bloom’s
Course Outcome Knowledge
Level (KL)
Design database schema for a given real world problem-domain using standard
CO1 K3
design and modeling approaches.
Construct queries using SQL for database creation, interaction, modification,
CO2 K3
and updation.
CO3 Design and implement triggers and cursors. K3
CO4 Implement procedures, functions, and control structures using PL/SQL. K3
CO5 Perform CRUD operations in NoSQL Databases. K6
K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create

CO-PO Mapping Table

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 3 3 3 2 2 2
CO2 3 2 3 3 2 2 2
CO3 3 2 2 2 2 2 2 2
CO4 3 2 2 2 2 2 2 2
CO5 3 2 2 2 2 2 2
1: Slight (Low),2: Moderate (Medium),3: Substantial (High), : No Correlation

Text Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Database Systems: Models, Elmasri R. and S.
Pearson Education
1 Languages, Design and Navathe 6/e, 2013
Application Programming
Sliberschatz A,
2 Database System Concepts McGraw Hill 6/e, 2011
H.F.Korth and Sudarshan
 Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
NoSQL Data Models: Trends
1 Wiley 2018
and Challenge
2 NoSQL for Dummies John Wiley & Sons 2015

Video Links (NPTEL, SWAYAM…)

Sl. No. Link ID
1 https://nptel.ac.in/courses/106105175
2 https://www.coursera.org/learn/sql-data-science
3 https://www.udemy.com/course/database-normalization-simplified
4 https://archive.nptel.ac.in/courses/106/104/106104135/

Continuous Assessment (25 Marks)

1. Preparation and Pre-Lab Work (7 Marks)

 Pre-Lab Assignments: Assessment of pre-lab assignments or quizzes that test understanding of

the upcoming experiment.

 Understanding of Theory: Evaluation based on students’ preparation and understanding of the

theoretical background related to the experiments.

2. Conduct of Experiments (7 Marks)

 Procedure and Execution: Adherence to correct procedures, accurate execution of experiments,

and following safety protocols.

 Skill Proficiency: Proficiency in handling equipment, accuracy in observations, and

troubleshooting skills during the experiments.

 Teamwork: Collaboration and participation in group experiments.

3. Lab Reports and Record Keeping (6 Marks)

 Quality of Reports: Clarity, completeness and accuracy of lab reports. Proper documentation of
experiments, data analysis and conclusions.
  Timely Submission: Adhering to deadlines for submitting lab reports/rough record and
maintaining a well-organized fair record.

4. Viva Voce (5 Marks)

 Oral Examination: Ability to explain the experiment, results and underlying principles during a
viva voce session.

Final Marks Averaging: The final marks for preparation, conduct of experiments, viva, and
record are the average of all the specified experiments in the syllabus.

Evaluation Pattern for End Semester Examination (50 Marks)

1. Procedure/Preliminary Work/Design/Algorithm (10 Marks)

 Procedure Understanding and Description: Clarity in explaining the procedure and understanding
each step involved.

 Preliminary Work and Planning: Thoroughness in planning and organizing materials/equipment.

 Algorithm Development: Correctness and efficiency of the algorithm related to the experiment.

 Creativity and logic in algorithm or experimental design.

2. Conduct of Experiment/Execution of Work/Programming (15 Marks)

 Setup and Execution: Proper setup and accurate execution of the experiment or programming
task.

3. Result with Valid Inference/Quality of Output (10 Marks)

 Accuracy of Results: Precision and correctness of the obtained results.

 Analysis and Interpretation: Validity of inferences drawn from the experiment or quality of
program output.

4. Viva Voce (10 Marks)

 Ability to explain the experiment, procedure results and answer related questions
 Proficiency in answering questions related to theoretical and practical aspects of the subject.

5. Record (5 Marks)

 Completeness, clarity, and accuracy of the lab record submitted

 SEMESTER 6
ELECTRONICS & COMPUTER
ENGINEERING
 SEMESTER S6

OPERATING SYSTEMS

Course Code PCERT601 CIE Marks 40

Teaching Hours/Week
3:1:0:0 ESE Marks 60
(L: T:P: R)

Credits 4 Exam Hours 2 Hrs. 30 Min.

Prerequisites (if any) GYEST204, PCCST302 Course Type PC

Course Objectives:

1. Gain a comprehensive understanding of the basic functionalities, structure and components of

modern operating systems.
2. Gain proficiency in tasks such as process creation, synchronization, and deadlock handling.
3. Understand the trade-offs involved in choosing between different scheduling algorithms,
memory management strategies, and file system structures.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Introduction: Operating system overview – Operations, Functions,
Service – System calls, Types – Operating System structure - Simple
structure, Layered approach, Microkernel, Modules– System boot
process.
1 11
Processes - Process states, Process control block, threads, scheduling,
Operations on processes - process creation and termination – Inter-
process communication - shared memory systems, Message passing
systems.

Process Scheduling – Basic concepts- Scheduling criteria -scheduling

algorithms- First come First Served, Shortest Job First, Priority
scheduling, Round robin scheduling.
2 12
Deadlocks: Necessary conditions, Resource allocation graphs,
Deadlock prevention, Deadlock avoidance – Banker’s algorithms,
Deadlock detection, Recovery from deadlock.
 Process synchronization- Race conditions – Critical section problem –
Peterson’s solution, Synchronization hardware, Mutex Locks,
3 9
Semaphores, Classic Synchronization problems - Producer Consumer,
Dining Philosophers and Readers-Writers.
Memory Management: Concept of address spaces, Swapping,
Contiguous memory allocation, fixed and variable partitions,
Segmentation, Paging. Virtual memory, Demand paging, Page
replacement algorithms.
4 File System: File concept - Attributes, Operations, types, structure – 12
Access methods, Protection. File-system implementation, Directory
implementation. Allocation methods.
Storage Management: Magnetic disks, Solid-state disks, Disk
Structure, Disk scheduling, Disk formatting.

Course Assessment Method

(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

Internal
Internal Examination- 2
Attendance Assignment Examination-1 Total
(Written )
(Written)
5 15 10 10 40
End Semester Examination Marks (ESE)

In Part A, all questions need to be answered and in Part B, each student can choose any one
full question out of two questions

Part A Part B Total

 2 Questions from each  Each question carries 9 marks.
module.  Two questions will be given from each module, out of
 Total of 8 Questions, each which 1 question should be answered.
60
carrying 3 marks  Each question can have a maximum of 3 sub
divisions.
(8x3 =24marks) (4x9 = 36 marks)
 Course Outcomes (COs)

At the end of the course students should be able to:

Bloom’s
Course Outcome Knowledge
Level (KL)

Explain the relevance, structure and functions of Operating Systems in

CO1 computingdevices along with the concepts of process management mechanisms K2
employed in Operating Systems.(Cognitive knowledge: Understand)
Illustrate the mechanisms for process scheduling and deadlock handling.
CO2 K3
(Cognitive knowledge: Apply)
Explain the tools and mechanisms for process synchronization in Operating
CO3 K2
Systems (Cognitive knowledge: Understand)
Elaborate on memory management and storage management techniques in
CO4 K3
Operating Systems. (Cognitive knowledge: Apply)
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create

CO-PO Mapping Table:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 2 2 1 - - - - - - 2 - 1
CO2 3 3 3 3 - - - - - 2 - 2
CO3 3 3 2 2 - - - - - 2 - 2
CO4 3 3 3 3 - - - - - 2 - 2

Text Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year

Operating System Abraham Silberschatz, Peter 9th

1 Wiley India
Concepts Baer Galvin, Greg Gagne, Edition,
2015
 Reference Books
Sl. Name of the Name of the Edition and
Title of the Book
No Author/s Publisher Year

1 Modern Operating Systems Andrew S Tanenbaum, Prentice Hall 4th Edition,

2015

6th Edition,
2 Operating systems William Stallings, Pearson, Global Edition 2015.

Garry Nutt, Nabendu Pearson

3 Operating Systems Chaki, Sarmistha Education. 3rd Edition
Neogy,
Operating Systems 2nd Edition,
4 D.M.Dhamdhere, Tata McGraw Hill
2011.

Operating Systems Sibsankar Haldar, Alex

5 Pearson Education 2010
A Aravind,

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
1 https://archive.nptel.ac.in/courses/106/105/106105214/

2 https://nptel.ac.in/courses/106106144

3 https://onlinecourses.nptel.ac.in/noc20_cs04/preview

4 https://nptel.ac.in/courses/106105214
 SEMESTER S6

DATA COMMUNICATION AND NETWORKING

Course Code PCERT602 CIE Marks 40

Teaching Hours/Week
3:0:0:0 ESE Marks 60
(L: T:P: R)

Credits 3 Exam Hours 2 Hrs. 30 Min.

Prerequisites (if any) PCERT403 Course Type Theory

Course Objectives:

1. To analyze data transmission methods, error control mechanisms, and congestion

management techniques in networking.
2. To understand the fundamental principles of data communication and networking protocols,
including OSI and TCP/IP architectures.

SYLLABUS
Module Contact
Syllabus Description
No. Hours
A data communication model-data communication - data communications
networking - protocol architecture - the need for a protocol architecture - a

1 simple protocol architecture - OSI – TCP/IP protocol architecture. Data 8

transmission - Concepts and terminology - Analog and Digital data
transmission-Transmission Impairments – channel capacity
Digital data, Digital signals & analog signals – analog data, digital signals
and analog signals. Asynchronous and synchronous transmission -Types of
2 8
Error -Error Detection -Error Correction. Data link Control -Flow control-
Error Control-HDLC.
FDM – Synchronous TDM – statistical TDM – Asymmetric DSL – xDSL.
Circuit Switching and packet switching: switching networks - circuit
switching networks - circuit switching concepts - control signaling - soft
3 10
switch architecture-Packet switching principles-X.25-Frame Relay. Routing
in Switched Networks: routing in circuit switched network – routing in
packet switched network – least cost algorithms.
 Effect of congestion - Congestion control - Traffic management - Congestion
control in packet switching networks - Frame Relay congestion control.
Local Area Network: LAN protocol architecture – bridges – layer2 and

4 layer3 switches. High speed LANs: the emergence of High-speed LAN’s – 10

Ethernet – token ring – fibre channel. Transport protocol: connection-
oriented transport protocol mechanisms - TCP – TCP – congestion control -
UDP.

Course Assessment Method

(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

Internal Internal
Assignment/
Attendance Examination-1 Examination- 2 Total
Microproject
(Written) (Written)

5 15 10 10 40

End Semester Examination Marks (ESE)

In Part A, all questions need to be answered and in Part B, each student can choose any one
full question out of two questions

Part A Part B Total

● 2 Questions from each ● Each question carries 9 marks.
module. ● Two questions will be given from each module, out
● Total of 8 Questions, each of which 1 question should be answered.
60
carrying 3 marks ● Each question can have a maximum of 3 sub
divisions.
(8x3 =24marks) (4x9 = 36 marks)
 Course Outcomes (COs)

At the end of the course students should be able to:

Bloom’s
Course Outcome Knowledge
Level (KL)
Understand data communication and networking using the layered
CO1 concept, Open System Interconnect (OSI) and the TCP/IP Model. K2
(Cognitive Knowledge: Understand)
Illustrate various types of encoding techniques and error detection
CO2 K2
methods used in networks. (Cognitive Knowledge: Understand)
Use the concept of multiplexing, switching and routing in networks.
CO3 K3
(Cognitive Knowledge: Apply)
Discuss the working principles of LAN and the concepts behind
CO4 K2
congestion in networks. (Cognitive Knowledge: Understand)
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create

CO-PO Mapping Table (Mapping of Course Outcomes to Program Outcomes)

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 2 3 1 2 1
CO2 2 2 3 2
CO3 2 3 2 1 2
CO4 2 3 3 2
Note: 1: Slight (Low), 2: Moderate (Medium), 3: Substantial (High), -: No Correlation

Text Books

Name of the Edition

Sl. No Title of the Book Name of the Author/s
Publisher and Year
1 Data and Computer
William Stallings Pearson Education 9/e, 2013
Communication

2 PHI (Prentice Hall

Computer Networks Andrew S. Tanenbaum 5/e, 2013
India)
 Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Data Communication and
1 Behrouz A Forouzan Tata McGraw Hill 5/e,2013
Networking
Computer Networks – A Larry L Peterson and
2 Morgan Kaufmann. 5/e,2011
Systems Approach Bruce S Dave
Computer Networking and the
3 Fred Halsall Addison-Wesley. 5/e,2005
Internet

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
1 https://nptel.ac.in/courses/106105183

2 https://nptel.ac.in/courses/106105082

3 https://nptel.ac.in/courses/117105148

4 https://onlinecourses.nptel.ac.in/noc22_ee61/preview
 SEMESTER S6
NETWORK AND LINEAR CONTROL SYSTEMS

Course Code PEERT631 CIE Marks 40

Teaching Hours/Week
2:1:0:0 ESE Marks 60
(L: T:P: R)

Credits 3 Exam Hours 2 Hrs. 30 Min.

Prerequisites (if any) None Course Type Theory

Course Objectives:

1. This course aims to develop the skills for mathematical modelling and analysis of linear
control systems.
SYLLABUS
Module Contact
Syllabus Description
No. Hours
Introduction to Electrical Circuits
Circuit concept – Types of elements - source transformation-voltage - current
relationship for passive elements. Network reduction techniques: series,
parallel, series parallel, examples, time and frequency domain analysis of
RLC circuits.
1 11
Introduction to control systems
Basic components of a control system, types of control systems, examples of
control systems, effect of feedback systems, Laplace Transforms, transfer
function, modelling of electrical networks, block diagram reduction, signal
flow graphs.
Modelling of mechanical systems
Translational and rotational systems, transfer function for typical mechanical
2 7
systems, analogous systems–force voltage & force-current analogy, impulse
response and its relation with transfer function
Time domain analysis of feedback control systems
Transient and steady-state response, standard test signals, type and order of
systems, concept of poles and zeros, time response of first and second order
3 9
systems to unit i mpul s e an d step input, time domain specifications,
Steady-state response, steady state error, static and dynamic error
coefficients.
 Stability of linear control systems
Concept of stability, methods of determining stability, Routh’s Hurwitz
criterion, Root locus - construction of root locus, effect of addition of poles
and zeros on root locus.
4 9
Frequency response analysis: Frequency domain specifications, stability
from Bode plots, relative stability, gain margin and phase margin,
introduction to lead, lag and lead-lag compensating networks (excluding
design).

Course Assessment Method

(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

Internal Internal
Assignment/
Attendance Examination-1 Examination- 2 Total
Microproject
(Written) (Written)

5 15 10 10 40

End Semester Examination Marks (ESE)

In Part A, all questions need to be answered and in Part B, each student can choose any one
full question out of two questions

Part A Part B Total

 2 Questions from each  Each question carries 9 marks.
module.  Two questions will be given from each module, out of
 Total of 8 Questions, each which 1 question should be answered.
60
carrying 3 marks  Each question can have a maximum of 3 sub
divisions.
(8x3 =24marks) (4x9 = 36 marks)
 Course Outcomes (COs)

At the end of the course students should be able to:

Bloom’s
Course Outcome Knowledge
Level (KL)
Analysis and modelling of mechanical systems using translational and
CO1 rotational systems, along with the understanding of force voltage & K3
force-current analogy.
Implementing techniques to ensure the stability of linear control

CO2 systems; using the Routh’s Hurwitz criterion, Root locus method and K3
frequency response analysis.
Understand and model control systems using Laplace Transforms and
CO3 transfer functions to analyze electrical networks and control systems K3
structures.
Apply poles and zeros concept, analyze first and second order systems,

CO4 and compute static and dynamic error coefficients within time domain K3
analysis of feedback control systems.
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create

CO-PO Mapping Table (Mapping od Course Outcomes to Program Outcomes)

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 3 3
CO2 3 3 3
CO3 3 3 3 3
CO4 3 3 3
Note: 1: Slight (Low), 2: Moderate (Medium), 3: Substantial (High), -: No Correlation

Text Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
1 Network Analysis and McGraw Hill
Ravish R. Singh 2/e, 2019
Synthesis Education
2 Farid Golnaraghi,
Automatic Control Systems Wiley India 9/e, 2014
Benjamin C. Kuo
3 McGraw Hill
Control Systems M. Gopal 4/e, 2012
Education India
 Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year

1 Control System Engineering Norman S. Nise Wiley India 5/e, 2015

Richard C Dorf and

2 Modern Control Systems Pearson Education 13/e, 2016
Robert H. Bishop

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
1 https://archive.nptel.ac.in/courses/108/104/108104139/

2 https://nptel.ac.in/courses/107106081

3 https://nptel.ac.in/courses/107106081

4 https://nptel.ac.in/courses/107106081
 SEMESTER S6

MICRO-ELECTRO-MECHANICAL SYSTEMS

Course Code PEERT632 CIE Marks 40

Teaching Hours/Week
3:0:0:0 ESE Marks 60
(L: T:P: R)

Credits 3 Exam Hours 2 Hrs. 30 Min.

Prerequisites (if any) Nil Course Type PE

Course Objectives:

1. Acquire a thorough understanding of MEMS products, microfabrication evolution, and

multidisciplinary applications including micro sensors and actuators.
2. Gain proficiency in MEMS material selection, fabrication techniques, and microsystem
packaging design considerations.
SYLLABUS

Module Contact
Syllabus Description
No. Hours

MEMS and Microsystems: Typical MEMS and microsystem products –

Evolution of Microfabrication - Microsystem and microelectronics -

1 Multidisciplinary nature of MEMS – Applications of Microsystems in 9

Automotive Industry - Principles and examples of Micro sensors and micro
actuators – micro accelerometer, Micro grippers, micro motors, micro
valves, micro pumps.
Actuation and Sensing techniques: Actuation using Thermal forces,
Actuation using Shape Memory Alloys, Actuation using Piezoelectric
2 crystals, actuation using Electrostatic forces; Microsensors - Acoustic wave 8

sensors, Biomedical sensors and biosensors, chemical sensors, pressure

sensors, optical sensors - microfluidics.

Engineering science for Microsystem design - Atomic structure of Matter -

3 Ions & ionization - Molecular Theory of matter & Intermolecular forces - 9

Doping of semiconductors - Diffusion process - Electrochemistry - Quantum
physics. Materials for MEMS and Microsystems - Substrate and wafer -
 Silicon as substrate Material - Silicon compounds - Silicon peizoresistors -
Gallium Arsenide - Quartz - Peizoelectric crystals - Polymers.

Overview of Microsystem fabrication – Photolithography – Ion implantation-

Diffusion – Oxidation – Chemical vapour deposition – Etching. Overview of
4 Micro manufacturing – Bulk micro manufacturing, Surface micro machining 8
, LIGA process. Micro system Packaging: general considerations in
packaging design – Levels of Micro system packaging.

Course Assessment Method

(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

Internal Internal Examination-

Assignment/
Attendance Examination-1 2 Total
Microproject
(Written) (Written )

5 15 10 10 40

End Semester Examination Marks (ESE)

In Part A, all questions need to be answered and in Part B, each student can choose any one
full question out of two questions

Part A Part B Total

 2 Questions from each  Each question carries 9 marks.
module.  Two questions will be given from each module, out
 Total of 8 Questions, each of which 1 question should be answered.
60
carrying 3 marks  Each question can have a maximum of 3 sub
divisions.
(8x3 =24marks) (4x9 = 36 marks)
 Course Outcomes (COs)

At the end of the course students should be able to:

Bloom’s
Course Outcome Knowledge
Level (KL)
CO1 Understand the basic concepts of MEMS and microsystem products. K2
CO2 Understand the working principles of micro sensors and actuators. K2
CO3 Identify the typical materials used for fabrication of micro systems. K2
Illustrate the various methods in microsystem fabrication and micro
CO4 K2
manufacturing.
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create

CO-PO Mapping Table:

PO31 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12

CO1 3 2 3

CO2 3 2 3

CO3 3 2 1 3

CO4 3 2 1 3

Text Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
MEMS and Microsystems
1 Design, Manufacture and Tai-Ran Hsu, Wiley 2nd , 2020
Nanoscale Engineering

2 Foundations of MEMS Chang Liu Pearson 2nd , 2012

3 Microsystem Design Stephen D Senturia Springer 3rd, 2013

 Reference Books
Name of the Name of the Edition
Sl. No Title of the Book
Author/s Publisher and Year
1 Silicon VLSI Technology James D Plummer Prentice Hall 4th, 2012
Nitaigur Premchand
2 MEMS Tata Mc Graw Hill 2013
Mahalik
Micro and Nano Fabrication:
3 Hans H. Gatzen Springer 2015
Tools and Processes

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
NPTEL course : “MEMS & Microsystems” by Prof. Santiram Kal, Video Lecture No: 5,
1 MEMS materials
https://archive.nptel.ac.in/courses/117/105/117105082/
NPTEL course: “MEMS & Microsystems” by Prof. Santiram Kal, Video Lecture No: 13,
2 Surface & Quartz Micromachining.
https://archive.nptel.ac.in/courses/117/105/117105082/
 SEMESTER S6

FOUNDATIONS OF DATA SCIENCE

Course Code PEERT 633 CIE Marks 40

Teaching Hours/Week
3:1:0:0 ESE Marks 60
(L: T:P: R)

Credits 4/3 Exam Hours 2 Hrs. 30 Min.

Prerequisites (if any) None Course Type Theory

Course Objectives:

1. To understand the data science fundamentals and process.

2. To learn to describe the data for the data science process.

SYLLABUS
Module Contact
Syllabus Description
No. Hours
Introduction to Data Science: Facets of data – structured, unstructured-
semi structured data & patterns, Importance of data Science - History of Data
Science -Need for Data Science, Steps in Data Science Process, Components
of Data Science, Tools and skills needed - Differences between AI, ML, DL,
1 7
Data Science & Data Analytics, Real world applications of data science-
Simple case study based on real life applications such as - Market research
case, tracking disease outbreaks, business predictions, (for example, Rating a
product design).
Data Preprocessing: Need to preprocess the data- Major Tasks in Data
Preprocessing, Data cleaning - Missing Values Noisy Data- Data Cleaning as
2 8
a Process, Data Integration, Data Reduction, Data Transformation and Data
Discretization
Classification Models: Classification - Basic Concepts, K-Nearest-

3 Neighbour Classifiers, Decision Tree Induction (ID3 algorithm), Naïve 8

Bayesian Classification, Support Vector Machines
Mining Frequent Patterns, Associations, and Correlations: Basic
Concepts Frequent Itemset - Apriori Algorithm - Generating Association
4 9
Rules from Frequent Itemsets
Clustering: Partitioning methods- k-Means clustering, Hierarchical
 Methods- Agglomerative versus Divisive Hierarchical Clustering- Distance
Measures in Algorithmic Methods, Density-Based Methods -DBSCAN

Course Assessment Method

(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

Internal Internal
Assignment/
Attendance Examination-1 Examination- 2 Total
Microproject
(Written) (Written )

5 15 10 10 40

End Semester Examination Marks (ESE)

In Part A, all questions need to be answered and in Part B, each student can choose any one
full question out of two questions

Part A Part B Total

 2 Questions from each  Each question carries 9 marks.
module.  Two questions will be given from each module, out
 Total of 8 Questions, each of which 1 question should be answered.
60
carrying 3 marks  Each question can have a maximum of 3 sub
divisions.
(8x3 =24marks) (4x9 = 36 marks)

Course Outcomes (COs)

At the end of the course students should be able to:

Bloom’s
Course Outcome Knowledge
Level (KL)

CO1 Understand the basic principles and concepts of data science. K2

CO2 Pre-process and explore datasets to extract meaningful insights. K3

CO3 Illustrate the concepts of classification methods K3

Perform association mining and analyze clusters using different
CO4 K3
methods
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create
 CO-PO Mapping Table (Mapping od Course Outcomes to Program Outcomes)

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 2 3 - - 3 - - - - - - 2
CO2 3 2 1 3 2 - - - - - - 3
CO3 3 2 2 2 2 - - - - - - 3
CO4 3 2 1 2 2 - - - - - - 3
Note: 1: Slight (Low), 2: Moderate (Medium), 3: Substantial (High), -: No Correlation

Text Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Sanjeev J. Wagh,
1 Fundamentals of Data Science Manisha S. Bhende, and CRC press 1e, 2022
Anuradha D. Thakare
Data mining Concepts and Jiawei Han, Michelin Morgan Kaufmann
2 3e, 2012
Techniques Kamber, Jian Pei Publishers

Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
1 Data Mining Techniques Arun K. Pujari Universities Press 2001
Foster Provost, Tom
2 Data Science for Business O’Reilly Media 1e, 2013
Fawcett

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
https://archive.nptel.ac.in/courses/106/106/106106179/
1
https://www.youtube.com/watch?v=XohgKT13FKY
2 https://archive.nptel.ac.in/courses/106/105/106105174/
https://archive.nptel.ac.in/courses/106/105/106105174/
3
https://www.youtube.com/playlist?list=PLw5h0DiJ-9PCn4shW4X43FSjEqdBwc1Cn
4 https://archive.nptel.ac.in/courses/106/105/106105174/
 SEMESTER S6
COMPILER DESIGN

Course Code PEERT634 CIE Marks 40

Teaching Hours/Week
3:0:0:0 ESE Marks 60
(L: T:P: R)
Credits 3 Exam Hours 2 Hrs. 30 Min.
Prerequisites (if any) PCERT502 Course Type Theory

Course Objectives:

1. To understand the structure and functionality of compilers, including lexical and syntax
analysis, parsing techniques, and code optimization strategies.
2. To learn about implementing various phases of a compiler, from lexical analysis to code
generation.

SYLLABUS
Module Contact
Syllabus Description
No. Hours

Analysis of the source program - Analysis and synthesis phases, Phases of a

1 compiler. Lexical Analysis - Role of Lexical Analyzer, Input Buffering, 9
Specification of Tokens, Recognition of Tokens.

Role of the Syntax Analyser. Review of Context Free Grammars -Derivation

and Parse Trees. Basic parsing approaches - Eliminating left recursion, left
2 9
factoring. Top-Down Parsing - Recursive Descent parsing, Predictive
Parsing,LL(1) Grammars.
Handle Pruning. Shift Reduce parsing. LR parsing - Constructing SLR,
LALR and canonical LR parsing tables.
3 Syntax directed translation - Syntax directed definitions, S-attributed 9
definitions, L-attributed definitions, Storage organization, Storage-allocation
strategies.
Intermediate code generation- Intermediate languages, Graphical
representations, Three-Address code, Quadruples, Triples.
4 Code Optimization - Principal sources of optimization, Local and global 9
optimizations. Code generation - Issues in the design of a code generator,
Target Language, A simple code generator.
 Course Assessment Method
(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

Internal Internal
Assignment/
Attendance Examination-1 Examination- 2 Total
Microproject
(Written) (Written)

5 15 10 10 40

End Semester Examination Marks (ESE)

In Part A, all questions need to be answered and in Part B, each student can choose any one
full question out of two questions

Part A Part B Total

 2 Questions from each  Each question carries 9 marks.
module.  Two questions will be given from each module, out
 Total of 8 Questions, each of which 1 question should be answered.
60
carrying 3 marks  Each question can have a maximum of 3 sub
divisions.
(8x3 =24marks) (4x9 = 36 marks)

Course Outcomes (COs)

At the end of the course students should be able to:

Bloom’s
Course Outcome Knowledge
Level (KL)
Describe the phases in the compilation process (lexical analysis, syntax
CO1 analysis, semantic analysis, intermediate code generation, code K3
optimization, and code generation) and model a lexical analyzer.
Describe the role of the syntax analyzer, review context-free
CO2 grammars, and apply basic parsing approaches including top-down K3
parsing techniques and LL (1) grammars.
Illustrate handle pruning, shift-reduce parsing, LR parsing with SLR,
CO3 LALR, and canonical LR tables, and apply syntax-directed translation K3
concepts.
demonstrate intermediate code generation techniques, including
intermediate languages and three-address code, as well as discuss code
CO4 K3
optimization strategies and the issues involved in code generation and
design.
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create
 CO-PO Mapping Table:

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

CO1 3 3 3 1 3 3

CO2 3 3 3 2 3 3

CO3 3 3 3 2 3 3

CO4 3 3 3 1 3

Text Books

Name of the Edition

Sl. No Title of the Book Name of the Author/s
Publisher and Year

Compilers – Principles Aho A.V., Ravi Sethi and

1 Addison Wesley 2006
Techniques and Tools D. Ullman.

Reference Books

Name of the Edition

Sl. No Title of the Book Name of the Author/s
Publisher and Year
System Programming and Tata McGraw Hill &
1 D.M.Dhamdhere 1996
Operating Systems Company

Compiler Construction – Cengage Learning 2006

2 Kenneth C. Louden
Principles and Practice Indian Edition

The Theory and Practice of Tata McGraw Hill& 1984

3 Tremblay and Sorenson
Compiler Writing Company

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
1 https://archive.nptel.ac.in/courses/106/105/106105190/

2 https://archive.nptel.ac.in/courses/106/105/106105190/

3 https://archive.nptel.ac.in/courses/106/105/106105190/

4 https://archive.nptel.ac.in/courses/106/105/106105190/
 SEMESTER 6

ALGORITHM ANALYSIS & DESIGN

Course Code PEERT636 CIE Marks 40

Teaching Hours/Week
3:0:0:0 ESE Marks 60
(L: T:P: R)

Credits 3 Exam Hours 2 Hrs. 30 Min.

Prerequisites (if any) PCERT302 Course Type Theory

Course Objectives:

1. To introduce the concepts of Algorithm Analysis, Time Complexity, Space Complexity.

2. To discuss various Algorithm Design Strategies with proper illustrative examples.

SYLLABUS
Module Contact
Syllabus Description
No. Hours
Characteristics of Algorithms, Criteria for Analysing Algorithms, Time and
Space Complexity - Best, Worst and Average Case Complexities,
Asymptotic Notations - Big-Oh (O), Big- Omega (Ω), Big-Theta (Θ), Little-
1 oh (o) and Little- Omega (ω) and their properties. 9
Analysis of Recursive Algorithms: Recurrence Equations, Solving
Recurrence Equations – Iteration Method, Recursion Tree Method,
Substitution method and Master’s Theorem (Proof not required).
Self-Balancing Tree - AVL Trees (Insertion and deletion operations with all
rotations in detail, algorithms not expected); DFS and BFS traversals -
2 9
Analysis, Strongly Connected Components of a Directed graph, Topological
Sorting.
The Control Abstraction of Divide and Conquer- 2-way Merge sort,
Strassen’s Algorithm for Matrix Multiplication-Analysis. The Control
3 Abstraction of Greedy Strategy- Fractional Knapsack Problem, Minimum 9
Cost Spanning Tree Computation- Kruskal’s Algorithms - Analysis, Single
Source Shortest Path Algorithm - Dijkstra’s Algorithm-Analysis.

The Control Abstraction- The Optimality Principle- Matrix Chain

4 Multiplication-Analysis, All Pairs Shortest Path Algorithm - Floyd-Warshall 9
Algorithm-Analysis. The Control Abstraction of Back Tracking – The N
 Queen’s Problem. Branch and Bound Algorithm for Travelling Salesman
Problem.
Introduction to Complexity Theory - Tractable and Intractable Problems,
Complexity Classes – P, NP, NP- Hard and NP-Complete Classes

Course Assessment Method

(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

Internal Internal Examination-

Assignment/
Attendance Examination-1 2 Total
Microproject
(Written) (Written)

5 15 10 10 40

End Semester Examination Marks (ESE)

In Part A, all questions need to be answered and in Part B, each student can choose any one
full question out of two questions

Part A Part B Total

● 2 Questions from each ● Each question carries 9 marks.
module. ● Two questions will be given from each module, out of
● Total of 8 Questions, each which 1 question should be answered.
60
carrying 3 marks ● Each question can have a maximum of 3 sub divisions.
(4x9 = 36 marks)
(8x3 =24marks)
 Course Outcomes (COs)

At the end of the course students should be able to:

Bloom’s
Course Outcome Knowledge
Level (KL)
Evaluate the efficiency of algorithms using asymptotic notations, solve

CO1 recurrence relations for recursive algorithms, and apply these concepts K3
to optimize algorithmic solutions.
Implement AVL trees, perform DFS and BFS traversals, analyze
CO2 strongly connected components of directed graphs, and apply K3
topological sorting.
Implement divide and conquer algorithms, apply greedy strategies, and
CO3 K3
evaluate shortest path solutions.
Apply dynamic programming, backtracking, and branch and bound
CO4 K3
techniques, and understand complexity theory concepts.
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create

CO-PO Mapping Table:

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

Text Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year

Ellis Horowitz, SartajSahni, Universities

1 Computer Algorithms 2007
Sanguthevar Rajasekaran Press

Thomas H. Cormen,
Charles E. Leiserson,
2 Introduction to Algorithms MIT Press 2009
Ronald L. Rivest, Clifford
Stein
 Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Alfred V. Aho, John E.
The Design and Analysis of
1 Hopcroft and Jeffrey D. Pearson Education 1999
Computer Algorithms
Ullman
Introduction to the Design and
2 Anany Levitin, Pearson 3/e, 2011
Analysis of Algorithms
Gilles Brassard, Paul
3 Fundamentals ofAlgorithmics Pearson Education 1995
Bratley

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
1 https://archive.nptel.ac.in/courses/106/106/106106131/

2 https://archive.nptel.ac.in/courses/106/106/106106131/

3 https://archive.nptel.ac.in/courses/106/106/106106131/

4 https://archive.nptel.ac.in/courses/106/106/106106131/
 SEMESTER S6
DESIGN AND ANALYSIS OF ALGORITHMS

Course Code PEERT 635 CIE Marks 40

Teaching Hours/Week
3-0-0-0 ESE Marks 60
(L: T:P: R)

Credits 5/3 Exam Hours 2 Hrs. 30 Min.

Prerequisites (if any) None Course Type Theory

Course Objectives:

1. To introduce the concepts of Algorithm Analysis, Time Complexity, Space Complexity.

2. To discuss various Algorithm Design Strategies with proper illustrative examples.
3. To introduce Complexity Theory.

SYLLABUS
Module Contact
Syllabus Description
No. Hours
Introduction to Algorithm - Analysis Time and Space Complexity
Elementary operations and Computation of Time Complexity Best, worst
and Average Case Complexities- Complexity Calculation of simple
1 6
algorithms.
Recurrence Equations - Solution of Recurrence Equations – Iteration Method
and Recursion Tree Methods.
Master’s Theorem (Proof not required) – examples, Asymptotic Notations
and their properties- Application of Asymptotic Notations in Algorithm
Analysis- Common Complexity Functions.
2 8
AVL Trees – rotations, Red-Black Trees insertion and deletion (Techniques
only; algorithms not expected). B-Trees – insertion and deletion operations.
Sets- Union and find operations on disjoint sets.
 Graphs – DFS and BFS traversals, complexity, Spanning trees – Minimum
Cost Spanning Trees, single source shortest path algorithms, Topological
sorting, strongly connected components.
Divide and Conquer - The Control Abstraction, 2-way Merge sort, Strassen’s

3 Matrix Multiplication, Analysis. 10

Dynamic Programming - The control Abstraction- The Optimality Principle-
Optimal matrix multiplication, Bellman-Ford Algorithm.
Analysis, Comparison of Divide and Conquer and Dynamic Programming
strategies.
Greedy Strategy - The Control Abstraction- the Fractional Knapsack
Problem, Minimal Cost Spanning Tree Computation- Prim’s Algorithm –
Kruskal’s Algorithm Back Tracking -The Control Abstraction – The N
Queen’s Problem, 0/1 Knapsack Problem
4 12
Branch and Bound: Travelling Salesman Problem. Introduction to
Complexity Theory - Tractable and Intractable Problems- The P and NP
Classes- Polynomial Time Reductions - The NP- Hard and NP-Complete
Classes.

Course Assessment Method

(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

Attendance Internal Ex Evaluate Analyse Total

5 15 10 10 40

Criteria for Evaluation (Evaluate and Analyse): 20 marks

Assignment: 20 Marks

Students should design and implement a real-world application using object-oriented programming
principles, evaluate and refine their class structures and relationships, provide a conclusion on the
effectiveness of their design, and demonstrate the functionality of their application using Java.

Criteria for evaluation:

1. Problem Definition (K4 - 4 points)
. Clearly defines the real-world problem.
a. Examine and identifies relevant contextual factors (constraints, resources, objectives).
 2. Problem Analysis (K4 - 4 points)
. Break-down and presents a well-reasoned solution approach.
. Compare and justify the proposed solutions with evidence and logical reasoning.
2. Evaluate (K5 - 4 points)
. Thoroughly evaluate the proposed solutions.
. Compares trade-offs, advantages, and disadvantages.
. Considers feasibility, scalability, and practical implications.
2. Implementation (K5 - 4 points)
. Select the most feasible solution by implementing the proposed solutions.
. Successfully translates the chosen solution into code.
. Demonstrates proficiency in coding practices (readability, efficiency, error handling).
2. Conclusion (K4- 2 points, K5 – 2 points)
. Summarizes findings and insights. State which solution is most appropriate for the
problem. (K4)
. Reflects critical thinking and informed decision-making. (K5)
Scoring:
1. Accomplished (4 points): Exceptional analysis, clear implementation, and depth of
understanding.
2. Competent (3 points): Solid performance with minor areas for improvement.
3. Developing (2 points): Adequate effort but lacks depth or clarity.
4. Minimal (1 point): Incomplete or significantly flawed.

End Semester Examination Marks (ESE):

In Part A, all questions need to be answered and in Part B, each student can choose any one full
question out of two questions

Part A Part B Total

●2 Questions from each  2 questions will be given from each
module. module, out of which 1 question should be
● Total of 8 Questions, each answered. Each question can have a
60
carrying 3 marks maximum of 3 sub divisions. Each question
(8x3 =24marks) carries 9 marks.
(4x9 = 36 marks)
 Course Outcomes (COs)

At the end of the course students should be able to:

Bloom’s
Course Outcome Knowledge
Level (KL)
Analyze any given algorithm and express its time and space
CO1 K4
complexities in asymptotic notations.
Derive recurrence equations and solve it using Iteration, Recurrence
CO2 Tree, Substitution and Master’s Method to compute time complexity of K3
algorithms.
Analyze and compare the functionality and applications of various
CO3 graph traversal algorithms, and critically evaluate the structure and K4
performance of advanced data structures
Demonstrate Divide-and-conquer, Greedy Strategy, Dynamic
CO4 programming, Branch-and Bound and Backtracking algorithm design K3
techniques.
Classify a problem as computationally tractable or intractable, and
CO5 K2
discuss strategies to address intractability.
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create

CO-PO Mapping Table (Mapping of Course Outcomes to Program Outcomes)

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 2 3 2 2 2
CO2 2 3 2 2 1
CO3 1 2 2 2 2
CO4 2 3 3 2 3
CO5 1 2 3 1
Note: 1: Slight (Low), 2: Moderate (Medium), 3: Substantial (High), -: No Correlation
 Text Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Ellis Horowitz,
1 Computer Algorithms SartajSahni, Sanguthevar Universities Press 2007
Rajasekaran
Thomas H. Cormen,
Introduction to Charles E. Leiserson,
2 MIT Press 2009
Algorithms Ronald L. Rivest, Clifford
Stein

Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Alfred V. Aho, John E.
The Design and Analysis of
1 Hopcroft and Jeffrey D. Pearson Education 1999
Computer Algorithms
Ullman
Introduction to the Design and
2 Anany Levitin Pearson 3/e, 2011
Analysis of Algorithms
Gilles Brassard, Paul
3 Fundamentals of Algorithmics Pearson Education 1995
Bratley
Foundations of Algorithms Richard E. Neapolitan, Jones and Bartlett
4 2/e, 1997
using C++ Psuedocode Kumarss Naimipour Publishers, Inc

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
1 https://archive.nptel.ac.in/courses/106/106/106106131/

2 https://archive.nptel.ac.in/courses/106/106/106106131/

3 https://archive.nptel.ac.in/courses/106/106/106106131/

4 https://archive.nptel.ac.in/courses/106/106/106106131/
 SEMESTER S6

EMBEDDED SYSTEMS AND IOT

Course Code PBERT 604 CIE Marks 60

Teaching Hours/Week
3:0:0:1 ESE Marks 40
(L: T:P: R)

Credits 4 Exam Hours 2 Hrs. 30 Min.

Prerequisites (if any) None Course Type Theory

Course Objectives:

1. To give students a thorough understanding of designing embedded and internet of things

systems for a range of applications
2. Expertise in the design and analysis of IOT and embedded systems

SYLLABUS

Module Contact
Syllabus Description
No. Hours

Introduction to Embedded Systems and IoT

Introduction to Embedded Systems:- Desirable features and general
characteristics of Embedded Systems -Comparison: Microcontroller Vs
Microprocessors - Model of Embedded Systems.
Introduction to IoT:- Evolution and enabling technologies of IoT -
1 Complex Interdependence of Technologies - IoT Networking
Components and Addressing Strategies. 9
Basics of Networking:- Network Types and Layered Network Models -
Addressing and TCP/IP Transport Layer.
Project Task: Create a basic embedded system using a microcontroller,
establish simple networking, and demonstrate data transfer over the network.

Embedded Systems & IoT - Sensors, Actuators, and Processing

2 Sensors:- Sensor Characteristics, Sensorial Deviations, and Sensing
9
Types - Sensing Considerations.
 Actuators:- Actuator Types and Characteristics.
IoT Processing:- IoT Processing Topologies and Types - Data Format
and Importance of Processing in IoT - Device Design and Selection
Considerations - Processing Offloading.
Project Task: Develop an IoT device integrating sensors and actuators with
processing capabilities.

IoT Connectivity and Communication Technologies

IoT Connectivity Technologies:- Overview of IEEE 802.15.4, Zigbee,
ISA100.11A, Wireless HART, RFID, NFC, Z-Wave, Weightless, LoRa,
NB-IoT, Wi-Fi, Bluetooth.
3 IoT Communication Technologies:- Infrastructure Protocols - 9
Discovery Protocols - Data Protocols - Identification Protocols - Device
Management - Semantic Protocols.
Project Task: Implement connectivity and communication protocols for an
IoT device.

Developing IoT Applications with Arduino/NodeMCU

Arduino Platform:- Hardware features and Arduino IDE - Interfacing
LEDs, switches, and LCDs
NodeMCU Platform:- Hardware features and programming with
Arduino IDE - Interfacing sensors and actuators with NodeMCU.
4 Introduction to Raspberry Pi - Raspberry Pi hardware details -
9
installing OS in Raspberry Pi
IoT Physical Servers and Cloud Offerings:- Overview of AWS IoT,
Microsoft Azure IoT, and Blynk.
Project Task: Build comprehensive IoT applications using various
platforms.
Suggestion on Project Topics

Course Assessment Method

(CIE: 60 marks, ESE: 40 marks)

Continuous Internal Evaluation Marks (CIE):

Attendance Project Internal Ex-1 Internal Ex-2 Total

5 30 12.5 12.5 60

End Semester Examination Marks (ESE)

In Part A, all questions need to be answered and in Part B, each student can choose any one
full question out of two questions

Part A Part B Total

 2 Questions from each  2 questions will be given from each module,
module. out of which 1 question should be answered.
 Total of 8 Questions, Each question can have a maximum of 2 sub 40
each carrying 2 marks divisions. Each question carries 6 marks.
(8x2 =16 marks) (4x6 = 24 marks)
Course Outcomes (COs)

At the end of the course students should be able to:

Bloom’s
Course Outcome Knowledge
Level (KL)

CO1 Understand the basics of embedded systems, IoT and networking. K2

CO2 Illustrate various sensors and actuators for embedded systems and IoT. K2
Apply the understanding of IoT requirements and constrains to select the
CO3 suitable IoT connectivity and communication technologies for specific IoT K3
applications.
CO4 Illustrate various IoT physical servers and cloud offerings. K2
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create
 CO-PO Mapping Table:

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

CO1 3 3

CO2 2 2 3

CO3 2 2 2 2 3

CO4 2 3

Text Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
First
Sudip Misra, Anandarup Cambridge University
1 Introduction to IoT edition,
Mukherjee, Arijit Roy Press
2021

Arduino Cookbook: Recipes to 3rd edition,

2 Begin, Expand, and Enhance Michael Margolis O’Reilly Media
2020
Your Projects
Rajesh Singh, Anita

Internet Of Things With Gehlot, Lovi Raj 1st Edition,

3 CRC press
Raspberry Pi And Arduino Gupta,Bhupendra Singh, 2019
and Mahendra Swain

NodeMCU ESP8266
Communication Methods and Amazon Media EU S.à
4 Manoj R. Thakur 2018
Protocols _ Programming with r.l.

Arduino IDE
 Reference Books
Edition
Sl. Name of the Name of the
Title of the Book and
No Author/s Publisher
Year
Arshdeep Bahga,
1 Internet of Things_ A Hands-On approach Vijay Madisetti

https://docs.aws.amazon.com/whitepapers/latest/aws-
2
overview/introduction.html

3 https://azure.microsoft.com/en-us/explore

4 https://docs.blynk.io/en/

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
1 https://nptel.ac.in/courses/128108016

2 https://nptel.ac.in/courses/128108016

3 https://nptel.ac.in/courses/128108016

4 https://nptel.ac.in/courses/128108016
 PBL Course Elements

L: Lecture R: Project (1 Hr.), 2 Faculty Members

(3 Hrs.) Tutorial Practical Presentation

Simulation/
Laboratory Work/ Presentation
Lecture delivery Project identification Workshops (Progress and Final
Presentations)

Group discussion Project Analysis Data Collection Evaluation

Question answer
Project Milestone Reviews,
Sessions/ Analytical thinking and
Testing Feedback,
Brainstorming self-learning
Project reformation (If required)
Sessions

Poster Presentation/
Guest Speakers Case Study/ Field Survey Video Presentation: Students
Prototyping
(Industry Experts) Report present their results in a 2 to 5
minutes video

Assessment and Evaluation for Project Activity

Allotted
Sl. No Evaluation for
Marks

1 Project Planning and Proposal 5

Contribution in Progress Presentations and Question Answer 4

2
Sessions

3 Involvement in the project work and Team Work 3

4 Execution and Implementation 10

5 Final Presentations 5

6 Project Quality, Innovation and Creativity 3

Total 30
 1. Project Planning and Proposal (5 Marks)

 Clarity and feasibility of the project plan

 Research and background understanding
 Defined objectives and methodology

2. Contribution in Progress Presentation and Question Answer Sessions (4 Marks)

 Individual contribution to the presentation

 Effectiveness in answering questions and handling feedback

3. Involvement in the Project Work and Team Work (3 Marks)

 Active participation and individual contribution

 Teamwork and collaboration

4. Execution and Implementation (10 Marks)

 Adherence to the project timeline and milestones

 Application of theoretical knowledge and problem-solving
 Final Result

5. Final Presentation (5 Marks)

 Quality and clarity of the overall presentation

 Individual contribution to the presentation
 Effectiveness in answering questions

6. Project Quality, Innovation, and Creativity (3 Marks)

 Overall quality and technical excellence of the project

 Innovation and originality in the project

Creativity in solutions and approaches

 SEMESTER S6

BASICS OF ANAOLG AND DIGITAL COMMUNICATION

Course Code OEERT 611 CIE Marks 40

Teaching Hours/Week
3:0:0:0 ESE Marks 60
(L: T:P: R)

Credits 3 Exam Hours 2 Hrs. 30 Min.

Prerequisites (if any) None Course Type Theory

Course Objectives:

1. To understand the main components and principles of analog and digital communication
systems.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Introduction, Elements of communication systems, Amplitude modulation
(AM), Double-side band suppressed carrier (DSB-SC) modulation Single
sideband modulation (SSB) – spectrum, power, efficiency of all the three
1 9
variants. (Study of only tone modulation in DSB-SC, AM, and SSB.)
Amplitude-modulator implementations –balanced modulator. AM
demodulators -. Envelope detector.
Frequency modulation – modulation index, frequency deviation, average
power, spectrum of tone modulated FM, bandwidth of FM, Narrow band FM
2 9
and wide-band FM. FM generation: Varactor diode modulator, Armstrongs
method. FM demodulation – slope detection.
Elements of digital communication system. Sources, channels and receivers.
Sampling theorem. Sampling and reconstruction. Pulse code modulation.
3 Sampling, quantization and encoding. Differential PCM, adaptive PCM, 9
Delta modulator and adaptive delta modulator. Issues in delta modulation.
Slope overload.
 Digital modulation schemes. Baseband BPSK system and the signal
constellation. BPSK transmitter and receiver. Base band QPSK system and
4 9
Signal constellations. Plots of BER Vs SNR (Analysis not required). QPSK
transmitter and receiver. Quadrature amplitude modulation.

Course Assessment Method

(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

Internal Internal
Assignment/
Attendance Examination-1 Examination- 2 Total
Microproject
(Written) (Written)

5 15 10 10 40

End Semester Examination Marks (ESE)

In Part A, all questions need to be answered and in Part B, each student can choose any one
full question out of two questions

Part A Part B Total

 2 Questions from each  Each question carries 9 marks.

module.  Two questions will be given from each module, out
 Total of 8 Questions, each of which 1 question should be answered.
60
carrying 3 marks  Each question can have a maximum of 3 sub
divisions.
(8x3 =24marks) (4x9 = 36 marks)
 Course Outcomes (COs)

At the end of the course students should be able to:

Bloom’s
Course Outcome Knowledge
Level (KL)
Explain the main components in analog and digital communication
CO1 K2
systems.
CO2 Understand the different analog modulation schemes. K2

CO3 Illustrate the main principles of pulse code modulation. K2

CO4 Understand different digital modulation schemes. K2

Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create

CO-PO Mapping Table (Mapping of Course Outcomes to Program Outcomes)

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 3
CO2 3 2 3
CO3 3 2 3
CO4 3 2 3
Note: 1: Slight (Low), 2: Moderate (Medium), 3: Substantial (High), -: No Correlation

Text Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Electronic Communication Fourth
1 Kennedy, Davis TATA McGraw-Hill
Systems Edition
Electronic Communication
Fifth
2 Systems – Fundamentals Wayne Tomasi Pearson
edition
through Advanced
Fourth
3 Communication Systems Simon Haykin Wiley
edition
 Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Digital and Analog Eighth
1 Leon W. Couch Prentice Hall
Communication Systems edition
Digital Communications:
Third
2 Fundamentals and Sklar Pearson.
edition
Applications

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
1 https://youtu.be/S8Jod9AtpN4
2 https://youtu.be/jqJpbPseX2c
3 https://youtu.be/l_SqkcP6hZ4
4 https://youtu.be/ZW1glqkIgcw?si=zJ_ijYp7t6uh9WHx
 SEMESTER S6

ROBOTICS AND AUTOMATION

Course Code OEERT 612 CIE Marks 40

Teaching Hours/Week
3:0:0:0 ESE Marks 60
(L: T:P: R)

Credits 3 Exam Hours 2 Hrs. 30 Min.

Prerequisites (if any) None Course Type Open Elective I

Course Objectives:

1. Aims to provide students with a comprehensive understanding of robotics and their wide-
ranging applications.
2. Aims to provide students with a detailed understanding of sensor and actuator technologies in
robotics.
3. Aims to equip students with a thorough understanding of robotic configurations, and the
classification, selection, and design of end effectors and their operational criteria.
4. Aims to provide students with a comprehensive understanding of robotic coordinate systems,
transformations, and control techniques.

SYLLABUS

Module Contact
Syllabus Description
No. Hours

Introduction To Robotics:
Definitions- Robots, Robotics; Types of Robots- Manipulators, Mobile
Robots-wheeled & Legged Robots, Aerial Robots; Anatomy of a robotic

1 manipulator-wrist configurations, links, joints, open kinematic vs closed 9

kinematic chain; degrees of freedom;
Robot Applications- medical, mining, space, defence, security, domestic,
entertainment, Industrial Applications-Material handling, welding, Spray
painting, Machining.
Sensors and Actuators:
2 Sensor classification- touch, force, proximity, vision sensors. Internal 9
sensors-Position sensors, velocity sensors, acceleration sensors, Force
 sensors; External sensors-contact type, noncontact type; Vision - Elements of
vision sensor, image acquisition, image processing; Selection of sensors.
Actuators for robots- classification-Electric, Hydraulic, Pneumatic actuators;
their advantages and disadvantages; Electric actuators- Stepper motors, DC
motors, DC servo motors, AC motors, Hydraulic actuators- Components and
typical circuit, advantages and disadvantages; Pneumatic Actuators-
Components and typical circuit, advantages and disadvantages.
Robotic configurations and End effectors: Robot configurations-PPP,
RPP, RRP, RRR; features of SCARA, PUMA Robots; Robot considerations
for an application- number of axes, work volume, capacity & speed, stroke

3 &reach, Repeatability, Precision and Accuracy, Operating environment, 9

point to point control or continuous path control.
Classification of End effectors - mechanical grippers, special tools, Magnetic
grippers, Vacuum grippers, adhesive grippers, Active and passive grippers,
selection and design considerations of grippers in robot.
Kinematics and Control of Robots:
Robot Coordinate Systems- Matrix representation of a point, vector, frame
and a rigid body in space, Representation of transformations-translation,

4 Fundamental and composite rotations, homogeneous transformations, 9

combined transformations, D-H representation.
Control Techniques- Transfer function and state space representation,
Performance and stability of feedback control, PID control of a single link
manipulator, selection of PID controller gains.

Course Assessment Method

(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

Internal Internal
Assignment/
Attendance Examination-1 Examination- 2 Total
Microproject
(Written) (Written )

10 10 10 10 40
 End Semester Examination Marks (ESE)

In Part A, all questions need to be answered and in Part B, each student can choose any one
full question out of two questions

Part A Part B Total

 2 Questions from each  Each question carries 9 marks.
module.  Two questions will be given from each module, out
 Total of 8 Questions, each of which 1 question should be answered.
60
carrying 3 marks  Each question can have a maximum of 3 sub
divisions.
(8x3 =24marks) (4x9 = 36 marks)

Course Outcomes (COs)

At the end of the course students should be able to:

Bloom’s
Course Outcome Knowledge
Level (KL)

CO1 Familiarise with anatomy, specifications and applications of Robots. K2

CO2 Choose the appropriate sensors and actuators for robots. K2
Choose appropriate Robotic configuration and gripper for a particular
CO3 K2
application.
Obtain kinematic model of robotic manipulators and design the
CO4 K3
controller for robotic manipulators
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create

CO-PO Mapping Table:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 2 1 3
CO2 2 1 3
CO3 2 1 3
CO4 3 2 2 3
 Text Books
Name of the Name of the Edition
Sl. No Title of the Book
Author/s Publisher and Year
Tata McGraw Hill 2nd Edition,
1 Introduction to Robotics S. K. Saha,
Education Pvt. Ltd., 2008
Fundamentals of robotics – Dorling Kindersley
2 Robert. J. Schilling 2006.
Analysis and control (India) Pvt Ltd
Introduction to Robotics: 3rd Edition,
3 John J. Craig, Pearson Publishers
Mechanics and Control 2008
Introduction to Robotics: 3rd Edition,
4 Saeed B. Niku Wiely Publishers
Analysis, Systems, Applications 2020
R K Mittal and I J Tata McGraw Hill, 1st Edition,
5 Robotics and Control
Nagrath, New Delhi 2003
th
Introduction to measurements 4 Edition,
6 Arun K Ghosh PHI Learning
and Instrumentation 2012
th
I.J Nagrath & New Age International 7 Edition,
7 Control Systems Engineering
M. Gopal Publishers 2021

Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Mark W. Spong, Seth
2nd Edition
1 Robot Modeling and Control Hutchinson, M. Wiley (India),
2020.
Vidyasagar

Narosa Publishing 1st Edition,

2 Fundamentals of Robotics D.K. Pratihar
House, New-Delhi 2017

K.S. Fu, R.C. Gonzalez, McGraw-Hill Book

3 Robotics 1987
C.S.G. Lee Company

Robotics Technology and

McGraw Hill Education 2nd Edition
4 Flexible Automation, Second S. R. Deb
(India) Private Limited 2010.
Edition,

Cenage Learning India 2nd Edition

5 Control Systems Les Fenical
Pvt. Ltd. 2011.

Robotics: A Very Short Oxford University

6 Alan Winfield 2012
Introduction Press
 Video Links (NPTEL, SWAYAM…)
Module
Link ID
No.
Robotics, Prof. D. K Pratihar, IIT Kharagpur
https://onlinecourses.nptel.ac.in/noc24_me88/preview
1
Industrial Robotics: Theories for implementation, Prof. Arun Dayal Udai IIT (ISM Dhanbad)
https://onlinecourses.nptel.ac.in/noc24_me117/preview

Robotics, Prof. D. K Pratihar, IIT Kharagpur

https://onlinecourses.nptel.ac.in/noc24_me88/preview
2
Industrial Robotics: Theories for implementation, Prof. Arun Dayal Udai IIT (ISM Dhanbad)
https://onlinecourses.nptel.ac.in/noc24_me117/preview

Robotics, Prof. D. K Pratihar, IIT Kharagpur

https://onlinecourses.nptel.ac.in/noc24_me88/preview
3
Industrial Robotics: Theories for implementation, Prof. Arun Dayal Udai IIT (ISM Dhanbad)
https://onlinecourses.nptel.ac.in/noc24_me117/preview

Robotics, Prof. D. K Pratihar, IIT Kharagpur

https://onlinecourses.nptel.ac.in/noc24_me88/preview
4
Industrial Robotics: Theories for implementation, Prof. Arun Dayal Udai IIT (ISM Dhanbad)
https://onlinecourses.nptel.ac.in/noc24_me117/preview
 SEMESTER SN6

OBJECT ORIENTED CONCEPTS

Course Code OEERT613 CIE Marks 40

Teaching Hours/Week
3:0:0:0 ESE Marks 60
(L: T:P: R)

Credits 3 Exam Hours 2 Hrs. 30 Min.

Prerequisites (if any) GBEST204 Course Type Theory

Course Objectives:

1. Understand and apply foundational object-oriented programming concepts in Java, including

classes, objects, inheritance, polymorphism, encapsulation, and abstraction.
2. Design and implement Java applications that leverage OOP principles to achieve modularity,
reusability, and scalability in software development

SYLLABUS
Module Contact
Syllabus Description
No. Hours
Basic Object-Oriented concepts, Introduction to Java - Java programming
and Runtime Environment, Development Platforms- Java Virtual Machine
(JVM), Java compiler, Bytecode, Java Buzzwords, Java program structure,
Comments.Primitive Data types - Integers, Floating Point Types, Characters,
1 9
Boolean. Literals, Operators - Arithmetic Operators, Bitwise Operators,
Relational Operators, Boolean Logical Operators, Assignment Operator,
Conditional (Ternary) Operator, Operator Precedence. Control Statements -
Selection Statements, Iteration Statements and Jump Statements.
Object Oriented Programming in Java - Class Fundamentals, Declaring
Objects, Introduction to Methods, Constructors, this Keyword, Method
Overloading, Using Objects as Parameters, Returning Objects. Static
Members, Final Variables, Inner Classes.Inheritance - Super Class, Sub
2 9
Class, The Keyword super, protected Members, Calling Order of
Constructors, Method Overriding, the Object class, Abstract Classes and
Methods, using final with Inheritance.Packages and Interfaces - Defining
Package, CLASSPATH, Access Protection, Importing Packages, Interfaces.
 Exception Handling - Checked Exceptions, Unchecked Exceptions, try Block
and catch Clause, Multiple catch Clauses, Nested try Statements, throw,
throws and finally. Java Library - String Handling – String Constructors,
String Length, Special String Operations -Character Extraction, String
3 9
Comparison, Searching Strings, Modifying Strings.Multithreaded
Programming - The Java Thread Model, The Main Thread, Creating Thread,
Creating Multiple Threads, Synchronization, Suspending, Resuming and
Stopping Threads.
Event handling - Event Handling Mechanisms, Delegation Event Model,
Event Classes, Sources of Events, Event Listener Interfaces.Swings
fundamentals-Swing Controls, Components and Containers, Swing
4 Packages, Event Handling in Swings, Swing Layout Managers, Exploring 9
Swings –JFrame, JLabel , Swing Buttons, JText Field.Java Database
Connectivity (JDBC) - JDBC overview, Creating and Executing Queries –
create table, delete, insert, select.

Course Assessment Method

(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

Internal Internal
Assignment/ Examination-1 Examination- 2
Attendance Total
Microproject
(Written) (Written )

5 15 10 10 40

End Semester Examination Marks (ESE)

In Part A, all questions need to be answered and in Part B, each student can choose any one
full question out of two questions

Part A Part B Total

 2 Questions from each  Each question carries 9 marks.

module.  Two questions will be given from each module, out
 Total of 8 Questions, each of which 1 question should be answered.
carrying 3 marks  Each question can have a maximum of 3 sub 60
divisions.
(4x9 = 36 marks)
(8x3 =24marks)
 Course Outcomes (COs)

At the end of the course students should be able to:

Bloom’s
Course Outcome Knowledge
Level (KL)
Understand and apply fundamental Java programming concepts,
including the runtime environment, primitive data types, operators, and
CO1 K2
control statements, to develop efficient and well-structured Java
applications.

Apply key object-oriented programming principles in Java, leveraging

CO2 packages and interfaces effectively to design and implement Java K3
applications.

Confidently handle Java exceptions, manipulate strings effectively, and

CO3 K3
implement multithreaded programming techniques.

Develop Java applications that integrate event handling, Swing-based

CO4 graphical user interfaces, and JDBC database connectivity to create K3
robust and user-friendly software solutions.

Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create

CO-PO Mapping Table:

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

CO1 3 3 3 2

CO2 3 3 3 2

CO3 3 3 3 2 2

CO4 3 3 3 2 2
 Text Books

Name of the Name of the Edition

Sl. No Title of the Book
Author/s Publisher and Year

1 Java: The Complete reference Herbert Schildt Tata McGraw Hill 8/e, 2011

Java How to Program, Early Paul Deitel, Harvey

2 Pearson 11/e, 2018
Objects Deitel

Reference Books

Name of the Name of the Edition and

Sl. No Title of the Book
Author/s Publisher Year

1 Introduction to Java Programming Y. Daniel Liang Pearson 7/e, 2013

2 Programming JAVA a Primer Balagurusamy E Tata McGraw Hill 5/e, 2014
3 Core Java: An Integrated Approach Nageswararao R Dreamtech Press 2008

4 Java in A Nutshell Flanagan D O'Reilly 5/e,2005

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.

1 https://archive.nptel.ac.in/courses/106/105/106105191/
2 https://archive.nptel.ac.in/courses/106/105/106105191/
3 https://archive.nptel.ac.in/courses/106/105/106105191/
4 https://archive.nptel.ac.in/courses/106/105/106105191/
 SEMESTER S6

INTERNET OF THINGS

Course Code OEERT614 CIE Marks 40

Teaching Hours/Week
3:0:0:0 ESE Marks 60
(L: T:P: R)

Credits 3 Exam Hours 2 Hrs. 30 Min.

Prerequisites (if any) None Course Type Theory

Course Objectives:

1. This course aims to introduce IoT fundamentals.

SYLLABUS
Module Contact
Syllabus Description
No. Hours
Introduction to IoT technology: Definitions of IoT, Characteristics of IoT
devices – power, computational constraints, IoT Architectural view –
Middleware based architecture, Service oriented architecture, M2M

1 Communication and IoT, Typical application areas of IoT technology (case

studies of at least four domains) - Energy management and Smart grid, IoT 9
for Home, Cities, Environment monitoring, Agriculture, Supply chain and
customer monitoring
Components of IoT technology: Identification/Addressing - Electronic
Product Codes, RFID, ubiquitous code, IPv4, IPv6. Sensors and Actuators*.

2 IoT Hardware**, IoT Software – overview of Operating systems, Firmware,

Middle ware, Application software used in IoT. Connectivity for IoT devices 9
– characteristics.
 Communication technologies for IoT : Zigbee - key features, architecture,
limitations, Bluetooth technology - bluetooth stack, piconet, scatternet,
limitations, Bluetooth Low Energy (key features, architecture, limitations),
Wifi (IEEE 802.11) technology – key features, limitations, Cellular
3 9
technology – GSM, 3G, 4GLTE (overview), features, limitations, LoRa
technology – features, LoRaWAN architecture, 6LoWPAN – features,
protocol stack, Narrow Band (NB- IoT) – features, applications, Sigfox –
features, applications
IoT Data Management : Storage technologies for IoT hardware – Volatile,
Non-volatile, Embedded (MTP/OTP), external flash (NAND/NOR), DRAM,
eflash, UFS, eMMC (overview of technologies). Cloud and IoT, Cloud
computing – architecture, advantages of cloud computing, Software as a
4
Service (SaaS), Platform as a Service (PaaS), Infrastructure as a Service 9
(IaaS). Case study of commercial cloud computing platforms like - Microsoft
Azure IoT Suite, Google Cloud's IoT Platform, IBM Watson IoT Platform.
IoT analytics

Course Assessment Method

(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

Internal Internal
Assignment/
Attendance Examination-1 Examination- 2 Total
Microproject
(Written) (Written )

5 15 10 10 40

End Semester Examination Marks (ESE)

In Part A, all questions need to be answered and in Part B, each student can choose any one
full question out of two questions

Part A Part B Total

● 2 Questions from each ● Each question carries 9 marks.
module. ● Two questions will be given from each module, out
● Total of 8 Questions, each of which 1 question should be answered.
60
carrying 3 marks ● Each question can have a maximum of 3 sub
divisions.
(8x3 =24marks) (4x9 = 36 marks)
 Course Outcomes (COs)

At the end of the course students should be able to:

Bloom’s
Course Outcome Knowledge
Level (KL)
CO1 Explain in a concise manner the architecture of IoT K2

CO2 Identify various hardware and software components used in IoT K3

CO3 Discuss the various communication technologies and interfaces in IoT K2

Describe the usage of modern technologies like cloud computing for K2
CO4
data management in IoT
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create

CO-PO Mapping Table (Mapping od Course Outcomes to Program Outcomes)

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 2 2 2 2
CO2 3 2 2 2 2
CO3 3 2 2 1 2
CO4 3 2 2 1 2
Note: 1: Slight (Low), 2: Moderate (Medium), 3: Substantial (High), -: No Correlation

Text Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Internet of Things : McGraw Hill (India) 2nd
1 Architecture and Design Rajkamal Private Limited.
Principles” edition,2022

Orient Blackswan 1st

“Internet of Things (A Hands- Vijay Madisetti and
2 Private Limited - New Edition,2015
on- Approach)” Arshdeep Bahga
Delhi
 Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Internet of things: A survey on
IEEE Communications
1 enabling technologies, Al-Fuqaha
Surveys & Tutorials
2015
protocols, and applications
The MIT Press
March 20,
2 The Internet of Things Samuel Greengard Essential Knowledge
2015
series Paperback
The Internet of Things:
Converging Technologies for Ovidu Vermesan and 1st Edition,
3 Smart Environments and Peter Friess
River Publishers
2013
Integrated Ecosystems
Internet of Things - From
Peter Friess, Ovidiu 1st
4 Research and Innovation to River Publishers
Vermesan Edition,2014
Market Deployment

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
https://youtu.be/WUYAjxnwjU4?si=s58W-NKMrEQMaJ8m
1
https://youtu.be/BXDxYh1EV2w?si=8oFtQB9vycC_c-t2
https://youtu.be/z3VEZPwl5gA?si=tNuzG_By-KBU3ks_
2 https://youtu.be/SXz0XR68dwE?si=1tVN1g9FQcGp87li
https://youtu.be/TvzgzO6xKrY?si=gYzJstW51MTNsgKj
https://youtu.be/qko-f1VDhCM?si=0tWM_OHS395ESV_w
3 https://youtu.be/d9QfVpCG00Y?si=qeHk8tPg_torr2yX
https://youtu.be/1zQ8wbBozqI?si=7vOSHMt8OT3nQINO
https://youtube.com/playlist?list=PLE7VH8RC_N3bpVn-
4
e8QzOAHziEgmjQ2qE&si=rr5Fpuew5q9_Y4qg
 SEMESTER S6

INTRODUCTION TO ARTIFICIAL INTELLIGENCE

Course Code OEERT615 CIE Marks 40

Teaching Hours/Week
3:0:0:0 ESE Marks 60
(L: T:P: R)

Credits 3 Exam Hours 2 Hrs. 30 Min.

Prerequisites (if any) None Course Type Theory

Course Objectives:

1. To introduce basic principles that drive complex real world intelligence applications.
2. To introduce and discuss the basic concepts of AI Techniques and Learning.

SYLLABUS
Module Contact
Syllabus Description
No. Hours

Introduction to Artificial Intelligence: What is Artificial Intelligence(AI)?

The Foundations of AI, History of AI, Applications of AI. Intelligent
1 Agents, Types of agents and their environments, goodbehavior: The concept 9
of rationality, nature of Environments, Structure of Agents. Examples of
practical agents.

Problem Solving: Solving Problems by searching-Problem solving Agents,

Example problems, Searching for solutions, Uninformed search strategies-
2 Depth First Search (DFS) and Breadth First Search (BFS), Informed search 9
strategies- Greedy Search, A* Search, AO* Search, Hill Climbing
Algorithm, Heuristic functions.

Adversarial search: Games, Optimal decisions in games, The Minimax

algorithm, Alpha-Beta pruning. Constraint Satisfaction Problems – Defining
3 9
CSP, Constraint Propagation- inference in CSPs, Backtracking search for
CSPs, Structure of CSP problems.

Knowledge Representation and Reasoning: First Order Predicate Logic –

4 9
Syntax and Semantics of First Order Logic, Knowledge representation in
 First Order Logic. Inference in First Order Logic – Unification and Lifting,
Forward chaining, Backward chaining, Resolution.

Basic concepts of Machine Learning: Learning from Examples – Forms of

Learning, Supervised Learning/Unsupervised Learning.

Course Assessment Method

(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

Internal Internal
Assignment/ Examination-1 Examination- 2
Attendance Total
Microproject
(Written) (Written)

5 15 10 10 40

End Semester Examination Marks (ESE)

In Part A, all questions need to be answered and in Part B, each student can choose any one
full question out of two questions

Part A Part B Total

● 2 Questions from each ● Each question carries 9 marks.

module. ● Two questions will be given from each module, out
● Total of 8 Questions, each of which 1 question should be answered.
carrying 3 marks ● Each question can have a maximum of 3 60
subdivisions.
(4x9 = 36 marks)
(8x3 =24 marks)
 Course Outcomes (COs)

At the end of the course students should be able to:

Bloom’s
Course Outcome Knowledge
Level (KL)

Explain the fundamental concepts of intelligent systems and their

CO1 K2
architecture.

Illustrate uninformed and informed search techniques for problem solving

CO2 K2
in intelligent systems.

CO3 Solve Constraint Satisfaction Problems using search techniques. K3

Represent AI domain knowledge using logic systems and use inference

CO4 K3
techniques for reasoning in intelligent systems.

CO5 Illustrate different types of learning techniques used in intelligent systems K2

Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create

CO-PO Mapping Table (Mapping of Course Outcomes to Program Outcomes)

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

CO1 3

CO2 3 3 3 3

CO3 3 3 3 2 3

CO4 3 3 3 2 3

CO5 3 3 2 3

Note: 1: Slight (Low), 2: Moderate (Medium), 3: Substantial (High), -: No Correlation

Text Books

Name of the Edition

Sl. No Title of the Book Name of the Author/s
Publisher and Year

Artificial Intelligence: A Stuart Russell and

1 Prentice Hall 3/e, 2010
Modern Approach Peter Norvig

2 Artificial Intelligence E Rich, K Knight, Tata McGraw Hill 3/e, 2009

Artificial Intelligence-
3 Structures and Strategies for GeorgeF.Luger Pearson Education 4/e, 2002
Complex Problem Solving
 Reference Books

Name of the Edition

Sl. No Title of the Book Name of the Author/s
Publisher and Year

Artificial Intelligence - A New Nilsson N.J Harcourt Asia Pvt.

1 1998
Synthesis Ltd.

Artificial intelligence, A Stuart Jonathan Russell, 3/e, 2010

2 Pearson Education
modern approach Peter Norvig

Artificial Intelligence and Chandra SS And

3 PHI Learning 2014
Machine Learning Hareendran S

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.

1 An Introduction to Artificial Intelligence - Course (nptel.ac.in)

https://onlinecourses.nptel.ac.in/noc22_cs56/preview

2 Fundamentals of Artificial Intelligence - Course (nptel.ac.in)

https://onlinecourses.nptel.ac.in/noc22_ge29/preview

3 Artificial Intelligence - Course (swayam2.ac.in)

https://onlinecourses.swayam2.ac.in/cec21_cs08/preview
 SEMESTER S6

EMBEDDED SYSTEMS AND IoT LAB

Course Code PCERL 607 CIE Marks 50

Teaching Hours/Week
0:0:3:0 ESE Marks 50
(L: T:P: R)

Credits 2 Exam Hours 2 Hrs. 30 Min.

Prerequisites (if any) PBERT 604 Course Type Lab

Course Objectives:

1. To provide students a lot of hands-on experience designing different embedded systems and
exposing them to the tools needed to make them Internet of Things devices.

Details of Experiment

Expt. No Experiment
Part A: Arduino based embedded system

1 Implement an arduino based system to detect when something is moved, tilted, or shaken.

Implement temperature control system by controlling a fan, if the temperature exceeds a

2
limit. (Use arduino as control board)
Use Arduino to read the key presses on matrix keypad and display the pressed key on an LCD
3
display.
Use Arduino to monitor one or more voltages and take some action when the voltage rises or
falls below a threshold. For example, you want to flash an LED to indicate a low battery
4
level—perhaps to start flashing when the voltage drops below a warning threshold and
increasing in urgency as the voltage drops further.
Use Arduino to measure voltages greater than 5 volts. For example, you want to display the
5
voltage of a 9V battery and trigger an alarm LED when the voltage falls below a certain level.

Part B: NodeMCU based systems

Installing the Arduino IDE for the ESP8266 and connecting the module to your Wi-Fi
6
network.

7 Reading data from a digital sensor connected to a digital pin of ESP8266.

 Configuring the ESP8266 module and controlling an LED connected to it, from anywhere in
8
the world; using MQTT.

9 Controlling the lock from the cloud using Blynk and NodeMCU.

Sending an e-mail/SMS notification based on activity at sensor connected to NodeMCU;

10
using IFTTT.

Part C: Raspberry Pi based systems

11 Setting up Raspberry Pi by installing OS and obtaining static IP of Raspberry Pi.

12 Light an LED by reading status of a switch connected to GPIO of the board.

Install Arduino IDE on Raspberry Pi and control LED using LDR; in which both are
13
connected to Digital IO pin of Arduino.
Realize a datalogger with ThingSpeak Server: capture the real-time data of any sensor by
14
Raspberry Pi and upload to the cloud.

15 Implement a Home Appliance Control system using Raspberry Pi using Blynk App

** Any four experiments are mandatory from each part.

Course Assessment Method (CIE: 50 Marks, ESE 50 Marks)

Continuous Internal Evaluation Marks (CIE):

Preparation/Pre-Lab Work, experiments, Viva and

Internal
Attendance Timely completion of Lab Reports / Record. Total
Exam
(Continuous Assessment)
5 25 20 50

End Semester Examination Marks (ESE):

Procedure/ Result with

Conduct of experiment/
Preparatory valid inference/ Viva
Execution of work/ Record Total
work/Design/ Quality of voce
troubleshooting/ Programming
Algorithm Output
10 15 10 10 5 50
 Mandatory requirements for ESE:

 Submission of Record: Students shall be allowed for the end semester examination only upon
submitting the duly certified record.

 Endorsement by External Examiner: The external examiner shall endorse the record.

Course Outcomes (COs)

At the end of the course the student will be able to:

Bloom’s
Course Outcome Knowledge
Level (KL)
CO1 Implement interfacing of various sensors and actuators with Arduino. K3
CO2 Implement interfacing of various sensors and actuators with Node MCU. K3
CO3 Design and develop smart systems using Raspberry Pi. K3
K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create

CO-PO Mapping Table

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 3 3 3 3 3 3 3
CO2 3 3 3 3 3 3 3 3
CO3 3 3 3 3 3 3 3 3
1: Slight (Low),2: Moderate (Medium),3: Substantial (High), : No Correlation

Text Books

Name of the Edition

Sl. No Title of the Book Name of the Author/s
Publisher and Year

Arduino Cookbook_ Recipes to

1 Begin, Expand, and Enhance Michael Margolis O'Reilly Media 3e, 2020
Your Projects
Internet of Things with
2 Marco Schwartz Packt Publishing 2016
ESP8266-Packt Publishing
Rajesh Singh, Anita
Internet Of things With Gehlot, Lovi Raj Gupta, CRC Press Taylor &
3 2019
Raspberry Pi and Arduino Bhupendra Singh, Francis Group
Mahendra Swain
 Reference Books

Name of the Edition

Sl. No Title of the Book Name of the Author/s
Publisher and Year

Misra, Mukherjee, Cambridge

1 Introduction to IoT 2021
Roy University Press
NodeMCU ESP8266
Communication Methods
Amazon Media EU
2 and Protocols _ Manoj R. Thakur 2018
S.à r.l
Programming with Arduino
IDE
Raspberry Pi and MQTT
3 Dhairya Parikh Packt 2022
Essentials
Electronics Projects with the
ESP8266 and ESP32_
4 Building Web Pages, Neil Cameron Apress 2021
Applications, and WiFi
Enabled Devices

Video Links (NPTEL, SWAYAM…)

Sl. No. Link ID

1 https://archive.nptel.ac.in/courses/128/108/128108016/

Continuous Assessment (25 Marks)

1. Preparation and Pre-Lab Work (7 Marks)

 Pre-Lab Assignments: Assessment of pre-lab assignments or quizzes that test understanding of

the upcoming experiment.

 Understanding of Theory: Evaluation based on students’ preparation and understanding of the

theoretical background related to the experiments.
2. Conduct of Experiments (7 Marks)

 Procedure and Execution: Adherence to correct procedures, accurate execution of experiments,

and following safety protocols.

 Skill Proficiency: Proficiency in handling equipment, accuracy in observations, and

troubleshooting skills during the experiments.

 Teamwork: Collaboration and participation in group experiments.

3. Lab Reports and Record Keeping (6 Marks)

 Quality of Reports: Clarity, completeness and accuracy of lab reports. Proper documentation of
experiments, data analysis and conclusions.

 Timely Submission: Adhering to deadlines for submitting lab reports/rough record and
maintaining a well-organized fair record.

4. Viva Voce (5 Marks)

 Oral Examination: Ability to explain the experiment, results and underlying principles during a
viva voce session.

Final Marks Averaging: The final marks for preparation, conduct of experiments, viva, and
record are the average of all the specified experiments in the syllabus.

Evaluation Pattern for End Semester Examination (50 Marks)

1. Procedure/Preliminary Work/Design/Algorithm (10 Marks)

 Procedure Understanding and Description: Clarity in explaining the procedure and understanding
each step involved.

 Preliminary Work and Planning: Thoroughness in planning and organizing materials/equipment.

 Algorithm Development: Correctness and efficiency of the algorithm related to the experiment.

 Creativity and logic in algorithm or experimental design.

2. Conduct of Experiment/Execution of Work/Programming (15 Marks)

 Setup and Execution: Proper setup and accurate execution of the experiment or programming
task.
3. Result with Valid Inference/Quality of Output (10 Marks)

 Accuracy of Results: Precision and correctness of the obtained results.

 Analysis and Interpretation: Validity of inferences drawn from the experiment or quality of
program output.

4. Viva Voce (10 Marks)

 Ability to explain the experiment, procedure results and answer related questions
 Proficiency in answering questions related to theoretical and practical aspects of the subject.

5. Record (5 Marks)

 Completeness, clarity, and accuracy of the lab record submitted

SEMESTER 7
ELECTRONICS & COMPUTER
ENGINEERING
 SEMESTER S7

IMAGE PROCESSING

Course Code PEERT 741 CIE Marks 40

Teaching Hours/Week
3:0:0:0 ESE Marks 60
(L: T:P: R)

Credits 3 Exam Hours 2 Hrs. 30 Min.

Prerequisites (if any) Linear Algebra Course Type Theory

Course Objectives:

1. To introduce the fundamental concepts of Digital Image Processing and study the various
transforms required for image processing.
2. To study spatial and frequency domain image enhancement and image restoration methods.
3. To understand image compression and segmentation techniques.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Digital Image Fundamentals: Image representation, Types of images,
Elements of DIP system, Basic relationship between pixels, Distance
1 Measures, Simple image formation model. Brightness, contrast, hue,
saturation, Mach band effect. Colour image fundamentals-RGB, CMY, HIS 9
models, 2D sampling and quantization.
2D Image transforms: DFT, Properties, Walsh transform, Hadamard
transform, Haar transform, DCT, KL transform and Singular Value
Decomposition.
2
Image Compression: Image compression model, Lossy, lossless
9
compression, Concept of transform coding, JPEG Image compression
standard.
Image Enhancement: Spatial domain methods: Basic Gray Level
3 Transformations, Histogram Processing, Enhancement Using 9
Arithmetic/Logic Operations, Basics of Spatial Filtering, Smoothing spatial
 Filters, Sharpening spatial Filters.
Frequency domain methods: low pass filtering, high pass filtering,
homomorphic filtering.
Image Restoration: Degradation model, Inverse filtering- removal of blur
caused by uniform linear motion, Minimum Mean Square Error (Wiener)
4 Filtering.
9
Image segmentation: Region based approach, clustering , Segmentation
based on thresholding, edge based segmentation, Hough Transform.

Course Assessment Method

(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

Internal Internal Examination-

Assignment/
Attendance Examination-1 2 Total
Microproject
(Written) (Written )

5 15 10 10 40

End Semester Examination Marks (ESE)

In Part A, all questions need to be answered and in Part B, each student can choose any one
full question out of two questions

Part A Part B Total

● 2 Questions from each ● Each question carries 9 marks.
module. ● Two questions will be given from each module, out of
● Total of 8 Questions, each which 1 question should be answered.
60
carrying 3 marks ● Each question can have a maximum of 3 sub
divisions.
(8x3 =24marks) (4x9 = 36 marks)
 Course Outcomes (COs)

At the end of the course students should be able to:

Bloom’s
Course Outcome Knowledge
Level (KL)
CO1 Understand different components of image processing system K2
Analyse the various concepts and mathematical transforms necessary for
CO2 K3
image processing
CO3 Illustrate the various schemes of image compression K3
CO4 Understand the basic image segmentation techniques K3
CO5 Analyze the filtering and restoration of images K2
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create

CO-PO Mapping Table (Mapping od Course Outcomes to Program Outcomes)

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 3 3 1 2
CO2 3 3 3 1 2
CO3 3 3 3 1 2
CO4 3 3 3 1 2
CO5 3 3 3 1 2
Note: 1: Slight (Low), 2: Moderate (Medium), 3: Substantial (High), -: No Correlation

Text Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
1 Digital Image Processing Gonzalez Rafel C Pearson Education 4/e, 2019
S Jayaraman, S
Tata McGraw Hill
2 Digital Image Processing Esakkirajan, T 2009
Education
Veerakumar
 Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year

1 Digital Image Processing Kenneth R Castleman

Pearson Education 2/e,2003
Fundamentals of digital image
2 Anil K Jain PHI 1988
processing
John Wiley
3 Digital Image Processing Pratt William K 4/e,2007

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
1 https://archive.nptel.ac.in/courses/117/105/117105135
2 https://archive.nptel.ac.in/courses/106/105/106105216
3 https://nptel.ac.in/courses/117105079
4 https://nptel.ac.in/courses/106105032
 SEMESTER S7

DEEP LEARNING

Course Code PEECT742 CIE Marks 40

Teaching Hours/Week
3:0:0:0 ESE Marks 60
(L: T:P: R)

Credits 3 Exam Hours 2 Hrs. 30 Min.

Prerequisites (if any) Course Type Theory

Course Objectives:

1. Understand the theoretical basics of neural networks and deep learning.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Review of ANN: Perceptrons
Convolutional Neural Networks: Convolution operation , CNN Architecture
1 kernels, padding- Convolutional layers-, Pooling Layers, fully connected 7
layers.
Feature and weight visualization, t-SNE
Loss functions-Mean Squared Error, Cross Entropy Activation functions,
Sigmoid Relu , Softmax
Training CNNs:-Initialization Back-propagation
Optimization algorithms:-SGD, Momentum, Adagrad, RMS Prop, Adam,
2 10
Hyper parameter optimization-Learning rate
Regularization methods: L1, L2 regularizaton dropout, Data Augmentation,
Early stopping batch normalization
Introduction to Transfer learning, feature extraction , fine tuning.
Sequence models, Recurrent Neural Networks (RNN): cell structure and
architecture, Training RNN, back propagation through time. Vanishing and
3 10
exploding gradients.
Long Short-Term Memory (LSTM), architecture and training.
 Gated Recurrent Units (GRU), architectture and training.

Introduction to Generative models: parameter estimation, Maximum

Likelyhood Estimation.
GANs : adversarial training. Discriminator , Generator, up sampling,
4 Transformer models, architecture Word embedding, position encoding , 9
attention , training transformer models
Large language models BERT,GPT
( Detailed mathematical treatment not required for this module)

Note:- Assignments/ Micro project should be given for modules 2 ,3 and 4 using standard machine
learning frameworks such as tensorflow/keras/ pytorch. They may also be introduced to GPUs and
standard data sets on hugging face/kaggle

Course Assessment Method

(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

Internal
Assignment/ Internal Examination- 2
Attendance Examination-1 Total
Microproject (Written )
(Written)

5 15 10 10 40

End Semester Examination Marks (ESE)

In Part A, all questions need to be answered and in Part B, each student can choose any one
full question out of two questions
 Part A Part B Total

 2 Questions from each module.  Each question carries 9 marks.

 Total of 8 Questions, each  Two questions will be given from each module, out of
carrying 3 marks which 1 question should be answered.
60
 Each question can have a maximum of 3 sub divisions.
(8x3 =24marks) (4x9 = 36 marks)

Course Outcomes (COs)

At the end of the course students should be able to:

Bloom’s
Course Outcome Knowledge
Level (KL)
CO1 Explain the basic concepts of neural networks K2
CO2 Solve real world problems usig CNN K2
CO3 Solve real world problems using RNN K2
CO4 Describe the concepts of GAN K2
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create

CO-PO Mapping Table (Mapping of Course Outcomes to Program Outcomes)

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 2
CO2 3 3 2 2 2 2
CO3 3 3 2 2 2 2
CO4 3 2 2 2 2
Note: 1: Slight (Low), 2: Moderate (Medium), 3: Substantial (High), -: No Correlation
 Text Books
Name of the Edition and
Sl. No Title of the Book Name of the Publisher
Author/s Year
1 Learning Deep Learning Magnus Ekman Addison -Wesley 2022
Hands-on Machine learning with Second edition
2 Aurelien Geron Oreilly
Sc-kit Learn Keras and Tensorflow 2019
Astan Zhang and
Cambridge university press
3 Dive deep into machine learning Zachary and
https://d2l.ai/ 2019
Alexander semola
http://neuralnetworksanddeepl
4 Neural Networks for deep learning Michael Nielsen 2019
earning.com/

Reference Books
Name of the Edition and
Sl. No Title of the Book Name of the Author/s
Publisher Year
Ian Goodfellow. Yoshua Bengio
1 Deep Learning. MIT Press 2016.
and Aaron Courville.
Neural Networks and Deep
2 Charu C. Aggarwal. Springer . 2019
Learning: A Textbook..

3 Generative Deep Learning David Foster OReilly 2022

Build a Large Language

4 Model Sebastian Raschka Manning 2023
 Video Links (NPTEL, SWAYAM…)

Module No. Link ID

1 https://www.cse.iitm.ac.in/~miteshk/CS6910.html

2 https://cs231n.github.io/
https://wiki.pathmind.com/lstm
3
http://colah.github.io/posts/2015-08-Understanding-LSTMs/
4 https://jalammar.github.io/illustrated-transformer/ Jay Almar
 SEMESTER S7

ROBOTICS AND AUTOMATION

Course Code PEERT743 CIE Marks 40

Teaching Hours/Week
3:0:0:0 ESE Marks 60
(L: T:P: R)

Credits 3 Exam Hours 2 Hrs. 30 Min.

Prerequisites (if any) Engineering mathematics Course Type Theory

Course Objectives:

1. To understand the basics of robotics.

2. To gain insights into various sensors used with robots.
3. To understand the spatial descriptions and kinematics of robots.
4. To design controllers for robots
SYLLABUS

Module Contact
Syllabus Description
No. Hours
Definition and Origin of Robotics. Robot Anatomy. Robot Specifications.
Robot Characteristics –Accuracy, Precision, and Repeatability. Classification
of Robots. Advantages and Disadvantages of Robots. Robot Structure - Types
1 9
of Joints and End Effectors, Mechanisms and Manipulators.Common
Kinematic Arrangements. Degree of Freedom. Robot Coordinates. Areas of
Applicationfor Robots
Actuators: Types of Robotic Drive Systems and Actuators: Hydraulic,
Pneumatic and Electric drives. Transmission: Gears, Timing Belts and
Bearings. Parameters for selection of actuators. Specification.
2 9
Areas of Application for: Stepper Motor & Servo Motor. Sensors: Types and
Applications of Sensors in Robotics: Position, Displacement and
VelocitySensors. Tactile Sensors for Contact and Proximity Assessment
Introduction to Kinematics: Positionand Orientation of Objects. Rotation. Euler
3 Angles. Rigid Motion Representation using Homogenous Transformation 9
Matrix. Kinematic Modelling:Translation and Rotation Representation,
 Coordinate Transformation, Forward and Inverse Kinematics. Forward
Kinematics-Link Coordinates, Denavit-Hartenberg Representation,Application
of DH Convention to Different Serial Kinematic Arrangements
Basics of Control: Open Loop- Closed Loop, Transfer Functions, Control
Laws: P, PD, PID, Linearand Non-linear Controls; Control Hardware and
4 9
Interfacing; Embedded Systems: Microcontroller Architecture and Integration
with Sensors, Actuators, Components.

Course Assessment Method

(CIE: 40 marks,ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

Internal Internal Examination-

Assignment/
Attendance Examination-1 2 Total
Microproject
(Written) (Written )

5 15 10 10 40

End Semester Examination Marks (ESE)

In Part A, all questions need to be answered and in Part B, each student can choose any one
full question out of two questions

Part A Part B Total

● 2 Questions from each module. ● Each question carries 9 marks.
● Total of 8 Questions, each ● Two questions will be given from each module, out of
carrying 3 marks which 1 question should be answered. 60
● Each question can have a maximum of 3 sub divisions.
(8x3 =24marks) (4x9 = 36 marks)
 Course Outcomes (COs)

At the end of the course students should be able to:

Bloom’s
Course Outcome Knowledge
Level (KL)
CO1 Attain a thorough understanding of different types of Robots and their applications K2
CO2 Select appropriate sensors and actuators based on the robotic application K2
CO3 Perform kinematic and dynamic analyses for robots K2

CO4 Carry out the design and control of a simple robot. K3

Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create

CO-PO Mapping Table (Mapping od Course Outcomes to Program Outcomes)

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 3 2 3
CO2 3 3 3 3
CO3 3 3 2 3
CO4 3 3 3 3
Note: 1: Slight (Low), 2: Moderate (Medium), 3: Substantial (High), -: No Correlation

Text Books
Name of the Edition and
Sl. No Title of the Book Name of the Author/s
Publisher Year
Industrial Robotics Technology,
1 M.PGroover McGraw-HillUSA 2e(SIE),2012
Programming and Applications
2 Introduction to Robotics JohnCraig Macmillan 4e,2022
Fundamentals of Robotics Analysis&
3 Robert J Shilling PHI 2003
Control
4 Introduction to Robotics S.K. Saha Tata McGraw Hill 2e,2014
 Reference Books
Name of the Edition and
Sl. No Title of the Book Name of the Author/s
Publisher Year
Introduction to Robotics, Analysis, Second
1 NikuS.B., John Wiley
Control, Application Edition, 2000
Mark W. Spong, Seth
2 Robot Dynamics and Control Hutchinson, and M. Wiley 2008
Vidyasagar
Robotics, Fundamental concepts OXFORD University
3 AshitavaGhosal 2006
and analysis Press
Asada, H., and J. J.
4 Robot Analysis and Control New York, NY:Wiley, 1986
Slotine.
Klafter, R.D.,
Robotic Engineering An Integrated
5 Chmielewski, T.A, PHI 2007
Approach
Negin, M,

Video Links (NPTEL, SWAYAM…)

Module No. Link ID

1 https://nptel.ac.in/courses/107106090
2 https://nptel.ac.in/courses/112105249

3 https://nptel.ac.in/courses/112101098

4 https://nptel.ac.in/courses/112107289
 SEMESTER S7

NANOELECTRONICS

Course Code PEERT 744 CIE Marks 40

Teaching Hours/Week
3:0:0:0 ESE Marks 60
(L: T:P: R)

Credits 3 Exam Hours 2 Hrs. 30 Min.

Prerequisites (if any) None Course Type Theory

Course Objectives:

1. To understand the challenges of scaling of devices to Nano-meter scales

2. To apply quantum mechanics in materials and quantum devices

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Introduction to Nano electronics-Review of MOSFETs- Band diagram-
operation-threshold voltage- current-MOSFET parameters.

Challenges going to sub-100 nm MOSFETs-Technological and physical

limits of Nanoelectronic systems, characteristic lengths
1 9
Scaling and short channel effects-Length, Oxide layer thickness, tunneling,
power density, non-uniform dopant concentration, threshold voltage scaling,
hot electron effects, sub-threshold current, velocity saturation, DIBL, and
channel length modulation.

Novel MOS Devices and Performance Optimization

2 Silicon-on-insulator devices--FD SOI, PD SOI

9
Multiple gate MOSFETs--Double gate MOSFETs, FinFETs, Nanowires
 Multi Gate MOSFET performance optimization: Fins, Fin Width, Fin
Height and Fin Pitch, Fin Surface Crystal Orientation, Fins on Bulk Silicon,
Nano-wires. Gate Stack, Gate Patterning, Threshold Voltage and Gate Work
function requirements.

Quantum Transport
Atomistic view of electrical Resistance-Energy level diagram- What makes
electrons flow- The quantum of conductance - Potential profile- Coulomb
blockade - Towards Ohm’s law

Schrodinger equation- Method of finite differences – Examples (particle in

a box only)
3 9
Band structure- 1-D examples- General result with basis- 2-D example
Sub bands- Quantum wells, wires, dots, graphene, and “carbon nanotubes” -
- Density of states-Minimum resistance of a wire

Ballistic to Diffusive Transport-Landauer formula, Landauer-Buttiker

formula. Ballistic and Diffusive transport – transmission.

Applications of Quantum mechanics and Quantum devices

Tunneling and applications of quantum mechanics- Solution of

Schrodinger equation: Free space, Potential well, tunneling through a
potential barrier. Potential energy profiles for material interfaces

Hetero junctions -Modulation-doped hetero junctions- SiGe strained

heterostructures- MODFET- Resonant Tunnelling-Resonant Tunneling
4
transistor. 9

Single electron devices –Coulomb blockade in a Nano capacitor, tunnel

junctions, Double tunnel junction--Coulomb staircase, Single electron
transistor.

Spintronics-Transport of spin, GMR-TMR,applications, Spin Transistor

 Course Assessment Method
(CIE: 40 marks,ESE: 60 marks)
Continuous Internal Evaluation Marks (CIE):

Internal Internal
Assignment/
Attendance Examination-1 Examination- 2 Total
Microproject
(Written) (Written )

5 15 10 10 40

End Semester Examination Marks (ESE)

In Part A, all questions need to be answered and in Part B, each student can choose any one
full question out of two questions

Part A Part B Total

● 2 Questions from each ● Each question carries 9 marks.
module. ● Two questions will be given from each module, out
● Total of 8 Questions, each of which 1 question should be answered.
60
carrying 3 marks ● Each question can have a maximum of 3 sub
divisions.
(8x3 =24marks) (4x9 = 36 marks)
Course Outcomes (COs)

At the end of the course students should be able to:

Bloom’s
Course Outcome Knowledge
Level (KL)
Describe the challenges of scaling of electron devices to Nano meter K2
CO1
scales
Design novel transistor devices to reduce the short channel effects and K3
CO2
improve performance
Outline the Nano scale quantum transport in Nano electronic devices K2
CO3
from atom to transistor
CO4 Apply quantum mechanics in materials and quantum devices K3

Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create
 CO-PO Mapping Table (Mapping of Course Outcomes to Program Outcomes)

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 3 2 3
CO2 3 3 3 3
CO3 3 3 2 3
CO4 3 3 3 3
Note: 1: Slight (Low), 2: Moderate (Medium), 3: Substantial (High), -: No Correlation

Text Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Second
Fundamentals of Cambridge University
1 Yuan Taur, Tak H Ning edition
Modern VLSI Devices Press,
2009
First
Nanoelectronics and Karl Goser· Peter GlÖsekötter· Springer-Verlag Berlin
2 Edition,
Nanosystems Jan Dienstuhl Heide1berg
2004
Nanotechnology for First
J M Martinez Duart, R J Martin
3 microelectronics and Elsevier, Edition,
Palma, F Agullo Rueda
optoelectronics, 2006
First
FinFETs and Other
4 J-P Colinge Springer Edition,
multigate Transistors
2008
First
Quantum Transport Cambridge University
5 Supriyo Datta Edition,
Atom to Transistor Press
2005
First
Fundamentals of nano
6 George W.Hanson, Pearson Education. Edition
electronics,
2009
 Reference Books
Name of the Name of the Edition
Sl. No Title of the Book
Author/s Publisher and Year
Second
Cambridge University
1 Fundamentals of Carrier Transport Mark Lundstrom Edition,
Press
2000
First
High Dielectric Constant materials H R Huff, D C
2 Springer Edition,
VLSI MOSFET Applications, Gilmer,
2004
Nanoelectronics and nanosystems Karl Goser· Peter First
3 From Transistors to Molecular and GlÖsekötter· Jan Springer Edition,
Quantum Devices Dienstuhl 2004
NANOSCALE TRANSISTORS First
Mark S. Lundstrom,
4 Device Physics, Modeling and Springer Edition,
Jing Guo
Simulation 2006
First
Fundamentals of Ultra-Thin-Body Jerry G. Fossum, Cambridge University
5 Edition,
MOSFETs and FinFETs Vishal P. Trivedi Press
2013
First
Charles P Poole jr.
6 Introduction to Nanotechnology John Wiley and Sons Edition,
Frank J Owens
2003
Third
Introduction to Quantum David J Griffiths, Cambridge University
7 Edition,
Mechanics Darrel F schroetter Press
2018

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
1 https://nptel.ac.in/courses/117108047, https://nanohub.org/resources/5328

2 https://nptel.ac.in/courses/117108047
https://nptel.ac.in/courses/117107149, https://nanohub.org/resources/8086,
3
https://nanohub.org/courses/FON1, https://nanohub.org/resources/5306
4 https://nptel.ac.in/courses/117107149, https://nanohub.org/resources/8086
 SEMESTER S7

BLOCKCHAIN TECHNOLOGIES

Course Code PEERT 746 CIE Marks 40

Teaching Hours/Week
3:0:0:0 ESE Marks 60
(L: T:P: R)

Credits 3 Exam Hours 2 Hrs. 30 Min.

Data structures,
Prerequisites (if any) Course Type Theory
Operating systems.

Course Objectives:

1. Illustrate the cryptographic building blocks of blockchain technology.

2. To understand the function of blockchains, understanding why/when it is better than a simple
distributed database.
3. Summarize the classification of consensus algorithms.
4. Explain the use of smart contracts and its use cases.
5. Develop simple applications using Solidity language on Ethereum platform.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Fundamentals of Cryptography
Introduction to Cryptography, Symmetric cryptography – AES. Asymmetric
cryptography – RSA. Elliptic curve cryptography, Digital signatures – RSA
digital signature algorithms. Secure Hash Algorithms – SHA-256.
1 Applications of cryptographic hash functions – Merkle trees, Distributed 9
hash tables
Fundamentals of Blockchain Technology
Blockchain – Definition, architecture, elements of blockchain, benefits and
limitations, types of blockchain.
Consensus Algorithms
2 9
Consensus – definition, types, consensus in blockchain.
 Consensus Algorithms, Crash fault-tolerance (CFT) algorithms – Paxos,
Raft. Byzantine faulttolerance (BFT) algorithms – Practical Byzantine Fault
Tolerance (PBFT), Proof of work (PoW), Proof of stake (PoS), Types of PoS
Bitcoin
Bitcoin – Definition, Cryptographic keys – Private keys, public keys,
addresses. Transactions – Lifecycle, coinbase transactions, transaction
validation. Blockchain – The genesis block. Mining – Tasks of miners,
mining algorithm, hash rate. Wallets – Types of wallets
Smart Contracts and Use cases
Smart Contracts – Definition, Smart contract templates, Oracles, Types of
oracles, Deploying smart contracts. Use cases of Blockchain technology –
3 9
Government, Health care, Finance, Supply chain management. Blockchain
and allied technologies – Blockchain and Cloud Computing, Blockchain and
Artificial Intelligence.
Ethereum and Solidity
Ethereum – The Ethereum network. Components of the Ethereum ecosystem
– Keys and addresses, Accounts, Transactions and messages. The Ethereum
4 Virtual Machine, Blocks and blockchain. The Solidity language – The layout 9
of a Solidity source code, Structure of a smart contract, variables, data types,
control structures, events, inheritance, libraries, functions, error handling.
Smart contracts Case study: Voting, Auction.

Course Assessment Method

(CIE: 40 marks,ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

Internal Internal
Attendance Assignment Examination-1 Examination- 2 Total
(Written) (Written )

5 15 10 10 40

End Semester Examination Marks (ESE)

In Part A, all questions need to be answered and in Part B, each student can choose any one
full question out of two questions
 Course Outcomes (COs)

At the end of the course students should be able to:

Bloom’s
Course Outcome Knowledge
Level (KL)
CO1 Understand the fundamentals of cryptography and block chain K2
Analyse how the various consensus algorithms ensure security and
CO2 K4
reliability in blockchain networks.
CO3 Learn about the concept of smart contracts and their applications. K2
Identify and discuss potential applications of blockchain technology in
CO4 K4
various sectors
Study real-world examples of successful blockchain implementations
CO5 K3
and their impact.
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create

CO-PO Mapping Table (Mapping of Course Outcomes to Program Outcomes)

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 2 2 2
CO2 2 2 2
CO3 2 2 2
CO4 2 2 2
CO5 2 2 2
Note: 1: Slight (Low), 2: Moderate (Medium), 3: Substantial (High), -: No Correlation

Text Books
Name of the Name of the Edition
Sl. No Title of the Book
Author/s Publisher and Year
Mastering Blockchain: A deep dive
Third
into distributed ledgers, consensus
1 Imran Bashir Packt Publishing edition
protocols, smart contracts, DApps,
2020
cryptocurrencies,Ethereum, and more,
 Reference Books
Name of the Edition and
Sl. No Title of the Book Name of the Author/s
Publisher Year
First edition&
1 Block Chain in Action Bina Ramamurthy Mnning Publication
2020
Solidity Programming
Essentials: A beginner's guide First
2 Ritesh Modi Packt Publication
to build smart contracts for edition&2018.
Ethereum and blockchain
First
Blockchain Technology: Kumar Saurabh,
4 Wiley Publication Edition&2020
Concepts and Applications Ashutosh Saxena
.

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
Blockchain Demo (andersbrownworth.com)
1

Blockchain.com Explorer | BCH | ETH | BCH

2

3 Remix - Ethereum IDE

Ethereum Transactions Information | Etherscan
4
 SEMESTER S7

NETWORK SECURITY

Course Code PEERT 745 CIE Marks 40

Teaching Hours/Week (L:
3:0:0:0 ESE Marks 60
T:P: R)

Credits 5/3 Exam Hours 2 Hrs. 30 Min.

Prerequisites (if any) None Course Type Theory

Course Objectives:

1. To understand the fundamental concepts and importance of network security.

2. To learn and apply various cryptographic techniques for securing data.

3. To explore and analyze different network security protocols and their applications.

4. To identify and mitigate various network threats and vulnerabilities.

5. To examine advanced topics in network security, including intrusion detection systems,

wireless security, and emerging security challenges.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Fundamentals of network security - Introduction to Network Security,
Understanding Security: Confidentiality, Integrity, Availability (CIA Triad),
Threats, Vulnerabilities, and Attacks: Types and Examples, Security Policies
and Mechanisms, Network Security Technologies and Devices - Firewalls:
1 Types, Configurations, and Best Practices, Intrusion Detection and Prevention 9
Systems (IDS/IPS), Virtual Private Networks (VPNs): Concepts and Uses,
Access Control and Authentication - Access Control Models: DAC, MAC,
RBAC, Authentication Methods: Passwords, Biometrics, Two-Factor
Authentication, Authorization and Accounting Concept
Cryptography and Secure Communications - Introduction to Cryptography,
2 9
Symmetric Key Cryptography: Algorithms (AES, DES), Modes of Operation,
 Encryption and Decryption Processes, Asymmetric Cryptography and Key
Management- Public Key Cryptography: RSA, Diffie-Hellman, Digital
Signatures and Certificates, Public Key Infrastructure (PKI) and Key
Management, Hash Functions and Message Authentication- Hash Functions:
SHA, MD5 – Concepts and Applications, Message Authentication Codes
(MAC) and HMAC, Secure Email: PGP and S/MIME
Network Security Protocols and Applications
Secure Network Protocols - Secure Socket Layer (SSL) and Transport Layer
Security (TLS), Secure Shell (SSH): Concepts and Uses, IP Security (IPsec):
Architecture and Protocols, Web and Email Security, HTTP Security: HTTPS,
3 Secure Cookies, and Content Security Policy, Email Security Threats and 9
Solutions, Web Application Security: OWASP Top 10, Wireless and Mobile
Security, Wireless Security Protocols: WEP, WPA, WPA2, WPA3, Mobile
Device Security Challenges and Solutions, Bluetooth and Near Field
Communication (NFC) Security
Advanced Topics in Network Security - Intrusion Detection and Prevention,
Types of Intrusions and Attack Patterns, Host-based and Network-based
IDS/IPS, Anomaly Detection and Signature-Based Detection, Types of
Malware: Viruses, Worms, Trojans, Ransomware, Malware Detection and
4 Removal Techniques, Threat Intelligence and Cybersecurity Frameworks 9
Malware and Threat Analysis - Cloud Security: Challenges and Solutions,
Emerging Trends and Future Directions - Internet of Things (IoT) Security
Concerns, Artificial Intelligence and Machine Learning in Security, Blockchain
Technology for Secure Transactions

Course Assessment Method

(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

Attendance Internal Ex Evaluate Analyse Total

5 15 10 10 40
Criteria for Evaluation (Evaluate and Analyse): 20 marks

Evaluation Methods:
1. Experiments may be done using following Software and Tools: (10 marks)
:

 Wireshark: For network traffic analysis.

 Nmap: For network scanning and vulnerability assessment.

 OpenSSL: For implementing and testing cryptographic functions.

 Snort: For intrusion detection and prevention.

 VirtualBox/VMware: For creating virtualized network environments.

 Kali Linux: A Linux distribution specialized for digital forensics and penetration testing.

1. Setting Up a Secure Network Environment Using Virtual Machines

2. Configuring a Basic Firewall and Monitoring Network Traffic

3. Implementing User Authentication and Access Control in a Network

4. Implementing Symmetric Encryption Using OpenSSL

5. Creating and Using Digital Certificates with OpenSSL

6. Generating and Verifying Hashes and Digital Signatures

7. Establishing Secure Connections Using SSH and TLS

8. Configuring HTTPS for a Web Server and Implementing Basic Web Security
Measures

9. Securing a Wireless Network and Assessing Vulnerabilities

10. Setting Up and Configuring Snort IDS for Network Monitoring

11. Conducting Basic Malware Analysis in a Controlled Environment

12. Case Study Presentation on an Emerging Network Security Topic

 Criteria for Evaluation: Course Project (10 marks)
1. Project Proposal and Planning (2 marks)
● Submits a well-defined project proposal outlining objectives, methodology, and
expected outcomes.
● Demonstrates thorough planning and a clear timeline for the project.
2. Design and Implementation (3 marks)
● Implements the project design accurately using appropriate tools and techniques.
● The design is functional and meets the project objectives.
2. Innovation and Creativity (2 marks)
● Introduces innovative ideas or unique approaches in the design and implementation.
● Demonstrates creativity in solving problems or optimizing designs.
2. Analysis and Testing (2 marks)
● Effectively analyzes the project design to identify and address any issues.
● Conducts thorough testing to verify the functionality and performance of the design.
2. Final Report and Presentation (1 mark)
● Submits a comprehensive final report detailing the project, including objectives,
design, methodology, analysis, and results.
● Clearly presents the project and its outcomes, and effectively communicates the key
points.

End Semester Examination Marks (ESE):

In Part A, all questions need to be answered and in Part B, each student can choose any one
full question out of two questions

Part A Part B Total

● 2 Questions from each  2 questions will be given from each module,
module. out of which 1 question should be answered.
● Total of 8 Questions, each Each question can have a maximum of 3 sub 60
carrying 3 marks divisions. Each question carries 9 marks.
(8x3 =24marks) (4x9 = 36 marks)
 Course Outcomes (COs)

At the end of the course students should be able to:

Bloom’s
Course Outcome Knowledge
Level (KL)
Apply cryptographic techniques and protocols to secure network
CO1 communications and ensure data confidentiality, integrity, and K3
authenticity.
Configure and manage network security devices and software, such as
CO2 K3
firewalls, IDS/IPS, and VPNs, to protect network infrastructures.
Identify and respond to security incidents and network breaches by
CO3 conducting threat analysis and implementing appropriate K2
countermeasures.
Evaluate emerging network security challenges and technologies,
CO4 proposing solutions to complex security problems in modern network K4
environments.
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create

CO-PO Mapping Table (Mapping od Course Outcomes to Program Outcomes)

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

CO1 3 2 3 3 3 3

CO2 3 2 3 3 3 3

CO3 3 2 3 3 3 3

CO4 3 2 3 3 3 3
Note: 1: Slight (Low), 2: Moderate (Medium), 3: Substantial (High), -: No Correlation
 Text Books
Name of the Name of the Edition
Sl. No Title of the Book
Author/s Publisher and Year
Network Security Essentials: 7th Edition,
1 William Stallings Pearson
Applications and Standards 2022

Cryptography and Network 8th Edition,

2 Security: Principles and Practice William Stallings Pearson
2023

Computer Security: Principles William Stallings and 5th Edition,

3 Pearson
and Practice" Lawrie Brown 2021

Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
2nd
The Network Security Test
1 Michael Gregg Wiley Edition,
Lab: A Step-by-Step Guide
2022

Applied Network Security

Chris Sanders and Jason 1st Edition,
2 Monitoring: Collection, Syngress
Smith 2018
Detection, and Analysis

Stuart McClure, Joel

Hacking Exposed 7: Network Scambray, and George McGraw-Hill 7th Edition,
3 Security Secrets and Solutions Kurtz Education 2020

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
1 https://nptel.ac.in/courses/106105031

2 https://onlinecourses.nptel.ac.in/noc22_cs90/preview
 SEMESTER S7

WEB PROGRAMMING

Course Code PEERT 751 CIE Marks 40

Teaching Hours/Week
3:0:0:0 ESE Marks 60
(L: T:P: R)

Credits 3 Exam Hours 2 Hrs. 30 Min.

Prerequisites (if any) None Course Type Theory

Course Objectives:

1. Learn how servers and web browsers communicate.

2. Learn how to use HTML elements to construct well-structured web pages.
3. Explore advanced CSS methods such as animations, transitions, and responsive design.
4. Learn how to write PHP scripts to handle form submissions and perform server-side
processing.
5. Learn how to integrate HTML, CSS, PHP, and MySQL to create dynamic and interactive web
applications.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
WWW: Web Basics, URI’s & URL, Search Engine Optimization (SEO),
Analytics, Domain Names & Hosting, Ftp & Third party tools
HTML5: Introduction to HTML5, Basic Structure for HTML, Basic HTML
1 tags-Headings, Hyper Links, Images, Special Characters and Horizontal 8
Rules, Lists, Tables, Forms, Internal Linking, Meta Elements, HTML5 Form
Input Types, Input and Data List Elements, Autocomplete Attribute, Page
Structure Elements, Multimedia-HTML5 Audio & video elements
Introduction to Stylesheets : Introduction to CSS-Basic syntax and structure-
Inline, Internal and External Styles, Embedded Style Sheets, Conflict
2 7
Resolution, Linking External Style Sheets-Exploring CSS Selectors-
Properties, values, Positioning Elements: Absolute Positioning, Relative
 Positioning, Backgrounds,List Styles,Element Dimensions, Table Layouts-
Box Model and Text Flow-div and span, Basics of Responsive CSS, Media
port & Media Queries.
JavaScript:Introduction, Examples of JavaScript in browser, Basic JavaScript
Instructions: Statements, Comments, Variable, Data Types, Arrays,
Expressions, Operators, Functions and Objects, Variable Scope, Object,
Arrays are objects, Browser Object Model, DOM, Global Objects: String,
Number, Math, Date. Decision Making and Loops: if statement, if…else
statement, switch statement, Loops: Key Concepts, for loops, while loops, do
while loops; DOM: Document Object Model (DOM),Working with DOM
tree, Accessing Elements, Nodelists, Selecting Elements: Using Class
Attribute, Tag Name, CSS Selector, repeating actions for an entire nodelist,
Looping through a Nodelist, Traversing the DOM, Adding or Removing
3 HTMLcontent, Update Text and Markup, Adding/Removing Elements,
Event Handling: Different event types and ways to bind an event to an
element: using DOM Event Handlers, using Event listeners, using
Parameters with Event Listeners; the Event Object, Event Delegation, User 10
Interface Events, Event Bubbling
ECMAScript: Versions, Features, Introduction, Var Declarations and
Hoisting, let declaration, Constant declaration, Function with default
parameter values, Default parameter expressions, Unnamed parameters, the
spread operator, arrow functions, object destructuring, array destructuring,
sets and maps, Array.find(), Array.findIndex(), template strings, Javascript
classes, callbacks, promises, async/await
PHP: Introduction, Building blocks of PHP, Variables, Data Types Simple
PHP program, Converting between Data Types, Operators and Expressions,
Flow Control functions, Control statements, Working with Functions,
Initialising and Manipulating Arrays, Objects, String Comparisons,String
processing with Regular Expression
4 10
Advanced PHP: Form processing and Business Logic, Cookies, Sessions,
MySQL Integration: Connecting to MySQL with PHP, Performing
CREATE, DELETE, INSERT, SELECT and UPDATE operations on
MySQL table, Working with MySQL data, Reading from Database Dynamic
Content.
 Course Assessment Method
(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

Internal Internal
Assignment/
Attendance Examination-1 Examination- 2 Total
Microproject
(Written) (Written )

5 15 10 10 40

End Semester Examination Marks (ESE)

In Part A, all questions need to be answered and in Part B, each student can choose any one
full question out of two questions

Part A Part B Total

● 2 Questions from each ● Each question carries 9 marks.
module. ● Two questions will be given from each module, out
● Total of 8 Questions, each of which 1 question should be answered.
60
carrying 3 marks ● Each question can have a maximum of 3
subdivisions.
(8x3 =24 marks) (4x9 = 36 marks)
 Course Outcomes (COs)

At the end of the course students should be able to:

Bloom’s
Course Outcome Knowledge
Level (KL)
Comprehend the principles of the WWW and create web pages using
CO1 HyperText Markup Language (HTML) K3

CO2 Implement Cascading Style Sheet to apply style in HTML pages K3

CO3 Add functionality to web pages by using Java Script K3

CO4 Construct websites using advanced sever side programming tool PHP K3

Use PHP to create dynamic web pages and perform MySQL database
CO5 K3
operations

Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create

CO-PO Mapping Table (Mapping of Course Outcomes to Program Outcomes)

PO1 PO1 PO1

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9
0 1 2
CO1 1 1 - - 1 - - - - - - 1
CO2 1 1 - - 1 - - - - - - 1
CO3 2 2 - - 1 - - - - - - 1
CO4 2 2 - - 2 - - - - - - 1
CO5 2 3 2 1 2 - - - - - - 2
Note: 1: Slight (Low), 2: Moderate (Medium), 3: Substantial (High), -: No Correlation

Text Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Internet and World Wide Web Paul J. Deitel, Harvey M. 5th Edition,
1 How To Program Deitel, Abbey Deitel Pearson Education
2012

2 HTML and CSS: Design and Jon Duckett Wiley 2011

 Build Websites
JavaScript and JQuery :
3 Interactive Front–End Web Jon Duckett Wiley 2014
Development
Understanding ECMAScript 6:
4 The Definitive Guide for Nicholas C. Zakas William Pollock 2016
JavaScript Developers
PHP, MySQL & JavaScript All Julie C. Meloni Pearson - Sams 5th edition,
5
in One Publishing 2017

Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Programming the World Wide 8th Edition,
1 Robert W Sebesta Pearson
Web 2015

PHP 6 and MySQL 5 for

5th Edition,
2 Dynamic Web Sites: Visual Larry Ullman Pearson
2017
QuickPro Guide
The Joy of PHP: A Beginner's
Guide to Programming 6th Edition,
3 Interactive Web Applications Alan Forbes Plum Island
2020
with PHP and mySQL

Head First PHP & MySQL Lynn Beighley & 1st Edition,
4 O’Reilly
Michael Morrison 2009

McGraw-Hill 1st Edition,

5 PHP: A Beginner’s Guide Vikram Vaswani
Education 2008

Learning PHP, MySQL, 2nd Edition,

6 JavaScript, CSS & HTML5 Robin Nixon O’Reilly
2012
 Video Links (NPTEL, SWAYAM…)
Module
Link ID
No.

1 https://nptel.ac.in/courses/106106156/

2 https://www.php.net/
3 https://www.mysql.com/
4 https://www.w3schools.com/php/
5 https://www.w3schools.com/sql/
 SEMESTER S7

LOW POWER VLSI

Course Code PEERT 752 CIE Marks 40

Teaching Hours/Week
3:0:0:0 ESE Marks 60
(L: T:P: R)

Credits 3 Exam Hours 2 Hrs. 30 Min.

Prerequisites (if any) None Course Type Theory

Course Objectives:

1. Students will be able to understand the fundamental principles of power dissipation in digital
integrated circuits and the impact of power consumption on modern VLSI design
2. Students will be able to explore various low power design techniques and methodologies for
minimizing power consumption in digital circuits, such as voltage scaling, power gating, and
clock gating.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Physics of Power dissipation in MOSFET devices
Need for low power circuit design, MIS Structure
Deep submicron transistor design issues: Short channel effects
Channel Length Modulation, Surface scattering, Punch through, Velocity
saturation, Impact ionization, Hot electron effects, Body Effect, Narrow
1 9
width effect, Vth roll-off, Drain Induced Barrier Lowering, Gate Induced
drain leakage, Tunnelling Through Gate Oxide, Subthreshold Leakage
Current,
Emerging Technologies for Low Power:
Hi-K Gate Dielectric, Lightly Doped Drain–Source, Silicon on Insulator.
Sources of power dissipation in digital ICs –
2 Dynamic Power Dissipation: 9
Short Circuit Power: Short Circuit Current of Inverter, Short circuit current
 dependency on input rise and fall time, Variation of short circuit current with
load capacitance.
Switching power dissipation: Switching Power of CMOS Inverter, Switching
activity and its effects. Glitching Power: Glitches and its effect on power
dissipation
Static Power Dissipation:
Sources of Leakage Power, Effects of Vdd and Vton speed, Constraints on Vt
Reduction.
Low-Power Design Approaches-
Supply Voltage Scaling for Low Power:
Effect of Supply Voltage on Delay and Power, Effect of Supply Voltage on
Static and Dynamic Power, Multi VDD, Dynamic VDD, Dynamic Voltage
3 and Frequency Scaling (DVFS) Approaches. Architectural Level 9
Approaches: Pipelining and Parallel Processing
Leakage power reduction Techniques:
Effect of Threshold Voltage on Leakage Power, Transistor stacking,
MTCMOS, VTCMOS, Power gating& Clock gating Techniques.
Circuit Design Styles for Low Power-
Non-clocked circuit design style: Fully Complementary logic. NMOS and
Pseudo–NMOS logic, Differential Cascode Voltage Switch logic(DCVS)
4 Clocked design style: Basic concept, Dynamic Logic, Domino logic, 9
Differential Current Switch Logic.
Adiabatic switching – Adiabatic charging, Adiabatic amplification,
Adiabatic logic gates, Pulsed power supplies.

Course Assessment Method

(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

Internal Internal
Assignment/
Attendance Examination-1 Examination- 2 Total
Microproject
(Written) (Written )

5 15 10 10 40
 End Semester Examination Marks (ESE)

In Part A, all questions need to be answered and in Part B, each student can choose any one
full question out of two questions

Part A Part B Total

● 2 Questions from each ● Each question carries 9 marks.
module. ● Two questions will be given from each module, out
● Total of 8 Questions, each of which 1 question should be answered.
60
carrying 3 marks ● Each question can have a maximum of 3 sub-
divisions.
(8x3 =24marks) (4x9 = 36 marks)

Course Outcomes (COs)

At the end of the course, students should be able to:

Bloom’s
Course Outcome Knowledge
Level (KL)
Understand the Impact of Technology Scaling on Power Dissipation
CO1 K2
and Short Channel Effects
CO2 Identify Different Sources of Power Dissipation in Digital ICs K2
CO3 Apply Power Management Approaches in Digital ICs K3
Utilize Clocked and Non-Clocked Design Styles and Adiabatic
CO4 K3
Switching for Power Management
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create

CO-PO Mapping Table (Mapping of Course Outcomes to Program Outcomes)

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 2 2 3
CO2 3 2 2 3
CO3 3 2 2 3
CO4 3 2 2 3
Note: 1: Slight (Low), 2: Moderate (Medium), 3: Substantial (High), -: No Correlation
 Text Books
Name of the Edition and
Sl. No Title of the Book Name of the Author/s
Publisher Year

Design of Analog CMOS

1 Behzad Razavi McGraw-Hill 2/e, 2002
Integrated Circuits

Prentice Hall
CMOS: Circuits Design,
2 Baker, Li, Boyce India, 2000
Layout and Simulation,

Oxford
3 Microelectronic Circuits Sedra & Smith 6/e,2017
University Press

Reference Books
Sl. Name of the Name of the
Title of the Book Edition and Year
No Author/s Publisher
Oxford
CMOS Analog Circuit Phillip E. Allen,
1 University 3/e
Design, Douglas R. Holbery
Press
Wiley
Fundamentals of
2 Behzad Razavi student 2014
Microelectronics
Edition
Analysis and Design of Meyer Gray , Hurst,
3 Wiley 5/e, 2009
Analog Integrated Circuits Lewis

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
1 www.youtube.com/@b_razavi, www.youtube.com/@analogicdesign-iitm5234
2 www.youtube.com/@b_razavi, www.youtube.com/@analogicdesign-iitm5234
3 www.youtube.com/@b_razavi, www.youtube.com/@analogicdesign-iitm5234
4 Switching Circuits and Logic Design by Prof. Indranil SenguptaLectures 47-51
 SEMESTER S7

REAL TIME OPERATING SYSTEM

Course Code PEECT 753 CIE Marks 40

Teaching Hours/Week
3:0:0:0 ESE Marks 60
(L: T:P: R)

Credits 3 Exam Hours 2 Hrs. 30 Min.

Prerequisites (if any) None Course Type Theory

Course Objectives:

1. Introduce Real Time Operating Systems, its basic structure, building blocks and various
operations
2. Summarize the different scheduling algorithms used in RTOS.
SYLLABUS

Module Contact
Syllabus Description
No. Hours

Introduction to Real-Time Systems

Overview of Real-Time Systems: Definition and types of real-time

systems, Hard vs. soft real-time systems. Basic Concepts: Real-time tasks
and their characteristics, Task scheduling, Timing constraints and
requirements. RTOS Architectures: Monolithic kernels vs. microkernels.
RTOS examples: commercial vs Open RTOS and their comparison,
1
examples. Inter-Process Communication (IPC): Shared memory, Message 9
passing.

RTOS Environment Setup: Installation and setup of an RTOS on a

microcontroller (e.g., ARM Cortex-M), Task Creation and Management:
Writing simple tasks, Task states and transitions, Scheduling and Context
Switching: Implementing basic scheduling algorithms, Demonstrating
context switching with example tasks

2 Real-Time Scheduling and Synchronization

 9
Real-Time Scheduling Algorithms: Fixed-priority scheduling (Rate-
Monotonic, Deadline-Monotonic), Dynamic priority scheduling (Earliest
Deadline First), Priority based preemption, Round Robin, Task
Synchronization: Mutual exclusion, Priority inversion and inheritance
Inter-Task Communication: Semaphores, Mutexes, Event flags

Implementing Scheduling Algorithms: Practical implementation of

scheduling, Synchronization Mechanisms: Practical implementation of
semaphores and mutexes in task synchronization, Demonstrating priority
inversion and its mitigation: Real-Time Task Communication:
Implementing inter-task communication using queues and mailboxes

Real-Time System Design and Analysis

System Design Principles: Modular design, Time-triggered vs. event-

triggered systems, Worst-Case Execution Time (WCET) Analysis:
Techniques for WCET estimation, Timing analysis, Reliability and Fault
3 Tolerance: Redundancy, Error detection and recovery. 9

Designing a Real-Time System: Case study: Designing a real-time control

system, WCET Analysis Tools: Using tools for WCET analysis and timing
verification, Implementing Fault Tolerance: Practical implementation of
redundancy and error recovery mechanisms

Real-Time Operating System Services and Applications

Real-Time Operating System Services: Memory management, I/O

management. Real-Time Middleware: Middleware services for real-time
systems, Case Studies and Applications: Automotive systems, Aerospace
and defense, Medical devices
4
9
Memory Management in RTOS: Implementing dynamic memory
allocation, Real-Time Middleware Implementation: Developing
middleware components for a real-time application Case Study
Implementation: Implementing a real-time system for a specific application
(e.g., real-time data acquisition)
 Course Assessment Method
(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

Internal Internal
Assignment/
Attendance Examination-1 Examination- 2 Total
Microproject
(Written) (Written )

5 15 10 10 40

End Semester Examination Marks (ESE)

In Part A, all questions need to be answered and in Part B, each student can choose any one
full question out of two questions

Part A Part B Total

 2 Questions from each module.  Each question carries 9 marks.
 Total of 8 Questions, each  Two questions will be given from each module, out of
carrying 3 marks which 1 question should be answered. 60
 Each question can have a maximum of 3 sub divisions.
(8x3 =24marks) (4x9 = 36 marks)

Course Outcomes (COs)

At the end of the course students should be able to:

Bloom’s
Course Outcome Knowledge
Level (KL)
Understand the fundamental concepts and characteristics of real-time K1, K2
CO1 systems.

CO2 Analyze and implement real-time scheduling algorithms and techniques. K4

Conduct worst-case execution time (WCET) analysis for real-time K3, K4
CO3
tasks.
Utilize RTOS services and middleware for developing real-time K3,K4
CO4
applications
Develop practical real-time applications in various domains such as K3, K5, K6
CO5
automotive, aerospace, and medical devices.
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create
 CO-PO Mapping Table (Mapping of Course Outcomes to Program Outcomes)

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 3 2

CO2 3 3 2 3 2

CO3 3 3 2 2 2

CO4 3 3 2 2 2

CO5 3 3 2 2 2
Note: 1: Slight (Low), 2: Moderate (Medium), 3: Substantial (High), -: No Correlation

Text Books
Name of the Edition and
Sl. No Title of the Book Name of the Author/s
Publisher Year
CreateSpace
Real-Time Operating Systems
1 Jim Cooling Independent Publishing 1st 2018
Book 1: The Theory
Platform
Real-Time Systems: Theory and Rajib Mall
2 Pearson Education 2007
Practice
Real-Time Systems: Design
3 Principles for Distributed Hermann Kopetz Springer 2nd 2011
Embedded Applications
Embedded Systems: Real-Time CreateSpace
4 Operating Systems for Arm Jonathan W. Valvano Independent Publishing 3rd, 2017
Cortex-M Microcontrollers Platform
 Reference Books
Name of the Name of the Edition and
Sl. No Title of the Book
Author/s Publisher Year
C. M. Krishna, Kang G.
1 Real-Time Systems McGraw-Hill 2010
Shin,
2 Real-Time Systems Jane W. S. Liu Pearson Education 2009
Philip A. Laplante,
3 Real-Time Systems Design and Analysis Wiley 2012
Seppo J. Ovaska,

E-Man
Embedded Systems with ARM Cortex- Press LLC
4 M Microcontrollers in Assembly Yifeng Zhu 3rd , 2017
Language and C

Video Links (NPTEL, SWAYAM…)

Module No. Link ID

https://elearn.nptel.ac.in/shop/iit-workshops/completed/lab-workshop-on-embedded-
1 rtos/?v=c86ee0d9d7ed
https://onlinecourses.nptel.ac.in/noc21_cs98/preview

https://elearn.nptel.ac.in/shop/iit-workshops/completed/lab-workshop-on-embedded-
2
rtos/?v=c86ee0d9d7ed

https://elearn.nptel.ac.in/shop/nptel/real-time-operating-system/?v=c86ee0d9d7ed
3
https://onlinecourses.nptel.ac.in/noc21_cs98/preview
https://elearn.nptel.ac.in/shop/iit-workshops/completed/lab-workshop-on-embedded-
4
rtos/?v=c86ee0d9d7ed
 SEMESTER S7

CLIENT SERVER ARCHITECTURE

Course Code PEERT 754 CIE Marks 40

Teaching Hours/Week
3:1:0:0 ESE Marks 60
(L: T:P: R)

Credits 3 Exam Hours 2 Hrs. 30 Min.

Prerequisites (if any) None Course Type Theory

Course Objectives:

Understand fundamental concepts of Web Services including

1. Client Server systems

2. system models of distributed systems
3. networks that distributed systems run on
4. communication protocols between processes in distributed systems
5. Middleware
6. Enterprise Application integration
7. Web Services Security

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Introduction: Introduction to Client/Server computing - Driving forces
behind Client/ Server, Client/ Server development tools, Development of
client/server systems, Client/Server security, Organizational Expectations,
1 7
Improving performance of client/server applications, Single system image,
Downsizing and Rightsizing, Advantages of client server computing,
Applications of Client/Server.
Client/ Server Application and Network: Classification of Client/Server
Systems- Two-Tier Computing, Middleware, Three-Tier Computing- Model
2 View Controller (MVC), Principles behind Client/Server Systems. 8
Client/Server Topologies. Existing Client/Server Architecture. Architecture
for Business Information System..
 Client- Services, Request for services, RPC, Windows services, Print
services, Remote boot services, other remote services, Utility Services
Server- Detailed server functionality, Network operating system, Available
platforms, Server operating system.
Client/ Server Systems Development: Services and Support- System
administration, Availability, Reliability, Scalability, Observability, Agility,
Serviceability. Software Distribution, Performance, Network management.
Remote Systems Management- RDP, Telnet, SSH, Security. LAN and
3
Network Management issues, Training, Connectivity, Communication
interface technology, Interprocess communication, Wide area network
technologies, Network Acquisition, PC-level processing unit, X-terminals,
Server hardware. 8

Client/Server Technology and Web Services: Web Services History. Web

Server Technology- Web Server, Web Server Communication, Role of Java
for Client/Server on Web. Web Services- MicroServices, APIs, API
4 Gateway, Authentication of users/clients, Tokens/Keys for Authentication, 8
Service Mesh, Message Queues, SaaS, Web Sockets.Client/Server/Browser –
Server Technology, Client/Server Technology and Web Applications,
Balanced Computing and the Server’s Changing Role.

Course Assessment Method

(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

Internal Internal
Assignment/
Attendance Examination-1 Examination- 2 Total
Microproject
(Written) (Written )

5 15 10 10 40

End Semester Examination Marks (ESE)

In Part A, all questions need to be answered and in Part B, each student can choose any one
full question out of two questions
 Part A Part B Total
● 2 Questions from each ● Each question carries 9 marks.
module. ● Two questions will be given from each module,
● Total of 8 Questions, each out of which 1 question should be answered.
60
carrying 3 marks ● Each question can have a maximum of 3
subdivisions.
(8x3 =24 marks) (4x9 = 36 marks)

Course Outcomes (COs)

At the end of the course students should be able to:

Bloom’s
Course Outcome Knowledge
Level (KL)
Explain the basics of client/server systems and the driving force behind
CO1 K2
the development of client/server systems
CO2 Outline the architecture and classifications of client/server systems K2
Choose the appropriate client/server network services for a typical
CO3 K2
application
CO4 Describe management services and issues in network K2
Compare and summarize the web extensions and choose appropriate
CO5 K2
web services standards for an application
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create

CO-PO Mapping Table (Mapping of Course Outcomes to Program Outcomes)

PO1 PO1 PO1

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9
0 1 2
CO1 1 1 - - - - - - - - - 1
CO2 1 1 - - - - - - - - - 1
CO3 2 2 - - 1 - - - - - - 1
CO4 2 - - - - - - - - - - 1
CO5 2 2 2 - - - - - - - - 2
Note: 1: Slight (Low), 2: Moderate (Medium), 3: Substantial (High), -: No Correlation
 Text Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Patrick Smith & Steave 2nd Edition,
1 Client/ Server Computing Sam Publishers
Guengerich 1994
2 Client/ Server Computing Dawna Travis Dewire Mc Graw Hill 1993
An Indroduction to Client/ Subash Chandra Yadhav, New Age International 1st Edition,
3
Server Computing Sanjay Kumar Sigh Publishers 2009

Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Guide to Client- Server
1 Jerffrey D Schank Novell Press 1994
Application & Architecture
Robert Orfali , Dan 3rd Edition,
2 Client/ Server Survival Guide Wiley Indian Edition
Harkey , Jeri Edwards 1996
3 Client/ Server Applications W H Inman
4 Client/ Server Computing Dawna Travis Dewire Mc Graw Hill 1993
Developing Client/ Server
5 W H Inman
Application

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
1 https://archive.nptel.ac.in/courses/106/105/106105084/
2 https://www.geeksforgeeks.org/client-server-architecture-system-design/
3 https://intellipaat.com/blog/what-is-client-server-architecture/
4 https://www.tutorialspoint.com/client-server-computing
5 https://www.simplilearn.com/what-is-client-server-architecture-article
 SEMESTER S7

SPEECH AND AUDIO PROCESSING

Course Code PEECT 756 CIE Marks 40

Teaching Hours/Week
3:0:0:0 ESE Marks 60
(L: T:P: R)

Credits 4/3 Exam Hours 2 Hrs. 30 Min.

Prerequisites (if any) None Course Type Theory

Course Objectives:

1. To impart the basic concepts of speech signal processing

2. To familiarize the auditory mechanism and speech perception
SYLLABUS

Module Contact
Syllabus Description
No. Hours
Speech Production: - Acoustic theory of speech production- -Source/Filter
model - Pitch, Formant, Spectrogram-- Discrete model for speech
1 production, Articulatory Phonetics -Acoustic Phonetics- Basic speech units
9
and their classification.

Short-Time Speech Analysis, Windowing, STFT, spectra of windows- Wide

and narrow band spectrogram -Time domain parameters (Short time energy,

2 short time zero crossing Rate, ACF). Frequency domain parameters-Filter

bank analysis. STFT Analysis. Prosody of speech. MFCC-computation, LPC 9
Model, Pitch and Formant Estimation.

Speech Enhancement: Spectral subtraction and Filtering, Harmonic

filtering, parametric resynthesis. Speaker Recognition: Speaker verification
3 9
and speaker identification- log-likelihood. Machine learning models in
Speaker Recognition. Language identification: implicit and explicit models.
Signal Processing models of audio perception: Basic anatomy of hearing
System: Basilar membrane behaviour. Sound perception: Auditory Filter
4
Banks, Critical Band Structure, Absolute Threshold of Hearing, Masking- 9
Simultaneous Masking, Temporal Masking. Models of speech perception
 Course Assessment Method
(CIE: 40 marks, ESE: 60 marks)
Continuous Internal Evaluation Marks (CIE):

Internal Internal
Assignment/
Attendance Examination-1 Examination- 2 Total
Microproject
(Written) (Written )

5 15 10 10 40

End Semester Examination Marks (ESE)

In Part A, all questions need to be answered and in Part B, each student can choose any one
full question out of two questions

Part A Part B Total

 2 Questions from each module.  Each question carries 9 marks.
 Total of 8 Questions, each  Two questions will be given from each module, out of
carrying 3 marks which 1 question should be answered. 60
 Each question can have a maximum of 3 sub divisions.
(8x3 =24marks) (4x9 = 36 marks)

Course Outcomes (COs)

At the end of the course students should be able to:

Bloom’s
Course Outcome Knowledge
Level (KL)
To describe the fundamental concepts, principles, and theories of speech K1
CO1
production
CO2 To analyse the speech signal in the time and frequency domain K2
CO3 To apply speech processing concepts in real-world applications K3
To describe the fundamental concepts, principles, and theories of hearing K1
CO4
mechanism
To develop applications by combining concepts of speech production and K3
CO5
hearing mechanism
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create
 CO-PO Mapping Table (Mapping od Course Outcomes to Program Outcomes)

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3
CO2 3 2
CO3 3 2
CO4 3
CO5 3 2 3 3 3 3 2
Note: 1: Slight (Low), 2: Moderate (Medium), 3: Substantial (High), -: No Correlation

Text Books
Name of the Edition and
Sl. No Title of the Book Name of the Author/s
Publisher Year
Speech Communications:
1 Human and Machine, 2nd Douglas O'Shaughnessy Wiley-IEEE Press 2nd edition
Edition
Discrete-Time Speech Signal
Prentice-Hall Signal
2 Processing: Principles and Thomas F. Quatieri 2001
Processing Series
Practice

Reference Books
Name of the Edition and
Sl. No Title of the Book Name of the Author/s
Publisher Year
Digital Processing of Speech
1 Signals Rabinar Pearson 2003
 Video Links (NPTEL, SWAYAM…)

Module No. Link ID

Speech and Audio Processing 1: Introduction to Speech Processing - Professor E. Ambikairajah
1
https://www.youtube.com/watch?v=Xjzm7S__kBU
Speech Analysis - Professor E. Ambikairajah
2
https://www.youtube.com/watch?v=Y_mSQ7tTlvQ&t=38s
Speech and Audio Processing 1: Introduction to Speech Processing - Professor E. Ambikairajah
3
https://www.youtube.com/watch?v=Xjzm7S__kBU
4 Video Links available on hearing anatomy
 SEMESTER S7

NEURAL NETWORKS AND DEEP LEARNING

Course Code PEERT 755 CIE Marks 40

Teaching Hours/Week 3:0:0:0 ESE Marks 60
(L: T:P: R)
Credits 5/3 Exam Hours 2Hr.30 Min.

Prerequisites (if any) None Elective

Course Objectives:

1. To introduce the fundamental concepts of neural networks, including their structure, function,
and basic training algorithms.

2. To provide an understanding of deep learning concepts, architectures, and key techniques for
training deep neural networks.

3. To explore advanced neural network architectures and techniques, including optimization

methods and regularization techniques.

4. To explore real-world applications of deep learning and discuss the latest trends and future
directions in the field.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Introduction to Neural Networks: Overview of Artificial Neural Networks
(ANNs), Biological Neurons vs. Artificial Neurons, Applications of Neural
Networks, Neuron Model: Activation Functions (Sigmoid, ReLU, Tanh),
1 Single-layer Perceptron: Theory and Implementation, Multi-layer 9
Perceptrons (MLPs), Backpropagation Algorithm: Concepts and
Mathematical Foundations

Deep Learning Fundamentals: Introduction to Deep Learning, Differences

2 Between Shallow and Deep Networks, Convolutional Neural Networks 9
(CNNs): Architecture and Applications, Pooling Layers and Feature Maps,
 Training Deep Networks: Vanishing and Exploding Gradients, Recurrent
Neural Networks (RNNs): Architecture and Applications, Long Short-Term
Memory (LSTM) Networks

Advanced Neural Network Architectures: Autoencoders: Concept,

Architecture, and Applications, Variational Autoencoders (VAEs),
Generative Adversarial Networks (GANs): Theory and Architecture,
3 Applications of GANs in Image Generation and Data Augmentation, 9
Optimization Techniques: Gradient Descent, Adam, RMSprop,
Regularization Methods: Dropout, Batch Normalization

Applications and Emerging Trends in Deep Learning: Deep Learning in

Computer Vision: Object Detection, Segmentation, Deep Learning in

4 Natural Language Processing: Word Embeddings, Transformers, Deep 9

Reinforcement Learning: Concepts and Applications, Emerging Trends:
Federated Learning, Explainable AI,

Course Assessment Method

(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

Attendance Internal Ex Evaluate Analyse Total

5 15 10 10 40

Criteria for Evaluation (Evaluate and Analyse): 20 marks

Evaluation Methods:
1. Experiments Using Software Tools: (10 marks)

Introduction to Neural Network Libraries (e.g., TensorFlow, Keras)

Building a Simple Perceptron Model

Implementing Backpropagation in a Neural Network

Implementing Deep Neural Networks with Keras

 Building and Training a CNN for Image Classification

Implementing an RNN for Sequence Prediction

Implementing an Autoencoder for Data Compression

Implementing a Simple GAN for Image Generation

Applying Regularization Techniques to Improve Model Performance

Implementing a Transformer Model for Text Classification

2. Criteria for Evaluation: Course Project (10 marks)

1. Project Proposal and Planning (2 marks)

● Submits a well-defined project proposal outlining objectives, methodology, and
expected outcomes.
● Demonstrates thorough planning and a clear timeline for the project.
2. Design and Implementation (3 marks)
● Implements the project design accurately using appropriate tools and techniques.
● The design is functional and meets the project objectives.
2. Innovation and Creativity (2 marks)
● Introduces innovative ideas or unique approaches in the design and implementation.
● Demonstrates creativity in solving problems or optimizing designs.
2. Analysis and Testing (2 marks)
● Effectively analyzes the project design to identify and address any issues.
● Conducts thorough testing to verify the functionality and performance of the design.
2. Final Report and Presentation (1 mark)
● Submits a comprehensive final report detailing the project, including objectives,
design, methodology, analysis, and results.
● Clearly presents the project and its outcomes, and effectively communicates the key
points.

End Semester Examination Marks (ESE):

In Part A, all questions need to be answered and in Part B, each student can choose any one
full question out of two questions
 Part A Part B Total
● 2 Questions from each 2 questions will be given from each module, out of
module. which 1 question should be answered. Each
● Total of 8 Questions, question can have a maximum of 3 sub divisions. 60
each carrying 3 marks Each question carries 9 marks.
(8x3 =24marks) (4x9 = 36 marks)

Course Outcomes (COs)

At the end of the course students should be able to:

Bloom’s
Course Outcome Knowledge
Level (KL)
Analyze and implement the basic structure and functioning of neural K3
CO1
networks and apply the backpropagation algorithm for training.
Demonstrate the ability to design, train, and evaluate deep neural K2
CO2 network architectures, including Convolutional Neural Networks and
Recurrent Neural Networks.
Evaluate and apply advanced neural network architectures, including K4
Autoencoders and Generative Adversarial Networks, to solve real-
CO3
world problems, and optimize models using advanced techniques such
as regularization and optimization algorithms.
Synthesize knowledge of deep learning applications in fields like K4
CO4 computer vision, natural language processing, and reinforcement
learning.
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create

CO-PO Mapping Table (Mapping of Course Outcomes to Program Outcomes)

PO1 PO1 PO1

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9
0 1 2
CO1 3 2 3 2 3 2
CO2 3 2 3 2 3 2
CO3 3 2 3 2 3 2
CO4 3 2 3 2 3 2
Note: 1: Slight (Low), 2: Moderate (Medium), 3: Substantial (High), -: No Correlation
 Text Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Ian Goodfellow, 1stEdition,
1 Deep Learning Yoshua Bengio, and MIT Press 2016
Aaron Courville
Deep Learning: A Adam Gibson and Josh 1stEdition,
2 O'Reilly Media
Practitioner's Approach Patterson 2020

Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Neural Networks: A 2ndEdition
1 Simon Haykin Prentice Hall
Comprehensive Foundation , 1998
Deep Learning for Computer Rajalingappaa 2ndEdition
2 Packt Publishing
Vision Shanmugamani 2022
2nd
Neural Networks and Deep
3 Charu C. Aggarwal Springer Edition,
Learning: A Textbook
2024

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
1 https://nptel.ac.in/courses/117105084
2 https://nptel.ac.in/courses/106106184
3 https://nptel.ac.in/courses/106106184
4 https://nptel.ac.in/courses/106106184
 SEMESTER S7

SENSORS AND INSTRUMENTATION

Course Code OEERT721 CIE Marks 40

Teaching Hours/Week
3:0:0:0 ESE Marks 60
(L: T:P: R)

Credits 3 Exam Hours 2 Hrs. 30 Min.

Prerequisites (if any) None Course Type Theory

Course Objectives:

1. Students will be able to identify and differentiate between various types of sensors and their
applications.
2. Students will learn about different measurement instruments.
SYLLABUS

Module Contact
Syllabus Description
No. Hours
Introduction to sensor based measurement systems: General concepts
and terminology, sensor classification, Primary Sensors, material for
1 sensors, micro sensor technology. 8
Self-generating Sensors-Thermoelectric sensors, piezoelectric sensors,
pyroelectric sensors, photovoltaic sensors, electrochemical sensors.
Principles of Measurement: Static Characteristics, Error in
Measurement, Types of Static Error. Multirange Ammeters,
2 Multirange voltmeter. Digital Voltmeter: Ramp Technique, Dual slope 8
integrating Type DVM, Direct Compensation type and Successive
Approximations type DVM
Digital Multimeter: Digital Frequency Meter and Digital
Measurement of Time, Function Generator. Bridges: Measurement of
3 8
resistance: Wheatstone's Bridge, AC Bridges - Capacitance and
Inductance Comparison bridge, Wien's bridge.
 Transducers: Introduction, Electrical Transducer, Resistive Transducer,
Resistive position Transducer, Resistance Wire Strain Gauges, Resistance
4 8
Thermometer, Thermistor, LVDT. Instrumentation Amplifier using
Transducer Bridge, Temperature indicators using Thermometer.

Course Assessment Method

(CIE: 40 marks, ESE: 60 marks)
Continuous Internal Evaluation Marks (CIE):

Internal Internal
Assignment/
Attendance Examination-1 Examination- 2 Total
Microproject
(Written) (Written )

5 15 10 10 40

End Semester Examination Marks (ESE)

In Part A, all questions need to be answered and in Part B, each student can choose any one
full question out of two questions

Part A Part B Total

 2 Questions from each  Each question carries 9 marks.
module.  Two questions will be given from each module, out
 Total of 8 Questions, each of which 1 question should be answered.
60
carrying 3 marks  Each question can have a maximum of 3 sub
divisions.
(8x3 =24marks) (4x9 = 36 marks)
 Course Outcomes (COs)

At the end of the course students should be able to:

Bloom’s
Course Outcome Knowledge
Level (KL)
CO1 Understand the Sensor Concepts and Classification K2
CO2 Gain knowledge of self-generating sensors K2
CO3 Understand the principles of measurement K3
CO4 Understand the various types of transducers K3
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create

CO-PO Mapping Table (Mapping of Course Outcomes to Program Outcomes)

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 2 2 1
CO2 3 2 2 2 1
CO3 3 3 2 2
CO4 3 3 2 2 1
Note: 1: Slight (Low), 2: Moderate (Medium), 3: Substantial (High), -: No Correlation

Text Books
Name of the Edition and
Sl. No Title of the Book Name of the Author/s
Publisher Year

Electronic Instrumentation & Oxford University 2ndEdition,

1 David A. Bell
Measurements. Press PHI 2006.

Modern Electronic
D. Helfrick and W.D. 1stEdition,
2 Instrumentation and Measuring Pearson
Cooper 2015,
Techniques.
Sensors and Signal Ramon Pallas Areny, John Wiley and 2ndEdition,
3
Conditioning. JohnG. Webster, Sons 2000.
rd
3 Edition,
4 Electronic Instrumentation H.S.Kalsi Mc Graw Hill
2012
 Reference Books
Sl. Name of the Name of the
Title of the Book Edition and Year
No Author/s Publisher
Measurement Systems: 7thedition 2019
1 Ernest O. Doebelin McGraw-Hill
Application and Design
Transducers and
2 D. V. S. Murty PHI 2nd edition and 2008
Instrumentation
Electronic Measurement and
3 K. Lal Kishore Pearson 1st edition 2009
Instrumentation
Electrical and Electronic
Dhanpat and 19th revised edition
4 Measurements and A.K. Sawhney
Rai 2011
Instrumentation

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
1 https://onlinecourses.nptel.ac.in/noc23_ee105/preview
2 https://onlinecourses.nptel.ac.in/noc21_ee107/preview
 SEMESTER S7

BIOMEDICAL INSTRUMENTATION

Course Code OEERT 722 CIE Marks 40

Teaching Hours/Week
3:0:0:0 ESE Marks 60
(L: T:P: R)

Credits 3 Exam Hours 2 Hrs. 30 Min.

Prerequisites (if any) NIL Course Type Theory

Course Objectives:

1. To understand various bio potentials and its recording

2. To illustrate the working of various diagnostic equipment
3. To illustrate the working of various therapeutic equipment
4. To describe the imaging techniques used in clinical applications
SYLLABUS

Module Contact
Syllabus Description
No. Hours

Introduction to human physiological system

Physiological systems of the body (brief discussion on Heart and cardio

vascular system, Anatomy of nervous system, Physiology of respiratory
1 systems) Problems encountered in biomedical measurements. 9

Sources of bioelectric potentials – resting and action potentials -propagation

of action potentials – bioelectric potentials example (ECG, EEG, EMG,
ERG, EOG, EGG etc.)

Bio potential electrodes, ECG and BP Measurement

Bio potential electrodes –basic theory – microelectrodes – skin surface

electrodes – needle electrodes
2 9
Instrumentation for clinical laboratory: Bio Potential amplifiers
instrumentation amplifiers, isolation amplifiers, chopper amplifier

Electro conduction system of the heart, Electro cardiograph –electrodes and

 leads – Einthoven triangle, ECG readout devices ECG machine – block
diagram

Measurement of blood pressure – direct and indirect measurement–

oscillometric measurement –ultrasonic method.

Measurement EEG, EMG Respiratory Parametersand Therapeutic

devices

Electro encephalogram –EEG measurement Electromyogram (EMG) –

3 Nerve conduction velocity measurements- 9

Respiratory parameters – Spiro meter, pneumograph.

Therapeutic devices- Pacemakers – defibrillators-heart lung machine,

haemodialysis -Surgical diathermy.

Advances in Radiological Imaging and Electrical safety

X-rays- principles of generation, uses of X-rays- Basic principle of computed

tomography, magnetic resonance imaging system and nuclear medicine
4 system. Ultrasonic imaging system 9

Electrical safety– physiological effects of electric current –shock hazards

from electrical equipment –method of accident prevention, introduction to
telemedicine

Course Assessment Method

(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

Internal Internal
Assignment/
Attendance Examination-1 Examination- 2 Total
Microproject
(Written) (Written )

5 15 10 10 40
 End Semester Examination Marks (ESE)

In Part A, all questions need to be answered and in Part B, each student can choose any one
full question out of two questions

Part A Part B Total

● 2 Questions from each ● Each question carries 9 marks.
module. ● Two questions will be given from each module, out
● Total of 8 Questions, each of which 1 question should be answered.
60
carrying 3 marks ● Each question can have a maximum of 3 sub
divisions.
(8x3 =24marks) (4x9 = 36 marks)

Course Outcomes (COs)

At the end of the course students should be able to:

Bloom’s
Course Outcome Knowledge
Level (KL)
CO1 To understand the physiology of major systems of human body K2
CO2 To understand various bio potentials and its recording K1
CO3 To illustrate the working of various diagnostic equipment K2
CO4 To illustrate the working of various therapeutic equipment K2

CO5 To describe the imaging techniques used in clinical applications K2

Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create

CO-PO Mapping Table (Mapping od Course Outcomes to Program Outcomes)

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 3
CO2 3 3
CO3 3 3
CO4 3 3
CO5 3 3
Note: 1: Slight (Low), 2: Moderate (Medium), 3: Substantial (High), -: No Correlation
 Text Books
Name of the Edition and
Sl. No Title of the Book Name of the Author/s
Publisher Year
L. Cromwell, F. J.
Biomedical Instrumentation
1 Weibell and L. A. Pearson education 2ndEdton1990
Measurements
Pfeiffer
Handbook of Biomedical
2 R. S. Khandpur Tata McGraw Hill
Instrumentation
Introduction to Biomedical J. J. Carr and J. M.
3 Pearson Education
Equipment Technology Brown

Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Medical Instrumentation,
1 J. G. Webster John Wiley and Sons
Application and Design
John Enderele , Susan Introduction to
2 Academic Press
Blanchard, Joseph Bronzino Biomedical Engg
Biomedical Instruments,
3 Welkovitz Elselvier
Theory and Design
Jerry L Prince, Jonathan M Medical Imaging Signals
4 Pearson Education
Links & Systems
 SEMESTER S7

EMBEDDED SYSTEM DESIGN AND APPLICATIONS

Course Code OEERT 723 CIE Marks 40

Teaching Hours/Week
3:0:0:0 ESE Marks 60
(L: T:P: R)

Credits 3 Exam Hours 2 Hrs. 30 Min.

Microprocessors and
Prerequisites (if any) Course Type Theory
Microcontrollers

Course Objectives:

1. This course aims to introduce the design of embedded electronic systems and its applications.
SYLLABUS

Module Contact
Syllabus Description
No. Hours
Embedded System Components: Embedded Systems vs. General Computing
Systems, Classification of Embedded Systems, Major Application Areas of
1 Embedded Systems, Purpose of Embedded Systems, Core of the Embedded
System, Memory, Sensors and Actuators, Communication Interface, 9
Embedded Firmware, Other System Components.
Embedded System Design Concepts: Characteristics of an Embedded
System, Quality Attributes of Embedded Systems, Application-Specific
Embedded System, Domain Specific Examples of Embedded System,
2
Fundamental Issues in Hardware Software Co-Design, Computational
9
Models in Embedded Design, Embedded Firmware Design Approaches,
Embedded Firmware Development Languages.
Design and Development of Embedded Product: Embedded Hardware
Design and Development, Embedded Firmware Design and Development:
3 Embedded firmware Design Approaches, Embedded firmware Development
Languages, Programming in Embedded ‘C’. Real Time Operating System 9
(RTOS) based Embedded System Design: Operating System Basics, Types
 of Operating Systems, Tasks, Process and Threads, Multiprocessing and
Multitasking, Task Scheduling, Threads, Processes and Scheduling: Putting
them altogether, Task Communication, Task Synchronisation, Device
Drivers, How to choose an RTOS.
Design and Development of Embedded Systems: Integration of Hardware &
Firmware, Board Power up. The Embedded System Development
Environment: Integrated Development Environment (IDE), Types of files
4 generated on cross-compilation, Disassembler/Decompiler, Simulators, 9
Emulators & Debugging, Target Hardware Debugging, Boundary Scan.
Product Enclosure Design & Development: Product Enclosure Design Tools,
Product Enclosure Development Techniques.

Course Assessment Method

(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

Internal Internal
Assignment/
Attendance Examination-1 Examination- 2 Total
Microproject
(Written) (Written )

5 15 10 10 40

End Semester Examination Marks (ESE)

In Part A, all questions need to be answered and in Part B, each student can choose any one
full question out of two questions

Part A Part B Total

● 2 Questions from each ● Each question carries 9 marks.
module. ● Two questions will be given from each module, out
● Total of 8 Questions, each of which 1 question should be answered.
60
carrying 3 marks ● Each question can have a maximum of 3 sub
divisions.
(8x3 =24marks) (4x9 = 36 marks)
 Course Outcomes (COs)

At the end of the course students should be able to:

Bloom’s
Course Outcome Knowledge
Level (KL)
Understanding of Embedded Systems Concepts, its classification and K2
CO1
applications
Understand application-specific embedded systems by familiarizing K2
CO2 their characteristics, quality attributes, and hardware-software co-
design principles.
To understand the design concepts of embedded products, with K2
CO3 proficiency in embedded hardware and firmware, real-time operating
systems, and task management.
Understand the skills to integrate hardware and firmware, utilize K2
CO4 development environments and debugging tools, and design and
develop product enclosures for embedded systems.
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create

CO-PO Mapping Table (Mapping od Course Outcomes to Program Outcomes)

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 2 2 1
CO2 3 3 3 2
CO3 3 3 3 2
CO4 3 3 2
Note: 1: Slight (Low), 2: Moderate (Medium), 3: Substantial (High), -: No Correlation
 Text Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Tata McGraw Hill
Introduction to Embedded 2nd Edition,
1 Shibu K.V. Education Private
Systems, 2017
Limited, New Delhi
Alpha Science
International
Embedded Systems: Design,
2 A K Ganguly Ltd 2014
Programming and Applications

Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year

Embedded Systems, A
1 J. K. Peckol Wiley Student
Contemporary Design Tool 2009
edition
4th edition,
2 Embedded System Design Peter Marwedel Springer
2022
Programming Embedded
3 Michael Barr O'Reilly 1999
Systems in C and C++
Embedded System C. Baron, J. Geffroy Springer-Verlag
4 2010
Applications and G. Motet New York Inc.

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
1 https://onlinecourses.nptel.ac.in/noc23_cs54/preview
2 https://onlinecourses.nptel.ac.in/noc20_ee98/preview
3 http://www.digimat.in/nptel/courses/video/106105159/L01.html
 SEMESTER 7

DIGITAL IMAGE PROCESSING

Course Code OEERT 724 CIE Marks 40

Teaching Hours/Week
3:0:0:0 ESE Marks 60
(L: T:P: R)

Credits 3 Exam Hours 2 Hrs. 30 Min.

Prerequisites (if any) Linear Algebra Course Type Theory

Course Objectives:

1. To introduce the fundamental concepts of Digital Image Processing and study the various
transforms required for image processing.
2. To study spatial and frequency domain image enhancement and image restoration methods.
3. To understand image compression and segmentation techniques.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Digital Image Fundamentals: Image representation, Types of images,
Elements of DIP system, Basic relationship between pixels, Distance
1 Measures, Simple image formation model. Brightness, contrast, hue,
saturation, Mach band effect. Colour image fundamentals-RGB, 9

CMY, HIS models, 2D sampling and quantization.

2D Image transforms: DFT, Properties, Walsh transform, Hadamard
transform, Haar transform, DCT, KL transform and Singular Value
Decomposition.
2
Image Compression: Image compression model, Lossy, lossless
9
compression, Concept of transform coding, JPEG Image compression
standard.
Image Enhancement: Spatial domain methods: Basic Gray Level
3 Transformations, Histogram Processing, Enhancement Using 9
Arithmetic/Logic Operations, Basics of Spatial Filtering, Smoothing
 spatial Filters, Sharpening spatial Filters.
Frequency domain methods: low pass filtering, high pass filtering,
homomorphic filtering.
Image Restoration: Degradation model, Inverse filtering- removal of
blur caused by uniform linear motion, Minimum Mean Square Error
4 (Wiener) Filtering.
9
Image segmentation: Region based approach, clustering, Segmentation
based on thresholding, edge based segmentation, Hough Transform.

Course Assessment Method

(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

Internal Internal
Assignment/
Attendance Examination-1 Examination- 2 Total
Microproject
(Written) (Written )

5 15 10 10 40

End Semester Examination Marks (ESE)

In Part A, all questions need to be answered and in Part B, each student can choose any one
full question out of two questions

Part A Part B Total

● 2 Questions from each ● Each question carries 9 marks.
module. ● Two questions will be given from each module, out
● Total of 8 Questions, each of which 1 question should be answered.
60
carrying 3 marks ● Each question can have a maximum of 3 sub
divisions.
(8x3 =24marks) (4x9 = 36 marks)
 Course Outcomes (COs)

At the end of the course students should be able to:

Bloom’s
Course Outcome Knowledge
Level (KL)
CO1 Understand different components of image processing system K2
Analyse the various concepts and mathematical transforms necessary K3
CO2
for image processing
CO3 Illustrate the various schemes of image compression K3

CO4 Understand the basic image segmentation techniques K3

CO5 Analyze the filtering and restoration of images K2

Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create

CO-PO Mapping Table (Mapping od Course Outcomes to Program Outcomes)

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 3 3 1 2
CO2 3 3 3 1 2
CO3 3 3 3 1 2
CO4 3 3 3 1 2
CO5 3 3 3 1 2
Note: 1: Slight (Low), 2: Moderate (Medium), 3: Substantial (High), -: No Correlation

Text Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
1 Digital Image Processing Gonzalez Rafel C Pearson Education 4/e, 2019
S Jayaraman, S
Tata McGraw Hill
2 Digital Image Processing Esakkirajan, T 2009
Education
Veerakumar
 Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year

1 Digital Image Processing Kenneth R Castleman

Pearson Education 2/e,2003
Fundamentals of digital image
2 Anil K Jain PHI 1988
processing
John Wiley
3 Digital Image Processing Pratt William K 4/e,2007

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
1 https://archive.nptel.ac.in/courses/117/105/117105135
2 https://archive.nptel.ac.in/courses/106/105/106105216
3 https://nptel.ac.in/courses/117105079
4 https://nptel.ac.in/courses/106105032
 SEMESTER S7

CONCEPTS IN MACHINE LEARNING

OEERT 725
Course Code CIE Marks 40

Teaching Hours/Week (L:

3:0:0:0 ESE Marks 60
T:P: R)

Credits 3 Exam Hours 2 Hrs. 30 Min.

Prerequisites (if any) None Course Type Theory

Course Objectives:

1. To understand the concepts and algorithms in machine learning and the most popular
supervised and unsupervised learning algorithms
2. To help the students provide machine learning-based solutions to real world problems
SYLLABUS

Module Contact
Syllabus Description
No. Hours
Introduction to ML

Machine Learning vs. Traditional Programming, Machine learning

paradigms - supervised, semi-supervised, unsupervised, reinforcement
learning.

Basics of parameter estimation - maximum likelihood estimation (MLE)

and maximum aposteriori estimation (MAP), Bayesian formulation.
1
Supervised Learning

Feature Representation and Problem Formulation, Role of loss functions and

optimization

Regression - Linear regression with one variable, Linear regression with

multiple variables - solution using gradient descent algorithm and matrix
method.
 Classification - Naïve Bayes, KNN

Generalisation and Overfitting - Idea of overfitting, LASSO and RIDGE

regularization, Idea of Training, Testing, Validation

Evaluation measures – Classification - Precision, Recall, Accuracy, F-

2
Measure, Receiver Operating Characteristic Curve(ROC), Area Under Curve
(AUC).

Regression - Mean Absolute Error (MAE),

Root Mean Squared Error (RMSE), R Squared/Coefficient of Determination.

Neural Networks (NN) - Perceptron, Neural Network - Multilayer feed-
forward network, Activation functions (Sigmoid, ReLU, Tanh), Back
3 propagation algorithm.

Decision Trees – Information Gain, Gain Ratio, ID3 algorithm

Unsupervised Learning

Clustering - Similarity measures, Hierarchical Clustering - Agglomerative

Clustering, partitional

clustering, K-means clustering

4 Dimensionality reduction - Principal Component Analysis,

Multidimensional scaling

Ensemble methods- bagging, boosting

Resampling methods - Bootstrapping, Cross Validation. Practical aspects -

Bias-Variance trade-off.

Course Assessment Method

(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

Internal Internal
Assignment/
Attendance Examination-1 Examination- 2 Total
Microproject
(Written) (Written )

5 15 10 10 40
 End Semester Examination Marks (ESE)

In Part A, all questions need to be answered and in Part B, each student can choose any one
full question out of two questions

Part A Part B Total

 2 Questions from each module.  Each question carries 9 marks.
 Total of 8 Questions, each  Two questions will be given from each module, out of
carrying 3 marks which 1 question should be answered. 60
 Each question can have a maximum of 3 sub divisions.
(8x3 =24marks) (4x9 = 36 marks)

Course Outcomes (COs)

At the end of the course students should be able to:

Bloom’s
Course Outcome Knowledge
Level (KL)
Illustrate Machine Learning concepts and basic parameter estimation K2
CO1
methods.
CO2 Demonstrate supervised learning concepts (regression, classification). K3

CO3 Illustrate the concepts of Multilayer neural network and Decision trees K3
Describe unsupervised learning concepts and dimensionality reduction K3
CO4
techniques
Use appropriate performance measures to evaluate machine learning K3
CO5
models
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create

CO-PO Mapping Table (Mapping of Course Outcomes to Program Outcomes)

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 3 3 3 3 3
CO2 3 3 3 3 3 3
CO3 3 3 3 3 3 3
CO4 3 3 3 3 3 3
CO5 3 3 3 3 3 3
Note: 1: Slight (Low), 2: Moderate (Medium), 3: Substantial (High), -: No Correlation
 Text Books
Name of the Edition and
Sl. No Title of the Book Name of the Author/s
Publisher Year
2nd edition,
1 Introduction to Machine Learning Ethem Alpaydin MIT Press
2010

Data Mining and Analysis: First South

Fundamental Concepts and Mohammed J. Zaki and Cambridge University
2 Asia edition,
Algorithms Wagner Meira Press
2016

Reference Books
Name of the Edition and
Sl. No Title of the Book Name of the Author/s
Publisher Year
1 Machine Learning Tom Mitchell McGraw-Hill 1997
Neural Networks for Pattern
2 Christopher Bishop Oxford University Press 1995
Recognition
Machine Learning: A
3 Kevin P Murphy MIT Press 2012.
Probabilistic Perspective
Trevor Hastie, Robert
The Elements Of Statistical Second
4 Tibshirani, Jerome Springer
Learning edition, 2007
Friedman

Video Links (NPTEL, SWAYAM…)

Module No. Link ID

1 https://youtu.be/fC7V8QsPBec?si=8kqBn-_7x1RG5V1J
2 https://youtu.be/g__LURKuIj4?si=Xj10NPfMfpQSOhVx

3 https://youtu.be/yG1nETGyW2E?si=ySlxpeWuFAUQBf7-

4 https://youtu.be/zop2zuwF_bc?si=W7TpSHLdi4rykva4
 SEMESTER 8
ELECTRONICS & COMPUTER
ENGINEERING
 SEMESTER S8

PLC AND DATA ACQUISITION SYSTEM

Course Code PEERT861 CIE Marks 40

Teaching Hours/Week
3:0:0:0 ESE Marks 60
(L: T:P: R)

Credits 3 Exam Hours 2 Hrs. 30 Min.

Basics of analog and
Prerequisites (if any) Course Type Theory
digital electronics

Course Objectives:

1. To understand the fundamental of PLC

2. To develop programs using various functions available with PLC.
3. To understand various industrial applications of PLCs.
4. To understand the basics of data acquisition systems.
SYLLABUS

Module Contact
Syllabus Description
No. Hours
Basics of PLC-PLC advantages and disadvantages- Architecture of PLC-
Scan Cycles–Types of PLC- PLC Programming languages – Relay logic–
1
Ladder logic–connecting PLC to computer PLC Troubleshooting and
9
Maintenance.
Programming of Timers – ON delay, OFF delay, Retentive Timers – PLC
Timer functions –Examples of timer function Industrial application.
2 Programming Counters – Up/Down counter –Examples of counter
function Industrial application. PLC Arithmetic Functions – PLC number 9
Comparison function
PLC Program Control Instructions: Master Control -Reset - Skip – Jump
and Move Instructions. Sequencer instructions - Types of PLC Analog
3 modules and systems, PLC analog signal processing –Case study of Tank 9
level control system, bottle filling system and Sequential switching of
motors
 Sampling theorem – Sampling and digitizing – Aliasing – Sample and
hold circuit – Practical implementation of sampling and digitizing –
4 Definition, design and need for data acquisition systems – Interfacing
9
ADC and DAC with Microprocessor / Multiplexer - Multiplexed channel
operation –Microprocessor/PC based acquisition systems.

Course Assessment Method

(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

Internal Internal
Assignment/
Attendance Examination-1 Examination- 2 Total
Microproject
(Written) (Written )

5 15 10 10 40

End Semester Examination Marks (ESE)

In Part A, all questions need to be answered and in Part B, each student can choose any one
full question out of two questions

Part A Part B Total

● 2 Questions from each ● Each question carries 9 marks.
module. ● Two questions will be given from each module, out
● Total of 8 Questions, each of which 1 question should be answered.
60
carrying 3 marks ● Each question can have a maximum of 3 sub
divisions.
(8x3 =24marks) (4x9 = 36 marks)
 Course Outcomes (COs)

At the end of the course students should be able to:

Bloom’s
Course Outcome Knowledge
Level (KL)
CO1 Understand the fundamental of PLC based systems K2
CO2 Develop programs using various functions available with PLC. K3
CO3 Understand various industrial applications of PLCs. K2

CO4 Understand the basics of data acquisition systems. K2

Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create

CO-PO Mapping Table (Mapping od Course Outcomes to Program Outcomes)

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 3 3
CO2 3 3 3 3
CO3 3 3 3
CO4 3 2 3 3
Note: 1: Slight (Low), 2: Moderate (Medium), 3: Substantial (High), -: No Correlation

Text Books
Sl. Name of the Edition and
Title of the Book Name of the Author/s
No Publisher Year
1 Programmable Logic Controllers Petrezeulla McGraw Hill 1989
Programmable logic controllers- John W.Webb& Ronald
2 PHI 5e,2010
principles and applications A.Reis
Process Control Instrumentation
3 Curtis D. Johnson. PH 8e,2005
Technology
 Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Programmable Logic
1 Hughes .T, ISA Press 1989.
Controllers
The Mac Millian Press
2 Data Converters, G. B. Clayton 1982.
Ltd.,
Linear Integrated circuits D. Roy Choudhury and New age International
3 2003.
Shail B. Jain, Pvt. Ltd

Video Links (NPTEL, SWAYAM…)

Module No. Link ID

1 https://nptel.ac.in/courses/108105063
2 https://nptel.ac.in/courses/108105088

3 https://nptel.ac.in/courses/112102011
 SEMESTER S8

ELECTRONIC PRODUCT DESIGN

Course Code PEERT862 CIE Marks 40

Teaching Hours/Week
3: 0:0:0 ESE Marks 60
(L: T:P: R)

Credits 3 Exam Hours 2 Hrs. 30 Min.

Prerequisites (if any) None Course Type Theory

Course Objectives:

1. The course will help the students to understand the product development process for
realization of the product.
2. The course will help the students to understand the packaging and modelling of electronic
product
SYLLABUS

Module Contact
Syllabus Description
No. Hours
Definition of a product, Product Classification, New Product development
process. Product design methodology, Product planning, data collection,
1 9
Creativity techniques. Electronic systems and needs Physical integration of
circuits, packages, boards and full electronic systems
Introduction to concepts of reliability, nature of reliability problems in
electronic equipment, series configuration, Parallel Configuration, Mixed
Configuration, Methods of Solving Complex Systems, Mean Time to Failure
2 9
(MTTF) and Mean Time between Failures (MTBF) of Systems.
Maintainability, Availability Concepts, System Downtime, Mean Time to
Repair (MTTR).
Packaging & Enclosures of Electronic System: Effect of environmental
3 factors on electronic system (environmental specifications), nature of 9
environment and safety measures. Packaging’s influence and its factors.
Introduction to 3D Printers, Hierarchical Structure of Additive
4 9
Manufacturing Processes, Integration of Additive Manufacturing in the
 Product Development Process, Rapid Prototyping, Rapid Tooling, Rapid
manufacturing.

Course Assessment Method

(CIE: 40 marks, ESE: 60 marks)
Continuous Internal Evaluation Marks (CIE):

Internal Internal
Assignment/
Attendance Examination-1 Examination- 2 Total
Microproject
(Written) (Written )

5 15 10 10 40

End Semester Examination Marks (ESE)

In Part A, all questions need to be answered and in Part B, each student can choose any one
full question out of two questions

Part A Part B Total

 2 Questions from each  Each question carries 9 marks.
module.  Two questions will be given from each module, out
 Total of 8 Questions, each of which 1 question should be answered.
60
carrying 3 marks  Each question can have a maximum of 3 sub
divisions.
(8x3 =24marks) (4x9 = 36 marks)

Course Outcomes (COs)

At the end of the course students should be able to:

Bloom’s
Course Outcome Knowledge
Level (KL)
CO1 Understand the basics of product development process K2
CO2 Understand the reliability problems of electronic equipment K2
CO3 Understand the packaging of electronic systems K2
Understand the surface modelling and additive manufacturing methods K2
CO4
in the product development
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create
 CO-PO Mapping Table (Mapping of Course Outcomes to Program Outcomes)

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 2 2 2 2
CO2 3 2 2 2 2
CO3 3 2 3 2
CO4 3 2 3 2 2
Note: 1: Slight (Low), 2: Moderate (Medium), 3: Substantial (High), -: No Correlation

Text Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
5th

Product Design and Edition

1 A.K. Chitale, R.C. Gupta Prentice, Hall of India
Manufacturing January
2011
Reliability and Failure of 2nd Edition
Milton Ohring,Lucian Academic
2 Electronic Materials and - October
Kasprzak Press Publication
Devices 14, 2014
Introduction to Electronic
1st edition
3 Packaging: Unconventional S.A Srinivasa Moorthy Notion Press
Guide to Product Design 2020

Additive Manufacturing
Technologies
Ian Gibson, David Springer 2nd edition
4 3D Printing, Rapid Prototyping,
Rosen, Brent Stucker verlang,Newyork 2015
and Direct Digital
Manufacturing
 Reference Books
Sl. Name of the Name of the Edition and
Title of the Book
No Author/s Publisher Year
Technical
1 Electronic Product Design V.S. Bagad 4th edition 2016
Publications
V.B. Baru R.G. New Delhi: Wiley
2 Electronics product Design 2nd edition 2014
Kaduskar India Pvt Ltd.
Rapid Prototyping, Rapid
Tooling and Reverse
Engineering: From Kaushik Kumar,Divya 5th
3 De Gruyter
Biological Models to 3D Zindani,Paulo Davim edition,June2020

Bioprinters

Reliability and Failure of Milton Ohring, Lucian 2nd

4 Electronic Materials and Kasprzak Academic Press edition,October
Devices 14, 2014

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
1 https://archive.nptel.ac.in/courses/117/108/117108140/

2 https://archive.nptel.ac.in/courses/112/105/112105267/
3 https://nptel.ac.in/courses/112104230

4 https://archive.nptel.ac.in/courses/112/104/112104265/
 SEMESTER S8

SYSTEM SOFTWARE

Course Code PEERT 863 CIE Marks 40

Teaching Hours/Week
3:0:0:0 ESE Marks 60
(L: T:P: R)

Credits 3 Exam Hours 2 Hrs. 30 Min.

Prerequisites (if any) None Course Type Theory

Course Objectives:

1. Students will be able to understand the basic concepts and use of system software and
application software.
2. Students will understand the machine dependent and machine independent system software
features and to design/implement system software.
SYLLABUS

Module Contact
Syllabus Description
No. Hours
Systems Programming – Background, System software and Application
Software.System software-Basic Concepts of Assemblers, Loaders, Linkers,
1 9
Macro processors, Text editorsSIC & SIC/XE Architecture and
Programming.
Assemblers – Basic assembler directives, machine dependent assembler
features, machine independent assembler features, Object code generation of
2 9
SIC and SIC/XE. Assembler design options – one pass assembler, multi pass
assembler
Loaders and Linkers - Basic loader functions, machine dependent loader
3 features, machine independent loader features. Loader design options – 9
linkage editors, dynamic linking, bootstrap loaders
Macro processors – Basic macro processor functions, machine dependent
and machine independent macro processor features, Design options.
4 9
Device drivers - Anatomy of a device driver, Character and block device
drivers, General design of device drivers. Text Editors- Overview of Editing,
 User Interface, EditorStructure. Debuggers - Debugging Functions and
Capabilities, Relationship with other parts of the system, Debugging
Methods- By Induction, Deduction and Backtracking

Course Assessment Method

(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

Internal Internal
Assignment/
Attendance Examination-1 Examination- 2 Total
Microproject
(Written) (Written )

5 15 10 10 40

End Semester Examination Marks (ESE)

In Part A, all questions need to be answered and in Part B, each student can choose any one
full question out of two questions

Part A Part B Total

● 2 Questions from each ● Each question carries 9 marks.
module. ● Two questions will be given from each module, out
● Total of 8 Questions, each of which 1 question should be answered.
60
carrying 3 marks ● Each question can have a maximum of 3 sub
divisions.
(8x3 =24marks) (4x9 = 36 marks)
 Course Outcomes (COs)

At the end of the course students should be able to:

Bloom’s
Course Outcome Knowledge
Level (KL)
CO1 Understand different System Software. K2
Analyse machine architecture with its instruction sets and capable to
CO2 K3
do programming
Identify machine dependent and independent features of system
CO3 K3
software
Design algorithms for system software and analyse the effect of data
CO4 K3
structures.
Understand the features of device drivers and editing & debugging
CO5 K2
tools.
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create

CO-PO Mapping Table (Mapping of Course Outcomes to Program Outcomes)

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 2 2 2 2
CO2 2 3 3 2
CO3 2 2 2 2
CO4 2 2 3 2
CO5 2 1 1 3 2
Note: 1: Slight (Low), 2: Moderate (Medium), 3: Substantial (High), -: No Correlation

Text Books
Name of the Edition and
Sl. No Title of the Book Name of the Author/s
Publisher Year
System Software: An
Pearson Education
1 Introduction to Systems Leland L. Beck 3/E
Asia
Programming
 Reference Books
Name of the Name of the
Sl. No Title of the Book Edition and Year
Author/s Publisher
Systems Programming and Tata McGraw Second Revised
1 D.M. Dhamdhere
Operating Systems Hill Edition
Tata McGraw
2 Systems Programming Donovan J. J 2/e
Hill
Tata McGraw
3 System Software J Nithyashri Second Edition
Hill
IBM PC Assembly Language Prentice Hall
4 Peter Abel Third Edition
and Programming of India
 SEMESTER S8

CYBER SECURITY

Course Code PEECT864 CIE Marks 40

Teaching Hours/Week
3:0:0:0 ESE Marks 60
(L: T:P: R)

Credits 3 Exam Hours 2 Hrs. 30 Min.

Prerequisites (if any) None Course Type Theory

Course Objectives:

1. To understand the fundamental concepts of cybersecurity, including various types of cyber

threats and attacks.
2. To learn and apply basic security measures, mechanisms, and best practices to protect
systems and data from threats.
SYLLABUS

Module Contact
Syllabus Description
No. Hours
Introduction: Security basics – Aspects of network security – Attacks –
Different types – Hackers – Crackers – Common intrusion techniques –
Trojan Horse, Virus, Worm. Security threats - Sources of security threats-
1 9
Motives - Target Assets and vulnerabilities – Consequences of threats- E-
mail threats - Web-threats - Intruders and Hackers, Insider threats,
Cybercrimes.
Security services and mechanisms, OS Security – Protection Mechanisms –
Authentication & Access control – Discretionary and Mandatory access
control
2 Firewall- Need for firewall, Characteristics, Types of firewall, Firewall 9
Basing,
Intrusion Detection System- Types, Goals of IDS, IDS strengths and
Limitations.
Cryptography: Basic Encryption & Decryption – Transposition &
3 9
substitution ciphers – Caesar substitution – Polyalphabetic substitutions –
 Crypt analysis – Symmetric key algorithms – Feistel Networks –
Confusion – Diffusion – DES Algorithm – Strength of DES – Comparison &
important features of modern symmetric key algorithms – Public key
cryptosystems – The RSA Algorithm – Diffie Hellman key exchange –
comparison of RSA & DES – Message Authentication & Hash functions –
Digital signature
Introduction to Cyber Crime and law: Cyber Crimes, Types of
Cybercrime, Hacking, Attack vectors, Cyberspace and Criminal Behaviour,
Clarification of Terms, Traditional Problems Associated with Computer
Crime, Introduction to Incident Response,
4 Digital Forensics, Computer Language, Network Language, Realms of the 9
Cyber world, A Brief History of the Internet, Recognizing and Defining
Computer Crime, Contemporary
Crimes, Comp. as Targets, Contaminants and Destruction of Data, Indian IT
ACT 2000.

Course Assessment Method

(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

Internal Internal
Assignment/
Attendance Examination-1 Examination- 2 Total
Microproject
(Written) (Written )

5 15 10 10 40

End Semester Examination Marks (ESE)

In Part A, all questions need to be answered and in Part B, each student can choose any one
full question out of two questions
 Part A Part B Total
 2 Questions from each  Each question carries 9 marks.
module.  Two questions will be given from each module, out
 Total of 8 Questions, each of which 1 question should be answered.
60
carrying 3 marks  Each question can have a maximum of 3 sub
divisions.
(8x3 =24marks) (4x9 = 36 marks)

Course Outcomes (COs)

At the end of the course students should be able to:

Bloom’s
Course Outcome Knowledge
Level (KL)
Understand the basics of network security, including different types of
CO1 attacks, common intrusion techniques, and various security threats, K2
including those posed by hackers, crackers, and cybercriminals.
Identify and explain various security services and mechanisms,
CO2 including OS security, authentication and access control, firewall types K2
and characteristics, and intrusion detection systems
Understand cryptography principles, including encryption, ciphers,
CO3 symmetric and public key algorithms, RSA, Diffie Hellman, K2
authentication, hash functions, and digital signatures.
Understand cybercrime and related laws, including types, attack
CO4 vectors, incident response, digital forensics, and the Indian IT Act K2
2000.
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create

CO-PO Mapping Table (Mapping of Course Outcomes to Program Outcomes)

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 1 1 - - - - - - - - - 1

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

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

CO4 2 1 - 3 2 3 - 3 - - - 3
Note: 1: Slight (Low), 2: Moderate (Medium), 3: Substantial (High), -: No Correlation
 Text Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
1 Computer Network Security Joseph M Kizza Springer Verlag 2005
Pearson Education
Cryptography and Network Asia(6/e)
2 William Stallings 2012
Security Principles and Practice

4th Edition
3 Network Security Essentials William Stallings Pearson Education
2011
Fundamentals of Network 4th Edition,
4 Eric Maiwald Tata McGraw-Hill
Security 2013

Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
(Indian
1 Anti-Hacker Tool Kit Mike Shema Mc Graw Hill
Edition)
Cyber Security Understanding
Cyber Crimes, Computer Nina Godbole and Sunit
2 Wiley Latest
Forensics and Legal Belpure
Perspectives
Mark Stamp’s Information Reprint
3 Deven N. Shah Wiley
Security Principles and Practice 2012
 Video Links (NPTEL, SWAYAM…)
Module
Link ID
No.
Introduction to Cyber Security, by Dr. Jeetendra Pande, Uttarakhand Open University,
1
Haldwani:-https://onlinecourses.swayam2.ac.in/nou19_cs08/preview
Firewalls and Intrusion Detection Systems on Computer - Cryptography and Network Security
2
by Prof. D. Mukhopadhyay, Department of Computer Science and Engineering, IIT Kharagpur
Cryptography and Network Security, by Prof. Sourav Mukhopadhyay, IIT Kharagpur:-
3
https://onlinecourses.nptel.ac.in/noc22_cs90/preview
https://www.meity.gov.in/writereaddata/files/itbill2000.pdf
4
https://www.meity.gov.in/writereaddata/files/it_amendment_act2008%20%281%29_0.pdf
 SEMESTER S8

CRYPTOGRAPHY AND NETWORK SECURITY

Course Code PEERT 866 CIE Marks 40

Teaching Hours/Week
3:0:0:0 ESE Marks 60
(L: T:P: R)

Credits 3 Exam Hours 2 Hrs. 30 Min.

Discrete
Prerequisites (if any) Mathematical Course Type Theory
Structures

Course Objectives:

1. To introduce fundamental concepts of number theory

2. To understand the basics of symmetric and asymmetric cipher models.
3. To provide a better foundation in network security in today’s internet environment.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Introduction to Cryptography - Security Goals, Security Services-
Classification of Cryptosystems, Cryptanalytic attacks
Basics of Number Theory:
1 Integer Arithmetic -Divisibility – GCD, Linear Diophantine equation, 10
Modular Arithmetic - Congruence - Addition and multiplicative inverse,
Fermat’s and Euler’s Theorem - Chinese Remainder Theorem, Primitive roots,
Quadratic congruences- quadratic residues, Legrende symbol.
Algebraic structures: groups, rings, Finite fields of the form GF(p) and GF(2
n
), polynomial rings over finite field.
Symmetric Ciphers: Ceaser cipher, Affine cipher, Playfair cipher, Hill
2 10
cipher, Vigenere cipher etc.
Modern Secret Key Ciphers - Substitution Box-Permutation Box-Product
Ciphers. Data Encryption standard (DES), Advanced Encryption standard
 (AES).
Cryptographic Hash Functions - Properties - SHA-512, Message
Authentication Code, HMAC and CMAC
Public key cryptography: One-way functions, RSA, Discrete Log, Diffie-
Helman Key Exchange system, Digital Signature- Signing - Verification,
3 Digital signature forgery- RSA Digital Signature Scheme -El Gamal 8
Signature Scheme.
Elliptic curves and elliptic curve cryptosystems
Distribution of symmetric keys and Distribution of public keys
Electronic Mail Security -Pretty Good Privacy- PGP message format -
Transmission and Reception of PGP Messages,
4 IP Security Overview - IP Authentication Header - Encapsulating Security
8
Payload - Distributed Denial of Service attacks,
Secure Electronic Transaction – Payment Processing - Dual Signature,
Firewalls - Firewall Design Principles.

Course Assessment Method

(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

Internal Internal
Assignment/
Attendance Examination-1 Examination- 2 Total
Microproject
(Written) (Written )

5 15 10 10 40

End Semester Examination Marks (ESE)

In Part A, all questions need to be answered and in Part B, each student can choose any one full
question out of two questions
 Part A Part B Total
● 2 Questions from each ● Each question carries 9 marks.
module. ● Two questions will be given from each module, out
● Total of 8 Questions, each of which 1 question should be answered.
60
carrying 3 marks ● Each question can have a maximum of 3 sub
divisions.
(8x3 =24marks) (4x9 = 36 marks)

Course Outcomes (COs)

At the end of the course students should be able to:

Bloom’s
Course Outcome Knowledge
Level (KL)
CO1 Apply the concepts of number theory in designing crypto systems K3
Design and analyze various symmetric key cryptosystems and hash
CO2 K3
functions.
Design and Analyze various public key cryptosystems and digital
CO3 K3
signature schemes.
Discuss various network security aspects, protocols to ensure Email
CO4 K2
Security and Network Security
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create

CO-PO Mapping Table (Mapping od Course Outcomes to Program Outcomes)

PO1 PO1 PO1

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9
0 1 2
CO1 3 3 2 2
CO2 3 3 2 2
CO3 3 3 2 2
CO4 2 2 2 2
Note: 1: Slight (Low), 2: Moderate (Medium), 3: Substantial (High), -: No Correlation
 Text Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year

Cryptography and Tata McGraw Hill

Behrouz A Forouzan
1 Network.Security Education Pvt Ltd 2/e, 2010.
&DebdeepMukhopadhyay
Publication
Cryptography and Network
Pearson Education
2 security: Principles and Stallings William 7/e, 2017
Asia,
Practice,
A Course in Number Theory
3 Neal Koblitz: Springer 2/e, 2012
and Cryptography
Handbook of Applied Menezes, Paul C.
4 CRC Press 5/e, 2010
Cryptography V, Scott A. Vanstone

Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Elementary Number Theory
1 Thomas Koshy Elsevier India 2/e, 2007
with Applications
Number Theory in Science and
2 MR Schroeder Springer 5/e, 2009
Communication
Cryptography: Theory and Chapman and
3 Douglas R. Stinson 3/e, 2006
Practice Hall/CRC
Hankerson, D.J.,
Guide to Elliptic Curve
4 Menezes, A., Vanstone, Springer 2004
Cryptography
S.A.
Advanced Engineering Merle C. Potter, David
5 Wiley 10/e, 2012
Mathematics C. Wiggert
 Video Links (NPTEL, SWAYAM…)
Module
Link ID
No.
1 https://nptel.ac.in/courses/106105162
2 https://nptel.ac.in/courses/106105162
3 https://nptel.ac.in/courses/106105162
4 https://nptel.ac.in/courses/106105162
 SEMESTER S8

CYBER FORENSICS

Course Code PEERT 865 CIE Marks 40

Teaching Hours/Week 3:0:0:0 ESE Marks 60
(L: T:P: R)
Credits 5/3 Exam Hours 2 Hrs. 30 Min.

Prerequisites (if any) Course Type Theory

Course Objectives:

1. To provide foundational knowledge of cyber forensics, including key concepts, terminology, and
the role of forensics in cybersecurity.
2. To equip students with the knowledge and skills to use various forensic tools and techniques for
data recovery, analysis, and investigation.
3. To understand the process of responding to cyber incidents, conducting thorough forensic
analysis, and presenting findings.
4. To explore advanced topics, emerging trends, and the future landscape of cyber forensics.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Fundamentals of Cyber Forensics, The Role of Cyber Forensics in Modern
Cybersecurity, Understanding Digital Evidence, Types of Digital Evidence
(Data at rest, in transit, etc.), Legal and Ethical Considerations in Cyber
1 Forensics, Cyber Forensics Process: Identification, Preservation, Collection, 9

Examination, Analysis, and Presentation, Chain of Custody and

Documentation

Overview of Forensic Tools (FTK, EnCase, Autopsy, etc.), File Systems and
Their Forensic Relevance (FAT32, NTFS, etc.), Data Recovery Techniques,
2 Imaging and Cloning Digital Evidence, Network Forensics: Capturing and 9

Analyzing Network Traffic, Introduction to Mobile Device Forensics

Incident Response Lifecycle: Preparation, Detection, Containment,

3 9
Eradication, Recovery, The Role of Forensics in Incident Response,
 Analyzing Malware: Static and Dynamic Analysis Techniques, Memory
Forensics: Capturing and Analyzing Volatile Data, Forensic Reporting:
Writing and Presenting Findings, Legal and Regulatory Compliance in
Incident Response

Cloud Forensics: Challenges and Techniques, IoT Forensics: Investigating

Smart Devices, AI and Machine Learning in Cyber Forensics, Cyber

4 Forensics in Blockchain and Cryptocurrency Investigations, Future of Cyber 9

Forensics: Predictive Forensics and Beyond, Career Paths in Cyber
Forensics: Skills and Certifications

Course Assessment Method

(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

Attendance Internal Ex Evaluate Analyse Total

5 15 10 10 40

Criteria for Evaluation (Evaluate and Analyse): 20 marks

Evaluation Methods:
1. Experiments Using Forensic Tools: (10 marks)

Case Studies: Real-world applications of cyber forensics

Exploring Digital Evidence in a Controlled Environment

Hands-on: Creating and Maintaining a Chain of Custody

Hands-on: Creating Forensic Images and Recovering Deleted Data

Analyzing Network Traffic with Wireshark

Simulating a Cyber Incident: Initial Response

Analyzing a Malicious File: Tools and Techniques

Writing a Forensic Report: Key Components and Best Practices

Exploring Cloud Forensics Tools

 Analyzing Blockchain Transactions for Forensic Purposes

Criteria for Evaluation: Course Project (10 marks)

1. Project Proposal and Planning (2 marks)
● Submits a well-defined project proposal outlining objectives, methodology, and
expected outcomes.
● Demonstrates thorough planning and a clear timeline for the project.
2. Design and Implementation (3 marks)
● Implements the project design accurately using appropriate tools and techniques.
● The design is functional and meets the project objectives.
2. Innovation and Creativity (2 marks)
● Introduces innovative ideas or unique approaches in the design and implementation.
● Demonstrates creativity in solving problems or optimizing designs.
2. Analysis and Testing (2 marks)
● Effectively analyzes the project design to identify and address any issues.
● Conducts thorough testing to verify the functionality and performance of the design.
2. Final Report and Presentation (1 mark)
● Submits a comprehensive final report detailing the project, including objectives,
design, methodology, analysis, and results.
● Clearly presents the project and its outcomes, and effectively communicates the key
points.

End Semester Examination Marks (ESE):

In Part A, all questions need to be answered and in Part B, each student can choose
any one full question out of two questions

Part A Part B Total

● 2 Questions from each 2 questions will be given from each module, out of
module. which 1 question should be answered. Each
● Total of 8 Questions, question can have a maximum of 3 sub divisions. 60
each carrying 3 marks Each question carries 9 marks.
(8x3 =24marks) (4x9 = 36 marks)
 Course Outcomes (COs)

At the end of the course students should be able to:

Bloom’s
Course Outcome Knowledge
Level (KL)
Evaluate the principles and methodologies of cyber forensics,
CO1 including the identification and classification of digital evidence, and K4
will assess the legal and ethical implications of forensic investigations.
demonstrate advanced proficiency in the application of forensic tools,
performing complex data recovery, forensic imaging, and evidence K2
CO2
analysis, and will critically evaluate the effectiveness of various
forensic techniques in different scenarios.
Develop and implement comprehensive incident response strategies,
utilizing forensic analysis to interpret and correlate complex data, and K3
CO3
will evaluate the effectiveness of different approaches in incident
response and forensic reporting.
Synthesize knowledge of emerging technologies in cyber forensics,
such as cloud and IoT forensics, to design and execute innovative K4
CO4
forensic investigations, critically analyzing challenges and proposing
solutions to overcome them.
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create

CO-PO Mapping Table (Mapping od Course Outcomes to Program Outcomes)

PO1 PO1 PO1

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9
0 1 2
CO1 3 2 3 2 3 2
CO2 3 2 3 2 3 2
CO3 3 2 3 2 3 2
CO4 3 2 3 2 3 2
Note: 1: Slight (Low), 2: Moderate (Medium), 3: Substantial (High), -: No Correlation
 Text Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Digital Forensics and Incident
Response: Incident Response
2nd edition,
1 Techniques and Procedures to Gerard Johansen Packt Publishing
2020
Respond to Modern Cyber
Threats
The Basics of Digital
Forensics: The Primer for 2nd edition,
2 John Sammons Syngress
Getting Started in Digital 2014
Forensics

Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Bill Nelson, Amelia
Guide to Computer Forensics 6th edition,
1 Phillips, and Christopher Cengage Learning
and Investigations 2016
Steuart
Computer Forensics:
3rd edition,
2 Cybercriminals, Laws, and Marjie T. Britz Pearson
2013
Evidence
Jason T. Luttgens,
Incident Response & Computer McGraw-Hill 3rd edition,
3 Matthew Pepe, and
Forensics Education 2014
Kevin Mandia
Digital Evidence and Computer
3rd edition,
4 Crime: Forensic Science, Eoghan Casey Academic Press
2011
Computers and the Internet
 SEMESTER S8

BIOMEDICAL SIGNAL PROCESSING

Course Code OEERT 831 CIE Marks 40

Teaching Hours/Week
3:0:0:0 ESE Marks 60
(L: T:P: R)

Credits 3 Exam Hours 2 Hrs. 30 Min.

Prerequisites (if any) None Course Type Theory

Course Objectives:

1. To make students understand the sources, types & characteristics of different noises and
artifacts present in biomedical signals.
2. To make students able to design time domain and frequency domain filters for noise and
artifact removal from biomedical signals.
SYLLABUS

Module Contact
Syllabus Description
No. Hours
Introduction to Biomedical Signals-Action Potential and Its Generation,
Origin and Waveform Characteristics of Basic Biomedical Signals Like:
1 Electrocardiogram (ECG), Electroencephalogram (EEG), Electromyogram 9
(EMG), Objectives of Biomedical Signal Analysis, Difficulties in
Biomedical Signal Analysis, Computer-Aided Diagnosis.
Removal of Noise and Artifacts from Biomedical Signal- Random and
Structured Noise, Physiological Interference, Stationary and Nonstationary
2 9
Processes, Noises and Artifacts Present in ECG, Time and Frequency
Domain Filtering.
EEG Signal Processing and Event Detection in Biomedical Signals- EEG
Signal and Its Characteristics, EEG Analysis, Linear Prediction Theory,
Autoregressive Method, Sleep EEG, Application of Adaptive Filter for Noise
3 9
Cancellation in ECG and EEG Signals; Detection of P, Q, R, S and T Waves
in ECG, EEG Rhythms, Waves and Transients, Detection of Waves and
Transients, Correlation Analysis Ad Coherence Analysis of EEG Channels.
 Speech production model, inverse filtering techniques for extraction of vocal
tract parameters, glottal inverse filtering; electroglottograpic signals; signal
4 processing techniques for detection of pathologies in speech production 9
system.
Medical imaging techniques: CT scan, ultrasound, NMR and PET.

Course Assessment Method

(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

Internal Internal
Assignment/
Attendance Examination-1 Examination- 2 Total
Microproject
(Written) (Written )

5 15 10 10 40

End Semester Examination Marks (ESE)

In Part A, all questions need to be answered and in Part B, each student can choose any one
full question out of two questions

Part A Part B Total

● 2 Questions from each ● Each question carries 9 marks.
module. ● Two questions will be given from each module, out
● Total of 8 Questions, each of which 1 question should be answered.
60
carrying 3 marks ● Each question can have a maximum of 3 sub
divisions.
(8x3 =24marks) (4x9 = 36 marks)
 Course Outcomes (COs)

At the end of the course students should be able to:

Bloom’s
Course Outcome Knowledge
Level (KL)
Identify sources of biopotential generation and to familiarize students
CO1 K1
with different types of biomedical signals in the human body.
Design time domain and frequency domain filters for noise and artifact
CO2 K3
removal from biomedical signals.
Analyse ECG, EEG, EMG and PCG signals using data acquisition,
CO3 K4
data reduction methods.
CO4 Analyse speech signals and medical imaging techniques. K4
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create

CO-PO Mapping Table (Mapping of Course Outcomes to Program Outcomes)

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 3 3 2 3 2
CO2 3 3 3 2 3 2
CO3 3 3 3 2 3 2
CO4 3 3 3 2 3 2
Note: 1: Slight (Low), 2: Moderate (Medium), 3: Substantial (High), -: No Correlation

Text Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
2015 (Vol.
1 Biomedical signal analysis Rangayyan, R.M. John Wiley & Sons
33)
Biomedical signal processing:
2 Reddy, D.C. McGraw-Hill 2005.
principles and techniques.
3 Biomedical Signal Processing W. J. Tompkins Prentice Hall 1995
Biomedical Signal Processing John Wiley and Sons,
4 E.N. Bruce 2001
and Signal Modelling
Digital Processing of speech 1978.
5 L. Rabinar Prentice Hall,
signals
 Reference Books
Sl. Name of the Name of the Edition and
Title of the Book
No Author/s Publisher Year
Advanced Methods and Clifford, G., F.
Norwood, MA: 2006. ISBN:
1 Tools for ECG Data Azuajae, and P.
Artech House 9871580539661.
Analysis., McSharry
Discrete-Time Speech Signal
Processing: Principles and 2001. ISBN:
2 Quatieri, T. F. Prentice-Hall,
Practice. Upper Saddle River, 9780132429429.
NJ:
Medical Imaging Systems. 1983. ISBN:
3 Macovski, A. Prentice Hall,
Upper Saddle River, NJ: 9780135726853
4 Biomedical Signal Analysis Rangaraj M Rangayyan IEEE Press 2001

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
1 .http://www.biomedicahelp.altervista.org › Segnali
2 https://www.digimat.in/nptel/courses/video/108105101/L12.html
 SEMESTER S8

HYBRID AND ELECTRIC VEHICLES

Course Code OEERT 832 CIE Marks 40

Teaching Hours/Week
3:0:0:0 ESE Marks 60
(L: T:P: R)

Credits 3 Exam Hours 2 Hrs. 30 Min.

Prerequisites (if any) None Course Type Theory

Course Objectives:

1. To introduce the fundamental concepts of electric and hybrid and vehicles, drive trains,
electrical machines used, energy storage devices and charging systems

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Introduction to Hybrid Electric Vehicles: History of hybrid and electric
vehicles, social and environmental importance of hybrid and electric
vehicles, impact of modern drive-trains on energy supplies.
1 9
Conventional Vehicles: Basics of vehicle performance, vehicle power
source characterization, transmission characteristics, mathematical models to
describe vehicle performance.
Hybrid Electric Drive-trains: Basic concept of hybrid traction, introduction
to various hybrid drive-train topologies, power flow control in hybrid drive-
train topologies, fuel efficiency analysis.
2 9
Electric Drive-trains: Basic concept of electric traction, introduction to
various electric drive-train topologies, power flow control in electric drive-
train topologies, fuel efficiency analysis
Electric Propulsion unit: Introduction to electric components used in
hybrid and electric vehicles
3 9
DC Drives: Review of Separately excited DC Motor control – Speed and
torque equations PMSM Drives: PMSM motor basics.
 Energy Storage: Introduction to energy storage requirements in Hybrid and
Electric Vehicles- Battery based energy storage systems, Battery
Management System, Types of battery- Fuel Cell based energy storage
systems- Super capacitors- Hybridization of different energy storage devices
Sizing the drive system: Matching the electric machine and the internal
combustion engine (ICE), Sizing the propulsion motor, rating of the power
electronic components
4 Vehicle Communication: Need & requirements, Energy Management 9
Strategies: Introduction to energy management strategies used in hybrid and
electric vehicles, classification of different energy management strategies,
comparison of different energy management strategies

Course Assessment Method

(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

Internal Internal
Assignment/
Attendance Examination-1 Examination- 2 Total
Microproject
(Written) (Written )

5 15 10 10 40

End Semester Examination Marks (ESE)

In Part A, all questions need to be answered and in Part B, each student can choose any one
full question out of two questions

Part A Part B Total

● 2 Questions from each ● Each question carries 9 marks.
module. ● Two questions will be given from each module, out
● Total of 8 Questions, each of which 1 question should be answered.
60
carrying 3 marks ● Each question can have a maximum of 3 sub
divisions.
(8x3 =24marks) (4x9 = 36 marks)
 Course Outcomes (COs)
At the end of the course students should be able to:

Bloom’s
Course Outcome Knowledge
Level (KL)
CO1 Explain the fundamentals of Conventional, Electric and Hybrid EV K2
Describe different configurations of electric and hybrid electric drive
CO2 K2
trains
Discuss the propulsion unit, DC and PMSM drives used for electric
CO3 K3
and hybrid vehicles
CO4 Selection and sizing of drive systems for EV K3
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create

CO-PO Mapping Table (Mapping oF Course Outcomes to Program Outcomes)

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 1
CO2 3 2
CO3 3 2
CO4 3 1 2
Note: 1: Slight (Low), 2: Moderate (Medium), 3: Substantial (High), -: No Correlation

Text Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Electric and Hybrid Vehicles:
1 Iqbal Hussein CRC Press 2e, 2010
Design Fundamentals
 Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Electric Vehicle Technology James Larminie, John
1 Wiley 2e, 2012
Explained Lowry
Modern Electric, Hybrid
Mehrdad Ehsani,
Electric and Fuel Cell Vehicles:
2 YimiGao, Sebastian E. CRC Press 1e, 2004
Fundamentals, Theory and
Gay, Ali Emadi.
Design,
Hybrid Electric Vehicles –
Chris Mi, M A Masrur, D
3 Principles and applications with Wiley 2011
W Gao
practical perspectives
Anderson JM, Nidhi K,
Autonomous vehicle
Stanley KD, Sorensen P,
4 technology: A guide for Rand Corporation 2014
Samaras C, Oluwatola
policymakers,
OA

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.

1 https://onlinecourses.swayam2.ac.in/nou24_ec10/
 SEMESTER S8

FUNDAMENTALS OF COMPUTER NETWORKS

Course Code OEERT 833 CIE Marks 40

Teaching Hours/Week
3:0:0:0 ESE Marks 60
(L: T:P: R)

Credits 3 Exam Hours 2 Hrs. 30 Min.

Prerequisites (if any) None Course Type Theory

Course Objectives:

1. To make students understand the fundamentals of computer networks, TCP/IP and OSI
models and their different layers.
2. To make students analyse the various layers of OSI Model and its protocols.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
INTRODUCTION: Introduction to computer networks, network hardware,
network software, internet protocols and standards, Reference models -OSI
and TCP/IP and its different layers, Connection oriented networks - X.25
1 9
THE PHYSICAL LAYER: Theoretical basis for communication, analog and
digital signals, guided transmission media- twisted pairs, coaxial cable, fiber
optics, wireless transmission.
THE DATA LINK LAYER: Design issues, error detection and correction,
elementary data link protocols, sliding window protocols, HDLC

2 9
THE MEDIUM ACCESS SUBLAYER: Channel allocation problem,
multiple access protocols-Ethernet, Wireless LAN, Data Link Layer
switching.
THE NETWORK LAYER: Network layer -various functions and design
3 issues, adaptive and non-adaptive routing algorithms, Congestion control 9
algorithms-leaky bucket and token bucket algorithms.
 Internetworking, the network layer in the internet (IPv4 and IPv6), Quality
of Service.
THE TRANSPORT LAYER: Transport service, elements of transport
protocol, Simple Transport Protocol, Internet transport layer protocols: UDP
and TCP protocols.
THE APPLICATION LAYER: Domain name system, DNS in internet,
electronic mail, World Wide Web: architectural overview, dynamic web
4 document and http, network security 9
APPLICATION LAYER PROTOCOLS: Simple Network Management
Protocol, File Transfer Protocol, Simple Mail Transfer Protocol.

Course Assessment Method

(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

Internal Internal
Assignment/
Attendance Examination-1 Examination- 2 Total
Microproject
(Written) (Written )

5 15 10 10 40

End Semester Examination Marks (ESE)

In Part A, all questions need to be answered and in Part B, each student can choose any one
full question out of two questions

Part A Part B Total

 2 Questions from each  Each question carries 9 marks.
module.  Two questions will be given from each module, out
 Total of 8 Questions, each of which 1 question should be answered.
60
carrying 3 marks  Each question can have a maximum of 3 sub
divisions.
(8x3 =24marks) (4x9 = 36 marks)
 Course Outcomes (COs)

At the end of the course students should be able to:

Bloom’s
Course Outcome Knowledge
Level (KL)
Understand the basic computer network technology, OSI and TCP/IP
CO1 K2
reference models and physical layer transmission methods.
Analyse the design issue problems of data link layer and its protocols;
CO2 channel allocation problems in medium access control layer and its K4
protocols.
Understand the functions of network layer and transport layer and its
CO3 K2
associated protocols.
CO4 Understand the essentials of application layer in computer networking. K2
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create

CO-PO Mapping Table (Mapping of Course Outcomes to Program Outcomes)

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 3 1
CO2 3 3 1
CO3 3 3 1
CO4 3 2 3 2 2 1 1 2 2
Note: 1: Slight (Low), 2: Moderate (Medium), 3: Substantial (High), -: No Correlation

Text Books
Name of the Edition and
Sl. No Title of the Book Name of the Author/s
Publisher Year
5th edition,
Pearson Education,
1 Computer Networks Andrew. S. Tanenbaum 2010
India.

4th Edition,
Data Communication and Mc Graw-Hill,
2 Behrouz A. Forouzan 2006,
Networking India.
 Reference Books
Name of the Edition and
Sl. No Title of the Book Name of the Author/s
Publisher Year
Computer Networking: A top Pearson Education, 4th Edition
1 Kurose, Ross
down approach, India. 2. 2010

An Engineering Approach to Pearson Education 2nd Edition,

2 Computer Networks-, S.Keshav
India. 2. 2019

Data and Computer 5th edition,

3 Communications William Stallings PHI 2005

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
1 https://nptel.ac.in/courses/106106091
2 https://www.nptelvideos.com/course.php?id=393
 SEMESTER S8

CLOUD COMPUTING AND APPLICATIONS

Course Code OEERT 834 CIE Marks 40

Teaching Hours/Week
3:0:0:0 ESE Marks 60
(L: T:P: R)

Credits 3 Exam Hours 2 Hrs. 30 Min.

Operating System and

Prerequisites (if any) Course Type Theory
Networking
Course Objectives:

1. Understand the fundamentals and architecture of cloud computing, including delivery and
deployment models.
2. Develop knowledge and skills in cloud security, SLA management, and risk assessment.
SYLLABUS

Module Contact
Syllabus Description
No. Hours
Cloud Computing Fundamentals: What is Cloud Computing, Essential
Characteristics, Architectural Influences
Cloud delivery models, The SPI Framework, Cloud Software as a Service
1 9
(SaaS), Cloud Platform as a Service (PaaS), Cloud Infrastructure as a Service
(IaaS), Cloud deployment models, Public Clouds, Community Clouds,
Private clouds, Hybrid clouds.
Understanding cloud architecture- Exploring cloud computing stack. Using
virtualization technologies, Load balancing and virtualization, Understanding
hypervisors, Understanding machine imaging.
2 9
Cloud storage- Cloud storage providers, Cloud Computing with the Titans–
Google, Amazon. Accessing the cloud: Platforms, Web applications, Web
APIs.
Virtual Machines and Containers, Serverless Computing, Using and
Managing Containers:-Container Basics, Docker and the Hub.
3 Agents and Microservices: Microservices and Container Resource Managers, 9
Managing Identity in a swarm, A simple Microservices Example, Amazon
EC2 Container Service, Google’s Kubernetes.
 SLA Management in Cloud Computing-Types of SLA, Life cycle of SLA,
SLA management in cloud.
Cloud Information Security Objectives, Cloud Security Services, Relevant
Cloud Security Design Principles, Secure Cloud Software Requirements.
4 9
Privacy and Compliance Risks, Threats to Infrastructure Data and Access
Control, Cloud Service Provider Risks. Cloud computing Security
Architecture- architecture considerations, identity management and access
control

Course Assessment Method

(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

Internal Internal
Assignment/
Attendance Examination-1 Examination- 2 Total
Microproject
(Written) (Written )

5 15 10 10 40

End Semester Examination Marks (ESE)

In Part A, all questions need to be answered and in Part B, each student can choose any one
full question out of two questions

Part A Part B Total

● 2 Questions from each ● Each question carries 9 marks.
module. ● Two questions will be given from each module, out
● Total of 8 Questions, each of which 1 question should be answered.
60
carrying 3 marks ● Each question can have a maximum of 3 sub
divisions.
(8x3 =24marks) (4x9 = 36 marks)
 Course Outcomes (COs)

At the end of the course students should be able to:

Bloom’s
Course Outcome Knowledge
Level (KL)
CO1 Describe the principles of cloud computing. K2
CO2 Explain the technologies used in cloud computing and virtualization. K2

CO3 Describe cloud computing and microservices. K2

CO4 Describe cloud management and cloud security features. K2

Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create

CO-PO Mapping Table (Mapping of Course Outcomes to Program Outcomes)

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 1 - - - - - - - - - 2

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

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

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

CO5 3 2 - - - - - - - - - 2
Note: 1: Slight (Low), 2: Moderate (Medium), 3: Substantial (High), -: No Correlation

Text Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Cloud Security -A
1 Comprehensive Guide to Secure Ronald L Krutz and Wiley Publishing, Inc. 2010
Cloud Computing Russell Dean Vines
2 Cloud Computing Bible Barrie Sosinsky Wiley Publishing 2011
Anthony T. Velte Toby
Cloud Computing: A Practical
3 J. Velte, Robert The McGraw-Hill 2010
Approach
Elsenpeter
Cloud Computing for Science
Ian Foster and Dennis
4 and Engineering The MIT Press 2017
B.Gannon
https://cloud4scieng.org/chapters/
Rajkumar Buyya, James
Cloud Computing: Principles and Broberg and Andrzej M.
5 Wiley Publishing 2011
Paradigms Goscinski
 Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Distributed and Cloud
Computing: Kai Hwang, Geoffrey C.
1 Morgen Kauffmann 2013
From parallel processing to Fox, Jack K.Dongarra
Internet ofThings
Getting Started with Jonathan Baier Packt publishers
2 2nd, 2015
Kubernetes: 2nd Edition

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
https://en.wikipedia.org/wiki/Cloud_computing
1
https://nptel.ac.in/courses/106105167
2 https://nptel.ac.in/courses/106105167
3 https://nptel.ac.in/courses/106105167
4 https://nptel.ac.in/courses/106105167
 SEMESTER S8

INTRODUCTION TO DEEP LEARNING

Course Code OEERT 835 CIE Marks 40

Teaching Hours/Week
3:0:0:0 ESE Marks 60
(L: T:P: R)

Credits 3 Exam Hours 2 Hrs. 30 Min.

Prerequisites (if any) None Course Type Theory

Course Objectives:

1. To introduce the basic concepts in machine learning

2. To introduce the idea of artificial neural networks and their architecture

3. To introduce techniques used for training artificial neural networks

4. To enable design of an artificial neural network for classification

5. To enable design and deployment of deep learning models for machine learning problems

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Key components - Data, models, objective functions, optimization
algorithms, Learning algorithms. Supervised learning- regression,
classification, tagging, web search, page ranking, recommender systems,
1 sequence learning, Unsupervised learning, Reinforcement learning, 10
Historical Trends in Deep Learning. Other Concepts - overfitting,
underfitting, hyperparameters and validation sets, estimators, bias and
variance.
Neural Networks –Perceptron, Gradient Descent solution for Perceptron,
Multilayer perceptron, activation functions, architecture design, chain rule,
2 back propagation, gradient based learning. Introduction to optimization– 10
Gradient based optimization, linear least squares. Stochastic gradient
descent, Building ML algorithms and challenges
 Convolutional Neural Networks – convolution operation, motivation,
pooling, Convolution and Pooling as an infinitely strong prior, variants of
3 8
convolution functions, structured outputs, data types, efficient convolution
algorithms.
Recurrent neural networks – Computational graphs, RNN design, encoder –
decoder sequence to sequence architectures, deep recurrent networks,
recursive neural networks, modern RNNs LSTM and GRU, Practical use
4 8
cases for RNNs. Applications – computer vision, speech recognition, natural
language processing. Autoencoders, Representation learning, Boltzmann
Machines, Deep belief networks.

Course Assessment Method

(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

Internal Internal
Assignment/
Attendance Examination-1 Examination- 2 Total
Microproject
(Written) (Written )

5 15 10 10 40

End Semester Examination Marks (ESE)

In Part A, all questions need to be answered and in Part B, each student can choose any one
full question out of two questions

Part A Part B Total

● 2 Questions from each ● Each question carries 9 marks.
module. ● Two questions will be given from each module,
● Total of 8 Questions, each out of which 1 question should be answered.
60
carrying 3 marks ● Each question can have a maximum of 3
subdivisions.
(8x3 =24 marks) (4x9 = 36 marks)
 Course Outcomes (COs)

At the end of the course students should be able to:

Bloom’s
Course Outcome Knowledge
Level (KL)

CO1 Demonstrate basic concepts in machine learning. K2

Illustrate the validation process of machine learning models using

CO2 hyper-parameters and validation sets. K2

Demonstrate the concept of the feed forward neural network and its
CO3 K3
training process.

Build CNN and Recurrent Neural Network (RNN) models for different
CO4 K3
use cases.

Use different neural network/deep learning models for practical

CO5 K3
applications.

Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create

CO-PO Mapping Table (Mapping of Course Outcomes to Program Outcomes)

PO1 PO1 PO1

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9
0 1 2
CO1 1 1 - - - - - - - - - 1
CO2 1 1 - - - - - - - - - 1
CO3 2 3 2 2 - - - - - - - 1
CO4 3 2 2 3 - - - - - - - 1
CO5 2 3 2 1 - - - - - - - 2
Note: 1: Slight (Low), 2: Moderate (Medium), 3: Substantial (High), -: No Correlation
 Text Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Ian Goodfellow.
1 Deep Learning. Yoshua Bengio and MIT Press 2016.
Aaron Courville.
Astan Zhang and
Dive deep into machine Cambridge university
2 Zachary and Alexander
learning press https://d2l.ai/ 2019
semola
Neural Networks and Deep . 2019
3 Charu C. Aggarwal. Springer
Learning: A Textbook

Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Mohit Sewak, Md.
Practical Convolutional Neural 1st edition,
1 Rezaul Karim, Pradeep Packt Publishing Ltd
Networks 2018
Pujari
Hands-On Deep Learning 1st edition,
2 Sudharsan Ravichandran Packt Publishing Ltd.
Algorithms with Python 2019
Manning Publications 2nd edition,
3 Deep Learning with Python Francois Chollet
Co 2018

4 Generative Deep Learning David Foster OReilly 2022

Hands-on Machine learning Second

5 with Sc-kit Learn Keras and Aurelien Geron Oreilly edition
Tensorflow 2019
http://neuralnetworks
Neural Networks for deep
6 Michael Nielsen anddeeplearning.com 2019
learning
/
 Video Links (NPTEL, SWAYAM…)
Module
Link ID
No.
1 https://www.cse.iitm.ac.in/~miteshk/CS6910.html

2 https://www.deeplearningbook.org/contents/convnets.html
https://wiki.pathmind.com/lstm
3
http://colah.github.io/posts/2015-08-Understanding-LSTMs/
4 https://jalammar.github.io/illustrated-transformer/ Jay Almar