SEMESTER 3

COMPUTER SCIENCE AND ENGINEERING

(DATA SCIENCE)
 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 Hrs. 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

1 distribution, Poisson distribution as a limit of the binomial distribution, Joint 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

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

Course Code PCCST302 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) PCCST205 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
1 11
Finite Automata (Linz, Hopcroft)

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)

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)

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

Formal definition of a context-free grammar, Designing context-free

11
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

4 Chomskian hierarchy, Linear bounded automaton as a restricted TM. 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/ Examination-1 Examination- 2
Attendance Total
Microproject
(Written) (Written )

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

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

Part A Part B Total

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

module. ● Two questions will be given from each module, out
● Total of 8 Questions, each of which 1 question should be answered.
carrying 3 marks ● Each question can have a maximum of 3 60

subdivisions.
(4x9 = 36 marks)
(8x3 =24 marks)

Course Outcomes (COs)

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

Bloom’s
Course Outcome Knowledge
Level (KL)

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

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

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

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

Theory of Computation: A
3 Kavi Mahesh Wiley 1/e, 2012
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.

https://archive.nptel.ac.in/courses/106/104/106104148/
1
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 Arrays,
1 11
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 List; 11
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 Trees;
3 Binary Search Trees - Binary Search Tree Operations; Binary Heaps - Binary 11
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 11
Searching Techniques :- Linear Search, Binary Search, Hashing - Hashing
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,
1 10
Boolean Logical, Assignment, Conditional (Ternary); Operator Precedence;
Control Statements - Selection Statements, Iteration Statements and Jump
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 9
references, extending interface(s).
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 10
JTextField.
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.
 Each question carries 6 marks.
(8x2 =16 marks) (4x6 = 24 marks)
Course Outcomes (COs)

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

Bloom’s
Course Outcome Knowledge
Level (KL)
Explain the process of writing, compiling, and executing basic Java
CO1 programs, including their structure and components, to demonstrate K2
proficiency.
CO2 Utilize object-oriented programming principles in the design and
K3
implementation of Java applications.
CO3 Develop and manage Java packages and interfaces, enhancing code
K3
modularity and reusability.
CO4 Implement error handling using Java's exception mechanisms and leverage
K3
interfaces for modular applications.
CO5 Develop event-driven Java GUI applications with database connectivity
K3
using Swing and JDBC.
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
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
3 Head First Design Patterns Robson, Bert Bates, O'Reilly Media 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 Friendly Kathy Sierra & Bert
1 O’Reilly 3/e, 2022
Guide Bates
2 JAVA™ for Programmers Paul Deitel PHI 11/e, 2018
Clean Code : A Handbook of Agile
3 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…)
Module
Link ID
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)

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
required)
Sessions
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 11
operation - logic levels, output dc specifications, input dc specifications, 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 cares, Code
2 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
3 8
Circuits - Half adder, Full adder, half subtractor, full subtractor; 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
CO4 K3
and 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…)

Module
Link ID
No.
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 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
2 cost - Opportunity cost - short run cost curves - Revenue concepts 6
Firms and their objectives – Types of firms – Markets - Perfect Competition
 – Monopoly - Monopolistic Competition - Oligopoly (features and
equilibrium of a firm)
Monetary System – Money – Functions - Central Banking –Inflation -
Causes and Effects – Measures to Control Inflation - Monetary and Fiscal
policies – Deflation
Taxation – Direct and Indirect taxes (merits and demerits) - GST
3 6
National income – Concepts - Circular Flow – Methods of Estimation and
Difficulties - Stock Market – Functions- Problems faced by the Indian stock
market-Demat Account and Trading Account – Stock market Indicators-
SENSEX and NIFTY
Value Analysis and value Engineering - Cost Value, Exchange Value, Use
Value, Esteem Value - Aims, Advantages and Application areas of 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
Microproject
(Written) (Written)

10 15 12.5 12.5 50

End Semester Examination Marks (ESE)

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

Part A Part B Total

 Minimum 1 and Maximum  2 questions will be given from each module, out
2 Questions from each of which 1 question should be answered.
module.  Each question can have a maximum of 2 sub
50
 Total of 6 Questions, each divisions.
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 -
 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

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

Credits 2 Exam Hours 2 Hrs. 30 Min.

Prerequisites (if any) None Course Type Theory

Course Objectives:

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

SYLLABUS

Module Contact
Syllabus Description
No. Hours

Fundamentals of ethics - Personal vs. professional ethics, Civic Virtue,

Respect for others, Profession and Professionalism, Ingenuity, diligence
and responsibility, Integrity in design, development, and research domains,
Plagiarism, a balanced outlook on law - challenges - case studies,
1 Technology and digital revolution-Data, information, and knowledge, 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
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
4 6
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
3. Undertake a project study based on the concepts of G 12
reflections)
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

Virtue Ethics and Professional Cambridge University November

2 Justin Oakley
Roles Press & Assessment 2006

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

Sustainable Engineering Cambridge University

4 Bhavik R. Bakshi, 2019
Principles and Practice Press & Assessmen

M Govindarajan, S
PHI Learning Private
5 Engineering Ethics Natarajan and V S 2012
Ltd, New Delhi
Senthil Kumar

Professional ethics and human New age international

6 RS Naagarazan 2006.
values (P) limited New Delhi

Tata McGraw Hill

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

Suggested Activities/Projects:

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

Module-III
● Study a local water body (e.g., a river or lake) for signs of pollution or natural flow disruption and
suggest sustainable management and restoration practices.
● Analyse the effectiveness of water management in the college campus and propose improvements -
calculate the water footprint, how to reduce the footprint, how to increase supply through rainwater
harvesting, and how to decrease the supply-demand ratio
● Implement a zero waste initiative on the college campus for one week and document the challenges
and outcomes.
● Develop a waste audit report for the campus. Suggest a plan for a zero-waste approach.
● Create a circular economy model for a common product used in Kerala (e.g., coconut oil, cloth etc).
● Design a product or service based on circular economy and degrowth principles and present a
business plan.
● Develop a plan to improve pedestrian and cycling infrastructure in a chosen locality in Kerala

Module-IV
● Evaluate the potential for installing solar panels on the college campus including cost-benefit
analysis and feasibility study.
● Analyse the energy consumption patterns of the college campus and propose sustainable alternatives
to reduce consumption - What gadgets are being used? How can we reduce demand using energy-
saving gadgets?
● Analyse a local infrastructure project for its climate resilience and suggest improvements.
● Analyse a specific environmental regulation in India (e.g., Coastal Regulation Zone) and its impact
on local communities and ecosystems.
● Research and present a case study of a successful sustainable engineering project in Kerala/India
(e.g., sustainable building design, water management project, infrastructure project).
● Research and present a case study of an unsustainable engineering project in Kerala/India
highlighting design and implementation faults and possible corrections/alternatives (e.g., a housing
complex with water logging, a water management project causing frequent floods, infrastructure
project that affects surrounding landscapes or ecosystems).
 SEMESTER S3

DATA STRUCTURES LAB

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

1. 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
empty. We are allowed one type of operation: pouring the contents of one container into
10
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.
Simulation of a basic memory allocator and garbage collector using doubly linked
16
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
1 Press, 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…)

Module
Link ID
No.

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 3

PYTHON AND STATISTICAL MODELING LAB

(Common to AD/CD/CR)
Course Code PCCDL308 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. The course aims to familiarize students with basic Python concepts and data structures, model
graphical representation of data, measures of central tendency and measures of dispersion. The course
will also introduce students to use python in solving problems based on statistical distributions,
regression analysis and correlation tests

Expt.
Experiments
No.

1 Write a program to find the largest of three numbers.

2 Write a program to print the multiplication table of a number n.

3 Write a program to find Surface area and volume of a cylinder using function.

4 Write a program to replace a word by another word in a sentence.

5 Write a program to confirm the validity of an email id by verifying its format.

6 Write a program to remove every occurrence of a number from a list.

7 Write a program to add two matrices.

8 Write a program to read a tuple of numbers and print even tuple and odd tuple.

Create a dictionary with a set of book title and corresponding stock. Write a program to update the
9
stock and to add or delete books.

10 A set of numbers are stored in a file. Write a program to print the prime numbers among them.

Write a program to count the number of words, sentences, upper case letters, lowercase letters and
11
special symbols in a text stored in file.
12 Plot a graph y = f(x)

The areas of the various continents of the world (in millions of square miles) are as follows:11.7 for
13 Africa; 10.4 for Asia; 1.9 for Europe; 9.4 for North America; 3.3 Oceania; 6.9 South America; 7.9
Soviet Union. Draw a bar chart representing the given data.

Draw the histogram of the following data:

14 Height of student(m) 135 - 140 140 - 145 145-150 150-155

No. of students 4 12 16 8

Table contains population and murder rates (in units of murders per 100,000 people per year)
for different states. Compute the mean, median and variance for the population.

State Population Murder

Alabama 4,779,736 5.7

Alaska 710231 5.6

15 Arizona 6,392,017 4.7

Arkansas 2,915,918 5.6

California 37,253,956 4.4

Colorado 5,029,196 2.8

Connecticut 3,574,097 2.4

Delaware 89,924 5.8

Calculate the S.D. and coefficient of variation (C.V.) for the following table:

16 Class: 0-10 10-20 20-30 30-40 40-50 50-60 60-70 70-80

Frequency: 5 10 20 40 30 20 10 5

If X is binomially distributed with 6 trials and a probability of success equal to 0.25 at each
17 attempt, what is the probability of:

a) exactly 4 successes b) at least one success

18
18 If the random variable X follows a Poisson distribution with mean 3.4, find
 P(X=6).

A random sample of 395 people were surveyed and each person was asked to report
the highest education level they obtained. The data that resulted from the survey is
summarized in the following table. Are gender and education level dependent at 5%
level of significance?

19 High School Bachelors Masters Ph.D Total

Female 60 54 46 41 201

Male 40 44 53 57 194

Total 100 98 99 98 395

Calculate the correlation coefficient of the two variables shown in the table below.

Pers Ha Heig
on nd ht

A 17 150
20
B 15 154

C 19 169

D 17 172

E 21 175

Suppose a sample of 16 light trucks is randomly selected off the assembly line. The
trucks are driven 1000 miles and the fuel mileage (MPG) of each truck is recorded. It
21
is found that the mean MPG is 22 with a SD equal to 3. The previous model of the
light truck got 20 MPG. Conduct a t- test of the null hypothesis at p = 0.05.

The mean productivity rating for all employees at a company was 3.8 on a five- point
scale last year. This year you get ratings from a representative sample of fifteen
employees from the Human Research Management. Do the data from this sample
22 provide evidence that employee productivity in the department of Human Resource
Management is significantly higher than in the company as a whole? Write the null
and alternative hypotheses for this problem. Use statistical analysis software to test the
null hypothesis stated above.

Obtain the regression equation for predicting systolic blood pressure from job
statistical analysis software. If one knows that a subject in the future has a score on job
satisfaction of 15, what is their systolic blood pressure predicted to be? What is the
23
standard error of estimate?

Job Satisfaction Systolic BP

 34 124

23 128

19 157

43 133

56 116

47 125

32 147

16 167

55 110

25 156

If the random variable X follows a Poisson distribution with mean 3.4, find
18
P(X=6).

A random sample of 395 people were surveyed and each person was asked to report
the highest education level they obtained. The data that resulted from the survey is
summarized in the following table. Are gender and education level dependent at 5%
level of significance?

19 High School Bachelors Masters Ph.D Total

Female 60 54 46 41 201

Male 40 44 53 57 194
19
Total 100 98 99 98 395

Calculate the correlation coefficient of the two variables shown in the table below.

Pers Ha Heig
on nd ht

A 17 150
20
B 15 154

C 19 169

D 17 172

E 21 175
 Suppose a sample of 16 light trucks is randomly selected off the assembly line. The
trucks are driven 1000 miles and the fuel mileage (MPG) of each truck is recorded. It
21
is found that the mean MPG is 22 with a SD equal to 3. The previous model of the
light truck got 20 MPG. Conduct a t- test of the null hypothesis at p = 0.05.

The mean productivity rating for all employees at a company was 3.8 on a five- point
scale last year. This year you get ratings from a representative sample of fifteen
employees from the Human Research Management. Do the data from this sample
22 provide evidence that employee productivity in the department of Human Resource
Management is significantly higher than in the company as a whole? Write the null
and alternative hypotheses for this problem. Use statistical analysis software to test the
null hypothesis stated above.

Obtain the regression equation for predicting systolic blood pressure from job statistical
analysis software. If one knows that a subject in the future has a score on job satisfaction of
15, what is their systolic blood pressure predicted to be? What is the standard error of
estimate?

Job Satisfaction Systolic BP

34 124

23 128

23 19 157

43 133

56 116

47 125

32 147

16 167

55 110

25 156

If the random variable X follows a Poisson distribution with mean 3.4, find
18
20 P(X=6).

A random sample of 395 people were surveyed and each person was asked to report
19 the highest education level they obtained. The data that resulted from the survey is
summarized in the following table. Are gender and education level dependent at 5%
 level of significance?

High School Bachelors Masters Ph.D Total

Female 60 54 46 41 201

Male 40 44 53 57 194

Total 100 98 99 98 395

Calculate the correlation coefficient of the two variables shown in the table below.

Pers Ha Heig
on nd ht

20 A 17 150

B 15 154

C 19 169

D 17 172

E 21 175

Suppose a sample of 16 light trucks is randomly selected off the assembly line. The
trucks are driven 1000 miles and the fuel mileage (MPG) of each truck is recorded. It
21
is found that the mean MPG is 22 with a SD equal to 3. The previous model of the
light truck got 20 MPG. Conduct a t- test of the null hypothesis at p = 0.05.

The mean productivity rating for all employees at a company was 3.8 on a five- point
scale last year. This year you get ratings from a representative sample of fifteen
employees from the Human Research Management. Do the data from this sample
22 provide evidence that employee productivity in the department of Human Resource
Management is significantly higher than in the company as a whole? Write the null
and alternative hypotheses for this problem. Use statistical analysis software to test the
null hypothesis stated above.

Obtain the regression equation for predicting systolic blood pressure from job statistical
analysis software. If one knows that a subject in the future has a score on job satisfaction of
15, what is their systolic blood pressure predicted to be? What is the standard error of
estimate?
23
Job Satisfaction Systolic BP

34 124

23 128
 19 157

43 133

56 116

47 125

32 147

16 167

55 110

25 156

If the random variable X follows a Poisson distribution with mean 3.4, find
18
P(X=6).

A random sample of 395 people were surveyed and each person was asked to report
the highest education level they obtained. The data that resulted from the survey is
summarized in the following table. Are gender and education level dependent at 5%
level of significance?

19 High School Bachelors Masters Ph.D Total

Female 60 54 46 41 201

Male 40 44 53 57 194

Total 100 98 99 98 395

21
Calculate the correlation coefficient of the two variables shown in the table below.

Pers Ha Heig
on nd ht

A 17 150
20
B 15 154

C 19 169

D 17 172

E 21 175

Suppose a sample of 16 light trucks is randomly selected off the assembly line. The
21 trucks are driven 1000 miles and the fuel mileage (MPG) of each truck is recorded. It
is found that the mean MPG is 22 with a SD equal to 3. The previous model of the
 light truck got 20 MPG. Conduct a t- test of the null hypothesis at p = 0.05.

The mean productivity rating for all employees at a company was 3.8 on a five- point
scale last year. This year you get ratings from a representative sample of fifteen
employees from the Human Research Management. Do the data from this sample
22 provide evidence that employee productivity in the department of Human Resource
Management is significantly higher than in the company as a whole? Write the null
and alternative hypotheses for this problem. Use statistical analysis software to test the
null hypothesis stated above.

Obtain the regression equation for predicting systolic blood pressure from job statistical
analysis software. If one knows that a subject in the future has a score on job satisfaction of
15, what is their systolic blood pressure predicted to be? What is the standard error of
estimate?

Job Satisfaction Systolic BP

34 124

23 128

23 19 157

43 133

56 116

47 125

32 147

16 167

55 110

25 156

If the random variable X follows a Poisson distribution with mean 3.4, find
18
P(X=6).

22 A random sample of 395 people were surveyed and each person was asked to report
the highest education level they obtained. The data that resulted from the survey is
summarized in the following table. Are gender and education level dependent at 5%
19
level of significance?

High School Bachelors Masters Ph.D Total

 Female 60 54 46 41 201

Male 40 44 53 57 194

Total 100 98 99 98 395

Calculate the correlation coefficient of the two variables shown in the table below.

Pers Ha Heig
on nd ht

A 17 150
20
B 15 154

C 19 169

D 17 172

E 21 175

Suppose a sample of 16 light trucks is randomly selected off the assembly line. The
trucks are driven 1000 miles and the fuel mileage (MPG) of each truck is recorded. It
21
is found that the mean MPG is 22 with a SD equal to 3. The previous model of the
light truck got 20 MPG. Conduct a t- test of the null hypothesis at p = 0.05.

The mean productivity rating for all employees at a company was 3.8 on a five- point
scale last year. This year you get ratings from a representative sample of fifteen
employees from the Human Research Management. Do the data from this sample
22 provide evidence that employee productivity in the department of Human Resource
Management is significantly higher than in the company as a whole? Write the null
and alternative hypotheses for this problem. Use statistical analysis software to test the
null hypothesis stated above.

Obtain the regression equation for predicting systolic blood pressure from job statistical
analysis software. If one knows that a subject in the future has a score on job satisfaction of
15, what is their systolic blood pressure predicted to be? What is the standard error of
estimate?

Job Satisfaction Systolic BP

23 34 124

23 128

19 157

43 133

56 116
 47 125

32 147

16 167

55 110

25 156

18 If the random variable X follows a Poisson distribution with mean 3.4, find
P(X=6).
A random sample of 395 people were surveyed and each person was asked to report
the highest education level they obtained. The data that resulted from the survey is
summarized in the following table. Are gender and education level dependent at 5%
level of significance?

19 High School Bachelors Masters Ph.D Total

Female 60 54 46 41 201

Male 40 44 53 57 194

Total 100 98 99 98 395

Calculate the correlation coefficient of the two variables shown in the table below.

Pers Ha Heig
23 on nd ht

A 17 150
20
B 15 154

C 19 169

D 17 172

E 21 175

Suppose a sample of 16 light trucks is randomly selected off the assembly line. The
trucks are driven 1000 miles and the fuel mileage (MPG) of each truck is recorded. It
21
is found that the mean MPG is 22 with a SD equal to 3. The previous model of the
light truck got 20 MPG. Conduct a t- test of the null hypothesis at p = 0.05.

The mean productivity rating for all employees at a company was 3.8 on a five- point
scale last year. This year you get ratings from a representative sample of fifteen
22 employees from the Human Research Management. Do the data from this sample
provide evidence that employee productivity in the department of Human Resource
Management is significantly higher than in the company as a whole? Write the null
 and alternative hypotheses for this problem. Use statistical analysis software to test the
null hypothesis stated above.

Obtain the regression equation for predicting systolic blood pressure from job statistical
analysis software. If one knows that a subject in the future has a score on job satisfaction of
15, what is their systolic blood pressure predicted to be? What is the standard error of
estimate?

Job Satisfaction Systolic BP

34 124

23 128

19 157
23
43 133

56 116

47 125

32 147

16 167

55 110

25 156

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 Experiment with concepts of iteration, function, string and list K3

Identify the importance of tuples, dictionary traversal, dictionary methods, K3

CO2
files and operations

Model graphical representation of data, measures of central tendency and K3

CO3
measures of dispersion

Solve problems based on Binomial distribution, Poisson distribution, K3

CO4
sampling and regression analysis

CO5 Make use of various correlation tests and utilize statistical analysis software 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 √ √ √ √ √

CO2 √ √ √ √ √ √

CO3 √ √ √ √ √ √

CO4 √ √ √ √ √ √

CO5 √ √ √ √ √ √ √

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

Probability and Statistics for

1 Cengage Learning
Engineering and the Jay L Devore 9/e, 2020
India
Sciences

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

(DATA SCIENCE)
 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:

1. 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
Kruskal's algorithm, Dijkstra's shortest path algorithm, Floyd-Warshall
3 9
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

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 Entity, Relationship (ER) Model - Entity Types, Entity Sets, 11
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
2 Calculus - Structured Query Language (SQL)-Data Definition Language,
Data Manipulation Language, Assertions, Triggers, views, Relational 11
Database Design Using ER-to-Relational Mapping.
Database Design Theory & Normalization - Functional Dependencies -
3 Basic definition; Normalization- First, Second, and Third normal forms. 11
Transaction Management - Transaction Processing : Introduction, problems
 and 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
Sudarshan, Database System McGraw
1 System Concepts, 6/e, 7/e, 2011
Concepts, Hill,
McGraw
Hill, 2011.
Beginning Database Design
2 Rod Stephens Wiley 2/e, 2023
Solutions
Pramod J. Sadalage, Martin Addison-
2 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

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

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)

3 Virtual memory - Paging: Introduction, page tables and hardware support, 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

4 11.2) 10

Case study: Linux I/O schedulers - Elevator, Complete Fair Queuing (Book
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,
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.
(8x2 =16 marks)  Each 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)
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 Project Milestone Reviews,
Analytical thinking
Sessions/ Feedback,
and Testing
Brainstorming Project reformation (If
self-learning
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 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
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 9
Case study: Ariane launch failure
Object Oriented Software Design - UML diagrams and relationships– Static
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.
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)
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

FOUNDATIONS OF SECURITY IN COMPUTING

Course Code PECDT412 CIE Marks 40

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

Credits 3 Exam Hours 2 Hrs. 30 Min.

Prerequisites (if any) None Course Type Theory

Course Objectives:
1. To introduce the fundamental concepts of security in computing. The course will cover the
principles and practices used to secure computer systems and networks
2. To train the learners in cryptography, network security, software security, and security
policies.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Overview of Computer Security: Definition and importance, Historical
context. Fundamental Concepts: CIA triad: Confidentiality, Integrity,
Availability, Authentication, Authorization, and Accountability. Common
1 Threats and Vulnerabilities: Malware: Viruses, Worms, Trojans, Phishing, 8
Social Engineering, Denial of Service (DoS) attacks. Security Policies and
Risk Management: Developing and implementing security policies, Risk
assessment and mitigation.
Introduction to Cryptography: Basic concepts and terminology, Historical
background. Symmetric Encryption: Algorithms: DES, AES, Key
management. Asymmetric Encryption: Algorithms: RSA, ECC, Public and
2 10
private keys. Cryptographic Protocols: Digital signatures, Hash functions,
Public Key Infrastructure (PKI). Applications of Cryptography: Secure
communications (SSL/TLS), Email security (PGP, S/MIME).
Introduction to Network Security: Network security principles, Common
3 network threats. Network Security Protocols: IPsec, SSL/TLS, SSH, VPNs. 10
Firewalls and Intrusion Detection Systems (IDS): Types of firewalls, IDS and
 IPS systems. Wireless Network Security: Wireless encryption protocols
(WEP, WPA, WPA2), Securing wireless access points. Network Security
Practices: Network segmentation, Monitoring and logging.
Introduction to Software Security:- Importance of secure software,
Software development lifecycle (SDLC); Common Software Vulnerabilities -
Buffer overflows, SQL injection, Cross-site scripting (XSS), Cross-site
request forgery (CSRF). Secure Coding Practices: Input validation and
4 10
sanitization, Secure error handling, Code reviews and static analysis.
Software Security Testing: Penetration testing, Fuzz testing, Dynamic
analysis. Security in Software Development: Secure software development
frameworks, Integrating security into DevOps (DevSecOps)

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 basic principles and concepts of computer security. K2
CO2 Explain the cryptographic techniques and their applications. K2
CO3 Apply the knowledge of network security protocols and practices. K3
CO4 Model the software security vulnerabilities and mitigation strategies. K3

CO5 Identify security policies and risk management. K3

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

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

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

CO1 3 2 2

CO2 2 3 1 2 2 2

CO3 1 3 2 2 3 2

2 3 2 2 2 3
CO4

CO5 2 2 1 1 2 2

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

Text Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Computer Security: William Stallings and
1 Pearson 5/e, 2023
Principles and Practice Lawrie Brown
Cryptography and Network
2 Security: Principles and William Stallings Pearson 7/e, 2017
Practice
 Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Cryptography and Network
1 Atul Kahate McGraw Hill 4/e, 2019
Security
Cryptography And Network Behrouz A Forouzan, McGraw Hill
2 3/e, 2015
Security Debdeep Mukhopadhyay

Video Links (NPTEL, SWAYAM…)

No. Link ID
1 https://archive.nptel.ac.in/courses/106/105/106105162/
 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 (L: T:P: R) 3:0:0:0 ESE Marks 60

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 9
Types, Tuples and Lists.
[Text Ch. 1, 2, 3, 4, 5]
Programming with Lists; Defining Functions over Lists; Playing the Game:
2 I/O in Haskell; Reasoning about Programs; 9
[Text Ch. 6, 7, 8, 9]
Generalization: Patterns of Computation; Higher-order Functions; Developing
3 Higher-order Programs; Overloading, Type Classes and Type Checking. 9
[Text Ch. 10 11, 12, 13]
Algebraic Types; Case Study - Huffman Codes; Abstract Data Types; Lazy
4 Programming; Time and Space Behaviour. 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)

CO1 Write computer programs in a functional style. K2

Reason formally about functional programs and develop programs

CO2 K3
using lists.

CO3 Use patterns of computation and higher-order functions. 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

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
No. Hours
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,
1 Sequence representation) 8
Properties of DT Signals - Even and Odd, Periodic and non periodic signal,
Energy and Power signals. Periodicity and Symmetry property of DT signals,
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 10
Differencing, Parseval's theorem, Even/Odd symmetry, real sequences)
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 9
Differencing, Initial and Final Value Theorems 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
Barry Van Veen, Simon
2 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

MICROCONTROLLERS
(Common to AD/CD/CR)

Course Code PEADT418 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 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 Embedded Systems and ARM Cortex-M Architecture:-

Overview of embedded systems including definition, applications, and

characteristics, Embedded C Programming Basics and Key Concepts,
Differences and use cases of microcontrollers versus microprocessors,
1 Classification of processors including RISC, CISC, and other architectures, 8

Overview of ARM Cortex-M Series features and applications, Introduction

to Cortex-M23 and Cortex-M33 Processors: Armv8-M Architecture, Core
Features (Registers, Memory, Bus Architecture),Comparison with Previous
Cortex-M Generations.

STM32 Microcontroller Overview and Development Environment

Setup:-
2 10
Overview of the STM32 Family and Features of the STM32U575,
Development Environment and HAL- Introduction, Writing, and Debugging
Your First Program (LED Interfacing); Interfacing - Seven-Segment Display,
 LCD Display, Matrix Keypad, Relay, Analog to Digital Conversion-
Potentiometer, Temperature Sensor, LDR, Microphone, Digital to Analog
Conversion - Simple DAC Output, Sine Wave Generation, Audio Signal
Generation, Interrupt Handling Basics and Applications, Timers and PWM:
Configuration, Real-Time Clock (RTC), LED Brightness Control, Motor
Speed Control

Communication Protocols :-

Overview of Serial Communication Protocols- USART, I2C, and SPI,

3 Interfacing an I2C Temperature Sensor and Displaying Data on an LCD, 9

writing to and Reading from an SPIbased EEPROM, Implementing CAN
Communication Between STM32 Microcontrollers; Creating a USB HID
Device for Keyboard and Mouse Emulation.

IoT and RTOS:-

Introduction to IoT and its Layers of Architecture, Introduction to IoT

Communication Protocols including MQTT, CoAP, and HTTP, Securing IoT
Data Using Encryption Techniques, Wireless Communication Basics- GSM,
4 Interfacing GSM (Sending SMS, Making Calls, Internet Connectivity Using 9
AT Commands), Bluetooth(Data Transfer between STM32U575 and Mobile

Devices), RTOS Concepts: FreeRTOS Overview, Task Creation,

Scheduling, Timers, Inter-task Communication (Queues, Semaphores),
Designing an IoT-Based Home Automation System.

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,
● Total of 8 Questions, each out 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)

CO1 Explain the architectural features and instructions of the ARM K2

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.

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
 Text Books
Name of the Name of the Edition and
Sl. No Title of the Book
Author/s Publisher 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 and
Sl. No Title of the Book Name of the Author/s
Publisher Year
ARM System Developer’s Andrew N. Sloss, Dominic
1 Morgan Kaufman 1/e, 2008
Guide Symes, Chris Wright

Embedded System Design with

Cem Ünsalan, Hüseyin Deniz
2 Arm Cortex-M Springer 1/e, 2022
Gürhan, Mehmet Erkin Yücel
Microcontrollers

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/
 SEMESTER S4

FOUNDATIONS OF PATTERN RECOGNITION

Course Code PEADT415 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 provide a comprehensive understanding of the fundamental concepts and techniques of

pattern recognition.
2. To develop the ability to apply pattern recognition methods to solve practical problems.
3. To enhance skills in using modern tools and techniques for feature extraction, dimensionality
reduction, and machine learning algorithms

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Introduction to Pattern Recognition - Basics of pattern recognition,
Applications and examples, Statistical pattern recognition, Introduction to
classifiers: k-NN, Naive Bayes

Project 1: Image Classification using k-NN and Naive Bayes - Classify

images from the CIFAR-10 dataset using k-NN and Naive Bayes classifiers,
1 9
and the deliverables are code implementation, project report, and
presentation.

Assignments : Assignment on k-NN and Naive Bayes classifiers

Mini-project proposal submission

Feature Extraction and Dimensionality Reduction - Feature selection

2 techniques, Principal Component Analysis (PCA), Non-linear dimensionality 9

reduction methods (t-SNE, LLE)
 Project 2: Dimensionality Reduction for Handwritten Digit Recognition -
Use PCA and LDA to reduce the dimensionality of the MNIST dataset and
apply a classifier, and the deliverables are code implementation, project
report, and presentation.

Assignments: Assignment on PCA and LDA theory,

Mid-term project: Detailed report on feature extraction project

Machine Learning Algorithms for Pattern Recognition - Support Vector

Machines (SVM), Neural Networks and Deep Learning, Ensemble methods
(Random Forests, Gradient Boosting), Clustering techniques (k-means,
hierarchical clustering)

Project 3: Text Classification using SVM and Neural Networks - Classify

3 text documents from the 20 Newsgroups dataset using SVM and a simple 9
neural network, and the deliverables are code implementation, project report,
and presentation.

Assignments : Assignment on SVM and neural network theory

Group project on Ensemble methods applied to a complex dataset

Advanced Topics and Applications - Hidden Markov Models (HMM),

Bayesian Networks, Pattern recognition in speech and handwriting.

Project 4 : Speech Recognition using Hidden Markov Models - Develop a

speech recognition system using Hidden Markov Models using the dataset -
TIMIT Acoustic-Phonetic Continuous Speech Corpus. The deliverables are
code implementation, project report, and presentation. Tools: Python, HTK
(Hidden Markov Model Toolkit).

4 Project 5: Handwriting Recognition using Deep Learning - Develop a 9

handwriting recognition system using deep learning techniques using the

datasets - MNIST Handwritten Digits Dataset, IAM Handwriting Database.
The deliverables are code implementation, project report, and presentation.
Tools: Python, TensorFlow/Keras, OpenCV.

Project 6: Bayesian Networks for Medical Diagnosis - Use Bayesian

Networks to develop a system for medical diagnosis using the datasets - UCI
Machine Learning Repository, Hepatitis Dataset. The deliverables are code
 implementation, project report, and presentation. Tools: Python, PyMC3,
Netica.

Assignments:

Assignment on HMM and Bayesian networks

Final project: Comprehensive pattern recognition application

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

1. Code Implementation (40%) – 8 Marks

● Correctness (4 Marks): Code accurately implements the required algorithms (e.g., k-NN, Naive
Bayes, PCA, LDA, SVM, Neural Networks, HMM) and processes the dataset as expected. Code runs
without errors and produces the expected output for different scenarios or edge cases.
● Efficiency and Robustness (4 Marks): Code is optimized for efficiency, handling large datasets or
complex computations effectively, and includes error handling and can manage diverse data.
2. Results Analysis (60%) – 12 Marks
● Valuation Metrics (6 Marks): Proper use of evaluation metrics (e.g., accuracy, precision, recall, F1
score) to assess the performance of classifiers and dimensionality reduction techniques. Comparison
of different methods or classifiers and discussion on their effectiveness, including strengths and
limitations.
● Insightful Analysis (6 Marks): Interpretation of the results, including any anomalies or unexpected
findings. Based on results, provides thoughtful recommendations or insights for potential
improvements or alternative approaches.
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 =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 the fundamental concepts of pattern
CO1 K2
recognition and its applications.
Apply statistical and machine learning techniques to solve pattern
CO2 K3
recognition problems.
Implement feature extraction and dimensionality reduction techniques
CO3 K4
for various datasets.
Develop and evaluate different machine learning models for pattern
CO4 K5
recognition tasks.
Work on real-world pattern recognition projects, demonstrating
CO5 K5
problem-solving and project management skills.
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 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
Pattern Recognition and
1 Christopher M. Bishop Springer 1/e, 2009
Machine Learning
Mastering Machine Learning Giuseppe Bonaccorso Packt Publishing 2/e,2020
2
Algorithms

3 Richard Duda, Peter Hart, Wiley 2/e, 2007

Pattern Classification
David Stork
Ian Goodfellow, Yoshua
4 Deep Learning McGraw-Hill 1/e, 1997
Bengio, and Aaron Courville
Feature Extraction and Image Mark Nixon and Alberto
5 Academic Press 3/e, 2012
Processing for Computer Vision Aguado

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

The Nature of Statistical Learning Springer-Verlag New

1 Vladimir Vapnik 2/e, 2010
Theory York Inc.

The Elements of Statistical Jerome Friedman, Springer-Verlag New

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

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

3
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

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. 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.
(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
2 6
cost - Opportunity cost - short run cost curves - Revenue concepts
 Firms and their objectives – Types of firms – Markets - Perfect Competition
– Monopoly - Monopolistic Competition - Oligopoly (features and
equilibrium of a firm)

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

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

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

3 6
National income – Concepts - Circular Flow – Methods of Estimation and
Difficulties - Stock Market – Functions- Problems faced by the Indian stock
market-Demat Account and Trading Account – Stock market Indicators-
SENSEX and NIFTY
Value Analysis and value Engineering - Cost Value, Exchange Value, Use
Value, Esteem Value - Aims, Advantages and Application areas of 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):

Assignment/ Internal Internal

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

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

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

Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Leland Blank P.E,
1 Engineering Economy Mc Graw Hill 7TH Edition
Anthony Tarquin P. E.
2 Indian Financial System Khan M. Y. Tata McGraw Hill 2011
Engineering Economics and Donald G. Newman,
3 Engg. Press, Texas 2002
analysis Jerome P. Lavelle
Contemporary Engineering Prentice Hall of India
4 Chan S. Park 2001
Economics Ltd

=
 SEMESTER S3/S4

ENGINEERING ETHICS AND SUSTAINABLE DEVELOPMENT

Course Code UCHUT347 CIE Marks 50

Teaching Hours/Week 2:0:0:0

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

Credits 2 Exam Hours 2 Hrs. 30 Min.

Prerequisites (if any) None Course Type Theory

Course Objectives:

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

SYLLABUS

Module Contact
Syllabus Description
No. Hours

Fundamentals of ethics - Personal vs. professional ethics, Civic Virtue,

Respect for others, Profession and Professionalism, Ingenuity, diligence
and responsibility, Integrity in design, development, and research domains,

1 Plagiarism, a balanced outlook on law - challenges - case studies, 6

Technology and digital revolution-Data, information, and knowledge,
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

3 initiatives. Circular Economy and Degrowth: Introduction to the circular 6

economy model, Differences between linear and circular economies,
degrowth principles, Strategies for implementing circular economy practices
and degrowth principles in engineering. Mobility and Sustainable
Transportation: Impacts of transportation on the environment and climate,
Basic tenets of a Sustainable Transportation design, Sustainable urban
mobility solutions, Integrated mobility systems, E-Mobility, Existing and
 upcoming models of sustainable mobility solutions.

Renewable Energy and Sustainable Technologies: Overview of renewable

energy sources (solar, wind, hydro, biomass), Sustainable technologies in
energy production and consumption, Challenges and opportunities in
renewable energy adoption. Climate Change and Engineering Solutions:
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
4 6
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
3. Undertake a project study based on the concepts of G 12
reflections)
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

Virtue Ethics and Professional Cambridge University November

2 Justin Oakley
Roles Press & Assessment 2006

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

Sustainable Engineering Cambridge University

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

Professional ethics and human New age international

6 RS Naagarazan 2006.
values (P) limited New Delhi

Tata McGraw Hill

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

Module-II

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

Module-III

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

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.
 Create a new process using a fork system call. Print the parent and child process IDs. Use
4 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
priorities. Then simulate FCFS, SRTF, non-preemptive priority (a larger priority number
9 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-
Operating Systems: Three Easy
1 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

The Design of the UNIX

1 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).
Database initialization - Data insert, Data import to a database (bulk import using UI and
3
SQL Commands).
Practice SQL commands for DML (insertion, updating, altering, deletion of data, and
4
viewing/querying records based on condition in databases).
Implementation of various aggregate functions, Order By, Group By & Having clause in
5
SQL.
6 Implementation of set operators nested queries, and join queries.
Practice of SQL TCL DCL commands like Rollback, Commit, Savepoint,Practice of SQL
7
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.
Design a database application using any front-end tool for any problem selected in
11
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
Database System Concepts, Sliberschatz Korth and S.
1 McGraw Hill, 7/e, 2017
Sudarshan
John Wiley &
2 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.

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/

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
(DATA SCIENCE)
 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:

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

2. To develop problem-solving skills using various algorithm design paradigms like divide and
conquer, dynamic programming, etc.

3. 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 complexities in asymptotic notations. K4

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 Disjoint sets. K3

Illustrate the representation, traversal and different operations on

CO4 Graphs. K3

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 discuss strategies to address intractability. K4

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

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 3 3 2 3
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 4/e, 2011
3 Pearson Education
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

DATA ANALYTICS

Course Code PCCDT503 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 the knowledge and skills necessary to analyze and interpret complex
data sets to extract useful patterns and relationships between data.
2. To teach how to handle data effectively, perform exploratory data analysis, build predictive
models and communicate findings through data visualization.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Introduction to Data Analytics-Analytics Process Model, Analytical Model
Requirements. Data Analytics Life Cycle overview,
Probability calculus - probability distributions, Hypothesis Testing - Basic
definitions.
1 Proximity measures - Data Objects, Attribute types, Dissimilarity and 11
Similarity measures
Statistical Description of data - Central tendency, Dispersion, Range,
Quartiles, Variance, Standard Deviation, and Interquartile Range.

Association of Two Variables-Summarizing the Distribution of Two

Discrete Variables, Contingency Tables for Discrete Data, Joint, Marginal,
and Conditional Frequency Distributions, Graphical Representation of Two
2 11
Nominal or Ordinal Variables, Measures of Association for Two Discrete
Variables, Association Between Ordinal and Continuous Variables,
Visualization of Variables from Different Scales.
 Data Preprocessing – Cleaning, Integration, Reduction, Transformation,
Discretization
Mining Frequent Patterns - Associations, Correlations, and Apriori
Algorithms.
3 11
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 Boolean queries, tokenization, stemming, phrase queries, vector
4 11
space 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
Describe the tools to analyse, summarize, and visualize associations K2
CO2
between two variables and various measures of association
Use the concepts of association rule mining and the basic clustering K3
CO3
and classification algorithm on small datasets.
CO4 Explain the basics of text analytics and text classification 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 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
Introduction to Statistics and Christian Heumann,
1 Springer 1/e, 2016
DataAnalysis Michael Schomaker
Jiawei Han, Micheline
2 Data Mining Concepts and Techniques Elsevier 3/e, 2012
Kamber
 Reference Books
Sl. Name of the Edition
Title of the Book Name of the Author/s
No Publisher and Year
Introduction To Data Pang-Ning Tan, Michael Pearson
1 1/e, 2016
Mining Steinbach, Vipin Kumar Education
Analytics in a Big Data World: The Essential
John Wiley
2 Guide to Data Science and its Business Bart Baesens 1/e, 2014
Sons
Intelligence and Analytic Trends
Charu C. Aggarwal,
3 Mining Text Data Springer 1/e, 2012
ChengXiang Zhai

Video Links (NPTEL, SWAYAM…)

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

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

4 https://archive.nptel.ac.in/courses/106/105/106105158/
 SEMESTER S5

BIG DATA PROCESSING

Course Code PBCDT504 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 provide an overview of storage, retrieval and processing of big data.

2. To introduce the tools and techniques employed to handle Big Data using technologies such
as Map Reduce, Hadoop, Hbase, Pig, Hive and Spark.
SYLLABUS

Module Contact
Syllabus Description
No. Hours

Introduction to Big data and Hadoop Distributed File System:-

Evolution of Big data, Big data characteristics, RDBMS and Big Data.

1 History of Hadoop, Hadoop Ecosystem and Core Components, HDFS 11

Architecture: Blocks, Name nodes and Data nodes, Using HDFS Files -
Basic File system Operations, Hadoop Specific File Types. Anatomy of a file
read and write.

MapReduce Programming:-

Data Processing with MapReduce: Execution Pipeline, Runtime

Coordination and Task Management in MapReduce, Designing MapReduce
2 implementations: Using MapReduce as a framework for parallel processing, 11

Face Recognition Example: Simple Data Processing with MapReduce,

Inverted Indexes Example, Road Enrichment Example. Projects using R,
Python, Java
 HBase and Stream Data Model:-

3 HBase Architecture, HBase Schema Design, Introduction to Stream 11

Concepts, Stream Data Model and Architecture, Sampling Data in a Stream,
Filtering Streams, Counting Distinct Elements in a Stream.

Hive, Pig, Spark:-

Hive - Features, Data types and file formats, primitive and collection data
types, HiveQL-Creating tables, Dropping Tables, Alter table.
4 11
Pig : Data Model, Pig Latin: Structure, Functions, Spark: Storage layers for
spark, Core spark concepts, RDD basics, RDD Operations.

Projects using R,Python,Java

Suggestion on Project Topics

Log File Analysis: Collect log files from web servers or applications and analyze them to extract
useful information like error rates, traffic patterns, and popular pages.

Sentiment Analysis on Social Media Data: Collect tweets or social media posts and perform
sentiment analysis to understand public opinion on a particular topic or product.

Recommendation System: Build a recommendation system based on user behavior data, such as
purchase history or viewing patterns.

Word Count with MapReduce: Implement the classic word count problem where you count the
frequency of each word in a large set of text documents.

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)

CO1 Explain the principles of big data and distributed systems, including K2
the characteristics of large datasets and the fundamentals of building
and maintaining reliable, scalable, distributed systems.

CO2 Infer the mechanisms of distributed storage and processing, with a K3

specific focus on the role of HDFS (Hadoop Distributed File System)
in effective data storage.

CO3 Model the distributed processing of large data sets across clusters using K3
simple programming models.

CO4 Identify and understand the fundamentals of stream computing and the K2
usage of HBase.

CO5 Apply the fundamental features and components of Hive, Pig, and K3
Spark for data processing.

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 3

CO4 3 3 3 3 2 3

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

Boris Lublinsky, Kevin T. Smith, Wrox

1 Professional Hadoop Solutions 1/e, 2013
Alexey Yakubovich

The Art of R Programming: A

No Starch
2 Tour of Statistical Software Norman Matloff 1/e, 2011
Press
Design

Learning Spark, Lightning- Holden Karau, Andy Konwinski,

3 O'Reilly 2/e, 2020
Fast Data Analytics Patrick Wendell, Matei Zaharia

Jason Rutherglen, Dean Wampler,

4 Programming Hive O'Reilly 1/e, 2012
Edward Capriolo

Cambridge
Jure Leskovec, Anand Rajaraman
5 Mining of Massive Datasets University 3/e, 2020
and Jeffrey David Ullman,
Press

DreamTech
6 BIG DATA, Black Book Black Book TM 1/e, 2016
Press

R for Everyone: Advanced Pearson

7 Jared P. Lander 2/e, 2018
Analytics and Graphics Education
 Reference Books

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

Seema Acharya,
1 Big Data and Analytics Wiley 2/e, 2019
Subhasni Chellappan

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.

https://youtu.be/r5k-_RLIpuA
1
https://onlinecourses.nptel.ac.in/big data computing

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

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 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 Hrs.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 methodologies, Relationship between Agile Scrum, Lean, DevOps and IT 9
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 PRIVACY AND SECURITY

Course Code PECDT523 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 fundamental understanding of data security, encryption and confidentiality.

2. To introduce students to the concepts of hash functions, digital signatures and data hiding within
text and images.
3. To provide learners an overview of legal and ethical issues in data.
SYLLABUS

Module Contact
Syllabus Description
No. Hours
Introduction to Security and Ciphers
Introduction: Security goals, Cryptographic Attacks, Services and Mechanism,
Techniques. Traditional Symmetric Key Ciphers: Introduction, Substitution
1 12
Ciphers, Transposition Ciphers, Stream and Block Ciphers. Introduction to
Modern Symmetric-Key Ciphers: Modern Block Ciphers, Modern Stream
Ciphers.
Symmetric and Asymmetric encryption algorithms
Data Encryption Standard (DES): Introduction, DES Structure, DES Analysis,
Multiple DES, Security of DES. Advanced Encryption Standard (AES):
2 12
Introduction, Transformations, Key Expansion, AES Ciphers, Analysis of AES.
Asymmetric-Key Cryptography: Introduction, RSA Cryptosystem, Rabin
Cryptosystem, Elgamal Cryptosystem, Elliptic Curve Crypto systems.
Hash Functions, Digital Signature and Data Hiding
3 Cryptographic Hash Functions: Introduction, Iterated Hash function, SHA-512, 12
WHIRLPOOL. Digital Signature: Comparison, Process, Services, Attacks on
 Digital Signature, Digital Signature Standard. Data Hiding in Text: Basic
Features, Applications of Data Hiding, Watermarking, Intuitive Methods,
Simple Digital Methods, Data Hiding in Text, Innocuous Text, Mimic
Functions. Data Hiding in Images: LSB Encoding, BPCS Steganography,
Lossless Data Hiding, Spread Spectrum Steganography, Data Hiding by
Quantization, Patchwork , Signature Casting in Images, Transform Domain
Methods, Robust Data Hiding in JPEG Images, Robust Frequency Domain
Watermarking, Detecting Malicious Tampering.
Privacy, Legal and Ethical Issues
Privacy: Privacy Concepts, Privacy Principles and Policies, Authentication and
Privacy, Data Mining, Privacy on the Web, E-Mail Security, Impacts on
4 Emerging Technologies. Legal and Ethical Issues in Computer Security: 12
Protecting Programs and Data, Information and the Law, Rights of Employees
and employers, Redress for Software Failures, Computer Crime, Ethical Issues
in Computer Security.

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 thorough understanding of core data security concepts,
CO1 including the operation and application of different symmetric key K2
ciphers to effectively safeguard information.
Apply a range of encryption standards to achieve robust data protection
CO2 and confidentiality, ensuring secure transmission and storage of K3
sensitive information.
Gain proficiency in the use of hash functions for data security and
CO3 master techniques for embedding and concealing data within text and K2
images to safeguard sensitive information.
Acquire a comprehensive understanding of privacy principles,
CO4 authentication methods and security protocols for web and email K2
communications, ensuring secure and private digital interactions.
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create

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

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 2 2 2 2 - - 3
CO2 2 2 3 3 2 2 - - 3
CO3 3 2 2 2 3 2 - - 3
CO4 3 3 3 2 2 3 - - 3
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
Behrouz A. Forouzan,
1 Cryptography and Network Security TMH 2/e, 2013
Dedeep Mukhopadhyay
2 Data Privacy and Security Salomon, David Springer 1/e, 2003
Charles Pfleeger, Shari
3 Security in Computing PHI 5/e, 2015
Lawrence Pfleeger

Reference Books
Edition
Name of the Name of the
Sl. No Title of the Book and
Author/s Publisher
Year
Information Security: Principles and
1 Mark Stamp Wiley Inter Science 2011
Practice
2 Computer Security: Art and Science Matt Bishop Addison Wesley 1/e, 2002
3 Cryptography and Network Security William Stallings Pearson Education 7/e, 2017

Video Links (NPTEL, SWAYAM…)

Module No. Link ID

1 https://nptel.ac.in/courses/106105162
2 https://nptel.ac.in/courses/106105162
3 https://nptel.ac.in/courses/106105162
 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

COMPUTATIONAL BIOLOGY

Course Code PEADT526 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 exposure in Computational Tools and Techniques for Biological Data Analysis
2. To equip students with hands-on experience in applying computational tools and software to
biological problems and to familiarize them to current research trends in computational
biology.
SYLLABUS

Module Contact
Syllabus Description
No. Hours
Introduction to biomolecules, DNA, RNA, and Protein: The Central Dogma,
Messenger RNA, tRNA, rRNA, Genetic code, Gene Structure and Control,
1 9
Transcription, translation, introduction to structure of prokaryotic and
eukaryote gene
Introduction to Biological Databases: NCBI, Genbank, Bio sequence
formats:FASTA, Sequence alignment: Global Alignment and Local
Alignment, Dot Matrix Method, Dynamic Programming Method, Gap
2 10
Penalties, Amino Acid Scoring Matrices: PAM and BLOSUM, Database
Similarity Searching, BLAST, Needleman and Wunsch and Smith–
Waterman Method, Multiple Sequence Alignment, scoring function, Clustal,
Transcriptional Regulatory Networks, Genes and DNA Regulatory Regions,
Genetic Interaction Map, Protein Interaction Networks, Experimental
methodologies to obtain Protein Interaction Data, Computational methods to
3 10
Predict Protein: Protein Interactions, Visualization of Protein Interaction
Networks, Metabolic Networks, Interacting Partners, Mathematical
Representation.
 Next-Generation Sequencing (NGS) Technologies, Illumina Reversible Dye-
Terminator Sequencing, Ion Torrent Semiconductor Sequencing, Pacific
Biosciences Single Molecule Real-Time (SMRT) Sequencing, RNA-
4 sequencing (RNA Seq), Protein-DNA Interaction Analysis (ChIP-Seq), Base 9
Calling, FASTQ File Format, and Base Quality Score, NGS Data Quality
Control and Preprocessing, Reads Mapping, Mapping Approaches and
Algorithms

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 structure and function of DNA, RNA proteins, Gene
CO1 K2
structure and process of transfer of information from DNA to protein
Identify biological data formats and databases and employ similarity
CO2 searching tools and algorithms to align sequences to highlight the K3
similarity
Demonstrate Networks in Biology, types of networks and its
CO3 K3
representation
Explain Next Generation sequencing Technologies and DNA Protein
CO4 K3
interaction analysis
CO5 Apply computational tools and algorithms to analyze NGS data. 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 Name of the Edition
Sl. No Title of the Book
Author/s Publisher and Year
Oxford University
1 Introduction to Bioinformatics Lesk, Arthur M 5/e. 2019
Press
Bioinformatics and Computational
Springer Nature
2 Biology Basant K. Tiwary 1/e, 2022
Singapore
A Primer for Biologists
Bioinformatics
3 Jeremy Ramsden Springer London 1/e,2016
An Introduction
An Introduction to Bioinformatics Neil C. Jones, Pavel
4 MIT Press 1/e, 2004
Algorithms Pevzner
Next-Generation Sequencing Data
6 Wang, Xinkun CRC Press 1/e, 2016
Analysis

Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Bioinformatics and Computational
1 Tiwary, Basant K Springer 1/e, 2022
Biology: A Primer for Biologists
Quickstart Molecular Biology: An
Cold Spring
Introductory Course for
2 Benfey, Philip N. Harbor 1/e. 2014
Mathematicians, Physicists, and
Laboratory Press
Computational Scientists
Baxevanis, Andreas D.,
John Wiley &
3 Bioinformatics Gary D. Bader, and 4/e, 2020
Sons
David S. Wishart
Shaik, Noor Ahmad, et
4 Essentials of Bioinformatics Springer 1/e, 2019
al
Selzer, Paul M., Richard
5 Applied bioinformatics J. Marhöfer, and Springer, Verlag 1/e, 2008
Andreas Rohwer
S C Rastogi, N
Bioinformatics: Methods and PHI Learning
6 Mendiratta and P 4/e, 2013
Applications Private Limited
Rastogi
Fundamental Concepts of D E Krane and M L
7 Pearson Education 1/e. 2006
Bioinformatics Raymer
Bioinformatics: Sequence and Bradley E. Shapiro and
8 Garland Science 1/e, 2007
Genome Analysis Jennifer J. Dudock
 Video Links (NPTEL, SWAYAM…)
Module
No.
1 https://onlinecourses.swayam2.ac.in/cec21_bt04/preview
2 https://onlinecourses.nptel.ac.in/noc20_bt08/preview
3 https://onlinecourses.nptel.ac.in/noc23_bt34/preview
4 https://onlinecourses.nptel.ac.in/noc23_bt34/preview
 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 preprocessing 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 :-

Data Preprocessing - Need of data preprocessing, Data Cleaning- Missing

2 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, Pattern 10
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 warehousing K2
CO1
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
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and 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
Name of the Name of the Edition
Sl. No Title of the Book
Author/s Publisher and 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ó Barabási Cambridge University
2 Network Science 1st, 2016
and Márton Pósfai Press
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 S5

DATA ANALYTICS LAB

Course Code PCCDL508 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) PCCST503 Course Type Lab

Course Objectives:

1. To impart the knowledge on the Big Data Technologies for processing the Different types of
Data.Configure Hadoop and perform File Management Tasks
2. To enable the learner to analyze big data using machine learning techniques

Expt. No. Experiments

Set up and install Hadoop and explore the various shell commands in Hadoop and
1 implement file management tasks.

Implement a word count program using Map Reduce to find the number of occurrences of
2 specific keywords from an input file.

Using the structure of the Word Count program, write a Hadoop program that calculates the
3 average word length of all words that start with each character.

4 Write a Map Reduce program for removing stop words from the given text files

5 Implement matrix multiplication with Hadoop Map Reduce

6 Implement Pig Latin scripts to sort, group, join, project, and filter data.

7 Implementing Database Operations on Hive

8 Write an R program to find the factorial and check for palindromes.

Implement a program to find variance, covariance and correlation between different types
9 of attributes
 10 Write an R program to solve linear regression and make predictions.

11 Write an R program to solve logistic regression.

12 Implement SVM and Decision tree Classifier using R

13 Implement KNN and Naive Bayes Classifier using R

Implement a Spark program that does the following:
i) Count the total number of observations included in the dataset ii). Count the number of
14
years over which observations have been made iii) Display the oldest and the newest year
of observation
15 Implement clustering techniques using SPARK.

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 Configure Hadoop and perform File Management Tasks K3
CO2 Implement different tasks using Hadoop Map Reduce programming model K3
Apply different data processing tools like Pig and Hive to real time issues
CO3 K3
like weather dataset and sales of a company
Implement data extraction from files and analyze big data using machine
CO4 learning techniques in R. K3

CO5 Illustrate the knowledge of Spark to analyze data in real-life scenarios. 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 2 1 3
CO2 3 3 2 1 3 2 1 3
CO3 3 3 2 1 3 2 1 3
CO4 3 3 2 1 3 2 1 3
CO5 3 3 2 1 3 2 1 3
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 Mastering Apache Spark Mike Frampton Packt Publishing 1/e,2015

2 Hadoop: The Definitive Guide Tom White O'reilly Media 4/e, 2015

3 Machine Learning with Spark Nick Pentreath Pract Publishing 1/e, 2015

Big Data Analytics with Spark: A

4 Practitioner's Guide to Using Spark for Mohammed Gulle Apress 1/e.2015

Large Scale Data Analysis

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

Big Data Fundamentals: Concepts, Thomas Erl, Wajid

1 Pearson 1/e,2016
Drivers & Techniques Khattak, and Paul Buhler

Programming Pig Dataflow

2 Alan Gates O’Reilly 1/e. 2011
Scripting with Hadoop

Jason Rutherglen, Dean O’Reilly

3 Programming Hive 1/e, 2012
Wampler, Edward Caprialo

4 BIG DATA Black Book TM DreamTech 1/e,2016

 Video Links (NPTEL, SWAYAM…)
Module
Link ID
No.

1 Big Data Computing: https://nptel.ac.in/courses/106104189

Data Science on Apache Spark. Databricks. https://databricks.com/blog/2015/06/01/databricks-

2
launches-moocdata-science-on-spark

Advanced R Programming for Data Analytics in Business:

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

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
(DATA SCIENCE)
 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) PCCST302 Course Type Theory

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

Compiler Design in C Allen Holub Prentice-Hall software 1/e, 1990

3
series
Modern Compiler Cambridge University
4 Andrew W. Appel 2/e, 2004
Implementation in C Press

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
1-4 https://archive.nptel.ac.in/courses/106/105/106105190/
 SEMESTER S6

MACHINE LEARNING
Course Code PCCDT602 CIE Marks 40

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

Credits 3 Exam Hours 2 Hrs 30 Mins

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 –

ID3
2 9
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 Dimensionality reduction - Principal Component Analysis, Multidimensional 9
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/ Examination-1 Examination- 2
Attendance Total
Microproject
(Written) (Written )

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

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

Part A Part B Total

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

module. ● Two questions will be given from each module, out
● Total of 8 Questions, each of which 1 question should be answered.
carrying 3 marks ● Each question can have a maximum of 3 60

subdivisions.
(4x9 = 36 marks)
(8x3 =24 marks)

Course Outcomes (COs)

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

Bloom’s
Course Outcome Knowledge
Level (KL)

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

DATA WAREHOUSING
Course Code PECDT632 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 data warehousing concepts, architecture,

and the role of dimensional modeling in designing data warehouses.
2. To equip students with practical skills in ETL processes, OLAP operations, and
optimizing data warehouses for real-world applications.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Introduction to Data Warehousing :-

Overview of Data Warehousing - Need, Definition, Characteristics, Benefits,

Operational vs. Analytical Systems, Applications in Industry; Architecture of
1 Data Warehousing - Data Sources, Staging Area, Data Marts, ETL (Extract, 9
Transform, Load) Processes, Components of a Data Warehouse (Data Models,
OLAP, Metadata); Data Warehouse Models - Enterprise Data Warehouse,
Virtual Warehouse, Data Mart [Text 1 : Ch 1 -3]

Dimensional Modeling & Design :-

Dimensional Modeling Basics - Facts, Dimensions, Star Schema, Snowflake

Schema; Steps in Dimensional Modeling; Fact Tables, Dimension Tables; Data
2 Warehouse Design - Top-Down & Bottom-Up, Fact Table Granularity; Slowly 9
Changing Dimensions; Advances in Dimensional Modeling - Aggregates &
Roll-Up, Time Dimension, Junk Dimensions, Degenerate Dimensions. [Text 2 :
Ch 1-5]
 ETL Processes & Tools :-

ETL Concepts and Process - Extracting Data from Multiple Sources, Data
Transformation and Cleansing, Loading Data; ETL Tools and Platforms -
3 Common ETL Tools (Informatica, Talend, Microsoft SSIS), Scheduling and 9
Automation of ETL Processes; Data Quality and Data Governance in ETL -
Handling Incomplete and Inconsistent Data, Ensuring Data Accuracy,
Consistency, and Integrity. [Text 1 : Ch 4-7]

Data Warehouse Optimization & OLAP :-

Query Optimization in Data Warehouses - Indexing Strategies, Partitioning,

Performance Tuning; OLAP - Architectures: MOLAP, ROLAP, HOLAP;
4 9
Operations: Drill-Down, Roll-Up, Slicing, Dicing; Data Warehouse Maintenance
- Data Loading Automation, Backup, and Recovery, Data Warehouse Evolution
and Scalability. [Text 1 : Ch 8-10, Text 2 : Ch 7-9]

Course Assessment Method

(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

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

5 15 10 10 40

End Semester Examination Marks (ESE)

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

Part A Part B Total

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

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

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

Bloom’s
Course Outcome Knowledge
Level (KL)
Develop a data warehouse using dimensional modeling techniques
CO1 such as star and snowflake schemas, effectively organizing facts and K3
dimensions.

Apply ETL processes to extract, transform, and load data from various
CO2 K3
sources into a data warehouse, ensuring data quality and integrity.

Apply data warehouse performance optimization using indexing,

CO3 partitioning, and other query optimization techniques for efficient data K3
retrieval and processing.

Utilize OLAP tools and techniques to perform multidimensional data

CO4 analysis, including drill-down, roll-up, and slicing operations on large K3
datasets.

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

CO4 3 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 Data Warehousing Fundamentals for IT

Paulraj Ponniah Wiley 2/e, 2010
Professionals

2 The Data Warehouse Toolkit: The Definitive Ralph Kimball,

Wiley 3/e, 2013
Guide to Dimensional Modeling Margy Ross
 Reference Books

Name of the Edition

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

DW 2.0: The Architecture for the

1 Derek Strauss, Genia Morgan
Next Generation of Data 1/e, 2008
Neushloss, W.H. H. Inmon Kaufman
Warehousing
2 Data Warehousing and Data Mining Express Learning [eBook] ITL Education 1/e, 2012

3 Building the Data Lakehouse Bill Inmon Technics Pub. 1/e, 2021
 SEMESTER S6

BASICS OF ROBOTICS AND AUTOMATION

Course Code PECDT633 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 learners to the fundamental concepts and algorithms in Robotic Systems.

2. To understand the standard hardware and kinematic concepts for robot design.
3. To use standard algorithms for localization, mapping, path planning, navigation and obstacle
avoidance in intelligent robots.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Introduction to robotics: Degrees of freedom, Robot types, Manipulators,
Anatomy of a robotic manipulator-links, joints, actuators, sensors,
controllers. Robot configurations-PPP, RPP, RRP, RRR, Mobile robots-
wheeled, legged, aerial robots, underwater robots, surface water robots,
1 10
Dynamic characteristics- speed of motion, load carrying capacity & speed of
response, Introduction to End effectors - mechanical grippers, special tools,
Magnetic grippers, Vacuum grippers, adhesive grippers, Active and Passive
grippers. Ethics in robotics - 3 laws - applications of robots.
Sensor classification: Sensor classification, Internal sensors-Position
sensors, velocity sensors, acceleration sensors, Force sensors external
sensors-contact type, non-contact type, Digital Camera - CCD camera -
2 CMOS camera - Omnidirectional cameras Sensor characteristics, Actuators - 8
DC Motors - H-Bridge - Pulse Width Modulation, Stepper Motors – Servos ,
Hydraulic & pneumatic actuators, Control - On-Off Control - PID Control,
Velocity Control and Position Control
 Representation of Transformations: Representation of a Pure Translation,
Pure Rotation about an Axis, Combined Transformations
Transformations Relative to the Rotating Frame, Basic understanding of
Differential-Drive Wheeled Mobile Robot, Car-Like Wheeled Mobile Robot,
Kinematic model of a differential drive and a steered mobile robot, Degree
of freedom and manoeuvrability, Degree of steerability, Degree of mobility,
Different wheel configurations, holonomic and nonholonomic robots,
3 Omnidirectional Wheeled Mobile Robots, Position and Orientation - 12
Representing robot position
Basics of reactive navigation, Robot Localization, Challenges in localization,
An error model for odometric position estimation. Map Representation
Continuous representations, Decomposition strategies, Current challenges in
map representation, Probabilistic map-based localization (only Kalman
method), Autonomous map building, Simultaneous localization and mapping
(SLAM)
Path Planning: Graph search, deterministic graph search - , breadth first
search - depth first search- Dijkstra’ s algorithm, A*, D* algorithms,
Potential field based path planning, Obstacle avoidance - Bug algorithm -
Vector Field Histogram - Dynamic window approaches, Navigation
4 10
Architectures - Modularity for code reuse and sharing - Control localization,
Techniques for decomposition, Alternatives for navigation - Neural
networks, Processing the image - Training the neural network for navigation
- Convolutional neural network robot control implementation

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 concepts of manipulator and mobile robotics. K2
CO2 Choose suitable sensors, actuators and control for robot design K3
Developing kinematic models of mobile robots and understanding
CO3 K3
robotic vision intelligence.
CO4 Discover the localization and mapping methods in robotics K3
Plan the path and navigation of robot by applying artificial intelligence
CO5 K3
algorithm
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 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 Autonomous Illah Reza Nourbakhsh
1 MIT Press 2/e, 2004
Mobile Robots and Roland Siegwart
2 Fundamentals of Robotics D.K. Pratihar Narosa Publishing 1/e, 2017
Introduction to Robotics:
3 Analysis,Control, Applications Saeed B. Niku Wiley 1/e, 2024

Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Artificial Intelligence for
1 Francis X Govers Packt Publishing 1/e, 2018
Robotics

Video Links (NPTEL, SWAYAM…)

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

CLOUD COMPUTING

Course Code PECDT634 CIE Marks 40

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

Credits 3 Exam Hours 2 Hrs. 30 Min.

None
Prerequisites (if any) Course Type Theory

Course Objectives:

1. To introduce the concepts of Cloud Computing and Cloud Enabling Technologies

2. To provide an overview of the issues involved in Cloud Management, Storage and Cloud
Security
3. To introduce the learners to various Cloud softwares and computing platforms

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Introduction to Cloud Computing: Evolution of Cloud Computing - Cloud
Characteristics-Elasticity in Cloud- On-demand Provisioning - NIST Cloud
1 Computing- Reference Architecture -Architectural Design Challenges- 10
Deployment Models: Public, Private and Hybrid Clouds Service Models:
IaaS PaaS SaaS Benefits of Cloud Computing.
Introduction to Web Service and Service Oriented Architecture-:SOAP -
REST - Basics of Virtualization Full and Para Virtualization -

2 Implementation Levels of Virtualization- Tools and Mechanisms - 8

Virtualization of CPU- Memory -I/O Devices -Desktop Virtualization-
Server Virtualization.

Resource Provisioning and Methods: Cloud Management Products- Cloud

3 Storage -Provisioning Cloud Storage -Managed and Unmanaged Cloud 10
Storage -Cloud Security- Overview- Cloud Security- Challenges- Security
 Architecture design- Virtual Machine-Security Application Security- Data
Security
HDFS- Map Reduce- Google App Engine (GAE)- Programming
Environment for GAE-Architecture of GFS -Case Studies: Openstack,
4 8
Heroku, and Docker Containers -Amazon EC2, AWS, Microsoft Azure,
Google Compute Engine.

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 concepts of Cloud Computing K2

CO2 Identify Cloud Enabling Technologies K2

CO3 Explain the issues in Cloud Management, Storage and Security K2

CO4 Use various Cloud softwares and computing platforms K3

CO5 Use the tools in various Cloud Computing platforms 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 3 3 3

CO2 3 3 3 3 3 3

CO3 3 3 3 3 3 3 3

CO4 3 3 3 3 3 3

CO5 3 3 3 3 3 3 3

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

 Text Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Distributed Systems - Principles and Andrew S. Tanenbaum,
1 Pearson 2/e, 2016
Paradigms Maarten Van Steen
Distributed and Cloud Computing,
Kai Hwang, Geoffrey C Morgan
2 From Parallel Processing to the Internet 1/e, 2012
Fox, Jack G Dongarra Kaufmann
of Things
Sudheep E.M, Sarith
Cengage
3 Cloud Computing and Big Data Divakar M, Lija M, 1/e, 2024
Learning
Tanmay K.P, Shubham A

Reference Books
Name of the Name of the Edition
Sl. No Title of the Book
Author/s Publisher and Year
1 Advanced Concepts In Operating Systems Mukesh Singhal McGraw Hill 1/e, 1994
Cloud Computing: Principles and Buyya R, Broberg J,
2 Wiley 1/e, 2011
Paradigm Goscinski A.
Cloud Computing: Implementation John W. Rittinghouse,
3 CRC Press 1/e, 2010.
Management and Security James F. Ransome,

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
1 https://onlinecourses.nptel.ac.in/noc21_cs14/preview
 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 Edition

Sl. No Title of the Book Name of the Author/s
Publisher and Year
Image Processing, Analysis and Milan Sonka, Vaclav
1 Cengage 4/e, 2015
Machine 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

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
flows. (Text 1 - Chapters 5, 6)
Hashing and Randomized Data Structures - Universal and perfect hashing,
2 9
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

WEB MINING

Course Code PECDT635 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 essential skills in web mining and social network analysis, covering theoretical
foundations, association rule and sequential pattern mining, information retrieval, text
preprocessing, advanced search techniques, and web crawling, preparing them to tackle real-
world data analysis challenges effectively.
2. To impart in-depth knowledge and practical skills in structured data extraction and web usage
mining, including wrapper generation, schema matching, and various extraction techniques.
3. To learn to handle data collection, preprocessing, and modelling for web usage, analyze
patterns, and apply methods in recommender systems and query log mining.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Introduction – Web Mining – Theoretical background – Association rule
mining – Sequential Pattern Mining -Information retrieval and Web search
1 – Information retrieval Models-Relevance Feedback- Text and Web page 9
Pre-processing – Inverted Index – Latent Semantic Indexing –Web Search
– Meta-Search – Web Spamming.
Introduction -Social Networks Analysis- Co-Citation and Bibliographic
Coupling- Page Rank: PageRank Algorithm, Link-Based Similarity Search,
2 Enhanced Techniques for Page Ranking - HITS: HITS Algorithm, Finding 9
Other Eigenvectors-Community Discovery: Problem Definition, Bipartite
Core Communities.
 Web Crawling -A Basic Crawler Algorithm: Breadth-First Crawlers,
Preferential Crawlers, Universal Crawlers- Focused Crawlers and Topical
Crawlers
Structured Data Extraction: Wrapper Generation – Preliminaries- Wrapper
Induction- Instance Based Wrapper Learning - Automatic Wrapper
Generation: Problems - String Matching and Tree Matching -Multiple
3 Alignment - Building DOM Trees - Extraction Based on a Single List Page 9
and Multiple pages- Introduction to Schema Matching – Schema Level
Match -Domain and Instance Level Matching – Extracting and Analysing
Web Social Networks.
Web Usage Mining - Data Collection and Pre-Processing: Sources and
Types of Data, Key Elements of Web Usage Data - Data Modelling for
4 Web Usage Mining - Discovery and Analysis of Web Usage Patterns – 9
Applications- Recommender Systems and Collaborative Filtering –Query
Log Mining

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

Sample Questions at Analyse Level

1. Analyze the PageRank algorithm by implementing it on a sample network of webpages.
Describe how the algorithm calculates the rank of each page based on the link structure and
the concept of the damping factor. Compare the results of your implementation with a
modified version.
2. Develop and implement both a Breadth-First Crawler and a Preferential Crawler to traverse a
subset of web pages. Compare their efficiency and effectiveness in terms of speed, coverage,
and relevance of the pages they collect. Analyze the differences in their crawling strategies
and how they impact the quality of the data retrieved.
3. Analyse Apriori to perform Market Basket Analysis, discovering frequent itemsets and
association rules from a retail transaction dataset. You will analyze customer buying patterns
to uncover relationships between items commonly bought together. Goal is use to perform
the data preprocessing, frequent itemset mining, and association rule generation. Can use any
real time data sets.
4. Analyze the impact of co-citation and bibliographic coupling on the understanding of
relationships between academic papers or web pages. Examine how these methods reveal
hidden connections and influence metrics within the network.
5. Analyse how Latent Semantic Indexing (LSI) improves the relevance of search results by
capturing latent relationships between terms and documents through dimensionality reduction
and latent semantic representation.
6. Analyze the role of DOM trees in structured data extraction. Discuss how building and
traversing DOM trees contribute to accurate data extraction from HTML pages.

Sample Questions at Evaluate Level

1. Evaluate the performance of the HITS algorithm in identifying hub and authority nodes in a
network. Discuss how well the algorithm's hub and authority scores align with the actual
importance and relevance of nodes within the network. Include an assessment of how the
HITS algorithm compares to PageRank in terms of accuracy and practical application.
2. Evaluate the performance of schema matching techniques at different levels (schema level,
domain level, and instance level).
3. Evaluate the impact of query log mining on improving search engine performance and user
experience.
4. Evaluate the effectiveness of various preliminary techniques in wrapper generation. How do
these techniques impact the accuracy and adaptability of data extraction from web pages with
differing structures and content?
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 data mining process and techniques, specifically those that are
CO1 K2
relevant to Web mining.
Identify the use of Social Networks Analysis in Web Mining and
CO2 K3
basics of Information retrieval
Use different web crawling algorithms, such as breadth-first,
CO3 preferential, universal, focused, and topical crawlers, to evaluate their K3
effectiveness in gathering and processing web data
create and implement advanced solutions for structured data extraction,
CO4 including innovative methods for wrapper generation, automatic K5
wrappers, and matching techniques for various web pages.
Use schema matching and data extraction techniques to analyze web
CO5 social networks and integrate diverse data sources to gain useful K4
insights
Analyze web usage mining techniques and their effectiveness in data
CO6 modeling, pattern discovery, and applications like recommender K4
systems and query log analysis.
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
CO3 3 3 3 2 3
CO4 3 3 3 2 3
C05 3 3 3 3
C06 3 3 3 2 3
Note: 1: Slight (Low), 2: Moderate (Medium), 3: Substantial (High), -: No Correlation

Text Books
Sl. Name of the Name of the Edition and
Title of the Book
No Author/s Publisher Year
Web Data Mining: Exploring Hyperlinks,
1 Contents, and Usage Data (Data- Centric Bing Liu, Springer 2/e, 2009
Systems and Applications)

Reference Books
Sl. Name of the Name of the Edition
Title of the Book
No Author/s Publisher and Year
Data Mining the Web: Uncovering
Zdravko Markov, John Wiley &
1 Patterns in Web Content, Structure, and 1/e, 2007
Daniel T. Larose Sons,
Usage
Web Mining and Social Networking: Guandong Xu, Yanchun
2 Springer 1/e, 2010
Techniques and Applications Zhang, Lin Li,
Mining the Web: Discovering Knowledge Morgan
3 Soumen Chakrabarti 1/e. 2002
from Hypertext Data Kaufmann
World
Graph-Theoretic Techniques for Web
4 Adam Schenke Scientific 1/e, 2005
Content Mining
Publishing
 SEMESTER S6

DEEP LEARNING

Course Code PECDT695 CIE Marks 40

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

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

Prerequisites (if any) None Course Type Theory

Course Objectives:

1. To provide the learners an overview of the concepts and algorithms involved in deep learning.
2. To provide the basic concepts in neural networks, deep learning, optimization techniques,
regularization techniques, convolutional neural networks, recurrent neural networks,
autoencoders, generative models.
3. To enable students to have the capability to use deep learning algorithms to solve real-world
problems.
SYLLABUS

Module Contact
Syllabus Description
No. Hours

Introduction to Deep Learning -The Basic Architecture of Neural

Networks - Single Computational Layer: The Perceptron, Multilayer Neural
Networks. Activation functions – Sign, Sigmoid, Tanh, ReLU, leaky ReLU,
Hard Tanh, Softmax. Loss function. Training a Neural Network with

1 Backpropagation. Practical issues in neural network training. Overfitting, 9

Underfitting, Hyper parameters and Validation sets, Estimators -Bias and
Variance. Introduction to deep learning, Deep feed forward network.

Introduction to pytorch /tensorflow. Implementing image classification

algorithms on CIFAR10 dataset using pytorch

2 Optimization Techniques -Introduction, setup and initialization- Kaiming, 9

Xavier weight initializations, Vanishing and exploding gradient problems,
 Optimization techniques - Gradient Descent (GD), Stochastic GD, GD with
momentum, GD with Nesterov momentum, AdaGrad, RMSProp, Adam.,
Regularization Techniques - L1 and L2 regularization, Early stopping,
Dataset augmentation, Parameter tying and sharing, Ensemble methods,
Dropout, Batch normalization.

Convolutional Neural Networks –Architecture, Convolution operation,

Motivation, pooling.Variants of convolution functions, Structured outputs,
Data types, Efficient convolution algorithms, Applications of Convolutional

3 Networks, Pre-trained convolutional Architectures : AlexNet, VGGnet-19, 9

ResNet 50,YOLO

Implementing object classification and detection using CNN networks in

python using any of deep libraries like Tensorflow, Keras, Caffe.

Recurrent neural networks And Generative models – Computational

graphs. RNN design. Encoder – decoder sequence to sequence architectures.
Language modeling example of Deep recurrent networks. Recursive neural
networks. Challenges of training Recurrent Networks. Gated RNNs LSTM
and GRU.

4 Attention Mechanisms and Transformers: Transformer Architecture Self- 9

Attention and Positional Encoding

Autoencoders Variational Auto-Encoder-under complete Auto-encoder,

stochastic encoder, denoising encoder, Applications of Autoencoders.
Generative models : Generative Adversarial Networks.

Case study: BERT, Social Media Sentiment Analysis.

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
Sample Questions at Evaluate Level

1. Compare and evaluate the use of different activation functions (Sigmoid, Tanh, ReLU, Leaky
ReLU, Hard Tanh, Softmax) in a deep feedforward network. In which scenarios would you
recommend using each activation function, and what are the potential drawbacks of each in terms
of gradient vanishing, computational efficiency, and model performance?

2. Evaluate the role of different loss functions in neural network training. How does the choice of
loss function impact the convergence of the model during backpropagation

3. Evaluate the impact of hyperparameter choices (e.g., learning rate, batch size, number of layers,
number of neurons per layer) on the performance and convergence of deep feedforward networks

Sample Questions at Analyze Level

1. How does the architectural components of a Convolutional Neural Network (CNN), such as
convolutional layers, pooling layers, and fully connected layers, work together to achieve
image classification?
2. Analyze the differences in architecture and performance among pre-trained convolutional
networks like AlexNet, VGGNet-19, ResNet-50, and YOLO. How do the architectural
innovations in these models contribute to their effectiveness in object detection and
classification tasks?

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)

Describe the basic concepts of neural networks, deep learning and its
CO1 K2
practical issues

Outline the standard regularization and optimization techniques for the

CO2 K2
effective training of deep neural networks

CO3 Build deep learning models for different use cases. K3

Apply the concepts of Recurrent Neural Network (RNN), Long Short

CO4 Term Memory (LSTM), Gated Recurrent Unit (GRU), auto encoder, K3
generative models

Compare activation functions, optimization techniques and deep

CO5 K5
learning models to identify in which scenarios each one is suitable

Examine the various algorithms that make up the deep learning models
CO6 K4
and analyze their contributions to the final ouput

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 3

CO4 3 3 3 3 3 3

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

Goodfellow, I., MIT Press

1 Deep Learning 1/e, 2016.
Bengio,Y., Courville, A.,

2 Neural Networks and Deep Learning Aggarwal, Charu C Springer Nature 2/e, 2023

Fundamentals of Deep Learning:

Nikhil Buduma and
3 Designing Next-Generation Machine O'Reilly 1/e, 2017
Nicholas Locascio.
Intelligence Algorithms

Aston Zhang, Zachary

Cambridge
4 Dive into Deep Learning C. Lipton, Mu Li, 1/e, 2023
University Press
Alexander J. Smola

Reference Books

Name of the Edition

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

Neural Networks: A Classroom Tata McGraw-Hill

1 Satish Kumar 2/e, 2017
Approach, Education,

2 Artificial Neural Networks Yegnanarayana, B., PHI Learning Pvt. Ltd, 1/e, 2009

Neural Networks and Deep

3 Michael Nielsen Online 1/e, 2018
Learning

Video Links (NPTEL, SWAYAM…)

No. Link ID

1 https://nptel.ac.in/courses/106106184
 SEMESTER S6

DATA VISUALIZATION AND PROGRAMMING WITH R

Course Code PBCDT604 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 students to fundamental knowledge in various data visualization techniques using R

programming language.
2. To teach the security aspects involved in data visualization.
3. To equip the students to use data visualization tools in solving complex problems.

SYLLABUS

Module Contact
Syllabus Description
No. Hours

Introduction to Visualization: Need and purpose, External representation:

Difficulty in Validation, Data Abstraction, Dataset types: Attribute types,
1 Semantics, Task Abstraction: Analyse, Produce, Search, Query, Four levels 8
of validation: Validation approaches, Validation examples. Marks and
Channels, Data Visualization tools.

Arrange tables: Categorical regions: Spatial axis orientation, Spatial layout

density, Arrange spatial data: Geometry, Scalar fields,Vector fields, Tensor
9
2
fields. Arrange networks and trees: Connections, Matrix views, Containment,
Map color: Color theory, Color maps and other channels

The R Environment - Command Line Interface and Batch processing, R

8
3 Packages, Variables, Data Types, Vectors- vector operations and factor
vectors, List- operations, Data Frames, Matrices and arrays, Control
Statements- Branching and looping - For loops, While loops, Controlling
 loops. Functions- Function as arguments, Named arguments

The R Environment:

Importing data from Text files and other software, Exporting data, importing
data from databases, Database Connection packages, Missing Data: NA,
11
4 NULL, Transformations, Binning Data, Subsets, summarizing functions.
Data Cleaning: Finding and removing Duplicates, Sorting, Analyzing Data:
Summary statistics, Statistical Tests: Continuous Data, Discrete Data, Power
tests, Common distributions- type arguments. Probability distributions,
Normal distributions

Suggestion on Project Topics

1. Visualizing Demographic Data

Use R to import demographic data (e.g., census data) and create visualizations that highlight
population distribution, age groups, education levels, and income categories across different
regions.

2. Financial Market Analysis

Import stock market data and create visualizations that help analyze market trends, price
movements, and trading volumes.

3. Visualizing Traffic Patterns

Import traffic data and visualize patterns of vehicle movement, congestion areas, and the
impact of different factors like time of day or weather.

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)

CO1 Summarize the key techniques and theory used in visualization K2

CO2 Design and use various methodologies present in data visualization. K2
CO3 Illustrate uses of conditional and iterative statements in R programs. K3
Illustrate the use of Probability distributions and basic statistical K3
CO4
functions with R programs
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 3
 Text Books
Name of the Name of the Edition
Sl. No Title of the Book
Author/s Publisher and Year
1 Visualization Analysis and Design Tamara Munzner CRC Press 1/e,2014

2 R Data Visualization Cookbook Atmajitsinh Gohil Packt 1/e, 2015

3 R in a Nutshell Joseph Adler O’reilly 2/e, 2012

Security Data Visualization:

4 Graphical Techniques for Network Greg Conti NoStarch Press Inc 1/e, 2007
Analysis

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

Designing Data Visualizations: Julie Steele, Noah

1 O’Relly. 1/e, 2011
Representing Informational Relationships Iliinsky

R for Everyone- Advanced analytics and

2 graphics, Addison Wesley data analytics Jared P Lander Pearson 1/e, 2014
series, Pearson

Data Visualization: A Successful Design

3 Andy Kirk PAKT 1/e, 2014
Process

Video Links (NPTEL, SWAYAM…)

No. Link ID

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

2 https://www.youtube.com/watch?v=GdNdmRTbbtQ
 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/ and Testing
Project reformation (If
Brainstorming self-learning
required)
Sessions
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 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

3 Tree Representation, Tree Operations, Tree Traversals; Binary Search Trees - 9

Binary Search Tree Operations; Graphs :- Definitions; Representation of

Graphs; Depth First Search and Breadth First Search.
 Sorting and Searching

4 Sorting Techniques:- Selection Sort, Insertion Sort, Quick Sort, Merge Sort; 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/ Examination-1 Examination- 2
Attendance Total
Microproject
(Written) (Written )

5 15 10 10 40

End Semester Examination Marks (ESE)

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

Part A Part B Total

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

module. ● Two questions will be given from each module, out
● Total of 8 Questions, each of which 1 question should be answered.
carrying 3 marks ● Each question can have a maximum of 3 60

subdivisions.
(4x9 = 36 marks)
(8x3 =24 marks)
 Course Outcomes (COs)

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

Bloom’s
Course Outcome Knowledge
Level (KL)

CO1 Identify appropriate data structures for solving real world problems. K3

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

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

Fundamentals of Data Structures Ellis Horowitz, Sartaj Sahni Universities

1 2/e, 2007
in C and Susan Anderson-Freed, Press

Thomas H Cormen, Charles

2 Introduction to Algorithms Leisesrson, Ronald L Rivest, PHI 3/e, 2009
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.

Data Structures and Aho A. V., J. E. Hopcroft and J. Pearson

2 1/e, 2003
Algorithms D. Ullman Publication.

Introduction to Data Tremblay J. P. and P. G. Tata McGraw

3 2/e, 2017
Structures with 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)
CO1 Identify the characteristics of signals for analog and digital
K3
transmissions so as to define the associated real world challenges.
CO2 Select transmission media based on characteristics and propagation
K3
modes.
CO3 Choose appropriate signal encoding techniques for a given scenario K3
CO4 Illustrate multiplexing and spread spectrum technologies K2

CO5 Use error detection, correction and switching techniques in data

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
CO1 GCD algorithms, modular arithmetic operations and properties,
K2
polynomial arithmetic, and algebraic structures such as groups, rings,
and fields.
CO2 Describe the number theory concepts essential for cryptographic
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 Generalisation and Overfitting - Idea of overfitting, LASSO and RIDGE 8

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 Edition
Sl. No Title of the Book Name of the 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
4 Kevin P Murphy MIT Press 1/e, 2012
Probabilistic Perspective
Trevor Hastie, Robert
The Elements Of Statistical
5 Tibshirani, Jerome Springer 2/e, 2007
Learning
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
Logical, Assignment, Conditional (Ternary); Operator Precedence; Control
1 Statements - Selection Statements, Iteration Statements and Jump 10

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…)
Module
Link ID
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

BIG DATA PROCESSING LAB

Course Code PCCDL607 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) PBCDT504 Course Type Lab

Course Objectives:

1. To equip students with hands-on experience in setting up and managing Hadoop ecosystems.
2. To provide practical experience in using various data processing tools such as Hive, Pig, and
Apache Spark.
3. To introduce students to R programming and its applications in data analysis

Expt.
Experiments
No.
Perform setting up and Installing Hadoop in any of the three operating modes:
1
Standalone, Pseudo distributed, fully distributed.
2 Explore the various shell commands in Hadoop.
Implement the following file management tasks in Hadoop:
● Adding Files and Directories
3
● Retrieving Files
● Deleting Files
4 Implement a word count program using Map Reduce.
5 Write a R program to find the factorial and check for palindromes.
6 Write a R program to solve linear regression and make predictions.
7 Write a R program to solve logistic regression.
8 Implement statistical operations using R.
Implement a program to find variance, covariance and correlation between different types
9
of attributes.
10 Implement SVM Classifier using packages
 11 Implement Decision tree Classifier using packages
12 Implement clustering algorithm.
13 Explore Hive with its basic commands
14 Design a Data Model using NoSQL Databases such as Hive or Cassandra
15 Write Pig Latin scripts to sort, group, join, project, and filter your data.
16 Install, Deploy and configure Apache Spark.

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)
Illustrate the setting up of and Installing Hadoop in one of the three operating
CO1 modes. K3

Implement the file management tasks in Hadoop and explore the shell
CO2 K3
commands
Implement different tasks using Hadoop Map Reduce programming K3
CO3
model.
CO4 Implement Pig Scripting operations and Spark Application functionalities. K3

Implement data extraction from files and other sources and perform various K3
CO5
data manipulation tasks on them using R Program.(Cognitive
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 2 3
CO3 3 3 3 2 3
CO4 3 3 3 2 3
CO5 3 3 3 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
Boris Lublinsky, Kevin
John Wiley & Sons,
1 Professional Hadoop Solutions T. Smith, Alexey 2013
Inc
Yakubovich
2 Hadoop: The Definitive Guide Tom White O'Reilly Media 3/e, 2012

Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Jure Leskovec, Anand
Mining of Massive Cambridge University
1 Rajaraman and Jeffrey 2/e, 2016
Datasets Press
David Ullman
Edward Capriolo, Dean
2 Programming in Hive Wampler, and Jason O'Reilly Media 1/e, 2012
Rutherglen
3 R in Action Robert I. Kabacoff Manning Publications 3/e, 2022

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.

1 https://www.youtube.com/watch?v=Qy-302lSM5M

2 https://www.youtube.com/watch?v=Q5g6lYUn6Q4
3 https://www.youtube.com/watch?v=6AmrSocRItg
4 https://www.youtube.com/watch?v=D4HqQ8-Ja9Y
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
(DATA SCIENCE)
 SEMESTER S7

RECOMMENDATION SYSTEMS

Course Code PECDT741 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 facilitate the learner to get an overview of recommender systems.

2. To introduce learners to the concepts of Collaborative Filtering, Content-based recommendation,
Knowledge based recommendation, Hybrid approaches and Evaluating Recommender System.
SYLLABUS

Module Contact
Syllabus Description
No. Hours
Introduction to basic concepts and Recent developments: Collaborative
recommendation - User-based nearest neighbour recommendations, Item-
based nearest neighbour recommendation, Collaborative recommendation

1 ratings , Model-based and pre-processing- based approaches, Recent practical 8

approaches and systems Content-based recommendation - Content
representation and content similarity Similarity-based retrieval and Other
text classification methods

Knowledge-based recommendation : Knowledge representation and

reasoning, Constraints, Cases and similarities, Interacting with constraint-
based recommenders - Defaults Dealing with unsatisfiable requirements and
2 empty result set, Proposing repairs for unsatisfiable requirements, Ranking 9
the items/utility-based recommendation, Interacting with case-based
recommenders, Critiquing -Compound critiquing, Dynamic critiquing

Hybrid recommendation approaches : Opportunities for hybridization

3 8
Recommendation paradigms, Hybridization designs, Monolithic
 hybridization design - Feature combination hybrids, Feature augmentation
hybrids, Parallelized hybridization design -Mixed hybrids, Switching
hybrids, Weighted hybrids, Pipelined hybridization design Cascade
hybrids, Meta-level hybrids. Limitations of hybridization strategies

Evaluating Recommender Systems : Introduction - Evaluation Paradigms ,

User Studies , Online Evaluation Offline Evaluation with Historical Data
Sets, General Goals of Evaluation Design - Accuracy, Coverage ,
Confidence and Trust , Novelty , General Goals of Evaluation Design -
Serendipity ,Diversity , Robustness and Stability Scalability, Design Issues
in Offline Recommender Evaluation - Case Study of the Netflix Prize Data
4 Set, Segmenting the Ratings for Training and Testing- Hold-Out , Cross- 10
Validation , Comparison with Classification, Accuracy Metrics in Offline
Evaluation - Measuring the Accuracy of Ratings Prediction , RMSE versus
MAE, Impact of the Long Tail, Evaluating Ranking via Correlation ,
Evaluating Ranking via Utility Evaluating Ranking via Receiver Operating
Characteristic, Limitations of Evaluation Measures - Avoiding Evaluation
Gaming

Course Assessment Method

(CIE: 50 marks, ESE: 100 marks)

Continuous Internal Evaluation Marks (CIE):

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

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

● 2 Questions from each module. ● Each question carries 14 marks.

● Total of 10 Questions, each carrying ● Two questions will be given from each module, out of
3 marks which 1 question should be answered. 100

(10x3 =30 marks) ● Each question can have a maximum of 2 subdivisions.

(5x14 = 70 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 basic concepts of recommender systems K2

Summarize the features of constraint based and case-based knowledge-based

CO2 K2
recommender systems

CO3 Illustrate the use of hybridizing algorithms K2

CO4 Examine the design issues in offline recommender evaluation 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 and
Sl. No Title of the Book Name of the Author/s
Publisher Year
Recommender Systems: An Jannach D., Zanker M. and Cambridge University
1 1/e, 2011
Introduction FelFering A Press
Recommender Systems: The
2 C.C. Aggarwal Springer 1/e, 2016
Textbook

Reference Books
Name of the Edition and
Sl. No Title of the Book Name of the Author/s
Publisher Year
F. Ricci, L Rokach, B.
1 Recommender systems handbook Springer 1/e, 2010
Shapira and P.B. Kantor
Recommender Systems For Manouselis N., Drachsler
2 Springer 1/e, 2013
Learning H., Verbert K., Duval E
 SEMESTER 7

FINANCIAL DATA SCIENCE

(Common CD/AD/CR)

Course Code PECDT742 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 students an understanding of how data science techniques can be applied to solve
complex financial problems, such as risk modeling, fraud detection, and algorithmic trading.
2. To enable the students to implement machine learning algorithms for financial applications,
including portfolio optimization, and trading strategies.
SYLLABUS

Module Contact
Syllabus Description
No. Hours
Overview of Financial Systems - Financial markets, instruments, and data;
Data Science in Finance - Role of data science, types of data in finance
(structured, unstructured, time-series, etc.); Financial Data Acquisition -
1 Sources of financial data, Data retrieval from the Internet; Data Preprocessing - 9
Data cleaning, handling missing data, outlier detection, normalization, and
scaling; Exploratory Data Analysis - Visualizing financial data (candlestick
charts, histograms), statistical summaries.
Supervised Learning in Finance - Decision trees, random forests, and support
vector machines (SVM) for stock prediction; Unsupervised Learning for
Financial Clustering - K-means clustering and principal component analysis
2 (PCA) for risk classification; Neural Networks in Finance - Overview of deep 9
learning techniques, simple models for predicting financial outcomes; Model
Evaluation and Performance Metrics: Evaluation metrics like RMSE, R²,
confusion matrix, accuracy, precision, and recall.
Financial Risk Types - Credit risk, market risk, liquidity risk; Risk Modeling
3 9
Techniques - Value at Risk (VaR), Monte Carlo simulations; Stress Testing
 and Scenario Analysis - Techniques for testing portfolio resilience under
extreme conditions; Fraud Detection Algorithms - Anomaly detection
techniques in transaction data (e.g., autoencoders, isolation forests); Case
Study: Implementing a credit risk scoring model.
Introduction to Algorithmic Trading - Basics of trading strategies, high-
frequency trading, algo-bots; Financial Portfolio Theory - Modern Portfolio
4 Theory (MPT), Efficient Frontier; Optimization Algorithms - Gradient 9
Descent, Genetic Algorithms for portfolio optimization; Backtesting Trading
Strategies - Python libraries for backtesting (e.g., Backtrader, QuantConnect).

Course Assessment Method

(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

Internal Internal Examination-

Assignment/ Examination-1 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 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.
(4x9 = 36 marks)
(8x3 =24 marks)

Course Outcomes (COs)

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

 Bloom’s
Course Outcome Knowledge
Level (KL)

Explain how data science methods are applied in financial markets,

CO1 K3
trading, risk management, and fraud detection.

Apply various machine learning algorithms (such as decision trees, SVM,

CO2 K3
and neural networks) to solve financial problems.

Develop and backtest trading algorithms and optimizing financial

CO3 K3
portfolios.

Apply risk modeling techniques and implement fraud detection systems

CO4 K3
in financial contexts.

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

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

Sergio Consoli, Diego

1 Data Science for Economics and Finance Reforgiato Recupero, Springer 1/e, 2021
Michaela Saisana

Hands-On Machine Learning for

2 Stefan Jansen Packt 1/e, 2018
Algorithmic Trading

Analyzing Financial Data and Implementing

3 Clifford S. Ang Springer 2/e, 2021
Financial Models Using R

4 Adventures in Financial Data Science Graham L Giller World Scientific 2/e, 2022

Hands-On Data Analysis in R for Finance

5 Jean-François Collard CRC Press 1/e, 2023

Financial Data Analytics: Theory and

6 Sinem D. Koseoglu Springer 1/e, 2021
Application

SEMESTER S7
FOUNDATIONS OF COMPUTER VISION
 Course Code PECDT743 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 learners to 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
and deep 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 Euclidean Geometry, Geometric Camera
Parameters,

Stereopsis: Binocular Camera Geometry, Epipolar Constraint, Binocular

1 9
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 Gradient- based Edge Detectors

Image Gradients: Computing the Image Gradient, Gradient Based Edge and
Corner Detection. Filters as Templates: Normalized Correlation and Finding
2 9
Patterns.
 Machine Learning for Computer Vision: Introduction, Dataset for
Machine Perception: Labelled and Un-labelled Data, Basics of Classification
and Clustering, Multi-Class Perspective.

3 Machine Learning for Computer Vision: Machine Learning, Deep 7

Learning 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 and VGG19

Segmentation and Object detection: Segmentation Using Clustering

Methods: Human vision, Grouping and Gestalt

Image Segmentation by Clustering Pixels: Simple Clustering Methods,

Clustering and Segmentation by K-means

Object detection: YOLO, Segmentation: Mask R-CNN and Instance

Segmentation, U-Net and Semantic Segmentation, Model Quality Metrics
4 7
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
Attendance Assignment/ 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.
(4x9 = 36 marks)
(8x3 =24 marks)

Course Outcomes (COs)

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

Bloom’s
Knowledge
Course Outcome
Level (KL)

Explain the basic concepts and terminologies associated with Camera

CO1 K2
Calibration, Stereopsis in computer vision

CO2 Apply filters for feature extraction and for finding patterns. K3

CO3 Build machine learning models for computer vision applications K3

CO4 Implement segmentation and object detection models K3

Build different machine learning models for segmentation and object

CO5 K3
detection 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

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

1 Computer vision: A Forsyth, David, and Jean Prentice hall 1/e, 2011
modern approach Ponce

2 Emerging topics in Medioni, Gerard and Sing Bing

PHI 1/e, 2004
computer vision Kang

Valliappa Lakshmanan,
3 Practical Machine
Learning for Computer Martin Görner, Ryan O'Reilly Media 1/e, 2021
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 1/e, 2010
and applications Business Media

Image Segmentation:
Principles, Techniques, and
2 Tao Lei, Asoke K. Nandi John Wiley & Sons 1/e, 2022
Applications

Deep Learning in Computer

Ali Ismail Awad,
3 Vision Principles and Mahmoud Hassaballah CRC Press 1/e, 2020
Applications

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.

Computer Vision and Image Processing - Fundamentals and Applications by

1
Prof. M. K. Bhuyan at IIT Guwahati https://onlinecourses.nptel.ac.in/noc23_ee39/preview

Computer Vision by Prof. Jayanta Mukhopadhyay at IIT Kharagpur

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

3 Deep Learning for Computer Vision by Prof. Vineeth N Balasubramanian at IIT Hyderabad
https://onlinecourses.nptel.ac.in/noc21_cs93/preview

4 COVID-Net Open Source Initiative - COVIDx CT-3 Dataset

https://www.kaggle.com/datasets/hgunraj/covidxct
 SEMESTER S7

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

Course Code PECST742 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 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,
2 9
Arrays , Objects , Function Declarations vs. Function Expressions , Nested
 Functions , The Document Object Model (DOM) - Nodes and NodeLists,
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
An Introduction to Bioinformatics N. C. Jones and P.
1 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

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

1 Introduction, Blockchain Definition, Deciphering the Blockchain, Features 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

Bitcoin: Components, Nodes in Bitcoin network, Transactions and memory

pools, Proof of Work-Mining Cryptocurrencies, Hard and Soft Forks,
Tracking Bitcoins-Unspent Transaction Outputs.
3 10
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.
https://youtube.com/playlist?list=PLrKK422S1aMma8lDA2JJjEUpC2ycuApuC&si=1OXTYDEZ4
1
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

INFORMATION RETRIEVAL

Course Code PECDT745 CIE Marks 40

Teaching Hours/Week ESE Marks 60

3:0:0:0
(L: T:P: R)

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

Prerequisites (if any) None Course Type Theory

Course Objectives:

1. To introduce the foundational principles and models of information retrieval, including

indexing, query processing, and relevance feedback.
2. To help learners develop the skills to design, implement, and evaluate basic search engines
and retrieval systems.
3. To equip learners with the ability to analyze the ethical implications of information retrieval
and to introduce them to advanced IR topics such as web search, multimedia retrieval, and the
use of machine learning in IR.

SYLLABUS

Module Contact
Syllabus Description
No. Hours

Overview of Information Retrieval Systems:-

History and Evolution of IR, Basic Concepts of Information Retrieval,

Differences between Data Retrieval and Information Retrieval, IR Models:
Boolean, Vector Space, Probabilistic Models.

1 Indexing and Search: Document Representation and Preprocessing, 9

Tokenization, Stemming, and Lemmatization, Inverted Index and Boolean

Queries, Term Frequency and Document Frequency.

Relevance Feedback and Query Expansion: Query Reformation

Techniques, User Feedback in IR Systems, Pseudo Relevance Feedback.
 Retrieval Models and Evaluation:-
Retrieval Models: Vector Space Model (VSM), Probabilistic Retrieval
Model, Language Models for IR, Latent Semantic Indexing (LSI), Topic
Models (LDA)
Evaluation of Information Retrieval Systems: Precision, Recall, and F-
2 9
Measure, Receiver Operating Characteristic (ROC) Curves, Mean Average
Precision (MAP), Discounted Cumulative Gain (DCG), Test Collections and
Benchmarks (TREC).
Text Similarity and Ranking: Cosine Similarity, TF-IDF Weighting,
BM25 Ranking Algorithm

Web Search and Information Retrieval :-

Web Search Fundamentals, Web Crawling and Indexing, Link Analysis
Algorithms: PageRank and HITS, Search Engine Architecture and
Components, Web Content Mining and Structure Mining

3 Search Engine Optimization (SEO):Concepts of SEO and Ranking Factors, 9

On-Page and Off-Page Optimization, User Behavior Modeling and
Personalized Search.
Distributed and Scalable Search: Distributed Indexing and Search
Architectures, Map Reduce for Large Scale Search Engines, Parallel Query
Processing and Web-Scale IR
Advanced Topics in Information Retrieval:-
Multimedia and Cross-Language Information Retrieval: Image and Video
Retrieval Techniques, Content-Based Image Retrieval (CBIR), Cross-
Language Information Retrieval (CLIR) and Challenges, Natural Language
Processing (NLP) in IR
Social Media and Sentiment Analysis: Social Media Mining and Opinion
4 Retrieval, Sentiment Analysis and Opinion Mining Techniques, 9
Collaborative Filtering and Recommendation Systems

Ethical Issues and Emerging Trends: Privacy and Bias in Information

Retrieval, Ethics of Search Engines and IR Systems, AI in Information
Retrieval: Deep Learning and Neural IR Models, Future Directions in IR
Research
 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

Sample Questions at Evaluate Level

1. Evaluate the effectiveness of the Vector Space Model (VSM) compared to the Probabilistic
Retrieval Model in handling queries with ambiguous terms. Which model provides more
accurate results, and under what conditions?
2. Evaluate the effectiveness of Mean Average Precision (MAP) compared to Discounted
Cumulative Gain (DCG) in assessing the performance of ranked retrieval systems. Which
metric better reflects the user experience when interacting with search results, and why?

Sample Questions at Analyze Level

1. Evaluate the impact of different design choices in the query processor and ranking
components of a search engine on the relevance and ranking of search results. How do these
choices influence the user experience?
2. Analyze how the application of web content mining and structure mining techniques
influences the ranking of search results. What are the trade-offs between relevance and
computational efficiency?
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 3 subdivisions. Each 60
each carrying 3 marks 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)

Describe the fundamental concepts of Information Retrieval, indexing

CO1 K2
and searching

CO2 Evaluate the effectiveness of IR systems using standard metrics. K5

CO3 Examine Web Search and Information Retrieval Techniques K4

Explore advanced topics in information retrieval including multimedia

CO4 K4
retrieval, sentiment analysis, and ethical issues in IR.

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 3

CO4 3 3 3 3 3 3 3

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

Text Books

Name of the Edition and

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

Introduction to Information C. Manning, P. Raghavan, Cambridge University

1 1/e, 2008
Retrieval and H. Schütze, Press

Modern Information Retrieval:

Ricardo Baeza-Yates and
2 The Concepts and Technology ACM Press Books 2/e, 2011
Berthier Ribeiro-Neto
behind Search,

Reference Books

Name of the Edition and

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

Information Retrieval: Stefan Büttcher, Charles L.

1 Implementing and Evaluating A. Clarke, Gordon V. MIT Press, 1/e, 2016.
Search Engines Cormack C

Bruce Croft, Donald

Search Engines: Information
2 Metzler, and Trevor Addison-Wesley 1/e, 2009
Retrieval in Practice
Strohman
 Video Links (NPTEL, SWAYAM…)

Module No. Link ID

1 https://nptel.ac.in/courses/106/105/106105158

2 https://nptel.ac.in/courses/106/105/106105158/

3 https://swayam.gov.in/nd1_noc19_cs61/preview

4 https://nptel.ac.in/courses/106/106/106106139/

5 https://nptel.ac.in/courses/106/106/106106142/
 SEMESTER S7

ADVANCED DATABASE SYSTEMS

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

Course Objectives:

1. To impart the concepts of query processing, optimization and concurrency control in

relational and distributed databases.
2. To provide detailed understanding of non-relational databases and use it in appropriate
scenarios and also to introduce students to Graph databases and GIS.

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,
Algorithms for Project and Set operations, Evaluation of expressions,
Heuristics in Query Optimization: Optimization of Relational Algebra

1 expressions 9

Physical Database Design and Tuning: Introduction to Physical Database

Design: Factors influencing Physical Database Design, Overview of Database
Tuning: Tuning the Conceptual Schema, Tuning Queries and Views-Impact
of Concurrency.

Distributed Databases: Distributed Database Concepts: Architecture,

2 Distributed Data Storage: Data fragmentation, Replication and allocation 9

techniques for distributed data base design, Types of Distributed Database

 Systems, Query Processing and Decomposition: Query Processing Objectives,
Characterization of Query Processors, Layers of Query Processing, Query
Decomposition, Localization of Distributed Data, Concurrency Control and
Recovery in Distributed Database Systems.

XML and Non-Relational Databases: XML: Introduction to Semi

Structured Data and XML Databases, XML Data Model, XML documents,
DTD and XML Schema, XML Presentation, XPath Queries, XQuery

3 NOSQL Databases: Introduction, Comparison of NoSQL and relational 9

databases, database Sharding, CAP Theorem, Overview of MongoDB: Mongo
DB data model, CRUD Operations, Indexing, Application integration,
Replication, Sharding, Deployment. Cassandra: Data Model, CRUD
operations.

Graph databases: Introduction, Data Modelling with Graphs: Building a

Graph Database application, Data Modeling, Predictive Analysis with Graph
Theory: Depth and Breadth First Search, Path-Finding with Dijkstra’s
4 Algorithm, Graph Theory and Predictive Modeling. 9

Geographic Information Systems (GIS): Components, Characteristics, Data

Models for GIS, GIS Standards and Operations.

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

Sample Questions at Evaluate Level

1. Critically evaluate the significance of using different query cost metrics (e.g., I/O cost, CPU cost)
in optimizing complex queries.
2. Assess the impact of using a sort-merge join algorithm versus a hash join algorithm in a system
with limited memory resources. Which algorithm would you recommend, and under what
conditions might your recommendation change?

Sample Questions at Evaluate Level

1. Analyze how the structure of a graph database differs from a relational database in terms of data
representation and query efficiency.

2. Analyze the key considerations when transitioning from a relational database application to a
graph database application. What architectural and performance factors should be taken into
account, and how do they influence the design of the application?

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 3 subdivisions. Each 60
each carrying 3 marks 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)

Critique various measures for query processing and optimization, and K5

CO1
apply techniques to tune database performance.

Explain the architecture and fundamental concepts of distributed K2

CO2
databases.

Utilize semi-structured data, XML, and XML queries for effective data K3
CO3
management

Utilize NoSQL database systems to manage and manipulate data in K3

CO4
real-time applications

Examine graph database concepts and geographic information systems K4

CO5
as tools for data 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 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

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

 Text Books

Sl. Name of the Edition and

Title of the Book Name of the Author/s
No Publisher Year

Fundamentals of Database Ramez Elmasri and Shamkant

1 Pearson 7/e, 2019
Systems B. Navathe

A. Silberschatz, H. Korth and

2 Database System Concepts McGraw-Hill 7/e, 2021
S. Sudarshan

3 Database Management Systems R. Ramakrishnan, J. Gehrke McGraw Hill 3/e, 2018

Ian Robinson, Jim Webber &

4 Graph Databases O’Reilly 2/e, 2015
Emil Eifrem

Database Systems: Practical

5 approach to design, T. M. Connolly and C. Begg Pearson 6/e, 2019
implementation, and management

Reference Books

Name of the Edition and

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

Principles of Database Management:

W. Lemahieu, S. vanden Cambridge
1 Practical Guide to Storing, Managing and 1/e, 2018
Broucke and B. Baesens University Press
Analyzing Big and Small Data

Designing Data-Intensive Applications:

2 The Big Ideas Behind Reliable, Scalable, M. Kleppmann O’Reilly 1e, 2017
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.

Foundations of Multidimensional and

5 Hanan Samet Morgan Kaufmann 1/e,2006
Metric Data Structures

Designing Data-Intensive Applications:

8 The Big Ideas Behind Reliable, Scalable, M. Kleppmann O’Reilly 1/e, 2017
and Maintainable Systems
 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 S7

GRAPH DATABASES AND ANALYSIS

Course Code PECDT751 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 an insight into graph databases, and to study in detail the technology in designing
graph databases.
2. To give the student an understanding of data modelling with graphs, to learn different graph
algorithms and to do predictive analysis of graphs in real world applications.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Introduction to the Graph Data Model:
Graphs as the future of data, The relevance of data relationships, High-level
1 view of Graph Space, The Power of Graph Databases, Options for Storing 9
Connected Data: Relational Databases Limitations, NoSQL Databases,
Graph Databases, Defining Graph Analytics and Graph Data Science.
Data Modelling with Graph:
Models and Goals, The Property Graph Model,
Querying Graphs: An Introduction to Cypher, Other Cypher Clauses,
2 Comparison of Relational and Graph Modelling, Cross Domain Models, 9
Common Modelling Pitfalls.
Building a Graph Database Application: Data Modelling, Application
Architecture, Redundancy
Graph Algorithms:
3 9
Graph Algorithms in Neo4j, Graph Algorithm Concepts, The Neo4j Graph
 Algorithms Library, Pathfinding and Graph Search Algorithms, Centrality
Algorithms, Community Detection Algorithms, Graph Algorithms in
Practice
Predictive Analysis with Graph Theory in Real World:
Real-World Examples, Looking at Graphs in the Health Industry. Graph
Database Internals: Native Graph Processing, Native Graph Storage,
4 10
Programmatic APIs, Non-functional Characteristics
Depth and Breadth-First Search, Path-Finding with Dijkstra’s Algorithm,
The A* Algorithm, Graph Theory and Predictive Modelling

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)
Explain the key concepts of NoSQL and Graph databases by
CO1 understanding the new database models, and how these databases fit K2
into the overall ecosystem.
Apply appropriate techniques to design a property graph data model

CO2 and build graph database applications for entity-relationship, and K3

modelling objects.

Apply appropriate algorithms in Neo4j graph databases, and model

CO3 K3
solutions for computing problems.
Use appropriate predictive analysis with graph theory for processing,
CO4 K3
storing, searching and modelling in real world 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

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 and
Sl. No Title of the Book Name of the Author/s
Publisher Year
Ian Robinson, Jim Webber,
1 Graph Databases O'Reilly 2/e, 2015
Emil Eifrem.
Graph Data Science for dummies:
John Wiley &
2 Predicting Changing Demand Patterns Pierson, Lillian. 3/e, 2021
Sons
in the New Digital Economy
A Comprehensive Guide Mark Needham,
3 Neo4j.com 1/e,2020
to Graph Algorithms Amy E. Hodler,
Bryce Merkl Sasaki, Joy Chao
4 Graph Databases for Beginners Neo4j.com 1/e, 2020
& Rachel Howard

Reference Books
Name of the Edition and
Sl. No Title of the Book Name of the Author/s
Publisher Year
Hurwitz, Judith S., Alan Nugent, Fern John Wiley &
1 Big data for dummies. 1/e, 2013
Halper, and Marcia Kaufman. Sons
 SEMESTER S7

INTRODUCTION TO INTERNET OF THINGS

Course Code PECDT752 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 fundamentals of IoT architecture, including its origins, impact, and the
convergence with IT.
2. To enable the learner to explore the components of IoT networks such as smart objects,
sensors, actuators, and communication technologies, with a focus on IP optimization and
application protocols.
SYLLABUS

Module Contact
Syllabus Description
No. Hours

IoT Architecture- What is IoT, Genesis of IoT, IoT and Digitization, IoT
Impact, Convergence of IT and IoT, IoT Challenges, IoT Network

1 Architecture and Design, Drivers Behind New Network Architectures, 8

Comparing IoT Architectures, A Simplified IoT Architecture, The Core IoT

Functional Stack, IoT Data Management and Compute Stack.

Engineering IoT Networks-Smart Objects: The “Things” in IoT, Sensors,

Actuators, and Smart Objects, Sensor Networks,Connecting Smart Objects,

2 Communications Criteria, IoT Access Technologies. 14

IoT Network Layer: IP as the IoT Network Layer, The Business Case for IP,
The need for Optimization, Optimizing IP for IoT,
 IoT protocols- Application Protocols for IoT(XMPP, MQTT, CoAP, SOAP,
HTTP only), Transport Layer, IoT Application Transport Methods.

3 Data Analytics for IoT: Data and Analytics for IoT, An Introduction to Data 12

Analytics for IoT, Machine Learning, Big Data Analytics Tools and
Technology.

Developing IoT Systems: IoT Logical Design using Python, IoT Physical
Devices and Endpoints - Raspberry Pi interfaces, Programming Raspberry Pi

4 using Python, WAMP. Developing Tools: Arduino, Apache NetBeans, 10

Kinoma, IBM Watson IoT, Node-RED

Case study: IoT in Agriculture, IoT in Smart city.

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,
● 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
(8x3 =24 marks) subdivisions.
(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 fundamentals of IoT architecture, including its genesis and

CO1 K2
impact

Use different IoT architectures, the core functional stack, and the impact
CO2 of IoT on digitization and industry while identifying key challenges in K3
IoT network design.

Experiment with smart objects, sensors, actuators, and various IoT

CO3 access technologies, and assess how IP optimization enhances IoT K3
networking protocols and data communication.

Implement IoT-specific application and transport layer protocols (e.g.,

CO4 MQTT, CoAP) and apply data analytics and machine learning K3
techniques to process IoT-generated data using big data tools.

Develop IoT systems using Raspberry Pi, Arduino, and other platforms,
programming in Python, and utilizing tools like Node-RED and IBM
CO5 K3
Watson IoT, while exploring real-world IoT applications in agriculture
and smart cities.

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

IoT Fundamentals Networking David Hames, Gonzalo Pearson

1 Technologies, Protocols, and use Salguerio, Patrick Grossetete, Education 1/e, 2016
cases for the Internet of Things Robert Barton, Jerome Henry

Internet of Things: A hands-on Arshadeep Bahga, Vijay

2 University Press 1/e, 2014
approach Madisetti

Reference Books

Sl. Edition and

Title of the Book Name of the Author/s Name of the Publisher
No Year

Internet of Things:
1 Architecture and Design Rajkamal McGraw Hill 1/e,2017
Principles

Dieter Uckelmann, Mark

Architecting the Internet of Springer Science &
2 Harrison, Florian 1/e, 2011
Things Business Media,
Michahelles

Internet of Things: Converging

Technologies for Smart Ovidiu Vermesan, Peter
3 River Publishers 1/e, 2013
Environments and Integrated Friess,
Ecosystems

Programming Arduino: Getting

4 Simon Monk McGraw Hill 1/e, 2016
Started with Sketches
 Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.

1,2,3 https://onlinecourses.nptel.ac.in/noc22_cs53/preview
 SEMESTER S7

MOBILE APPLICATIONS

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

Prerequisites (if any) None Course Type Theory

Course Objectives:

1. To impart practical knowledge in Mobile application development using Flutter and Dart,
UI/UX Design Skills
2. To present the industry practices and deployment such as app security, testing.
SYLLABUS

Module Contact
Syllabus Description
No. Hours
Introduction to Mobile Application Development: Overview and Key
Concepts

Overview of Mobile Platforms: iOS and Android-Introduction to Cross

Platform Development with Flutter: Key Benefits -Flutter vs. Other Cross-
Platform Frameworks

Setting Up the Flutter Development Environment: Installing Flutter SDK

1 9
and Tools-Building and Running the "Hello World" App-Brief Introduction to
Git (Cloning and Basic Commands)

Mobile App Architectures: Overview of MVC and MVVM-Brief

Introduction to the BLoC Pattern in Flutter

Basics of Dart Programming Language: Syntax and Data Types-

Introduction to Asynchronous Programming
 User Interface Design and User Experience: Principles of Mobile UI/UX
Design-Overview -Importance of Usability, Accessibility, and User-Centered
Design

Designing Responsive UIs with Flutter Using Flutter Widgets: Stateless

Widget and Stateful Widget-Practical Examples and Use Cases

Layouts in Flutter: Deep Dive into Layout Widgets: Container, Column,

Row, Stack-Aligning and Positioning Widgets Effectively

2 Navigation and Routing in Flutter: Implementing Basic Navigation: 9

Navigator and Routes-Managing Multiple Screens and Passing Data Between
Them

Customizing UI with Themes and Styles: Introduction to Flutter's Theming

Capabilities-Creating Custom Themes and Applying Styles

Introduction to Material Design and Cupertino Widgets: Overview of

Material Design Principles and Components-Using Cupertino Widgets for iOS
Design in Flutter

Advanced Flutter Development:

State Management in Flutter: Overview of State Management Concepts-

Introduction to Provider: Basic State Management-Exploring Riverpod:
Advanced State Management Patterns-Deep Dive into the BLoC Pattern:
Managing Complex State

Networking in Flutter: Making HTTP Requests: GET, POST, PUT,

3 DELETE, JSON Parsing: Working with APIs, Integrating RESTful APIs in 9

Flutter Apps

Data Persistence: Introduction to SQLite: Local Database Storage-Using

Shared Preferences for Simple Key-Value Storage-Overview of Hive

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

Working with Firebase: Setting Up Firebase - Firebase Authentication: Sign-

In/Sign-Up Flow
 Industry Practices and App Deployment:

Advanced UI Components and Animations:Building Complex UI

Components in Flutter-Implementing Animations

App Security Best Practices:Securing Mobile Applications: Common Threats

and Mitigations-Implementing Secure Authentication and Data Storage

4 9
Testing and Debugging Flutter Applications:Introduction to Unit Testing,
Widget Testing, and Integration Testing-Debugging Techniques and Tools in
Flutter

Continuous Integration/Continuous Deployment (CI/CD) with Flutter-

Publishing Apps to Google Play 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/ 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 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)
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 user
CO2 K3
interfaces using Flutter widgets.
Experiment effectively with state in Flutter applications. networking and K3
CO3
data persistence in Flutter apps.
Apply security best practices in mobile app development and debug Flutter K3
CO4
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 and
Sl. No Title of the Book Name of the Author/s
Publisher 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 and
Sl. No Title of the Book Name of the Author/s
Publisher Year
1 Flutter in Action Eric Windmill Manning 1/e, 2019
Deepti Chopra, Roopal
2 Flutter and Dart: Up and Running BPB 1/e, 2023
Khurana

Video Links (NPTEL, SWAYAM…)

No. Link ID
1 https://www.youtube.com/watch?v=VPvVD8t02U8
2 Getting started with Flutter Development (coursera.org)
 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 :-
3 10
Ethics and Accountability -Auditing AI models, fairness assessment,
 Principles for ethical practices.
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

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
1 (SSD), USB Flash Drives, Optical Discs, Memory Cards, Cloud Storage, 10
Drive Geometry, Cylinders, Heads, and Sectors, Logical Block Addressing
(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
Sl. Name of the Edition
Title of the Book Name of the Author/s
No Publisher and Year
Digital Forensics and Incident
1 Gerard Johansen Packt 2/e, 2020
Response
Guide to Computer Forensics Bill Nelson, Amelia Phillips,
2 Cengage 6/e, 2020
and Investigations Christopher Steuart
Rohit Tamma, Oleg Skulkin ,
3 Practical Mobile Forensics Heather Mahalik, Satish Packt 4/e, 2020
Bommisetty
Mobile Forensics - Advanced Oleg Afonin, Vladimir
4 Packt 1/e, 2016
Investigative Strategies Katalov
Network Forensics : Tracking Sherri Davidoff, Jonathan
5 Pearson 1/e, 2013
Hackers Through Cyberspace Ham
6 File system forensic analysis Brian Carrier Addison-Wesley 1/e, 2005
Windows Forensics: The Field
7 Guide for Corporate Computer Chad Steel Wiley 1/e, 2006
Investigations
Android Forensics:
Investigation, Analysis and
8 Andrew Hoog Syngress 1/e, 2011
Mobile Security for 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

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

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

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
2 9
scan) algorithms. Case Studies of Parallel Addition, Multiplication, Reduction,
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,
Parallel algorithms for minimum spanning tree (MST) and shortest path.
3 9
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
Barry Wilkinson and
2 Applications Using Networked Pearson India 2/e, 2006
Michael Allen
Workstations and Parallel Computers
Addison-Wesley
3 An Introduction to Parallel Algorithms Joseph Jaja 1/e, 1992
Professional
Henri Casanova, Arnaud Chapman and
4 Parallel Algorithms 1/e, 2020
Legrand, Yves Robert Hall/CRC
Parallel Scientific Computing in C++ and George Em Karniadakis Cambridge
5 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/
https://archive.nptel.ac.in/courses/106/106/106106112/
2
https://nptel.ac.in/courses/106104120
https://archive.nptel.ac.in/courses/106/106/106106112/
3
https://nptel.ac.in/courses/106104120
https://archive.nptel.ac.in/courses/106/106/106106112/
4
https://nptel.ac.in/courses/106104120
 SEMESTER S7

REINFORCEMENT LEARNING

Course Code PECDT755 CIE Marks 40

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

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

Prerequisites (if any) None Course Type Theory

Course Objectives:
1. To provide a comprehensive introduction to the concepts and methods of reinforcement
learning and develop skills in implementing reinforcement learning algorithms.
2. To enable the learner to apply reinforcement learning techniques to solve real-world problems
and to explore advanced topics and recent developments in reinforcement learning.
SYLLABUS

Module Contact
Syllabus Description
No. Hours

Introduction to Reinforcement Learning:

Basic Concepts: Agents, Environments, Rewards, and Policies,

1 8
Single stage decision making problems: N-Arm Bandit Problem, Simulation
of N-arm bandit problem, Action-Value Methods, Incremental Implementation,
epsilon –greed method, Exploration Vs Exploitation, Pursuit algorithm

Markov Decision Processes (MDPs) and Dynamic Programming (DP):

Definition and Properties, Value Functions, Bellman Equations, Policy
2 9
Evaluation, Improvement, Policy Iteration, Value Iteration, Asynchronous DP,
Efficiency of DP Algorithms.

Monte Carlo Methods and Temporal Difference (TD) Learning:

3 Monte Carlo Prediction, Monte Carlo Control, Off-policy Prediction and 9

Control, TD Prediction, Q-Learning, SARSA, Eligibility Traces

 Function Approximation and Advanced Topics:

Linear Function Approximation, Neural Networks for Function

4 Approximation, Deep Q-Networks (DQN), Policy Gradient Methods, Actor- 10

Critic Methods, Applications of Reinforcement Learning in Games, Robotics,

and Other Domains.

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

Sample Analyse level questions

1. Break down the role of experience replay and target networks in stabilizing the learning
process of DQN. How do these components prevent divergence during training?

2. Discuss the interaction between the actor and critic in an Actor-Critic method. How does the
balance between these components impact learning stability and convergence speed?

Sample Evaluate level questions

1. Evaluate the computational efficiency of different dynamic programming algorithms (e.g.,

policy iteration, value iteration, asynchronous DP). How do they scale with increasing state
and action space sizes?

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. 2 questions will be given from each module, out of
Total of 8 Questions, each which 1 question should be answered. Each question
carrying 3 marks can have a maximum of 3 subdivisions. Each 60
(8x3 =24 marks) 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 Describe the fundamental concepts of reinforcement learning. K2

CO2 Solve single stage decision-making problem K3

CO3 Implement basic reinforcement learning algorithms. K3

CO4 Evaluate the performance of different reinforcement learning methods. K5

CO5 Explore advanced techniques and recent developments in the field. 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 2 3

CO2 3 2 3 3 2 3

CO3 3 3 3 3 2 2 3

CO4 2 3 3 3 2 2 3

CO5 2 3 3 3 3 2 2 3

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

 Text Books

Name of the Edition and

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

Reinforcement Learning: An Richard S. Sutton, Andrew

1 MIT Press 2/e, 2018
Introduction G. Barto

Deep Reinforcement Learning

2 Maxim Lapan Packt Publishing 2/e, 2020
Hands-On

Reinforcement Learning: State- Marco Wiering, Martijn

3 Springer 1/e, 2012
of-the-Art van Otterlo

Reference Books

Name of the Edition and

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

Artificial Intelligence: A Modern

1 Stuart Russell, Peter Norvig Pearson 3/e, 2010
Approach

Algorithms for Reinforcement

2 Csaba Szepesvári Morgan & Claypool 1/e, 2010
Learning

Ian Goodfellow, Yoshua

3 Deep Learning MIT Press 1/e, 2016
Bengio, Aaron Courville

Video Links (NPTEL, SWAYAM…)

Module No. Link ID

1 Introduction to Reinforcement Learning https://nptel.ac.in/courses/106106182

2 Markov Decision Processes and Dynamic Programming https://nptel.ac.in/courses/106105198

3 Monte Carlo Methods and Temporal Difference Learning https://nptel.ac.in/courses/106105197

4 Function Approximation and Advanced Topics https://nptel.ac.in/courses/106105194

 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,
3 9
Common Methods of Malware Propagation- Email Attachments, Malicious
Websites, Removable Media, File Sharing Networks, Malvertising, Protection
 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 Edition
Title of the Book Name of the Author/s
No Publisher and Year
Computer Security: Principles and
1 William Stallings Pearson 5/e, 2011
Practices

Cyber Security- Understanding Cyber

Nina Godbole, Sunit
2 Crimes, Computer Forensics and Legal Wiley 1/e, 2011
Belapure
Perspectives

Computer and Cyber Security:

B.B.Gupta, D.P Agrawal,
3 Principles, Algorithm, Applications, CRC Press 1/e, 2018
Haoxiang Wang.
and Perspectives

James Graham, Richard

4 Cyber Security Essentials Auerbach 1/e, 2010
Howard, Ryan Otson
 Video Links (NPTEL, SWAYAM…)
Module
Link ID
No.
1 https://archive.nptel.ac.in/courses/111/101/111101137/

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

3 https://www.coursera.org/learn/data-security-privacy#modules
https://nptel.ac.in/courses/106105217
4
https://archive.nptel.ac.in/courses/106/106/106106156/
 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 Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Cloud Computing: A Practical
1 Approach for Learning and A.Srinivasan, J.Suresh Pearson 1/e, 2014
Implementation

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
2 architecture patterns: Component and Connector, Layered, Repository, Client- 10
Server, Publish-Subscribe, Functional independence – Coupling and Cohesion

1
 Case study: Ariane launch failure
Object Oriented Software Design - UML diagrams and relationships– Static
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 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)

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

4
 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
2 Software Engineering: A Primer Waman S Jawadekar Tata McGraw-Hill 1/e, 2008
Object-Oriented Modelling Michael Blaha, James Pearson Education.
3 2/e, 2007
and Design with UML 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.
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:-
4 Transport Layer Protocols- UDP, TCP; Congestion Control- Open Loop Vs 8
Closed Loop Congestion Control, Congestion Control in TCP; Application

1
 Layer - Application Layer Paradigms, Client-server applications, World Wide
Web and HTTP, FTP. Electronic Mail, DNS; Peer-to-peer paradigm - P2P
Networks.

Course Assessment Method

(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

Internal Internal
Assignment/
Attendance Examination-1 Examination- 2 Total
Microproject
(Written) (Written )
5 15 10 10 40

End Semester Examination Marks (ESE)

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

Part A Part B Total

2 Questions from each 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)

2
 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

Text Books
Name of the Edition and
Sl. No Title of the Book Name of the Author/s
Publisher Year
Computer Networks: A Top-
1 Behrouz A Forouzan McGraw Hill SIE, 2017
Down Approach

3
 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
TCP/IP Architecture, design,
2 M. Ajaykumar Wiley 1/e, 2008
and implementation in Linux
Venkatesulu
3 Computer Networks Andrew Tanenbaum Pearson 6/e, 2021
Computer Networking: A Top-
J. F. Kurose and K. W.
4 Down Approach Featuring Pearson Education 8/e, 2022
Ross
Internet

Video Links (NPTEL, SWAYAM…)

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

4
 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 3 Exam Hours 2 Hrs. 30 Min.

Prerequisites (if any) GXEST204 OR OECST615 Course Type Theory

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.

1
 Advanced Flutter Development:
State Management in Flutter: Provider, Riverpod, and BLoC
3 Networking in Flutter: HTTP Requests, JSON Parsing, RESTful APIs 9
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

3
 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

Video Links (NPTEL, SWAYAM…)

No. Link ID

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

4
 SEMESTER 8
COMPUTER SCIENCE AND ENGINEERING
(DATA SCIENCE)
 SEMESTER S8

TIME SERIES MODELING & ANALYSIS

Course Code PECDT861 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 convey the usability of time series data and its analysis in scientific/business applications.
SYLLABUS

Module Contact
Syllabus Description
No. Hours

Introduction to time series forecasting- Forecasting, Types of forecasting –

Short term, long term. Forecasting data and methods – Qualitative
forecasting, Quantitative forecasting. Simple Forecasting methods- Average
method, Naïve method, Drift Method. Steps in forecasting.

Introduction to Time series forecasting – Time Series Characteristics –

1 Types of Data – Time Series Data, Cross-Section Data, Longitudinal Data. 9

Understanding Time Series Data, Time series pattern- trend, seasonality,

cyclicity, and irregularity. Detecting Trends using Hodrick-Prescott filter
and Detrending time series. Detect Seasonality and De-seasoning, Detecting
Cyclic Variation. Error, Irregular Component and residuals. Time Series
Decomposition- Additive Models, Multiplicative models.

Exponential Smoothing – Simple exponential smoothing, Methods with

trend, methods with seasonality, estimation and modelling, Forecasting with
2 ETS models. 9

Regression Extension Techniques for time series data – Types of stationary

behaviour in time series, Making data stationary, Augmented Dickey-Fuller
 Test, Using stationary data techniques – Differencing, Random walk, Trend
Differencing, Seasonal Differencing.

Time series as a discrete parameter stochastic process, Auto- correlation

Function (ACF), Partial Autocorrelation Function (PACF) and cross
correlations, Auto Correlation Plots – Trend and seasonality in ACF plots.
3 9
Autoregressive (AR), Moving Average (MA), Autoregressive Moving
Average (ARMA), Autoregressive Integrated Moving Average (ARIMA)
models, Seasonal ARIMA (SARIMA) models.

Introduction to Multivariate Time series Modelling, Vector Autoregressive

models, Vector ARMA Models, Fitting VAR and VARMA models.
4 9
Dynamic Regression Models – Estimation, Regression with ARIMA errors
using R packages (fable), forecasting, stochastic and deterministic trends.

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

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, each question can have a maximum of 3 sub divisions. 60
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)

Describe different types of forecasting, fundamental principles of time

CO1 K2
series data, analyse various time series processes

Apply and interpret a variety of time series models and determine the
CO2 K3
most suitable model for various types of time series data.

Apply exponential smoothing methods for forecasting and analyse

CO3 K3
time series patterns.

CO4 Implement dynamic regression models 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 2 3

CO3 3 3 3 2 3

CO4 3 3 3

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

 Text Books

Sl. Name of the Edition and

Title of the Book Name of the Author/s
No Publisher Year

Robin John, Hyndman, George

1 Forecasting: Principles and Practice OTexts 3/e, 2021
Athanasopoulos

Hands-on Time Series Analysis with

2 BV Vishwas, Ashish Patel Apress 1/e, 2020
Python

The Analysis of Time Series An

3 Chris Chatfield, Haipeng Xing Chapman & Hall 7/e, 2019
Introduction with R

Reference Books

Sl. Name of the Edition and

Title of the Book Name of the Author/s
No Publisher Year

Time series Analysis and its

1 Shumway, R. H and Stoffer Springer 2006
Applications.

Time Series Analysis and Its Robert H. Shumway and David S.

2 Springer 4/e, 2017
Applications: With R Examples Stoffer

Time Series Analysis: Forecasting George E. P. Box, Gwilym M.

3 Wiley 5/e, 2015
and Control Jenkins, and Gregory C. Reinsel

Wayne A. Woodward, Henry L.

4 Applied Time Series Analysis CRC Press 7/e, 2017
Gray, and Alan C. Elliott

Video Links (NPTEL, SWAYAM…)

Module No. Link ID

1 https://onlinecourses.nptel.ac.in/noc21_ch28/preview
 SEMESTER S8

HEALTHCARE DATA ANALYTICS

Course Code PECDT862 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 student to health data formats, health care policy and standards and learn the
significance and need of data analysis and data visualization
2. To teach how health data management frameworks works and learn the use of machine
learning and deep learning algorithms in healthcare.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
INTRODUCTION TO HEALTHCARE ANALYSIS - Overview - History
of Healthcare Analysis Parameters on medical care systems- Health care
1 policy- Standardized code sets – Data Formats – Machine Learning 8
Foundations: Tree Like reasoning , Probabilistic reasoning and Bayes
Theorem, Weighted sum approach.
ANALYTICS ON MACHINE LEARNING - Machine Learning Pipeline –
Pre-processing –Visualization – Feature Selection – Training model parameter
– Evaluation model : Sensitivity , Specificity , PPV ,NPV, FPR , Accuracy ,
2 8
ROC , Precision Recall Curves , Valued target variables –
Python: Variables and types, Data Structures and containers , Pandas
Data Frame : Operations – Scikit –Learn : Pre-processing , Feature Selection.
HEALTH CARE MANAGEMENT - IOT- Smart Sensors – Migration of
3 Healthcare Relational database to NoSQL Cloud Database – Decision Support 10
System – Matrix block Cipher System – Semantic Framework Analysis –
 Histogram bin Shifting and Rc6 Encryption – Clinical Prediction Models –
Visual Analytics for Healthcare.
HEALTHCARE AND DEEP LEARNING - Introduction on Deep Learning
– DFF network CNN- RNN for Sequences – Biomedical Image and Signal
4 10
Analysis – Natural Language Processing and Data Mining for Clinical Data –
Mobile Imaging and Analytics – Clinical Decision Support System.

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)

CO1 Describe the health data formats, health care policy and standards K2

CO2 Identify the significance and need of data analysis and data visualization K2

CO3 Explain the health data management frameworks K2

Explain the use of machine learning and deep learning algorithms in

CO4 healthcare 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 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 Correlation3

Text Books
Name of the Edition and
Sl. No Title of the Book Name of the Author/s
Publisher Year
Big Data Analytics in
1 Anand J. Kulkarni et. al. Springer 1/e, 2020
HealthCare
Healthcare Analytics: From Data to
2 Knowledge to Healthcare Hui Yang and Eva K. Lee Wiley 1/e, 2016
Improvement
Chandan K. Reddy and Charu
3 Healthcare data analytics Taylor & Francis 1/e, 2015
C Aggarwal
 Reference Books
Name of the Edition and
Sl. No Title of the Book Name of the Author/s
Publisher Year
HealthCare Analysis Made
1 Vikas Kumar Packt Publishing 1/e, 2018
Simple
Nilanjan Dey, Amira Ashour ,
Healthcare Data Analytics and
2 Simon James Fong, Chintan Academic Press 1/e, 2018
Management
Bhatt

Video Links (NPTEL, SWAYAM…)

Module No. Link ID

Exploring Survey Data on Health Care, IIT Roorkee
1
https://nptel.ac.in/courses/109107190
Medical Image Analysis
2
https://onlinecourses.nptel.ac.in/noc24_ee57/preview
Analytics in Healthcare Management and Administration
3
https://www.coursera.org/learn/analytics-in-healthcare-management-and-administration
Big Data Analytics for Healthcare
4
https://www.my-mooc.com/en/mooc/bigdataanalytics
 SEMESTER S8

SOCIAL NETWORK ANALYSIS

Course Code PECDT863 CIE Marks 40

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

Credits 3 Exam Hours 2 Hrs. 30 Min.

Prerequisites (if any) None Course Type Theory

Course Objectives:

1. To enable the learners to understand the concepts of semantic web and related applications.
2. To impart the idea of knowledge representation using ontology.
3. To learn to explore human behaviour in social web and related communities and various
forms of social network visualization.
SYLLABUS

Module Contact
Syllabus Description
No. Hours
Introduction:-
Introduction to Semantic Web – Limitations of Current Web, Development
of Semantic Web, Emergence of the Social Web; Social Network Analysis –
1 Development of Social Network Analysis, Key Concepts and Measures in 8
Social Network Analysis; Electronic Sources for Network Analysis –
Electronic Discussion Networks, Blogs and Online Communities, Web-
Based Networks, Applications of Social Network Analysis.
Modelling, Aggregating and Knowledge Representation:-
Ontology and Their Role in Semantic Web – Ontology-Based Knowledge
Representation; Ontology Languages for the Semantic web – Resource
Description Framework, Web Ontology Language; Modelling and
2 Aggregating Social Network Data – State-of-the-art in Network Data 8
Representation, Ontological Representation of Social Individuals,
Ontological Representation of Social Individuals, Ontological Representation
of Social Relationships, Aggregating and Reasoning with Social Network
Data, Advanced Representations.
 Extraction and Mining Communities in Web Social Networks:-
Extracting evolution of Web Community from a Series of Web Archive,
Detecting Communities in Social Networks, Definition of Community,
Evaluating Communities, Methods for Community Detection and Mining,
3 8
Applications of Community Mining Algorithms, Tools for Detecting
Communities Social Network Infrastructures and communities,
Decentralized Online Social Networks, Multi-Relational Characterization of
Dynamic Social network communities.
Predicting Human Behaviour for Social Communities:-
Understanding and Predicting Human Behavior for Social Communities,
User Data Management, Inference and Distribution, Enabling New Human
Experiences, Reality Mining, Context–Awareness, Privacy in Online Social
Networks, Trust in Online Environment, Trust Models Based on Subjective
Logic, Trust Network Analysis, Trust Transitivity Analysis, Combining
4 Trust and Reputation, Trust Derivation Based on Trust Comparisons, Attack 12
Spectrum and Counter Measures.
Visualization of Social Networks:-
Graph theory, Centrality, Clustering, Node-Edge Diagrams, Matrix
Representation, Visualizing Online Social Networks, Visualizing Social
Networks with Matrix-Based Representations, Matrix and Node-Link
Diagrams, Hybrid Representations.

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)
CO1 Design and develop semantic web for the analysis of social networks. K3
CO2 Demonstrate how knowledge can be represented using ontology. K3
CO3 Explain how human behaviour can be predicted for social communities. K2
CO4 Use various mechanisms to visualize social networks. 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 2
CO4 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 and
Sl. No Title of the Book
Author/s Publisher Year
1 Social Networks and the Semantic Web Peter Mika Springer 1/e, 2010
Handbook of Social Network Technologies
2 Borko Furht Springer-Verlag 1/e, 2010
and Applications

Reference Books
Name of the Edition and
Sl. No Title of the Book Name of the Author/s
Publisher Year
Web Mining and Social Networking – Guandong Xu ,Yanchun
1 Springer-Verlag 1/e, 2011
Techniques and applications Zhang and Lin Li
Social information Retrieval Systems:
Emerging Dion Goh and Schubert
2 Idea Group 1/e, 2007
Technologies and Applications for Foo
Searching the Web Effectively
Collaborative and Social
Max Chevalier, Christine
Information Retrieval and Access: Information Science
3 Julien and Chantal Soulé- 1/e, 2009
Techniques for Improved user Reference
Dupuy
Modelling
John G. Breslin,
4 The Social Semantic Web Alexander Passant and Springer 1/e, 2009
Stefan Decker

Video Links (NPTEL, SWAYAM…)

Sl. No. Link ID

1 https://onlinecourses.nptel.ac.in/noc22_cs117/preview
 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:
3 10
Word representations - Lexical Semantics, Vector Semantics, TF-IDF,
 Pointwise Mutual Information (PMI), Neural Word embeddings - Word2vec,
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 Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Speech and language processing: An
introduction to natural language Dan Jurafsky and James
1 Pearson 2006
processing, computational linguistics, H. Martin.
and speech recognition
Introduction to Natural Language
2 Jacob Eisenstein MIT Press 2019
Processing
Lewis Tunstall, Leandro
Natural Language Processing with
3 von Werra, and Thomas O’Reilly 2022
Transformers
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

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
3 9
coders : Time domain/spectral domain/vocoders, Sub band coding, adaptive
transform coding, phase vocoder; Speaker Recognition :- Speaker
 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
Speech Communications: Human &
1 Douglas O'Shaughnessy IEEE Press 2/e, 1999
Machine
Discrete-Time Speech Signal
2 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
3 9
Application, Layer Replication, Logical Volume Manager–Based
Replication,
 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,
Alexander Morgan
1 Performance, Coding, Reliability, and Their 1/e, 2021
Thomasian Kaufmann
Data Processing
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
2 Tuning and Fine-Tuning Language Model; Using Zero-Shot, Few-Shot, and 9
Multi-Shot Learning in Prompts; Exploring the Role of Context, Repetition,
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
Speech and Language Daniel Jurafsky and
1 Pearson 2/e, 2013
Processing James H. Martin
Unlocking the Secrets of
2 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

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

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 :-
3 Gesture - Designing for gesture-based interaction, Implementing gesture 11
controls in AR/VR applications; Voice - Voice recognition technologies,
 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.
Dynamic Programming - The Control Abstraction- The Optimality Principle
- Matrix Chain Multiplication, Analysis; All Pairs Shortest Path Algorithm -
4 Floyd-Warshall Algorithm; The Control Abstraction of Backtracking – The 9
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.

Prerequisites (if any) GXEST203 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 9
Functions , The Document Object Model (DOM) - Nodes and NodeLists,
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
2 score, and modern mutation testing tools (e.g., Muclipse); JUnit Framework - 8
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
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

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 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
Cambridge
1 Introduction to Software Testing. Paul Ammann, Jeff Offutt 2/e, 2016
University Press
Software Testing and Quality Kshirasagar Naik,
2 Wiley 1/e, 2008
Assurance: Theory and Practice Priyadarshi Tripathy

Reference Books
Sl. Name of the Edition
Title of the Book Name of the Author/s
No Publisher and Year
1 Software Testing Ron Patten Pearson 2/e, 2005
Software Testing: A Craftsman’s
2 Paul C. Jorgensen CRC Press 4/e, 2017
Approach
Dorothy Graham, Rex Black,
3 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.
4 8
Projections- Parallel and Perspective projections. Visible surface detection
 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 Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Computer Graphics : Algorithms D. P. Mukherjee, Debasish
1 PHI 1/e, 2010
and Implementations Jana
Donald Hearn, M. Pauline
2 Computer Graphics with OpenGL Baker and Warren PHI 4/e, 2013
Carithers
 Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Introduction to Flat Panel Jiun-Haw Lee, I-Chun Cheng,
1 Wiley 1/e, 2020
Displays Hong Hua, Shin-Tson Wu
Computer Graphics and
2 ITL ESL Pearson 1/e, 2013
Multimedia
3 Computer Graphics Zhigang Xiang and Roy Plastock McGraw Hill 2/e, 2000
Principles of Interactive William M. Newman and Robert F.
4 McGraw Hill 1/e, 2001
Computer Graphics Sproull
Procedural Elements for
5 David F. Rogers McGraw Hill 1/e, 2017
Computer Graphics
6 Computer Graphics Donald D Hearn, M Pauline Baker Pearson 2/e, 2002

Video Links (NPTEL, SWAYAM…)

No. Link ID

Computer Graphics By Prof. Samit Bhattacharya at IIT Guwahati

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