SEMESTER 3

COMPUTER SCIENCE AND ENGINEERING

 SEMESTER S3

MATHEMATICS FOR COMPUTER AND INFORMATION SCIENCE-3

(Group A)

Course Code GAMAT301 CIE Marks 40

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

Credits 3 Exam Hours 2 Hr. 30 Min.

Prerequisites (if any) Basic calculus Course Type Theory

Course Objectives:

1. To familiarize students with the foundations of probability and analysis of random

processes used in various applications in engineering and science.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Random variables, Discrete random variables and their probability
distributions, Cumulative distribution function, Expectation, Mean and
variance, the Binomial probability distribution, the Poisson probability
distribution, Poisson distribution as a limit of the binomial distribution, Joint
1 9
pmf of two discrete random 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 Marginal pdf, Independent random variables, Expectation value of a function 9
of two continuous variables.

[Text 1: Relevant topics from sections 3.1, 4.1, 4.2, 4.3, 4.4, 5.1, 5.2]
 Limit theorems : Markov’s Inequality, Chebyshev’s Inequality, Strong Law
of Large Numbers (Without proof), Central Limit Theorem (without proof),
Stochastic Processes: Discrete-time process, Continuous-time process,
3 Counting Processes, The Poisson Process, Interarrival times (Theorems 9
without proof)

[Text 2: Relevant topics from sections 2.7, 2.9, 5.3]

Markov Chains, Random Walk Model, Chapman–Kolmogorov Equations,

Classification of States, Irreducible Markov chain, Recurrent state, Transient
4 state, Long-Run Proportions. (Theorems without proof) 9

[Text 2: Relevant topics from sections 4.1, 4.2, 4.3, 4.4]

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.
Familiarize and apply limit theorems and to understand the
CO3 K3
fundamental characteristics of stochastic processes.
Solve problems involving Markov Chains, to understand their
CO4 theoretical foundations and to apply them to model and predict the K3
behaviour of various stochastic processes.

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
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

Probability and Statistics for 9th edition,

1 Devore J. L Cengage Learning
Engineering and the Sciences 2016

2 Introduction to Probability Sheldon M. Ross Academic Press 13th edition,

Models 2024
 Reference Books
Edition and
Sl. No Title of the Book Name of the Author/s Name of the Publisher
Year
Probability and Random Cambridge University
1 Processes for Electrical and John A. Gubner 2012
Press
Computer Engineers
Probability Models for 1st edition,
2 Sheldon M. Ross Academic Press
Computer Science 2001

Probability, Random Variables Papoulis, A. & Pillai, 4th edition,

3 Tata McGrawHill.
and Stochastic Processes S.U., 2002

4 Probability, Statistics and Kousalya Pappu Pearson 2013

Random Processes

Video Links (NPTEL, SWAYAM…)

Module Link ID
No.
1 https://onlinecourses.nptel.ac.in/noc22_mg31/preview
2 https://onlinecourses.nptel.ac.in/noc22_mg31/preview
3 https://archive.nptel.ac.in/courses/108/103/108103112/
4 https://archive.nptel.ac.in/courses/108/103/108103112/
 SEMESTER S3

THEORY OF COMPUTATION
(Common to CS/CA/CM/CD/CN/CC)

PCCST302
Course Code CIE Marks 40
Teaching Hours/Week 3:1:0:0 ESE Marks 60
(L: T:P: R)
Credits 4 Exam Hours 2 Hrs 30 Mins
PCCST205
Prerequisites (if any) Course Type Theory

Course Objectives:

1. To introduce the concept of formal languages.

2. To discuss the Chomsky classification of formal languages with a discussion on grammar and
automata for regular, context-free, context-sensitive, and unrestricted languages.
3. To discuss the notions of decidability and the halting problem.

SYLLABUS
Module Contact
Syllabus Description
No. Hours

Foundations (Linz, Hopcroft)

Motivation for studying computability, need for mathematical modeling -

automata, Introducing automata through simple models - On/Off switch,
coffee vending machine. Three basic concepts: Alphabet, Strings, and
Languages

Finite Automata (Linz, Hopcroft)

1 11
Formal definition of a finite automaton, Deterministic Finite Automata
(DFA), Regular languages, Nondeterminism (guess and verify paradigm),
Formal definition of a nondeterministic finite automaton, NFA with epsilon
transitions, Eliminating epsilon transitions (Proof not expected), Equivalence
of NFAs and DFAs (Proof not expected) - The Subset Construction. DFA
State Minimization, Applications of finite automata - text search, keyword
recognition

Regular Expressions (Linz)

2
The formal definition of a regular expression, Building Regular
Expressions, Equivalence with finite automata (Proof not expected) -
 Converting FA to Regular Expressions, Converting Regular Expressions
to FA, Pattern Matching and Regular Expressions, Regular grammar,
Equivalence with FA - Conversion in both directions

Properties of Regular Languages (Linz)

Closure and Decision Properties of Regular Languages (with proofs), The

Pumping Lemma for Regular Languages (with formal proof), Pumping
lemma as a tool to prove non regularity of languages

Context-Free Grammars and Applications (Linz) 11

Formal definition of a context-free grammar, Designing context-free
grammars, Leftmost and Rightmost Derivations Using a Grammar, Parse
Trees, Ambiguous Grammars, Resolving ambiguity, Inherent ambiguity,
CFGs, and programming languages

Pushdown Automata (Linz)

Formal definition of a pushdown automaton, DPDA and NPDA, Examples
of pushdown automata

Equivalence NPDAs and CFGs (Proof not expected) - conversions in both

directions
Simplification of Context-Free Languages (Linz)
3 11
Elimination of useless symbols and productions, Eliminating epsilon
productions, Eliminating unit productions, Chomsky normal form,
Greibach normal form,

Properties of Context-Free Languages (Linz)

The Pumping Lemma for Context-Free Languages (with formal proof),
Closure and Decision Properties of Context-Free Languages (with formal
proofs)

Turing Machines (Kozen)

The formal definition of a Turing machine, Examples of Turing machines -

Turing machines as language acceptors, Turing machines as computers of
functions, Variants of Turing Machines (Proofs for equivalence with basic
model not expected), Recursive and recursively enumerable languages

Chomskian hierarchy, Linear bounded automaton as a restricted TM.

4 11

Computability (Kozen)

Church Turing thesis, Encoding of TMs, Universal Machine and

Diagonalization, Reductions, Decidable and Undecidable Problems, Halting
problem, Post Correspondence Problem and the proofs for their
undecidability.
 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.
carrying 3 marks ● Each question can have a maximum of 3 60
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)
Classify formal languages into regular, context-free, context-sensitive,
CO1 K2
and unrestricted languages.
Develop finite state automata, regular grammar, and regular
CO2 K3
expression.
Model push-down automata and context-free grammar representations
CO3 K3
for context-free languages.
Construct Turing Machines to accept recursive and recursively
CO4 K3
enumerable languages.
Describe the notions of decidability and undecidability of problems,
CO5 K2
the Halting problem.
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
3 3 3 3 3
CO1
3 3 3 3 3
CO2
3 3 3 3 3
CO3
3 3 3 3 3
CO4
3 3 3 3 3
CO5
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
An Introduction to Formal Peter Linz and Susan H. Jones and Bartlett
1 7/e, 2022
Languages and Automata Rodger Publishers, Inc
Introduction to Automata
John E.Hopcroft, Rainbow Book
2 Theory Languages And 3/e, 2015
Jeffrey D.Ullman Distributiors
Computation

3 Automata and Computability Dexter C. Kozen Springer 1/e,2007

Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Introduction to the Theory of Cengage India Private 3/e, 2014
1 Michael Sipser
Computation Limited

Introduction to Languages and McGraw-Hill

John C Martin 4/e, 2010
2 the Theory of Computation Education

Theory of Computation: A
Kavi Mahesh Wiley 1/e, 2012
3 Problem-Solving Approach

Elements of the Theory of Harry R. Lewis, Christos

4 Pearson Education 2/e, 2015
Computation Papadimitriou
 Video Links (NPTEL, SWAYAM…)
Module
Link ID
No.
1 https://archive.nptel.ac.in/courses/106/104/106104148/
https://nptel.ac.in/courses/106106049
https://archive.nptel.ac.in/courses/106/104/106104148/
2
https://nptel.ac.in/courses/106106049

https://archive.nptel.ac.in/courses/106/104/106104148/
3
https://nptel.ac.in/courses/106106049

https://archive.nptel.ac.in/courses/106/104/106104148/
4
https://nptel.ac.in/courses/106106049
 SEMESTER S3

DATA STRUCTURES AND ALGORITHMS

(Common to CS/CA/CM/CD/CR/AI/AM/AD/CB/CN/CC/CU/CI/CG)

Course Code PCCST303 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) UCEST105 Course Type Theory

Course Objectives:

1. To provide the learner a comprehensive understanding of data structures and algorithms.

2. To prepare them for advanced studies or professional work in computer science and related
fields.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Basic Concepts of Data Structures
Definitions; Data Abstraction; Performance Analysis - Time & Space
Complexity, Asymptotic Notations; Polynomial representation using
1 11
Arrays, Sparse matrix (Tuple representation); Stacks and Queues - Stacks,
Multi-Stacks, Queues, Circular Queues, Double Ended Queues; Evaluation
of Expressions- Infix to Postfix, Evaluating Postfix Expressions.
Linked List and Memory Management
Singly Linked List - Operations on Linked List, Stacks and Queues using

2 Linked List, Polynomial representation using Linked List; Doubly Linked 11

List; Circular Linked List; Memory allocation - First-fit, Best-fit, and
Worst-fit allocation schemes; Garbage collection and compaction.
Trees and Graphs
Trees :- Representation Of Trees; Binary Trees - Types and Properties,
Binary Tree Representation, Tree Operations, Tree Traversals; Expression
3 11
Trees; Binary Search Trees - Binary Search Tree Operations; Binary Heaps
- Binary Heap Operations, Priority Queue.
Graphs :- Definitions; Representation of Graphs; Depth First Search and
 Breadth First Search; Applications of Graphs - Single Source All
Destination.
Sorting and Searching
Sorting Techniques :- Selection Sort, Insertion Sort, Quick Sort, Merge
Sort, Heap Sort, Radix Sort.

4 Searching Techniques :- Linear Search, Binary Search, Hashing - Hashing 11

functions : Mid square, Division, Folding, Digit Analysis; Collision
Resolution : Linear probing, Quadratic Probing, Double hashing, Open
hashing.

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 =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 Identify appropriate data structures for solving real world problems. K3
Describe and implement linear data structures such as arrays, linked K3
CO2
lists, stacks, and queues.
Describe and Implement non linear data structures such as trees and K3
CO3
graphs.
Select appropriate searching and sorting algorithms to be used in K3
CO4
specific circumstances.
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

CO2 3 3 3 3

CO3 3 3 3 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
Universities
Ellis Horowitz, Sartaj Sahni
1 Fundamentals of Data Structures in C press, 2/e, 2007
and Susan Anderson-Freed,
Thomas H Cormen, Charles
2 Introduction to Algorithms Leisesrson, Ronald L PHI 3/e, 2009
Rivest, Clifford Stein
 Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Prentice Hall
1 Classic Data Structures Samanta D. 2/e, 2018
India.
Aho A. V., J. E.
Pearson
2 Data Structures and Algorithms Hopcroft and J. D. 1/e, 2003
Publication.
Ullman
Introduction to Data Structures with Tremblay J. P. and P. G. Tata McGraw
3 2/e, 2017
Applications Sorenson Hill.
Theory and Problems of Data
4 Lipschuts S. Schaum’s Series 2/e, 2014
Structures

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
1 https://nptel.ac.in/courses/106102064
2 https://ocw.mit.edu/courses/6-851-advanced-data-structures-spring-2012/
 SEMESTER S3

OBJECT ORIENTED PROGRAMMING

(Common to CS/CA/CD/AM/CB/CN/CU/CG)

Course Code PBCST304 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 teach the core object-oriented principles such as abstraction, encapsulation, inheritance, and
polymorphism, robust error-handling using exception mechanisms to ensure program
reliability.
2. To equip the learner to develop object oriented programs encompassing fundamental
structures, environments, and the effective utilization of data types, arrays, strings, operators,
and control statements for program flow in Java.
3. To enable the learner to design and develop event-driven graphical user interface (GUI)
database applications using Swing and database connection components.
SYLLABUS

Module Contact
Syllabus Description
No. Hours
Introduction to Java:
Structure of a simple java program; Java programming Environment and
Runtime Environment (Command Line & IDE); Java compiler; Java Virtual
Machine; Primitive Data types and Wrapper Types; Casting and Autoboxing;
Arrays; Strings; Vector class; Operators - Arithmetic, Bitwise, Relational,
Boolean Logical, Assignment, Conditional (Ternary); Operator Precedence;
1 Control Statements - Selection Statements, Iteration Statements and Jump 10
Statements; Functions; Command Line Arguments; Variable Length
Arguments; Classes; Abstract Classes; Interfaces. [Use proper naming
conventions]

OOP Concepts :-
Data abstraction, encapsulation, inheritance, polymorphism, Procedural and
 object oriented programming paradigm; Microservices.

Object Oriented Programming in Java :-

Declaring Objects; Object Reference; Introduction to Methods; Constructors;
Access Modifiers; this keyword.
Polymorphism :-
Method Overloading, Using Objects as Parameters, Returning Objects,
Recursion.
Static Members, Final Variables, Inner Classes.
2 8
Inheritance - Super Class, Sub Class, Types of Inheritance, The super
keyword, protected Members, Calling Order of Constructors.
Method Overriding, Dynamic Method Dispatch, Using final with
Inheritance.
Packages and Interfaces –
Packages - Defining a Package, CLASSPATH, Access Protection, Importing
Packages.

Interfaces - Interfaces v/s Abstract classes, defining an interface,

implementing interfaces, accessing implementations through interface
3 references, extending interface(s). 9

Exception Handling - Checked Exceptions, Unchecked Exceptions, try

Block and catch Clause, Multiple catch Clauses, Nested try Statements,
throw, throws and finally, Java Built-in Exceptions, Custom Exceptions.

Introduction to design patterns in Java : Singleton and Adaptor.

SOLID Principles in Java (https://www.javatpoint.com/solid-principles-
java)
Swings fundamentals – Overview of AWT, Swing v/s AWT, Swing Key
Features, Model View Controller (MVC), Swing Controls, Components and
Containers, Swing Packages, Event Handling in Swings, Swing Layout
Managers, Exploring Swings–JFrame, JLabel, The Swing Buttons,
4 JTextField. 10

Event handling – Event Handling Mechanisms, Delegation Event Model,

Event Classes, Sources of Events, Event Listener Interfaces, Using the
Delegation Event Model.

Developing Database Applications using JDBC – JDBC overview, Types,

 Steps, Common JDBC Components, Connection Establishment, SQL
Fundamentals [For projects only] - Creating and Executing basic SQL
Queries, Working with Result Set, Performing CRUD Operations with
JDBC.

Suggestion on Project Topics

Student should Identify a topic to be implemented as project having the following nature
i. It must accept a considerable amount of information from the user for processing.
ii. It must have a considerable amount of data to be stored permanently within the computer -
as plain files / using databases..
iii. It must process the user provided data and the stored data to generate some output to
be displayed to the user.

Examples : -

1. Design and implement the Circulation function in a Library Management System using
Object-Oriented Programming (OOP) principles in Java and limited use of SQL. The system
should manage the operations of a library, such as book & user management, borrowing and
returning books.

Requirements

I. Class Design
● Book: Attributes like title, author, ISBN, genre, and status (available/borrowed).
● User: Attributes like user ID, name, contact information, and a list of borrowed
books.
● Library: Attributes like a list of books and a list of users.
● Librarian: Inherits from User, with additional functionalities like adding/removing
books and managing users.
● BorrowTransaction: Attributes like transaction ID, book, user, borrow date, and
return date
II. Functionalities
a. Book Management:
● Add, remove, and update book details.
● Search books by title, author, ISBN, and genre.
b. User Management:
● Register new users.
● Search users by user ID and name.
 c. Borrowing and Returning:
● Borrow a book: Check if the book is available and if the user can borrow
more books.
● Return a book: Update the book’s status and remove it from the user’s
borrowed list.
III. Deliverables

1. Design Document: Describe the classes, their attributes, methods and relationships.

2. Source Code: Well-documented Java code implementing the described functionalities.

3. User Manual: Instructions on how to set up, run and use the system.

4. Test Cases: A suite of test cases demonstrating the functionality of the system.

2. Design and implement an Online Payment Processing System using Object-Oriented

Programming(OOP) principles in Java, with a focus on dynamic polymorphism. The system
should support different types of payment methods and demonstrate polymorphism in
processing payments.

Requirements

a. Class Design
● Payment: An abstract base class with common attributes and an abstract method for
processing payments.
● CreditCardPayment: Inherits from Payment, with specific implementation for processing
credit card payments.
● PayPalPayment: Inherits from Payment, with specific implementation for processing
PayPal payments.
● BankTransferPayment: Inherits from Payment, with specific implementation for
processing bank transfer payments.
● PaymentProcessor: A class to manage and process different types of payments.
b. Functionalities
● Add Payment Method: Add new payment methods (CreditCardPayment, PayPalPayment,
BankTransferPayment) to the system.
● Process Payment: Demonstrate dynamic polymorphism by processing payments using
different methods.

c. Deliverables
● Design Document: Describe the classes, their attributes, methods and relationships.
● Source Code: Well-documented Java code implementing the described functionalities.
 ● User Manual: Instructions on how to set up, run and use the system.
● Test Cases: A suite of test cases demonstrating the functionality of the system.

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
40
each carrying 2 marks subdivisions. E
(8x2 =16 marks)  ach question carries 6 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)
Explain the process of writing, compiling, and executing basic Java programs,
CO1 including their structure and components, to demonstrate proficiency.
K2

Utilize object-oriented programming principles in the design and

CO2 implementation of Java applications.
K3

Develop and manage Java packages and interfaces, enhancing code

CO3 modularity and reusability.
K3

Implement error handling using Java's exception mechanisms and leverage

CO4 interfaces for modular applications.
K3

Develop event-driven Java GUI applications with database connectivity using

CO5 Swing and JDBC.
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 3 3

CO2 3 3 3 3

CO3 3 3 3 3 3

CO4 3 3 3 3 3

CO5 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

1 Java: The Complete Reference Herbert Schildt Tata McGraw Hill 13/e, 2024
Introduction to Java Programming,
2 Y Daniel Liang Pearson 10/e, 2014
Comprehensive Version
Eric Freeman, Elisabeth O'Reilly Media
Head First Design Patterns
3 Robson, Bert Bates, 1/e, 2004
Kathy Sierra

Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Head First Java: A Brain
Kathy Sierra & Bert
1 O’Reilly 3/e, 2022
Friendly Guide Bates

2 JAVA™ for Programmers Paul Deitel PHI 11/e, 2018

Clean Code : A Handbook of
3 Robert C. Martin Prentice Hall 1/e, 2008
Agile Software Craftsmanship

Programming with Java McGraw Hill

4 E Balagurusamy 6/e, 2019
Education
5 Java For Dummies Barry A. Burd Wiley 8/e.2022
6 Effective Java Joshua Bloch Pearson 3/e, 2018
 Video Links (NPTEL, SWAYAM…)
Modul
Link ID
e No.
1 https://nptel.ac.in/courses/106105191 (Lecture no: 9, 10, 1, 2, 3, 4)
2 https://nptel.ac.in/courses/106105191 (Lecture no: 1, 7, 8, 11, 12, 13, 14, 15, 16)
3 https://nptel.ac.in/courses/106105191 (Lecture no: 17, 18, 19, 20, 21, 22, 23, 24, 25, 26)
4 https://nptel.ac.in/courses/106105191 (Lecture no: 43, 44, 45, 46, 47, 50, 51, 52, 53, 54, 55)

PBL Course Elements

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

(3 Hrs.) Tutorial Practical Presentation
Simulation/
Presentation
Lecture Laboratory
Project identification (Progress and Final
delivery Work/
Presentations)
Workshops
Group
Project Analysis Data Collection Evaluation
discussion
Question Project Milestone Reviews,
answer Analytical thinking Feedback,
Sessions/ Testing
and self-learning Project reformation (If
Brainstorming
Sessions
required)
Poster Presentation/
Guest Speakers
Case Study/ Field Video Presentation: Students
(Industry Prototyping
Survey Report present their results in a 2 to
Experts)
5 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 S3

DIGITAL ELECTRONICS AND LOGIC DESIGN

(Common to Group A)

Course Code GAEST305 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 familiarize the basic concepts of Boolean algebra and digital systems.

2. To enable the learner to design simple combinational and sequential logic circuits which is
essential in understanding organization & design of computer systems .

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Introduction to digital Systems :- Digital abstraction
Number Systems – Binary, Hexadecimal, grouping bits, Base conversion;
Binary Arithmetic – Addition and subtraction, Unsigned and Signed
numbers; Fixed-Point Number Systems; Floating-Point Number Systems
Basic gates- Operation of a Logic circuit; Buffer; Gates - Inverter, AND gate,
OR gate, NOR gate, NAND gate, XOR gate, XNOR gate; Digital circuit

1 operation - logic levels, output dc specifications, input dc specifications, 11

noise margins, power supplies; Driving loads - driving other gates, resistive
loads and LEDs.

Verilog (Part 1) :-
HDL Abstraction; Modern digital design flow - Verilog constructs: data
types, the module, Verilog operators.
 Combinational Logic Design: –
Boolean Algebra - Operations, Axioms, Theorems; Combinational logic
analysis - Canonical SOP and POS, Minterm and Maxterm equivalence;
Logic minimization - Algebraic minimization, K-map minimization, Dont

2 cares, Code convertors. 11

Modeling concurrent functionality in Verilog:-
Continuous assignment - Continuous Assignment with logical operators,
Continuous assignment with conditional operators, Continuous assignment
with delay.
MSI Logic and Digital Building Blocks
MSI logic - Decoders (One-Hot decoder, 7 segment display decoder),
Encoders, Multiplexers, Demultiplexers; Digital Building Blocks -
Arithmetic Circuits - Half adder, Full adder, half subtractor, full subtractor;
3 8
Comparators.

Structural design and hierarchy - lower level module instantiation, gate level
primitives, user defined primitives, adding delay to primitives.
Sequential Logic Design :- Latches and Flip-Flops- SR latch, SR latch with
enable, JK flipflop, D flipflop, Register Enabled Flip-Flop, Resettable Flip-
Flop. Sequential logic timing considerations; Common circuits based on
sequential storage devices - toggle flop clock divider, asynchronous ripple
counter, shift register.

4 Finite State Machines :- 14

Finite State Machines - logic synthesis for an FSM, FSM design process and
design examples; Synchronous Sequential Circuits - Counters;

Verilog (Part 2) : -
Procedural assignment; Conditional Programming constructs; Test benches;
Modeling a D flipflop in Verilog; Modeling an FSM in Verilog.
 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 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)
Summarize the basic concept of different number systems and perform
CO1 K2
conversion and arithmetic operations between different bases.
Interpret a combinational logic circuit to determine its logic expression, truth
CO2 table, and timing information and to synthesize a minimal logic circuit through K2
algebraic manipulation or with a Karnaugh map.
Illustrate the fundamental role of hardware description languages in modern
CO3 digital design and be able to develop the hardware models for different digital K3
circuits.
Develop MSI logic circuits using both the classical digital design approach and
CO4 K3
the modern HDL-based approach.
Develop common circuits based on sequential storage devices including
CO5 counter, shift registers and a finite state machine using the classical digital K3
design approach and an HDL-based structural approach.
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

CO2 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
Sl. Name of the Name of the Edition
Title of the Book
No Author/s Publisher and Year
Introduction to Logic Circuits & Logic Springer International
1 Brock J. LaMeres 2/e, 2017
Design with Verilog Publishing
Digital Design and Computer Sarah L. Harris,
2 Morgan Kaufmann 1/e, 2022
Architecture - RISC-V Edition David Harris

Reference Books
Name of the Name of the Edition
Sl. No Title of the Book
Author/s Publisher and Year
Digital Design with an Introduction to the M Morris Mano,
1 Pearson 6/e, 2018
Verilog HDL, VHDL, and System Verilog Michael D Ciletti
2 Digital Fundamentals Thomas Floyd Pearson 11/e, 2015
Fundamentals of Digital Logic with Verilog Stephen Brown,
3 McGrawHill 3/e, 2014
Design Zvonko Vranesic
Zvi Kohavi Cambridge
4 Switching and Finite Automata Theory 3/e, 2010
Niraj K. Jha University Press
 Video Links (NPTEL, SWAYAM…)

No. Link ID
1 https://nptel.ac.in/courses/117105080
2 https://onlinecourses.nptel.ac.in/noc21_ee39/
3 https://onlinecourses.nptel.ac.in/noc24_cs61/
 SEMESTER S3

ECONOMICS FOR ENGINEERS

(Common to All Branches)

Course Code UCHUT346 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. 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 applications – Equilibrium- Changes in demand and supply and its effects
6

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)

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

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

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

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 Engineering - Value Engineering Procedure - Break-even Analysis - Cost-
6

Benefit Analysis - Capital Budgeting - Process planning

Course Assessment Method

(CIE: 50 marks, ESE: 50 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
of which 1 question should be answered.
2 Questions from each
module.  Each question can have a maximum of 2 sub
divisions. 50
 Total of 6 Questions, each
carrying 3 marks  Each question carries 8 marks.
(6x3 =18marks) (4x8 = 32 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 -
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
Geetika, Piyali Ghosh
1 Managerial Economics Tata McGraw Hill, 2015
and Chodhury

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

3 R. Paneerselvam PHI 2012

Engineering Economics
 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 Mc Graw Hill 7TH Edition
Engineering Economy 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
1 6
technologies: 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.

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
4 renewable energy adoption. Climate Change and Engineering Solutions: 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/I Marks
No. ndividu
al (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 and G 8

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 the
methodologies, relevant papers with a specific analysis of the Kerala
findings, and 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 & Module G 15
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
Edition and
Sl. No Title of the Book Name of the Author/s Name of the Publisher
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

Cambridge University
4 Sustainable Engineering Bhavik R. Bakshi, 2019
Principles and Practice Press & Assessmen

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 S3

DATA STRUCTURES LAB

(Common to CS/CA/CM/CD/CR/AI/AM/AD/CB/CN/CC/CU/CI/CG)

Course Code PCCSL307 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) GYEST204 Course Type Lab

Course Objectives:

To give practical experience for learners on implementing different linear and non linear data
structures, and algorithms for searching and sorting.

Expt.
Experiments
No.
1 Find the sum of two sparse polynomials using arrays
2 Find the transpose of a sparse matrix and sum of two sparse matrices.
3 Convert infix expression to postfix (or prefix) and then evaluate using stack,

4 Implement Queue, DEQUEUE, and Circular Queue using arrays.

Implement backward and forward navigation of visited web pages in a web browser (i.e.
5
back and forward buttons) using doubly linked list operations.
6 Implement addition and multiplication of polynomials using singly linked lists.
Create a binary tree for a given simple arithmetic expression and find the prefix / postfix
7
equivalent.
8 Implement a dictionary of word-meaning pairs using binary search trees.
9 Find the shortest distance of every cell from a landmine inside a maze.
We have three containers whose sizes are 10 litres, 7 litres, and 4 litres, respectively. The
7-litre and 4-litre containers start out full of water, but the 10-litre container is initially
10 empty. We are allowed one type of operation: pouring the contents of one container into
another, stopping only when the source container is empty or the destination container is
full. We want to know if there is a sequence of pourings that leaves exactly 2 litres in the 7
 or 4-litre container. Model this as a graph problem and solve.

11 Implement the find and replace feature in a text editor.

Given an array of sorted items, implement an efficient algorithm to search for specific
12
item in the array.
Implement Bubble sort, Insertion Sort, Radix sort, Quick Sort, and Merge Sort and
13
compare the number of steps involved.
The General post office wishes to give preferential treatment to its customers. They have
identified the customer categories as Defence personnel, Differently abled, Senior citizen,

14 Ordinary. The customers are to be given preference in the decreasing order - Differently
abled, Senior citizen, Defence personnel, Normal person. Generate the possible sequence
of completion.

Implement a spell checker using a hash table to store a dictionary of words for fast

15 lookup. Implement functions to check if a word is valid and to suggest corrections for
misspelled words.

16 Simulation of a basic memory allocator and garbage collector using doubly linked list

The CSE dept is organizing a tech fest with so many exciting events. By participating

in an event, you can claim for activity points as stipulated by KTU. Each event i gives
17
you A[i] activity points where A is an array. If you are not allowed to participate in more

than k events, what’s the max number of points that you can earn?

Merge K sorted lists into a single sorted list using a heap. Use a min-heap to keep track of
18 the smallest element from each list. Repeatedly extract the smallest element and insert the
next element from the corresponding list into the heap until all lists are merged.

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)
Model a real world problem using suitable data structure and implement the
CO1 K3
solution.
Compare efficiency of different data structures in terms of time and space
CO2 K4
complexity.
CO3 Evaluate the time complexities of various searching and sorting algorithms. K5
Differentiate static and dynamic data structures in terms of their advantages
CO4 K3
and application.
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 3
CO2 3 3 3 3 3 3
CO3 3 3 3 3 3 3
CO4 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
Universities
Fundamentals of Data Ellis Horowitz, Sartaj Sahni and Susan Press,
1 2/e, 2007
Structures in C Anderson-Freed,

Thomas H Cormen, Charles

Introduction to
2 Leisesrson, Ronald L Rivest, Clifford PHI 3/e, 2009
Algorithms
Stein

Reference Books
Sl. Name of the Edition
Title of the Book Name of the Author/s
No Publisher and Year
1 Classic Data Structures Samanta D. Prentice Hall India. 2/e, 2018

Aho A. V., J. E. Hopcroft

2 Data Structures and Algorithms Pearson Publication. 1/e, 2003
and J. D. Ullman

Introduction to Data Structures with Tremblay J. P., P. G.

3 Tata McGraw Hill. 2/e, 2017
Applications Sorenson

Theory and Problems of Data

4 Lipschutz S. Schaum’s Series 2/e, 2014
Structures

Video Links (NPTEL, SWAYAM…)

No. Link ID

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

2 https://ocw.mit.edu/courses/6-851-advanced-data-structures-spring-2012/
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 LAB
(Common to CS/CM/AM/CN)

Course Code PCCSL308 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) None Course Type Lab

Course Objectives:
1. To enable the learner to design and implement basic digital logic circuits using logic
gates and ICs.
2. To familiarize digital system design using HDL.

EXPERIMENTS
(All HDL based experiments should be done using Verilog HDL. At Least three experiments
Expt. of PART A & B together should be implemented on a breadboard . Use any open source
No. circuit simulation software or web based logic simulator softwares for the rest of the
experiments (refer to https://circuitverse.org, https://simulator.io,
https://www.logiccircuit.org)
Part A
(All experiments in this part are mandatory. These experiments give an introduction to the
digital design by familiarising the basic gates and combinational circuits on breadboard /
circuit simulation softwares along with their HDL based realisation.)
Study of basic digital ICs and verification of Boolean theorems using digital logic
A1.
gates.
Familiarisation of the working of circuit simulation software.
a. Realize the basic logic gates and analyze their waveforms
A2..
b. Realize a given Boolean function using basic gates and verify the
waveform with the truth table.

Familiarisation of Verilog HDL - Modelling of the basic gates using

A3. a. gate level modelling
 b. behavioural modelling

c. structural modelling

d. dataflow modelling

Realization of an SOP and its corresponding POS expression using NAND gates alone and NOR
A4.
gates alone (to be do on breadboard and simulated using software)
Model a given Boolean function (SOP and POS) in Verilog using
a. continuous assignment with logical operators

A5. b. continuous assignment with conditional operators

c. using gate level primitives

Part B
(All experiments to be done using any circuit simulation softwares.)
Design and implement a combinational logic circuit for arbitrary functions (any two)
a) Code converters
B1.
b) Half adder, full adder, half subtractor, full subtractor
c) Multiplexer, Demultiplexer,Encoder, Decoder
Design and implement combinational circuits using MSI devices: (any three)
1. 4-bit adder and subtractor using MSI device IC 7483.
B2. 2. Parity generator / checker using MSI device IC 74180
3. Magnitude Comparator using MSI device IC 7485
4. Implement a boolean function using MUX IC
B3. Study of D flip flop and JK flip flops using ICs
To design and implement the following shift registers using D flip flops
(i) Serial in serial out
B4. (ii) Serial in parallel out
(iii) Parallel in serial out
(iv) Parallel in parallel out
Design and implement an asynchronous counter - 3 bit up counter, 3-bit down counter, 3 bit up
B5.
down counter with mode control, mod-N counter
Design and implement a synchronous counter - 3 bit up counter, 3-bit down counter, sequence
B6.
generator.
PART C
using Verilog HDL
For the all the experiments in part C:
1. Write Verilog program code in the IDE/Software (Other open source or online softwares
such as Icarus Verilog / EDAplayground may be used)
 2. Simulate the code using a test bench or by giving input values.

3. Synthesize the design and verify the waveforms

Model a 4:1 MUX, 1:4 DEMUX, 4 to 2 encoder, and 2 to 4 decoder and a 7-Segment Display
Decoder in Verilog using
C1. a. continuous assignment with logical operators

b. continuous assignment with conditional operators

C2. Design and synthesize the behavioural model for a D flip flop in Verilog HDL

C3. Design and synthesize the behavioural model for a synchronous counter in Verilog
Design a Verilog HDL behavioral model to implement a finite-state machine - a serial bit sequence
C4.
detector

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 Model and construct combinational logic circuits. K3

CO2 Develop modular combinational circuits with MUX,DEMUX and decoder. K3

CO3 Experiment with synchronous and asynchronous sequential circuits. K3

CO4 Model and implement FSM. K3

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 3

CO2 3 3 3 3 3 3

CO3 3 3 3 3 3 3

CO4 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
Introduction to Logic Circuits Springer International
1 Brock J. LaMeres 2/e, 2017
& Logic Design with Verilog Publishing
Digital Design and Computer Sarah L. Harris, David
2 Morgan Kaufmann 1/e, 2022
Architecture - RISC-V Edition Harris
Verilog HDL Synthesis: A
3 J Bhasker Star Galaxy Publishing 1/e, 1998
Practical Primer
 Reference Books
Name of the Name of the Edition
Sl. No Title of the Book
Author/s Publisher and Year
Digital Design with an Introduction to the
M Morris Mano,
1 Verilog HDL, VHDL, and System Pearson 6/e, 2018
Michael D Ciletti
Verilog
Fundamentals of Digital Logic with Stephen Brown,
2 McGrawHill 3/e, 2014
Verilog Design Zvonko Vranesic

Video Links (NPTEL, SWAYAM…)

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

2 https://archive.nptel.ac.in/courses/108/103/108103179/

3 https://www.youtube.com/watch?v=JU0RKPe7AhA (Introduction to CircuitVerse)

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 4
COMPUTER SCIENCE AND ENGINEERING
 SEMESTER S4

MATHEMATICS FOR COMPUTER AND INFORMATION SCIENCE-4

(Group A)

Course Code GAMAT401 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:

To provide a comprehensive understanding of fundamental concepts of graph theory

including paths, cycles, trees, graph algorithms, graph coloring and matrix representations,
emphasizing their applications across various disciplines.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Introduction to Graphs - Basic definition, Application of graphs, finite and
infinite graphs, Incidence and Degree, Isolated vertex, Pendant vertex and
Null graph. Isomorphism, Sub graphs, Walks, Paths and circuits, Connected
1 9
graphs, Disconnected graphs and components.

[Text 1: Relevant topics from sections 1.1, 1.2, 1.3, 1.4, 1.5, 2.1, 2.2, 2.4,
2.5. Proofs of theorems 2.5, 2.7 are excluded.]
Euler graphs, Operations on Graphs, Hamiltonian paths and circuits,
Travelling Salesman Problem, Connectivity, Edge connectivity, Vertex
2 connectivity, Directed graphs, Types of directed graphs. 9

[Text 1: Relevant topics from sections 2.6, 2.7, 2.8, 2.9, 2.10, 4.1, 4.2, 4.5,
9.1, 9.2. Proofs of theorems 4.6, 4.11, 4.12 are excluded.]
Trees- properties, Pendant vertices, Distance and centres in a tree, Rooted
and binary trees, Counting trees, Spanning trees, Prim's algorithm and
3 9
Kruskal's algorithm, Dijkstra's shortest path algorithm, Floyd-Warshall
shortest path algorithm.
 [Text 1: Relevant topics from sections 3.1, 3.2, 3.3, 3.4, 3.5, 3.6, 3.7, 3.10,
11.5. Proofs of theorems 3.10, 3.16 are excluded.]

Matrix representation of graphs- Adjacency matrix, Incidence Matrix, Circuit

Matrix, Path Matrix, Coloring, Chromatic number, Chromatic polynomial,
4 Greedy colouring algorithm. 9

[Text 1: Relevant topics from sections 7.1, 7.3, 7.8, 7.9, 8.1, 8.3. Proofs of
theorems 7.4, 7.7, 7.8, 8.2, 8.3, 8.5, 8.6 are excluded.]

Course Assessment Method

(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

Internal Internal
Assignment/
Attendance Examination-1 Examination- 2 Total
Micro project
(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 fundamental concepts of graph theory such as types of

CO1 K2
graphs, degree of a vertex, graph isomorphism, connectedness.
Understand the concepts of Euler graphs, Hamiltonian graphs and
CO2 K2
connectivity.
Apply Prim's and Kruskal's algorithms for finding minimum cost
CO3 spanning tree and Dijkstra's and Floyd-Warshall algorithms for finding K3
shortest paths.
Illustrate various representations of graphs using matrices and apply
CO4 K3
vertex coloring in real life problems.
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 - - - - - - - 2
CO4 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
Graph Theory with Prentice Hall India
1 1st edition,
Applications to Engineering Narsingh Deo Learning Private
1979
and Computer Science Limited

Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
1 Introduction to Graph Theory Douglas B. West Pearson Education 2nd edition,
2e India 2015
2 Introduction to Graph Theory Robin J. Wilson Longman Group Ltd. 5th edition,
2010
3 Graph Theory with J.A. Bondy and U.S.R. Elsevier Science
1976
Applications Murty Publishing Co., Inc
 Video Links (NPTEL, SWAYAM…)
Module
Link ID
No.
1 https://onlinecourses.nptel.ac.in/noc22_ma10/preview
2 https://onlinecourses.nptel.ac.in/noc22_ma10/preview
3 https://onlinecourses.nptel.ac.in/noc21_cs48/preview
4 https://onlinecourses.nptel.ac.in/noc21_cs48/preview
 SEMESTER S4
DATABASE MANAGEMENT SYSTEMS
(Common to CS/CD/CA/CR/AD/AI/CB/CN/CC/CU/CI/CG)

Course Code PCCST402 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) PCCST303 Course Type Theory

Course Objectives:

1. Equip the students with a comprehensive understanding of fundamental DBMS concepts as

well as the principles and applications of NoSQL databases
2. Enable students to design, implement, and manage both relational and NoSQL databases
SYLLABUS

Module Contact
Syllabus Description
No. Hours
Introduction to Databases :- Database System Concepts and Architecture-
Data Models, Schemas and Instances, Three-Schema Architecture and Data
Independence, Database Languages and Interfaces, Centralized and
Client/Server Architectures for DBMSs.
1
Conceptual Data Modelling and Database Design:- Data Modelling Using the 11
Entity, Relationship (ER) Model - Entity Types, Entity Sets, Attributes, and Keys,
Relationship Types, Relationship Sets, Roles, and Structural Constraints, Weak
Entity Types. Refining the ER Design for the COMPANY Database.
The Relational Data Model and SQL - The Relational Data Model and Relational
Database Constraints-Relational Algebra and Relational Calculus - Structured
2 Query Language (SQL)-Data Definition Language, Data Manipulation Language,
Assertions, Triggers, views, Relational Database Design Using ER-to-Relational 11
Mapping.
Database Design Theory & Normalization - Functional Dependencies -
Basic definition; Normalization- First, Second, and Third normal forms.
3 Transaction Management - Transaction Processing : Introduction, problems and 11
failures in transaction, Desirable properties of transaction, Characterizing
schedules based on recoverability and serializability; Concurrency Control
 with Two-Phase Locking Techniques- Database Recovery management:
Deferred update-immediate update- shadow paging.
Introduction To NoSQL Concepts - types of NoSQL databases- CAP
Theorem- BASE properties- Use Cases and limitations of NoSQL.
4
SQL architectural Patterns - Key value Stores, Graph Stores, Column 11
Family stores and Document Stores.

Course Assessment Method

(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

Internal Internal
Assignment/
Attendance Examination-1 Examination- 2 Total
Micro project
(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)
Summarize and exemplify the fundamental nature and characteristics of
CO1 K2
database systems
Model and design solutions for efficiently representing data using the
CO2 K3
relational model or non-relational model
Discuss and compare the aspects of Concurrency Control and Recovery in
CO3 K3
Database systems
Construct advanced SQL queries to effectively retrieve, filter, and
CO4 K3
manipulate data from relational databases.
CO5 Experiment with NoSQL databases in real world applications 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 3 3

CO2 3 3 3 3 2 2 3

CO3 3 3 3 3 3

CO4 3 3 3 3 3

CO5 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
Fundamentals of Database Systems
1 Elmasri, Navathe Pearson 7/e,
[Module 1,2,3,4]
Making the Sense of NoSQL : A guide Dan McCreary and
2 Manning 2014
for Managers and rest of us [Module 4] Ann Kelly
 Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Sliberschatz A., H. F. Korth
A., H. F. Korth and S.
and S. Sudarshan, Database
1 Sudarshan, Database System McGraw
System Concepts, 6/e, 7/e, 2011
Concepts, Hill,
McGraw
Hill, 2011.
2 Beginning Database Design
Rod Stephens Wiley 2/e, 2023
Solutions
2 Pramod J. Sadalage, Martin Addison-
NoSQL Distilled 1/e, 2012
Fowler Wesley
NoSQL Data Models: Trends
and Challenges (Computer
3 Engineering: Databases and Olivier Pivert Wiley 2018
Big
Data),

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
1 https://onlinecourses.nptel.ac.in/noc21_cs04/preview
2 https://onlinecourses.nptel.ac.in/noc21_cs04/preview
3 https://onlinecourses.nptel.ac.in/noc21_cs04/preview
4 https://archive.nptel.ac.in/courses/106/104/106104135/
 SEMESTER S4

OPERATING SYSTEMS
(Common to CS/CD/CM/CR/CA/AD/AI/CB/CN/CC/CU/CI/CG)

Course Code PCCST403 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 introduce the structure of a typical operating system and its core functionalities
2. To impart to the students, a practical understanding of OS implementation nuances based on
the Linux operating system
SYLLABUS

Module Contact
Syllabus Description
No. Hours
Introduction to Operating Systems (Book 1 Ch 2 introductory part),
Operating System Services (Book 3 Ch 2) Overview of Operating Systems
and Kernels, Linux Versus Classic Unix Kernels (Book 2 Ch 1)

Process concepts: Process Creation, Process States, Data Structures, Process

API (Book 1 Ch 4, 5), Sharing processor among processes - user and kernel
modes, context switching (Book 1 Ch 6), System boot sequence (Book 3 Ch
2)

Case study: Linux kernel process management (Book 2, Ch 3)

1 11
Threads and Concurrency: Concept of a thread, Multithreading benefits,
Multithreading models (Book 3 Ch 4)

Case study: The Linux Implementation of Threads (Book 2, Ch 3)

Process scheduling: Concepts and basic algorithms (Book 1 Ch 7), The

Multilevel Feedback Queue: Basic Rules (Book 1 Ch 8)

Case study: The Linux Completely Fair Scheduler (CFS) (Book 1 Ch 9,

Implementation with RB trees not required), The Linux Scheduling Implementation,
 Preemption and Context Switching (Book 2, Ch 4)

Concurrency and Synchronization - Basic principles (Book 3 Sections 6.1,

6.2), Mechanisms - Locks: The Basic Idea, Building Spin Locks with Test-
And-Set, Compare and Swap, Using Queues: Sleeping Instead Of Spinning
(Book 1 Ch 28), Semaphores - Definition, Binary Semaphores, The
Producer/Consumer (Bounded Buffer) Problem and its solution using
semaphores, Reader-Writer Locks (Book 1 Ch 31)
2
Case study: Linux Kernel Synchronization Methods - Spin Locks,
Semaphores, Mutexes (Book 2 Ch 10) 12

Concurrency: Deadlock and Starvation - Deadlock Characterization, Deadlock

Prevention and Avoidance, Deadlock Detection and recovery (Book 3 Ch 8), Dining
Philosophers Problem and its solution (Book 1 Ch 31)

Memory management - Address Space, Memory API, Address Translation

- An Example, Dynamic (Hardware-based) Relocation, Segmentation:
Generalized Base/Bounds, Address translation in segmentation, Support for
Sharing (Book 1 Ch 13 to 16)

Virtual memory - Paging: Introduction, page tables and hardware support,

3 11
TLBs, Example: Accessing An Array, - TLB hits and misses, Handling TLB
misses, TLB structure, Reducing the page table size (Book 1 Ch 18 to 20)

Going beyond physical memory - Swap space, page fault and its control flow,
page replacement policies, Thrashing (Book 1 Ch 21, 22)

I/O system: Modern System architecture, Programmed I/O, Interrupts,

DMA, Device interaction methods, The Device Driver (Book 1 Ch 36),

Hard disk: Geometry (Book 1 Ch 37), disk scheduling (Book 3 Section

11.2)

Case study: Linux I/O schedulers - Elevator, Complete Fair Queuing (Book
4 10
2 Ch 14)

Files and Directories: The File System Interface - File descriptor, reading
and writing files (sequential and random access), Removing files - Hard links
and Symbolic links, Creating, reading and deleting directories, Permission
bits and Access Control Lists, Mounting a file system (Book 1 Ch 39)
 File Organization: The Inode, The Multi-Level Index (Book 1 Ch 40)

Case study: VFS Objects and Their Data Structures - The Inode Object, Inode
Operations (Book 2 Ch 13)

Course Assessment Method

(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

Internal Internal
Assignment/
Attendance Examination-1 Examination- 2 Total
Micro project
(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)
Apply the concepts of process management and process scheduling
CO1 K3
mechanisms employed in operating systems.
Choose various process synchronization mechanisms employed in
CO2 K3
operating systems.
Use deadlock prevention and avoidance mechanisms in operating
CO3 K3
systems.
CO4 Select various memory management techniques in operating systems. K3

CO5 Understand the storage management in operating 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 3 3 3

CO2 3 3 3 3

CO3 3 3 3 3

CO4 3 3 3 3

CO5 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
Operating Systems: Three Easy Andrea Arpaci-Dusseau,
1 Pieces Remzi Arpaci-Dusseau CreateSpace 1/e, 2018

2 Linux Kernel Development Robert Love Pearson 3/e, 2018

Abraham Silberschatz, Peter
3 Operating System Concepts Wiley 10/e, 2018
B. Galvin, Greg Gagne

Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Andrew S. Tanenbaum
1 Modern Operating Systems Pearson 5/e, 2012
Herbert Bos
The Design of the UNIX
2 Maurice J. Bach Prentice Hall of India 1/e, 1994
Operating System
3 The Little Book of Semaphores Allen B. Downey Green Tea Press 1/e, 2016

Video Links (NPTEL, SWAYAM…)

No. Link ID
1 https://archive.nptel.ac.in/courses/106/105/106105214/
2 https://www.youtube.com/playlist?list=PLDW872573QAb4bj0URobvQTD41IV6gRkx
 SEMESTER S4

COMPUTER ORGANIZATION AND ARCHITECTURE

(Common to CS/CD/CR/CA/AD/CB/CN/CC/CU/CG)

Course Code PBCST404 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) GAEST305 Course Type Theory

Course Objectives

1. Introduce principles of computer organization and the basic architectural concepts using
RISC.
2. Introduce the concepts of microarchitecture, memory systems, and I/O systems.
SYLLABUS
Module Contact
Syllabus Description
No. Hours
Basic Structure of computers :– Functional units - Basic operational
concepts; Memory map; Endianness.
CISC vs RISC architectures:- RISC Introduction - Assembly Language,
Assembler directives, Assembling.
1 11
Programming concepts - Program flow, Branching, Conditional statements,
Loops, Arrays, Function calls; Instruction execution cycle.
Machine language - Instructions, addressing modes, Stored program
concept. Evolution of the RISC Architecture.
Microarchitecture - Introduction; Performance analysis; Single-Cycle
Processor - Single Cycle Datapath, Single Cycle Control; Pipelined
2 11
Processor - Pipelined Data Path, Pipelined Control: Hazards, Solving
Data/Control Hazards, Performance Analysis.
Memory Systems: Introduction; performance analysis; Caches - basic
concepts, Cache mapping, Cache replacement, Multiple-Level Caches,
3 11
Reducing Miss Rate, Write Policy; Virtual Memory - Address Translation;
Page Table; Translation Lookaside Buffer; Memory Protection.
Input / Output - External Devices; I/O Modules; Programmed I/O,

4 Interrupt Driven I/O; Direct Memory Access; Embedded I/O Systems - 11

Embedded I/O, General Purpose I/O, Serial I/O, Other Peripherals.
Suggestion on Project Topics

Use simulators such as Ripes (https://github.com/mortbopet/Ripes) / GEM5

(https://www.gem5.org/) implement components of computer systems such as Various Cache
organization and study the effect, Solutions to hazards, TLBs.

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 which 1

module. question should be answered. Each question can have a

● Total of 8 Questions, each maximum of 2 subdivisions. Each question carries 6 marks. 40

carrying 2 marks (4x6 = 24 marks)

(8x2 =16 marks)

Course Outcomes (COs)

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

Bloom’s
Course Outcome Knowledge
Level (KL)
Identify the basic structure and functional units of a digital computer and the K2
CO1
features of RISC architecture.
Experiment with the single cycle processor, pipelining, and the associated K3
CO2
problems.

CO3 Utilize the memory organization in modern computer systems. K3

CO4 Experiment with the I/O organization of a digital computer. 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 3 3 3
CO2 3 3 3 3 3
CO3 3 3 3 3 3
CO4 3 3 3 3 3

Text Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Digital Design and Computer Sarah L. Harris, David
1 Morgan Kaufmann 1/e, 2022
Architecture - RISC-V Edition Harris
Computer Organization
2 and Architecture William Stallings Pearson 9/e, 2013
Designing for Performance

Reference Books
Name of the Name of the Edition
Sl. No Title of the Book
Author/s Publisher and Year
Computer Organization and Design : David A. Patterson
Morgan
1 The Hardware/Software Interface: John L. Hennessy 1/e,2018
Kaufaman
RISC-V Edition
Carl Hamacher,
Computer Organization Zvonko Vranesic,
2 McGraw Hil 6/e, 2012
and Embedded Systems Safwat Zaky,
Naraig Manjikian
Modern Computer Architecture and
3 Jim Ledin Packt Publishing 1/e,2020
Organization

Video Links (NPTEL, SWAYAM…)

No. Link ID
1 https://archive.nptel.ac.in/courses/106/105/106105163/
2 https://archive.nptel.ac.in/courses/106/106/106106166/
 PBL Course Elements

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

(3 Hrs.) Tutorial Practical Presentation
Simulation/ Presentation
Project
Lecture delivery Laboratory Work/ (Progress and Final
identification
Workshops Presentations)
Group discussion Project Analysis Data Collection Evaluation
Question answer Analytical thinking Project Milestone Reviews,
Sessions/ Feedback,
and Testing
Brainstorming Project reformation (If
Sessions
self-learning
required)
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

SOFTWARE ENGINEERING
(Common to CS/CD/CM/CR/CA/AD/AM/CB/CN/CU/CI)

Course Code PECST411 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 Provide fundamental knowledge in the Software Development Process including Software

Development, Object Oriented Design, Project Management concepts and technology trends.
2. To enable the learners to apply state of the art industry practices in Software development.
SYLLABUS

Module Contact
Syllabus Description Hours
No.
Introduction to Software Engineering and Process Models - Software
engineering, Software characteristics and types, Layers of Software
Engineering-Process, Methods, Tools and Quality focus. Software Process
models – Waterfall, Prototype, Spiral, Incremental, Agile model – Values and
Principles.
1 9
Requirement engineering - Functional, Non-functional, System and User
requirements. Requirement elicitation techniques, Requirement validation,
Feasibility analysis and its types, SRS document characteristics and its
structure.
Case study: SRS for College Library Management Software
Software design - Software architecture and its importance, Software
architecture patterns: Component and Connector, Layered, Repository, Client-
Server, Publish-Subscribe, Functional independence – Coupling and Cohesion
Case study: Ariane launch failure

2 Object Oriented Software Design - UML diagrams and relationships– Static 9

and dynamic models, Class diagram, State diagram, Use case diagram,
Sequence diagram
Case Studies: Voice mail system, ATM Example
Software pattern - Model View Controller, Creational Design Pattern types –
 Factory method, Abstract Factory method, Singleton method, Prototype
method, Builder method. Structural Design Pattern and its types – Adapter,
Bridge, Proxy, Composite, Decorator, Façade, Flyweight. Behavioral Design
Pattern
Coding, Testing and Maintenance:
Coding guidelines - Code review, Code walkthrough and Code inspection,
Code debugging and its methods.
Testing - Unit testing , Integration testing, System testing and its types, Black
box testing and White box testing, Regression testing

3 Overview of DevOps and Code Management - Code management, DevOps 9

automation, Continuous Integration, Delivery, and Deployment (CI/CD/CD),
Case study – Netflix.
Software maintenance and its types- Adaptive, Preventive, Corrective and
Perfective maintenance. Boehm’s maintenance models (both legacy and non-
legacy)
Software Project Management - Project size metrics – LOC, Function points
and Object points. Cost estimation using Basic COCOMO.
Risk management: Risk and its types, Risk monitoring and management model
Software Project Management - Planning, Staffing, Organizational structures,
Scheduling using Gantt chart. Software Configuration Management and its
4 9
phases, Software Quality Management – ISO 9000, CMM, Six Sigma for
software engineering.
Cloud-based Software -Virtualisation and containers, Everything as a service
(IaaS, PaaS), Software as a service. Microservices Architecture - Microservices,
Microservices architecture, Microservice deployment.

Course Assessment Method

(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

Internal Internal
Assignment/
Attendance Examination-1 Examination- 2 Total
Micro project
(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.
(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)
Plan the system requirements and recommend a suitable software process
CO1 K3
model
CO2 Model various software patterns based on system requirements K3
Apply testing and maintenance strategies on the developed software
CO3 K3
product to enhance quality
CO4 Develop a software product based on cost, schedule and risk constraints 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 3 3

CO2 3 3 3 3

CO3 3 3 3 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
Software Engineering: A McGraw-Hill
1 Roger S. Pressman 8/e, 2014
practitioner's approach International edition
2 Software Engineering Ian Sommerville Addison-Wesley 10/e, 2015
Erich Gamma,Richard Pearson Education
Design Patterns, Elements of
3 Helm, Ralph Addison-Wesley 1/e, 2009
Reusable Object Oriented Software
Johnson,John Vlissides
 Reference Books
Name of the Name of the Edition
Sl. No Title of the Book
Author/s Publisher and Year
Pankaj Jalote’s Software Engineering:
1 Pankaj Jalote Wiley India 1/e, 2024
With Open Source and GenAI
Waman S
2 Software Engineering: A Primer Tata McGraw-Hill 1/e, 2008
Jawadekar
Object-Oriented Modeling Michael Blaha, Pearson Education.
3 2/e, 2007
and Design with UML James Rumbaugh
Software Engineering Foundations : A Auerbach
4 Yingux Wang 1/e, 2008
Software Science Perspective Publications
5 Object-Oriented Design and Patterns Cay Horstmann Wiley India 2/e, 2005
Engineering Software Products: An
1/e, 2020
6 Introduction to Modern Software Ian Sommerville Pearson Education
Engineering

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
https://www.youtube.com/watch?v=Z6f9ckEElsU
1

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

http://digimat.in/nptel/courses/video/106105150/L01.html
3

https://www.youtube.com/watch?v=v7KtPLhSMkU
4
 SEMESTER S4

PATTERN RECOGNITION
(Common to CS/CM/CA/AM/CN/CI)

Course Code PECST412 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.

GAMAT101, GAMAT201,
Prerequisites (if any) GAMAT301, Course Type Theory
PCCST303
Course Objectives:

1. To introduce a foundational understanding of the fundamental principles, theories, and

methods used in pattern recognition.
2. To develop practical skills in implementing pattern recognition algorithms and techniques.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Foundations of Pattern Recognition

Introduction to Pattern Recognition - Definitions and applications of

pattern recognition, Overview of pattern recognition systems (Text 2,
Chapter 1)

1 Statistical Pattern Recognition - Bayes decision theory, Parametric 9

methods: Maximum likelihood estimation, Bayesian estimation (Text 1,
Chapters 1, 2)

Non-Parametric Methods - k-Nearest neighbors, Parzen windows (Text 2,

Chapter 4)

Feature Extraction and Selection

Feature Extraction - Importance of feature extraction, Techniques for

2 feature extraction: PCA, LDA, Feature extraction in image and signal 9
processing (Text 1, Chapter 3)

Feature Selection - Importance of feature selection, Techniques for feature

 selection: filter methods, wrapper methods, Feature selection criteria (Text 2,
Chapter 6)

Supervised and Unsupervised Learning

Supervised Learning - Basics of supervised learning, Linear classifiers:

perceptron, logistic regression, Support vector machines (SVM) (Text 1,
3 Chapter 4) 9

Unsupervised Learning - Basics of unsupervised learning, Clustering

techniques: k-means, hierarchical clustering, Gaussian Mixture Models
(GMM) (Text 1, Chapter 9)

Advanced Topics and Applications

Hidden Markov Models (HMMs) - Basics of HMMs, HMM for sequence

modeling, Applications of HMMs in speech and language processing (Text
1, Chapter 13)

4 Ensemble Methods - Basics of ensemble methods, Bagging, boosting, and 9

random forests, Applications and case studies (Text 1, Chapter 14)

Applications and Case Studies - Real-world applications of pattern

recognition, Case studies in image and speech recognition, Future trends in
pattern recognition (Text 2, Chapter 10)

Course Assessment Method

(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

Internal Internal
Assignment/
Attendance Examination-1 Examination- 2 Total
Micro project
(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 Explain fundamental Concepts of Pattern K2

CO1
Recognition:
CO2 Apply Classification and Clustering Techniques: K3
Implement Feature Extraction and Dimensionality Reduction K3
CO3
Techniques
CO4 Apply Statistical and Non-Parametric Methods for Pattern Recognition K3

Develop Solutions for Real-World Pattern Recognition Problems and K3

CO5
Analyze Case Studies:
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 3

CO2 3 3 3 3 3

CO3 3 3 3 3 3

CO4 3 3 3 3 3

CO5 3 3 3 3 3 3
 Text Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Pattern Recognition and
1 Christopher M. Bishop SPRINGER 1/e, 2009
Machine Learning

Richard Duda, Peter

2 Wiley 2/e, 2007
Pattern Classification Hart, David Stork

Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Springer-Verlag New
1 The Nature of Statistical Vladimir Vapnik 2/e, 2010
Learning Theory York Inc.

The Elements of Statistical Jerome Friedman, Robert Springer-Verlag New

2 9/e, 2017
Learning Tibshirani, Trevor Hastie York Inc

S.Theodoridis and
3 Pattern Recognition Academic Press 4/e, 2009
K.Koutroumbas

Video Links (NPTEL, SWAYAM…)

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

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

3 https://archive.nptel.ac.in/courses/117/105/117105101/

4 https://archive.nptel.ac.in/courses/117/105/117105101/
 SEMESTER S4

FUNCTIONAL PROGRAMMING
(Common to CS/CD/CM/CR/CA/AD/AM/CB/CN/CU/CG)

Course Code PECST413 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) GYEST204 Course Type Theory

Course Objectives:

1. To enable the learner write programs in a functional style and reason formally about
functional programs;
2. To give the concepts of polymorphism and higher-order functions in Haskell to solve the

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Introducing Functional Programming; Getting Started with Haskell and
GHCi; Basic Types and Definitions; Designing and Writing Programs; Data
1 Types, Tuples and Lists. 9
[Text Ch. 1, 2, 3, 4, 5]

Programming with Lists; Defining Functions over Lists; Playing the Game:
I/O in Haskell; Reasoning about Programs;
2 9
[Text Ch. 6, 7, 8, 9]

Generalization: Patterns of Computation; Higher-order Functions;

Developing Higher-order Programs; Overloading, Type Classes and Type
3 Checking. 9
[Text Ch. 10 11, 12, 13]

Algebraic Types; Case Study - Huffman Codes; Abstract Data Types; Lazy
Programming; Time and Space Behaviour.
4 9
[Text Ch. 15, 16, 17, 20]
 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)
Write computer programs in a functional style.
CO1 K2
Reason formally about functional programs and develop programs
CO2 K3
using lists.
Use patterns of computation and higher-order functions.
CO3 K3

CO4 Reason informally about the time and space complexity of programs. 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 3 3

CO2 3 3 3 3 3

CO3 3 3 3 3 3

CO4 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
HASKELL : The Craft of
1 Functional Programming Simon Thompson Addison Wesley 3/e, 2023

Reference Books
Name of the Name of the Edition
Sl. No Title of the Book
Author/s Publisher and Year
Cambridge
1 Thinking Functionally with Haskell Richard Bird 1/e, 2015
University Press
Cambridge
2 Programming in Haskell Graham Hutton 2/e, 2023
University Press
Bryan O'Sullivan,
3 Real World Haskell John Goerzen, Donald O’Reilly 1/e, 2008
Bruce Stewart

Video Links (NPTEL, SWAYAM…)

No. Link ID
1 https://archive.nptel.ac.in/courses/106/106/106106137/
 SEMESTER S4

CODING THEORY
(Common to CS/CM/AM/CI)

Course Code PECST414 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 students to some of the classical methods in coding theory

2. To give the concept of code construction through the mathematical foundations and examples.
SYLLABUS

Module Contact
Syllabus Description
No. Hours
Binary block codes, Minimum distance, Error-detecting capability and error-
correcting capability.

Introduction to linear block codes, generator matrix and parity check matrix.
1 9
Properties of linear block codes: Syndrome, error detection. Distance
properties of linear block codes. Single parity check codes, Hamming codes,
Reed Muller codes.

Cyclic Codes : Generator and Parity-Check Matrices of Cyclic Codes.

Encoding of Cyclic Codes, Syndrome Computation and Error Detection,
2 9
Decoding of Cyclic Codes, Cyclic Hamming Codes, Shortened Cyclic Codes

Convolutional codes: Encoding, state diagram, trellis diagram,

Classification, realization, distance properties. Viterbi algorithm, BCJR
3 9
algorithm. Performance bounds for convolutional codes

Turbo codes: Turbo decoding, Distance properties of turbo codes,

Convergence of turbo codes.
4 9
Automatic repeat request schemes. Applications of linear codes
 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)
Construct the encoder and decoder of linear block codes
CO1 K3
Understand the concept of error correction coding
CO2 K2
Understand the implementation of cyclic codes
CO3 K2

CO4 Apply Viterbi algorithm for decoding convolutional codes K3

Experiment with turbo codes using iterative map and BCJR algorithm
CO5 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 3 2

CO2 3 3 3 2 2

CO3 3 3 3 2 2

CO4 3 3 3 2

CO5 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
Shu Lin and Daniel J.
1 Error Control Coding Costello, Jr. PHI 2/e, 2004

2 Error Correction Coding Todd K. Moon Wiley-Interscience 1/e, 2006

Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
F. J. MacWilliams, N. J. North-Holland,
The Theory of Error-Correcting
1 A. Sloane Amsterdam 1/e, 1977
Codes
Algebraic Codes for Data R. E. Blahut Cambridge University 1/e, 2003
2
Transmission Press
Cary W. Huffman, Vera
Fundamentals of Error- Cambridge University 1/e, 2003
3 Pless
Correcting Codes Press

Video Links (NPTEL, SWAYAM…)

Mod. No. Link ID
1 https://archive.nptel.ac.in/courses/108/104/108104092/
2 https://nptel.ac.in/courses/108102117

3 https://archive.nptel.ac.in/courses/108/104/108104092/

4 https://archive.nptel.ac.in/courses/108/104/108104092/
 SEMESTER S4

SIGNALS AND SYSTEMS

(Common to CS/CD/CM/CA/AM/CB/CN/CU/CI)

Course Code PECST416 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 teach the concept of a Discrete Time (DT) signal
2. To enable the learner to analyze the spectral information of any DT signal and its
transformed version.
3. To provide the learner the concepts of a DT system, how it behaves to an arbitrary input,
and also to analyze the behaviour of a given DT system based on z-transform

SYLLABUS

Module Contact
Syllabus Description Hours
No.
1D Signals - A general introduction to real time signals - CT and DT signals,
Sinusoids, Spectrum representation, Sampling and Aliasing (Concept only),
Analog frequency and Digital frequency.
Elementary sequences- Real Sinusoidal Sequences, Complex Exponential
Sequences. - Unit impulse, step and ramp sequences, Representation of
discrete time signals- (Graphical representation, Functional representation,
Sequence representation)
Properties of DT Signals - Even and Odd, Periodic and non periodic signal,

1 Energy and Power signals. Periodicity and Symmetry property of DT signals, 8

support of sequences, Bounded Sequences.
Operations on Signals - Time shifting (Translation), Time Reversal
(Reflection), Time scaling - Upsampling and downsampling
DTFS - Determining the Fourier-Series Representation of a Sequence,
Properties of Discrete-Time Fourier Series - Linearity, Translation (Time
Shifting) , Modulation (Frequency Shifting), Reflection (Time Reversal),
Conjugation, Duality, Multiplication, Parseval’s Relation, Even/Odd
symmetry, Real sequence.
 (Practice of Visualization of a discrete time signal and operations on the DT
signal using python. Demonstration of sampling and reconstruction using
Python/Matlab.)
Discrete-Time Fourier Transform for Aperiodic Sequences - Properties of the
Discrete-Time Fourier Transform (Periodicity, Linearity, Translation (Time
Shifting), Modulation (Frequency-Domain Shifting), Conjugation, Time
Reversal, Convolution, Multiplication, Frequency-Domain Differentiation,

2 Differencing, Parseval's theorem, Even/Odd symmetry, real sequences) 10

DTFT of periodic sequences - Frequency Spectra of Sequences, Bandwidth of

Sequences, Energy density spectra, Characterizing LTI Systems Using the
Fourier Transform.

Discrete time systems - Block diagram representation and mathematical

representation of discrete-time systems-Some common elements of Discrete-
time systems (adder, constant multiplier, signal multiplier, unit delay, unit
advance), Recursive DT systems and non recursive discrete time systems,
Relaxed system, Linearity and time invariance property of a DT system.
3 9
Discrete time LTI systems - Discrete time convolution, Properties of
Convolution, Characterizing LTI Systems and Convolution - Impulse
response of an LTI system, Difference equation, Properties of an LTI system -
Causality, Memory, Invertibility, BIBO Stability, Eigen Sequences/ eigen
functions for discrete-Time LTI Systems.
Z transform - motivation for z transform, Relationship Between z Transform
and Discrete-Time Fourier Transform, Region of Convergence for the z
Transform.
Properties of z transform - Translation (Time Shifting), Complex Modulation
(z-Domain Scaling), Conjugation, Time Reversal, Upsampling (Time
Expansion, Downsampling, Convolution, z-Domain Differentiation,

4 Differencing, Initial and Final Value Theorems 9

Determination of the Inverse z Transform
LTI systems and difference equations, Characterizing LTI systems using z
transform, Transfer function of an LTI system. Solving Difference Equations
Using the Unilateral z Transform
Block Diagram Representation of Discrete-Time LTI Systems,
Interconnection of LTI 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)
Demonstrate the concept and different types of DT signals and the effect of
CO1 K2
different operations on the signals.
CO2 Explain how DTFS can be used to represent a periodic DT signal. K2
Apply the concept of DTFT for an aperiodic signal to determine the
CO3 K3
frequency spectrum.
Utilize the properties of a DT system based on its impulse response and z
CO4 K3
transform.
CO5 Identify the response of a DT LTI system to an arbitrary input sequence. 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 3 3
CO2 3 3 3 3 3
CO3 3 3 2 2 3
CO4 3 3 3 3 3
CO5 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
University of Victoria,
1 Signals and Systems Michael D. Adams British Columbia, 3/e 2020
Canada
2 Barry Van Veen, Simon
Signals and systems Wiley 2/e, 2007
Haykins
3 Signals and systems A Nagoor Khani McGraw Hill 2/e, 2022

Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Fundamentals of Signals and Edward W. Kamen,
1 Systems Using the Web and Bonnie S Heck Pearson 3/e, 2014
MATLAB

Video Links (NPTEL, SWAYAM…)

No. Link ID
1 https://archive.nptel.ac.in/courses/108/104/108104100/
2 https://archive.nptel.ac.in/courses/108/106/108106163/
 SEMESTER S4

SOFT COMPUTING
(Common to CS/CD/CM/CR/CA/AD/AI/AM/CB/CN/CI)

Course Code PECST417 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 give exposure on soft computing, various types of soft computing techniques, and
applications of soft computing
2. To impart solid foundations on Neural Networks, its architecture, functions and various
algorithms involved, Fuzzy Logic, various fuzzy systems and their functions, and Genetic
algorithms, its applications and advances.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Introduction to Soft Computing. Difference between Hard Computing & Soft
Computing. Applications of Soft Computing. Artificial Neurons Vs
Biological Neurons. Basic models of artificial neural networks –
1 Connections, Learning, Activation Functions. McCulloch and Pitts Neuron. 10
Hebb network, Perceptron Networks– Learning rule, Training and testing
algorithm. Adaptive Linear Neuron– Architecture, Training and testing
algorithm.
Fuzzy logic, Fuzzy sets – Properties, Fuzzy membership functions, Features
of Fuzzy membership functions. operations on fuzzy set. Linguistic
2 variables, Linguistic hedges Fuzzy Relations, Fuzy If-Then Rules, 9
Fuzzification, Defuzzification– Lamda cuts, Defuzzification methods. Fuzzy
Inference mechanism - Mamdani and Sugeno types.
Evolutionary Computing, Terminologies of Evolutionary Computing,
3 8
Concepts of genetic algorithm. Operators in genetic algorithm - coding,
 selection, cross over, mutation. Stopping condition for genetic algorithm.

Multi-objective optimization problem. Principles of Multi- objective

optimization, Dominance and pareto-optimality. Optimality conditions.
4 9
Collective Systems, Biological Self-Organization, Particle Swarm
Optimization, Ant Colony Optimization, Swarm Robotics.

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)
Describe the techniques used in soft computing and outline the
CO1 K2
fundamental models of artificial neural networks
CO2 Solve practical problems using neural networks K3
CO3 Illustrate the operations, model, and applications of fuzzy logic. K3
Illustrate the concepts of evolutionary algorithms such as Genetic
CO4 K3
Algorithm
Describe the concepts of multi-objective optimization models and
CO5 K2
collective 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 3 3 3 3
CO2 3 3 2 2 3
CO3 3 3 3 2 3
CO4 3 3 2 2 3
CO5 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
S.N.Sivanandam, John Wiley &
1 Principles of Soft Computing 3/e, 2018
S.N. Deepa Sons.
Multi-objective Optimization using John Wiley &
2 Kalyanmoy Deb, 1/e, 2009
Evolutionary Algorithms Sons
Computational intelligence: synergies of
Siddique N, Adeli John Wiley &
3 fuzzy logic, neural networks and 1/e, 2013
H. Sons
evolutionary computing.

Bio-inspired artificial intelligence: theories, Floreano D, MIT press; 2008

4 methods, and technologies. Mattiussi C. Aug 22. 1/e, 2023
 Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Fuzzy Logic with Engineering
1 Timothy J Ross, John Wiley & Sons, 3/e, 2011
Applications
Neural Networks, Fuzzy Logic
T.S.Rajasekaran,
2 & Genetic Algorithms Prentice-Hall India 1/e, 2003
G.A.Vijaylakshmi Pai
Synthesis and Applications
Neural Networks- A
3 Simon Haykin Pearson Education 2/e, 1997
Comprehensive Foundation
Fuzzy Set Theory & Its Allied Publishers Ltd.
4 Zimmermann H. J, 4/e, 2001
Applications

Video Links (NPTEL, SWAYAM…)

No. Link ID
1 https://archive.nptel.ac.in/courses/106/105/106105173/
 SEMESTER S4

COMPUTATIONAL GEOMETRY
(Common to CS/CM)

Course Code PECST418 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.

GAMAT101,
Prerequisites (if any) Course Type Theory
PCCST303

Course Objectives:

1. To develop a solid understanding of the fundamental principles, techniques, and algorithms

used in computational geometry, including geometric data structures, convex hulls, Voronoi
diagrams, and Delaunay triangulations.
2. To equip students with the skills to apply computational geometry algorithms and techniques
to address real-world problems in areas such as computer graphics, robotics, and geographic
information systems (GIS).
SYLLABUS

Module Contact
Syllabus Description
No. Hours

Introduction to Computational Geometry:-

Basics of Computational Geometry - Introduction and applications of

computational geometry, Geometric objects, and their representations, Basic
geometric primitives: points, lines, segments, polygons (Text 1, Chapters 1,
1 2) 9

Convex Hulls - Definition and properties of convex hulls, Graham's scan

algorithm, Jarvis's march (gift wrapping) algorithm, Divide and conquer
algorithm for convex hulls (Text 2, Section 33.3)

Line Segment Intersection - Problem definition and applications, Plane

 sweep algorithm, Bentley-Ottmann algorithm (Text 3, Chapter 7)

Polygon Triangulation and Voronoi Diagrams:-

Polygon Triangulation - Definition and applications, Triangulation of

monotone polygons, Ear clipping method, Chazelle's algorithm (Text 1,
Chapter 3)

2 Voronoi Diagrams - Definition and properties, Incremental construction 9

algorithm, Fortune's sweep line algorithm (Text 1, Chapter 7)

Delaunay Triangulations - Definition and properties, Relationship with

Voronoi diagrams, Bowyer-Watson algorithm, Lawson's flip algorithm (Text
1, Chapter 9)

Range Searching and Point Location :-

Range Searching - Problem definition and applications, 1-dimensional range

searching, K-dimensional range trees, Fractional cascading (Text 1, Chapter
5)

3 Point Location - Problem definition and applications, Trapezoidal map and 9

randomized incremental algorithm, Kirkpatrick’s point location algorithm
(Text 1, Chapter 6)

Binary Space Partitioning - Definition and applications, BSP trees

construction and properties, Use in computer graphics and collision detection
(Text 1, Chapter 12)

Advanced Topics and Applications :-

Arrangements of Lines and Duality - Arrangements of lines and complexity,

Zone theorem, Duality transform and its applications (Text 1, Chapter 8)

Motion Planning and Geometric Optimization - Problem definition and

4 applications, Visibility graphs and shortest path problems, Art gallery
problem, Linear programming in geometry (Text 1, Chapters 10, 11)

Computational Geometry in Practice - Computational geometry libraries and

software, Applications in robotics, computer graphics, GIS (Text 3, Chapters
9, 10)
 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)

Understand Fundamental Concepts and Applications of Computational K2

CO1
Geometry
Apply Algorithms for Convex Hulls and Line Segment Intersection K3
CO2
Algorithms
CO3 Perform Polygon Triangulation and Understand Voronoi Diagrams K3

CO4 Build Delaunay Triangulations and Range Searching Techniques K3

CO5 Apply Advanced Computational Geometry Techniques and Algorithms 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 3 3 3
CO2 3 3 3 3 3
CO3 3 3 3 3 3
CO4 3 3 3 3 3
CO5 3 3 3 3 3 3
 Text Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Mark de Berg, Otfried
Computational Geometry:
1 Cheong, Marc van Kreveld, Springer India 3/e, 2011
Algorithms and Applications
and Mark Overmars

Thomas H. Cormen,

2 Charles E. Leiserson, MIT Press 4/e, 2022

Introduction to Algorithms
Ronald L. Rivest, and
Clifford Stein
Cambridge
3 Computational Geometry in C Joseph O'Rourke 2/e, 1998
University Press

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

Discrete and Computational Joseph O'Rourke , Princeton University

1 1/e,2011
Geometry Hardcover Satyan L. Devadoss Press

Computational Geometry: An Franco P. Preparata, Springer-Verlag New

2 5/e, 1993
Introduction Michael I. Shamos York Inc

Martin Grötschel, Springer-Verlag Berlin

Geometric Algorithms and
3 Laszlo Lovasz, and Heidelberg GmbH 2/e, 1993
Combinatorial Optimization
Alexander Schrijver & Co. K

Video Links (NPTEL, SWAYAM…)

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

2 https://archive.nptel.ac.in/courses/106/102/106102011/

3 https://archive.nptel.ac.in/courses/106/102/106102011/

4 https://archive.nptel.ac.in/courses/106/102/106102011/
 SEMESTER S4

CYBER ETHICS, PRIVACY AND LEGAL ISSUES

(Common to CS/CM/CA/AM)
Course Code PECST419 CIE Marks 40
Teaching Hours/Week
3:0:0:0 ESE Marks 60
(L: T:P: R)
Exam
Credits 3 2 Hrs. 30 Min.
Hours
None Course
Prerequisites (if any) Theory
Type
Course Objectives:

1. To provide a comprehensive understanding of the fundamental concepts of cyberspace and cyber

law, enabling them to analyse and address the challenges of regulating and securing the digital
world
2. To explain cybercrime, intellectual property, cyber ethics, and ethical issues in emerging
technologies, enabling them to tackle related challenges effectively.
3. To give awareness on data protection and privacy in cyberspace, and to learn legal frameworks
protecting privacy, enabling them to address and manage privacy-related challenges effectively

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Fundamentals of Cyber Law and Cyber Space:- Introduction to cyber
law, Contract aspects in cyber law, Security aspects of cyber law, Intellectual
property aspects in cyber law and Evidence aspects in cyber law, Criminal
aspects in cyber law, Need for Indian cyber law
1 9
Cyberspace- Web space, Web hosting and web development agreement,
Legal and Technological Significance of domain Names, Internet as a tool
for global access.

Cyber crime and Cyber Ethics:- Cyber crime and Cyber Ethics:-
Introduction to cybercrime- Definition and Origins of Cyber crime-
Classifications of Cybercrime, Cyber Offences- Strategic Attacks, Types of
Attacks, Security Challenges Faced by Mobile Devices. Organizational
2 9
Measures for Handling Mobile Phones.

Cyber Ethics: The Importance of Cyber Law, Significance of Cyber Ethics,

Need for Cyber regulations Based on Cyber Ethics, Ethics in Information
 society, Artificial Intelligence Ethics- Ethical Issues in AI and core
Principles, Block chain Ethics- Definition and Description.

Data Protection and Privacy Concerns in Cyberspace :Need to protect

data in cyberspace, Types of data , Legal framework of data protection, Data
protection bill -an overview, GDPR, Concept of privacy, Privacy concerns of
3 cyberspace, Constitutional framework of privacy, Judicial interpretation of 9
privacy in India, Privacy Law and Regulation, Organizational Response,
Privacy and Data Surveillance

Security Policies and Information Technology Act

Need for an Information Security policy, Information Security Standards-

ISO, Introducing various security policies and their review process,
4 9
Information Technology Act, 2000, Penalties, Adjudication and appeals
under the IT Act,2000, Offences under IT Act, 2000, Right to Information
Act, 2005, IT Act,2008 and its amendments.

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)
Describe the concepts of cyber law and the various components and
CO1 K2
challenges associated with cyberspace.
Discuss the concept of cybercrime and computer crime, the challenges
CO2 faced by law enforcement, and the importance of intellectual property in K2
the digital age.
Explain the importance of cyber law and ethics, the need for regulations,

CO3 and the ethical considerations in emerging technologies like AI and K2

blockchain.
Identify data protection and privacy issues in cyberspace and describe
CO4 various laws and regulations to address these challenges in the digital K2
age, ensuring comprehensive privacy protection and compliance.
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
Note: 1: Slight (Low), 2: Moderate (Medium), 3: Substantial (High), -: No Correlation

Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Nilakshi Jain, Ramesh
1 Cyber Security and Cyber Laws Wiley 1/e, 2020
Menon
Cyber Security understanding Cyber
2 Sumit Belapure , Nina Wiley India
Crimes, Computer Forensics and Legal 1/e, 2011
Godbole Pvt.Ltd.
Perspectives
Cyber Ethics 4.0: Serving Humanity
3 Christoph Stückelberger,
with Values Globethics 1/e, 2018
Pavan Duggal

4 Cyber Laws: Intellectual property & E Dominant

K. Kumar 1/e,2011
Commerce, Security Publisher
Introduction to Information Security Surya Prakash Tripathi,
5 Dreamtech
and Cyber Laws Ritendra Goel, Praveen 1/e, 2014
Press
Kumar Shukla
First
6 Cyber Law: The Law of the Internet Pearson
Craig B Edition,201
and Information Technology Education
3

Video Links (NPTEL, SWAYAM…)

No. Link ID
1 https://www.wbnsou.ac.in/NSOU-MOOC/mooc_cyber_security.shtml

2 https://onlinecourses.swayam2.ac.in/cec22_lw07/preview

3 https://www.coursera.org/learn/data-security-privacy#modules

4 https://jurnal.fh.unila.ac.id/index.php/fiat/article/download/2667/1961/12044
 SEMESTER S4

VLSI DESIGN
(Common to CS/CN/CI)
Course Code PECST415 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) GAEST305 Course Type Elective

Course Objectives:

1. To impart the key concepts of MOS technology including characteristics of CMOS and its
application in digital VLSI circuits to design basic CMOS logic gates.
2. To impart the key concepts of Integrated Circuit Design and introduce various design flows.
3. To equip the learner to implement both combinational and sequential logic circuits using both
semi-custom and FPGA design flow.
SYLLABUS

Module Contact
Syllabus Description
No. Hours
CMOS Fundamentals for Digital VLSI Design :

CPN junction, MOS transistor theory and operation, PMOS, NMOS, CMOS,
CMOS Inverter, Voltage Transfer Curve, CMOS logic gates, Tristate
1 Inverter, Tristate buffer. Combinational Circuits Timing - Rise Time, Fall 9
time, Propagation Delay. Introduction to sequential logic circuits, flip-flops
and latches, Timing analysis - Set-up time, Hold Time, Propagation Delay,
Frequency of Operation, Static and Dynamic Timing Analysis, Pipelining

Introduction to Integrated Circuits (ICs):

CMOS fabrication process overview- Photolithography, Structure of an

Integrated Circuit, Types of Design flow - Custom design, Semi-custom
2 9
design, array based design. A System Perspective, Hardware – Software
Partitioning, example Video compression, Functional Specification to RTL,
Behavioural Synthesis.
 Semi-custom Design flow

Abstraction in VLSI Design Flow- Gajski-Kuhn’s Y-chart, Hardware design

using hardware description Languages, Design Verification- Simulation
3 using Testbench, Property Checking, Equivalence Checking, Static Timing 9
Analysis, Logic Synthesis, Physical Design- Min-cut Partitioning, Floor
plan- , Global and Detailed Placement, Global and Detailed Routing, Micro
project*

Finite State Machines (FSMs): Mealy and Moore models. Verilog HDL
Design and implementation of RISC stored programmed Machine.

Field Programmable Gate Arrays (FPGAs) : FPGA Architecture-

4 9
Programming Technology, Programmable logical blocks, Programmable
Interconnects, Programmable I/O blocks, FPGA Design Flow, SoC Design
on FPGA, Micro project*.

* Micro-project on FPGA / Semi-Custom Flow.

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

● Ability to capture the specification and ability for RTL coding,

● Ability to analyze the circuit for resource utilization such as area consumption and power
consumption. Analyze the circuit for timing violations. Optimize performance.
 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, answered.
each carrying 3 marks  Each question can have a maximum of 3 60
(8x3 =24marks) sub divisions.
 Each question 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)

CO1 Utilize the MOS Circuits and design basic circuits using CMOS. K3

Explain IC design flow and design a system using hardware software

CO2 K3
co-design strategy.
Design, simulate and implement systems design in HDL using semi-
CO3 K4
custom flow.
Design, simulate and implement digital systems using programmable
CO4 K4
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 3 3 3
CO2 3 3 3 3 3
CO3 3 3 3 3 3
CO4 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
Introduction to VLSI Design Cambridge
1 Flow Sneh Saurabh 1/e, 2023
University Press

Pearson
Digital Integrated Circuits: A Jan M. Rabaey, Anantha P.
2 Education 2/e, 2003
Design Perspective. Chandrakasan, Borivoje Nikolic

Digital Systems Design Charles H. Roth Jr., Lizy Kurian

2 Using Verilog John, Beyeong Kil Lee, CL Engineering 1/e, 2015

Advanced Digital Design

3 Micahel D. Ciletti Pearson 2/e, 2017
with the Verilog HDL

Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Digital Design and Computer Sarah L. Harris, David Morgan
1 1/e, 2022
Architecture - RISC-V Edition Harris Kaufmann

Digital Design: With an M. Morris Mano,

2 Pearson India 5/e, 2012
Introduction to the Verilog HDL Michael D. Ciletti

Verilog HDL – A guide to

3 Samir Palnitkar Pearson 2/e, 2003
digital design & Synthesis

4 FPGA Based System Design Wayne Wolf Pearson 1/e, 2004

1/e, 2006
5 Embedded Core Design with FPGAs Zainalabedin Navabi McGraw-Hill
 Video Links (NPTEL, SWAYAM…)

No. Link ID
Introduction to Digital VLSI Design Flow, Introduction to Digital VLSI Design Flow, IIT
1 Guwahati https://nptel.ac.in/courses/106103116

Introduction to VLSI Design by Prof. S. Srinivasan , IIT Madras,

2
https://nptel.ac.in/courses/117106092
VLSI Physical Design by Prof. Indranil Sengupta, IIT Kharagpur,
3
https://onlinecourses.nptel.ac.in/noc21_cs12/preview
Digital System Design using PLDs and FPGAs , Prof. Kuruvilla Varghese from IISc
4 Bangalore https://archive.nptel.ac.in/courses/117/108/117108040/
 SEMESTER S4

ADVANCED DATA STRUCTURES

(Common to CS/CD/CM/CA/AM/CB/CN/CC/CU/CI/CG)

Course Code PECST495 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) PCCST303 Course type Theory

Course Objectives:

1. To equip students with comprehensive knowledge of advanced data structures utilized in

cutting-edge areas of computer science, including database management, cyber security,
information retrieval, and networked systems.

2. To prepare students to address challenges in emerging fields of computer science by applying

advanced data structures to practical, real-world problems.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Foundational Data Structures- Overview of Arrays and Linked Lists,
implementation of pointers and objects, Representing rooted trees, Hashing -
Hash Tables, Hash functions, Cuckoo Hashing; Bloom Filters - Count-Min
1 Sketch, Applications to Networks - Click Stream Processing using Bloom 9
Filters, Applications to Data Science - Heavy Hitters and count-min
structures.

Advanced Tree Data Structures - Balanced Trees - AVL Trees (review),

Red-Black Trees, Suffix Trees and Arrays, Segment Trees, Heaps and

2 Related Structures – Binomial heap, Fibonacci Heaps, Merkle Trees, 9

Applications to information Retrieval and WWW - AutoComplete using
Tries.
 Specialized Data Structures - Spatial Data Structures – Quadtree, K-D
Trees (k-dimensional tree); R-trees; Temporal Data Structures- Persistence,

3 Retroactivity; Search and Optimization Trees – Skip List, Tango Trees; 9

Applications to Data Science - Approximate nearest neighbor search,
Applications to information Retrieval and WWW, Posting List intersection.

Data Structure applications - Distributed and Parallel Data Structures -

Distributed Hash Tables (DHTs); Consistent Hashing; Distributed BST; Data
4 9
Compression and Transformations - Burrows-Wheeler Transform;
Histogram; Wavelet Trees; Cryptographic Applications – Hashing.

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 Analyze): 20 marks

Implement various real world problems using multiple suitable data structures and compare the
performance.
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
module. of which 1 question should be answered.

● Total of 8 Questions, each  Each question can have a maximum of 3

60
carrying 3 marks subdivisions.
(8x3 =24 marks)  Each question 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)
Implement and use arrays, linked lists, rooted trees and hashing
CO1 K3
techniques in various programming scenarios.
Design and implement advanced tree data structures for information
CO2 K3
retrieval.
CO3 Use spatial and temporal data structures in data science problems. K3
Analyze data structures in special scenarios such as distributed, parallel
CO4 K5
and data compression areas.
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 3
CO2 3 3 3 3 3 2 3
CO3 3 3 3 3 3 2 3
CO4 3 3 3 3 3 2 2
Note: 1: Slight (Low), 2: Moderate (Medium), 3: Substantial (High), -: No Correlation
 Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Advanced Data Structures: Suman Saha, Shailendra
1 CRC Press 1/e, 2019
Theory and Applications Shukla
Cambridge
2 Advanced Data Structures Peter Brass 1/e, 2008
University Press
Thomas H Cormen, Charles E
3 Introduction to Algorithms Leiserson, Ronald L Rivest, MIT Press 4/e, 2022
Clifford Stein
Fundamentals of Computer Ellis Horowitz, SatrajSahani
4 University Press 2/e, 2009
Algorithms and Rajasekharam
Oxford University
5 Advanced Data Structures Reema Thareja, S. Rama Sree 1/e, 2018
Press
Data Structures and Algorithm 2/e, 2004.
6 Mark Allen Weiss Pearson
Analysis in C++,
Design and Analysis of M T Goodrich, Roberto
7 Wiley 1/e, 2021
Algorithms Tamassia

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
1 https://web.stanford.edu/class/cs166/
 SEMESTER S4

ECONOMICS FOR ENGINEERS

(Common to All Branches)

Course Code UCHUT346 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. 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: 50 marks, ESE: 50 marks)

Continuous Internal Evaluation Marks (CIE):

Internal Internal
Assignment/
Attendance Examination-1 Examination- 2 Total
Micro project
(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  2 questions will be given from each module, out
Maximum 2 Questions of which 1 question should be answered.
from each module.  Each question can have a maximum of 2 sub
50
 Total of 6 Questions, divisions.
each carrying 3 marks  Each question carries 8 marks.
(6x3 =18marks) (4x8 = 32 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
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
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,
1 6
Cybertrust and cybersecurity, Data collection & management, High
technologies: 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.

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

4 6
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/I Marks
No. ndividua
l (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 and G 8

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 literature G 5
including survey on that topic and make a report citing the relevant
methodologies, papers with a specific analysis of the Kerala context
findings, and
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 & Module IV G 15

4 Final A comprehensive presentation summarising the key takeaways G 5

Presentation 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
Edition and
Sl. No Title of the Book Name of the Author/s Name of the Publisher
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

Cambridge University
4 Sustainable Engineering Bhavik R. Bakshi, 2019
Principles and Practice Press & Assessmen

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

OPERATING SYSTEMS LAB

(Common to CS/CD/CM/CR/CA/AI/CB/CN/CC/CU/CI/CG)

Course Code PCCSL407 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) GYEST204 Course Type Lab

Course Objectives:

1. To familiarize various Linux commands related to Operating systems.

2. To give practical experience for learners on implementing different functions of Operating
systems such as process management, memory management, and disk management.
Expt.
Experiments
No.

Familiarisation with basic Linux programming commands: ps, strace, gdb, strings,
1
objdump, nm, file, od, xxd, time, fuser, top

Use /proc file system to gather basic information about your machine:

(a) Number of CPU cores

(b) Total memory and the fraction of free memory
(c) Number of processes currently running.
2
(d) Number of processes in the running and blocked states.
(e) Number of processes forked since the last bootup. How do you compare
this value with the one in (c) above?
(f) The number of context switches performed since the last bootup for a
particular process.
Write a simple program to print the system time and execute it. Then use the /proc file
3 system to determine how long this program (in the strict sense, the corresponding process)
ran in user and kernel modes.

4 Create a new process using a fork system call. Print the parent and child process IDs. Use
the pstree command to find the process tree for the child process starting from the init
 process.

Write a program to add two integers (received via the command line) and compile it to an
executable named “myadder”. Now write another program that creates a new process
5
using a fork system call. Make the child process add two integers by replacing its image
with the “myadder” image using execvp system call.

Create a new process using a fork system call. The child process should print the string
“PCCSL407” and the parent process should print the string “Operating Systems Lab”.
6
Use a wait system call to ensure that the output displayed is “PCCSL407 Operating
Systems Lab”

Inter-process Communication (https://www.linuxdoc.org/LDP/lpg/node7.html)

(a) Using Pipe – Evaluate the expression . The first process

evaluates . The second process evaluates and sends it to the first
process which evaluates the final expression and displays it.
(b) Using Message Queue - The first process sends a string to the second
process. The second process reverses the received string and sends it back
to the first process. The first process compares the original string and the
7
reversed string received from the second one and then prints whether the
string is a palindrome or not.
(c) Using Shared Memory - The first process sends three strings to the second
process. The second process concatenates them to a single string (with
whitespace being inserted between the two individual strings) and sends it
back to the first process. The first process prints the concatenated string in
the flipped case, that is if the concatenated string is “Hello S4 Students”,
the final output should be “hELLO s4 sTUDENTS”
Write a multithreaded program that calculates the mean, median, and standard deviation
for a list of integers. This program should receive a series of integers on the command line
and will then create three separate worker threads. The first thread will determine the
8 mean value, the second will determine the median and the third will calculate the standard
deviation of the integers. The variables representing the mean, median, and standard
deviation values will be stored globally. The worker threads will set these values, and the
parent thread will output the values once the workers have exited.

Input a list of processes, their CPU burst times (integral values), arrival times, and
9 priorities. Then simulate FCFS, SRTF, non-preemptive priority (a larger priority number
implies a higher priority), and RR (quantum = 3 units) scheduling algorithms on the
 process mix, determining which algorithm results in the minimum average waiting time
(over all processes).

Use semaphores to solve the readers-writers problem with writers being given priority
10
over readers.

Obtain a (deadlock-free) process mix and simulate the banker’s algorithm to determine a
11
safe execution sequence.

12 Obtain a process mix and determine if the system is deadlocked.

Implement the deadlock-free semaphore-based solution for the dining philosopher’s

13
problem.

Simulate the address translation in the paging scheme as follows: The program receives
three command line arguments in the order

● size of the virtual address space (in megabytes)

● page size (in kilobytes)
14 ● a virtual address (in decimal notation)
The output should be the physical address corresponding to the virtual address in <frame
number, offset> format. You may assume that the page table is implemented as an array
indexed by page numbers. (NB: If the page table has no index for the page number
determined from the virtual address, you may just declare a page table miss!)

Simulate the FIFO, LRU, and optimal page-replacement algorithms as follows: First,
generate a random page-reference string where page numbers range from 0 to 9. Apply the
random page-reference string to each algorithm, and record the number of page faults
15
incurred by each algorithm. Assume that demand paging is used. The length of the
reference string and the number of page frames (varying from 1 to 7) are to be received as
command line arguments.

Simulate the SSTF, LOOK, and CSCAN disk-scheduling algorithms as follows: Your
program will service a disk with 5,000 cylinders numbered 0 to 4,999. The program will
generate a random series of 10 cylinder requests and service them according to each of the
16
algorithms listed earlier. The program will be passed the initial position of the disk head
(as a parameter on the command line) and will report the total number of head movements
required by each algorithm.
 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/ Result with valid

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

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 Illustrate the use of various systems calls in Operating Systems. K3

Implement process creation and inter-process communication in Operating

CO2 K3
Systems

CO3 Compare the performance of various CPU scheduling algorithms K4

CO4 Compare the performance of various disk scheduling algorithms K4

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 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

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

Andrea Arpaci-
1 Operating Systems: Three Easy
Dusseau, Remzi CreateSpace 1/e, 2018
Pieces
Arpaci-Dusseau

2 Linux Kernel Development Robert Love Pearson 3/e, 2018

Unix Network Programming -

3 Volume 2: Interprocess Richard Stevens Prentice Hall 2/e, 1999
Communications

Reference Books/Websites

Name of the Edition

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

1 The Design of the UNIX

Maurice J. Bach Prentice Hall of India 1/e, 1994
Operating System

2 The Little Book of Semaphores Allen B. Downey Green Tea Press 1/e, 2016
 Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.

1 https://archive.nptel.ac.in/courses/106/105/106105214/

2 https://www.youtube.com/playlist?list=PLDW872573QAb4bj0URobvQTD41IV6gRkx

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

DBMS LAB
(Common to CS/CD/CR/CA/AD/AI/CB/CN/CC/CU/CI/CG)

Course Code PCCSL408 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) None Course Type Lab

Course Objectives:

1. To equip students with comprehensive skills in SQL, PL/SQL, and NoSQL databases.

2. To enable the learner to proficiently design, implement, and manage relational and non-
relational databases to meet diverse data management needs

Expt.
Experiments
No.
1 Design a database schema for an application with ER diagram from a problem description.
Creation of database schema - DDL (create tables, set constraints, enforce relationships,
2 create indices, delete and modify tables). Export ER diagram from the database and verify
relationships (with the ER diagram designed in step 1).
3 Database initialization - Data insert, Data import to a database (bulk import using UI and
SQL Commands).
4 Practice SQL commands for DML (insertion, updating, altering, deletion of data, and
viewing/querying records based on condition in databases).
5 Implementation of various aggregate functions, Order By, Group By & Having clause in
SQL.
6 Implementation of set operators nested queries, and join queries.

7 Practice of SQL TCL DCL commands like Rollback, Commit, Savepoint,Practice of SQL
DCL commands for granting and revoking user privileges.
8 Practice of SQL commands for creation of views and assertions.
9 Creation of Procedures, Triggers and Functions.
10 Creation of Packages and cursors.

11 Design a database application using any front-end tool for any problem selected in
experiment number 1. The application constructed should have five or more tables**.
12 Perform basic CRUD (Create, Read, Update, Delete) operations on a Cassandra table.
13 Write and execute CQL queries to retrieve specific data from Cassandra tables
14 Create a simple application using Mongodb with python
** The problem must be designed to convey the difference of NoSQL from SQL databases.
 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)
Develop database schema for a given real world problem-domain using
CO1 K3
standard design and modeling approaches
Construct queries using SQL for database creation, interaction, modification,
CO2 K3
and updation.
Plan and implement triggers and cursors, procedures, functions, and control
CO3 K3
structures using PL/SQL
CO4 Perform CRUD operations in NoSQL Databases K3

CO5 Design database applications using front-end tools and back-end DBMS K5
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 1 3 3
CO2 3 3 3 1 3 3

CO3 3 3 3 1 3 3

CO4 3 3 3 2 3 3 3
CO5 3 3 3 2 3 3 3 3
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
1 Fundamentals of Database Systems Elmasri, Navathe Pearson 7/e, 2017
2 Professional NoSQL Shashank Tiwari Wiley 1/e, 2011

Reference Books
Sl. Name of the Edition
Title of the Book Name of the Author/s
No Publisher and Year
1 Database System Concepts, Sliberschatz Korth and S.
McGraw Hill, 7/e, 2017
Sudarshan
2 John Wiley &
NoSQL for Dummies Adam Fowler 1/e, 2015
Sons
NoSQL Data Models: Trends and
3 Challenges (Computer Engineering: Olivier Pivert Wiley 1/e, 2018
Databases and Big Data),
Making the Sense of NoSQL : A Dan McCreary and Ann
4 Manning 1/e, 2014
guide for Managers and Rest of us. Kelly

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
https://onlinecourses.nptel.ac.in/noc21_cs04/preview
1
https://onlinecourses.nptel.ac.in/noc21_cs04/preview
2
https://onlinecourses.nptel.ac.in/noc21_cs04/preview
3
https://archive.nptel.ac.in/courses/106/104/106104135/
4
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

COMPUTER SCIENCE AND ENGINEERING

 SEMESTER S5

COMPUTER NETWORKS
(Common to CS/CD/CM/CR/CA/AD/AI/CB/CN/CU/CI)

Course Code PCCST501 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 introduce the core concepts of computer networking.

2. To develop a big picture of the internetworking implementation on Linux-based systems.
3. To impart an overview of network management concepts.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Overview of the Internet, Protocol layering (Book 1 Ch 1)
Application Layer: Application-Layer Paradigms, Client-server applications -
1 6
World Wide Web and HTTP, FTP. Electronic Mail, DNS. Peer-to-peer
paradigm - P2P Networks, Case study: BitTorrent (Book 1 Ch 2)
Transport Layer: Services, Protocols, UDP, TCP (Book 1 Ch 3).
Hands-on: Sockets Introduction, Elementary TCP Sockets, TCP
Client/Server Example, I/O Multiplexing: The select and poll Functions
(Book 2 Ch 3 to 6), Elementary UDP Sockets (Book 2 Ch 8), Advanced I/O
Functions (Book 2 Ch 14)

2 Network Layer: Introduction, Network-layer protocols, Unicast routing, 18

Multicast routing - Multicasting Basics, Intra domain and inter-domain

routing, Next generation IP (Book 1 Ch 4), Quality of Service (Book 1 Ch 8)
Hands-on: Linux Kernel Implementation of Routing Table and Caches,
Routing Cache Implementation Overview, Adding new entry in the Routing
Table using ip command (Book 3 Ch 14)
 Data-Link Layer: Data link control (DLC), Multiple access protocols (MAC),
Link-layer addressing, Ethernet protocol, Connecting devices (Book 1 Ch 5)
3 Wireless LANs, Mobile IP (Book 1 Ch 6) 11
Hands-on: Datalink Provider Interface, SOCK_PACKET and PF_PACKET
(Book 2 Ch 29)
SNMP, ASN.1 (Book 1 Ch 9)
4 Physical Layer: Data and signals, Digital transmission, Analog transmission, 9
Bandwidth utilization, Transmission media (Book 1 Ch 7)

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)
Understand the internetworking design in terms of protocol stack and
CO1 K2
the role of various application layer protocols
Illustrate the functions of the transport layer from connectionless and
CO2 K3
connection-oriented perspectives
Identify how the network layer achieves host-to-host connectivity and
CO3 K3
caters to the diverse service requirements of the host applications
Explain the nuances of the data link layer design and demonstrate the
CO4 various data link link layer protocols K3

Describe the fundamental characteristics of the physical layer and

CO5 understand how the physical layer supports the functionalities of the K2
top layers

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 2 3
CO4 3 2 3
CO5 3 3
Note: 1: Slight (Low), 2: Moderate (Medium), 3: Substantial (High), -: No Correlation
 Text Books
Name of the
Sl. No Title of the Book Name of the Author/s Edition and Year
Publisher
Computer Networks: A Top- Behrouz A Forouzan McGraw Hill
1 SIE, 2017
Down Approach
Unix Network Programming, W. Richard Stevens,
Pearson
2 Volume 1: The Sockets Andrew M. Rudoff, Bill 3/e, 2004
Education
Networking API Fenner
Sameer Seth
TCP/IP Architecture, design,
3 and implementation in Linux M. Ajaykumar Wiley 1/e, 2008

Venkatesulu

Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Computer Networking: A Top-
J. F. Kurose and K. W.
1 Down Approach Featuring Pearson Education 8/e, 2022
Ross
Internet
Computer Networks, A L. L. Peterson and B. S.
2 Morgan Kaufmann 5/e, 2011
Systems Approach Davie

Video Links (NPTEL, SWAYAM…)

No. Link ID
1 https://nptel.ac.in/courses/106/105/106105183/
 SEMESTER S5

DESIGN AND ANALYSIS OF ALGORITHMS

(Common to CS/CD/CM/AM/CB/CN/CU/CG)

Course Code PCCST502 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) PCCST303 Course Type Theory

Course Objectives:

● To gain a foundational understanding of algorithms and their analysis.

● To develop problem-solving skills using various algorithm design paradigms like

divide and conquer, dynamic programming, etc.

● To understand the concepts of tractable and intractable problems, and different

complexity classes (P, NP, NP-hard, NP-complete).

SYLLABUS

Module Syllabus Description Contact

No. Hours
Algorithms – Characteristics, Criteria for Analysing Algorithms; Time and
Space Complexity - Best, Worst, and Average Case Complexities;
Asymptotic Notations and their properties; Time and Space Complexity
Calculation of simple algorithms; Analysis of Recursive Algorithms -
1
Recurrence Equations, Solution of Recurrence Equations : Iteration 11
Method, Recursion Tree Method, Substitution method and Master’s
Theorem (proof not expected); Balanced Search Trees - AVL Trees
(Insertion and deletion operations with all rotations in detail, algorithms
not expected)
 Disjoint Sets - Disjoint set operations, Union and find algorithms, Analysis
of union by rank with path compression, Connected components of a
Graph; Graphs – Representations, Traversals : BFS, DFS and their analysis,
11
Strongly Connected Components; Topological Sorting. Divide and Conquer
2
Strategy – Control Abstraction, Merge Sort, Strassen’s Matrix
Multiplication, Analysis.
Greedy Strategy - Control Abstraction, Fractional Knapsack; Minimum
Cost Spanning Tree – Kruskal’s and Prim’s, Analysis; Shortest Path
Problem – Dijkstra’s Algorithm, Analysis; Dynamic Programming -
Control Abstraction, Optimality Principle, Matrix Chain Multiplication, 11
3
Analysis; All Pairs Shortest Path Algorithm - Floyd-Warshall Algorithm,
Analysis; Backtracking - Control Abstraction, N – Queens Problem,
Algorithm.
Branch and Bound - Control Abstraction, Travelling Salesman Problem,
Algorithm; Complexity - Tractable and Intractable Problems; Complexity
Classes : P, NP, NP- Hard and NP-Complete Classes; NP Completeness
11
proof - Clique Problem and Vertex Cover Problem; Approximation
4
algorithms - Bin Packing; Randomized Algorithms - Definitions of Monte
Carlo and Las Vegas algorithms; Randomized version of Quick Sort
algorithm with 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
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)
Analyze any given algorithm and express its time and space
CO1 K4
complexities in asymptotic notations.

Solve the recurrence equations using Iteration, Recurrence Tree,

CO2 Substitution and Master’s Method to compute time complexity of K3

algorithms.

Illustrate the operations of advanced data structures like AVL trees and
CO3 K3
Disjoint sets.

Illustrate the representation, traversal and different operations on

CO4 K3
Graphs.

Demonstrate Divide-and-conquer, Greedy Strategy, Dynamic

CO5 programming, Branch-and Bound and Backtracking algorithm design K2

techniques.

Classify a problem as computationally tractable or intractable, and

CO6 K4
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 3 3 3 2 3
CO2 3 3 3 2
CO3 3 3 3 3
CO4 3 3 3 3
CO5 3 3 3 2 2
CO6 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
T.H.Cormen,
1 Introduction to Algorithms C.E.Leiserson, R.L.Rivest, Prentice-Hall India 4/e, 2018
C. Stein,
Ellis Horowitz, Sartaj
Fundamentals of Computer Orient Longman
2 Sahni, Sanguthevar 2/e, 2008
Algorithms Universities Press
Rajasekaran,
Computer Algorithms,
Sara Baase and Allen Van
3 Introduction to Design and Pearson Education 3/e, 2009
Gelder
Analysis

Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Design and Analysis of Michael T. Goodrich
1 Algorithms Roberto Tamassia Wiley 1/e, 2021

Jon Kleinberg, Eva

2 Algorithm Design Pearson Education 1/e, 2005
Tardos
Algorithms Robert Sedgewick, Kevin
3 Pearson Education 4/e, 2011
Wayne
GIlles Brassard, Paul
4 Fundamentals of Algorithmics Pearson Education 1/e, 1996
Brately

5 The Algorithm Design Manual Steven S. Skiena Springer 2/e, 2008

 Video Links (NPTEL, SWAYAM…)
Module
Link ID
No.
1 https://archive.nptel.ac.in/courses/106/106/106106131/
2 https://www.coursera.org/learn/dynamic-programming-greedy-algorithms
https://online.stanford.edu/courses/soe-ycsalgorithms1-algorithms-design-and-analysis-
3
part-1
4 https://online.stanford.edu/courses/soe-ycs0001-algorithms-design-and-analysis-part-2
 SEMESTER S5

MACHINE LEARNING
(Common to CS/AD/CR/CA/CC/CD)

Course Code PCCST503 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 impart the fundamentals principles of machine learning in computer and science.

2. To provide an understanding of the concepts and algorithms of supervised and
unsupervised learning.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Introduction to ML :-
Machine Learning vs. Traditional Programming, Machine learning
paradigms - supervised, semi-supervised, unsupervised, reinforcement
learning.
Parameter Estimation - Maximum likelihood estimation (MLE) and
maximum aposteriori estimation (MAP), Bayesian formulation.
1 9
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 - Logistic regression, Naïve Bayes, KNN, Decision Trees –
2 9
ID3
 Generalisation and Overfitting - Idea of overfitting, LASSO and RIDGE
regularization, Idea of Training, Testing, Validation
Evaluation measures – Classification - Precision, Recall, Accuracy, F-
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.
SVM – Linear SVM, Idea of Hyperplane, Maximum Margin Hyperplane,
Non-linear SVM, Kernels for learning non-linear functions
3 Neural Networks (NN) - Perceptron, Neural Network - Multilayer feed- 9
forward network, Activation functions (Sigmoid, ReLU, Tanh), Back
propagation algorithm.
Unsupervised Learning
Clustering - Similarity measures, Hierarchical Clustering - Agglomerative
Clustering, partitional clustering, K-means clustering

4 9
Dimensionality reduction - Principal Component Analysis, Multidimensional
scaling
Ensemble methods - bagging, boosting; Resampling methods -
Bootstrapping, Cross Validation. Practical aspects - Bias-Variance tradeoff.

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)
Illustrate Machine Learning concepts and basic parameter estimation
CO1 K2
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
CO4 K3
techniques
Use appropriate performance measures to evaluate machine learning
CO5 K3
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
CO2 3 3 3 3
CO3 3 3 3 3
CO4 3 3 3 3
CO5 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
1 Introduction to Machine Learning Ethem Alpaydin MIT Press 4/e, 2020
Data Mining and Analysis:
Mohammed J. Zaki | Cambridge University
2 Fundamental Concepts and 1/e, 2016
Wagner Meira Press
Algorithms
Neural Networks for Pattern Oxford University
3 Christopher Bishop 1/e, 1998
Recognition Press

Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
1 Applied Machine Learning M Gopal McGraw Hill 2/e, 2018
Machine Learning Manaranjan Pradhan | U
2 Wiley 1/e, 2019
using Python Dinesh Kumar
Machine Learning: Theory and M.N. Murty, V.S.
3 Universities Press 1/e, 2024
Practice Ananthanarayana

Video Links (NPTEL, SWAYAM…)

No. Link ID
1 https://archive.nptel.ac.in/courses/106/105/106105152/
2 https://archive.nptel.ac.in/courses/106/106/106106139/
3 https://nptel.ac.in/courses/106106202\
 SEMESTER S5

MICROCONTROLLERS
(Common to CS/CC)

Course Code PBCST504 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 introduce the ARM architecture and ARM-based microcontroller architecture.
2. To impart knowledge on the hardware and software components to develop embedded systems
using STM32 microcontrollers.
SYLLABUS

Module Contact
Syllabus Description
No. Hours

Introduction to ARM Cortex-M Architecture:-

Overview of Embedded Systems, Applications of Embedded Systems,

Introduction to Embedded C, Microcontrollers vs. Microprocessors,
1 Classification of processors, Overview of ARM Cortex-M Series, Introduction 9

to the Cortex-M23 and Cortex-M33 processors and the Armv8-mArchitecture,

ARM Core Features: Registers, Memory, and Bus Architecture, Comparison
with previous generations of Cortex-M processors.

STM32 Microcontroller Overview and Peripheral Programming:-

Introduction to STM32 Family, STM32U575 Features and Specifications,

Power Management and Low-Power Features Libraries, Introduction to
2 Integrated Development Environment and HAL, Writing, and Debugging Your 11
First Program(LED Interfacing), Interfacing Seven-Segment Display, LCD
Display, and Matrix Keypad, Relay Interfacing, Analog to Digital Conversion:
Potentiometer, temperature sensor, LDR, Microphone, Digital to Analog
Conversion: Simple DAC Output Generation, Generating a Sine Wave, Audio
 Signal Generation, Interrupt Handling, Timer and Counter Applications: Basic
Timer Configuration, Timers as Counters, Timer-Based Real-Time Clock
(RTC)

Communication Protocols and USB:-

Serial port terminal Application, Serial communication (USART, I2C, SPI,

CAN), Interfacing an I2C Temperature Sensor and Displaying Data on an LCD,
3 writing to and Reading from an SPI-based EEPROM, Configuring and 10

Implementing CAN Communication between Multiple STM32U575

Microcontrollers, Creating a USB HID Device for Keyboard / Mouse
Emulation

IoT, Wireless Communication, and RTOS:-

Introduction to IoT, IoT Architecture, Protocols (MQTT, CoAP), IoT Security

Principles and Common Threats Wireless Communication: Interfacing GSM
(Call, SMS, Internet), Bluetooth Communication Basics, LoRa Communication
Basics and Applications, Designing an IoT-Based Home Automation System,
Introduction to RTOS Concepts, FreeRTOS with STM32: Task Creation,
4 Scheduling, and Management, RTOS Timers, Delays, and RTC Integration, 14
Inter-task Communication: Queues and Semaphores

Trust Zone Technology: Introduction to ARM Trust Zone, Trust Zone

Architecture and Features, Secure and Non-Secure Worlds: Configuration and
Management, Implementing Trust Zone in STM32U575, Advanced Debugging
and Optimization: Code and Memory Optimization Techniques, Debugging
Strategies and Tools

Suggestion on Project Topics

● Identify real world problems requiring hardware solutions and develop them using
peripheral devices. Some of the examples would be - Home automation, Small
home/office security system, ARM based voice response system etc.
 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 subdivisions. 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)

Explain the architectural features and instructions of the ARM K2

CO1
microcontrollers.
Develop applications involving interfacing of external devices and I/O K3
CO2 with ARM microcontroller.

Use various communication protocols of interaction with peer devices K3

CO3 and peripherals.

Demonstrate the use of a real time operating system in embedded K3

CO4 system applications.

CO5 Apply hardware security features of ARM in real world applications. 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 3 3 3
CO2 3 3 3 3
CO3 3 3 3 3 3 3
CO4 3 3 3 3 3 3
CO5 3 3 3 3 3

Text Books
Name of the Name of the Edition
Sl. No Title of the Book
Author/s Publisher and Year
The Definitive Guide to ARM Cortex-
1 Joseph Yiu Newnes - Elsevier 3/e, 2014
M3 and Cortex-M4 Processors

2 Mastering STM32 Carmine Noviello Learnpub 2/e, 2022

Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
ARM System Developer’s Andrew N. Sloss, Dominic
1 Morgan Kaufman 1/e, 2008
Guide Symes, Chris Wright

Embedded System Design Cem Ünsalan, Hüseyin Deniz

2 with Arm Cortex-M Gürhan Springer 1/e, 2022

Microcontrollers Mehmet Erkin Yücel

Introduction to ARM ®
3 Jonathan W. Valvano Self-Published 5/e, 2014
Cortex-M Microcontrollers
 Video Links (NPTEL, SWAYAM…)

Module No. Link ID

1 https://archive.nptel.ac.in/courses/106/105/106105193/

2 https://www.st.com/resource/en/datasheet/

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 Feedback,
Testing
Brainstorming self-learning Project reformation (If
Sessions required)
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 S5

SOFTWARE PROJECT MANAGEMENT

(Common CS/CD/CM/CR/CA/AD/AM)

Course Code PECST521 CIE Marks 40

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

Credits 3 Exam Hours 2 Hr.30 Min.

Prerequisites (if any) PECST411 Course Type Theory

Course Objectives:

1. To learn the techniques to effectively plan, manage, execute, and control projects within
time and cost targets with a focus on Information Technology and Service Sector.
2. To learn agile project management techniques such as Scrum and DevOps .

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Project scheduling and feasibility study : -
Project Overview and Feasibility Studies - Identification, Market and
Demand Analysis, Project Cost Estimate, Financial Appraisal; Project
1 Scheduling - Project Scheduling, Introduction to PERT and CPM, Critical 8
Path Calculation, Precedence Relationship, Difference between PERT and
CPM, Float Calculation and its importance, Cost reduction by Crashing of
activity.
Resource Scheduling, Cost Control and Project management Features :-
Cost Control and Scheduling - Project Cost Control (PERT/Cost), Resource
2 8
Scheduling & Resource Levelling; Project Management Features - Risk
Analysis, Project Control, Project Audit and Project Termination.
Agile Project Management :-
Agile Project Management - Introduction, Agile Principles, Agile
3 9
methodologies, Relationship between Agile Scrum, Lean, DevOps and IT
Service Management (ITIL;. Other Agile Methodologies - Introduction to
 XP, FDD, DSDM, Crystal.

Scrum and DevOps in project management :-

Scrum - Various terminologies used in Scrum (Sprint, product backlog,
sprint backlog, sprint review, retro perspective), various roles (Roles in
Scrum), Best practices of Scrum, Case Study; DevOps - Overview and its
4 11
Components, Containerization Using Docker, Managing Source Code and
Automating Builds, Automated Testing and Test-Driven Development,
Continuous Integration, Configuration Management, Continuous
Deployment, Automated Monitoring, Case Study.

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)
Understand how effectively plan, and schedule projects within time
CO1 K2
and cost targets
Apply project estimation and evaluation techniques to real world
CO2 K3
problem
CO3 Discuss different Agile Project Methodologies K2
CO4 Apply various SCRUM practices in project management. K3

CO5 Demonstrate the techniques used in DevOps. 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 3 3 2 2
CO2 3 3 3 2 2
CO3 3 3 3 2 2
CO4 3 3 3 2 2
CO5 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
Succeeding with Agile: Software
1 Mike Cohn Addison-Wesley 1/e, 2009
Development Using Scrum
 Reference Books
Name of the Name of the Edition
Sl. No Title of the Book
Author/s Publisher and Year
Agile Product Management with
1 Roman Pichler Addison-Wesley 1/e, 2010
Scrum
Agile Project Management with
2 Ken Schwaber Microsoft Press 1/e, 2004
Scrum

Video Links (NPTEL, SWAYAM…)

No. Link ID

1 https://archive.nptel.ac.in/noc/courses/noc19/SEM2/noc19-cs70/
2 https://www.youtube.com/watch?v=TPEgII1OilU
3 https://www.youtube.com/watch?v=7Bxdds2siU8
 SEMESTER S5

ARTIFICIAL INTELLIGENCE

Course Code PECST522 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 lay a solid foundation of the important abstractions, techniques, and reasoning for
intelligent systems.
2. To enable the learners to understand the basic principles of Reinforcement Learning.
SYLLABUS

Module Contact
Syllabus Description
No. Hours
Introduction to Artificial Intelligence:-
Introduction, Foundation and history of AI Agents and Environments; The
1 concept of rationality; The nature of environments, Structure of agents. 8
Problem solving Agents Well-defined problems and solutions, Formulating
problems; Example problems- vacuum world, 8-puzzle, 8-queens.
Searching:-
Depth First Search, Breadth First Search, Iterative Deepening Search.
Heuristic Search strategies - Heuristic functions, The effect of heuristic
2 10
accuracy on performance; Generate and test, Greedy best first search, A*
algorithm, Constraint satisfaction problems, Adversarial search - Games,
Optimal Decision in games, The minimax algorithm, Alpha–beta pruning.
Knowledge-Based Agents :-
The Wumpus World, Logic, Propositional Logic, Reasoning Patterns in
3 Propositional Logic, First order logic, Inference in first order logic, 8
propositional vs. first order inference, unification & lifts forward chaining,
Backward chaining.
 Reinforcement Learning :- Learning from Rewards, Passive Reinforcement
Learning, Active Reinforcement Learning, Generalization in Reinforcement
4 10
Learning, Policy Search, Apprenticeship and Inverse Reinforcement
Learning, Applications of Reinforcement Learning

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)
CO1 Explain how intelligent agents can solve problems. K2
CO2 Use the different types of search methods to solve various problems. K3
Formulate knowledge representation and examine resolution in
CO3 K3
propositional logic and first order logic.
CO4 Utilize reinforcement learning techniques to create intelligent agents. 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 2 - - - - - - - 2
CO2 3 3 3 2 - - - - - - - 2
CO3 2 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
Sl. No Title of the Book Name of the Author/s
Publisher and Year
1 AI – A Modern Approach Stuart Russel, Peter Norvig Pearson Education 4/e, 2021
Kevin Knight, Elaine Rich,
2 Artificial Intelligence Tata McGraw-Hill 3/e, 2009
Shivashankar B. Nair
 Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Introduction to Artificial
1 Intelligence and Expert Dan W. Patterson Pearson Education 1/e, 2015
Systems
Artificial Intelligence:
2 Structures and Strategies for George F. Luger Pearson Education 6/e, 2009
Complex Problem Solving
Artificial Intelligence : Making
3 Nilakshi Jain Wiley 1/e, 2019
a System Intelligent

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
1 https://www.youtube.com/watch?v=X_Qt0U66aH0
2 https://www.youtube.com/watch?v=te1K8on1Pk0
3 https://www.youtube.com/watch?v=SEJhMO1IXZs
4 https://youtu.be/YaPSPu7K9S0?si=DizMPlZ9uVSy50iG
 SEMESTER S5

DATA ANALYTICS

Course Code PECST523 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 help the learner to understand the basic concepts of data analytics.

2. To cover the mathematics for data analytics, predictive and descriptive analytics of
data, classification, and clustering & text analytics.
3. To enable the learners to perform data analysis on a real world scenario using
appropriate tools.

SYLLABUS

Module Contact
Syllabus Description
No. Hours

Introduction to Data Analytics:-

Analytics Process Model, Analytical Model Requirements, Data

Analytics Life Cycle overview; Association of two variables - Discrete
1 variables, Ordinal and Continuous variable; Probability calculus - 9
probability distributions; Hypothesis Testing - Basic definitions.

Proximity Measures - Data Objects, Attribute types, Dissimilarity and

Similarity measures.

Association of Two Variables:-

Summarizing the Distribution of Two Discrete Variables, Contingency
2 Tables for Discrete Data, Joint, Marginal, and Conditional Frequency 9
Distributions, Graphical Representation of Two Nominal or Ordinal
Variables, Measures of Association for Two Discrete Variables,
 Association Between Ordinal and Continuous Variables, Visualization of
Variables from Different Scales.
Statistical Description of data - Central tendency, Dispersion, Range,
Quartiles, Variance, Standard Deviation, and Interquartile Range.

Data Preprocessing - Cleaning, Integration, Reduction, Transformation,

Discretization.

Mining Frequent Patterns - Associations, Correlations, and Apriori

3 9
Algorithms.

Classification - General approach to classification, ID3, Attribute

selection measures, Naive Bayesian Classification.

Clustering - K-Means, Agglomerative versus Divisive Hierarchical

Clustering, BIRCH, DBSCAN.

Text Processing :-

Boolean retrieval, Example IR problem, inverted index, processing

4 Boolean queries, tokenization, stemming, phrase queries, vector space 9
model, finite automata and language model, query likelihood model,
naïve bayes text classification.

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)
CO1 Explain the key concepts of data analytics K2
Apply appropriate techniques to convert raw data into suitable format
CO2 K3
for practical data analytics tasks
CO3 Extend the concept of association rule mining in real world scenario K3
Select appropriate clustering and classification algorithms for various
CO4 applications and extend data analytics methods to the new domains of K4
data.
CO5 Understand the basics of text analytics and text classification 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 3
CO2 3 3 3 3
CO3 3 3 3 3
CO4 3 3 3 3
CO5 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
Introduction to Statistics and Christian Heumann and
1 Springer 1/e, 2016
Data Analysis Michael Schomaker

Jiawei Han and Micheline Data Mining Concepts

2 Elsevier 3/e, 2012
Kamber and Techniques

Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Introduction to Information Christopher D. Manning, Cambridge
1 1/e, 2008
Retrieval Raghavan, P., Schutze, H. University Press
Charu C. Aggarwal, Cheng
2 Mining Text Data Springer 1/e, 2012
Xiang Zhai
Analytics in a Big Data World: The
Essential Guide to Data Science and Bart Baesens John Wiley
3 1/e, 2013
its Business Intelligence and
Analytic Trends
Pang-Ning Tan, Michael
Pearson
4 Introduction to Data Mining Steinbach and Vipin 1/e, 2007
Education
Kumar

Video Links (NPTEL, SWAYAM…)

No. Link ID
1 https://archive.nptel.ac.in/noc/courses/noc19/SEM1/noc19-cs15/
2 https://onlinecourses.swayam2.ac.in/cec19_cs01/preview
 SEMESTER S5

DATA COMPRESSION
( Common to CS/CD/CM/CR/AD/AI/AM/CN/CI)

Course Code PECST524 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 students to basic applications, concepts, and techniques of Data

Compression.
2. To develop skills for using recent data compression software to solve practical
problems in a variety of disciplines.
SYLLABUS

Module Contact
Syllabus Description
No. Hours
Basic Compression Techniques :-
Data Compression Approaches - Variable-Length Codes, Run-Length
Encoding, Space - Filling Curves, Dictionary-Based Methods, Transforms,
Quantization.
1 10
Huffman Encoding - Huffman Decoding, Adaptive Huffman Coding,
Facsimile Compression. Run Length Encoding (RLE), RLE Text
compression, Dictionary based Coding- LZ77, LZ78, LZW and Deflate: Zip
and Gzip compression.
Advanced Techniques :-
Arithmetic Coding - The Basic Idea, Implementation,Underflow; Image
Compression- Introduction, Approaches to Image Compression, History of
2 Gray Codes, Image Transforms, Orthogonal Transforms, The Discrete 10
Cosine Transform, Intermezzo: Statistical Distributions, JPEG, Human
Vision and Color, The Wavelet Transform, Filter Banks, WSQ, Fingerprint
Compression
 Video Compression :-
3 Video Compression - Analog video, Digital Video, Motion Compensation. 8
MPEG standards MPEG, H.261
Audio Compression :-
Audio Compression - Companding, The Human Auditory System, Heinrich
4 8
Georg Barkhausen, Linear Prediction, µ-Law and A-Law Companding,
Shorten

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)
CO1 Describe the fundamental approaches in data compression techniques K2
CO2 Illustrate various classical data compression techniques K3
CO3 Illustrate various text and image compression standards K3
CO4 Describe the video compression mechanisms to reduce the redundancy in video K3

CO5 Understand the fundamental principles of audio data compression 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 3
CO2 3 3 3 3
CO3 3 3 3 3
CO4 3 3 3 3
CO5 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
1 A Concise Introduction to Data Compression David Salomon Springer 1/e, 2008
2 Data compression: The Complete Reference David Salomon Springer 3/e, 2004
3 Introduction to Data Compression Khalid Sayood Morgan Kaufman 1/e, 2003
 Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Fractal and wavelet Image Stephen Welstead,
1 PHI 1/e, 1999
Compression techniques
2 Multimedia System Sleinreitz Springer 1/e, 2006
3 The Data Compression Book Mark Nelson, Jean-loup Gailly BPB Publications 1/e, 1996

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
An Introduction to Information Theory by Prof. Adrish Banerjee zt IIT Kanpur
1 https://onlinecourses.nptel.ac.in/noc22_ee49/preview
 SEMESTER S5

DIGITAL SIGNAL PROCESSING

(Common to CS/CM/CA/AM)

Course Code PECST526 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) Signals and Systems Course Type Theory

Course Objectives:

1. To teach the concept of DFT and apply it for filtering data sequences.
2. To educate on the algorithms for complexity reduction in the computation of DFT.
3. To teach the theory of FIR and IIR filters and to design FIR filters.
4. To get exposed to the basic idea of some of the important techniques for designing
efficient VLSI architectures for DSP.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Definition of a digital signal processing system, Sampling, Sampling rate,
DFT and IDFT (Properties of DFT). Linear Convolution using Circular
Convolution, Convolution of long data sequences- Overlap add method,
1 overlap save method. Linear filtering methods based on DFT – FFT (DIT- 9
FFT only) – efficient computation of the DFT of a 2N point real sequences –
correlation – use of FFT in linear filtering and correlation, Symmetries in the
DFT
Types of transfer functions- Ideal filters, Zero phase and linear phase transfer
functions, Types of linear phase FIR transfer functions; Simple digital filters:
Simple FIR digital filters (Low pass and high pass), Simple IIR digital filters
2 (Low pass and high pass), All pass and minimum phase transfer function 8
Design of FIR filter : window based design (Rectangular, Hamming,
Hanning windows). Applications of DSP-Spectral analysis of sinusoidal
signals.
 Realization structures for FIR filters- direct, cascade, parallel. IIR Filter
realization structures (Direct form I, II, cascade and Parallel and transposed
structures); Computational accuracy in DSP implementation- Number
3 9
formats for signals and coefficients in DSP systems, Dynamic range and
precision, Sources of error in DSP implementation - A/D conversion error,
DSP computational error, D/A Conversion error.
FFT and FIR Filter realization on a fixed point processor -finite wordlength
effects - Quantization, rounding and truncation, overflow and scaling.
DSP Algorithm representations, data flow, control flow, signal flow graphs,
block diagrams - Loop bound, iteration bound, critical path - Pipelining,
parallel processing, low power architectures - Retiming, folding and
unfolding techniques, applications.
Hands-on : -
● FPGA based hardware realization of the FFT algorithm, circular
4 10
convolution, IIR and FIR filter structures using iVerilog.
● To realize different DSP algorithms including basic multiply
accumulation and shifting operations on a fixed point processor.
● Analyze the effect of the finite wordlength by implementing the FFT
algorithm and FIR filters by using fixed point coefficient
representation in different formats like Q7, Q15 etc.
● Design an FIR low pass filter using MATLAB/SCILAB and check
how it filters a speech signal by recording it and playing the result.

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)
Understand the concept of DFT and apply it for determining the
CO1 K2
spectral information of data sequences.
CO2 Apply algorithms for complexity reduction in the computation of DFT. K3
Use the theory of FIR and IIR filters and be able to design FIR filters
CO3 K3
using the window method.
CO4 Build the IIR and FIR filter transfer functions using suitable structures K3
Identify the effect of finite wordlength on DSP algorithm
CO5 K3
implementation.
Utilize the low power architectures for implementing the DSP
CO6 K3
algorithms
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 3 2
CO4 3 3 3 3 2
CO5 3 3 3 3 2
CO6 3 3 3 3 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
1 Digital Signal Processing [Modules 1,2,3] S. Salivahanan McGraw Hill 10/e, 2019
Digital Signal Processing: A Computer -
2 Sanjit K.Mitra McGraw Hill 4/e, 2013
Based Approach [Modules 2]
VLSI Signal Processing Systems, Design
3 Keshab K. Parhi Wiley 1/e, 2007
and Implementation [Module 4]

Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
John G. Prokais, Dimitris K
1 Digital Signal Processing Pearson 4/e, 2007
Manolakis
Introduction to Digital Signal
2 Johnny R Johnson Pearson 1/e, 2015
Processing
Mathematics of the Discrete
3 Fourier Transform (DFT): with Julius O. Smith III W3K Publishing 2/e, 2007
Audio Applications
Digital Signal Processing :
Nova Science
4 Fundamentals, Techniques and Juan Zhang 1/e, 2016
Publishers
Applications
Fast Fourier Transform
5 Algorithms for Parallel Daisuke Takahashi Springer 1/e,
Computers (Vol 2)
 Video Links (NPTEL, SWAYAM…)

No. Link ID
1 https://archive.nptel.ac.in/courses/108/101/108101174/
2 https://methodist.edu.in/web/uploads/files/DSP%20NOTES.pdf
 SEMESTER S5

COMPUTER GRAPHICS & MULTIMEDIA

(Common to CS/CD/CR/CA/AD)

Course Code PECST527 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 provide strong technological concepts in computer graphics including the three-

dimensional environment representation in a computer, transformation of 2D/3D objects and
basic mathematical techniques and algorithms used to build applications.
2. To give a good understanding of the multimedia frameworks for audio/video domains and
different compression algorithms.
SYLLABUS

Module Contact
Syllabus Description
No. Hours
Basics of Computer graphics - Basics of Computer Graphics and its
applications. Video Display devices - LED, OLED, LCD, PDP and FED and
reflective displays. Random and Raster scan displays and systems.
1 Line and Circle drawing Algorithms - Line drawing algorithms- 10
Bresenham’s algorithm, Liang-Barsky Algorithm, Circle drawing algorithms
- Midpoint Circle generation algorithm, Bresenham’s Circle drawing
algorithm.
Geometric transformations - 2D and 3D basic transformations -
Translation, Rotation, Scaling, Reflection and Shearing, Matrix
2 representations and homogeneous coordinates. 8
Filled Area Primitives - Scan line polygon filling, Boundary filling and
flood filling.
Transformations and Clipping Algorithms - Window to viewport
3 8
transformation. Cohen Sutherland and Midpoint subdivision line clipping
 algorithms, Sutherland Hodgeman and Weiler Atherton Polygon clipping
algorithms.
Three dimensional graphics - Three dimensional viewing pipeline.
Projections- Parallel and Perspective projections. Visible surface detection
algorithms- Back face detection, Depth buffer algorithm, Scan line
algorithm, A buffer algorithm.
Fundamental of Multimedia - Introduction to Multimedia, Authoring and
Tools, Graphics and Image Data Representations, Popular File Formats,
Fundamental Concepts and types of Video, Basics of Digital Audio and its
types.
4 9
Compression Methods - Lossless Compression Algorithms- Run-Length
Coding, Arithmetic Coding. Lossy Compression Algorithms- Transform
Coding. JPEG and JPEG-LS Standard Image Compression, H.261. Video
Compression Technique.

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)
CO1 Understand the principles of computer graphics and displays K2
CO2 Illustrate line drawing, circle drawing and polygon filling algorithms K3
CO3 Illustrate 2D and 3D basic transformations and matrix representation K3

CO4 Demonstrate different clipping algorithms and 3D viewing pipeline. K3

Summarize the multimedia features and specific compression K2

CO5
algorithms.
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
CO2 3 3 3 3 3
CO3 3 3 3 3 3
CO4 3 3 3 3 3
CO5 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
Computer Graphics : Algorithms and D. P. Mukherjee,
1 PHI 1/e, 2010
Implementations Debasish Jana
Donald Hearn, M.
2 Computer Graphics with OpenGL Pauline Baker and PHI 4/e, 2013
Warren Carithers
Ze-Nian Li and Mark S.
3 Fundamentals of Multimedia Pearson 2003
Drew
 Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Jiun-Haw Lee, I-Chun
Introduction to Flat Panel
1 Cheng, Hong Hua, Shin- Wiley 1/e, 2020
Displays
Tson Wu
Computer Graphics and
2 ITL ESL Pearson 1/e, 2013
Multimedia
Zhigang Xiang and Roy
3 Computer Graphics McGraw Hill 2/e, 2000
Plastock
Principles of Interactive William M. Newman and
4 McGraw Hill 1/e, 2001
Computer Graphics Robert F. Sproull
Procedural Elements for
5 David F. Rogers McGraw Hill 1/e, 2017
Computer Graphics
Donald D Hearn, M Pauline
6 Computer Graphics Pearson 2/e, 2002
Baker

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.

Computer Graphics By Prof. Samit Bhattacharya at IIT Guwahati

1, 2, 3
https://onlinecourses.nptel.ac.in/noc20_cs90/preview

Web Based Technologies and Multimedia Applications by Prof. P. V. Suresh at Indira Gandhi
4
National Open University https://onlinecourses.swayam2.ac.in/nou20_cs05/preview
 SEMESTER S5

ADVANCED COMPUTER ARCHITECTURE

Course Code PECST528 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) PBCST404 Course Type Theory

Course Objectives:

1. To introduce the advanced processor architectures including parallelism concepts in

Programming of multiprocessor and multicomputers.
2. To provide detailed understanding about data flow in computer architectures.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Introduction – The impact of hardware and software technology trends Self
review – Instruction set Architecture, Memory addressing, addressing modes
Class of Computers, Concept of Computer Hardware and Organization (P15,
5th Edition) Measuring, Reporting and Summarizing Performance,
Benchmarks – Desktop and Server Amdahl’s Law, Processor Performance
Equation
1
_____________________________________________________
Beyond the books – Visit www.spec.org. Explore the High Performance
Computing benchmarks and compare the results submitted by different
vendors for the same benchmark. Are you able to appreciate the need for
benchmarks to compare performance? What are retired benchmarks? Can
you write a paper and publish results based on a retired benchmark?
Review the basic Concepts of Parallel Processing and Pipelining Instruction
2 Level Parallelism, data dependencies and hazards Different types of
dependences, Compiler Techniques for ILP, Branch Prediction – Correlating
 branch predictor Dynamic Scheduling – Idea, Introduction to Tomasulo’s
scheme. Register Renaming Hardware Speculation, Reorder Buffers
Multiple issue and static scheduling, VLIW
Data Level Parallelism. Vector Processors – How do they work, Memory
Banks, Stride, Scatter Gather. SIMD-comparison with vector GPU,
Comparison of loops in C vs CUDA NVIDIA GPU Memory structure
Vector Processor vs GPU, Multimedia SIMD computers vs GPU
3 Multiprocessor Architecture, Centralized shared memory architecture Cache
coherence and snooping protocol (Implementation details – not required).
Performance of Symmetric Shared-Memory Processors. Distributed Shared
Memory and Directory based protocol – basics. Synchronization – Basic
Hardware Primtives. Memory Consistency Models – Sequential and relaxed
Warehouse Scale Computers – Goals and requirements. Programming
frameworks for Batch processing – Map reduce and Hadoop Computer
Architecture of Warehouse-scale computers Moore’s Law, Dennard Scaling,
Dark Silicon and the transition towards Heterogeneous Architectures
Asymmetric multi-core architecture – Static and Dynamic (Overall idea,
4 example processors) Functional Heterogeneous Multicore architecture –
GPUs, Accelerators, Reconfigurable Computing Beyond the textbook –
Identify the processor used in your PC and mobile phone. Study about its
architecture, is it homogeneous or heterogeneous, does it use GPUs, what
information can you gather about it from the manufacturer’s website –
Discuss in the class

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)
Enumerate the different classes of computers and where they are used
CO1 K2
in everyday life.
Compute the effect of hardware/software enhancements on the speedup
CO2 K3
of a processor using Amdahl’s law.
Interpret possible dependencies that can cause hazards in a given block
CO3 K3
of code.
Summarize different strategies followed to ensure Instruction Level
CO4 K2
Parallelism.
Compare different strategies followed to ensure Instruction Level
CO5 Parallelism and different strategies followed to ensure Data K3
Parallelism.
Illustrate the need for memory consistency models and cache
CO6 K3
coherence protocols and explain the principle behind it.
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
CO2 3 3 3 3
CO3 3 3 3 3
CO4 3 3 3 3 3
CO5 3 3 3 3 3
CO6 3 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
Computer architecture: A Quantitative Hennessy, J. and
1 Morgan Kaufman 5/e, 2012
Approach. Patterson, D
The Dark Side of Silicon: Energy
2 Efficient Computing in the Dark Kanduri, Anil, et al. Springer 1/e, 2017
Silicon Era

Reference Books
Name of the Name of the Edition
Sl. No Title of the Book
Author/s Publisher and Year
Gérard Blanchet
1 Computer Architecture Wiley 1/e, 2013
Bertrand Dupouy
2 Advanced Computer Architectures Sajjan C Shiva Taylor & Fancis 1/e, 2018
Computer Architecture
3 Charles Fox no starch press 1/e, 2024

Video Links (NPTEL, SWAYAM…)

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

DATA MINING
(Common to CS/CD/CM/CA/AM)

Course Code PECST525 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 provide a thorough understanding of the key processes and concepts involved in data
mining and data warehousing within application domains
2. To enable students to understand the different data pre-processing techniques, fundamentals
and advanced concepts of classification, clustering, association rule mining, text mining and
web mining, and apply these techniques in real-world scenarios

SYLLABUS

Module Contact
Syllabus Description
No. Hours

Data Mining Fundamentals :-

Data Mining - concepts and applications, Knowledge Discovery in Database Vs

Data mining, Architecture of typical data mining system, Data Mining
1 Functionalities 8

Data warehouse - Differences between Operational Database Systems and Data

Warehouses, Multidimensional data model- Warehouse schema, OLAP
Operations, Data Warehouse Architecture

Data Preprocessing :-
2 Data Preprocessing - Need of data preprocessing, Data Cleaning- Missing 9
values, Noisy data, Data Integration and Transformation
 Data Reduction - Data cube aggregation, Attribute subset selection,
Dimensionality reduction, Numerosity reduction, Discretization and concept
hierarchy generation.

Classification And Clustering :-

Classification - Introduction, Decision tree construction principle, Information

Gain, Gini index, Decision tree construction algorithm - ID3, Neural networks,
3 back propagation, Evaluation measures - accuracy, precision, recall, F1 score 9

Clustering - Introduction to clustering, distance measures, Clustering

Paradigms, Partitioning Algorithm - k means, Hierarchical Clustering,
DBSCAN

Association Rule Analysis And Advanced Data Mining : -

Association Rule Mining - Concepts, Apriori algorithm, FP Growth Algorithm

Web Mining - Web Content Mining, Web Structure Mining- Page Rank, Web
4 Usage Mining- Preprocessing, Data structures, Pattern Discovery, 10
Pattern Analysis

Text Mining - Text Data Analysis and information Retrieval, Basic measures
for Text retrieval, Text Retrieval methods, Text Indexing Technique

Criteria for Evaluation(Evaluate and Analyse): 20 marks

Students must be asked to identify problems involving large datasets and identify the right solution
from the concepts already learned. A comparison of the results with a similar approach also need to be
performed to assess the Knowledge Level 5.
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 subdivisions. 60
each carrying 3 marks Each question carries 9 marks.
(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)
Understand the key process of data mining and data K2
CO1
warehousing concepts in application domains.
Apply appropriate pre-processing techniques to convert raw data into K3
CO2
suitable format for practical data mining tasks
Illustrate the use of classification and clustering algorithms in various K3
CO3
application domains
CO4 Comprehend the use of association rule mining techniques K3

Explain advanced data mining concepts and their applications in K2

CO5
emerging domains
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 2
CO2 3 3 3 3 2 2
CO3 3 3 3 3 2 2
CO4 3 3 3 3 2 2
CO5 2 2 2

Text Books
Edition and
Sl. No Title of the Book Name of the Author/s Name of the Publisher
Year
Data Mining Concepts and Jaiwei Han, Micheline
1 Elsevier 3/e, 2006
Techniques Kamber

Data Mining: Introductory

2 Dunham M H Pearson Education 1/e, 2006
and Advanced Topics

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

Introduction to Data Mining Pang-Ning Tan, 1/e, 2014

1 Addison Wesley
Michael Steinbach

Data Mining: Concepts, Models,

2 Mehmed Kantardzic Wiley 2/e, 2019
Methods, and Algorithms

Video Links (NPTEL, SWAYAM…)

Module No. Link ID

1 https://youtu.be/ykZ-_UGcYWg?si=qiqynQyjI1sNNiHE
2 https://youtu.be/NSxEiohAH5o?si=ZIJHMiRvpFcNQNMA
3 https://youtu.be/VsYKqOokgaE?si=rgndBZqpzB29LUGg
4 https://youtu.be/N_whCVtfL9M?si=VPMH9NP4vdAaiuPe
 SEMESTER S5

ADVANCED GRAPH ALGORITHMS

Course Code PECST595 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) GAMAT401 Course Type Theory
PCCST303
PCCST502

Course Objectives:

1. To gain proficiency in designing and implementing sophisticated graph algorithms for

analyzing large-scale networks, and apply these techniques to real-world problems such as
social network analysis and transportation optimization.
2. To develop the ability to critically evaluate and enhance advanced graph algorithms for
dynamic and evolving graphs, using real-world case studies to illustrate their application and
performance in complex scenarios.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Maximum Flow Algorithms - Dinic's Algorithm, Push-Relabel Algorithm.
Applications - network bandwidth allocation, data center resource
management.
Minimum Cost Flow - Cycle-Canceling Algorithm, Capacity Scaling
Algorithm. Applications - transportation logistics, network routing with cost
constraints.
1 9
Assignments:
1. Network Bandwidth Allocation - Optimize bandwidth allocation in a
communication network using Dinic's Algorithm.
Implement Dinic's Algorithm to solve a network flow problem
where you are given a communication network represented as a
directed graph with capacities on edges. Your goal is to maximize
 the flow from a source node to a sink node. Use a real-world
network dataset (e.g., a telecommunications network with nodes and
link capacities).
2. Logistics Optimization - Optimize the transportation of goods in a
supply chain network using the Capacity Scaling Algorithm.
Use the Capacity Scaling Algorithm to address a logistics problem
where you need to minimize transportation costs in a supply chain
network. The network is represented as a graph where nodes
represent locations (warehouses, distribution centers, etc.), and edges
represent transportation routes with associated costs. Use a dataset
representing a supply chain network with nodes, edges, and costs.
Strongly Connected Components (SCC) - Tarjan's Algorithm, Kosaraju's
Algorithm. Applications - analyzing web page link structures, understanding
connected components in social networks.
Dynamic Graph Connectivity - Dynamic connectivity algorithms, Eulerian
and Hamiltonian paths. Applications - real-time network monitoring,
dynamic route planning.
Assignments:
1. Web Page Link Analysis - Objective: Analyze strongly connected
components (SCC) in a web graph using Tarjan's Algorithm.
Implement Tarjan's Algorithm to find SCCs in a web graph where
nodes represent web pages and edges represent hyperlinks. SCCs
2 9
help in understanding the structure of the web and identifying
clusters of interconnected pages. Use a real-world web graph dataset
with nodes and edges.
2. Dynamic Route Planning - Manage and analyze routes in a
transportation network that evolves over time using dynamic
connectivity algorithms.
Implement dynamic connectivity algorithms to handle a
transportation network where edges and nodes may be added or
removed over time. The goal is to maintain and update the
connectivity information efficiently. Use a dataset representing a
transportation network with dynamic updates.
Graph Matching - Edmonds' Algorithm for finding maximum matchings.
Applications - job assignment, network design.
3 9
Graph Coloring - Colorings for special classes of graphs (e.g., planar graphs,
interval graphs). Applications - frequency assignment in wireless networks,
 scheduling problems
Assignments:
1. Job Assignment Optimization - Solve job assignment problems using
Edmonds' Algorithm.
Implement Edmonds' Blossom Algorithm to address job assignment
problems where you need to match workers to jobs in a way that
maximizes the overall efficiency or minimizes the cost. Use a dataset
with job assignments and associated costs or efficiencies.
2. Frequency Assignment - Allocate frequencies in wireless
communication systems using graph coloring techniques.
Apply graph coloring techniques to allocate frequencies to
transmitters in a wireless communication network to avoid
interference. The goal is to minimize the number of frequencies used
while ensuring that adjacent transmitters do not use the same
frequency. Use a dataset representing a network of transmitters with
potential interference.
Graph Partitioning and Community Detection - Kernighan-Lin Algorithm,
Spectral Partitioning. Applications - social network community detection,
large-scale data clustering.
Parameterized Algorithms for Graph Problems - Fixed-parameter tractability
for vertex cover, feedback vertex set. Applications - network security,
bioinformatics.
Assignments:
1. Social Network Community Detection - Detect communities in a
social network using the Kernighan-Lin Algorithm.
Apply the Kernighan-Lin Algorithm to detect communities in a
4 social network where nodes represent individuals and edges 9
represent relationships. The goal is to find clusters of highly
interconnected individuals. Use a social network dataset with nodes
and edges representing social connections.
2. Network Security Analysis - Identify critical nodes in a network
using parameterized algorithms to assess network security.
Use parameterized algorithms to identify critical nodes and
vulnerabilities in a network. These nodes are crucial for the
network's connectivity, and their removal would impact the
network's security and robustness. Use a dataset representing a
network with nodes and edges, along with possible vulnerabilities.
 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 evaluation pattern:

● Correctness and Accuracy (30%) - Correct Solution and Implementation.
● Effectiveness and Efficiency (25%) - Algorithm Efficiency and Performance Metrics.
● Analytical Depth (25%) - Problem Understanding and Solution Analysis.
● Justification and Comparisons (20%) - Choice Justification and Comparative
Analysis.

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 subdivisions. 60
each carrying 3 marks Each question carries 9 marks.
(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)
Develop and implement advanced algorithms for network flow, graph
CO1 connectivity, and matching, and evaluate their performance on real- K3
world datasets.
Analyze and compare the efficiency and effectiveness of various graph
CO2 algorithms, including those for network optimization and community K4
detection.
Apply advanced graph algorithms to solve practical problems such as
CO3 network optimization, job assignment, and frequency allocation, K3
demonstrating their utility in real-world scenarios.
Formulate and solve complex graph-related problems using appropriate
CO4 algorithms, including those for graph traversal, minimum spanning K5
trees, and network security analysis.
Critically assess the strengths and limitations of different graph
CO5 algorithms, and effectively communicate findings and K5
recommendations through detailed reports and presentations.
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 2
CO2 3 3 3 3 2
CO3 3 3 3 3 2
CO4 3 3 3 3 2
CO5 3 3 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
Thomas H. Cormen,
Charles E. Leiserson, The MIT Press
1 Introduction to Algorithms 4/e 2023
Ronald L. Rivest and Cambridge
Clifford Stein
Robert Sedgewick and
2 Algorithms Addison-Wesley 4/e, 2023
Kevin Wayne
Cambridge University
3 Graph Algorithms Shimon Even 2/e, 2011
Press
4 Graph Theory Reinhard Diestel Springer 4/e, 2010

Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Mingyu Xiao and Ton Springer Verlag,
1 A Guide to Graph Algorithms 1st, 2022
Kloks Singapore;
Albert-László
Cambridge University
2 Network Science Barabási and Márton 1st, 2016
Press
Pósfai
Springer-Verlag New
3 Modern Graph Theory Bela Bollobas 1st, 1998
York Inc
Ravindra Ahuja, Thomas
Network Flows: Theory,
4 Magnanti, and James Pearson 1st, 1993
Algorithms, and Applications
Orlin
5 Introduction to Graph Theory Douglas B. West Pearson 2nd, 2020
Modern Graph Theory
Algorithms with Python:
Harness the power of graph Colleen M Farrelly and
6 Packt Publishing 2024
algorithms and real-world Franck Kalala Mutombo
network applications using
Python
 Video Links (NPTEL, SWAYAM…)
Module
Link ID
No.
1 https://onlinecourses.nptel.ac.in/noc21_cs48/preview
2 https://onlinecourses.nptel.ac.in/noc21_cs48/preview
3 https://onlinecourses.nptel.ac.in/noc21_cs48/preview
4 https://onlinecourses.nptel.ac.in/noc21_cs48/preview
 SEMESTER S5

NETWORKS LAB
(Common to CS/CD/CM/CB/CU/CI)

Course Code PCCSL507 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) None Course Type Lab

Course Objectives:

1. To provide hands-on experience in network programming using Linux System calls and
network monitoring tools.
2. To comprehend the implementation of network protocols and algorithms, and configuration
of network layer services using network simulators.

Expt.
Experiments
No.
Warm up
Familiarize Linux networking commands - ifconfig, ifplugstatus, iftop, ping, ip,
1
traceroute, mtr, netstat, whois, nmap, nmcli, speedtest-cli, bmon, nslookup, tcpdump
Wireshark based
Start your web browser and clear the browser's cache memory. Open Wireshark and start
capturing. Then visit any webpage of your choice. Type http in the filter field of the
Wireshark and click Apply so that only HTTP messages are displayed. After enough
packets have been captured, select the Capture from the pull-down menu and select Stop
to stop capturing.
Using the captured information, determine the following:
2 (a) the source IP address and destination IP address of the first GET message
(b) the medium format, the language, the encoding, and the character set that the
client can accept. (Use the first GET message)
(c) the URL of the website and the user agent (Use the first GET message)
(d) the source IP address and destination IP address of the first response message
(e) the status codes for the first response message.
(f) when the HTML file that you are retrieving was last modified at the server
 (g) value of the content-length field of the first response message
(h) how long it took from the time the GET message was sent until the response
message was received.
(Use the timestamps of a GET message and that of the corresponding response
message. By default, the time column's value is the amount of time in seconds
since Wireshark tracing began.)
(i) the HTTP version of your browser.
Compose an e-mail and address it to yourself, but do not send it yet. Open the Wireshark
and start capturing. Go to your e-mail user agent and send the e-mail. In the Wireshark
window, type smtp in the filter field and click Apply. Stop capturing and save the
captured file.
Using the captured information, answer the following:
(a) All SMTP packets have the same two IP addresses. Which one is the IP address of
your computer? Which host does the other IP address represent?
3
(b) All SMTP packets have the same two port numbers. Which one is the port number
of the SMTP client process? In which range is the client port number?
(c) What is the port number of the SMTP server process?
(d) Examine the SMTP commands or SMTP response codes in each SMTP packet
and write down their meanings.
(e) There is an IMF packet that is encapsulated inside an SMTP packet. What is the
content of this packet?
First, clear the DNS record from the cache memory of your computer. For this, use
ipconfig/flushdns on Windows or systemd-resolve --flush-caches on Linux. Next, clear
your browser's cache memory. Open the Wireshark and start capturing. In your browser
visit your college website. Wireshark starts to capture packets. Type dns in the filter field
and press Apply so that only DNS messages are displayed. Stop capturing and save the
captured file.
Using the captured information, answer the following questions:
(a) Locate the first DNS query message resolving your college website. What is the
4
packet number (This “packet number” is assigned by Wireshark for listing
purposes only; it is NOT a packet number contained in any real packet header.) in
the trace for the DNS query message?
(b) Is this query message sent over UDP or TCP?
(c) Now locate the corresponding DNS response to the initial DNS query. What is the
packet number in the trace for the DNS response message? Is this response
message received via UDP or TCP?
(d) What are the source and destination port numbers for the DNS query message?
 (e) What are the source and destination port numbers for the DNS response message?
(f) To what IP address is the DNS query message sent?
(g) What is the query message ID number? What is the response message ID number?
What is the purpose of this field?
(h) What is the length of the flag field in a DNS message?
(i) Which bit in the flag field determines whether the message is a query or a
response?
(j) Which bits are used only in the response message? What is the function of these
bits in the response message?
(k) How many question records, answer records, authority records, and additional
records are present in the query message?
(l) How many question records, answer records, authority records, and additional
records are present in the response message?
Socket programming based
Client-Server communication using TCP:- The client inputs an integer N and creates a
square matrix of order N by populating the matrix with random numbers in the range
5 [1,50]. It then sends the matrix to the server which identifies the matrix type (upper
triangular, lower triangular, diagonal). The server then informs the type (as a string) to the
client which it prints.
Client-Server communication using UDP:- You are very good at communicating in the
“new generation” English language with all sorts of abbreviations like tbh, ig, etc. Now
design a client-server application as follows: The client inputs a new-generation English
sentence from the user and sends it to the server. The server then translates the received
sentence to formal English and sends the translated sentence back to the client which it
prints.
Sample string sent to the server
6
Really idc about this stupid server as it is of no use irl but atm, I will design one, tbf to the
professor.
Translated string sent back to the client
Really I don't care about this stupid server as it is of no use in real life but at the moment, I
will design one, to be fair to the professor.
You may consider only the following abbreviations: tbh, ig, tbf, atm, irl, lol, asap, omg,
ttyl, idk, nvm
7 Implement a multi-user chat server using TCP as the transport layer protocol.
Implement a concurrent Time Server application using UDP to execute the program at a
8
remote server. The client sends a time request to the server which sends its system time
 back. The client then displays the received time value.
Develop a concurrent file server that will provide the file requested by the client if it
exists. If not, the server sends an appropriate message to the client. The server should also
9
send its process ID (PID) to clients for displaying along with the file contents or with the
message.
10 Develop a packet-capturing application using raw sockets.
Cisco’s Packet tracer based
Familiarizing router commands
(a) Knowing the current mode (user or privileged), switching to privileged mode
(b) Switching to configuration mode
(c) Obtaining router information such as type, OS, memory stats, interface details etc.
(d) Viewing the status of any routing protocols currently configured
(e) Showing the routing table
(f) Saving the running configuration
11
(g) Viewing the command history
(h) Viewing the router clock
(i) Viewing the list of hosts
(j) Displaying the statistics for all the interfaces (Both detailed and brief views)
(k) Knowing the controller type (DTE or DCE)
(l) Configuring serial and ethernet interfaces - enabling the interface, setting IP
address, mask, and clock rate
 Figure 1: A sample network along with the interface addresses (all interfaces use a /24 mask)
Set up static routing for the network shown in Figure 1. Once the routes are set up, display
12
the routing table and verify the connectivity using ping.
Implement RIPv2 routing for the network shown in Figure 1. Once the routes are set up,
13
display the routing table and verify the connectivity using ping.
Implement OSPF routing for the network shown in Figure 1. Once the routes are set up,
14
display the routing table and verify the connectivity using ping.
You are the network administrator of your college. A small portion of your campus
network is shown in Figure 2. You want to allow only Host_B to communicate with the
15 network 172.16.10.0. Verify your settings by the following checks:
(a) Pinging Host_A from Host_B
(b) Pinging Host_A from Lab_B and Lab_C

Figure 2: A portion of your college campus network

 You are the network administrator of your college. The college is assigned a network
address 140.80.0.0. There are 20 subnets in your college network. The Central Computing
Facility (CCF) resides in the 4th subnet. The department of CSE is organizing an inter-
department hackathon for which the registration closed yesterday. The registration was
16 through the hackathon website hosted on a server which is assigned the 7th address in the
16th subnet. As the network administrator, your job now is to block students from
accessing the hackathon website from CCF.
[The server provides other services than the website hosting as well. Make sure you block
only the website access. Other services should not be denied.]
17 Figure 3 shows an IPv6-based network. Interconnect the different subnets using RIPng.

Figure 3: An IPv6 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)
Understand the working of application layer protocols by analyzing the
CO1 pertinent headers in actual data packets captured using network monitoring K3
tools.
Exploit the client server paradigm to develop real time networking
CO2 K3
applications using transport layer protocols.
CO3 Employ IPv4 and IPv6 addressing, subnetting to efficiently design networks. K3
CO4 Simulate core networking concepts using a network simulator. K3
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 3
CO2 3 3 3 3 2 3
CO3 3 3 3 3 3
CO4 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
Unix Network Programming, W. Richard Stevens,
1 Volume 1: The Sockets Andrew M. Rudoff, Bill Pearson Education 3/e, 2004
Networking API Fenner
CCNA Cisco certified network
2 associate study guide Exam Todd Lammle Wiley 6/e, 2007
640-802 6
Beej's Guide to Network
Brian "beej Jorgensen" Amazon Digital
3 Programming: using Internet 2019
Hall Services
Sockets

Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Computer Networks: A Top-
1 Behrouz A Forouzan McGraw Hill SIE, 2017
Down Approach
Computer Networking: A Top-
J. F. Kurose and K. W.
2 Down Approach Featuring Pearson Education 8/e, 2022
Ross
Internet

Video Links (NPTEL, SWAYAM…)

No. Link ID

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

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
MACHINE LEARNING LAB
(Common to CS/CA)
Course Code PCCSL508 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) None Course Type Lab

Course Objectives:
1. To give the learner a practical experience of the various machine learning techniques and be
able to demonstrate them using a language of choice.

Expt.
Experiments
No.
Implement linear regression with one variable on the California Housing dataset to predict
housing prices based on a single feature (e.g., the average number of rooms per dwelling).
Tasks:
● Load and preprocess the datase.
1
● Implement linear regression using both gradient descent and the normal equation.
● Evaluate the model performance using metrics such as Mean Squared Error
(MSE) and R-squared.
● Visualize the fitted line along with the data points.
Implement polynomial regression on the Auto MPG dataset to predict miles per gallon
(MPG) based on engine displacement. Compare polynomial regression results with linear
regression.
Tasks:
2 ● Load and preprocess the dataset.
● Implement polynomial regression of varying degrees.
● Compare the polynomial regression models with linear regression using metrics
such as MSE and R-squared.
● Visualize the polynomial fit.
Implement Ridge and Lasso regression on the Diabetes dataset. Compare the performance
3 of these regularized models with standard linear regression.
Tasks:
 ● Load and preprocess the dataset.
● Implement Ridge and Lasso regression.
● Tune hyperparameters using cross-validation.
● Compare performance metrics (MSE, R-squared) with standard linear regression.
Estimate the parameters of a logistic regression model using MLE and MAP on the Breast
Cancer Wisconsin dataset. Compare the results and discuss the effects of regularization.
Tasks:
● Load and preprocess the dataset.
4 ● Implement logistic regression with MLE.
● Apply MAP estimation with different regularization priors (L1 and L2
regularization).
● Compare the performance and parameter estimates with MLE and MAP.

Use MLE and MAP to estimate the parameters of a multinomial distribution on the 20
Newsgroups dataset. Explore the impact of different priors on the estimation.
Tasks:
5 ● Load and preprocess the dataset.
● Implement MLE for multinomial distribution parameter estimation.
● Apply MAP estimation with various priors (e.g., Dirichlet priors).
● Compare results and evaluate the effect of different priors.
Implement a logistic regression model to predict the likelihood of a disease using the Pima
Indians Diabetes dataset. Compare the performance with and without feature scaling.
Tasks:
6 ● Load and preprocess the Pima Indians Diabetes dataset.
● Implement logistic regression for binary classification.
● Evaluate model performance with and without feature scaling.
● Analyze metrics such as accuracy, precision, recall, and F1-score.
Implement a Naïve Bayes classifier to categorize text documents into topics using the 20
Newsgroups dataset. Compare the performance of Multinomial Naïve Bayes with
Bernoulli Naïve Bayes.
Tasks:
● Load and preprocess the 20 Newsgroups dataset.
7
● Implement Multinomial Naïve Bayes and Bernoulli Naïve Bayes classifiers.
● Evaluate and compare the performance of both models using metrics such as
accuracy and F1-score.
● Discuss the strengths and weaknesses of each Naïve Bayes variant for text
classification.
 Implement the K-Nearest Neighbors (KNN) algorithm for image classification using the
Fashion MNIST dataset. Experiment with different values of K and analyze their impact
on model performance.
Tasks:
8 ● Load and preprocess the Fashion MNIST dataset.
● Implement KNN for multi-class classification.
● Experiment with different values of K and evaluate performance.
● Discuss the impact of different K values on model accuracy and computational
efficiency.
Implement a Decision Tree classifier using the ID3 algorithm to segment customers based
on their purchasing behavior using the Online Retail dataset. Analyze the tree structure
and discuss the feature importance.
Tasks:
9
● Load and preprocess the Online Retail dataset.
● Implement Decision Tree using the ID3 algorithm.
● Visualize the decision tree and analyze feature importance.
● Discuss how the tree structure helps in understanding customer behavior.
Implement and compare Logistic Regression and Decision Trees on the Adult Income
dataset for predicting income levels. Evaluate both models based on performance metrics
and interpretability.
Tasks:
10 ● Load and preprocess the Adult Income dataset.
● Implement both Logistic Regression and Decision Trees.
● Compare the models based on metrics such as accuracy, precision, recall, and F1-
score.
● Discuss the interpretability of both models and their suitability for the dataset.
Implement a Linear Support Vector Machine (SVM) to classify the Iris dataset. Visualize
the decision boundary and discuss how the margin is determined.
Tasks:
● Load and preprocess the Iris dataset.
11
● Implement a Linear SVM for binary classification (e.g., classify Setosa vs. Non-
Setosa).
● Visualize the decision boundary and margin.
● Discuss the concept of the margin and how it influences classification.
Implement and compare the performance of SVM classifiers with linear, polynomial, and
12 RBF kernels on the Fashion MNIST dataset. Analyze the advantages and disadvantages of
each kernel type.
 Tasks:
● Load and preprocess the Fashion MNIST dataset.
● Implement SVM with linear, polynomial, and RBF kernels.
● Compare the classification performance for each kernel.
● Discuss the strengths and weaknesses of each kernel type.
Implement and train a Multilayer Feed-Forward Network (MLP) on the Wine Quality
dataset. Experiment with different numbers of hidden layers and neurons, and discuss how
these choices affect the network’s performance.
Tasks:
13 ● Load and preprocess the Wine Quality dataset.
● Design and implement an MLP with varying architectures (different hidden layers
and neurons).
● Train and evaluate the network.
● Discuss the impact of architecture choices on performance.
Implement and compare the performance of a neural network using different activation
functions (Sigmoid, ReLU, Tanh) on the MNIST dataset. Analyze how each activation
function affects the training process and classification accuracy.
Tasks:
14
● Load and preprocess the MNIST dataset.
● Implement neural networks using Sigmoid, ReLU, and Tanh activation functions.
● Train and evaluate each network.
● Compare training times, convergence, and classification accuracy.
Implement and perform hyperparameter tuning for a neural network on the Fashion
MNIST dataset. Experiment with different learning rates, batch sizes, and epochs, and
discuss the impact on model performance.
Tasks:
15
● Load and preprocess the Fashion MNIST dataset.
● Experiment with different hyperparameters (learning rate, batch size, epochs).
● Train and evaluate the network.
● Discuss how hyperparameter choices affect model performance.
Implement and compare hierarchical (agglomerative) and partitional (K-means) clustering
algorithms on the Mall Customers dataset. Discuss the strengths and weaknesses of each
method based on clustering results and evaluation metrics.
16 Tasks:
● Load and preprocess the Mall Customers dataset.
● Apply both hierarchical (agglomerative) and K-means clustering.
● Compare results using metrics such as inertia, silhouette score, and clustering
 visualization.
● Discuss the advantages and disadvantages of each clustering method.
Implement and apply K-means clustering to the Digits dataset. Experiment with different
numbers of clusters and evaluate the clustering results using metrics such as inertia and
silhouette score. Analyze how the choice of K affects clustering performance.
Tasks:
17
● Load and preprocess the Digits dataset.
● Implement K-means clustering with various numbers of clusters.
● Evaluate clustering performance using inertia and silhouette score.
● Analyze the impact of the number of clusters on clustering quality.
Implement bootstrapping and cross-validation on the Iris dataset. Compare the model
performance metrics (e.g., accuracy, F1-score) obtained using these resampling methods.
Discuss the advantages and disadvantages of each method.
Tasks:
18 ● Load and preprocess the Iris dataset.
● Implement bootstrapping to generate multiple samples and evaluate the model.
● Implement k-fold cross-validation and evaluate the model.
● Compare the performance metrics and discuss the pros and cons of each
resampling method.
Implement bagging and boosting ensemble methods on the Titanic dataset. Compare the
performance of both methods in terms of accuracy, precision, recall, and F1-score.
Discuss how each method improves model performance and their respective strengths and
weaknesses.
Tasks:
● Load and preprocess the Titanic dataset.
19
● Implement bagging using a base classifier (e.g., decision tree) and evaluate
performance.
● Implement boosting using a boosting algorithm (e.g., AdaBoost) and evaluate
performance.
● Compare performance metrics and discuss the strengths and weaknesses of each
method.
Investigate the bias-variance tradeoff using polynomial regression on the Boston Housing
dataset. Plot the training and validation errors for various polynomial degrees and discuss
the tradeoff between bias and variance.
20
Tasks:
● Load and preprocess the Boston Housing dataset.
● Implement polynomial regression with varying degrees.
 ● Plot training and validation errors for each degree.
● Discuss the bias-variance tradeoff and its impact on model performance.

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 Understand complexity of Machine Learning algorithms and their limitations; K2
CO2 Understand modern notions in data analysis-oriented computing; K2
Apply common Machine Learning algorithms in practice and implement their
CO3 K3
own.
CO4 Performing experiments in Machine Learning using real-world data. K3
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
CO2 3 3 3 3 3
CO3 3 3 3 3 3
CO4 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
Introduction to Machine
1 Ethem Alpaydin MIT Press 4/e, 2020
Learning
Machine Learning Manaranjan Pradhan | U
2 Wiley 1/e, 2019
using Python Dinesh Kumar
Machine Learning: Theory and M.N. Murty, V.S.
3 Universities Press 1/e, 2024
Practice Ananthanarayana

Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Data Mining and Analysis:
Mohammed J. Zaki | Cambridge University
1 Fundamental Concepts and 1/e, 2016
Wagner Meira Press
Algorithms
Neural Networks for Pattern Oxford University
2 Christopher Bishop 1/e, 1998
Recognition Press

Video Links (NPTEL, SWAYAM…)

No. Link ID

1 https://archive.nptel.ac.in/courses/106/105/106105152/

2 https://archive.nptel.ac.in/courses/106/106/106106139/
3 https://nptel.ac.in/courses/106106202
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
COMPUTER SCIENCE AND ENGINEERING
 SEMESTER S6
COMPILER DESIGN
(Common to CS/CD/CU/CC/CN/CB)

Course Code PCCST601 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) Course Type Theory

PCCST302

Course Objectives:

1. To provide a comprehensive understanding of the compiler construction process through its

various phases viz. lexical analysis, parsing, semantic analysis, code generation, and
optimization.

2. To introduce compiler construction tools like Lex and YACC and use them in lexical analysis
and parsing.

SYLLABUS

Module Syllabus Description Contact

No. Hours
Introduction - Compiler Structure, Overview of Translation: The Front
End; The Optimizer; The Back End.
Scanners - Recognizing Words, Regular Expressions, From Regular
1 Expression to Scanner: FSA (Brush-up only), Implementing Scanners 6
Hands-on: Recognizing Words with Lex, Regular Expressions in Lex
Parsing - Introduction, Expressing Syntax
Top-Down Parsing - Transforming A Grammar: Eliminating Left
Recursion; Backtrack-free Parsing; Left-Factoring To Eliminate
2 Backtracking, Recursive Descent Parsers, Table-Driven LL(1) Parsers 10
 Bottom-Up Parsing - Shift Reduce Parser, The LR(1) Parsing
Algorithm, Building LR(1) Tables, Errors in the Table Construction,
Reducing the Size of LR (1) Tables.
16
Hands-on: Building a calculator with YACC

Intermediate Representations: An IR Taxonomy, Graphical IRs -

3 Syntax-Related Trees, Graphs; Linear IRs - Stack-Machine Code -
Three-Address Code - Representing Linear Codes
Syntax-Driven Translation: Introduction, Translating Expressions,
Translating Control-Flow Statements
Code generation: Code Shape - Arithmetic Operators, Boolean and
Relational Operators, Control-Flow Constructs (Conditional
Execution, Loops and Iteration, Case Statements only), Procedure
4 Calls 14
Code Optimization - Introduction, Opportunities for Optimization,
Scope Of Optimization
Local Optimization: Local Value Numbering, Tree-Height Balancing
Regional Optimization: Superlocal Value Numbering, Loop Unrolling
Global Optimization: Finding Uninitialized Variables with Live Sets,
Global Code Placement

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)
Use lexical analysis techniques to build a scanner for a given language
CO1 K3
specification. (Cognitive Knowledge Level: Apply)
Construct parse trees for input programs using parsing algorithms and
CO2 detect syntactic errors. K3
(Cognitive Knowledge Level: Apply)
Develop semantic analysis techniques to check program correctness.
CO3 K3
(Cognitive Knowledge Level: Apply)
Build intermediate code representations by applying intermediate code
CO4 K3
generation techniques. (Cognitive Knowledge Level: Apply)
Optimize generated code using code optimization strategies to improve
CO5 K3
performance. (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 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 3 3 3 2
CO2 3 3 3 3 2
CO3 3 3 3 3 2
CO4 3 3 3 3 2
CO5 3 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 Engineering a Compiler Keith D. Cooper, Linda Torczon Elsevier Science 3/e, 2023
John R. Levine, Tony Mason,
2 Lex and YACC O’ Reily 2/e, 1992
Doug Brown

Reference Books
Name of the Edition and
Sl. No Title of the Book Name of the Author/s
Publisher Year
Compilers – Principles Aho A.V., Ravi Sethi
1 Addison Wesley, 2/e, 2010.
Techniques and Tools and D. Ullman.

Compiler Construction -
2 Kenneth C Louden Thomson Learning 1/e, 2007
Principles and Practice

Prentice-Hall
3 Compiler Design in C Allen Holub 1/e, 1990
software series
Modern Compiler Cambridge
4 Andrew W. Appel 2/e, 2004
Implementation in C University Press

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
1-4 https://archive.nptel.ac.in/courses/106/105/106105190/
 SEMESTER S6
ADVANCED COMPUTING SYSTEMS
Course Code PCCST602 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.

GAEST203
Prerequisites (if any) PBCST404 Course Type Theory
PCCST403

Course Objectives:

1. To introduce the computational models prevalent in modern distributed systems.

2. To provide the concepts of computer clusters, virtualization, cloud computing,
microservices and containers.
SYLLABUS

Module Contact
Syllabus Description
No. Hours
Distributed System Models and Enabling Technologies:-
The age of internet computing:- – High performance and high throughput
computing, Centralized, Parallel, Distributed and Cloud Computing. Design
objectives of HPC and HTC. IoT and Cyber Physical systems.
1 7
Technologies for Network-Based systems:- Multicore CPUs and
Multithreading Technologies. GPU Computing. Virtual Machines.
System models for distributed and cloud computing:- Clusters, Grids,
P2P Systems, Clouds.
Computer Clusters :-
Clustering for massive parallelism:- Design objectives, Design Issues –
Ensuring high availability, Cluster families. Cluster Architecture. GPU
Clusters – Components.
2 Computer Clusters – Design principles – Single System Image features. 11
High availability through redundancy. Fault tolerant cluster configurations,
checkpoint and recovery techniques.
Cluster Job and Resource Management:- – Job Scheduling methods, Job
management system – administration, job types, migration schemes.
 Virtualization:- Introduction, Virtualization at different levels and their
comparison. VMM design requirements, OS level virtualization.
3 Virtualization structures and mechanisms. CPU, Memory and I/O 9
Virtualization. Virtual clusters and resource management. Live VM
migration steps, migration of memory, files and network resources.
Cloud Computing, Microservices and Containers:-
Cloud Computing and Service models:- Private, Public and Hybrid clouds.
Cloud Design objectives and Cost Model. Infrastructure-as-a-Service,
Platform-as-a-Service, Software-as-a-Service.
Microservices:- – Introduction, advantages and disadvantages. Interprocess
4 9
Communication – Types of interactions, Protocol, Standard and Message
Format, Discovery Service, API Gateway, Service Registry
Containers – Comparison of Virtual Machines and Containers. Introduction
to Docker. Case Study - Docker Containers – Architecture, Components,
Examples.

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)
Illustrate the key enabling technologies for network-based systems,
including multicore CPUs, multithreading, GPU computing, and
CO1 K3
virtualization, and how these technologies contribute to the
performance and efficiency of distributed systems.
Use computer cluster architectures, ensuring high availability, fault
tolerance, and massive parallelism. They will also learn to implement
CO2 K4
effective job and resource management strategies within cluster
environments.
Explain various levels of virtualization, including CPU, memory, and
CO3 I/O virtualization, and understand the design requirements and K2
mechanisms of Virtual Machine Monitors (VMMs).
Articulate the differences between private, public, and hybrid cloud
CO4 models, and understand the design objectives and cost considerations K4
associated with different cloud models.
Explain microservices architecture, its advantages and disadvantages,
and the principles of interprocess communication. They will also learn
CO5 about the role of containers in modern computing, with a specific focus K3
on Docker, including its architecture, components, and practical
applications through case studies.
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
CO2 3 3 3 3
CO3 3 3 3 3
CO4 3 3 3 3
CO5 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
Distributed and Cloud
Computing: From Parallel Kai Hwang,Geoffrey C.
1 Morgan Kaufmann 1/e, 2013
Processing to the Internet of Fox, Jack Dongarra

Things

2 Microservices and Containers Parminder Singh Kocher Addison-Wesley 1/e, 2018

Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Patterns of Distributed
1 Unmesh Joshi Pearson Education 1/e, 2024
Systems
Cluster Computing, Grid
2 Computing, Cloud and Deepa Kalavikatte DSK Publisher 1/e, 2020
Virtualization
Cloud and Distributed
Rajiv Misra, Yashwant
3 Computing: Algorithms and Wiley 1/e, 2020
Singh Patel
Systems

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.

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

2 https://onlinecourses.nptel.ac.in/noc24_cs131/preview
 SEMESTER S6

SOFTWARE TESTING
(Common to CS/CA/CM/CD/CR/AM/AD)

Course Code PECST631 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 Cultivate proficiency in software testing methodologies and techniques.
2. To Foster expertise in software testing tools and technologies.
SYLLABUS

Module Contact
Syllabus Description
No. Hours
Introduction to Software Testing & Automation:-
Introduction to Software Testing - Concepts, importance of testing,
software quality, and real-world failures (e.g., Ariane 5, Therac 25);
Software Testing Processes - Levels of thinking in testing; Testing
Terminologies - Verification, validation, fault, error, bug, test cases, and
coverage criteria; Types of Testing - Unit, Integration, System,
1 8
Acceptance, Performance (stress, usability, regression), and Security
Testing; Industry Trends - AI in test case automation, Introduction to
GenAI in testing; Testing Methods - Black-Box, White-Box, and Grey-
Box Testing; Automation in Testing - Introduction to automation tools
(e.g., Selenium, Cypress, JUnit); Case Study- Automation of Unit
Testing and Mutation Testing using JUnit.
Unit Testing, Mutation Testing & AI-Driven Automation:-
Unit Testing- Static and Dynamic Unit Testing, control flow testing, data
flow testing, domain testing; Mutation Testing- Mutation operators,
2 8
mutants, mutation score, and modern mutation testing tools (e.g.,
Muclipse); JUnit Framework - Automation of unit testing, frameworks
for testing in real-world projects; AI in Testing - GenAI for test case
 generation and optimization, impact on automation; Industry Tools -
Application of AI-driven testing tools in automation and predictive
testing; Case Study - Mutation testing using JUnit, AI-enhanced test case
automation.
Advanced White Box Testing & Security Testing:-
Graph Coverage Criteria - Node, edge, and path coverage; prime path
and round trip coverage; Data Flow Criteria - du paths, du pairs,
subsumption relationships; Graph Coverage for Code - Control flow
graphs (CFGs) for complex structures (e.g., loops, exceptions); Graph
3 10
Coverage for Design Elements - Call graphs, class inheritance testing,
and coupling data-flow pairs; Security Testing - Fundamentals, tools
(OWASP, Burp Suite), and their role in protecting modern applications;
Case Study - Application of graph based testing and security testing
using industry standard tools.
Black Box Testing, Grey Box Testing, and Responsive Testing:-
Black Box Testing - Input space partitioning, domain testing, functional
testing (equivalence class partitioning, boundary value analysis, decision
tables, random testing); Grey Box Testing - Introduction, advantages,
and methodologies (matrix testing, regression testing, orthogonal array
testing); Performance Testing - Network latency testing, browser
4 compatibility, responsive testing across multiple devices (e.g., 10
BrowserStack, LambdaTest); Introduction to PEX - Symbolic execution,
parameterized unit testing, symbolic execution trees, and their
application; GenAI in Testing - Advanced use cases for predictive and
responsive testing across devices and environments; Case Study-
Implementation of black-box, grey-box, and responsive testing using
PEX and AI-driven tools.
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)

Demonstrate the ability to apply a range of software testing techniques,

CO1 K2
including unit testing using JUnit and automation tools.

Illustrate using appropriate tools the mutation testing method for a given
CO2 piece of code to identify hidden defects that can’t be detected using other K3
testing methods.
Explain and apply graph coverage criteria in terms of control flow and
CO3 K2
data flow graphs to improve code quality.
Demonstrate the importance of black-box approaches in terms of Domain
CO4 K3
and Functional Testing
Illustrate the importance of security, compatibility, and performance
CO5 K3
testing across devices.
Use advanced tools like PEX to perform symbolic execution and optimize
CO6 test case generation and also leverage AI tools for automated test case K3
prediction and symbolic execution with PEX.
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 3 3 3
CO2 3 3 3 3 3 3
CO3 3 3 3 3
CO4 3 3 3 3 3
CO5 3 3 3 3 3
CO6 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
Introduction to Software Cambridge
1 Paul Ammann, Jeff Offutt 2/e, 2016
Testing. University Press
Software Testing and Quality
Kshirasagar Naik,
2 Assurance : Theory and Wiley 1/e, 2008
Priyadarshi Tripathy
Practice

Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
1 Software Testing Ron Patten Pearson 2/e, 2005
Software Testing: A
2 Paul C. Jorgensen CRC Press 4/e, 2017
Craftsman’s Approach
Foundations of Software Dorothy Graham, Rex Black,
3 Cengage 4/e, 2021
Testing Erik van Veenendaal
Glenford J. Myers, Tom
4 The Art of Software Testing Wiley 3/e, 2011
Badgett, Corey Sandler
 Video Links (NPTEL, SWAYAM…)
Module
Link ID
No.
1 https://archive.nptel.ac.in/courses/106/101/106101163/
2 https://archive.nptel.ac.in/courses/106/101/106101163/
3 https://archive.nptel.ac.in/courses/106/101/106101163/
4 https://archive.nptel.ac.in/courses/106/101/106101163/
 SEMESTER S6
DEEP LEARNING
Course Code PECST632 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 give the learner an understanding about the foundations of Deep Learning architecture and
applications
2. To equip the learner with the necessary skills to set-up neural network architecture and use it
for real time problem solution.
SYLLABUS

Module Contact
Syllabus Description
No. Hours
Neural Networks Multilayer Perceptron, Back-propagation algorithm and its
1 variants Stochastic gradient descent, Curse of Dimensionality, Deep 8
feedforward networks.
Machine Learning and Deep learning, Representation Learning, Width and
Depth of Neural Networks, Activation Functions: RELU, LRELU, ERELU,
2 9
Unsupervised Training of Neural Networks, Restricted Boltzmann Machines,
Auto Encoders, Deep Learning Applications.
CNN-Architectural Overview, Motivation, Layers, Filters, Parameter
sharing, Regularization, Popular CNN Architectures: ResNet, Alexnet –
3 Applications. Recurrent Neural Networks, Bidirectional RNNs, Encoder – 10
decoder sequence to sequence architectures – BPTT for training RNN, Long
Short Term Memory Networks.
Computer Vision - Speech Recognition - Natural language Processing, Case
studies in classification, Regression and deep networks. Regularized
4 9
Autoencoder, stochastic Encoders and Decoders, Contractive Encoders.
GAN and its variants
 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)
Construct fundamental neural network architectures and algorithms,
CO1 K3
including Multilayer Perceptron and Back-propagation
Apply advanced techniques such as Stochastic Gradient Descent and
CO2 address the Curse of Dimensionality in the context of deep learning K3
models.
Build various deep learning architectures, including feed-forward
CO3 networks, Convolutional Neural Networks (CNNs), and their K3
applications in real-world problems.
Develop and utilize Recurrent Neural Networks (RNNs) and Long
CO4 Short-Term Memory Networks (LSTMs) for sequence modeling and K3
natural language processing tasks.
Apply unsupervised learning techniques such as Autoencoders and
CO5 Generative Adversarial Networks (GANs) to solve complex problems K3
in computer vision and speech recognition.
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 3
CO2 3 3 2 3 3
CO3 3 3 2 3 3
CO4 3 3 2 3 3
CO5 3 3 2 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
Ian Goodfellow, Yoshua
1 Deep Learning MIT Press 1/e, 2016
Bengio, Aaron Courville
Neural Networks and Deep
2 Michael A. Nielsen Determination Press, 2/e, 2015
Learning
Learning Deep Architectures
3 Yoshua Bengio Now Publishers Inc 1/e, 2009
for AI
Deep Learning: A Practitioner's Josh Patterson, Adam
4 O'Reilly 1/e, 2017
Approach Gibson

Reference Books
Name of the Name of the Edition
Sl. No Title of the Book
Author/s Publisher and Year
Applied Deep Learning. A Case-based
1 Approach to Understanding Deep Neural Umberto Michelucci Apress 1/e, 2018
Networks
Antonio Gulli, Sujit
2 Deep Learning with Keras Packt 1/e, 2017
Pal
3 Deep Learning with Python Francois Chollet Manning 1/e. 2017
4 Deep Learning M Gopal Pearson 1/e, 2022
Cambridge
5 The Science of Deep Learning Iddo Drori 1/e, 2021
Univeristy Press
 Video Links (NPTEL, SWAYAM…)
Module
Link ID
No.
1 https://nptel.ac.in/courses/106105215 (Week 4)
2 https://nptel.ac.in/courses/106105215 (Week 5)
3 https://nptel.ac.in/courses/106105215 (Week 8)
4 https://nptel.ac.in/courses/106105215 (Week 10,11 and 12)
 SEMESTER S6

WIRELESS & MOBILE COMPUTING

(Common to CS/CM/AM)

Course Code PECST633 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 enable the learners to acquire advanced concepts on wireless communication systems and
mobile ad-hoc networks.
2. To impart the basics of mobile computing, architecture of wireless transmission systems and
next generation networks
3. To Learn the communication protocols, various architectures and security features used in
mobile computing.
SYLLABUS

Module Contact
Syllabus Description
No. Hours
Wireless LAN - Advantages, Design goals, Applications, Infrastructure Vs
1 Ad-hoc mode, IEEE 802.11 System Architecture, Protocol Architecture, 9
Physical layer, Medium Access Control layer, HIPERLAN-1, Bluetooth
Introduction to mobile computing – Functions, Middleware and Gateways,
Application and services. Mobile computing architecture – Internet: The
2 8
Ubiquitous network, Three-tier architecture for Mobile Computing, Design
considerations for mobile computing.
Spread spectrum – Direct sequence, Frequency hopping. Medium Access
Control – Space Division Multiple Access (SDMA), Frequency Division
Multiple Access (FDMA), Time Division Multiple Access (TDMA), Code
3 Division Multiple Access (CDMA). Satellite Systems – Basics, Applications, 9
Geostationary Earth Orbit (GEO), Low Earth Orbit (LEO), Medium Earth
Orbit (MEO), Routing, Localization, Handover. Telecommunication Systems
- Global System for Mobile Communication (GSM)
 Mobile network layer – Mobile Internet Protocol (IP), Dynamic Host
Configuration Protocol (DHCP), Mobile ad-hoc networks – Routing,
Dynamic Source Routing (DSR), Destination Sequenced Distance Vector
4 (DSDV), Ad-hoc routing protocols; Mobile transport layer – Traditional 10
Transmission Control Protocol (TCP), Improvements in Classical TCP;
Security issues in mobile computing - Information security, Security
techniques and algorithms, Security models.

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)
Explain the various mobile computing applications, services, design
CO1 K2
considerations and architectures
Describe the various technology trends for next generation cellular
CO2 K2
wireless networks and use the spreading concept on data transmission
CO3 Summarize the architecture of various wireless LAN technologies K2
Identify the functionalities of mobile network layer & transport layer
CO4 K2
and various security issues in mobile computing
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
CO2 3 3 3 3
CO3 3 3 3 3
CO4 3 3 3 3
CO5 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
Mobile Computing Technology - Asoke K. Talukder, Hasan
1 McGraw Hill 2/e, 2010
Application and Service Creation Ahmad, Roopa R Yavagal

2 Mobile Communications Jochen Schiller Pearson 2/e, 2000

Fundamentals of 5G Mobile
3 Jonathan Rodriguez Wiley 1/e, 2015
Networks
 Reference Books
Name of the Name of the Edition
Sl. No Title of the Book
Author/s Publisher and Year
1 Mobile Computing Raj Kamal Oxford University Press 2/e, 2011
2 Computer Networks, Andrew S. Tanenbaum PHI 3/e, 2003
Wireless Communications
3 Theodore S. Rappaport PHI 2/e, 2004
Principles and Practice
Fundamentals of Networking
4 Curt M. White Cengage learning 7/e, 2013
and Communication

Video Links (NPTEL, SWAYAM…)

No. Link ID
1 https://archive.nptel.ac.in/courses/106/106/106106147/
 SEMESTER S6

ADVANCED DATABASE SYSTEMS

(Common to CS/CM/CR/AM/AD)

Course Code PECST634 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 learn the fundamentals of data modeling, query processing, and design in advanced
databases and study the working principles of distributed databases.
2. To learn emerging databases such as XML and NoSQL.
3. To enable the student to use tools, methodologies, and skills for working successfully with
databases in today's global, data driven business model.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Query Processing and Optimization - Measures of query cost, Algorithms for
Selection with cost analysis, Algorithms for Join with cost analysis, Evaluation
of expressions; Heuristics in Query Optimization - Optimization of Relational
1 9
Algebra expressions; Physical Database Design and Tuning - Introduction to
Physical Database Design, Overview of Database Tuning, Tuning the
Conceptual Schema, Tuning Queries and Views; Impact of Concurrency.
Distributed Databases - Distributed Systems, Introduction, Architecture,
Distributed Database Concepts, Distributed Data Storage, Distributed
Transactions, Commit Protocols, Concurrency Control; Query Processing and
2 9
Decomposition - Query Processing Objectives, Characterization of Query
Processors, Layers of Query Processing, Query Decomposition, Localization
of Distributed Data.
XML and Non Relational Databases - Introduction to Semi Structured Data
3 9
and XML Databases, XML Data Model – XSD, XML: DTD and XML
 Schema, XML Presentation, XPath Queries, XQuery; NoSQL Databases -
CAP Theorem, Document based; MongoDB Operation - Insert, Update,
Delete, Query, Indexing, Application, Replication, Sharding, Deployment;
Cassandra - Data Model, Key Space, Table Operations, CRUD Operations.
Graph database - Introduction, Data Modelling with Graphs, Building a Graph
Database application, Data Modeling, Predictive Analysis with Graph Theory;
4 9
Depth and Breadth First Search; Path-Finding with Dijkstra’s Algorithm;
Graph Theory and Predictive Modeling

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)
Apply various measures for query processing and optimization, and
CO1 K3
apply techniques to tune database performance.
Explain the architecture and fundamental concepts of distributed
CO2 K2
databases.
Utilize semi-structured data, XML, and XML queries for effective data
CO3 K3
management
Utilize NoSQL database systems to manage and manipulate data in real-
CO4 K3
time applications
Develop advanced skills in graph database concepts, covering data
CO5 modeling, application building, and the application of graph theory for K3
predictive analysis and modeling.
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 2 3
CO2 3 2 2 3
CO3 3 2 2 2 3
CO4 3 2 2 2 3
CO5 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
Ramez Elmasri, Shamkant Pearson
1 Fundamentals of Database Systems 7/e, 2017
B. Navathe
A. Silberschatz, H. Korth,
2 Database System Concepts McGraw-Hill 7/e, 2021
S. Sudarshan
R. Ramakrishnan, J.
3 Database Management Systems McGraw Hill 3/e, 2018
Gehrke
Ian Robinson, Jim Webber
4 Graph Databases O’Reilly 2/e, 2015
& Emil Eifrem
5 Database Systems T. M. Connolly, C. Begg Pearson 6/e, 2019

Reference Books
Name of the Name of the Edition
Sl. No Title of the Book
Author/s Publisher and Year
Principles of Database Management: W. Lemahieu, S. Cambridge
1 Practical Guide to Storing, Managing vanden Broucke and B. University 1/e, 2018
and Analyzing Big and Small Data Baesens Press
Designing Data-Intensive Applications:
2 The Big Ideas Behind Reliable, Scalable, M. Kleppmann O’Reilly 1,e2017
and Maintainable Systems
Hector Garcia-Molina
3 Database Systems: The Complete Book Jeffrey D. Ullman Prentice Hall 2/e, 2009
Jennifer Widom
Next generation databases: NoSQL,
4 Guy Harrison Apress 1/e, 2015
newSQL, and big data. Apres.
Foundations of Multidimensional and Morgan
5 Hanan Samet 1/e, 2006
Metric Data Structures Kaufmann
 Video Links (NPTEL, SWAYAM…)
Module
Link ID
No.
1 CAP Theorem https://nptel.ac.in/courses/106104189

2 Advanced database Queries https://archive.nptel.ac.in/courses/106/104/106104021

3 Database design https://archive.nptel.ac.in/courses/106106093/

Introduction to modern application development
4
https://archive.nptel.ac.in/courses/106/106/106106156
 SEMESTER S6

DIGITAL IMAGE PROCESSING

(Common to CS/CM/CA/AM)

Course Code PECST636 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 provide foundational concepts of digital image representation, processing, and analysis, including
image digitization, color theory, and various data structures, to effectively manipulate and analyze
digital images.
2. To help the learner develop the ability to implement advanced image processing techniques, such as
image segmentation, edge detection, and image compression, while critically evaluating the
performance and quality of these methods in practical applications.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
The image, its representation and properties - Image representations, Image
digitization, Sampling, Quantization, Digital image properties, Metric and
topological properties of digital images, Histograms, Entropy, Visual
perception of the image, Image quality, Noise in images; Color images -
1 Physics of color, Color perceived by humans, Color spaces, Color constancy; 9
Data structures for image analysis - Levels of image data representation,
Traditional image data structures - matrices, Chains, Topological data
structures - Relational structures, Hierarchical Data Structures, Pyramids,
Quadtrees, Other pyramidal structures.
Image pre-processing - Pixel brightness transformations-, Position-dependent
brightness correction, Gray-scale transformation, Geometric Transformations
2 - Pixel coordinate transformations, Brightness interpolation. 8
Local pre-processing, Image Smoothing, Edge detectors, Zero-crossings the
second derivative,Scale in Image Processing, Canny Edge Detection,
 Parametric Edge Models, Edges Multi-spectral images,, Line detection by
local pre-processing operators, Detection of corners(interest points),
Image Restoration - Degradations that are easy to restore, Inverse Filtering,
Wiener Filtering
Image Segmentation - Thresholding, Threshold Detection Methods- Optimal
thresholding, Multi-spectral thresholding, Edge-based segmentation, Edge
Image Thresholding, Edge Relaxation, Border Tracing, Border Detection As
Graph Searching, Border Detection As Dynamic Programming, Hough
3 Transforms, Border Detection Using Border location information, 9
Region construction from borders, Region-based segmentation - Region
merging, Region Splitting - Splitting And Merging, Watershed segmentation
Matching, Template Matching, Control Strategies Templating, Evaluation
Issues In Segmentation
Image Transforms - Discrete Cosine Transform, Wavelet transform, Eigen-
analysis, Singular value decomposition, Principal component analysis Radon
Transform;
Image Compression - Image data Properties, Discrete Image Transforms In
4 Image data compression, Predictive compression methods, Vector 10
quantization, Hierarchical and Progressive Compression methods,
Comparison Of Compression Methods, JPEG and MPEG image compression
JPEG still image compression, JPEG–2000 compression, MPEG full-motion
video compression.

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)
Understand the properties of monochrome and colour images and the
CO1 K2
data structures for image analysis
Apply different preprocessing techniques to visualize image
CO2 K3
enhancement
Understand the concept of image segmentation and various techniques
CO3 K2
used for this.
CO4 Understand the various transforms used for image processing K2
Understand the concept of image compression and apply various image
CO5 K2
compression techniques.
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 3 2
CO3 3 3 3 3 2
CO4 3 3 3 3 2
CO5 3 3 3 3 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
Image Processing, Analysis and Machine Milan Sonka, Vaclav
1 Cengage 4/e, 2015
Vision Hlavac, Roger Boyle

Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Fundamental of Digital Image
1 Anil K. Jain Pearson 1/e, 2015
Processing
2 Digital image Processing Ralph Gonzalez, Richard Woods Pearson 4/e, 2018
S Jayaraman, S Esakkirajan, T
3 Digital Image Processing McGraw Hill 2/e, 2020
Veerakumar

Video Links (NPTEL, SWAYAM…)

No. Link ID
1 https://archive.nptel.ac.in/courses/117/105/117105135/
2 https://archive.nptel.ac.in/courses/106/105/106105032/
 SEMESTER S6

FUNDAMENTALS OF CRYPTOGRAPHY
(Common to CS/CM/CR/AM/AD)

Course Code PECST637 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 develop a foundational understanding of mathematical concepts in cryptography,

2. To gain comprehensive knowledge of cryptographic methods.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Introduction to Number Theory - Divisibility and The Division Algorithm,
The Euclidean Algorithm, Modular Arithmetic : The Modulus, Properties
of Congruences, Modular Arithmetic Operations, The Extended Euclidean
Algorithm, Primitive Roots, Existence of Primitive Roots for Primes,
1 10
Fermat’s Theorem, Euler’s Totient Function,
Euler’s Theorem, Testing for Primality : Miller–Rabin Algorithm, A
Deterministic Primality Algorithm, Discrete Logarithms, Chinese
Remainder Theorem.
Security Attacks; Security Services; Security Mechanisms; Fundamental
Security Design Principles; Cryptography - Symmetric Cipher Model,
2 8
Substitution Techniques, Transposition techniques; Traditional Block
Cipher Structure.
The Data Encryption Standard - DES Encryption & Decryption, Avalanche
Effect, Strength of DES; Advanced Encryption Standard - AES Structure;
3 10
Stream Ciphers; RC4; Principles of Public-Key Cryptosystems - Public-
Key Cryptosystems, Applications for Public-Key Cryptosystems,
 Requirements for Public-Key Cryptography,
The RSA Algorithm, Description of the Algorithm; Diffie–Hellman Key
Exchange..
Cryptographic Hash Functions - Applications of Cryptographic Hash
Functions, Secure Hash Algorithm (SHA), SHA-3; MAC; MD5; Digital
4 8
Signatures.; Key Management and Distribution - Symmetric Key
Distribution; X.509 certificates; PKI.

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)
CO1 Apply number theory concepts in data security K3
Explain the cryptographic concepts and apply the classical encryption
CO2 K3
methods for data confidentiality
Describe the symmetric and asymmetric ciphers used for information
CO3 K2
security
CO4 Explain the algorithms used for authentication and integrity 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 3 2 2
CO2 3 3 3 2 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
Edition
Name of the
Sl. No Title of the Book Name of the Author/s and
Publisher
Year
Cryptography & Network Security:
1 William Stallings Pearson 7/e, 2017
Principles and practice
 Reference Books
Sl. Name of the Edition
Title of the Book Name of the Author/s
No Publisher and Year
1 Cryptography & Network Security Behrouz A. Forouzan McGraw Hill 3/E, 2007
Charles P. Pfleeger,
2 Security in Computing Shari L. Pfleeger, Prentice Hall 5/e, 2015
Jonathan Margulies
A Classical Introduction to Cryptography:
3 S. Vaudenay Springer 1/e, 2009
Applications for Communications Security
Introduction to Cryptography: Principles and Springer-
4 H. Delfs, H. Knebl 1/E, 2002
Applications Verlag

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
1 https://archive.nptel.ac.in/courses/111/101/111101137/

2 https://nptel/courses/video/106105031/L17.html

3 https://onlinecourses.nptel.ac.in/noc22_cs90/preview
 SEMESTER S6

QUANTUM COMPUTING
(Common to CS/CM/CR/AD/AM)

Course Code PECST638 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 give an understanding of quantum computing against classical computing.

2. To understand fundamental principles of quantum computing, quantum algorithms and
quantum information.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Review of Basics Concepts
Review of linear algebra, Principles of quantum mechanics, Review of
1 9
Information theory, Review of Theory of Computation.
[Text 1 - Ch 1, 2; Text 2, Ch 11.1, 11.2]
Introduction to Quantum Information
Qubit – Bloch sphere representation, Multiple qubit states, Quantum logic
2 gates – single qubit and multi-qubit, Quantum circuits, Density matrix, 9
Quantum entanglement.
[Text 1 - Ch 3, 4; Text 2 - Ch 4]
Quantum Algorithms: -
Simple Quantum Algorithms, Quantum Integral Transforms, Grover’s
3 9
Search Algorithm and Shor’s Factorization Algorithm.
[Text 1 - Ch 5,6,7,8]
Quantum Communication: -
4 Von Neumann entropy, Holevo Bound, Data compression, Classical 9
information over noisy quantum channels, Quantum information over noisy
 quantum channels, Quantum Key Distribution, Quantum Communication
protocols
[Text 2 - Ch 11.3, Ch 12.1 - 12.5 ]

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)
Explain the concept of quantum computing against classical
CO1 K2
computing.
CO2 Illustrate various quantum computing algorithms. K2
CO3 Explain the latest quantum communication & protocols. K2
Experiment with new algorithms and protocols for quantum
CO4 K3
computing.
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 3 2
CO2 3 2 3 2
CO3 3 2 3 2
CO4 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
Quantum Computing : Mikio Nakahara
1 From Linear Algebra to Tetsuo Ohmi CRC Press 1/e, 2008
Physical Realizations
Quantum Computation and Michael A. Nielsen & Cambridge University
2 1/e, 2010
Quantum Information Isaac L. Chuang Press
 Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Quantum Computing for Cambridge University
1 Robert Hundt 1/e, 2022
Programmers Press
Quantum Computing for
2 Chris Bernhardt MIT Press 1/e, 2020
Everyone
An Introduction to Practical Omar Amer IEEE Aerospace and
March
3 Quantum Key Distribution Vaibhav Garg Electronic Systems
2021
[paper] Walter O. Krawec Magazine
Quantum communication Nicolas Gisin & Rob March
4 Nature Photonics
[paper] Thew 2007

Video Links (NPTEL, SWAYAM…)

No. Link ID
1 https://archive.nptel.ac.in/courses/106/106/106106232/
2 https://archive.nptel.ac.in/noc/courses/noc19/SEM2/noc19-cy31/
 SEMESTER S6

RANDOMIZED ALGORITHMS

Course Code PECST639 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.

GAMAT301
PCCST302
Prerequisites (if any) Course Type Theory
PCCST303
PCCST502

Course Objectives:

1. To equip with the knowledge and skills to design and analyze algorithms that leverage
randomness to improve performance, solve complex problems, and achieve better average-
case or worst-case guarantees.
2. To provide a deep understanding of advanced randomization techniques and their applications
in various domains, including hashing, graph algorithms, probabilistic method, and
complexity theory.
SYLLABUS

Module Contact
Syllabus Description
No. Hours
Basics of Randomization - Introduction to randomized algorithms,
Probabilistic analysis and expectations, Benefits and applications of
randomization. (Text 1 - Chapter 1)
1 Probability Review - Basic probability theory, Random variables and 9
distributions, Linearity of expectation. (Text 2 - Chapters 1, 2)
Basic Randomized Algorithms - Randomized quicksort, Randomized
selection, Randomized data structures. (Text 3 - Sections 5.3, 9.2)
Randomized Graph Algorithms - Randomized algorithms for graph
problems, Minimum cut problems, Randomized algorithms for network
2 flows. (Text 1 - Chapters 5, 6) 9
Hashing and Randomized Data Structures - Universal and perfect hashing,
Skip lists, Bloom filters. (Text 3 - Chapter 11)
 Markov Chains and Random Walks - Introduction to Markov chains,
Random walks on graphs, Applications in randomized algorithms. (Text 2 -
Chapters 6, 7)
The Probabilistic Method - Basics of the probabilistic method, Linearity of
expectation, First and second-moment methods. (Text 4 - Chapters 1, 2)
3 Chernoff Bounds and Concentration Inequalities - Markov's inequality, 9
Chebyshev's inequality, Chernoff bounds, Applications of concentration
inequalities. (Text 1 - Chapter 4)
Randomized Rounding and Martingales - Randomized rounding techniques,
Applications in approximation algorithms, Introduction to martingales,
Azuma's inequality. (Text 5 - Chapter 14)
4 9
Randomized Complexity Classes - RP, ZPP, and BPP, Relationships
between complexity classes, Amplification and derandomization techniques
(Text 6 - Chapter 7)

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)
Demonstrate a strong understanding of the basics of randomized
CO1 algorithms, including probabilistic analysis, expectations, and the K3
benefits of randomization
Illustrate basic randomized algorithms, such as randomized quicksort,
CO2 selection, and data structures, and evaluate their performance against K3
deterministic alternatives.
Apply advanced randomized techniques, including randomized graph
CO3 algorithms, hashing, and Markov chains, to address complex graph and K3
data structure problems.
Show expertise in probabilistic methods, including Chernoff bounds,
CO4 concentration inequalities, and randomized rounding, and use these K3
methods to solve approximation and analysis problems in algorithms.
Understand and apply concepts related to randomized complexity
CO5 classes, such as RP, ZPP, and BPP, and explore amplification and K3
derandomization techniques.
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
CO5 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
Rajeev Motwani and Prabhakar Cambridge
1 Randomized Algorithms 1/e, 2004
Raghavan University Press
Probability and Computing:
Randomization and Michael Mitzenmacher and Eli Cambridge
2 3/e, 2017
Probabilistic Techniques in Upfal University Press
Algorithms and Data Analysis
Thomas H. Cormen, Charles E.
3 Introduction to Algorithms Leiserson, Ronald L. Rivest, The MIT Press 4/e, 2023
Clifford Stein
4 The Probabilistic Method Noga Alon and Joel H. Spencer Wiley-Blackwell 4/e 2016
Springer Nature
5 Approximation Algorithms Vijay V. Vazirani 2/e, 2013
(SIE)
Computational Complexity: A Cambridge
6 Sanjeev Arora and Boaz Barak 1/e, 2019
Modern Approach University Press

Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Concentration of Measure for
Devdatt Dubhashi and Cambridge University
1 the analysis of randomized 1/e, 2012
Alessandro Panconesi Press
algorithms
The design of approximation David Williamson and Cambridge University
2 1/e, 2011
algorithms David Shmoys Press
Robert Sedgewick and
3 Algorithms Addison-Wesley 4/e, 2023
Kevin Wayne

Video Links (NPTEL, SWAYAM…)

No. Link ID
1 https://archive.nptel.ac.in/courses/106/103/106103187/
 SEMESTER S6

CLOUD COMPUTING
(Common to CS/CA/CM/AM)

Course Code PECST635 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 learn fundamentals of cloud and configure cloud environments, deploy virtual machines,
and work with containerization tools, gaining practical skills.
2. To learn to identify and address common security threats in cloud environments,
implementing best practices to ensure the safety and compliance of applications.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Introduction - Limitations of Traditional Computing & solution, Three
Layers of Computing, Factors behind Cloud Service Adoption; Evolution
and Enabling Technologies of Cloud; Benefits and Challenges; [Text 2]
Fundamental Concepts and Models - Roles and Boundaries, Cloud
1 Characteristics, Cloud Delivery Models, Cloud Deployment Models; [Text 8
1] Introduction to Cloud Providers (AWS, Azure, Google Cloud).
Handson - Cloud Account Setup and Virtual Machine Deployment - Create
accounts on a cloud provider and deploy virtual machine instances, and
document the process and inferences.
Cloud-Enabling Technology - Networks and Internet Architecture, Cloud
Data Center Technology, Modern Virtualization, Multitenant Technology,
Service Technology and Service APIs; Understanding Containerization -
2 10
Influencers, Fundamental Virtualization and Containerization,
Understanding Containers, Understanding Container Images, Multi-
Container Types.[Text 1]
 Handson - Hypervisor and Containers installation - Install hypervisors and
deploy VMs on local machines. Install any container platform and deploy
applications.
Resource Management - Resource Pooling, Sharing, Provisioning; Scaling
in Cloud and the Strategies; Capacity Planning in Cloud Computing; Storage
and File System - Challenges; Cloud Native File System, Deployment
3 models, Storage Types, Popular Cloud Storages. High performance 9
Computing Models.[Text 2]
Handson - Use Map-reduce to implement basic big data applications such as
word count.
Understanding Cloud Security - Basic Security Terminology, Basic Threat
Terminology, Threat Agents, Common Threats; Other Considerations -
Flawed Implementations, Security Policy Disparity, Contracts, Risk
4 7
Management.[Text 1]
Handson : Identify possible attacks of any selected cloud applications and
suggest/implement solutions/policies for mitigation.

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

Ways of assessing at
1. Analyze level - Analyze performance of traditional models (Hardware, Application,
Computing / security models) against that in the cloud.
2. Evaluate level - Derive conclusions on the cloud programming / computing / security models
based on standard performance evaluation criteria.

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 subdivisions. 60
each carrying 3 marks Each question carries 9 marks.
(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)
Evaluate the limitations of traditional computing models and recognize
CO1 the factors driving cloud service adoption and compare between K5
various cloud delivery and deployment models.
Demonstrate proficiency in cloud-enabling technologies, including
CO2 K3
modern virtualization and containerization
Examine the resource management within the cloud, including
CO3 resource pooling, scaling strategies, and storage management and K4
utilize tools like MapReduce for processing big data applications.
Identify potential security threats in cloud environments and apply
CO4 K3
appropriate security measures to mitigate these risks.
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 2 3

CO3 3 3 3 3 3 3

CO4 3 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
Cloud Computing : Concepts,
1 Thomas Erl Pearson 2/e, 2023
Technology, Security, and Architecture
Cambridge
2 Cloud Computing Sandeep Bhowmik 1/e, 2017
University Press

Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Cloud Computing : Theory and
1 Dan C. Marinescu Morgan Kaufman 3/e, 2023
Practice
Cloud Computing: A Hands-On Arshdeep Bahga and Vijay
2 Universities Press 1/e, 2014
Approach Madisetti
Rajkumar Buyya, Christian
3 Mastering Cloud Computing Morgan Kaufman 1/e, 2013
Vecchiola S.Thamarai Selvi
Cloud Computing : A Practical Anthony T. Velte, Toby J.
4 McGraw Hill 1/e, 2010
Approach Velte, Robert Elsenpeter

Video Links (NPTEL, SWAYAM…)

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

MOBILE APPLICATION DEVELOPMENT

(Common to CS/CA/CB/CN)

Course Code PECST695 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 equip students with a thorough understanding of mobile application development

fundamentals, including platforms (iOS and Android) and architectures (MVC, MVVM,
BLoC).
2. To instill proficiency in Flutter and Dart: Enable students to use Flutter effectively for cross-
platform development and the Dart programming language to create responsive, user-friendly
mobile applications.
3. To prepare students for real-world scenarios by teaching app security, testing, CI/CD, and
deployment processes, culminating in the development and deployment of a complete mobile
application project.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Fundamentals of Mobile Application Development:

Introduction to Mobile Application Development, Overview of Mobile

Platforms: iOS and Android, Introduction to Flutter: History, Features, and
Benefits, Setting Up the Flutter Development Environment, Mobile App
1 9
Architectures (MVC, MVVM, and BLoC), Basics of Dart Programming
Language, Introduction to Git and Version Control

Assignments/Projects:

Set up the Flutter environment and create a simple "Hello World"

 application. (Use Git: cloning, committing, pushing, and pulling)

Milestone 1: Develop a basic app with a simple UI and basic functionality.

User Interface Design and User Experience:

Principles of Mobile UI/UX Design, Designing Responsive UIs with Flutter,

Using Flutter Widgets: StatelessWidget and StatefulWidget, Layouts in
Flutter: Container, Column, Row, Stack, Navigation and Routing in Flutter,
Customizing UI with Themes and Styles, Introduction to Material Design
and Cupertino Widgets
2 9
Assignments/Projects:

Design and implement a user interface using Flutter widgets.

Milestone 2: Enhance the project from Module 1 with a multi-screen UI,

navigation, and customized themes.

Advanced Flutter Development:

State Management in Flutter: Provider, Riverpod, and BLoC

Networking in Flutter: HTTP Requests, JSON Parsing, RESTful APIs

Data Persistence: SQLite, SharedPreferences, Hive

Asynchronous Programming with Dart: Futures, async/await, and Streams

3 Integrating Device Features: Camera, GPS, Sensors 9

Working with Firebase: Authentication, Firestore, Cloud Functions

Assignments/Projects:

Develop an app with state management and data persistence.

Milestone 3: Enhance the project with state management, data persistence,

and integration with a RESTful API or Firebase.

Industry Practices and App Deployment:

Advanced UI Components and Animations, App Security Best Practices,

Testing and Debugging Flutter Applications, Continuous
Integration/Continuous Deployment (CI/CD) with Flutter, Publishing Apps
4 9
to Google Play Store and Apple App Store, Industry Trends and Future of
Mobile Development with Flutter

Assignments/Projects:

Add advanced UI components and animations to the project, Implement

 security measures in the Flutter application, Conduct thorough testing and
debugging of the developed app.

Milestone 4: Complete the project, integrating all features and preparing it

for deployment.

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

Analyze
Key Actions: Differentiate, Organize, Attribute

Metrics and Examples:

1. Code Review and Refactoring:
a. Task: Students are given a piece of code to analyze and refactor for better
performance or readability.
b. Metric: Ability to identify inefficient or redundant code and provide optimized
solutions.
Example: Analyzing a complex UI widget tree and reorganizing it for better performance and
maintainability.

2. Design Pattern Identification:

a. Task: Students are asked to identify and apply appropriate design patterns for given
scenarios.
b. Metric: Correct identification and application of design patterns like Singleton,
Factory, or BLoC in their projects.
Example: Analyzing an app’s state management needs and choosing between Provider and
BLoC patterns.
 3. Bug Diagnosis:
a. Task: Students are given a buggy piece of code to analyze and debug.
b. Metric: Ability to use debugging tools and techniques to locate and fix bugs.
Example: Analyzing asynchronous code to identify and resolve race conditions or memory
leaks.

Evaluate
Key Actions: Check, Critique, Judge

Metrics and Examples:

1. Code Quality Assessment:
a. Task: Students review each other’s code and provide constructive feedback.
b. Metric: Ability to critically evaluate code quality based on readability, efficiency, and
adherence to best practices.
Example: Peer review sessions where students critique the structure and efficiency of each
other’s Flutter code.

2. UI/UX Design Evaluation:

a. Task: Students evaluate the user interface and user experience of their peers'
applications.
b. Metric: Ability to judge UI/UX designs based on usability, accessibility, and
aesthetics.
Example: Conducting usability testing sessions and providing feedback on navigation flow,
design consistency, and user engagement.

3. Project Presentation and Defense:

a. Task: Students present their projects and justify their design and implementation
choices
b. Metric: Ability to articulate design decisions, defend architectural choices, and
respond to critical questions.
Example: End-of-module presentations where students explain their choice of state
management, navigation strategy, and performance optimizations.

Integration into the Syllabus - Example Use Cases

Basic Mobile Application Development

 ● Analyze: Evaluate different mobile app architectures (MVC, MVVM, BLoC) and choose the
best fit for a given project scenario.
● Evaluate: Critically assess the setup and configuration of the Flutter development
environment for potential improvements.

User Interface Design and User Experience

● Analyze: Analyze the responsiveness and usability of designed UIs, identifying potential
bottlenecks.
● Evaluate: Critique the effectiveness of navigation and routing within the app.

Advanced Flutter Development

● Analyze: Break down the integration process of advanced features (state management,
networking) and evaluate their impact on app performance.
● Evaluate: Judge the robustness of data persistence solutions and asynchronous programming
implementations.

Industry Practices and App Deployment

● Analyze: Analyze the app’s security measures and their effectiveness in protecting user data.
● Evaluate: Evaluate the completeness and readiness of the app for deployment based on
industry standards and best practices.

Example Evaluation Rubrics

Analyze:

Criterion Excellent (4) Good (3) Satisfactory (2) Needs

Improvement (1)

Identification of Identifies all Identifies most Identifies some Struggles to

Code inefficiencies and inefficiencies and inefficiencies identify
Inefficiencies provides optimal provides good with basic inefficiencies or
solutions solutions solutions provide solutions

Application of Correctly applies Applies design Applies design Incorrectly

Design Patterns design patterns patterns with patterns with applies or fails to
with a clear minor issues significant issues apply design
rationale patterns
Evaluate:

Criterion Excellent (4) Good (3) Satisfactory (2) Needs

Improvement (1)

Code Quality Provides Provides good Provides basic Provides minimal

Assessment thorough, feedback with feedback with or unhelpful
insightful some constructive limited feedback
feedback with suggestions constructive
constructive suggestions
suggestions

UI/UX Design Provides detailed Provides good Provides basic Provides minimal
Evaluation critique with critique with critique with or no critique
actionable some actionable limited actionable
insights insights insights

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)
Explain mobile application development using Flutter and different
CO1 K2
mobile platforms.
Apply principles of effective mobile UI/UX design, Create responsive
CO2 K3
user interfaces using Flutter features.
Experiment effectively with state in Flutter application, networking
CO3 K4
and data persistence.
Apply security best practices in mobile app development, test, and
CO4 K5
debug Flutter applications effectively.
Set up CI/CD pipelines for Flutter projects and deploy mobile apps to
CO5 K5
Google Play Store and Apple App Store.
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 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
Sl. No Title of the Book Name of the Author/s
Publisher and Year
1 Flutter Cookbook Simone Alessandria Packt 2/e, 2023
2 Flutter for Beginners Alessandro Biessek Packt 1/e, 2019
 Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
1 Flutter in Action Eric Windmill Manning 1/e, 2019
Flutter and Dart: Up and Deepti Chopra, Roopal
2 BPB 1/e, 2023
Running Khurana
Managing State in Flutter
3 Waleed Arshad Packt 1/e, 2021
Pragmatically
Lahiru Rajeendra
4 Ultimate Flutter Handbook Orange House 1/e, 2023
Mahagamage

Video Links (NPTEL, SWAYAM…)

No. Link ID
1 https://www.youtube.com/watch?v=VPvVD8t02U8
 SEMESTER S6

FUNDAMENTALS OF CYBER SECURITY

Course Code PBCST604 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 teach the security terminologies along with familiarization of web-based attacks and the
vulnerability assessment tools for real time practices
2. To help learners to perform network analysis and learns the measures to handle security
bleaches at the system level
SYLLABUS

Module Contact
Syllabus Description
No. Hours

Information Security
Introduction, Threats to Information Systems, Cyber Security and Security
1 risk analysis, Information Gathering- Reconnaissance, Reco-ng, Software 10
Vulnerabilities- Buffer Overflow, Stack Overflow, Format String,
Vulnerability Assessment and Penetration Testing- Burpsuite, Metasploit.

Web Security
Web Attacks- SQL Injection Attacks, Cross-Site Scripting (XSS), Cross-Site
Request Forgery (CSRF), Domain Name System- Security Issues with DNS,
2 12
DNS attacks, DNSSEC, OWASP ZAP, WebGoat, Damn Vulnerable Web
Application (DVWA), Website Mirroring, HTTRACK, Email Security-
Email risks, Protocols, Operating safely when using email.

Network Security:
3 12
Network Security Terminologies, DoS, DDoS, ARP Spoofing and Session
 Hijacking, Capturing the Network Traffic- Promiscuous Mode, Flooding,
DHCP Redirection, Redirection and Interception with ICMP. Port Scanning-
TCP and UDP, Port Scanning Tools- Nmap, SuperScan, Wireshark-
Analysing and Filtering Traffic

System Security:

Windows Security: Attacks against windows system, Installing applications,

Authentication and access control, Upgrades and Patches, Operating
4 Windows safely, Windows Defender Firewall. 10

Linux Security- Attacks in Linux system, Physical security, Controlling the

configuration, Authentication and access control, Upgrades and Patches,
Operating Linux safely, SELinux.

Suggestion on Project Topics

Network Traffic Monitoring and Analysis using Wireshark:

● Development: Capture network traffic in a controlled environment using Wireshark.

● Security Analysis & Fixing: Analyze captured traffic to identify potential vulnerabilities
(e.g., plaintext passwords) and recommend security enhancements.

OWASP ZAP (Zed Attack Proxy) Security Testing Framework:

● Development: Create a web application with some common vulnerabilities.

● Security Analysis & Fixing: Use OWASP ZAP to perform security testing on the
application, identify vulnerabilities, and then fix these issues by implementing secure coding
practices.

Web Application Vulnerability Identification Using Burp Suite:

● Development: Develop a simple web application with common security flaws, such as
SQL injection, XSS, and broken authentication mechanisms.

● Security Analysis & Fixing: Use Burp Suite to scan the application, identify
vulnerabilities, and analyze the attack surface. Afterward, secure the application by fixing
these vulnerabilities and re-running the scan to verify the fixes.
Penetration Testing Framework Using Metasploit:

● Development: Set up a vulnerable virtual environment using tools like Metasploitable or

create your own vulnerable system or network services.

● Security Analysis & Fixing: Use Metasploit to exploit the system, demonstrate various
attacks like privilege escalation, and then apply patches, configuration changes, and security
best practices to mitigate the discovered vulnerabilities.

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 which 1

module. question should be answered. Each question can have a

● Total of 8 Questions, each maximum of 2 subdivisions. Each question carries 6 marks. 40

carrying 2 marks (4x6 = 24 marks)

(8x2 =16 marks)

 Course Outcomes (COs)

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

Bloom’s
Course Outcome Knowledge
Level (KL)

CO1 Use assessment tools for vulnerability testing K3

CO2 Use various security tools to study web based attacks K3

CO3 Identify the network based attacks using network monitoring tools K3
Illustrate the system security measures used for windows and Linux K2
CO4
operating 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 2 2 3 3 3

CO2 2 2 3 3 3

CO3 3 3 3 3 3

CO4 3 3 3 3 3

CO5 3 3 3 3 3

Text Books
Sl. Name of the Edition
Title of the Book Name of the Author/s
No Publisher and Year
1 Build Your Own Security Lab Michael Gregg Wiley 1/e, 2008
2 Network security and Cryptography B. Menezes Cengage 1/e, 2010
Chris Anley, John Heasman,
Shellcoder's Handbook: Discovering
3 Felix Lindner, Gerardo Wiley 2/e,2007
and Exploiting Security Holes
Richarte
Eric Cole, Ronald Krutz, Wiley
4 Network Security Bible 1/e, 2010
James W Conley
 Reference Books
Edition
Name of the Name of the
Sl. No Title of the Book and
Author/s Publisher
Year

1 Cryptography and Network Security Behrouz A Forouzan Tata McGraw-Hill.

3/e,2015

The Complete Reference:

2 Mark Rhodes-Ousley McGraw-Hill 2/e,2012
Information Security

Video Links (NPTEL, SWAYAM…)

Module No. Link ID

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

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

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

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 Feedback,
Testing
Brainstorming self-learning Project reformation (If
Sessions required)
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 S6

DATA STRUCTURES

Course Code OECST611 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. To provide the learner a comprehensive understanding of data structures and algorithms.

2. To prepare them for advanced studies or professional work in computer science and related
fields.

SYLLABUS
Module Contact
Syllabus Description
No. Hours
Basic Concepts of Data Structures

Definitions; Data Abstraction; Performance Analysis - Time & Space

1 Complexity, Asymptotic Notations; Polynomial representation using Arrays, 9

Sparse matrix (Tuple representation); Stacks and Queues - Stacks, Multi-
Stacks, Queues, Circular Queues;

Linked List and Memory Management

2 Singly Linked List - Operations on Linked List, Stacks and Queues using 9
Linked List, Polynomial representation using Linked List; Doubly Linked List.

Trees and Graphs

Trees :- Representation Of Trees; Binary Trees - Types and Properties, Binary

Tree Representation, Tree Operations, Tree Traversals; Binary Search Trees -
3 Binary Search Tree Operations; Graphs :- Definitions; Representation of 9
Graphs; Depth First Search and Breadth First Search.
 Sorting and Searching

Sorting Techniques :- Selection Sort, Insertion Sort, Quick Sort, Merge Sort;
4 9
Searching Techniques - Linear Search, Binary Search, Hashing - Hashing
functions : Division; Collision Resolution : Linear probing, Open hashing.

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.
carrying 3 marks ● Each question can have a maximum of 3 60
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)
Identify appropriate data structures for solving real world problems. K3
CO1
Describe and implement linear data structures such as arrays, linked
CO2 K3
lists, stacks, and queues.

Describe and Implement non linear data structures such as trees and
CO3 K3
graphs.

Select appropriate searching and sorting algorithms to be used in

CO4 K3
specific circumstances.

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
3 3 3 3
CO1
3 3 3 3
CO2
3 3 3 3
CO3
3 3 3 3
CO4
Note: 1: Slight (Low), 2: Moderate (Medium), 3: Substantial (High), -: No Correlation

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

Thomas H Cormen, Charles

2 Introduction to Algorithms Leisesrson, Ronald L PHI 3/e, 2009
Rivest, Clifford Stein

Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Prentice Hall
1 Classic Data Structures Samanta D. 2/e, 2018
India.
Aho A. V., J. E.
Pearson
2 Data Structures and Algorithms Hopcroft and J. D. 1/e, 2003
Publication.
Ullman
Introduction to Data Structures with Tremblay J. P. and P. G. Tata McGraw
3 2/e, 2017
Applications Sorenson Hill.
Theory and Problems of Data
4 Lipschuts S. Schaum’s Series 2/e, 2014
Structures

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
1 https://nptel.ac.in/courses/106102064
2 https://ocw.mit.edu/courses/6-851-advanced-data-structures-spring-2012/
 SEMESTER S6

DATA COMMUNICATION
(Common to CS/CM/CD/CA)

Course Code OECST612 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 details of data communication at the lower level and the associated issues.
2. To gain insight into the important aspects of data communication and computer networking
systems and to apply the in practical applications.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Communication model - Simplex, Half duplex, Full duplex transmission.
Periodic analog signals - Sine wave, Amplitude, Phase, Wavelength, Time
and frequency domain, Bandwidth. Analog & digital data and signals.
Transmission impairments - Attenuation, Delay distortion, Noise. Data rate
limits - Noiseless channel, Nyquist bandwidth, Noisy channel, Shannon's
1 10
capacity formula.
Guided transmission media - Twisted pair, Coaxial cable, Optical fiber.
Unguided media - Radio waves, Terrestrial microwave, Satellite microwave,
Infrared. Wireless propagation - Ground wave propagation, Sky wave
propagation, Line-of-Sight (LoS) propagation.
Digital data to digital signal – Non-Return-to-Zero (NRZ), Return-to-Zero
(RZ), Multilevel binary, Biphase. Analog data to digital signal - Sampling
2 9
theorem, Pulse Code Modulation (PCM), Delta Modulation (DM). Digital
data to analog signal - Amplitude Shift Keying (ASK), Frequency Shift
 Keying (FSK), Phase Shift Keying (PSK). Analog data to analog signal -
Amplitude Modulation (AM), Frequency Modulation (FM), Phase
Modulation (PM).
Multiplexing - Frequency Division Multiplexing (FDM), Wavelength
Division Multiplexing (WDM), Time Division Multiplexing (TDM),
Characteristics, Synchronous TDM, Statistical TDM. Spread spectrum
3 8
techniques - Direct Sequence Spread Spectrum (DSSS), Frequency Hopping
Spread Spectrum (FHSS), Code Division Multiplexing, Code Division
Multiple Access (CDMA).
Digital data communication techniques - Asynchronous transmission,
Synchronous transmission. Detecting and correcting errors - Types of errors,
4 Parity check, Checksum, Cyclic Redundancy Check (CRC), Forward Error 9
Correction (FEC), Hamming distance, Hamming code. Basic principles of
switching - Circuit switching, Packet switching, Message switching.

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)
Identify the characteristics of signals for analog and digital
CO1 K3
transmissions so as to define the associated real world challenges.
Select transmission media based on characteristics and propagation
CO2 K3
modes.
CO3 Choose appropriate signal encoding techniques for a given scenario K3
CO4 Illustrate multiplexing and spread spectrum technologies K2
Use error detection, correction and switching techniques in data
CO5 K3
communication
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
CO2 3 3 3 2 3
CO3 3 3 2 3
CO4 3 3 3 2 3
CO5 3 3 3 2 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
1 Data Communications and Networking Forouzan B. A McGraw Hill 6/e, 2019
2 Data and Computer Communication William Stallings Pearson 10/e, 2016
 Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
1 Mobile Communications Schiller J Pearson 2/e, 2009
Fundamentals of Networking
2 Curt M. White Cengage 7/e, 2010
and Communication

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
1 https://nptel.ac.in/courses/106105082
 SEMESTER S6

FOUNDATIONS OF CRYPTOGRAPHY

Course Code OECST613 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. Develop a foundational understanding of mathematical concepts in cryptography,

2. Gain comprehensive knowledge of cryptographic methods.
3. Understand the principles and need for computer security.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Integer Arithmetic – Divisibility, Greatest Common Divisor Euclid’s and
1 Extended Euclid’s Algorithm for GCD; Modular Arithmetic – Operations, 9
Properties, Polynomial Arithmetic; Algebraic Structures – Group Ring Field.
Prime numbers and Prime Factorisation - Primitive Roots, Existence of
Primitive Roots for Primes, Fermat’s Theorem, Primality Testing, Euler’s
2 9
Theorem, Euler’s Totient Function, Discrete Logarithms, Modular
Arithmetic, Chinese Remainder Theorem.
Principles of security - Types of Security attacks, Security services, Security
Mechanisms; Cryptography - Introduction, cryptographic notations,
3 9
substitution techniques, Transposition Techniques, limitations of classical
cryptography.
Symmetric key Ciphers - Block Cipher principles & Algorithms- DES, AES,
4 Differential and Linear Cryptanalysis; Asymmetric Key Ciphers- RSA, ECC; 9
Hash Functions - MD5, SHA-1.
 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)
Explain the integer arithmetic operations including divisibility and
GCD algorithms, modular arithmetic operations and properties,
CO1 K2
polynomial arithmetic, and algebraic structures such as groups, rings,
and fields.
Describe the number theory concepts essential for cryptographic
CO2 K2
applications and mathematical problem-solving.
Explain the security principles, types of attacks, and protective
CO3 measures, alongside a thorough understanding of cryptographic K2
techniques and their applications in securing data.
Discuss symmetric and asymmetric key cryptography, including block
CO4 cipher principles, algorithms, public key cryptosystems, and hash K2
functions
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
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
Cryptography & Network
1 Behrouz A. Forouzan McGraw Hill 3/e, 2007
Security
Charles P. Pfleeger, Shari L.
2 Security in Computing Prentice Hall 5/e, 2015
Pfleeger, Jonathan Margulies
Introduction to Cryptography:
3 H. Delfs, H. Knebl Springer 1/e, 2002
Principles and Applications
A Classical Introduction to
4 Cryptography: Applications for Serge Vaudenay Springer 1/e, 2009
Communications Security

Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Cryptography and Network
1 William Stallings Pearson Education 7/e,2017
Security

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
1 https://archive.nptel.ac.in/courses/111/101/111101137/
2 https://nptel/courses/video/106105031/L17.html
3 https://onlinecourses.nptel.ac.in/noc22_cs90/preview
 SEMESTER S6

MACHINE LEARNING FOR ENGINEERS

(Common to CS/CA/CD/CM/CR/AD/AM/AI)

Course Code OECST614 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 provide the basic concepts and algorithms in machine learning.

2. To discuss the standard and most popular supervised and unsupervised learning algorithms .
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 10
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

2 8
Generalisation and Overfitting - Idea of overfitting, LASSO and RIDGE
 regularization, Idea of Training, Testing, Validation

Evaluation measures – Classification - Precision, Recall, Accuracy, F-

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 8
propagation algorithm.

Decision Trees – Information Gain, Gain Ratio, ID3 algorithm

Unsupervised Learning

Clustering - Similarity measures, Hierarchical Clustering - Agglomerative

Clustering, partitional clustering, K-means clustering

Dimensionality reduction - Principal Component Analysis,

4 10
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 ● 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 and basic parameter estimation
CO1 K2
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
CO4 K3
techniques
Use appropriate performance measures to evaluate machine learning
CO5 K3
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 2
CO2 3 3 3 3 2 2
CO3 3 3 3 3 2 2
CO4 3 3 3 3 2 2
CO5 3 3 3 3 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
1 Introduction to Machine Learning Ethem Alpaydin MIT Press 2/e, 2010
Data Mining and Analysis: Mohammed J. Zaki, | Cambridge
2 1/e, 2016
Fundamental Concepts and Algorithms Wagner Meira University Press

Reference Books
Name of the Name of the Edition
Sl. No Title of the Book
Author/s Publisher and Year
1 Machine Learning Tom Mitchell McGraw-Hill 1997

2 Applied Machine Learning M Gopal Pearson 2/e, 2018

Neural Networks for Pattern

3 Christopher Bishop Oxford University Press 1995
Recognition
Machine Learning: A Probabilistic
4 Kevin P Murphy MIT Press 1/e, 2012
Perspective
Trevor Hastie,
The Elements Of Statistical
5 Robert Tibshirani, Springer 2/e, 2007
Learning
Jerome Friedman
 Video Links (NPTEL, SWAYAM…)
Module
Link ID
No.
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 S6

OBJECT ORIENTED PROGRAMMING

(Common to CS/CA/CD/CM/AM/AD)

Course Code OECST615 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 teach the core object-oriented principles such as abstraction, encapsulation, inheritance, and
polymorphism, robust error-handling using exception mechanisms to ensure program
reliability.
2. To equip the learner to develop object oriented programs encompassing fundamental
structures, environments, and the effective utilization of data types, arrays, strings, operators,
and control statements for program flow in Java.
3. To enable the learner to design and develop event-driven graphical user interface (GUI)
database applications using Swing and database connection components.
SYLLABUS

Module Contact
Syllabus Description
No. Hours

Introduction to Java - Java programming Environment and Runtime

Environment (Command Line & IDE); Java compiler; Java Virtual Machine;
Primitive Data types and Wrapper Types; Casting and Autoboxing; Arrays;
Strings; Vector class; Operators - Arithmetic, Bitwise, Relational, Boolean

1 Logical, Assignment, Conditional (Ternary); Operator Precedence; Control 10

Statements - Selection Statements, Iteration Statements and Jump
Statements; Functions; Command Line Arguments; Variable Length
Arguments; Classes; Abstract Classes; Interfaces; OOP Concepts - Data
abstraction, encapsulation, inheritance, polymorphism, Procedural and object
oriented programming paradigm; Microservices; Object Oriented
 Programming in Java - Declaring Objects; Object Reference; Introduction to
Methods; Constructors; Access Modifiers; this keyword.

Polymorphism - Method Overloading, Using Objects as Parameters,

Returning Objects, Recursion; Static Members, Final Variables, Inner
2 Classes. Inheritance - Super Class, Sub Class, Types of Inheritance, The 8
super keyword, protected Members, Calling Order of Constructors; Method
Overriding, Dynamic Method Dispatch, Using final with Inheritance.

Packages and Interfaces – Packages - Defining a Package, CLASSPATH,

Access Protection, Importing Packages; Interfaces - Interfaces v/s Abstract
classes, defining an interface, implementing interfaces, accessing
3 implementations through interface references, extending interface(s); 9
Exception Handling - Checked Exceptions, Unchecked Exceptions, try Block
and catch Clause, Multiple catch Clauses, Nested try Statements, throw,
throws and finally, Java Built-in Exceptions, Custom Exceptions.

Swings fundamentals – Overview of AWT, Swing v/s AWT, Swing Key

Features, Swing Controls, Components and Containers, Swing Packages,
Event Handling in Swings, Swing Layout Managers, Exploring Swings–
JFrame, JLabel, The Swing Buttons, JTextField; Event handling – Event
4 9
Handling Mechanisms, Delegation Event Model, Event Classes, Sources of
Events, Event Listener Interfaces, Using the Delegation Event Model;
Developing Database Applications using JDBC – JDBC overview, Types,
Steps, Common JDBC Components, Connection Establishment.

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 60
● 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 process of developing Java programs, including their structure

CO1 and components, to demonstrate proficiency. K2

Utilize object-oriented programming principles in the design and

CO2 implementation of Java applications. K3

Develop and manage Java packages and interfaces, enhancing code

CO3 modularity and reusability. K3

Implement error handling using Java's exception mechanisms and leverage

CO4 interfaces for modular applications. K3

CO5 Develop event-driven Java GUI applications with database connectivity. 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 3 3
CO2 3 3 3 3
CO3 3 3 3 3 3
CO4 3 3 3 3 3
CO5 3 3 3 3 3

Text Books
Name of the Edition and
Sl. No Title of the Book Name of the Author/s
Publisher Year
1 Java: The Complete Reference Herbert Schildt Tata McGraw Hill 13/e, 2024

2 Introduction to Java Programming,

Y Daniel Liang Pearson 10/e, 2014
Comprehensive Version
Eric Freeman, Elisabeth
3 Head First Design Patterns Robson, Bert Bates, O'Reilly Media 1/e, 2004
Kathy Sierra

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

1 Head First Java: A Brain Friendly Kathy Sierra & Bert

O’Reilly 3/e, 2022
Guide Bates
2 JAVA™ for Programmers Paul Deitel PHI 11/e, 2018

3 Clean Code : A Handbook of Agile Robert C. Martin Prentice Hall 1/e, 2008
Software Craftsmanship
4 Programming with Java E Balagurusamy McGraw Hill 6/e, 2019

5 Java For Dummies Barry A. Burd Wiley 8/e, 2022

6 Effective Java Joshua Bloch Pearson 3/e, 2018

 Video Links (NPTEL, SWAYAM…)
Modul
Link ID
e No.
1 https://nptel.ac.in/courses/106105191 (Lecture no: 9, 10, 1, 2, 3, 4)

2 https://nptel.ac.in/courses/106105191 (Lecture no: 1, 7, 8, 11, 12, 13, 14, 15, 16)

3 https://nptel.ac.in/courses/106105191 (Lecture no: 17, 18, 19, 20, 21, 22, 23, 24, 25, 26)

https://nptel.ac.in/courses/106105191
4
(Lecture no: 43, 44, 45, 46, 47, 50, 51, 52, 53, 54, 55)
 SEMESTER S6

SYSTEMS LAB

Course Code PCCSL607 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) None Course Type Lab

Course Objectives:

1. To introduce the fundamental concepts of compiler design, including lexical analysis, syntax
analysis, and code generation.
2. To equip students with practical skills to design and implement the components of a compiler
using tools like LEX and YACC.
3. To teach students the basic and advanced techniques of virtual machine instantiation and
management using open-source hypervisors / public cloud platforms.

Expt.
Experiments
No.

Design and implement a lexical analyzer using C language to recognize all valid tokens in
1 the input program. The lexical analyzer should ignore redundant spaces, tabs and
newlines. It should also ignore comments.

2 Write a lex program to display the number of lines, words and characters in an input text.

Generate a YACC specification to recognize a valid arithmetic expression that uses

3
operators +, – , *,/ and parenthesis.

4 Implementation of Calculator using LEX and YACC

5 Convert the BNF rules into YACC form and write code to generate abstract syntax tree.

6 Write a program to find First and Follow of any given grammar.

7 Design and implement a recursive descent parser for a given grammar.

8 Construct a Shift Reduce Parser for a given language.

9 Write a program to perform constant propagation.

 10 Implement Intermediate code generation for simple expressions.

Implement the back end of the compiler which takes the three address code and

produces assembly language instructions that can be assembled and run

11
using a corresponding assembler. The target assembly instructions can be simple move,
add, sub, jump etc.

Instantiation of VMs with image file using open-source hypervisors / public cloud
12
platforms.

13 Virtual machine Cluster set up using open-source hypervisors / public cloud platforms.

14 Setting host name for virtual machine nodes in cluster and ssh set up for remote login.

15 Copy a file from one virtual machine to another virtual machine.

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

Preparatory Execution of work/ valid 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 Implement lexical and syntax analyzer using the tools LEX and YACC K3
CO2 Develop Top-Down and Bottom-Up parsers. K3
CO3 Implement intermediate code for expressions. K3
CO4 Experiment with a cluster of virtual machines in a virtualized environment. K3

CO5 Demonstrate the data sharing and communication between virtual machines. K3
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 2 2 3 3 3 2 3
CO2 2 2 3 3 3 2 2 3
CO3 2 2 3 3 3 2 2 3
CO4 3 3 3 2 2 3
CO5 3 2 2 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
Keith D. Cooper Linda
1 Engineering a Compiler Katey Birtcher 3/e, 2023
Torczon
John R Levine, Tony O’Reilly Media,
2 Lex and Yacc 2/e, 2013
Mason& Doug Brown Inc
Distributed and Cloud Computing:
Kai Hwang, Jack Morgan
3 From Parallel Processing to the 1/e, 2018
Dongarra, Geoffrey C. Fox Kaufman
Internet of Things
Lambert
Manan Shah, Charusmita
4 Virtual Machines Academic 1/e, 2018
Shah
Publishing

Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Compilers Principles Aho A Ravi Sethi and J
1 Addison Wesley 2/e, 2013
Techniques and Tools D Ullman
Compiler Construction Cenage Learning
2 Kenneth C Louden 1/e, 2007
Principles and Practice Indian Edition
System programming and Tata McGraw Hill &
3 D M Dhamdhare 1/e, 2013
operating system Company
The Theory and Practice of Tata McGraw Hill &
4 Tremblay and Sorenson 1/e, 1985
Compiler Writing Company

Video Links (NPTEL, SWAYAM…)

No. Link ID

1 https://archive.nptel.ac.in/courses/106/105/106105190/

2 https://www.virtualbox.org/
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
COMPUTER SCIENCE AND
ENGINEERING
 SEMESTER S7

FORMAL METHODS IN SOFTWARE ENGINEERING

(Common to CS/CR/CM/CA/AD/AM)

Course Code PECST741 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. To enable the learners to apply formal methods for modelling, validation, and verification of
software systems.
2. To familiarize with a series of advanced tools that address challenges faced in design, coding,
and verification.
3. To provide an introduction to the theoretical aspects of these tools, as well as hands-on
exploration.
SYLLABUS

Module Contact
Syllabus Description
No. Hours
Introduction :-
Stages in software development; software defects –causes of software defects;
1 9
techniques for dealing with software defects-Testing and verification, formal
methods and tools.
Ensuring reliability in the design phase :-
Conceptual modelling, the tool Alloy, conceptual modelling in Alloy,
2 9
Analysing Alloy models, Fixing bugs in modelling, How Alloy works? Show
that the Konigsberg Bridge Problem has no solution.
Verification by Model Checking :-

3 Verifier for Concurrent C (VCC): a Hoare-Triple- based tool for Verifying 9

Concurrent C, intra procedure verification of programs, ghost statements.
Program Verification:-

4 Inter-procedure verification of programs in VCC, function contracts, pure 9

functions, loop invariants, proving total correctness of programs in VCC.
 Course Assessment Method
(CIE: 40 marks, ESE: 60 marks)
Continuous Internal Evaluation Marks (CIE):
Internal Internal
Assignment/Micro
Attendance project
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

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)
CO1 Explain the need and use of formal methods and tools in software engineering. K2
CO2 Demonstrate conceptual modelling of systems using Alloy. K3
Illustrate the process of proving correctness of code using Hoare-Triple based
CO3 K3
weakest precondition analysis
CO4 Demonstrate program verification using VCC. 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 - - - - - - - - - -

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

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

CO4 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
1 Software Abstractions Daniel Jackson MIT Press 2011

Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Verifying C Programs: A E. Cohen, M. A.,
1 VCC Tutorial, Working draft, Hillebrand, S. Tobies, 2015
version 0.2 M. Moskal, W. Schulte
The VCC Manual, Working
2 2016.
draft, version 0.2

Links

No. Link ID
1 Tutorial for Alloy Analyzer 4.0 https://alloytools.org/tutorials/online/
 SEMESTER S7

WEB PROGRAMMING
(Common to CS/CA/CM/CD/CR/AD/AM)

Course Code PECST742 CIE Marks 40

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

Credits 3 Exam Hours 2 Hrs. 30 Min.

Prerequisites (if any) None/ Course Type Theory

Course Objectives:
1. To equip students with the knowledge and skills required to create, style, and script web
pages using HTML5, CSS, JavaScript, and related technologies.
2. To provide hands-on experience with modern web development tools and frameworks such as
React, Node.js, JQuery, and databases, enabling students to design and build dynamic,
responsive, and interactive web applications.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Creating Web Page using HTML5 - Introduction, First HTML5 example,
Headings, Linking, Images, Special Characters and Horizontal Rules, Lists,
Tables, Forms, Internal Linking, meta Elements, HTML5 Form input Types,
Input and datalist Elements and autocomplete Attribute, Page-Structure
Elements; Styling Web Page using CSS - Introduction, Inline Styles,

1 Embedded Style Sheets, Linking External Style Sheets, Positioning Elements:, 9

Absolute Positioning, z-index, Positioning Elements: Relative Positioning,
span, Backgrounds, Element Dimensions, Box Model and Text Flow, Media
Types and Media Queries, Drop-Down Menus; Extensible Markup Language
- Introduction, XML Basics, Structuring Data, XML Namespaces, Document
Type Definitions (DTDs), XML Vocabularies
Scripting language - Client-Side Scripting, Data Types, Conditionals, Loops,
Arrays , Objects , Function Declarations vs. Function Expressions , Nested

2 Functions , The Document Object Model (DOM) - Nodes and NodeLists, 9

Document Object, Selection Methods, Element Node Object, Event Types
Asynchronous JavaScript and XML - AJAX : Making Asynchronous
 Requests , Complete Control over AJAX , Cross-Origin Resource Sharing
JavaScript library - jQuery - jQuery Foundations - Including jQuery, jQuery
Selectors, Common Element Manipulations in jQuery, Event Handling in
jQuery
JavaScript runtime environment : Node.js - The Architecture of Node.js,
Working with Node.js, Adding Express to Node.js; Server-side programming
language : PHP - What Is Server-Side Development? Quick tour of PHP,
Program Control , Functions , Arrays , Classes and Objects in PHP , Object-
3 9
Oriented Design ; Rendering HTML : React - ReactJS Foundations : The
Philosophy of React, What is a component? Built- in components, User-
defined components - Types of components, Function Components,
Differences between Function and Class Components
SPA – Basics, Angular JS; Working with databases - Databases and Web
Development, SQL, Database APIs, Accessing MySQL in PHP; Web
Application Design - Real World Web Software Design, Principle of Layering
4 9
, Software Design Patterns in the Web Context, Testing; Web services -
Overview of Web Services - SOAP Services, REST Services, An Example
Web Service, Web server - hosting options

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)
Develop structured web pages with HTML5 and style them using CSS
CO1 K3
techniques, including positioning, media queries, and the box model.
Write client-side scripts using JavaScript and utilize jQuery for DOM
CO2 manipulation, event handling, and AJAX requests to create responsive K3
and interactive user interfaces.
Build and deploy server-side applications using Node.js, Express, and
CO3 PHP, and integrate databases using SQL to store and retrieve data for K3
dynamic content generation.
Utilize React for building component-based single-page applications
(SPAs), understanding the fundamental principles of component
CO4 K3
architecture, and leveraging AngularJS for web application
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 3 3 - 3 - - - - - - 3

CO2 3 3 3 - 3 - - - - - - 3

CO3 3 3 3 - 3 - - - - - - 3

CO4 3 3 3 - 3 - - - - - - 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
Randy Connolly, Ricardo
1 Fundamentals of Web Development Pearson 1/e, 2017
Hoar
Building User Interfaces with
2 Chris Minnick Wiley 1/e, 2022
ReactJS - An Approachable Guide
Internet & World Wide Web - How Paul J. Deitel, Harvey M.
3 Pearson 1/e, 2011
to Program Deitel, Abbey Deitel
SPA Design and Architecture:
Manning
4 Understanding Single Page Web Emmit Scott 1/e, 2015
Publications
Applications
 Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
A Hand Book On Web
1 Development : From Basics of Pritma Jashnani Notion press 1/e, 2022
HTML to JavaScript and PHP
Advanced Web Development
2 Mohan Mehul BPB 1/e, 2020
with React
JavaScript Frameworks for Tim Ambler, Sufyan bin
3 Apress 1/e, 2019
Modern Web Development Uzayr, Nicholas Cloud

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
1 https://archive.nptel.ac.in/courses/106/106/106106222/
2 https://archive.nptel.ac.in/courses/106/106/106106156/
 SEMESTER S7

BIOINFORMATICS

Course Code PECST743 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 in Molecular Biology, Genomics, Proteomics and

Modelling.
2. To introduce bio macromolecules such as genes and proteins, different biological databases,
and tools and algorithms for biological data processing, analysis and interpretation, and the
elements of the systems approach to Molecular Biology.

SYLLABUS

Contact
Module Syllabus Description
Hours
Molecular Biology Primer (3 hours)
Genes, DNAs, RNAs, Proteins, Genomics, Sequencing techniques,
Bioinformatics overview and scope

1 Sequence Alignment (6 hours) 9

Global and local sequence alignment-dynamic programming algorithms, edit
distance, similarity, Needleman Wunsch Algorithm, Smith Waterman
Algorithm
Biological Databases and Data Formats (3 hours)
Genomic and Sequence Data Formats, GenBank, EMBL-Bank, and DDBJ,
PROSITE, NCBI- Database Searching: BLAST, FASTA
2 9
Phylogenetics (6 hours)
Phylogenetic Tree basics and Construction Methods, UPGMA, Neighbour
joining, Parsimonous trees, Additive trees, Bootstrapping
Combinatorial Pattern Matching (9 hours)

3 Combinatorial Pattern Matching, Repeat finding, Keyword Trees, Suffix 9

Trees, Heuristic similarity search algorithms, Approximate Pattern Matching
 R FOR BIOINFORMATICS
Variables, Data types, control flow constructs, String manipulation, Pattern
Matching, arrays, lists and hashes, File handling, Programs to handle
biological data and parse output files for interpretation, packages for sequence
alignment, FASTA, BLAST (Bioconductor, msa, Biostrings etc.) 9
4
Indicative Laboratory/Microproject Tasks
Biological Databases, Sequence alignment: BLAST family of programs,
FASTA, ClustalW for multiple sequence alignment, Phylogenetics software,
Homology Modeling and Model evaluation, Related Programs in R.

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 Bioinformatics K2
Use various biological databases and apply sequence alignment
CO2 K3
techniques
Use molecular phylogenetics to identify evolutionary relationships
CO3 K3
among various biological species
CO4 Apply the concept of combinatorial pattern matching in bioinformatics K3

CO5 Use R language and packages to solve bioinformatics problems 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 3 - - - - - - - - 2

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

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

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

CO5 3 3 3 3 3 - - - - - - 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
1 An Introduction to Bioinformatics N. C. Jones and P.
MIT Press, 2004 1/e, 2004
Algorithms, A. Pevzner,
Bioinformatics for Beginners: Genes,
2 Genomes, Molecular Evolution, Supratim Choudhuri Academic Press 1/e, 2014
Databases and Analytical Tools
3 R Programming for Bioinformatics Robert Gentleman CRC Press 1/e, 2009
 Reference Books
Name of the Name of the Edition
Sl. No Title of the Book
Author/s Publisher and Year
T. K. Attwood and D.
1 Introduction to Bioinformatics Pearson Education 1/e, 2003
J. Parry-Smith,
B. Junker and F.
2 Analysis of Biological Networks, Wiley Publishers 1/e, 2007
Schreiber,
Heterogeneous Information
Y. Sun and J. Han, Morgan & Claypool
3 Networks - Principles & 1/e, 2012
Mining Publishers
Methodologies
Cambridge
4 Multilayer Social Networks, M. E. Dickison et al, 1/e, 2016
University Press

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
1 https://archive.nptel.ac.in/courses/102/106/102106065/
2 https://onlinecourses.swayam2.ac.in/cec21_bt04/preview
 SEMESTER S7

INFORMATION SECURITY
(Common to CS/CM/CA/AM)

Course Code PECST744 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) PECST637 Course Type Theory

Course Objectives:
1. To learn the essentials of confidentiality, integrity and apply access control mechanisms to the
user information
2. To understand threats and Vulnerabilities and design security frameworks
3. To learn how to maintain the accuracy and completeness of data as it is transmitted over the
network with total security

SYLLABUS
Module Contact
Syllabus Description
No. Hours
Introduction to Information Security - CIA triad , OSI Security Architecture,
Security Goals, Security Services and Mechanisms, Threats, Attacks-
Malicious code, Brute force, Timing attack, Sniffers;
1 9
Access Control Mechanisms - Access Control, Access control matrix, Access
control in OS-Discretionary and Mandatory access control, Role-based access
control.
Software Vulnerabilities - Buffer and Stack Overflow, Cross-site Scripting
(XSS) and vulnerabilities, SQL Injection and vulnerabilities, Phishing;
2 9
Malwares - Viruses, Worms and Trjans, Topological worms, Trapdoors,
Salami attack, Man-in-the-middle attacks, Covert channels.
Introduction to security of information storage - Processing, and
Transmission. Information Security Management - The ISO Standards relating
to Information Security - Other Information Security Management

3 Frameworks - Security Policies - Security Controls - The Risk Management 9

Process - Regulations and legal frameworks; Authentication - User
Authentication, Token Based, Biometric Authentication, Remote User
Authentication, Multifactor Authentication.

4 Security in Networks - Threats in networks, Network Security Controls - 9

 Architecture, Encryption, Content Integrity, Strong Authentication, Access
Controls, Wireless Security, Honeypots, Traffic flow security, Firewalls –
Design and Types of Firewalls, Personal Firewalls, IDS, Email Security –
PGP, S/MIME.

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)
CO1 Explain the goals, services and mechanisms related to information security. K2
Identify the different types of threats and attacks and the design strategies to
CO2 K2
mitigate the attacks
Describe the information security practices within an organization, ensuring data
CO3 K2
protection and compliance with industry standards and legal requirements.
Discuss the skills to enhance network security, protect data in transit, and
CO4 K2
respond to potential threats effectively
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

CO2 3 3 3 3

CO3 3 3 3 3

CO4 3 3 3 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
1 Network security and Cryptography B. Menezes Cengage 1/e, 2010

2 Cryptography And Network Security

William Stallings Pearson 5/e, 2011
Principles And Practice

Reference Books
Sl. Name of the Edition
Title of the Book Name of the Author/s
No Publisher and Year
Cryptography and Network Security B. A. Forouzan, D.
1 Mukhopadhyay
McGraw Hill 3/e, 2015

2 Network Security Essentials:

William Stallings Prentice Hall. 4/e, 2011
Applications and Standards
3 Information System Security Nina Godbole Wiley 2/e, 2017

Video Links (NPTEL, SWAYAM…)

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

2 https://nptel.ac.in/courses/106106199
 SEMESTER S7

EMBEDDED SYSTEMS
(Common to CS/CM/AM)

Course Code PECST746 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 provide a strong foundation in embedded systems, including the architecture, components,
and design principles.
2. To equip learners with the skills needed to design, develop, and integrate embedded systems
using microcontrollers, especially 8051.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Introduction to Embedded Systems:-
Definition of Embedded System, Embedded Systems Vs General Computing
Systems, History, Classification, and, Major application areas of Embedded

1 Systems, Purpose of Embedded Systems; Typical system - Core of the 9

Embedded System, Memory, Sensors and Actuators, Communication
Interface, Embedded Firmware, Other System components; Characteristics
and Quality attributes of Embedded Systems.
Designing with 8051 : -
Factors to be Considered in Selecting a Controller, Why 8051
Microcontroller, Designing with 8051, The 8052 Microcontroller, 8051/52

2 Variants; Different Addressing Modes Supported by 8051; The 8051 9

Instruction Set; Fundamental Issues in Hardware Software Co-Design;
Computational Models in Embedded Design; Introduction to Unified
Modelling Language (UML); Hardware Software Trade-offs.
Design and Development :-
Hardware Design and Development - VLSI and Integrated Circuit Design,
3 9
Recap of Electronic Design Automation (EDA) Tools, The PCB Layout
Design, Printed Circuit Board (PCB) Fabrication; Firmware Design and
 Development - Embedded Firmware Design, Embedded Firmware
Development Languages, Programming
in Embedded C.
Integration and Testing of Embedded Hardware and Firmware :-
Integration of Hardware and Firmware, Boards Bring up, The Embedded
System Development Environment - The Integrated Development
4 9
Environment (IDE), Types of files generated on CrossCompilation,
Disassembler/Decompiler, Simulators, Emulators and Debugging, Target
Hardware Debugging, Boundary Scan.

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)
Explain the core components, characteristics, and applications of
CO1 K2
embedded systems, and their difference from general computing systems
Apply knowledge of the 8051 microcontroller, its architecture, instruction
CO2 K3
set, and addressing modes, to design and develop embedded systems.
Develop embedded firmware using appropriate languages, and understand
CO3 K3
the key concepts in hardware-software co-design.
Use the integration of embedded hardware and firmware, and utilize tools
CO4 K3
for system testing and validation
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 3 3

CO3 3 3 3 3 3 3

CO4 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
Introduction to Embedded
1 Shibu K V McGraw Hill 2/e, 2017
Systems
 Reference Books
Name of the Name of the Edition
Sl. No Title of the Book
Author/s Publisher and Year
Embedded Systems Architecture,
1 Raj Kamal McGraw Hill 3/e, 2017
Programming and Design
Embedded Systems Design- A Unified Frank Vahid, Tony
2 Wiley 1/e, 2006
Hardware/Software Introduction Givargis
3 Embedded Systems Lyla B Das Pearson

Video Links (NPTEL, SWAYAM…)

No. Link ID
1 https://nptel.ac.in/courses/108102045
 SEMESTER S7

BLOCKCHAIN AND CRYPTOCURRENCIES

Course Code PECST747 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) PBCST604 Course Type Theory

Course Objectives:

1. To provide a comprehensive understanding of blockchain architecture, elements, types

(public, private, consortium), and industry applications.
2. To help the learners to assess strengths and weaknesses of various blockchain consensus
mechanisms (e.g., Proof of Work, Proof of Stake, Practical Byzantine Fault Tolerance).
3. To enable learners to use blockchain real-world applications in government, healthcare,
finance, and supply chain management, identifying implementation opportunities and
challenges.
SYLLABUS

Module Contact
Syllabus Description
No. Hours
Blockchain Fundamentals

Introduction, Blockchain Definition, Deciphering the Blockchain, Features

1 7
and challenges of Blockchain, Applications in Blockchain, Decentralisation,
Distributed Ledger Technology, Blockchain variants.

Cryptography in Blockchain and Consensus Mechanisms

Concept of Hashing, Creating a Transaction Hash, Merkle Trees -

Importance of Merkle tree, Chaining of Blocks, Building the Network,
2 Accessing the network, Types of Wallets. 9
Need for Consensus, Two Generals’ Problem, Byzantine Generals’ Problem,
Byzantine Fault Tolerance (BFT), Practical Byzantine Fault Tolerance
(PBFT)- working, Paxos and Raft Algorithms.

Cryptocurrencies - Bitcoin and Ethereum

3 10
Bitcoin: Components, Nodes in Bitcoin network, Transactions and memory
 pools, Proof of Work-Mining Cryptocurrencies, Hard and Soft Forks,
Tracking Bitcoins-Unspent Transaction Outputs.

Ethereum: Transition from Bitcoin to Ethereum, Concept of Ethereum World

Computer, Ethereum Virtual Machine, Ethereum Network, Transition from
PoW to PoS- Working of PoS, Smart Contracts in Ethereum, Decentralised
Applications in Ethereum, Tools used in Ethereum.

Blockchain Ethereum Platform using Solidity and Use Cases in

Blockchain :-

Solidity Language - Remix IDE, Structure of a Smart Contract Program,

Modifiers, Events, Functions, Inheritance, External Libraries, Error

4 Handling. 10
Permissioned Blockchains, Introduction to Hyperledger Foundation,
Hyperledger Distributed Ledger frameworks, Hyperledger Fabric.

Use Cases in Blockchain - Finance, Education, Government, Healthcare and

Supply Chain Management.

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)
CO1 Explain the fundamental concepts of Blockchain technology. K2
Illustrate the cryptographic building blocks of Blockchain technology
CO2 K2
and understand the consensus mechanisms.
Explain the concepts of cryptocurrency bitcoin, mining processes, and
CO3 K2
wallet management.
Use the concepts of Ethereum platform and understand the use cases of
CO4 K3
blockchain technology
Develop skills in designing and deploying simple applications using
CO5 K3
Solidity language.
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 3 2

CO5 3 3 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
Blockchain Technology: Asharaf S, Sivadas Neelima,
1 Wiley 1/e, 2023
Algorithms and Applications Adarsh S, Franklin John
Chandramauoli
Universities
2 BlockchainTechnology Subrahmaniyan, Asha A 1/e ,2020
Press.
George
 Reference Books
Name of the Name of the Edition
Sl. No Title of the Book
Author/s Publisher and Year

Blockchain Technology - Concepts and Kumar Saurabh,

1 Wiley 1/e, 2020
Applications. Ashutosh Saxena

Packt
2 Mastering Blockchain Imran Bashir 1/e, 2020
Publishing
Solidity programming Essentials: A
Packt
3 beginner's guide to build smart contracts Ritesh Modi 1/e, 2018.
Publishing
for Ethereum and blockchain

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
1 https://youtube.com/playlist?list=PLrKK422S1aMma8lDA2JJjEUpC2ycuApuC&si=1OXTYDEZ4
A5M8M4Q
2 https://youtube.com/playlist?list=PLHRLZtgrF2jl8yqucJsMFqh5XpRLTgCI4
3 https://youtube.com/playlist?list=PL6gx4Cwl9DGBrtymuJUiv9Lq5CAYpN8Gl
4 https://youtube.com/playlist?list=PLWUCKsxdKl0oksYr6IG_wRsaSUySQC0ck
 SEMESTER S7

REAL TIME SYSTEMS

(Common to CS/CM/CA/AM)

Course Code PECST748 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) PCCST402, PCCST403 Course Type Theory

Course Objectives:
1. To enable the learners to familiarize with the concepts of Real Time systems
2. To teach different task scheduling algorithms in uniprocessor and multiprocessor environments.
3. To learn the features of real-time communications, real-time databases and real time OS.

SYLLABUS
Module Contact
Syllabus Description
No. Hours
Introduction to Real-Time systems: Basic concepts, applications of Real-Time
systems, basic model of Real-Time systems, characteristics of Real-Time
1 6
systems, types of Real-Time systems: hard, firm, soft, timing constraints,
modelling timing constraints.
Real-Time task scheduling: Basic concepts, clock driven scheduling, table
driven scheduling, cyclic, schedulers, hybrid schedulers, event driven
scheduling, EDF Scheduling, RMA, DMA, resource sharing among RT tasks,

2 Priority inversion, Priority Inheritance Protocol, Highest Locker Protocol, 12

Priority Ceiling Protocol, Scheduling Real-Time tasks in multiprocessor and
distributed systems, Fault tolerant scheduling of tasks, clocks in distributed
Real-Time systems.
Commercial Real-Time Operating Systems: Time services, Features of real-
time operating systems, UNIX and Windows as RTOS, POSIX, PSOS, VRTX,
3 8
QNX, RT Linux, Lynx, other RTOS, benchmarking RT OS, Real-Time OS: OS
services, I/O subsystem, Network OS.
RT communications: QoS framework, models, Real-Time Communication in a
LAN, IEEE 802.4, RETHER, Communication over Packet Switched Networks,

4 Routing algorithms, RSVP, rate control; RT databases - Applications, 10

characteristics of temporal data, Concurrency control, Commercial RT
databases, Special topics in Real-Time 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
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 various Real Time applications, services, design considerations
CO1 K2
and architectures
Develop efficient algorithms for real-time task scheduling in uniprocessor and
CO2 K3
multiprocessor environments
Identify the limitations of a non real-time operating system in running a real-
CO3 K2
time application
CO4 Identify and address the important issues in real-time communications K2
CO5 Understand the concepts of use real-time databases 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 3

CO2 3 3 3 3

CO3 3 3 2 3

CO4 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 Name of the Edition
Sl. No Title of the Book
Author/s Publisher and Year
1 Real-Time Systems: Theory and Practice Rajib Mall Pearson Education, 1/e, 2007
2 Real-Time Systems Jane W. S. Liu Pearson Education, 3/e, 2009

Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Real-Time Systems Design and Philip A. Laplante,
1 Wiley 1/e, 2012
Analysis, Wiley Seppo J. Ovaska

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
1, 2, 3, 4 https://onlinecourses.nptel.ac.in/noc22_cs104/preview
 SEMESTER S7
APPROXIMATION ALGORITHMS

Course Code PECST749 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. To provide a deep understanding of approximation algorithms, including their design, analysis,
and application to various optimization problems.
2. To equip the skills to evaluate and analyze the efficiency and effectiveness of approximation
techniques. This includes understanding performance metrics, approximation ratios, and the
theoretical limits of approximation algorithms, as well as applying these techniques to complex
problems in network design, combinatorial optimization, and other areas.
SYLLABUS

Module Contact
Syllabus Description
No. Hours
Basics of Approximation Algorithms - Introduction to approximation
algorithms, Performance guarantees: approximation ratio and factor,
Examples of approximation problems. (Chapter 1)

1 Greedy Algorithms - Introduction to greedy algorithms, Set cover problem, 9

Vertex cover problem. (Chapter 2)
Local Search Algorithms - Local search techniques, k-Median and k-Center
problems, Analysis of local search algorithms. (Chapter 3)
Linear Programming Relaxation - Introduction to linear programming (LP),
LP relaxation of combinatorial problems, Primal-dual method. (Chapter 4)
Rounding Techniques - Randomized rounding, Deterministic rounding,
2 9
Applications to various problems. (Chapter 5)
Integer Programming and Cutting Planes - Integer programming formulation,
Cutting plane methods, Applications in network design. (Chapter 6)
Semi-Definite Programming - Introduction to semi-definite programming
(SDP), Goemans-Williamson algorithm for MAX-CUT, Other applications
3 9
of SDP. (Chapter 8)
Approximation Schemes - Polynomial-time approximation schemes (PTAS),
 Fully polynomial-time approximation schemes (FPTAS), Examples:
knapsack problem, Euclidean TSP. (Chapter 9)
Inapproximability Results - Introduction to inapproximability, Reductions
and hardness of approximation, PCP theorem and its implications. (Chapter

4 10) 9
Network Design Problems - Steiner tree problem, Traveling Salesman
Problem (TSP), Multicommodity flow problem. (Chapter 7)

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)
Demonstrate a foundational understanding of approximation
CO1 algorithms, including performance guarantees, approximation ratios, K3
and common examples of approximation problems.
Illustrate the principles of greedy algorithms and apply them to solve
CO2 classic problems such as the set cover and vertex cover problems, K3
understanding their efficiency and limitations.
Show proficiency in local search algorithms and linear programming
CO3 relaxation methods, including the primal-dual method, and apply these K3
techniques to solve combinatorial optimization problems.
Understand and implement rounding techniques, both randomized and
deterministic, and learn the basics of semi-definite programming
CO4 K3
(SDP), including algorithms like Goemans-Williamson for the MAX-
CUT problem.
Demonstrate polynomial-time approximation schemes (PTAS) and
fully polynomial-time approximation schemes (FPTAS), and explore
CO5 K3
inapproximability results, including reductions, hardness of
approximation, and the PCP theorem.
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 2

CO2 3 3 3 3 2

CO3 3 3 3 3 2

CO4 3 3 3 3 2

CO5 3 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 Approximation Algorithms Vijay V. Vazirani Springer Nature (SIE) 2/e, 2013
 Reference Books
Edition
Name of the
Sl. No Title of the Book Name of the Author/s and
Publisher
Year
The design of approximation David Williamson and Cambridge
1 1/e, 2011
algorithms David Shmoys University Press
Rajeev Motwani and Cambridge
2 Randomized Algorithms 1/e, 2004
Prabhakar Raghavan University Press
Probability and Computing:
Randomization and Probabilistic Michael Mitzenmacher and Cambridge
3 3/e, 2017
Techniques in Algorithms and Data Eli Upfal University Press
Analysis
Thomas H. Cormen, Charles
4 Introduction to Algorithms E. Leiserson, Ronald L. The MIT Press 4/e, 2023
Rivest and Clifford Stein
Noga Alon and Joel H.
5 The Probabilistic Method Wiley-Blackwell 4/e, 2016
Spencer
Computational Complexity: A Sanjeev Arora and Boaz Cambridge
6 1/e, 2019
Modern Approach Barak University Press

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
1 https://nptel.ac.in/courses/106105471
2 https://nptel.ac.in/courses/106105471
3 https://nptel.ac.in/courses/106105471
4 https://nptel.ac.in/courses/106105471
 SEMESTER S7

COMPUTER VISION

Course Code PECST745 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 cover the basics of image formation, key computer vision concepts, methods, techniques,
pattern recognition, and various problems in designing computer vision and object
recognition systems.
2. To enable the learners to understand the fundamentals of computer vision and machine
learning models to develop applications in computer vision.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Fundamentals in Computer Vision :-

Camera Calibration- Pinhole camera model, Geometric Image Features -

Curves, Surfaces, Analytical Image Features - Elements of Analytical

1 Euclidean Geometry, Geometric Camera Parameters, 9

Stereopsis - Binocular Camera Geometry, Epipolar Constraint, Binocular
Reconstruction, Local Methods for Binocular Fusion, Global Methods for
Binocular Fusion.

Features and Filters :-

Linear Filters- Linear Filters and Convolution, Shift Invariant Linear

Systems. Estimating Derivatives with Finite Differences, Noise, Edges and

2 Gradient-based Edge Detectors 9

Image Gradients - Computing the Image Gradient, Gradient Based Edge and
Corner Detection. Filters as Templates - Normalized Correlation and Finding
Patterns.
 Machine Learning for Computer Vision :-

Machine Learning - Introduction, Dataset for Machine Perception- Labelled

and Unlabelled Data, Basics of Classification and Clustering, Multi-Class
Perspective.

Machine Learning for Computer Vision -Machine Learning -Deep Learning

3 9
Use Cases.

Machine Learning Models for Vision - Image Vision-Pretrained Model,

Transfer Learning, Fine-Tuning, Convolutional Networks, Convolutional
Filters, Stacking Convolutional Layers, Pooling Layers - AlexNet, VGG19, ,
Modular architecture - ResNet, Neural Architecture Search Design - NASNet

Segmentation and Object detection :-

Segmentation Using Clustering Methods - Human vision- Grouping and

Gestalt, Applications- Shot Boundary Detection, Background Subtraction,
Image Segmentation by Clustering Pixels- Simple Clustering Methods,
Clustering and Segmentation by K-means
4 9
Object detection - YOLO, Segmentation-Mask R-CNN and Instance
Segmentation, U-Net and Semantic Segmentation, Model Quality Metrics

A case study to compare performance of various models on a suitable

dataset.

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)
Understand the basic concepts and terminologies like Camera
CO1 K2
Calibration, Stereopsis in computer vision
CO2 Apply filters for feature extraction and for finding patterns. K3
CO3 Build different machine learning models for computer vision K3
CO4 Implement segmentation and object detection models K3
Analyze different machine learning models for segmentation/object
CO5 K4
detection.
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

CO2 3 3 3 3

CO3 3 3 3 3

CO4 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
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Computer vision: A modern Forsyth, David, and Jean
1 Prentice hall 2011
approach Ponce
Emerging topics in computer Medioni, Gerard and Sing
2 PHI 2004
vision Bing Kang
Valliappa Lakshmanan,
Practical Machine Learning for
3 Martin Görner, Ryan O'Reilly Media 2021
Computer Vision
Gillard

Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Computer vision: algorithms Springer Science &
1 Szeliski, Richard 2010
and applications Business Media
Image Segmentation:
2 Principles, Techniques, and Tao Lei, Asoke K. Nandi John Wiley & Sons 2022
Applications
Deep Learning in Computer
Ali Ismail Awad,
3 Vision Principles and CRC Press 2020
Mahmoud Hassaballah
Applications

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
Computer Vision and Image Processing - Fundamentals and Applications by Prof. M. K.
1
Bhuyan at IIT Guwahati https://onlinecourses.nptel.ac.in/noc23_ee39/preview
2 Computer Vision by Prof. Jayanta Mukhopadhyay at IIT Kharagpur
3 https://onlinecourses.nptel.ac.in/noc19_cs58/preview
Deep Learning for Computer Vision by Prof. Vineeth N Balasubramanian at IIT Hyderabad
4
https://onlinecourses.nptel.ac.in/noc21_cs93/preview
COVID-Net Open Source Initiative - COVIDx CT-3 Dataset
https://www.kaggle.com/datasets/hgunraj/covidxct
 SEMESTER S7

TOPICS IN THEORETICAL COMPUTER SCIENCE

Course Code PECST795 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.
PCCST303
Prerequisites (if any) PCCST502 Course Type Theory

Course Objectives:
1. To understand and apply spectral graph theory techniques to analyze and solve complex graph
problems, such as community detection and network design, through detailed study and
hands-on assignments.

2. To develop and evaluate LP- and SDP-based approximation algorithms for NP-hard
problems, including real-world applications like scheduling and optimization, by
implementing these algorithms and assessing their performance in practical scenarios

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Spectral Graph Theory - Introduction to Spectral Graph Theory, Graph
Laplacians: Definition and Properties, Eigenvalues and Eigenvectors of
Laplacian matrices, Cheeger’s Inequality, Graph Partitioning.
Assignments:
1. Implement Cheeger’s inequality for a set of sample graphs. Compare
the theoretical results with empirical data to analyze the effectiveness
of different partitioning algorithms. Use a set of sample graphs such
as Erdős-Rényi Random Graphs, Barabási-Albert Model: Known for
1 9
scale-free properties, and Regular Graphs. Compare theoretical
results with empirical data using different partitioning algorithms
such as Spectral Clustering - Uses the eigenvectors of the Laplacian
matrix, K-means Clustering - Applied to spectral embeddings of the
graph, Normalized Cut - Minimizes the normalized cut criterion.
Measure how close the empirical conductance is to the theoretical
lower bound provided by Cheeger's inequality. Analyze which
algorithms produce cuts with conductance values closer to the
 theoretical bounds.
Real-world Application: Apply Cheeger's inequality to social
network analysis to detect community structures.
2. Analyze the properties of the Laplacian matrix of a given graph
(Erdős-Rényi Random Graphs). Compute its eigenvalues and
eigenvectors and discuss the implications for graph partitioning.
Examine the use of graph Laplacians in network community
detection.
Spectral Clustering - Introduction to Clustering and Spectral Clustering,
Normalized Cut, Eigenvalue Techniques for Clustering, Spectral Clustering
Algorithm, Applications of Spectral Clustering.
Assignment:
1. Implement a spectral clustering algorithm and apply it to a real-world
dataset (Iris dataset). After running the spectral clustering algorithm,
evaluate the results using metrics such as Silhouette Score and
Adjusted Rand Index (ARI). Plot the data points colored by their

2 cluster assignments to visually inspect the clustering. 9

Compare spectral clustering with other clustering techniques (e.g., k-
means, hierarchical clustering) on the three types of datasets -
Synthetic Data, Real-World Data (Iris Dataset), and High-
Dimensional Data (Text Data (Use TF-IDF features)). Discuss the
advantages and limitations of spectral clustering in different
scenarios.
Real-world Application: Use clustering results for anomaly detection
in network security.
Expanders - Introduction to Expander Graphs, Properties and Construction of
Expanders, edge-expanders, vertex-expanders, spectral-expanders, Expander
Mixing Lemma, Random walks on expanders graphs, Applications of
Expander Graphs: Error-Correcting Codes.
Assignments:
1. Study the construction and properties of expander graphs such as
3 9
Erdős-Rényi graphs, Ramanujan graphs and Cayley graphs.
Implement algorithms for generating expander graphs and analyze
their properties based on spectral gap and expansion property.
2. Apply expander graphs to error-correcting codes. Design and test
codes based on expanders, and evaluate their performance in terms of
error correction capabilities. Simulate a communication channel with
 added noise and measure the performance of the expander code in
correcting errors. Evaluate the BER, code rate, and error correction
capability by comparing the number of errors corrected versus the
total number of errors introduced.
LP- and SDP-based Approximation Algorithms for NP-Hard Problems -
Linear Programming (LP) Relaxations and their Use in Approximation:
Vertex Cover and Set Cover, Semidefinite Programming (SDP) and its
Applications: Max-Cut Problem.
Assignments:
1. Implement and evaluate LP relaxations for vertex cover and set cover
problems (use Erdős-Rényi Graphs). Compare the results with exact
solutions and analyze the quality of the approximations.
2. Develop and test approximation algorithms for Max-cut problem

4 using SDP relaxations. Assess the performance and efficiency of your 9

algorithms on various datasets. To assess the performance and
efficiency of the SDP-based Max-Cut approximation, test the
algorithm on various types of graphs, including: Erdős-Rényi Graphs,
Barabási-Albert Graphs, and Real-world Graphs. Compare the cut
values obtained from the SDP relaxation and rounding with known or
exact solutions if available. For large graphs, use heuristics or bounds
for comparison. Measure the time taken to solve the SDP relaxation
and perform the rounding. This includes the time for solving the SDP
problem and the time for eigen-decomposition.

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 evaluation pattern:

● Theoretical Understanding (25%) - Evaluate the clarity and accuracy with which theoretical
concepts such as spectral graph theory, clustering algorithms, expanders, and approximation
methods are explained and applied.
● Application of Theory (25%) - Assess how well the theoretical methods are applied to address
assignment problems. Check if solutions are relevant, accurate, and demonstrate a good grasp
of the theoretical background.
● Depth of Analysis (25%) - Analyze the depth of the problem analysis, including how well the
assignment tackles complex aspects and nuances of the problem.
● Interpretation of Results (25%) - Evaluate the meaningfulness and relevance of the
conclusions drawn from the analysis. Check if the results provide significant insights into the
problem.

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, answered.
each carrying 3 marks  Each question can have a maximum of 3 60
subdivisions.
 Each question carries 9 marks.
(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)
Understand and explain fundamental concepts of Spectral Graph
CO1 K2
Theory, including Laplacian matrices and their applications.
Apply spectral clustering techniques to real-world data and evaluate
CO2 K5
clustering performance using appropriate metrics.
Construct and analyze expander graphs, and assess their applications in
CO3 K4
network design and error-correcting codes.
Develop and implement LP- and SDP-based approximation algorithms
CO4 K5
for solving NP-Hard problems, and compare their performance.
Demonstrate the ability to solve complex theoretical problems using
CO5 K4
advanced algorithms and techniques covered in the 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 3

CO2 3 3 3 3

CO3 3 3 3 3 3

CO4 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
Sl. Name of the Edition
Title of the Book Name of the Author/s
No Publisher and Year
Spectral Graph Theory (CBMS American
1 Fan R. K. Chung 1/e, 1997
Regional Conference Series) Mathematical Society
2 Algebraic Graph Theory Norman Biggs Cambridge India 2/e, 2016
3 Approximation Algorithms Vijay V. Vazirani Springer Nature 2/e, 2013
Stephen Boyd, Lieven Cambridge University
4 Convex Optimization 1/e, 2004
Vandenberghe Press

Reference Books
Sl. Name of the Name of the Edition
Title of the Book
No Author/s Publisher and Year
1 Algebraic Graph Theory C. Godsil, G.F. Royle Springer Nature 1/e, 2009
David Williamson, Cambridge
2 The design of approximation algorithms 1/e, 2011
David Shmoys University Press
Rajeev Motwani, Cambridge
3 Randomized Algorithms 1/e, 2004
Prabhakar Raghavan University Press
Probability and Computing: Randomization Michael
Cambridge
4 and Probabilistic Techniques in Algorithms Mitzenmacher, Eli 3/e, 2017
University Press
and Data Analysis Upfal
Graph Theory and Complex Networks: An Maarten Van
5 Maarten Van Steen 1/e, 2010
Introduction Steen

Video Links (NPTEL, SWAYAM…)

No. Link ID
1 https://archive.nptel.ac.in/courses/128/106/128106001/
 SEMESTER S7

ADVANCED COMPUTER NETWORKS

Course Code PECST751 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 give a comprehensive understanding of advanced networking concepts, including MPLS,
VPNs, Data Center Networks, and Software-Defined Networking (SDN).
2. To impart the skills necessary to analyze, design, and evaluate complex networking
architectures, addressing the challenges and emerging trends.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Review of Computer Networking Fundamentals - OSI and TCP/IP Models,
Layers and Protocols, IP Addressing and Subnetting, Routing Protocols -
RIP, OSPF, BGP;
QoS in IP networks - Random Early Detection, Protocols for QoS support -
1 8
RSVP, RTP, Multiprotocol Label Switching (MPLS): Overview and Use
Cases; Network Security Basics - Firewalls, ACLs, and NAT; Working of
NAT; Virtual Private Networks (VPNs) - Types and Architectures;
Overview of Data Center Networks: Key Components and Topologies;
DLL switching - Overview, VLANs, Inter-VLAN Routing; Spanning Tree
Protocol (STP) - IEEE 802.1D, Rapid Spanning Tree Protocol (RSTP) -
IEEE 802.1w, Multiple Spanning Tree Protocol (MSTP) - IEEE 802.1s, STP

2 Enhancements - BPDU Guard, Root Guard, and Loop Guard; 9

Data Center Network Architectures - Traditional vs. Modern Data Center
Designs (Spine-Leaf, Clos Networks), Ethernet Fabrics and TRILL;
Data Center Design Considerations - Scalability, Redundancy, and Latency.
SDN Architecture and Components - Control Plane, Data Plane, and

3 Application Plane; OpenFlow Protocol and its Role in SDN; SDN 9

Controllers - Ryu, OpenDaylight, and ONOS; SDN Use Cases - Traffic
 Engineering, Network Function Virtualization (NFV) - NFV Concepts,
Virtualizing Network Functions and Services; NFV Infrastructure (NFVI)
and Management (MANO); Service Function Chaining (SFC); NFV in
Telecom Networks.
Data Center Interconnect (DCI) - Technologies for Data Center
Interconnection(VPLS, OTV, and VXLAN), DCI Design and Deployment
Considerations; Intent-Based Networking (IBN) - Introduction to Intent-
Based Networking; Content Distribution on the Internet - Architectures for
4 10
Information-Centric Networking; Content Naming, Routing and Caching,
Security in Named Data Networking; Network Automation and
Orchestration; Automation Tools - Ansible, Terraform; Orchestration
Frameworks - Kubernetes.

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)
Explain and critically analyze advanced networking protocols and

CO1 technologies, including MPLS, VPNs, and SDN, and their applications K3
in modern networks
Demonstrate an understanding of data center network architectures,

CO2 including the design considerations and protocols that ensure K3

scalability, redundancy, and efficiency.
Use Software-Defined Networking (SDN) and Network Function
CO3 K3
Virtualization (NFV) to automate and optimize network operations.
Explain emerging trends such as Intent-Based Networking (IBN) and
CO4 network automation, applying this knowledge to modernize and K2
innovate networking solutions.
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

CO2 3 3 3 2 3

CO3 3 3 3 2 3

CO4 3 2 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
Computer Networking: A Top-Down James F. Kurose,
1 Pearson 8/e, 2022
Approach Keith W. Ross
Data Center Virtualization Fundamentals: Gustavo A. A.
Understanding Techniques and Designs for Santana
2 CISCO Press 1/e, 2013
Highly Efficient Data Centers with Cisco
Nexus, UCS, MDS, and Beyond
Jim Guichard, Ivan
3 MPLS and VPN Architectures CISCO Press 1/e, 2000
Pepelnjak, Jeff Apcar
High-speed networks and Internet:
4 William Stallings Pearson 2/e, 2002
Performance and Quality of Service
Paul Goransson,
Software Defined Networks: A Chuck Black, Morgan
5 2/e, 2016
Comprehensive Approach Timothy Culver Kaufman

Information-Centric Networking (ICN): B. Wissingh, C.

Content-Centric Networking (CCNx) and Wood, A. Afanasyev,
6 RFC 8793 2020
Named Data Networking (NDN) L. Zhang, D. Oran,
Terminology C. Tschudin

Reference Books
Name of the Name of the Edition
Sl. No Title of the Book
Author/s Publisher and Year
Cloud Networking: Understanding
1 Gary Lee Morgan Kaufman 1/e, 2014
Cloud-based Data Centre Networks

Video Links (NPTEL, SWAYAM…)

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

RESPONSIBLE ARTIFICIAL INTELLIGENCE

Course Code PECST752 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 impart the ideas of fairness, accountability, bias, and privacy as fundamental aspects of
responsible AI.
2. To teach the principles of interpretability techniques including simplification, visualization,
intrinsic interpretable methods, and post hoc interpretability for AI models.
3. To give the learner understanding of the ethical principles guiding AI development, along
with privacy concerns and security challenges associated with AI deployment.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Foundations of Responsible AI :-
Introduction to Responsible AI- Overview of AI and its societal impact;
1 7
Fairness and Bias - Sources of Biases, Exploratory data analysis, limitation
of a dataset, Preprocessing, inprocessing and postprocessing to remove bias.
Interpretability and explainability:-
Interpretability - Interpretability through simplification and visualization,
Intrinsic interpretable methods, Post Hoc interpretability, Explainability
2 10
through causality, Model agnostic Interpretation.
Interpretability Tools - SHAP (SHapley Additive exPlanation), LIME(Local
Interpretable Model-agnostic Explanations)
Ethics, Privacy and Security :-
Ethics and Accountability -Auditing AI models, fairness assessment,

3 Principles for ethical practices. 10

Privacy preservation - Attack models, Privacy-preserving Learning,
Differential privacy- Working, The Laplace Mechanism, Introduction to
 Federated learning.
Security - Security in AI Systems, Strategies for securing AI systems and
protecting against adversarial attacks
Future of Responsible AI and Case Studies : -
Future of Responsible AI - Emerging trends and technologies in AI ethics

4 and responsibility. 9
Case Studies - Recommendation systems, Medical diagnosis, Computer
Vision, Natural Language Processing.

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)
Identify and describe key aspects of responsible AI such as fairness,
CO1 K2
accountability, bias, and privacy.
CO2 Describe AI models for fairness and ethical integrity. K2
Understand interpretability techniques such as simplification,
CO3 visualization, intrinsic interpretable methods, and post hoc K2
interpretability.
Comprehend the ethical principles, privacy concerns, and security
CO4 K3
challenges involved in AI development and deployment.
Understand responsible AI solutions for practical applications, balancing
CO5 K3
ethical considerations with model performance.
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
CO2 3 3 3 3
CO3 3 3 3 3
CO4 3 3 3 3
CO5 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
Responsible Artificial Intelligence: How to
1 Virginia Dignum Springer Nature 1/e, 2019
Develop and Use AI in a Responsible Way
2 Interpretable Machine Learning Christoph Molnar Lulu 1/e, 2020

Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
ResponsibleAI Implementing
Sray Agarwal,
1 Ethical and Unbiased Springer Nature 1/e, 2021
Shashin Mishra
Algorithms
 Video Links (NPTEL, SWAYAM…)
Module
Link ID
No.
1 https://youtu.be/3-xhMXeYIcg?si=x8PXrnk0TabaWxQV
https://youtu.be/sURHNhBMnFo?si=Uj0iellJs3oLOmDL [SHAP and LIME]
https://c3.ai/glossary/data-science/lime-local-interpretable-model-agnostic-explanations/
2
https://shap.readthedocs.io/en/latest/
https://www.kaggle.com/code/bextuychiev/model-explainability-with-shap-only-guide-u-need
3 https://www.youtube.com/live/DA7ldX6OIG4?si=Dk4nW1R1zi_UMG_4
https://youtu.be/XlYhKwRLerc?si=IeU7C0BLhwn9Pvmi
Case Studies
4
https://www.kaggle.com/code/teesoong/explainable-ai-on-a-nlp-lstm-model-with-lime
https://www.kaggle.com/code/victorcampelo/using-lime-to-explaining-the-preditions-from-ml
 SEMESTER S7

FUZZY SYSTEMS
(Common to CS/CA)

Course Code PECST753 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 concepts of fuzziness and its use in building better solutions to problems.
2. To understand the basic concepts of fuzzy sets, fuzzy relations, fuzzy logic and building of
fuzzy approximation-based solutions.

SYLLABUS

Modu Contact
Syllabus Description
le No. Hours
Basic Fuzzy Set Theory :-
Introduction - Uncertainty, Imprecision and Vagueness. Crisp vs Fuzzy sets.
Representation of Fuzzy sets. Membership Functions – Types, Basic

1 operations - dilation, concentration, normalization, Linguistic hedges. 9

Properties of fuzzy set - Level Sets - Alpha cut representation. Operations on
fuzzy sets- fuzzy complement, fuzzy intersection, fuzzy union, aggregation
operations
Fuzzy Relations :-
Operations on Fuzzy relations: union, intersection, complement, cartesian
product. Fuzzy composition- Max- min, Max – product. Extension Principle-
2 9
Fuzzy arithmetic – fuzzy numbers, arithmetic operations on fuzzy numbers.
Fuzzy Reasoning – Generalized Modus Ponens (GMP) and Generalized
Modus Tollens (GMT).
 Fuzzification and Defuzzification Methods :-
Fuzzy inference – Zadeh rule, Mamdani rule. Development of membership
Functions – Intuition, Inference, Rank ordering, Inductive reasoning.
3 9
Defuzzification to Scalars - Max membership principle, Centroid method,
Weighted average method, Mean max membership, Center of sums, Center of
largest area, First (or last) of maxima.
Fuzzy Inference Systems :-
Approximate Reasoning, Fuzzy (Rule-Based) Systems – Multiple conjunctive

4 antecedents, Multiple disjunctive antecedents, Aggregation of fuzzy rules, 9

Graphical Techniques of Inference. Fuzzy Controllers -Mamdani FIS, Larsen
Model.

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, out of which 1 question should be answered.
60
each 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 Explain fuzzy logic based problem solving K2
Summarize the concepts of crisp sets, crisp relations, crisp logic with
CO2 K3
fuzzy sets, fuzzy relations and fuzzy logic
Develop fuzzy systems by selecting appropriate membership functions,
CO3 K3
fuzzification and defuzzification methods
CO4 Develop solutions using graphical and rule-based methods K3
CO5 Make use of fuzzy logic inference to solve real world problems K3
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create

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

CO2 3 1 1 2

CO3 3 3 2 1 2

CO4 3 3 2 1 2

CO5 3 3 2 2 1 2
CO-PO Mapping Table (Mapping of Course Outcomes to Program Outcomes)

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 Fuzzy Logic with Engineering John Wiley and Sons 3/e, 2010
Timothy J. Ross
Applications

2 Fuzzy Sets and Fuzzy Logic: George J. Klir and Bo

Pearson 1/e, 2015
Theory and Applications Yuan
 Reference Books

Name of the Edition

Sl. No Title of the Book Name of the Author/s
Publisher and Year
Introduction to Fuzzy Sets,
Guanrong Chen, Trung Tat
1 Fuzzy Logic, and Fuzzy CRC Press 1/e, 2019
Pham
Control Systems
Discrete Mathematics and Its
Applications with
2 Kenneth H. Rosen MGH 7/e, 2011
Combinatorics and
GraphTheory
Discrete Mathematical
3 Structures with Applications to Trembly J.P, Manohar R 1/e, 2003
TataMc Graw Hill
Computer Science
Discrete Mathematical Bernard Kolman, Robert
4 Structures C. Busby, Sharan Cutler Pearson 1/e, 2003
Ross,

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
1 https://nptel.ac.in/courses/108104157
 SEMESTER S7

DIGITAL FORENSICS
(Common with CS/CM/CA/CD/CR/AI/AM/AD)

Course Code PECST754 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 impart the fundamental knowledge on incident management and reporting.

2. To provide a good understanding on devices, operating systems, network and mobile
forensics.
SYLLABUS

Module Contact
Syllabus Description
No. Hours
Introduction to Digital Forensics - Principles in Digital Forensics; Stages in
Digital Forensics Investigation- Forensics Imaging & Cloning, Concept of
Chain of Custody, Digital Evidence Handling at Crime Scene,
Collection/Acquisition and Preservation of Digital Evidence, Processing &
Analysis, Compilation of Findings & Reporting; Expansion of Stages in
Digital Investigation.
Types of Storage Media - Hard Disk Drives (HDD), Solid State Drives
(SSD), USB Flash Drives, Optical Discs, Memory Cards, Cloud Storage,
Drive Geometry, Cylinders, Heads, and Sectors, Logical Block Addressing
1 10
(LBA); Expansion of Types of Storage Medium.
Overview of File Systems - Introduction to File Systems, File Systems in
Digital Forensics, FAT (File Allocation Table), Structure and Characteristics
: FAT12, FAT16, FAT32, NTFS (New Technology File System), Structure
and Characteristics, Master File Table (MFT), EXT (Extended File System),
EXT2, EXT3, EXT4, Journaling in EXT3 and EXT4, HFS (Hierarchical File
System), HFS and HFS+ Structure and Characteristics, Metadata and
Attributes
Tools suggested : Hex Viewer , FTK Imager , OS Forensics
 Windows Forensics - OS Artefacts, Registry Analysis, Analysis of USB
Connections, Event Logs, Applications, Slack Space, Overwritten Files, Data
Recovery Techniques, Volatile and Non-Volatile Data, Hibernation file
analysis, Pagefile analysis, prefetch files, thumbnails, Timestamps, File
Signatures, File System Analysis Tools, Techniques for Recovering Deleted
2 9
Files, File Carving; Memory Forensics - RAM dump and analysis; Linux
and MAC Forensics; Anti Forensics Methods - Steganography, Encryption,
Alternate Data Streams.
Tools suggested : Hex Viewer, FTK Imager, Autopsy, RegRipper, Volatility,
Dumpit
Mobile Forensics - Introduction to Mobile Forensics, Mobile Forensics
Fundamentals, Understanding Mobile Device Storage, Android, iOS,
Windows OS Artifacts, ADB (Android Debug Bridge), APK Files,
Techniques for Acquiring Data from Mobile Devices, Rooting, Jailbreaking.
Analysis of Application Files - Social Media Files, Understanding and

3 Analyzing APK Files, Messages, Malware Analysis, Cloud Data in Mobile 9

Forensics, Analyzing Backups and Cloud Data, Advanced Data Recovery
Techniques (Bypassing Encryption, Password Cracking), Challenges in
Mobile Forensics.
Tools suggested : MobileCheck, BlueStacks(Android Emulator), SQLite
Database viewer
Network Forensics - Introduction to Network Forensics, Overview of
Network Architectures and Protocols, Capturing and Analyzing Network
Traffic using Wireshark/Tcpdump, Log Analysis, Email and Web Forensics,
Email Header Analysis; Endpoint Security systems - Intrusion Detection

4 Systems, Firewall, Router Forensics, NAS, Proxy, VPN; Public Key 8

Infrastructure Systems; Digital Signature - Concepts of Public Key and
Private Key, Certification Authorities and Their Role, Creation and
Authentication of Digital Signature.
Tools Suggested : Wireshark , Apache Log Viewer
 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)
CO1 Perform forensics analysis of hard disk, Network, and mobile phones. K3
CO2 Experiment with the network traffic dump. K3
CO3 Examine the analyse logs of the systems and identify the anomalies. K3
CO4 Plan an onsite triage in case of an incident. 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 3 2

CO2 3 3 3 3 2

CO3 3 3 3 3 2

CO4 3 3 3 3 2
Note: 1: Slight (Low), 2: Moderate (Medium), 3: Substantial (High), -: No Correlation
 Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Digital Forensics and Incident
1 Gerard Johansen Packt 2/e, 2020
Response
Guide to Computer Forensics and Bill Nelson, Amelia Phillips,
2 Cengage 6/e, 2020
Investigations Christopher Steuart
Rohit Tamma, Oleg Skulkin ,
3 Practical Mobile Forensics Packt 4/e, 2020
Heather Mahalik, Satish Bommisetty
Mobile Forensics - Advanced
4 Oleg Afonin, Vladimir Katalov Packt 1/e, 2016
Investigative Strategies
Network Forensics : Tracking
5 Sherri Davidoff, Jonathan Ham Pearson 1/e, 2013
Hackers Through Cyberspace
Addison-
6 File system forensic analysis Brian Carrier 1/e, 2005
Wesley
Windows Forensics: The Field
7 Guide for Corporate Computer Chad Steel Wiley 1/e, 2006
Investigations
Android Forensics: Investigation,
8 Analysis and Mobile Security for Andrew Hoog Syngress 1/e, 2011
Google Android

Video Links (NPTEL, SWAYAM…)

No. Link ID
1 https://onlinecourses.swayam2.ac.in/cec20_lb06/preview
2 https://www.swgde.org/documents/published-by-committee/quality-standards/
3 https://csrc.nist.gov/pubs/sp/800/101/r1/final
 SEMESTER S7

GAME THEORY AND MECHANISM DESIGN

Course Code PECST753 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 equip students with a general purpose tool to analyze strategic behavior in multi-agent
interaction
2. To discuss the mathematical details of analyzing and designing strategic interactions.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Introduction to Game Theory - Competitive equilibrium, Rationality;
Strategic Games - Dominance, Nash equilibrium, Maxmin strategies,
elimination of dominated strategies, preservation of pure Nash equilibrium
1 8
(PSNE), matrix games, relation between maxmin and PSNE in matrix games
Mixed strategies, mixed strategy Nash equilibrium (MSNE), finding MSNE,
MSNE characterization theorem, algorithm to find MSNE
Correlated equilibrium (CE) - Computing CE, extensive form games,
subgame perfection, limitations of subgame perfect Nash equilibrium;
Imperfect information extensive form games (IIEFG) - strategies in IIEFGs,

2 equivalence of strategies in IIEFGs, perfect recall, Equilibrium in IIEFG; 11

Game theory application - P2P file sharing;
Bayesian games - strategy and utility in Bayesian games, equilibrium in
Bayesian games.
Introduction to mechanism design - revelation principle, introduction and
proof of Arrow’s impossibility result, introduction to social choice setup;
Introduction and proof of Gibbard-Satterthwaite theorem, domain restriction,
3 9
median voter theorem; Task sharing domain, uniform rule, mechanism
design with transfers, examples of quasi-linear preferences, Pareto optimality
and Groves payments
 Introduction to VCG mechanism, VCG in Combinatorial allocations,
applications to Internet advertising, slot allocation and payments in position

4 auctions, pros and cons of VCG mechanism; Affine maximizers, single 8

object allocation, Myerson’s lemma, optimal mechanism design; Single and
multi-agent optimal mechanism design, examples of optimal mechanisms

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)
Differentiate between different types of games Identify various
CO1 K3
equilibria within games
CO2 Identify strategic interactions. K3
CO3 Describe the basic concepts of non-cooperative and cooperative games. K2
CO4 Apply the concepts in different game scenarios. 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 3 3

CO2 3 3 3 3

CO3 3 3 3 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
1 An Introduction to Game Cambridge University 1/e, 2004
Martin Osborne
Theory Press
2 Game Theory and Mechanism Y. Narahari World Scientific and 1/e, 2013
Design IISc Press

Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Game Theory 101: The
1 William Spaniel Self 1/e,
Complete Textbook
Princeton University
2 Game Theory - An Introduction Steven Tadelis 1/e, 2013
Press

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
1 https://archive.nptel.ac.in/courses/106/101/106101237/
2 https://www.masfoundations.org/
3
4
 SEMESTER S7

HIGH PERFORMANCE COMPUTING

(Common to CS/CR/CM/CD/CA/AM/AD)

Course Code PECST757 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 Gain an understanding of the modern processor architectures.
2. To Give an introduction to parallel programming using OpenMP and MPI.

SYLLABUS

Module Syllabus Description Contact

No. Hours
Modern processors: Stored-program computer architecture- General-
purpose cache-based microprocessor architecture - Performance metrics
and benchmarks -Moore’s Law - Pipelining - Super scalarity - SIMD -
1 Memory hierarchies - Cache , Cache mapping, Prefetch, Multicore 9
processors - Multithreaded processors - Vector processors - Design
principles - Maximum performance estimates - Programming for vector
architectures.
Parallel computers - Taxonomy of parallel computing paradigms -
Shared-memory computers - Cache coherence - UMA, ccNUMA,
2 Distributed-memory computers - Hierarchical (hybrid) systems - Networks 9
- Basic performance characteristics of networks, Buses, Switched and fat-
tree networks - Mesh networks - Hybrids.
Shared-memory parallel programming with OpenMP:-
Short introduction to OpenMP - Parallel execution - Data scoping -
3 OpenMP worksharing for loops - Synchronization, Reductions, Loop 9
scheduling, Tasking,Miscellaneous, Case study: OpenMP-parallel Jacobi
algorithm
 Distributed-memory parallel programming with MPI:-
Message passing - A short introduction to MPI, A simple example,
Messages and point-to-point communication, Collective communication,
4 9
Nonblocking point-to-point communication, Virtual topologies. Example-
MPI parallelization of a Jacobi solver - MPI implementation - Performance
properties.

Course Assessment Method

(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

Attendance Assignment/ Internal Internal Total
Microproject Examination-1 Examination- 2
(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. 60

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

Course Outcomes (COs)

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

Course Outcome Bloom’s

Knowledge
Level (KL)
CO1 Describe parallel computing architectures supported by modern K2
processors.
CO2 Classify parallel computing paradigms and network topologies. K2
CO3 Implement shared-memory parallel programming with OpenMP. K3
CO4 Design and implement parallel algorithms using distributed- K3
memory parallel programming with MPI
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 3

CO2 3 2 3

CO3 3 3 3 2 3

CO4 3 3 3 2 3

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

Text Books
Sl. No Title of the Book Name of the Author/s Name of the Edition and
Publisher Year
Introduction to High
Georg Hager
1 Performance Computing for CRC Press 1/e, 2011
Gerhard Wellein
Scientists and Engineers
Thomas Sterling, Maciej
High Performance Computing: Morgan
2 Brodowicz, Matthew 1/e, 2017
Modern Systems and Practices Kaufmann
Anderson

Reference Books

Sl. Title of the Book Name of the Name of the Edition and
No Author/s Publisher Year
Parallel and High-Performance Robert Robey Manning
1 1/e, 2021
Computing Yuliana Zamora Publications
Charles Severance
2 High-Performance Computing O'Reilly Media 2/e, 1998
Kevin Dowd
Computer Architecture And Parallel Kai Hwang
3 McGraw-Hill 1/e, 1984
Processing Faye Alaye Briggs
Computer Architecture: A John L. Hennessy
4 Morgan Kaufman 6/e, 2017
Quantitative Approach David A. Patterson

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
1 https://nptel.ac.in/courses/106108055
2 https://nptel.ac.in/courses/106108055
3 https://nptel.ac.in/courses/106108055
4 https://nptel.ac.in/courses/128106014
 SEMESTER S7

PROGRAMMING LANGUAGES
(Common to CS/CR/CM/CA/AD/AM)

Course Code PECST758 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 enable the students understand various constructs and their respective comparisons in
different high-level languages so that he can choose a suitable programming language for
solving a particular problem
2. To develop the student’s ability to understand the salient features and paradigms in the
landscape of programming languages.

SYLLABUS
Module Contact
Syllabus Description
No. Hours
Introduction - The Origins of Programming Languages, Abstractions in
Programming Languages, Computational Paradigms, Language Definition,
Language Translation, The Future of Programming Languages; Language
Design Criteria - Historical Overview, Efficiency, Regularity, Security,
Extensibility, C++: An Object-Oriented Extension of C, Python: A General-
1 9
Purpose Scripting Language; Syntax and Analysis Parsing: Lexical Structure
of Programming Languages, Context-Free Grammars and BNFs, Parse Trees
and Abstract Syntax Trees, Ambiguity, Associativity, and Precedence, EBNFs
and Syntax Diagrams, Parsing Techniques and Tools, Lexics vs. Syntax vs.
Semantics, Case Study: Building a Syntax Analyzer for TinyAda;
Basic Semantics- Attributes, Binding, and Semantic Functions, Declarations,
Blocks, and Scope, The Symbol Table, Name Resolution and Overloading,
Allocation, Lifetimes, and the Environment, Variables and Constants, Aliases,

2 Dangling References, and Garbage, Case Study: Initial Static Semantic 9

Analysis of TinyAda.
Data Types - Data Types and Type Information, Simple Types, Type
Constructors, Type Nomenclature in Sample Languages, Type Equivalence,
 Type Checking, Type Conversion, Polymorphic Type Checking, Explicit
Polymorphism, Case Study: Type Checking in TinyAda.
Expressions and Statements - Expressions, Conditional Statements and
Guards, Loops and Variations on WHILE, The GOTO Controversy and Loop
Exits, Exception Handling, Case Study: Computing the Values of Static
Expressions in TinyAda.

3 Procedures and Environments- Procedure Definition and Activation, 9

Procedure Semantics, Parameter-Passing Mechanisms, Procedure
Environments, Activations, and Allocation, Dynamic Memory Management,
Exception Handling and Environments, Case Study: Processing Parameter
Modes in TinyAda.
Abstract Data Types and Modules- The Algebraic Specification of Abstract
Data Types, Abstract Data Type Mechanisms and Modules, Separate

4 Compilation in C, C++ Namespaces, and Java Packages, Ada Packages, 9

Modules in ML, Modules in Earlier Languages, Problems with Abstract Data
Type Mechanisms, The Mathematics of Abstract Data Types.

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)
Understand the history of programming languages and introduce
CO1 abstraction, the concept of different language paradigms, and an K1
overview of language design criteria.
Describe how the syntactic structure of a language can be precisely
CO2 specified using context-free grammar rules in Backus-Naur form K2
(BNF).
Explain the abstractions of the operations that occur during the
CO3 K2
translation and execution of programs.
CO4 Apply the data types in various languages K3
Apply procedure activation and parameter passing; and exceptions and
CO5 K4
exception handling.
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 3

CO2 2 3 2 3

CO3 3 2 2 3

CO4 3 3 3 3

CO5 3 3 3 3
Note: 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
1 Kenneth C Cengage
Programming languages: principles and practices. 3/e, 2011
Louden Learning
2 Concepts of programming languages. Sebesta R W. Pearson 12/e, 2023
3 Programming languages: concepts and constructs. Sethi R Pearson 2/e, 2006
 Reference Books
Name of the Name of the Edition
Sl. No Title of the Book
Author/s Publisher and Year
Programming Languages: Principles and Allen Tucker, Robert
1 Paradigms Noonan
McGraw-Hill 2/e, 2017
2 Principles of programming languages. Gilles Dowek. Springer 1/e, 2009.
3 Principles of Programming Languages Rajiv Chopra Wiley 1/e, 2019

Video Links (NPTEL, SWAYAM…)

No. Link ID
1 https://archive.nptel.ac.in/courses/106/102/106102067/
 SEMESTER S7

PARALLEL ALGORITHMS
(Common to CS/CM/CD/AM)

Course Code PECST759 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.
PCCST303
Prerequisites (if any) PCCST502 Course Type Theory

Course Objectives:
1. To develop a comprehensive understanding of parallel computing principles and architectures by
studying various types of parallelism, such as data and task parallelism, and analyzing different
computing architectures.
2. To implement and evaluate parallel algorithms for fundamental operations, such as matrix
addition and multiplication, using performance metrics like speedup and scalability, while gaining
hands-on experience with parallel programming models and tools.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Introduction to Parallel Computing - Overview of parallel computing and its
importance, Types of parallelism: data parallelism, task parallelism, Parallel
computing architectures: SIMD, MIMD, shared memory, distributed memory.
Parallel Programming Models - Parallel programming models: Parallel
1 9
Random Access Machine (PRAM), bulk synchronous parallel (BSP), LogP,
Shared memory vs. distributed memory models; Performance Metrics -
Performance metrics for parallel algorithms: speedup, efficiency, scalability,
Amdahl's Law and Gustafson's Law.
Parallel Algorithms for Basic Operations - Parallel algorithms for matrix
addition, matrix multiplication, and reduction, Parallel prefix sum (Parallel
scan) algorithms. Case Studies of Parallel Addition, Multiplication, Reduction,
2 9
and Prefix Sum in Modern Computing Systems; Parallel Sorting Algorithms -
Parallel sorting algorithms: parallel merge sort, parallel quicksort, bitonic
merge sort, Comparison of parallel sorting techniques.
Parallel Graph Algorithms - Parallel algorithms for graph traversal: BFS, DFS,
3 9
Parallel algorithms for minimum spanning tree (MST) and shortest path.
 Parallel Search Algorithms - Parallel search algorithms: parallel binary search,
parallel search trees, Applications and analysis.
Parallel Programming with OpenMP - Introduction to OpenMP, Parallel
programming constructs in OpenMP, Performance tuning and optimization
Parallel Programming with MPI - Introduction to MPI, Message passing

4 model and MPI basics, Advanced MPI features and applications 9

Parallel Numerical Algorithms - Solving linear systems: parallel Gaussian
elimination, parallel LU decomposition, Parallel algorithms for eigenvalue
problems, Applications and 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
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)
Understand and articulate the fundamental principles and architectures
CO1 K2
of parallel computing.
Implement and evaluate parallel algorithms for basic operations such
CO2 K3
as sorting and searching.
Develop and analyze parallel algorithms for complex problems,
CO3 K3
including graph and numerical algorithms.
Apply parallel programming techniques to real-world problems and
CO4 K3
assess the efficiency and performance of parallel solutions.
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

CO2 3 3 3 2 3

CO3 3 3 3 3 3

CO4 3 3 3 3 2 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
Ananth Grama, Anshul
1 Introduction to Parallel Computing Gupta, George Karypis, Addison-Wesley 2/e, 2003
Vipin Kumar
Parallel Programming: Techniques and
2 Barry Wilkinson and
Applications Using Networked Pearson India 2/e, 2006
Michael Allen
Workstations and Parallel Computers
3 Addison-Wesley
An Introduction to Parallel Algorithms Joseph Jaja 1/e, 1992
Professional
4 Henri Casanova, Arnaud Chapman and
Parallel Algorithms 1/e, 2020
Legrand, Yves Robert Hall/CRC
5 Parallel Scientific Computing in C++ and George Em Karniadakis Cambridge
1/e, 2003
MPI and Robert M. Kirby II University Press
 Reference Books
Sl. Name of the Edition
Title of the Book Name of the Author/s
No Publisher and Year
Parallel Programming for Multicore and Thomas Rauber, Gudula
1 Springer 3/e, 2023
Cluster Systems Rünger
Using OpenMP: Portable Shared Memory Barbara Chapman, Gabriele
2 MIT Press 1/e,2007
Parallel Programming Jost, Ruud van der Pas
Using MPI: Portable Parallel
William Gropp, Ewing
3 Programming with the Message-Passing MIT Press 3/e, 2014
Lusk, Anthony Skjellum
Interface

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
1 https://archive.nptel.ac.in/courses/106/106/106106112/
2 https://archive.nptel.ac.in/courses/106/106/106106112/
https://nptel.ac.in/courses/106104120
3 https://archive.nptel.ac.in/courses/106/106/106106112/
https://nptel.ac.in/courses/106104120
4 https://archive.nptel.ac.in/courses/106/106/106106112/
https://nptel.ac.in/courses/106104120
 SEMESTER S7

INTERNET OF THINGS
(Common to CS/CM/CA)

Course Code PECST755 CIE Marks 40

Teaching Hours/Week ESE Marks
3:0:0:0 60
(L: T:P: R)
Credits 5/3 Exam Hours 2 Hrs. 30 Min.
Prerequisites (if any) None

Course Objectives:
1. To provide students with an understanding of IoT architecture, protocols, and integration
techniques that enable device-to-device, device-to-cloud, and cloud-to-cloud
communications.
2. To enable students with the ability to create and implement IoT solutions using platforms like
Raspberry Pi, cloud-based services, and analytics tools to develop real-world IoT
applications.
SYLLABUS

Module Contact
Syllabus Description
No. Hours
Introduction - Why IoT? Trends in IT Space, Internet of Things Era, Device-
to-Device/Machine-to-Machine Integration, Device-to-Cloud (D2C)
Integration, IoT Platform as a Service (PaaS), Cloud-to-Cloud (C2C)
1 8
Integration, IoT Key Application Domains, Emerging IoT Flavors; IoT
Ecosystem - Architecture for IoT, Mobile Technologies, Mobile Application
Development Platforms, LPWAN.
Infrastructure and Service Discovery Protocols - Layered Architecture for IoT,
Protocol Architecture of IoT, Infrastructure Protocols, Device or Service
Discovery for IoT, Protocols & products for IoT Service Discovery;

2 Integration Technologies and Tools - Smart Enterprises and Environments, 10

Sensor and Actuator Networks, The IoT Device Integration Concepts,
Standards, and Implementations, The Device Integration Protocols and
Middleware, The Protocol Landscape.
Platforms for IoT Applications and Analytics - The IoT Building Blocks,
Usecases, M2M Application Platform, IoT Architectural Building Blocks,
3 8
Data Analytics Platforms, IoT Data Virtualization Platforms and capabilities,
The IoT Edge Data Analytics; Clouds for IoT Applications and Analytics -
 Reflecting the Cloud Journey, The Key Motivations for Cloud-Enabled
Environments, IoT and Cloud-Inspired Smarter Environments, Hybrid,
Federated, and Special-purpose cloud, The Emergence of Edge/Fog Clouds,
SDN and SDS.
Introduction to Raspberry Pi, Creating your first project, Creating a Sensor to
Measure Ambient Light, Creating an Actuator for Controlling Illumination,
4 10
Publishing Information Using MQTT & HTTP, Creating Web Pages for Your
Devices.

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

Students must be assessed to analyze various data collection, analytics, and actuation used in various
IoT applications. Evaluation of the technologies and recommendation based on parameters should be
done to propose appropriate technologies.

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, answered.
each carrying 3 marks  Each question can have a maximum of 3 60
subdivisions.
 Each question carries 9 marks.
(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)
Understand IoT trends, architecture layers, and key technologies, including
CO1 K2
Device-to-Device, Device-to-Cloud, and Cloud-to-Cloud integration.
Identify and differentiate between various IoT infrastructure, service discovery,
CO2 K3
and integration protocols, as well as their roles in IoT ecosystems.
Develop simple IoT projects using Raspberry Pi, integrating sensors, actuators,
CO3 K3
and protocols such as MQTT and HTTP to create interactive systems.
Evaluate cloud and edge computing models, including hybrid and federated
CO4 environments, and apply these concepts to build scalable and efficient IoT K5
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 3 3 3 3
CO2 3 3 3 3 3
CO3 3 3 3 3 3
CO4 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
1 The Internet of Things Pethuru Raj, Anupama C. Raman CRC Press 1/e, 2017
2 Mastering Internet of Things Peter Waher Pact 1/e, 2018

Reference Books
Sl. Name of the Name of the Edition
Title of the Book
No Author/s Publisher and Year
Internet of Things : Architecture and
1 Raj Kamal McGraw Hill 2/e, 2023
Design Principles
Internet of Things : Principles and Rajkumar Buyya
2 Morgan Kaufman 1/e, 2016
Paradigms Amir Vahid Dastjerdi
Sudip Misra, Anandarup Cambridge
3 Introduction to IoT 1/e, 2021
Mukherjee, Arijit Roy University Press
 Video Links (NPTEL, SWAYAM…)

No. Link ID
1 https://archive.nptel.ac.in/courses/106/105/106105166/
 SEMESTER S7

ALGORITHMS FOR DATA SCIENCE

(Common to CS/AM/CM)

Course Code PECST785 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 Mins.
PCCST303
Prerequisites (if any) PCCST502 Course Type Theory

Course Objectives:

1. To equip students with the ability to design, analyze, and implement advanced algorithms that
are fundamental to data science, enabling them to process and analyze large-scale datasets
efficiently and effectively.
2. To provide hands-on experience through real-world projects that require students to apply
algorithmic techniques to solve data science problems, strengthen the development of
practical skills in data manipulation, analysis, and interpretation.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Foundations of Data Science Algorithms
Introduction to Data Science and Algorithms - Overview of data science and
its significance, Role of algorithms in data science; Data Preprocessing
Techniques - Data cleaning, transformation, and normalization, Handling
missing data, outliers, and data imputation techniques; Dimensionality
reduction techniques - Principal Component Analysis (PCA), t-Distributed
Stochastic Neighbor Embedding (t-SNE); Algorithmic Approaches to Data
1 9
Sampling - Random sampling, stratified sampling, and bootstrapping,
Importance of representative sampling in data analysis.

Project 1: Data Cleaning and Preprocessing - Develop a pipeline for

cleaning and preprocessing a large, messy dataset like UCI Machine
Learning Repository - Adult Data Set
Tasks: Handle missing values, outliers, and noisy data. Apply
 dimensionality reduction techniques to simplify the dataset. Implement data
transformation and normalization processes.
Algorithms for Data Summarization and Visualization :-
Data Summarization Techniques - Central tendency measures: mean,
median, mode; Dispersion measures - variance, standard deviation,
Interquartile range (IQR), Quantiles, percentiles, and outlier detection;
Visualization Algorithms - Basics of data visualization, histograms, bar
charts, scatter plots; Advanced visualization techniques - heatmaps,
correlation matrices, and pair plots; Visualization tools and libraries -
Matplotlib, Seaborn, Plotly; Algorithmic Approaches to Data Grouping -

2 Clustering: k-means, hierarchical clustering, DBSCAN; Association rule 9

learning - Apriori, FP-Growth.

Project 2: Exploratory Data Analysis and Visualization Perform exploratory

data analysis (EDA) and create visualizations to uncover patterns and
insights in the dataset like Kaggle - Titanic Dataset
Tasks: Summarize the dataset using statistical measures. Create various
visualizations to explore relationships and patterns in the data. Implement
clustering algorithms to identify natural groupings within the data.
Algorithms for Data Modeling :-
Regression Algorithms - Linear regression and polynomial regression;
Regularization techniques - Ridge, Lasso, Elastic Net; Evaluation metrics -
RMSE, MAE, R²; Classification Algorithms - Logistic regression, decision
trees, and k-Nearest Neighbors (k-NN); Performance metrics - accuracy,
precision, recall, F1-score, ROC-AUC; Algorithmic Optimization
Techniques - Gradient descent and its variants: stochastic, mini-batch;
Hyperparameter tuning - grid search, random search, Bayesian optimization.
3 9

Project 3: Predictive Modeling and Evaluation - Build and evaluate

predictive models using regression and classification algorithms using
datasets like Kaggle - House Prices: Advanced Regression Techniques
Tasks: Implement linear and polynomial regression models to predict house
prices. Apply classification algorithms to classify houses into different
categories. Evaluate the models using appropriate performance metrics and
fine-tune them for better accuracy.
Algorithms for Big Data and Scalability :-
4 9
Introduction to Big Data Algorithms - Overview of big data challenges and
 processing techniques; Distributed computing frameworks - Hadoop, Spark;
MapReduce paradigm - concepts and applications; Scalable Data Processing
Algorithms - Algorithms for large-scale data processing : sorting, searching,
filtering; Data partitioning and shuffling techniques in distributed systems;
Handling data with memory constraints - external memory algorithms.

Project 4: Scalable Data Processing with Spark - Implement scalable

algorithms using Apache Spark to process large datasets efficiently using
datasets like Kaggle - Google Analytics Customer Revenue Prediction
Tasks: Set up a Spark environment for large-scale data processing.
Implement scalable algorithms for sorting, searching, and filtering the
dataset. Analyze the performance of your algorithms on different dataset
sizes and optimize for scalability.

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 evaluation pattern:

● Correctness and Accuracy (30%) - Correct Solution and Implementation.
● Effectiveness and Efficiency (25%) - Algorithm Efficiency and Performance Metrics.
● Analytical Depth (25%) - Problem Understanding and Solution Analysis.
● Justification and Comparisons (20%) - Choice Justification and Comparative Analysis.

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, answered.
each carrying 3 marks  Each question can have a maximum of 3 60
(8x3 =24 marks) subdivisions.
 Each question 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)
Implement data preprocessing and cleaning techniques to prepare raw
CO1 K3
data for analysis, ensuring the quality and reliability of the datasets.
Perform exploratory data analysis (EDA) and create insightful
CO2 visualizations that help in understanding the underlying patterns and K4
trends in the data.
Develop predictive models using various regression and classification
CO3 algorithms, and optimize them for better performance, applying K5
appropriate evaluation metrics.
Implement scalable algorithms using distributed computing
CO4 K6
frameworks like Apache Spark to process large datasets efficiently.
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 2

CO2 3 3 3 3 2

CO3 3 3 3 3 2

CO4 3 3 3 3 2

CO5 3 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
Algorithms for Data Science Brian Steele, John
1 Springer International 1/e, 2016
Hardcover Chandler, Swarna Reddy
Jure Leskovec, Anand Cambridge University
2 Mining of Massive Datasets 2/e, 2020
Rajaraman, Jeff Ullman Press
 Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Avrim Blum, John Hopcroft Cambridge
1 Foundations of Data Science 1/e, 2020
and Ravi Kannan University Press
The Elements Of Statistical Trevor Hastie, Robert
2 Learning: Data Mining, Tibshirani and Jerome Springer 9/e, 2017
Inference, And Prediction Friedman
Data Mining: Concepts and Jiawei Han, Micheline Kamber Morgan
3 3/e, 2011
Techniques and Jian Pei Professor Kaufmann
Data Mining and Predictive
4 Daniel T. Larose Wiley 2/e, 2015
Analytics
Dirk Deroos, Paul C.
5 Hadoop for Dummies Zikopoulos, Roman B. Melnyk, Wiley 1/e, 2014
Bruce Brown, Rafael Coss

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
1 https://archive.nptel.ac.in/courses/106/104/106104189/
https://onlinecourses.nptel.ac.in/noc20_cs92/preview
2 https://archive.nptel.ac.in/courses/106/104/106104189/
https://onlinecourses.nptel.ac.in/noc20_cs92/preview
3 https://archive.nptel.ac.in/courses/106/104/106104189/
https://onlinecourses.nptel.ac.in/noc20_cs92/preview
https://archive.nptel.ac.in/courses/106/104/106104189/
4 https://nptel.ac.in/courses/106105186
https://archive.nptel.ac.in/courses/106/106/106106142/
 SEMESTER S7

CYBER SECURITY

Course Code OECST721 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 teach the basic attacks, threats and vulnerabilities related to cyber security
2. To make the learner aware of cyber crimes and cyber laws
3. To give concepts of the malwares and its protection mechanisms in systems and mobile
devices
SYLLABUS

Module Contact
Syllabus Description
No. Hours
Introduction to Cyber Security :-
Basic Cyber Security Concepts, Layers of Security, Vulnerability, Threats,
Computer Criminals, CIA Triad, Motive of Attackers, Active attacks, Passive
1 9
attacks, Software attacks, Hardware attacks, Cyber Threats and its
Classifications- Malware, Social Engineering, DoS/DDoS, Insider Threats,
Advanced Persistent Threats (APTs), Data Breaches and Information Theft.
Cybercrime and CyberLaw :-
Cybercrime, Classification of Cybercrimes, The legal perspectives- Indian
perspective, Global perspective, Categories of Cybercrime.
2 9
Fundamentals of cyber law, Outline of legislative framework for cyber Law,
History and emergence of cyber law, Outreach and impact of cyber law, Major
amendments in various statutes.
Malwares and Protection against Malwares :-
Virus, Worms, Trojans, Spyware, Adware, Key-logger, Ransomware,
Common Methods of Malware Propagation- Email Attachments, Malicious

3 Websites, Removable Media, File Sharing Networks, Malvertising, Protection 9

against Malware- Antivirus/Antimalware Software, Regular Software Updates,
Email Filtering, Web Filtering, Data Backup and Recovery, Strong Passwords
and Multi-Factor Authentication (MFA).
 Mobile App Security :-
Security Implications of Mobile Apps, Mobile App Permission Management
and Best Practices, Risks of Location-Based Social Networks, Data Security on

4 Mobile Devices- Importance of Data Security on Mobile Devices to Protect 9

Sensitive Information, Risks of Unencrypted Data Storage and Communication
on Mobile Platforms, Benefits of Device Encryption, Secure Messaging Apps,
and Encrypted Storage Solutions.
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)
CO1 Explain the attacks, security mechanisms and services to user information K2
CO2 Identify the cybercrimes and discuss the cyber laws against the crimes K2
CO3 Discuss the malwares and the protection mechanisms against malwares K3
CO4 Describe the issues and solutions related with mobile applications 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 3 2

CO2 2 3 2 2

CO3 2 3 2 2

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

Reference Books
Sl. Name of the Name of the Edition
Title of the Book
No Author/s Publisher and Year
1 Computer Security: Principles and Practices William Stallings Pearson 5/e, 2011

Cyber Security- Understanding Cyber

Nina Godbole, Sunit
2 Crimes, Computer Forensics and Legal Wiley 1/e, 2011
Belapure
Perspectives
B.B.Gupta, D.P
Computer and Cyber Security: Principles,
3 Agrawal, Haoxiang CRC Press 1/e, 2018
Algorithm, Applications, and Perspectives
Wang.
James Graham,
4 Cyber Security Essentials Richard Howard, Auerbach 1/e, 2010
Ryan Otson

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
1 https://archive.nptel.ac.in/courses/111/101/111101137/
https://jurnal.fh.unila.ac.id/index.php/fiat/article/download/2667/1961/12044
2
https://www.coursera.org/learn/data-security-privacy#modules
3 https://nptel.ac.in/courses/106105217
https://archive.nptel.ac.in/courses/106/106/106106156/
4
 SEMESTER S7

CLOUD COMPUTING

Course Code OECST722 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 core principles, architecture, and technologies that underpin cloud
computing, including virtualization, data storage, and cloud services.
2. To equip students with the skills to use cloud computing tools effectively, implement cloud-
based applications, and address security challenges within cloud environments.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Introduction - Cloud Computing, Types of Cloud, Working of Cloud

1 Computing, Cloud Computing Architecture - Cloud Computing Technology, 8

Cloud Architecture, Cloud Modelling and Design.
Virtualization - Foundations, Grid, Cloud And Virtualization, Virtualization

2 And Cloud Computing; Data Storage And Cloud Computing - Data Storage, 9
Cloud Storage, Cloud Storage from LANs to WANs.
Cloud Computing Services - Cloud Computing Elements, Understanding
Services and Applications by Type, Cloud Services; Cloud Computing and
3 10
Security - Risks in Cloud Computing, Data Security in Cloud, Cloud
Security Services.
Cloud Computing Tools - Tools and Technologies for Cloud, Apache
Hadoop, Cloud Tools; Cloud Applications - Moving Applications to the
4 9
Cloud, Microsoft Cloud Services, Google Cloud Applications, Amazon
Cloud Services.
 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)
Articulate the fundamental concepts of cloud computing, its types, and
CO1 K2
how cloud computing architecture operates.
Understand and describe the foundations of virtualization, its relationship
CO2 K2
with cloud computing.
Describe various cloud computing services, understand the different
CO3 K3
service models, and identify potential risks.
Demonstrate proficiency in using cloud computing tools such as Apache
CO4 K3
Hadoop, and deploy applications using popular cloud platforms.
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create

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

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

CO2 2 2 2 2 2

CO3 2 2 2 2 2

CO4 2 2 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
1 Cloud Computing: A Practical Approach for A.Srinivasan,
Pearson 1/e, 2014
Learning and Implementation J.Suresh

Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Cloud Computing : Concepts,
1 Technology, Security, and Thomas Erl Pearson 2/e, 2023
Architecture
Cambridge University
2 Cloud Computing Sandeep Bhowmik 1/e, 2017
Press
Cloud Computing: A Hands-On Arshdeep Bahga and
3 Universities Press 1/e, 2014
Approach Vijay Madisetti

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
1 https://onlinecourses.nptel.ac.in/noc21_cs14/preview

2
 SEMESTER S7

SOFTWARE ENGINEERING
Course Code OECST723 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 Provide fundamental knowledge in the Software Development Process including Software

Development, Object Oriented Design, Project Management concepts and
technology trends.
2. To enable the learners to apply state of the art industry practices in Software development.
SYLLABUS

Module Contact
Syllabus Description
No. Hours
Introduction to Software Engineering and Process Models - Software
engineering, Software characteristics and types, Layers of Software
Engineering-Process, Methods, Tools and Quality focus. Software Process
models – Waterfall, Prototype, Spiral, Incremental, Agile model – Values and
Principles.
1 9
Requirement engineering - Functional, Non-functional, System and User
requirements. Requirement elicitation techniques, Requirement validation,
Feasibility analysis and its types, SRS document characteristics and its
structure.
Case study: SRS for College Library Management Software
Software design - Software architecture and its importance, Software
architecture patterns: Component and Connector, Layered, Repository, Client-
Server, Publish-Subscribe, Functional independence – Coupling and Cohesion
2 10
Case study: Ariane launch failure
Object Oriented Software Design - UML diagrams and relationships– Static
and dynamic models, Class diagram, State diagram, Use case diagram,

1
 Sequence diagram
Case Studies: Voice mail system, ATM Example
Software pattern - Model View Controller, Creational Design Pattern types –
Factory method, Abstract Factory method, Singleton method, Prototype
method, Builder method. Structural Design Pattern and its types – Adapter,
Bridge, Proxy, Composite, Decorator, Façade, Flyweight. Behavioral Design
Pattern
Coding, Testing and Maintenance:
Coding guidelines - Code review, Code walkthrough and Code inspection,
Code debugging and its methods.
Testing - Unit testing , Integration testing, System testing and its types, Black
box testing and White box testing, Regression testing

3 Overview of DevOps and Code Management - Code management, DevOps 10

automation, Continuous Integration, Delivery, and Deployment (CI/CD/CD),
Case study – Netflix.
Software maintenance and its types- Adaptive, Preventive, Corrective and
Perfective maintenance. Boehm’s maintenance models (both legacy and non-
legacy)
Software Project Management - Project size metrics – LOC, Function points
and Object points. Cost estimation using Basic COCOMO.
Risk management: Risk and its types, Risk monitoring and management model

4 Software Project Management - Planning, Staffing, Organisational structures, 7

Scheduling using Gantt chart. Software Configuration Management and its
phases, Software Quality Management – ISO 9000, CMM, Six Sigma for
software engineering.

2
 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)
Plan the system requirements and recommend a suitable software process
CO1 K3
model.

CO2 Model various software patterns based on system requirements. K3

Apply testing and maintenance strategies on the developed software
CO3 K3
product to enhance quality.

CO4 Develop a software product based on cost, schedule and risk constraints. K3
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create

3
 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

CO2 3 3 3 3

CO3 3 3 3 3

CO4 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
Software Engineering: A
1 Roger S. Pressman McGraw-Hill 8/e, 2014
practitioner's approach
2 Software Engineering Ian Sommerville Addison-Wesley 10/e, 2015
Erich Gamma,Richard Pearson Education
Design Patterns, Elements of
3 Helm, Ralph Addison-Wesley 1/e, 2009
Reusable Object Oriented Software
Johnson,John Vlissides

Reference Books
Name of the Name of the Edition
Sl. No Title of the Book
Author/s Publisher and Year
Pankaj Jalote’s Software Engineering:
1 Pankaj Jalote Wiley India 1/e, 2024
With Open Source and GenAI
Waman S
2 Software Engineering: A Primer Tata McGraw-Hill 1/e, 2008
Jawadekar
Object-Oriented Modelling Michael Blaha, Pearson Education.
3 2/e, 2007
and Design with UML James Rumbaugh
Software Engineering Foundations : A Auerbach
4 Yingux Wang 1/e, 2008
Software Science Perspective Publications
5 Object-Oriented Design and Patterns Cay Horstmann Wiley India 2/e, 2005
Engineering Software Products: An
1/e, 2020
6 Introduction to Modern Software Ian Sommerville Pearson Education
Engineering

4
 Video Links (NPTEL, SWAYAM…)
Module
Link ID
No.
1 https://www.youtube.com/watch?v=Z6f9ckEElsU

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

3 http://digimat.in/nptel/courses/video/106105150/L01.html

4 https://www.youtube.com/watch?v=v7KtPLhSMkU

2 https://archive.nptel.ac.in/courses/106/105/106105182/

5
 SEMESTER S7

COMPUTER NETWORKS

Course Code OECST724 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 core concepts of computer networking.
2. To Explore routing protocols and their role in network communication

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Introduction to Computer Networks:-
Introduction, Network Components, Network Models, ISO/OSI, TCP/IP,

1 Physical Topology,Overview of the Internet, Protocol layering; Physical 7

Layer-Transmission media (copper, fiber, wireless), Datagram Networks,
Virtual Circuit networks, Performance.
Data Link Layer:-
Error Detection and Correction - Introduction, Hamming Code, CRC,

2 Checksum; Framing-Methods, Flow Control- Noiseless Channels, Noisy 11

Channels; Medium Access Control- Random Access, Controlled Access;
Wired LANs - IEEE Standards, Ethernet, IEEE 802.11;
Network Layer:-
Logical Addressing- IPv4 and IPv6 Addresses; Internet Protocol- IPV4 and

3 IPv6; Unicast Routing Protocols- Distance Vector Routing, Link State 9

Routing
Multicast Routing Protocols.
Transport Layer:-
Transport Layer Protocols- UDP, TCP; Congestion Control- Open Loop Vs
Closed Loop Congestion Control, Congestion Control in TCP; Application
4 8
Layer - Application Layer Paradigms, Client-server applications, World Wide
Web and HTTP, FTP. Electronic Mail, DNS; Peer-to-peer paradigm - P2P
Networks.

1
 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 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 OSI and TCP/IP models, the functioning of different
CO1 K2
network layers, and the protocol stack used in computer networks.
Evaluate various transmission media (copper, fiber, wireless), error
CO2 detection/correction methods, and medium access control mechanisms in K2
both wired and wireless LANs.
Demonstrate a working knowledge of IPv4 and IPv6 addressing schemes,
CO3 routing protocols (unicast and multicast), and apply them to network K3
scenarios.
Summarize UDP and TCP protocols, explain congestion control
CO4 mechanisms, and understand client-server and peer-to-peer applications like K3
HTTP, FTP, DNS, and P2P 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 3 3

CO2 3 3 3 3

CO3 3 3 3 3

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

2
 Text Books
Name of the Edition and
Sl. No Title of the Book Name of the Author/s
Publisher Year
1 Computer Networks: A Top-
Behrouz A Forouzan McGraw Hill SIE, 2017
Down Approach

Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Computer Networks, A L. L. Peterson and B. S.
1 Morgan Kaufmann 5/e, 2011
Systems Approach Davie
Sameer Seth
2 TCP/IP Architecture, design,
M. Ajaykumar Wiley 1/e, 2008
and implementation in Linux
Venkatesulu
3 Computer Networks Andrew Tanenbaum Pearson 6/e, 2021
Computer Networking: A Top-
4 J. F. Kurose and K. W.
Down Approach Featuring Pearson Education 8/e, 2022
Ross
Internet

Video Links (NPTEL, SWAYAM…)

No. Link ID
1 https://nptel.ac.in/courses/106/105/106105183/

3
 SEMESTER S7

MOBILE APPLICATION DEVELOPMENT

(Common to CS/CA/CM/CD/CR/AI/AM/AD)

Course Code OECST725 CIE Marks 40

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

Credits 0 Exam Hours 2 Hrs. 30 Min.

GXEST204 OR
Prerequisites (if any) Course Type Theory
OECST615

Course Objectives:

1. To impart a Comprehensive Mobile Development Knowledge

2. To give Proficiency in Flutter and Dart, UI/UX Design Skills
3. To present the Industry Practices and Deployment such as app security, testing.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Fundamentals of Mobile Application Development:
Introduction to Mobile Application Development, Overview of Mobile
Platforms: iOS and Android, Introduction to Flutter: History, Features, and
1 9
Benefits, Setting Up the Flutter Development Environment*, Mobile App
Architectures (MVC, MVVM, and BLoC), Basics of Dart Programming
Language.

User Interface Design and User Experience:

Principles of Mobile UI/UX Design, Designing Responsive UIs with Flutter,

2 Using Flutter Widgets: StatelessWidget and StatefulWidget, Layouts in Flutter: 9

Container, Column, Row, Stack, Navigation and Routing in Flutter,
Customizing UI with Themes and Styles.

Advanced Flutter Development:

3 9
State Management in Flutter: Provider, Riverpod, and BLoC

1
 Networking in Flutter: HTTP Requests, JSON Parsing, RESTful APIs
Data Persistence: SQLite, SharedPreferences, Hive
Asynchronous Programming with Dart: Futures, async/await, and Streams

Industry Practices and App Deployment:

Advanced UI Components and Animations, App Security Best Practices,

4 Testing and Debugging Flutter Applications, Publishing Apps to Google Play 9

Store and Apple App Store, Industry Trends and Future of Mobile
Development with Flutter

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)

2
 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 mobile application development and different mobile

CO1 K2
platforms and the environment setup.

Apply principles of effective mobile UI/UX design, develop responsive

CO2 K3
user interfaces using Flutter widgets.

Experiment effectively with state in Flutter applications. networking and

CO3 K3
data persistence in Flutter apps.

Apply security best practices in mobile app development and debug

CO4 K3
Flutter applications effectively.
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 3 3

CO3 3 3 3 3 3 3

CO4 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

1 Flutter Cookbook Simone Alessandria Packt 2/e, 2023

2 Flutter for Beginners Alessandro Biessek Packt 1/e, 2019

3
 Reference Books

Name of the Edition

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

1 Flutter in Action Eric Windmill Manning 1/e, 2019

Flutter and Dart: Up and Deepti Chopra, Roopal

2 BPB 1/e, 2023
Running Khurana

Video Links (NPTEL, SWAYAM…)

No. Link ID

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

4
 SEMESTER 8
COMPUTER SCIENCE AND ENGINEERING
 SEMESTER S8

SOFTWARE ARCHITECTURES

Course Code PECST861 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 develop a comprehensive understanding of software architecture principles and patterns.
2. To provide the ability to design and analyze software architectures.

SYLLABUS
Module Contact
Syllabus Description
No. Hours
Introduction to Software Architecture: Definition and Importance,
Architecture in the Life Cycle, Role of the Architect vs. Engineer,
1 8
Requirements engineering: Stakeholders, Concerns, and Types of
Requirements, Use Cases and Tactics.
Architectural Patterns and Styles: Architectural Patterns- Overview of
Patterns and Styles, Applying Patterns and Choosing a Style. Patterns for
2 8
Enterprise Applications: Enterprise Applications and Layered Patterns,
Concurrency Problems.
Components, Contracts, and Service-Oriented Architectures:
Component Software- Nature of Components and Reuse, UML and

3 Components Design by Contract- Contracts, Polymorphism, Inheritance, and 9

Delegation Service-Oriented Architectures- Standards, Technologies, and
Security.
Architecture Evaluation and Description: Describing Architectures and

4 Viewpoints, Evaluating Architectures. Architectural Description Languages 7

(ADLs)- Overview and 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
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)
Understand the foundational concepts of software architecture,
CO1 including the roles of stakeholders and the importance of requirements K2
engineering.
Apply architectural patterns and styles to design software systems,
CO2 K3
particularly in enterprise contexts.
Understand the principles of component-based software design and the
CO3 K2
use of contracts in ensuring reliable software systems.
Apply architectural description techniques to document and evaluate
CO4 K3
software architectures.
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 3 3 2 3

CO3 3 2 2 2 3

CO4 3 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
1 Software Architecture A.Bijlsma, B.J.Heeren, Free Technology 1/e, 2011
E.E.Roubtsova,S. Stuurman Academy
2 Software Architecture 1 Mourad Chabane Oussalah Wiley 1/e, 2014

Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Head First Software Architecture: A
Raju Gandhi, Mark
1 Learner's Guide to Architectural Oreilly 1/e, 2024
Richards, Neal Ford
Thinking

Video Links (NPTEL, SWAYAM…)

No. Link ID
1 https://www.youtube.com/playlist?list=PL4JxLacgYgqTgS8qQPC17fM-NWMTr5GW6
 SEMESTER S8

NATURAL LANGUAGE PROCESSING

(Common to CS/CA/CD)

Course Code PECST862 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 provide a comprehensive understanding of natural language processing (NLP) and

language models, focusing on the principles and techniques of prompt engineering to
effectively guide and optimize AI-driven outputs.
2. practical skills necessary to design, implement, and evaluate prompt engineering strategies
across various applications, while considering the ethical implications and challenges
associated with AI-generated content.
SYLLABUS

Module Contact
Syllabus Description
No. Hours
Introduction to NLP:
Introduction to Natural Language Processing - Various stages of traditional
NLP – Challenges - Basic Text Processing techniques - Common NLP
1 7
Tasks. N-gram Language Models - Naive Bayes for Text Classification, and
Sentiment Analysis – Evaluation-Precision, Recall and F-measure-Test sets
and cross validation.
Traditional NLP Techniques:
Annotating Linguistic Structures - Context-Free Grammars, Constituency
2 7
Parsing, Ambiguity, CYK Parsing, Dependency Parsing - Transition-Based
Dependency Parsing, Graph-Based Dependency Parsing, Evaluation.
Neural Networks for NLP:
Word representations - Lexical Semantics, Vector Semantics, TF-IDF,

3 Pointwise Mutual Information (PMI), Neural Word embeddings - Word2vec, 10

GloVe, Contextual Word Embeddings. Evaluating Vector Models -
Feedforward Neural Networks for Text Classification
 Advanced NLP and Applications:
Sequence Modelling - Recurrent Neural Networks, RNNs as Language
Models, RNNs for NLP tasks, Stacked and Bidirectional RNN architectures,
Recursive Neural Networks, LSTM & GRU, Common RNN NLP
4 12
Architectures, Encoder-Decoder Model with RNNs, Attention models,
Transformers.
NLP Applications - Machine Translation, Question Answering and
Information Retrieval, Introduction to Large Language Models.

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)
Understand the foundational concepts of NLP and apply that to do text
CO1 K3
processing.
CO2 Utilize word representations and evaluate vector models for NLP K3
Analyse and implement advanced linguistic annotation and parsing
CO3 K4
techniques
CO4 Apply advanced sequence modeling techniques using Neural Networks K3
Apply NLP techniques in machine translation, question answering, and
CO5 K3
information retrieval.
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

CO2 3 3 3

CO3 3 3 3

CO4 3 3 3 3

CO5 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
Speech and language processing: An
1 introduction to natural language processing, Dan Jurafsky and
Pearson 2006
computational linguistics, and speech James H. Martin.
recognition
2 Introduction to Natural Language Processing Jacob Eisenstein MIT Press 2019
Lewis Tunstall,
3 Natural Language Processing with O’Reilly 2022
Leandro von Werra,
Transformers
and Thomas Wolf
 Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Deep learning for Natural Language
1 Stephan Raaijmakers Manning 2022
Processing
Natural Language Processing with Delip Rao and Brian
2 O’Reilly 2019
PyTorch McMahan
Ian Goodfellow, Yoshua
3 Deep Learning MIT Press 2016
Bengio, Aaron Courville

Video Links (NPTEL, SWAYAM…)

No. Link ID
1 https://onlinecourses.nptel.ac.in/noc19_cs56
 SEMESTER S8

TOPICS IN SECURITY
(Common to CS/CM/AM/CB/CN/CU/CI)

Course Code PECST863 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 explore various web security and privacy concerns
2. To impart security policies and models for data integrity.
3. To enable the learners to protect databases and introduce IDS

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Fundamentals of Security and Threat Management: Computer Security,
Threats, Harm, Vulnerabilities, Authentication, Access Control
Web Security- Browser Attacks, Web Attacks Targeting Users, Obtaining
1 9
User or Website Data
Privacy- Privacy Concepts, Principles and Policies, Privacy on the Web,
Privacy Principles and Policies, Email Security.
Cryptography in Network Security- Network Encryption, Browser
Encryption, Onion Routing, IPSEC, VPN
Intrusion Detection and Prevention Systems-Types of IDSs, Other
2 9
Intrusion Detection Technology, Intrusion Prevention Systems, Intrusion
Response, Goals for Intrusion Detection Systems, IDS Strengths and
Limitations
Database Security: -Machine Learning for Malware detection, Supervised
Learning for Misuse/Signature Detection, Anomaly Detection using ML,
Spam detection based on Machine Learning approach, Adversarial Machine
3 10
Learning
Security Requirements of Databases, Reliability and Integrity of Databases,
Database Disclosure
 Security policies and models: Confidentiality Policies, Bell- LaPadula
model, Integrity policies, Biba model, Clark-Wilson models, Chinese wall

4 model, waterfall model. 8

Management and Incidents- Security Planning, Business Continuity
Planning, Handling Incidents, Risk Analysis, Dealing with Disaster

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)
CO1 Explain the fundamentals of threat management, web security and privacy K2
CO2 Identify the significance of network security and IDS K2
CO3 Apply machine learning algorithms for database security K3
Explain the policies and models for data integrity along with managements K2
CO4
and incidents associated with data
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
CO2 3 3 3 3
CO3 3 3 3 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
Charles P. Pfleeger, Shari
1 Security in Computing Lawrence Pfleeger Pearson 5/e, 2015
Jonathan Margulies
2 Data mining and machine learning Auerbach
Dua, Sumeet, Xian Du 1/e, 2011
in cybersecurity Publications
Machine learning and security:
3 Chio, Clarence,
Protecting systems with data and O’Reilly 1/e, 2018
David Freeman
algorithms.
4 Cengage
Network Security and Cryptography Bernard Menezes 1/e, 2010
Learning
5 Addison -
Computer Security: Art and Science M Bishop 2/e, 2019
Wesley

Reference Books
Sl. Name of the Edition
Title of the Book Name of the Author/s
No Publisher and Year
Principles of information security Cengage
1 E Whiteman, J Mattord 4/e, 2011
Learning
Network Security Essentials: Applications
2 William Stallings McGraw Hill 6/e, 2018
and Standards
3 Network security: the complete reference. Bragg, Roberta McGraw-Hill 1/e, 2004
Cengage
4 Database Security Basta A., Zgola M, 3/e, 2011
Learning

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
https://onlinecourses.nptel.ac.in/noc24_cs121
https://nptel.ac.in/courses/106106093
1 https://archive.nptel.ac.in/courses/106/106/106106129/
 SEMESTER S8

COMPUTATIONAL COMPLEXITY
(Common to CS/CM/AD/CB/CN/CU/CR/CI)

Course Code PECST864 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.
PCCST302,
Prerequisites (if any) PCCST502 Course Type Theory

Course Objectives:

1. To develop an understanding of various computational models, including deterministic and

nondeterministic models, Turing machines, and other computational models, and analyze
their capabilities and limitations, focusing on how these models influence the classification of
problems into complexity classes.
2. To explore key complexity classes such as P, NP, and PSPACE, and apply polynomial-time
reductions to prove the NP-completeness of various problems, and also investigate space
complexity, polynomial hierarchy, and advanced topics.

SYLLABUS
Module Contact
Syllabus Description
No. Hours
Introduction to Complexity Theory - Basic concepts and motivations,
Deterministic and nondeterministic models, Turing machines, and
computational models. (Text 2 - Ch 7)
Complexity Classes P and NP - Definitions and examples of P and NP,

1 Polynomial-time algorithms, NP-completeness and the Cook-Levin theorem. 9

(Text 2 - Ch 7, 8)
Reductions and Completeness - Polynomial-time reductions, NP-complete
problems, and their significance, Examples of NP-complete problems (Text
1 - Ch 2)
Space Complexity - Space complexity classes: L, NL, PSPACE, Savitch's
theorem and NL-completeness, PSPACE-completeness. (Text 2 - Ch 8)

2 Polynomial Hierarchy and Alternation - Definition of the polynomial 9

hierarchy (PH), Complete problems for each level of PH, Relationship
between PH and other classes. (Text 1 - Ch 5)

3 Interactive Proofs - Definition and examples of interactive proofs, IP = 9

 PSPACE theorem, Zero-knowledge proofs. (Text 1 - Ch 8)
Probabilistically Checkable Proofs (PCPs) - Introduction to PCPs, PCP
theorem and implications, Applications in hardness of approximation. (Text
1 - Ch 9)
Circuit Complexity - Boolean circuits and circuit complexity, Circuit lower
bounds, Complexity of specific functions. (Text 2 - Ch 9)

4 Quantum Complexity - Basics of quantum computation, Quantum 9

complexity classes: BQP, QMA, Quantum algorithms and their complexity.
(Text 3 - Ch 10, 11)

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.
carrying 3 marks ● Each question can have a maximum of 3 60
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)
Describe and interpret different computational models, including
CO1 K2
deterministic and nondeterministic Turing machines.
Recall and categorize complexity classes such as P, NP, and PSPACE,
CO2 K2
and explain their fundamental properties.
Use polynomial-time reductions to demonstrate problem completeness
CO3 K3
and analyze the computational difficulty of problems.
Evaluate problems based on their space complexity and apply theories
CO4 K4
like Savitch's theorem to assess space-bounded algorithms.
Examine advanced topics in complexity theory, including interactive
CO5 proofs, PCPs, and quantum complexity, and their implications for K3
computational theory.
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

CO5 3 3 3 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
Computational Complexity: A Modern Sanjeev Arora, Cambridge
1 1/e, 2019
Approach Boaz Barak University Press
2 Introduction to the Theory of Computation Michael Sipser Cengage 3/e, 2014
Quantum Computing: A Gentle Eleanor Rieffel,
3 MIT Press 1/e, 2014
Introduction Wolfgang Polak
 Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Rajeev Motwani and Cambridge
1 Randomized Algorithms 1/e, 2004
Prabhakar Raghavan University Press
Probability and Computing:
Randomization and Probabilistic Michael Mitzenmacher and Cambridge
2 3/e, 2017
Techniques in Algorithms and Eli Upfal University Press
Data Analysis
Thomas H. Cormen, Charles
The MIT Press
3 Introduction to Algorithms E. Leiserson, Ronald L. 4/e, 2023
Cambridge
Rivest and Clifford Stein
Noga Alon and Joel H.
4 The Probabilistic Method Wiley-Blackwell 4/e, 2016
Spencer
5 Approximation Algorithms Vijay V. Vazirani Springer 4/e, 2013
Theory of Computation : Classical
6 Dexter C Kozen Springer 6/e, 2006
And Contemporary Approaches
Computational Complexity: A Cambridge
7 Oded Goldreich 1/e, 2008
Conceptual Perspective, University Press

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
1 https://onlinecourses.nptel.ac.in/noc21_cs90/preview
https://onlinecourses.nptel.ac.in/noc21_cs49/preview
2 https://onlinecourses.nptel.ac.in/noc21_cs90/preview
https://onlinecourses.nptel.ac.in/noc21_cs49/preview
3 https://onlinecourses.nptel.ac.in/noc21_cs90/preview
https://onlinecourses.nptel.ac.in/noc21_cs49/preview
https://onlinecourses.nptel.ac.in/noc21_cs90/preview
4 https://onlinecourses.nptel.ac.in/noc21_cs49/preview
https://archive.nptel.ac.in/courses/106/104/106104241/
 SEMESTER S8

SPEECH AND AUDIO PROCESSING

(Common to CS/CA/CM/CD/CR/AD/CC/CG)

Course Code PECST866 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) PECST636 Course Type Theory

Course Objectives:
1. To get familiarised with speech processing and audio processing concepts.
2. To equip the student to apply speech processing techniques in finding solutions to day-to-day
problems

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Speech Production :- Acoustic theory of speech production; Source/Filter
model - Pitch, Formant; Spectrogram- Wide and narrow band spectrogram;
Discrete model for speech production; Short-Time Speech Analysis;
1 Windowing; STFT; Time domain parameters (Short time energy, short time 9
zero crossing Rate, ACF); Frequency domain parameters - Filter bank
analysis; STFT Analysis.

Mel-frequency cepstral coefficient (MFCC)- Computation; Pitch Estimation

ACF/AMDF approaches; Cepstral analysis - Pitch and Formant estimation
2 using cepstral analysis; LPC Analysis - LPC model; Auto correlation 9
method - Levinson Durbin Algorithm

Speech Enhancement :- Spectral subtraction and Filtering, Harmonic

filtering, Parametric resynthesis; Speech coding - fundamentals, class of
coders : Time domain/spectral domain/vocoders, Sub band coding, adaptive

3 transform coding, phase vocoder; Speaker Recognition :- Speaker 9

verification and speaker identification, log-likelihood; Language
identification - Implicit and explicit models; Machine learning models in
Speaker Recognition.
 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 ● 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)
CO1 To recall various steps in the speech production process K2
CO2 To summarise various speech processing approaches K2
CO3 To develop speech-processing applications in various domains K3
CO4 To analyse the speech processing model for audio perception 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 2 2 3

CO2 3 3 3 3

CO3 3 3 3 3

CO4 3 3 3 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
1 Speech Communications: Human &
Douglas O'Shaughnessy IEEE Press 2/e, 1999
Machine
2 Discrete-Time Speech Signal
Thomas F. Quatieri Prentice Hall 1/e, 2001
Processing: Principles and Practice
Lawrence Rabiner, Biing-
3 Fundamentals of Speech Recognition Hwang Juang, B. Pearson 1/e, 2008
Yegnanarayana

Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Theory and Application of Digital
1 Rabiner and Schafer Prentice Hall 1/e, 2010
Processing of Speech Signals
Speech and Audio Signal
Nelson Morgan and Ben John Wiley &
2 Processing: Processing and 2/e, 2011
Gold Sons
Perception Speech and Music

Video Links (NPTEL, SWAYAM…)

No. Link ID
1 https://youtu.be/Xjzm7S__kBU?si=j11bk3F7gocYjhfg
 SEMESTER S8

STORAGE SYSTEMS
(Common to CS/CM/CR/CD/AM/AD)

Course Code PECST867 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 provide a comprehensive understanding of storage technologies and architectures.
2. To empower students to design and implement effective storage solutions.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Storage technologies:-
Computer storage technologies-Magnetic bubble memories, Charged
Coupled Devices - CCDs, Micro-Electro-Mechanical Systems
- MEMS, Flash memories, Processing In Memory - PIM, Optical storage -
1 9
Data deduplication in storage systems.
Storage Arrays- Architectural Principles, Replication, Local Snapshot
Redundant Arrays of Independent Disks (RAID) - RAID0,RAID2,RAID3,
RAID4, RAID5, RAID6, Hybrid RAID.
Data Storage Networking:-
Fibre Channel SAN- FC SAN Components,SAN Topologies, iSCSI SAN-

2 iSCSI names, Sessions, iSNS, 9

Network Attached Storage - NAS Protocols, NAS Arrays, NAS Performance
Object Storage - Objects and Object IDs, metadata, API Access
Business Continuity, Backup and Recovery:-
Replication- Synchronous Replication, Asynchronous Replication
Application, Layer Replication, Logical Volume Manager–Based

3 Replication, 9
Backup Methods- Hot Backups, Offline Backups, LAN-Based Backups,
LAN-Free Backups (SAN Based), Serverless Backups, NDMP,
Backup Types- Full Backups, Incremental Backups, Differential Backups ,
 Synthetic Full Backups, Application-Aware Backups

Storage Management:-
Capacity Management- Capacity Reporting, Thin Provisioning
Considerations, Deduplication and Compression, Quotas and Archiving,

4 Showback and Chargeback, Performance Management- Latency/Response 9

Time, IOPS,MBps and Transfer Rate, Factors Affecting Storage
Performance
Management Protocols and Interfaces.

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)
CO1 Describe emerging storage technologies. K2
CO2 Compare and contrast different storage networking technologies. K2
CO3 Understand the importance of business continuity. K2
CO4 Develop a comprehensive backup and recovery strategy K3
Utilize management tools and best practices to monitor, optimize, and
CO5 K3
secure storage resources, ensuring optimal performance and data integrity.
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 2 3
CO3 3 3 3 3
CO4 3 3 3 3
CO5 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
1 Data Storage Networking Nigel Poulton WILEY 2/e, 2015
2 Computer Storage Fundamentals Susanta Dutta BPB Publication 1/e, 2018

Reference Books
Name of the Name of the Edition
Sl. No Title of the Book
Author/s Publisher and Year
Storage Systems : Organization, Performance, Alexander Morgan
1 1/e, 2021
Coding, Reliability, and Their Data Processing Thomasian Kaufmann
Somasundaram
2 Information Storage and Management Gnanasundaram Wiley 2/e, 2012
Alok Shrivastava

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
1 https://archive.nptel.ac.in/courses/106/108/106108058/
 SEMESTER S8

PROMPT ENGINEERING
(Common to CS/CM/CR/CD/AD/AM)

Course Code PECST868 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 develop students' practical skills in applying prompt engineering techniques to real-world
applications, while fostering an awareness of the ethical considerations and challenges in the
field
2. To give an understanding of contextual cues to mitigating biases with techniques for seamless
interaction with AI systems.
SYLLABUS

Module Contact
Syllabus Description
No. Hours
Introduction to Prompt Engineering and Language Models :-
Fundamentals of Natural Language Processing (NLP) - Overview of Language
Models: From Rule-Based Systems to Transformer Architectures (e.g., GPT,
BERT) - Understanding Prompts: Definition, Importance, and Applications -

1 Introduction to Prompt Engineering: Techniques and Use Cases - Ethical 9

Considerations in Prompt Engineering
Handson : Explore various language models using platforms like OpenAI,
Hugging Face, or Google Colab; Experimenting with basic prompts to
understand the impact of phrasing and context on model outputs.
Techniques and Strategies in Prompt Engineering :-
Designing Effective Prompts - Best Practices and Common Pitfalls; Prompt
Tuning and Fine-Tuning Language Model; Using Zero-Shot, Few-Shot, and
Multi-Shot Learning in Prompts; Exploring the Role of Context, Repetition,
2 9
and Specificity in Prompt Responses; Advanced Prompt Engineering
Techniques: Prompt Chaining, Iterative Prompting.
Handson : Crafting and optimizing prompts for specific tasks (e.g., text
generation, summarization, Q&A); Using prompt engineering to fine-tune pre-
 trained models on specific datasets or tasks.

Applications of Prompt Engineering :-

Prompt Engineering in Chatbots and Conversational AI; Content Generation:
Creative Writing, Code Generation, and Data Augmentation; Prompt
Engineering for Sentiment Analysis, Classification, and Translation;
Integration of Prompt Engineering with Other AI Technologies (e.g.,
3 9
Computer Vision, Data Science); Real-World Case Studies and Industry
Applications
Handson : Developing a simple chatbot using prompt engineering techniques,
Case study analysis and reproduction of real-world prompt engineering
applications
Challenges, Future Trends, and Research in Prompt Engineering :-
Challenges in Prompt Engineering: Ambiguity, Bias, and Misinterpretation;
Evaluating and Improving Prompt Performance: Metrics and Benchmarks;
4 9
Future Trends: Emerging Techniques and the Evolution of Language Models;
Handson : Working on a capstone project to solve a real-world problem using
prompt engineering

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)
Explain the core principles of NLP, language models, and the role of
CO1 K2
prompts in influencing AI behavior.
Demonstrate the ability to design and fine-tune prompts for specific tasks,
CO2 K3
optimizing language models for desired outputs
Apply prompt engineering techniques to develop functional AI
CO3 applications, such as chatbots, content generation tools, and automated K3
systems.
Compare the ethical implications of prompt engineering, addressing
CO4 challenges such as bias, ambiguity, and misuse, and propose solutions to K3
mitigate these issues.
CO5 Apply prompt engineering techniques to a variety of assigned tasks 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 3 3

CO2 3 3 3 3

CO3 3 3 3 3

CO4 3 3 3 3

CO5 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
1 Speech and Language Daniel Jurafsky and
Pearson 2/e, 2013
Processing James H. Martin
2 Unlocking the Secrets of
Gilbert Mizrahi Packt 1/e, 2023
Prompt Engineering
3 Prompt Engineering Ian Khan Wiley 1/e, 2024
 Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Natural Language Processing Steven Bird, Ewan Klein,
1 Oreilly 1/e, 2009
with Python and Edward Loper
Transformers for Natural
2 Denis Rothman Packt 1/e, 2021
Language Processing
 SEMESTER S8

COMPUTATIONAL NUMBER THEORY

(Common to CS/CM)

Course Code PECST869 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.
PCCST205
Prerequisites (if any) PCCST303 Course Type Theory
PCCST502

Course Objectives:

1. To develop proficiency in key algorithms for number-theoretic operations, including primality

testing, integer factorization, and modular exponentiation and to analyze and implement these
algorithms efficiently to solve problems in number theory and cryptography.
2. To apply advanced computational techniques, such as elliptic curve cryptography and lattice-
based methods, to address complex problems in cryptographic systems and gain practical
skills to implement and evaluate these techniques within real-world security applications.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Introduction to Number Theory - Basic concepts and definitions, Greatest
common divisor (GCD) and Euclidean algorithm; Modular Arithmetic -
Congruences and modular arithmetic, Applications of modular arithmetic;
1 9
Integer Factorization - Prime numbers and factorization, Algorithms for
integer factorization; Basic Algorithms - Algorithms for modular arithmetic,
Fast exponentiation techniques
Advanced Factorization Algorithms - Pollard’s rho algorithm, Elliptic curve
factorization; Public-Key Cryptography - RSA algorithm, Security analysis
2 9
of RSA; Elliptic Curve Cryptography - Introduction to elliptic curves,
Algorithms for elliptic curve cryptosystems
Public Key Cryptography - RSA algorithm and its implementation, Security

3 aspects and cryptanalysis; Elliptic Curve Cryptography - Basics of elliptic 9

curves, Elliptic curve cryptosystems; Cryptographic Protocols - Key
 exchange protocols, Digital signatures and authentication

Algebraic Number Theory - Algebraic integers and number fields,

Factorization in number fields; Computational Methods - Algorithms for

4 solving Diophantine equations, Applications in computational algebra; 9

Recent Developments and Applications - Applications in modern
cryptography and coding theory

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)
CO1 Understand basic number theory concepts and algorithms. K2
CO2 Apply factorization algorithms to solve computational problems. K3
CO3 Analyze and evaluate cryptographic systems based on number theory. K4
Synthesize algebraic number theory concepts into computational
CO4 K4
methods.
Create and present a project on recent advances and applications in
CO5 K4
computational number theory.
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 3 3 2

CO4 3 3 3 3 3 2 2 2

CO5 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
A Computational Introduction Cambridge University
1 Victor Shoup 2/e, 2008
to Number Theory and Algebra Press

Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Computational Number Theory John Wiley &
1 Song Y. Yan 1/e, 2013
and Modern Cryptography Sons
A course in computational
2 Henri Cohen Springer-Verlag 4/e, 2000
algebraic number theory
3 Computational Number Theory Abhijit Das CRC 1/e, 2013
Joachim von zur Gathen and Cambridge
4 Modern Computer Algebra 4/e, 2013
Jürgen Gerhard University Press
G. H. Hardy, Edward M.
An Introduction to the Theory Oxford
5 Wright, Roger Heath- Brown 6/e, 2008
of Numbers University Press
and Joseph Silverman

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
1 https://archive.nptel.ac.in/courses/111/104/111104138/
https://archive.nptel.ac.in/courses/106/103/106103015/
2 https://archive.nptel.ac.in/courses/111/104/111104138/
https://archive.nptel.ac.in/courses/106/103/106103015/
3 https://archive.nptel.ac.in/courses/111/104/111104138/
https://archive.nptel.ac.in/courses/106/103/106103015/
4 https://archive.nptel.ac.in/courses/111/104/111104138/
https://archive.nptel.ac.in/courses/106/103/106103015/
 SEMESTER S8

NEXT GENERATION INTERACTION DESIGN

(Common to CS/CR/CM/CA/CD/AM/AD/CN/CC/CI/CG)

Course Code PECST865 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 Objectives:
1. To provide a comprehensive understanding of the principles of interaction design and their
application in augmented reality (AR) and virtual reality (VR) environments.
2. To equip learners with practical skills in developing, prototyping, and evaluating AR/VR
applications, focusing on user-centered design and advanced interaction techniques.
SYLLABUS

Module Contact
Syllabus Description
No. Hours
Introduction to Interaction Design and AR/VR :- Fundamentals of
Interaction Design - Principles of interaction design, Human-computer
interaction (HCI) basics, User experience (UX) design principles;
1 8
Introduction to AR and VR - Overview of AR and VR technologies (Key
differences and Application), Overview of AR/VR hardware (headsets,
controllers, sensors), Software tools and platforms for AR/VR development.
User-Centered Design and Prototyping :-
Understanding User Needs and Context - User research methods, Personas
and user journey mapping, Contextual inquiry for AR/VR, Designing for

2 AR/VR Environments, Spatial design principles, Immersion and presence in 8

AR/VR, User interface (UI) design for AR/VR; Prototyping and Testing -
Rapid prototyping technique, Usability testing methods, Iterative design and
feedback loops.
Advanced Interaction Techniques :-
Gesture - Designing for gesture-based interaction, Implementing gesture
controls in AR/VR applications; Voice - Voice recognition technologies,
3 11
Integrating voice commands in AR/VR; Haptic Feedback and Sensory
Augmentation - Understanding haptic feedback and tactile interactions; Eye
Gaze - Designing and integrating Eye Gaze in VR; Spatial Audio;
 Microinteraction; Motion capture and tracking technologies; Natural
Language Interaction and conversational interfaces; Type of IoT sensors
and uses.
Implementation, Evaluation, and Future Trends :-
Developing AR/VR Projects - Project planning and management,
Collaborative design and development, Case studies of successful AR/VR
projects; Evaluating AR/VR Experiences - Evaluation methods and metrics,
4 9
Analyzing user feedback, Refining and improving AR/VR applications;
Future Trends and Ethical Considerations- Emerging technologies in
AR/VR, Ethical implications of AR/VR, Future directions in interaction
design for AR/VR.

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

● The students must be directed to measure the quality of the interfaces / GUI based on various
techniques such as user testing.
● The students may be assessed based on their ability to analyze various performance of the
interfaces /GUIs.

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, answered.
each carrying 3 marks  Each question can have a maximum of 3 60
(8x3 =24marks) subdivisions.
 Each question 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)
Apply fundamental interaction design principles and human-computer
CO1 interaction (HCI) concepts to create effective and intuitive user K3
experiences in AR/VR applications.
Demonstrate proficiency in using AR/VR hardware and software tools
CO2 K3
for the development and prototyping of immersive environments.
Conduct user research and apply user-centered design methodologies to
CO3 K4
tailor AR/VR experiences that meet specific user needs and contexts.
Implement advanced interaction techniques such as gesture controls,
CO4 voice commands, haptic feedback, and eye gaze in AR/VR applications K3
to enhance user engagement and immersion.
Evaluate AR/VR projects, utilizing appropriate evaluation methods and
CO5 metrics, and propose improvements based on user feedback and K5
emerging trends in the field.
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 3 3

CO3 3 3 3 3 3 3

CO4 3 3 3 3 3 3

CO5 3 3 3 3 3
Note: 1: Slight (Low), 2: Moderate (Medium), 3: Substantial (High), -: No Correlation
 Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Augmented Reality - Theory, Design
1 Chetankumar G Shetty McGraw Hill 1/e, 2023
and Development
Ralf Doerner, Wolfgang
Virtual Reality and Augmented
2 Broll, Paul Grimm, and Wiley 1/e, 2018
Reality: Myths and Realities
Bernhard Jung
Augmented Reality: Principles and Dieter Schmalstieg and
3 Pearson 1/e, 2016
Practice Tobias Hollerer
Alan Dix, Janet Finlay,
4 Human–Computer Interaction Gregory D. Abowd, Russell Pearson 3/e, 2004
Beale
Evaluating User Experience in
5 Regina Bernhaupt Springer 1/e, 2010
Games: Concepts and Methods
Measuring the User Experience:
Morgan
6 Collecting, Analyzing, and Bill Albert, Tom Tullis 2/e, 2013
Kaufman
Presenting Usability Metrics
The Fourth Transformation: How Robert Scoble and Shel
Patrick
7 Augmented Reality & Artificial Israel 1/e, 2016
Brewster
Intelligence Will Change Everything
Augmented Reality and Virtual
M. Claudia tom Dieck and
8 Reality: The Power of AR and VR Springer 1/e, 2019
Timothy Jung
for Business

Video Links (NPTEL, SWAYAM…)

No. Link ID
1 Interaction Design https://archive.nptel.ac.in/courses/107/103/107103083/
2 Virtual Reality https://archive.nptel.ac.in/courses/106/106/106106138/
3 Augmented Reality https://www.youtube.com/watch?v=WzfDo2Wpxks
 SEMESTER S8

INTRODUCTION TO ALGORITHM
(Common to CS/CA/CM/CD/CR/AD/AM)

Course Code OECST831 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 give proficiency in analysing algorithm efficiency and solve a variety of computational

problems, including sorting, graph algorithms.
2. To provide an understanding in algorithmic problem-solving techniques, including Divide and
Conquer, Greedy Strategy, Dynamic Programming, Backtracking, and Branch & Bound
algorithms.

SYLLABUS
Module Contact
Syllabus Description
No. Hours
Introduction to Algorithm Analysis Time and Space Complexity- Asymptotic
notation, Elementary operations and Computation of Time Complexity-Best,
1 worst and Average Case Complexities- Complexity Calculation of simple 9
algorithms Recurrence Equations: Solution of Recurrence Equations –
Iteration Method and Recursion Tree Methods
Trees - Binary Trees – level and height of the tree, complete-binary tree
representation using array, tree traversals (Recursive and non-recursive),
2 applications. Binary search tree – creation, insertion and deletion and search 9
operations, applications; Graphs – representation of graphs, BFS and DFS
(analysis not required), Topological Sorting.
Divide and Conquer - Control Abstraction, Finding Maximum and Minimum,
Costs associated element comparisons and index comparisons, Binary Search,
Quick Sort, Merge Sort - Refinements; Greedy Strategy - Control
9
Abstraction, Fractional Knapsack Problem, Minimum Cost Spanning Trees –
PRIM’s Algorithm, Kruskal’s Algorithm, Single Source Shortest Path
Algorithm - Dijkstra’s Algorithm.

4 Dynamic Programming - The Control Abstraction- The Optimality Principle 9

 - Matrix Chain Multiplication, Analysis; All Pairs Shortest Path Algorithm -
Floyd-Warshall Algorithm; The Control Abstraction of Backtracking – The
N-Queens Problem. Branch and Bound Algorithm for Travelling Salesman
Problem.

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)
Identify algorithm efficiency using asymptotic notation, compute
CO1 K3
complexities, and solve recurrence equations
Use binary trees and search trees, and apply graph representations,
CO2 K3
BFS, DFS, and topological sorting
Use divide and conquer to solve problems like finding
CO3 K3
maximum/minimum, binary search, quick sort, and merge sort
Apply greedy strategies to solve the fractional knapsack problem,
CO4 minimum cost spanning trees using Prim’s and Kruskal’s algorithms, K3
and shortest paths with Dijkstra’s algorithm.
Understand the concepts of Dynamic Programming, Backtracking and
CO5 K2
Branch & Bound
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 1

CO2 2 3 2 2 2

CO3 3 3 3 2 2

CO4 2 2 2

CO5 2 3 2 2
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
T. H. Cormen, C. E. Leiserson,
1 Introduction to Algorithms Prentice-Hall India 4/e, 2022
R. L. Rivest, C. Stein
Fundamentals of Computer Ellis Horowitz, SartajSahni,
2 Universities Press 2/e, 2008
Algorithms Sanguthevar Rajasekaran

Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
1 Algorithm Design Jon Kleinberg, Eva Tardos Pearson 1/e, 2005
2 Algorithms Robert Sedgewick, Kevin Wayne Pearson 4/e, 2011
3 The Algorithm Design Manual Steven S. Skiena Springer 2/e, 2008

Video Links (NPTEL, SWAYAM…)

No. Link ID
1 https://archive.nptel.ac.in/courses/106/105/106105164/
 SEMESTER S8

WEB PROGRAMMING

Course Code OECST832 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.

Course
Prerequisites (if any) GXEST203 Theory
Type
Course Objectives:
1. To equip students with the knowledge and skills required to create, style, and script web
pages using HTML5, CSS, JavaScript, and related technologies.
2. To provide hands-on experience with modern web development tools and frameworks such as
React, Node.js, JQuery, and databases, enabling students to design and build dynamic,
responsive, and interactive web applications.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Creating Web Page using HTML5 - Introduction, First HTML5 example,
Headings, Linking, Images, Special Characters and Horizontal Rules, Lists,
Tables, Forms, Internal Linking, meta Elements, HTML5 Form input Types,
Input and datalist Elements and autocomplete Attribute, Page-Structure
Elements; Styling Web Page using CSS - Introduction, Inline Styles,

1 Embedded Style Sheets, Linking External Style Sheets, Positioning Elements:, 9

Absolute Positioning, z-index, Positioning Elements: Relative Positioning, span,
Backgrounds, Element Dimensions, Box Model and Text Flow, Media Types
and Media Queries, Drop-Down Menus; Extensible Markup Language -
Introduction, XML Basics, Structuring Data, XML Namespaces, Document
Type Definitions (DTDs), XML Vocabularies
Scripting language - Client-Side Scripting, Data Types, Conditionals, Loops,
Arrays , Objects , Function Declarations vs. Function Expressions , Nested
Functions , The Document Object Model (DOM) - Nodes and NodeLists,
2 9
Document Object, Selection Methods, Element Node Object, Event Types
Asynchronous JavaScript and XML - AJAX : Making Asynchronous
Requests , Complete Control over AJAX , Cross-Origin Resource Sharing
 JavaScript library - jQuery - jQuery Foundations - Including jQuery, jQuery
Selectors, Common Element Manipulations in jQuery, Event Handling in
jQuery
JavaScript runtime environment : Node.js - The Architecture of Node.js,
Working with Node.js, Adding Express to Node.js; Server-side programming
language : PHP - What Is Server-Side Development? Quick tour of PHP,
Program Control , Functions , Arrays , Classes and Objects in PHP , Object-
3 9
Oriented Design ; Rendering HTML : React - ReactJS Foundations : The
Philosophy of React, What is a component? Built- in components, User- defined
components - Types of components, Function Components, Differences
between Function and Class Components
SPA – Basics, Angular JS; Working with databases - Databases and Web
Development, SQL, Database APIs, Accessing MySQL in PHP; Web
Application Design - Real World Web Software Design, Principle of Layering ,
4 9
Software Design Patterns in the Web Context, Testing; Web services -
Overview of Web Services - SOAP Services, REST Services, An Example Web
Service, Web server - hosting options

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)
Develop structured web pages with HTML5 and style them using CSS
CO1 K3
techniques, including positioning, media queries, and the box model.
Write client-side scripts using JavaScript and utilize jQuery for DOM
CO2 manipulation, event handling, and AJAX requests to create responsive K3
and interactive user interfaces.
Build and deploy server-side applications using Node.js, Express, and
CO3 PHP, and integrate databases using SQL to store and retrieve data for K3
dynamic content generation.
Utilize React for building component-based single-page applications
(SPAs), understanding the fundamental principles of component
CO4 K3
architecture, and leveraging AngularJS for web application
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 3 3 3 3

CO2 3 3 3 3 3

CO3 3 3 3 3 3

CO4 3 3 3 3 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
Randy Connolly, Ricardo
1 Fundamentals of Web Development Pearson 1/e, 2017
Hoar
Building User Interfaces with
2 Chris Minnick Wiley 1/e, 2022
ReactJS - An Approachable Guide
Internet & World Wide Web - How Paul J. Deitel, Harvey M.
3 Pearson 1/e, 2011
to Program Deitel, Abbey Deitel
SPA Design and Architecture:
Manning
4 Understanding Single Page Web Emmit Scott 1/e, 2015
Publications
Applications
 Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
A Hand Book On Web
1 Development : From Basics of Pritma Jashnani Notion press 1/e, 2022
HTML to JavaScript and PHP
Advanced Web Development
2 Mohan Mehul BPB 1/e, 2020
with React
JavaScript Frameworks for Tim Ambler, Sufyan bin
3 Apress 1/e, 2019
Modern Web Development Uzayr, Nicholas Cloud

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
1 https://archive.nptel.ac.in/courses/106/106/106106222/
2 https://archive.nptel.ac.in/courses/106/106/106106156/
 SEMESTER S8
SOFTWARE TESTING

Course Code OECST833 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 Cultivate proficiency in software testing methodologies and techniques.
2. To Foster expertise in software testing tools and technologies.

SYLLABUS
Module Contact
Syllabus Description
No. Hours
Introduction to Software Testing & Automation:-
Introduction to Software Testing - Concepts, importance of testing, software
quality, and real-world failures (e.g., Ariane 5, Therac 25); Software Testing
Processes - Levels of thinking in testing; Testing Terminologies - Verification,
validation, fault, error, bug, test cases, and coverage criteria; Types of Testing -

1 Unit, Integration, System, Acceptance, Performance (stress, usability, regression), 8

and Security Testing; Industry Trends - AI in test case automation, Introduction to
GenAI in testing; Testing Methods - Black-Box, White-Box, and Grey-Box
Testing; Automation in Testing - Introduction to automation tools (e.g., Selenium,
Cypress, JUnit); Case Study- Automation of Unit Testing and Mutation Testing
using JUnit.

Unit Testing, Mutation Testing & AI-Driven Automation:-

Unit Testing- Static and Dynamic Unit Testing, control flow testing, data flow
testing, domain testing; Mutation Testing- Mutation operators, mutants, mutation
score, and modern mutation testing tools (e.g., Muclipse); JUnit Framework -

2 Automation of unit testing, frameworks for testing in real-world projects; AI in 8

Testing - GenAI for test case generation and optimization, impact on automation;
Industry Tools - Application of AI-driven testing tools in automation and
predictive testing; Case Study - Mutation testing using JUnit, AI-enhanced test
case automation.
 Advanced White Box Testing & Security Testing:-
Graph Coverage Criteria - Node, edge, and path coverage; prime path and round
trip coverage; Data Flow Criteria - du paths, du pairs, subsumption relationships;
Graph Coverage for Code - Control flow graphs (CFGs) for complex structures

3 (e.g., loops, exceptions); Graph Coverage for Design Elements - Call graphs, class 10
inheritance testing, and coupling data-flow pairs; Security Testing -
Fundamentals, tools (OWASP, Burp Suite), and their role in protecting modern
applications; Case Study - Application of graph based testing and security testing
using industry standard tools.
Black Box Testing, Grey Box Testing, and Responsive Testing:-
Black Box Testing - Input space partitioning, domain testing, functional testing
(equivalence class partitioning, boundary value analysis, decision tables, random
testing); Grey Box Testing - Introduction, advantages, and methodologies (matrix
testing, regression testing, orthogonal array testing); Performance Testing -

4 Network latency testing, browser compatibility, responsive testing across multiple 10

devices (e.g., BrowserStack, LambdaTest); Introduction to PEX - Symbolic
execution, parameterized unit testing, symbolic execution trees, and their
application; GenAI in Testing - Advanced use cases for predictive and responsive
testing across devices and environments; Case Study- Implementation of black-
box, grey-box, and responsive testing using PEX and AI-driven tools.
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
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)
Demonstrate the ability to apply a range of software testing techniques,
CO1 K2
including unit testing using JUnit and automation tools.

Illustrate using appropriate tools the mutation testing method for a given
CO2 piece of code to identify hidden defects that can’t be detected using other K3
testing methods.
Explain and apply graph coverage criteria in terms of control flow and
CO3 K2
data flow graphs to improve code quality.
Demonstrate the importance of black-box approaches in terms of Domain
CO4 K3
and Functional Testing
Illustrate the importance of security, compatibility, and performance
CO5 K3
testing across devices.
Use advanced tools like PEX to perform symbolic execution and optimize
CO6 test case generation and also leverage AI tools for automated test case K3
prediction and symbolic execution with PEX.
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
CO2 3 3 3 3 3 3
CO3 3 3 3 3
CO4 3 3 3 3 3
CO5 3 3 3 3 3
CO6 3 3 3 3 3 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
1 Cambridge
Introduction to Software Testing. Paul Ammann, Jeff Offutt 2/e, 2016
University Press
2 Software Testing and Quality Kshirasagar Naik,
Wiley 1/e, 2008
Assurance: Theory and Practice Priyadarshi Tripathy
 Reference Books
Name of
Sl. Edition
Title of the Book Name of the Author/s the
No and Year
Publisher
1 Software Testing Ron Patten Pearson 2/e, 2005
Software Testing: A Craftsman’s
2 Paul C. Jorgensen CRC Press 4/e, 2017
Approach
3 Dorothy Graham, Rex Black,
Foundations of Software Testing Cengage 4/e, 2021
Erik van Veenendaal
Glenford J. Myers, Tom
4 The Art of Software Testing Wiley 3/e, 2011
Badgett, Corey Sandler

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
1 https://archive.nptel.ac.in/courses/106/101/106101163/
2 https://archive.nptel.ac.in/courses/106/101/106101163/
3 https://archive.nptel.ac.in/courses/106/101/106101163/
4 https://archive.nptel.ac.in/courses/106/101/106101163/
 SEMESTER S8
INTERNET OF THINGS
Course Code OECST834 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) NA Course Type Theory

Course Objectives:

1. To give an understanding in the Internet of Things, including the components, tools, and
analysis through its fundamentals and real-world applications.

2. To enable the students to develop IoT solutions including the softwares and programming of
Raspberry Pi hardware.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Introduction to IoT - Physical Design of IoT, Logical Design of IoT, IoT
1 levels and Deployment templates, Domain Specific IoT- Home automation, 9
Energy, Agriculture, Health and lifestyle.
IoT and M2M-M2M, Difference between IoT and M2M, Software Defined
Networking, Network Function virtualization, Need for IoT System
Management, Simple Network Management Protocol (SNMP), NETCONF,
2 9
YANG; LPWAN - LPWAN applications, LPWAN technologies, Cellular
(3GPP) and Non 3GPP standards, Comparison of various protocols like
Sigfox, LoRA, LoRAWAN, Weightless, NB-IoT, LTE-M.
Developing IoT - IoT design methodology, Case study on IoT system for
weather monitoring, Motivations for using python, IoT-system Logical
3 9
design using python, Python Packages of Interest for IoT - JSON, XML,
HTTPlib & URLLib, SMTPLib
Programming Raspberry Pi with Python-Controlling LED with Raspberry Pi,
4 Interfacing an LED and switch with Raspberry Pi, Other IoT devices- 9
PcDino, Beagle bone Black, Cubieboard, Data Analytics for IoT
 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 subdivisions.
(8x3 =24 marks) (4x9 = 36 marks)

Course Outcomes (COs)

At the end of the course, students should be able to:
Bloom’s
Knowledg
Course Outcome
e Level
(KL)
Understand domain-specific applications and apply the principles of IoT,
CO1 K2
including physical and logical design and deployment templates
Use the principles of IoT and M2M, their differences, and key concepts like
CO2 K3
SDN, NFV, and essential management protocols.
Develop and apply IoT design methodology, utilize Python for logical system
CO3 K3
design, and leverage key Python packages through practical case studies.
Experiment using Raspberry Pi with Python to control LEDs and switches,
CO4 K3
interface with other IoT 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 3 2 3
CO2 3 3 3 2 3
CO3 3 3 3 2 2 3
CO4 3 3 3 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
Internet of Things - a Hands On Arshdeep Bahga, Vijay
1 Universities Press 1/e, 2016
Approach. Madisetti

Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Internet of Things : Architecture
1 Rajkamal McGraw Hill 2/e, 2022
and Design Principles
The Internet of Things –Key Olivier Hersent, David
2 Wiley 1/e, 2012
applications and Protocols Boswarthick, Omar Elloumi
IoT fundamentals : Networking David Hanes Gonzalo.
3 technologies, Protocols and use Salgueiro, Grossetete, Robert Cisco Press 1/e, 2017
cases for the Internet of things Barton

Video Links (NPTEL, SWAYAM…)

No. Link ID
1 https://archive.nptel.ac.in/courses/106/105/106105166/
2 https://archive.nptel.ac.in/courses/108/108/108108179/
 SEMESTER S8

COMPUTER GRAPHICS

Course Code OECST835 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 Objective:
1. To provide strong technological concepts in computer graphics including the three-
dimensional environment representation in a computer, transformation of 2D/3D objects and
basic mathematical techniques and algorithms used to build applications.

SYLLABUS
Module Contact
Syllabus Description
No. Hours
Basics of Computer graphics - Basics of Computer Graphics and its
applications. Video Display devices - LED, OLED, LCD, PDP and FED and
reflective displays. Random and Raster scan displays and systems.

1 Line and Circle drawing Algorithms - Line drawing algorithms- 10

Bresenham’s algorithm, Liang-Barsky Algorithm, Circle drawing algorithms
- Midpoint Circle generation algorithm, Bresenham’s Circle drawing
algorithm.
Geometric transformations - 2D and 3D basic transformations -
Translation, Rotation, Scaling, Reflection and Shearing, Matrix

2 representations and homogeneous coordinates. 10

Filled Area Primitives - Scan line polygon filling, Boundary filling and
flood filling.
Transformations and Clipping Algorithms - Window to viewport
transformation. Cohen Sutherland and Midpoint subdivision line clipping
3 8
algorithms, Sutherland Hodgeman and Weiler Atherton Polygon clipping
algorithms.
Three dimensional graphics - Three dimensional viewing pipeline.
Projections- Parallel and Perspective projections. Visible surface detection
4 8
algorithms- Back face detection, Depth buffer algorithm, Scan line
algorithm, A buffer algorithm.
 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)
CO1 Understand the principles of computer graphics and displays K2
CO2 Illustrate line drawing, circle drawing and polygon filling algorithms K3

CO3 Illustrate 2D and 3D basic transformations and matrix representation K3

CO4 Demonstrate different clipping algorithms and 3D viewing pipeline. 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 3 3

CO2 3 3 3 3 3

CO3 3 3 3 3 3

CO4 3 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
1 Computer Graphics : Algorithms and D. P. Mukherjee,
PHI 1/e, 2010
Implementations Debasish Jana
Donald Hearn, M.
2 Computer Graphics with OpenGL Pauline Baker and PHI 4/e, 2013
Warren Carithers

Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Jiun-Haw Lee, I-Chun
Introduction to Flat Panel
1 Cheng, Hong Hua, Shin- Wiley 1/e, 2020
Displays
Tson Wu
Computer Graphics and
2 ITL ESL Pearson 1/e, 2013
Multimedia
Zhigang Xiang and Roy
3 Computer Graphics McGraw Hill 2/e, 2000
Plastock
Principles of Interactive William M. Newman and
4 McGraw Hill 1/e, 2001
Computer Graphics Robert F. Sproull
Procedural Elements for
5 David F. Rogers McGraw Hill 1/e, 2017
Computer Graphics
Donald D Hearn, M Pauline
6 Computer Graphics Pearson 2/e, 2002
Baker

Video Links (NPTEL, SWAYAM…)

No. Link ID

1. Computer Graphics By Prof. Samit Bhattacharya at IIT Guwahati

https://onlinecourses.nptel.ac.in/noc20_cs90/preview