SEMESTER 3

COMPUTER SCIENCE AND ENGINEERING

(CYBER SECURITY)

Common to B Tech in Cyber Security - CZ

 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
distribution, Poisson distribution as a limit of the binomial distribution, Joint
1 9
pmf of two discrete random variables, Marginal pmf, Independent random
variables, Expected value of a function of two discrete variables.

[Text 1: Relevant topics from sections 3.1 to 3.4, 3.6, 5.1, 5.2]

Continuous random variables and their probability distributions, Cumulative

distribution function, Expectation, Mean and variance, Uniform, Normal and
Exponential distributions, Joint pdf of two Continuous random variables,
2 Marginal pdf, Independent random variables, Expectation value of a function 9
of two continuous variables.

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

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

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

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

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

Course Assessment Method

(CIE: 40 marks , ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

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

5 15 10 10 40

End Semester Examination Marks (ESE)

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

Part A Part B Total

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

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

Bloom’s
Course Outcome Knowledge
Level (KL)

Understand the concept, properties and important models of discrete

CO1 K3
random variables and to apply in suitable random phenomena.
Understand the concept, properties and important models of continuous
CO2 K3
random variables and to apply in suitable random phenomena.
Familiarize and apply limit theorems and to understand the
CO3 K3
fundamental characteristics of stochastic processes.
Solve problems involving Markov Chains, to understand their
CO4 theoretical foundations and to apply them to model and predict the K3
behaviour of various stochastic processes.
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create

CO-PO Mapping Table:

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

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.

PCCST205
Prerequisites (if any) Course Type Theory

Course Objectives:

1. To introduce the concept of formal languages.

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

Module Contact
Syllabus Description
No. Hours
Foundations (Linz, Hopcroft)
Motivation for studying computability, need for mathematical modeling -
automata, Introducing automata through simple models - On/Off switch,
coffee vending machine. Three basic concepts: Alphabet, Strings, and
Languages
Finite Automata (Linz, Hopcroft)

1 Formal definition of a finite automaton, Deterministic Finite Automata 11

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

2 The formal definition of a regular expression, Building Regular

Expressions, Equivalence with finite automata (Proof not expected) -
 Converting FA to Regular Expressions, Converting Regular Expressions to
FA, Pattern Matching and Regular Expressions, Regular grammar,
Equivalence with FA - Conversion in both directions 11
Properties of Regular Languages (Linz)
Closure and Decision Properties of Regular Languages (with proofs), The
Pumping Lemma for Regular Languages (with formal proof), Pumping
lemma as a tool to prove non regularity of languages
Context-Free Grammars and Applications (Linz)
Formal definition of a context-free grammar, Designing context-free
grammars, Leftmost and Rightmost Derivations Using a Grammar, Parse
Trees, Ambiguous Grammars, Resolving ambiguity, Inherent ambiguity,
CFGs, and programming languages
Pushdown Automata (Linz)
Formal definition of a pushdown automaton, DPDA and NPDA, Examples
of pushdown automata
Equivalence NPDAs and CFGs (Proof not expected) - conversions in both
directions
Simplification of Context-Free Languages (Linz)

3 Elimination of useless symbols and productions, Eliminating epsilon 11

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/
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)
Classify formal languages into regular, context-free, context-sensitive,
CO1 K2
and unrestricted languages.
Design finite state automata, regular grammar, regular expression, and
CO2 K3
Myhill- Nerode relation representations for regular languages.
Design push-down automata and context-free grammar representations
CO3 K3
for context-free languages.
Design Turing Machines to accept recursive and recursively
CO4 K3
enumerable languages.
Understand the notions of decidability and undecidability of problems,
CO5 K2
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 (L: T:P: R) 3:1:0:0 ESE Marks 60

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 11
Binary Search Trees - Binary Search Tree Operations; Binary Heaps - Binary
Heap Operations, Priority Queue.
Graphs :- Definitions; Representation of Graphs; Depth First Search and
 Breadth First Search; Applications of Graphs - Single Source All Destination.

Sorting and Searching

Sorting Techniques :- Selection Sort, Insertion Sort, Quick Sort, Merge Sort,
Heap Sort, Radix Sort.
4 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
BASIC CONCEPTS IN COMPUTER NETWORKS

Course Code PBCCT304 CIE Marks 60

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

Credits 3:0:0:1 Exam Hours 2 Hrs. 30 Min.

Prerequisites (if any) None Course Type Theory

Course Objectives:

1. To understand and analyse the concepts of computer networking and its performance measures.
2. Understand the concepts of physical layer and data link layer
3. Understand important aspects and functions of network layer and various routing algorithms.
4. Understand and analyse the various transport and application layer protocols.
5. Acquire skill sets required for the development and deployment of networking applications

SYLLABUS

Module Contact
Syllabus Description
No. Hours
History of Computer Networks and the Internet , types of networks, Client-
server and peer-to-peer architecture. Design issues for the layers – Interface
& Service – Service Primitives. Reference models – OSI – TCP/IP.
1 9
Concept of Quality of Service metrics - throughput, delay, packet loss, and
jitter in packet-switched networks.

Physical layer design issues - Media, Signal strength and interference. Data
encoding, Multiplexing (TDM, FDM).
Data Link layer Design Issues – Flow Control and ARQ techniques. Data
2 9
link Protocols – HDLC. IEEE 802 FOR LANs IEEE 802.3, 802.5. Wireless
LANs - 802.11.
 Networking devices - Bridges, Routers, Gateways,
Network Layer Protocols - Virtual circuits and datagrams, Principles of
routing, internet protocol Ipv4 CIDR, IPv6, Network Address Translation ,
3 9
Firewalls, and VPNs
Routing algorithms - Link-state and distance vector routing, Routing on the
internet RIP OSPF and BGP.
Introduction to transport layer, Multiplexing and de-multiplexing, Principles
of Reliable data transfer – end-to - end flow control mechanisms, Connection
oriented transport TCP, Connectionless transport UDP.
4 9
Application layer protocols - HTTP and HTTPs, FTP, SMTP- S/MIME,
DNS, and Peer-to-peer file sharing networks

Suggestion on Project Topics

Project: Installation and configuration of the LAMP stack. Design and develop a relevant web
application using the LAMP stack. Deploy the web application project in a LAN with a server and
clients with distinct IP addresses.

Course Assessment Method

(CIE: 60 marks, ESE: 40 marks)

Continuous Internal Evaluation Marks (CIE):

Attendance Project Internal Ex-1 Internal Ex-2 Total

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

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

Part A Part B Total

 2 Questions from each  2 questions will be given from each module,
module. out of which 1 question should be answered.
 Total of 8 Questions,  Each question can have a maximum of 2 sub
40
each carrying 2 marks divisions.
(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)

To understand and apply the concepts of computer networking and its K3

CO1
performance measures.

CO2 Understand the concepts of physical layer and data link layer K2
Understand important aspects and functions of network layer and K2
CO3
various routing algorithms
Understand and analyse the various transport and application layer K2
CO4
protocols.
Acquire skill sets required for the development and deployment of K6
CO5
networking 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 2 2 2 2 2

CO2 3 2 2 2 2 2

CO3 3 2 2 2 2

CO4 3 2 2 2 2 2

CO5 3 2 3 2 3 2 2 2 3 3 3 2

Text Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Behrouz A. Forouzan Tata McGraw Hill First
1 Computer Networks: A Top-
and Education Private Edition
Down Approach
Firouz Mosharraf Limited 2023
The Morgan Sixth
2 Computer Networks-A Systems Larry L. Peterson &
Kaufmann Series in Edition,
Approach Bruce S. Dave
Networking 2021
Andrew S. Tanenbaum, Sixth
3 Computer Networks Nick Feamster, David Pearson Edition,
Wetherall 2021

Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
James F. Kurose Seventh
1 Computer Networking
and Pearson Edition,
A Top-Down Approach
Keith W. Ross 2017
Fifth
2 Computer Networking and the
Fred Halsall Pearson Edition,
Internet
2006
The Illustrated Network: How Second
3 TCP/IP Works in a Modern Walter Goralski Morgan Kaufmann Edition,
Network 2009
Seventh
4 Networking All-in-One for
Doug Lowe John Wiley & Sons Edition,
Dummies
2020
 Video Links (NPTEL, SWAYAM…)
Module
Link ID
No.
1 https://nptel.ac.in/courses/106105183

2 https://www.udemy.com/course/networkingbasics/

3 https://ubuntu.com/server/docs/get-started-with-lamp-applications

PBL Course Elements

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

(3 Hrs.) Tutorial Practical Presentation

Simulation/

Laboratory Presentation (Progress and

Lecture delivery Project identification
Work/ Final Presentations)

Workshops

Group
Project Analysis Data Collection Evaluation
discussion

Question answer Project Milestone Reviews,

Analytical thinking and Feedback,
Sessions/ Testing
Brainstorming self-learning Project reformation (If
Sessions required)

Poster Presentation/
Guest Speakers
Case Study/ Field Video Presentation: Students
(Industry Prototyping
Survey Report present their results in a 2 to 5
Experts)
minutes video
 Assessment and Evaluation for Project Activity

Sl. No Evaluation for Allotted

Marks

1 Project Planning and Proposal 5

2 Contribution in Progress Presentations and Question Answer 4

Sessions

3 Involvement in the project work and Team Work 3

4 Execution and Implementation 10

5 Final Presentations 5

6 Project Quality, Innovation and Creativity 3

Total 30

1. Project Planning and Proposal (5 Marks)

 Clarity and feasibility of the project plan

 Research and background understanding
 Defined objectives and methodology

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

 Individual contribution to the presentation

 Effectiveness in answering questions and handling feedback

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

 Active participation and individual contribution

 Teamwork and collaboration

4. Execution and Implementation (10 Marks)

 Adherence to the project timeline and milestones

 Application of theoretical knowledge and problem-solving
 Final Result
5. Final Presentation (5 Marks)

 Quality and clarity of the overall presentation

 Individual contribution to the presentation
 Effectiveness in answering questions

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

 Overall quality and technical excellence of the project

 Innovation and originality in the project
 Creativity in solutions and approaches
 SEMESTER 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,
1 OR gate, NOR gate, NAND gate, XOR gate, XNOR gate; Digital circuit 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…)

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

ECONOMICS FOR ENGINEERS

(Common to All Branches)

Course Code UCHUT346 CIE Marks 50

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

Credits 2 Exam Hours 2 Hrs. 30 Min.

Prerequisites (if any) None Course Type Theory

Course Objectives:

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

Module Contact
Syllabus Description
No. Hours

Basic Economics Concepts - Basic economic problems – Production

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

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

Internal and External Economies – Cobb-Douglas Production Function

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

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

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

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

National income – Concepts - Circular Flow – Methods of Estimation and

Difficulties - Stock Market – Functions- Problems faced by the Indian stock
market-Demat Account and Trading Account – Stock market Indicators-
SENSEX and NIFTY

Value Analysis and value Engineering - Cost Value, Exchange Value, Use
Value, Esteem Value - Aims, Advantages and Application areas of Value
4 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/ Case
Attendance Examination-1 Examination- 2 Total
study/Microproject
(Written) (Written)

10 15 12.5 12.5 50

End Semester Examination Marks (ESE)

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

Part A Part B Total

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

3 R. Paneerselvam PHI 2012

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

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

Engineering Economics and Donald G. Newman,

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

Contemporary Engineering Prentice Hall of India

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

ENGINEERING ETHICS AND SUSTAINABLE DEVELOPMENT

Course Code UCHUT347 CIE Marks 50

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

Credits 2 Exam Hours 2 Hrs. 30 Min.

Prerequisites (if any) None Course Type Theory

Course Objectives:

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

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Fundamentals of ethics - Personal vs. professional ethics, Civic Virtue,
Respect for others, Profession and Professionalism, Ingenuity, diligence
and responsibility, Integrity in design, development, and research domains,
Plagiarism, a balanced outlook on law - challenges - case studies,
Technology and digital revolution-Data, information, and knowledge,
Cybertrust and cybersecurity, Data collection & management, High
1 6
technologies: connecting people and places-accessibility and social
impacts, Managing conflict, Collective bargaining, Confidentiality, Role
of confidentiality in moral integrity, Codes of Ethics.
Basic concepts in Gender Studies - sex, gender, sexuality, gender
spectrum: beyond the binary, gender identity, gender expression, gender
stereotypes, Gender disparity and discrimination in education,
 employment and everyday life, History of women in Science & Technology,
Gendered technologies & innovations, Ethical values and practices in
connection with gender - equity, diversity & gender justice, Gender policy
and women/transgender empowerment initiatives.

Introduction to Environmental Ethics: Definition, importance and

historical development of environmental ethics, key philosophical theories
(anthropocentrism, biocentrism, ecocentrism). Sustainable Engineering
Principles: Definition and scope, triple bottom line (economic, social and
environmental sustainability), life cycle analysis and sustainability metrics.

2 Ecosystems and Biodiversity: Basics of ecosystems and their functions, 6

Importance of biodiversity and its conservation, Human impact on
ecosystems and biodiversity loss, An overview of various ecosystems in
Kerala/India, and its significance. Landscape and Urban Ecology:
Principles of landscape ecology, Urbanization and its environmental impact,
Sustainable urban planning and green infrastructure.

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

Water scarcity and pollution issues, Sustainable water management practices,
Environmental flow, disruptions and disasters. Zero Waste Concepts and
Practices: Definition of zero waste and its principles, Strategies for waste
reduction, reuse, reduce and recycling, Case studies of successful zero waste
initiatives. Circular Economy and Degrowth: Introduction to the circular

3 economy model, Differences between linear and circular economies, 6

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

Renewable Energy and Sustainable Technologies: Overview of renewable

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

Course Assessment Method

(CIE: 50 marks , ESE: 50)

Continuous Internal Evaluation Marks (CIE):

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

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

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

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

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

prepare a report

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

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

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

4 Final A comprehensive presentation summarising the key takeaways G 5

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

Total Marks 50

*Can be taken from the given sample activities/projects

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

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

Bloom’s
Course Outcome Knowledge
Level (KL)

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

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

CO-PO Mapping Table:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
3 2 3 3 2 2
CO1
1 3 2 3 3 2 2
CO2
3 3 2 3 2 2
CO3
1 3 3 2 3 2 2
CO4
3 3 2 3 2 2
CO5
 Reference Books
Edition and
Sl. No Title of the Book Name of the Author/s Name of the Publisher
Year
2nd edition
Ethics in Engineering Practice Cambridge University
1 Caroline Whitbeck & August
and Research Press & Assessment
2011

Cambridge University November

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

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

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

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

New age international

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

Tata McGraw Hill

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

Suggested Activities/Projects:

Module-II

● Write a reflection on a local environmental issue (e.g., plastic waste in Kerala

backwaters or oceans) from different ethical perspectives (anthropocentric, biocentric,
ecocentric).
● Write a life cycle analysis report of a common product used in Kerala (e.g., a coconut,
bamboo or rubber-based product) and present findings on its sustainability.
● Create a sustainability report for a local business, assessing its environmental, social, and
economic impacts
● Presentation on biodiversity in a nearby area (e.g., a local park, a wetland, mangroves,
college campus etc) and propose conservation strategies to protect it.
● Develop a conservation plan for an endangered species found in Kerala.
 ● Analyze the green spaces in a local urban area and propose a plan to enhance urban
ecology using native plants and sustainable design.
● Create a model of a sustainable urban landscape for a chosen locality in Kerala.
Module-III
● Study a local water body (e.g., a river or lake) for signs of pollution or natural flow disruption and
suggest sustainable management and restoration practices.
● Analyse the effectiveness of water management in the college campus and propose improvements -
calculate the water footprint, how to reduce the footprint, how to increase supply through rainwater
harvesting, and how to decrease the supply-demand ratio
● Implement a zero waste initiative on the college campus for one week and document the challenges
and outcomes.
● Develop a waste audit report for the campus. Suggest a plan for a zero-waste approach.
● Create a circular economy model for a common product used in Kerala (e.g., coconut oil, cloth etc).
● Design a product or service based on circular economy and degrowth principles and present a
business plan.
● Develop a plan to improve pedestrian and cycling infrastructure in a chosen locality in Kerala

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

Teaching Hours/Week (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 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 Press,
1 2/e, 2007
Structures in C Anderson-Freed,

Thomas H Cormen, Charles

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

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

Aho A. V., J. E. Hopcroft

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

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

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

Theory and Problems of Data

4 Lipschutz S. Schaum’s Series 2/e, 2014
Structures
 Video Links (NPTEL, SWAYAM…)

No. Link ID

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

2 https://ocw.mit.edu/courses/6-851-advanced-data-structures-spring-2012/

Continuous Assessment (25 Marks)

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

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

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

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

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

3. Lab Reports and Record Keeping (6 Marks)

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

4. Viva Voce (5 Marks)

● Oral Examination: Ability to explain the experiment, results and underlying principles during
a viva voce session.
Final Marks Averaging: The final marks for preparation, conduct of experiments, viva,
and record are the average of all the specified experiments in the syllabus.

Evaluation Pattern for End Semester Examination (50 Marks)

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

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

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

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

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

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

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

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

4. Viva Voce (10 Marks)

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

5. Record (5 Marks)

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

 SEMESTER S3

SHELL SCRIPTING AND NETWORK

ADMINISTRATION USING LINUX

Course Code PCCSL308 CIE Marks 50

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

Credits 2 Exam Hours 2 Hrs. 30 Min.

None /
Prerequisites (if any) Course Type Lab
Course Code

Course Objectives:

1. The course aims to master Shell Scripting and get hands-on exposure to network
Administration.
2. The course aims to offer hands-on experience for learners in Python programming and use it
for security implementations.
3. The course aims to offer exposure to Practical Application of Tools and Utilities

Expt.
Experiments
No.
Introduction of Linux and usage of terminal editors.

Familiarity with following commands/operations expected

1
1. man 2. ls, echo, read 3. more, less, cat, 4. cd, mkdir, pwd, find 5. mv, cp, rm ,tar 6. wc,
cut, paste 7. head, tail, grep, expr 8. chmod, chown 9. Redirections & Piping 10. useradd,
usermod, userdel, passwd 11. df,top, ps 12 ssh, scp, ssh-keygen, ssh-copy-id

Study the following aspects of Shell scripting: bash syntax, environment variables,
2 variables, control constructs such as if, for and while, aliases and functions, accessing
command line arguments passed to shell scripts.

3
Study of startup scripts, login and logout scripts, familiarity with system d and system V
 init scripts expected.

a) Write a script to create a directory structure

4
b) Implement a script to list all files and directories within a specified directory
showing date of creation & serial number of file.

a) Write a script to automate a task (e.g., backup important files) and schedule it
5
using cron.
b) Create a script to clean up old log files periodically.

Write a script to monitor system resources such as CPU, memory, and disk usage and
6
Implement a script to send an alert if resource usage exceeds a specified threshold.

a) Study of IPv4 networking, command line tools, and network commands, including
ping, traceroute, nslookup, ip, nc, and tcpdump.
7 b) Configuring IP addresses, both dynamic and static Subnet masks, CIDR address
schemes.
c) Study concepts of iptables, LAN firewall configuration, and application layer
(L7) proxies

8 a) Write a script to ping a list of servers and log the results.

b) Implement a script to check if a specific port is open on a remote server.

9 a) Write a script to automate common network troubleshooting commands

b) Write a script to capture network packets using tcpdump

a) Write a script to start, stop, and restart network services (e.g., Apache, Nginx,
10 MySQL)
b) Implement a script to check the status of these services and restart them if they are
not running.

11 a) Write a script to set up basic firewall rules using iptables or firewalld.

b) Implement a script to allow or block specific IP addresses or ranges
12 Familiarizing Python- variables, decision statements, iteration statements, functions

13 Write a python program to check the strength of a password.

14 Write a Keylogger / key logger detection tool program using python

15 Write a python program to implement Primality testing using Miller-Rabin Method

16 Write a python program to implement pseudo-random number generation

Implement Client-Server communication using Socket Programming and TCP as transport

17
layer protocol.

Implement Client-Server communication using Socket Programming and UDP as

18
transport layer protocol.
 Course Assessment Method
(CIE: 50 marks, ESE: 50 marks)

Continuous Internal Evaluation Marks (CIE):

Preparation/Pre-Lab Work experiments,

Viva and Timely
Internal
Attendance Total
completion of Lab Reports / Record Examination

(Continuous Assessment)
5 25 20 50

End Semester Examination Marks (ESE):

Procedure/ Conduct of experiment/ Result with valid

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

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

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

Course Outcomes (COs)

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

Bloom’s
Course Outcome Knowledge
Level (KL)
CO1 Familiarizing the basic Linux and networking commands/operations K2

CO2 Illustrate the use of shell scripting in system and network administration K3

CO3 Create scripts for directories and file structures K3

CO4 Develop security related programs using python libraries K3

CO5 Implement Client server communication using standard protocols 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

CO2 3 3

CO3 3 3

CO4 3 3

CO5 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
Second
The Linux Command Line: A
1 William E. Shotts Jr. No Starch Press Internet
Complete Introduction
Edition

Learning the bash Shell: Unix Third

2 Cameron Newham O'Reilly Media
Shell Programming" edition

Automate the Boring Stuff with Second

3 Al Sweigart No Starch Press
Python edition

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
1 http://acl.digimat.in/nptel/courses/video/117106113/117106113.html

2 https://archive.nptel.ac.in/courses/106/106/106106212/

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
(CYBER SECURITY)
 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
3 and binary trees, Counting trees, Spanning trees, Prim's algorithm and 9
Kruskal's algorithm, Dijkstra's shortest path algorithm, Floyd-Warshall
 shortest path algorithm.

[Text 1: Relevant topics from sections 3.1, 3.2, 3.3, 3.4, 3.5, 3.6, 3.7, 3.10,
11.5. Proofs of theorems 3.10, 3.16 are excluded.]
Matrix representation of graphs- Adjacency matrix, Incidence Matrix, Circuit
Matrix, Path Matrix, Coloring, Chromatic number, Chromatic polynomial,
4 Greedy colouring algorithm. 9

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

Course Assessment Method

(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

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

5 15 10 10 40

End Semester Examination Marks (ESE)

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

Part A Part B Total

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

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

Bloom’s
Course Outcome Knowledge
Level (KL)

Understand the fundamental concepts of graph theory such as types of

CO1 K2
graphs, degree of a vertex, graph isomorphism, connectedness.
Understand the concepts of Euler graphs, Hamiltonian graphs and
CO2 K2
connectivity.
Apply Prim's and Kruskal's algorithms for finding minimum cost
CO3 spanning tree and Dijkstra's and Floyd-Warshall algorithms for finding K3
shortest paths.
Illustrate various representations of graphs using matrices and apply
CO4 K3
vertex coloring in real life problems.
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create

CO-PO Mapping Table:

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

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
1st edition,
1 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 2e Douglas B. West Pearson Education 2nd edition,
India 2015

2 Introduction to Graph Theory Robin J. Wilson Longman Group Ltd. 5th edition,
2010

3 J.A. Bondy and U.S.R. Elsevier Science

Graph Theory with Applications 1976
Murty Publishing Co., Inc

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
1 https://onlinecourses.nptel.ac.in/noc22_ma10/preview
2 https://onlinecourses.nptel.ac.in/noc22_ma10/preview
3 https://onlinecourses.nptel.ac.in/noc21_cs48/preview
4 https://onlinecourses.nptel.ac.in/noc21_cs48/preview
 SEMESTER S4
DATABASE MANAGEMENT SYSTEMS
(Common to CS/CD/CA/CR/AD/AI/CB/CN/CC/CU/CI/CG)

Course Code PCCST402 CIE Marks 40

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

Credits 4 Exam Hours 2 Hrs. 30 Min.

Prerequisites (if any) PCCST303 Course Type Theory

Course Objectives:

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

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

Module Contact
Syllabus Description
No. Hours
Introduction to Databases :- Database System Concepts and Architecture-
Data Models, Schemas and Instances, Three-Schema Architecture and Data
Independence, Database Languages and Interfaces, Centralized and
Client/Server Architectures for DBMSs.
1
Conceptual Data Modelling and Database Design:- Data Modelling Using the 11
Entity, Relationship (ER) Model - Entity Types, Entity Sets, Attributes, and Keys,
Relationship Types, Relationship Sets, Roles, and Structural Constraints, Weak
Entity Types. Refining the ER Design for the COMPANY Database.
The Relational Data Model and SQL - The Relational Data Model and Relational
Database Constraints-Relational Algebra and Relational Calculus - Structured Query
2 Language (SQL)-Data Definition Language, Data Manipulation Language,
Assertions, Triggers, views, Relational Database Design Using ER-to-Relational 11
Mapping.
Database Design Theory & Normalization - Functional Dependencies -
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.
A., H. F. Korth and S. Sudarshan, Korth and S. Sudarshan,
McGraw
1 Database System Concepts, Database System 7/e, 2011
Hill,
Concepts, 6/e, McGraw
Hill, 2011.
Beginning Database Design
2 Rod Stephens Wiley 2/e, 2023
Solutions
Pramod J. Sadalage, Addison-
2 NoSQL Distilled 1/e, 2012
Martin Fowler Wesley
NoSQL Data Models: Trends and
3 Challenges (Computer Engineering: Olivier Pivert Wiley 2018
Databases and Big Data),

Video Links (NPTEL, SWAYAM…)

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

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

Course Code PCCST403 CIE Marks 40

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

Credits 4 Exam Hours 2 Hrs. 30 Min.

Prerequisites (if any) None Course Type Theory

Course Objectives:
1. To introduce the structure of a typical operating system and its core functionalities
2. To impart to the students, a practical understanding of OS implementation nuances based on the
Linux operating system
SYLLABUS

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

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

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

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

Threads and Concurrency: Concept of a thread, Multithreading benefits,

Multithreading models (Book 3 Ch 4)

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

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

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

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

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

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

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

Concurrency: Deadlock and Starvation - Deadlock Characterization,

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

Memory management - Address Space, Memory API, Address Translation

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

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

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

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

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

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

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

11.2)

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

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

File Organization: The Inode, The Multi-Level Index (Book 1 Ch 40)

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

Course Assessment Method

(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

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

5 15 10 10 40

End Semester Examination Marks (ESE)

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

Part A Part B Total

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

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

Bloom’s
Course Outcome Knowledge
Level (KL)
Apply the concepts of process management and process scheduling
CO1 K3
mechanisms employed in operating systems.
Choose various process synchronization mechanisms employed in
CO2 K3
operating systems.
Use deadlock prevention and avoidance mechanisms in operating
CO3 K3
systems.
CO4 Select various memory management techniques in operating systems. K3

CO5 Understand the storage management in operating systems. K2

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

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

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

CO2 3 3 3 3

CO3 3 3 3 3

CO4 3 3 3 3

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

Text Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Operating Systems: Three Easy Andrea Arpaci-Dusseau,
1 Pieces Remzi Arpaci-Dusseau CreateSpace 1/e, 2018

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

Abraham Silberschatz, Peter

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

Video Links (NPTEL, SWAYAM…)

Sl. 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.
 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)
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 Name of the Edition

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

Computer Organization and Architecture

2 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 : The David A. Patterson
Morgan
1 Hardware/Software Interface: RISC-V John L. Hennessy 1/e,2018
Kaufaman
Edition
Carl Hamacher,
Computer Organization and Embedded Zvonko Vranesic,
2 McGraw Hil 6/e, 2012
Systems Safwat Zaky,
Naraig Manjikian
Modern Computer Architecture and
3 Jim Ledin Packt Publishing 1/e,2020
Organization

Video Links (NPTEL, SWAYAM…)

Sl. No. Link ID

1 https://archive.nptel.ac.in/courses/106/105/106105163/
2 https://archive.nptel.ac.in/courses/106/106/106106166/

PBL Course Elements

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

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

INTRODUCTION TO PARALLEL & DISTRIBUTED PROGRAMMING

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

Course objectives:

1. Identify the models and frameworks best suited to various workloads.

2. Constructing parallel and distributed applications, including testing, debugging and performance
evaluation

SYLLABUS

Module Contact
Syllabus Description
No. Hours

Distributed System: Definition, Relation to computer system components,

Motivation, Primitives for distributed communication, Design issues,

1 Challenges and applications.

Leader election algorithm- Bully algorithm, Ring algorithm. Termination 9

detection- Spanning tree-based algorithm.

Distributed mutual exclusion algorithms- System model, Requirements of

mutual exclusion algorithm. Lamport’s algorithm, Ricart- Agrawala

2 algorithm, Quorum based mutual exclusion algorithms- Maekawa’s

algorithm. 9

Token based algorithm- Suzuki-Kasami’s broadcast algorithm.

Parallel Computing: Principles of Parallel Algorithm Design Decomposition
Techniques, Characteristics of Tasks and interactions, Mapping techniques

3 for load balancing.

11
Basic Communication operations: One to All Broadcast and All to One
Reduction, All to All Broadcast and Reduction, All Reduce
 And Prefix Sum operations, Scatter and Gather, All to All Personalized
communication, Circular Shift, Improving the speed of some communication
operation.
Principles of Message Passing Programming, The building blocks: Send
and Receive Operations, MPI: The Message Passing Interface, Overlapping
4
Communication with Computation, Collective Communication and 7
Computation Operations, Groups and Communicators.

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 Illustrate election algorithm and termination detection algorithm. K2

Compare token based, non-token based and quorum based mutual

CO2 exclusion algorithms K2

Appreciate the communication models for parallel algorithm

CO3 development K2

CO4 Develop parallel algorithms using message passing paradigms. K3

Demonstrate the fundamentals skills of heterogenous computing with

CO5 shared memory architecture. 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 3 3 2 2

CO3 3 2 2

CO4 3 2 2 2 2 2

CO5 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
AnanthGrama, Anshul Second
1 Introduction to Parallel Computing Gupta, George Karypis, edition,200
Vipin Kumar 3
Ajay D. Kshemkalyani
University of Illinois at
First
Distributed Computing Principles, Chicago, Chicago and Cambridge
2 Edition,200
Algorithms, and Systems Mukesh Singhal University Press
8
University of Kentucky,
Lexington
Third
Maarten van Steen Pearson
3 Distributed system edition
Andrew S Tanebaum Education,Inc.
,2017

Reference Books
Name of the Name of the Edition
Sl. No Title of the Book
Author/s Publisher and Year
Morgan
Maurice Herlihy
1 The Art of Multiprocessor Programming Kaufmann 2008
and NirShavit
Publishers
C. Lin, L. Snyder,
2 Principles of Parallel Programming 2009
Addison-Wesley
George Coulouris,
Distributed Systems: Concepts and Jean Dollimore, Fifth
3 Addison Wesley
Design Tim Kindberg and edition
Gordon Blair
An Introduction to Distributed
4 Valmir C. Barbosa MIT Press 2003
Algorithms

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
https://www.youtube.com/watch?v=R1FfoED7OGo&t=13s&pp=ygUqYnVsbHkgYWxnb3Jpd
1
GhtIGluIGRpc3RyaWJ1dGVkIHN5c3RlbSBjb2Rl
https://www.youtube.com/watch?v=yduKTBqVAH8&pp=ygUvdG9rZW4gYmFzZWQgYWx
2
nb3JpdGhtcyBpbiBkaXN0cmlidXRlZCBjb21wdXRpbmc%3D
https://www.youtube.com/watch?v=huwsVa6wXRM&pp=ygUeYmFzaWMgY29tbXVuaWNh
3
dGlvbiBvcGVyYXRpb25z
https://www.youtube.com/watch?v=QkV_5lNF1Lw&pp=ygUZTVBJIElOIFBBUkFMTEVMI
4
ENPTVBVVElORw%3D%3D
 SEMESTER S4

INTRODUCTION TO BLOCK-CHAIN TECHNOLOGIES

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

Course Objectives:

1. To undertake path-breaking research that creates new computing technologies and solutions
for industry and society at large.
2. To create cryptocurrencies and give a strong technical understanding of Blockchain
technologies with an in-depth understanding of applications, open research challenges, and
future directions.
SYLLABUS

Module Contact
Syllabus Description
No. Hours
Cryptography: Concepts and Techniques-Introduction, plaintext and cipher
text, substitution techniques, transposition techniques, encryption and
decryption, symmetric and asymmetric key cryptography.

1 Introduction to block-chain – basic ideas behind blockchain, generic

elements of a blockchain. Types -private, public, hybrid blockchain. 9

Applications of Blockchain in E-Governance, Land Registration, Medical

Information Systems, and others. Benefits & Limitations of blockchain.
Blockchain: Versions, variants, usecases, life-usecases of blockchain,
Blockchain vs shared database.
The real need for mining – Consensus – definition, types, consensus in
blockchain, Byzantine Generals Problem, and Consensus as a distributed
2
coordination problem.
9
Decentralization – Decentralization using blockchain, Methods of
decentralization, Routes to decentralization, Blockchain and full ecosystem
decentralization.
 Introduction to crypto-currency: definition, types, applications.
Introduction to Bitcoins: Definition, Bitcoin Digital Keys & Addresses,

3 Transactions, Limitations of Bitcoins.

9
Introduction to Blockchain platforms: Ethereum, Hyperledger, IOTA, EOS,
Multichain, Bigchain etc. Advantages & disadvantages.
Smart Contracts – Definition, Smart contract templates, Oracles, Types of
oracles, Deploying smart contracts.
4
Ethereum – The Ethereum network. Components of the Ethereum ecosystem 9
– Keys and addresses, Accounts, Transactions and messages.

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 the cryptographic building blocks and fundamental concepts K2
CO1
of blockchain technology.
K2
CO2 Explain the concepts of consensus and decentralization in blockchain.
Explain the concepts of first decentralized cryptocurrency bitcoin and K2
CO3
blockchain platforms.
K2
CO4 Explain the use of smart contracts and Ethereum.

CO5 Illustrate the development of blockchain applications. 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 2 2

CO2 3 2 2

CO3 3 2 2

CO4 3 2 2

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

Text Books
Name of the Name of the Edition
Sl. No Title of the Book
Author/s Publisher and Year
Blockchain: The Blockchain for
Create Space
Beginnings, Guild to Blockchain
1 Josh Thompson Independent 2017
Technology and Blockchain
Publishing Platform
Programming
Mastering Blockchain: A deep dive
into distributed ledgers, consensus second
2 protocols, smart contracts, DApps, Imran Bashir Packt Publishing edition,
cryptocurrencies, Ethereum, and 2018.
more,
 Reference Books
Name of the Name of the Edition and
Sl. No Title of the Book
Author/s Publisher Year
Solidity Programming Essentials: A
First edition,
1 beginner's guide to build smart Ritesh Modi Packt Publishing
2018
contracts for Ethereum and blockchain
Blockchain Technology: Concepts and Kumar Saurabh, Wiley First edition,
2
Applications Ashutosh Saxena Publications 2020
Chandramouli
Universities Press First edition,
3 Blockchain Technology Subramanian,
(India) Pvt. Ltd. August 2020
Asha A George,

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
https://www.youtube.com/watch?v=WeuJqKEfSxM&pp=ygUaaW50cm9kdWN0aW9uIHRvI
1
GJsb2NrY2hhaW4%3D
https://www.youtube.com/watch?v=rYQgy8QDEBI&pp=ygUOY3J5cHRvY3VycmVuY3k%3
2
D
https://www.youtube.com/watch?v=jxLkbJozKbY&t=34s&pp=ygUQYml0Y29pbiBwbGF0Z
3
m9ybQ%3D%3D
https://www.youtube.com/watch?v=lB81CiQj21E&pp=ygU4Y29uc2Vuc3VzIOKAkyBkZWZ
4
pbml0aW9uLCB0eXBlcywgY29uc2Vuc3VzIGluIGJsb2NrY2hhaW4%3D
 SEMESTER S4

INTRODUCTION TO AI AND ML

Course Code PECCT413 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 principles of AI and ML, including intelligent agents,

problem-solving techniques, knowledge representation, various learning paradigms, and
evaluation metrics.
2. Develop practical skills in implementing Machine Learning algorithms like supervised and
unsupervised learning algorithms, model selection techniques, and basic deep learning
architectures.
3. Analyze the applications and ethical implications of AI and ML across different domains
including fairness, explainability, and societal impact.
SYLLABUS

Module Contact
Syllabus Description
No. Hours
Introduction to AI - History and Applications of AI: Intelligent Agents -
Types of intelligent agents, Problem-solving & search algorithms
(uninformed and informed search): Knowledge Representation and
Reasoning - Propositional logic, First-order logic, Reasoning systems

1
Introduction to Machine Learning: Machine learning vs. traditional
9
programming, Types of learning (supervised, unsupervised, reinforcement
learning). The Machine Learning Pipeline, Data Preprocessing, Idea of
Training, Testing, Validation; Review of Gradient Descent Algorithm

Supervised Learning: Linear Regression, Decision Trees, K-Nearest

Neighbors(KNN)
2
Unsupervised Learning: Principal Component Analysis (PCA), K-means
9
clustering
 Model Selection and Regularization: Underfitting, Overfitting, L1 and L2
regularization.

Evaluation measures – Mean Squared Error (MSE), Mean Absolute Error

(MAE), Root Mean Squared Error (RMSE), R Squared/Coefficient of
Determination, Precision, Recall, Accuracy, F-Measure, Receiver Operating
Characteristic Curve(ROC), Area Under Curve (AUC), Cross-entropy loss.

Introduction to Neural Networks and Deep Learning: Perceptron,

Multilayer Feed-Forward Network; Activation Functions - Sigmoid, ReLU,
Tanh

Backpropagation Algorithm; Artificial Neural Networks (ANNs),

3
Activation Functions, Convolutional Neural Networks (CNNs), 9
Architecture, Applications.

Case Study: Application of ML for Phishing Detection

Recurrent Neural Networks (RNNs) and Long Short-Term Memory

(LSTM) networks: Architecture, Applications (General understanding of
natural language processing)

4 9
Ethical Considerations in AI and ML: Bias, Fairness, Explainability,
Societal Impact
Case Study: Application of AI for Intrusion Detection

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)
Students will Understand and will be able to explain the fundamental
CO1 K2
principles of AI

Students will be able to select, apply, implement, regularize and

CO2 K3
evaluate supervised and unsupervised learning algorithms.

Students will be able to design, train, and optimize neural networks and
CO3 K2
will Understand Deep Learning concepts like ANN and CNN

Students will Understand applications of DL in NLP and will be able

CO4 K2
to Analyse AI based on ethical considerations.

Students will be able to analyze and apply AI and ML techniques in

cybersecurity through specific case studies, understanding their
CO5 K4
practical implementations, challenges, and effectiveness in real-world
scenarios.

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

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
3 2 1 2
CO1
3 3 2 2 3 2 2
CO2
3 3 3 2 3 2 2
CO3
3 2 2 3 3 3 2 3 3
CO4
3 3 3 3 3 2 3 2 3 3
CO5
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
Artificial Intelligence: A Modern Stuart Russell and Peter 4th Edition
1 Pearson
Approach Norvig (2022)

John Paul Mueller and Luca 2nd Edition

2 Machine Learning for Dummies Wiley
Massaron (2021)

Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Hands-On Machine Learning 2nd
1 with Scikit-Learn, Keras, and Aurélien Géron O'Reilly Media, Inc Edition
TensorFlow (2019)
3rd
Artificial Intelligence for Heaton Research
2 Jeff Heaton Edition
Humans LLC
(2020)

Artificial Intelligence Basics:

Tom Taulli Manning Publications 2019
3 A Non-Technical Introduction

Machine Learning Tom Mitchell McGraw-Hill 1997

4
The Hundred-Page Machine
5 Andriy Burkov 2019
Learning Book
 Video Links (NPTEL, SWAYAM…)
Module
Link ID
No.
https://www.youtube.com/watch?v=pKeVMlkFpRc&list=PLwdnzlV3ogoXaceHrrFVZCJKbm
1 _laSHcH

https://www.youtube.com/watch?v=T3PsRW6wZSY&list=PLIg1dOXc_acbdJo-
2 AE5RXpIM_rvwrerwR

3 https://www.youtube.com/watch?v=QlhHqMnd9Wo

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

FUNDAMENTALS OF INDUSTRIAL CONTROL SYSTEM SECURITY

Course Code PECCT414 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. Enables the learners to understand the basic concepts of Industrial control system.

2. The course helps the students to identify the difference between OT and IT networks in
Industrial Systems.
3. Enables the students to describe the different cyber security controls and Access control
Mechanisms.
4. Enables the learners to summarize the operation, design and vulnerabilities of Industrial
Control System and understand various Networking and Industrial protocols.
SYLLABUS

Module Contact
Syllabus Description
No. Hours
Introduction to ICS(Industrial Control System)
System Overview: Industrial Control System Architecture-Distributed
Control Systems (DCS)-Programmable Logic Controller (PLC) - SCADA
1
overview.
9
Building Automation and Control System Overview, Safety Instrumented
Systems, Industrial Internet of Things
Purdue Model for Industrial Control Systems, Difference Between OT and
IT Networks in Industrial Systems , OT Versus IT

2 ICS Fundamentals: Operation, Design, and Vulnerabilities, Networking

and Industrial Protocols. 10
Case Study: Stuxnet
Cyber security Controls in Industry

3 Introduction to Cyber security Controls:

10
Definition and Importance, Types of Cyber security Controls (Preventive,
 Detective, Corrective)
Industry Standards and Frameworks (NIST, ISO/IEC 27001, CIS Controls)
Access Control Mechanisms
User Authentication (Passwords, Multi-Factor Authentication), User
Authorization (Role-Based Access Control, Attribute-Based Access Control)
Access Control Models (Discretionary, Mandatory, and Role-Based Access
Control)
Cyber Attacks and Problems, Anatomy of a Cyber Attack, Defense in Depth
Principle, Contemporary Control System Architectures, Asset management
in Cyber Security, Network segmentation, Network Discovery

4 Auditing and Assessing ICS: Methodology and Characterization, System 9

Assessment and Classification, Vulnerability Identification, Standards and
Best Practices for Industrial Security.
Applications and benefits of Industry Control 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)
Illustrate the basic concepts of Industrial Control systems and K2
CO1 differentiate between different types of Industrial Control Systems.

Identify the difference between OT and IT networks in Industrial K2

CO2 Systems and also describe Contemporary Control System Architecture.

Describe on the types of Cyber Security Controls and Access Control K2

CO3 Mechanisms.

Summarize the operation, design and vulnerabilities of Industrial K2

CO4 Control System and understand various Networking and Industrial
protocols.

Outline the System Assessment, Vulnerability Identification and best K3

CO5 practices for Industrial Safety and understand the applications of
Industrial Control 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
3 3 2 3
CO1
3 3 2 3
CO2
3 2 2 3
CO3
3 2 2 2 2 2 2 3
CO4
3 3 2 2 2 2 2 3
CO5
Note: 1: Slight (Low), 2: Moderate (Medium), 3: Substantial (High), -: No Correlation
 Text Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Thomson
Introduction to Programmable Delmar Cengage
1 Gary Dunning 2nd edition,
Logic Controllers Learning
2013
4th
SCADA Supervisory Control
2 Stuart A Boyer ISA Edition,
and Data Acquisition
2009

William Stallings 3rd

Computer Security : Principles
3 Pearson Edition,201
and Practice Lawrie Brown 4

Industrial Network Security

:Securing Critical Infrastructure Eric D Knapp 2nd Edition,
4 Networks for Smart Grid, Syngress
Joel Thomas Langill 2014
SCADA and other Industrial
Control Systems

Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Industrial Automation using 2nd Edition,
1 R.G.Jamkar Global Education Ltd
PLC , SCADA & DCS 2018

Industrial Automation and 1st Edition,

2 Jon Stenerson Prentice Hall
Process Control 2002

Effective Cyber security : A

Guide to Using Best Practices William Stallings Addison-Wesley 1st edition,
3 Professional 2018
and Standards

Control Systems Cyber Idaho National

David Kuipers Mark
Security: Defense in Depth Laboratory Idaho May 2006
4 Fabro
Strategies Falls, Idaho 83415
 Video Links (NPTEL, SWAYAM…)
Module
Link ID
No.
https://nptel.ac.in/courses/108105063
1
https://www.udemy.com/course/cyber-security-industrial-control-system-security

2 https://www.udemy.com/course/cyber-security-industrial-control-system-security

3 https://www.udemy.com/course/mastering-cybersecurity-and-supply-chain-risk-management

4 https://www.udemy.com/course/assessingprotectingics
 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 (L: T:P: R) 3:0:0:0 ESE Marks 60

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 11
Sketch, Applications to Networks - Click Stream Processing using Bloom
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, 11

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 12
Retroactivity; Search and Optimization Trees – Skip List, Tango Trees;
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 11
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 S3/S4

ECONOMICS FOR ENGINEERS

(Common to All Branches)

Course Code UCHUT346 CIE Marks 50

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

Credits 2 Exam Hours 2 Hrs. 30 Min.

Prerequisites (if any) None Course Type Theory

Course Objectives:

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

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Basic Economics Concepts - Basic economic problems – Production
Possibility Curve – Utility – Law of diminishing marginal utility – Law of
Demand - Law of supply – Elasticity - measurement of elasticity and its
1 6
applications – Equilibrium- Changes in demand and supply and its effects

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

Internal and External Economies – Cobb-Douglas Production Function

Cost concepts – Social cost, private cost – Explicit and implicit cost – Sunk
cost - Opportunity cost - short run cost curves - Revenue concepts

2 Firms and their objectives – Types of firms – Markets - Perfect Competition 6

– Monopoly - Monopolistic Competition - Oligopoly (features and
equilibrium of a firm)

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

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

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

National income – Concepts - Circular Flow – Methods of Estimation and

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

Course Assessment Method

(CIE: 50 marks, ESE: 50 marks)

Continuous Internal Evaluation Marks (CIE):

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

10 15 12.5 12.5 50
End Semester Examination Marks (ESE)

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

Part A Part B Total

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

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

Bloom’s
Course Outcome Knowledge
Level (KL)
Understand the fundamentals of various economic issues using laws 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.

None
Prerequisites (if any) Course Type Theory

Course Objectives:

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

Module Contact
Syllabus Description
No. Hours
Fundamentals of ethics - Personal vs. professional ethics, Civic Virtue,
Respect for others, Profession and Professionalism, Ingenuity, diligence
and responsibility, Integrity in design, development, and research domains,
Plagiarism, a balanced outlook on law - challenges - case studies,
Technology and digital revolution-Data, information, and knowledge,
Cybertrust and cybersecurity, Data collection & management, High
1 technologies: connecting people and places-accessibility and social 6
impacts, Managing conflict, Collective bargaining, Confidentiality, Role of
confidentiality in moral integrity, Codes of Ethics.
Basic concepts in Gender Studies - sex, gender, sexuality, gender
spectrum: beyond the binary, gender identity, gender expression, gender
stereotypes, Gender disparity and discrimination in education,
employment and everyday life, History of women in Science & Technology,
 Gendered technologies & innovations, Ethical values and practices in
connection with gender - equity, diversity & gender justice, Gender policy
and women/transgender empowerment initiatives.
Introduction to Environmental Ethics: Definition, importance and
historical development of environmental ethics, key philosophical theories
(anthropocentrism, biocentrism, ecocentrism). Sustainable Engineering
Principles: Definition and scope, triple bottom line (economic, social and
environmental sustainability), life cycle analysis and sustainability metrics.
2 Ecosystems and Biodiversity: Basics of ecosystems and their functions, 6
Importance of biodiversity and its conservation, Human impact on
ecosystems and biodiversity loss, An overview of various ecosystems in
Kerala/India, and its significance. Landscape and Urban Ecology:
Principles of landscape ecology, Urbanization and its environmental impact,
Sustainable urban planning and green infrastructure.
Hydrology and Water Management: Basics of hydrology and water cycle,
Water scarcity and pollution issues, Sustainable water management practices,
Environmental flow, disruptions and disasters. Zero Waste Concepts and
Practices: Definition of zero waste and its principles, Strategies for waste
reduction, reuse, reduce and recycling, Case studies of successful zero waste
initiatives. Circular Economy and Degrowth: Introduction to the circular
3 economy model, Differences between linear and circular economies, 6
degrowth principles, Strategies for implementing circular economy practices
and degrowth principles in engineering. Mobility and Sustainable
Transportation: Impacts of transportation on the environment and climate,
Basic tenets of a Sustainable Transportation design, Sustainable urban
mobility solutions, Integrated mobility systems, E-Mobility, Existing and
upcoming models of sustainable mobility solutions.
Renewable Energy and Sustainable Technologies: Overview of renewable
energy sources (solar, wind, hydro, biomass), Sustainable technologies in
energy production and consumption, Challenges and opportunities in
renewable energy adoption. Climate Change and Engineering Solutions:
Basics of climate change science, Impact of climate change on natural and
4 6
human systems, Kerala/India and the Climate crisis, Engineering solutions to
mitigate, adapt and build resilience to climate change. Environmental
Policies and Regulations: Overview of key environmental policies and
regulations (national and international), Role of engineers in policy
implementation and compliance, Ethical considerations in environmental
 policy-making. Case Studies and Future Directions: Analysis of real-
world case studies, Emerging trends and future directions in environmental
ethics and sustainability, Discussion on the role of engineers in promoting a
sustainable future.
Course Assessment Method
(CIE: 50 marks , ESE: 50)

Continuous Internal Evaluation Marks (CIE):

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

 The students should be grouped into groups of size 4 to 6 at the beginning of the semester.
These groups can be the same ones they have formed in the previous semester.
 Activities are to be distributed between 2 class hours and 3 Self-study hours.
 The portfolio and reflective journal should be carried forward and displayed during the 7th
Semester Seminar course as a part of the experience sharing regarding the skills developed
through various courses.

Sl. Item Particulars Group/I Marks

No. ndividua
l (G/I)

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

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

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

prepare a report

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

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

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

4 Final A comprehensive presentation summarising the key takeaways G 5

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

Total Marks 50

*Can be taken from the given sample activities/projects

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

Course Outcomes (COs)

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

Bloom’s
Course Outcome Knowledge
Level (KL)

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

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

CO-PO Mapping Table:

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

CO2 1 3 2 3 3 2 2

CO3 3 3 2 3 2 2

CO4 1 3 3 2 3 2 2

CO5 3 3 2 3 2 2
 Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
2nd edition
Ethics in Engineering Practice Cambridge University
1 Caroline Whitbeck & August
and Research Press & Assessment
2011

Cambridge University November

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

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

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

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

New age international

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

Tata McGraw Hill

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

Suggested Activities/Projects:

Module-II
● Write a reflection on a local environmental issue (e.g., plastic waste in Kerala
backwaters or oceans) from different ethical perspectives (anthropocentric, biocentric,
ecocentric).
● Write a life cycle analysis report of a common product used in Kerala (e.g., a coconut,
bamboo or rubber-based product) and present findings on its sustainability.
● Create a sustainability report for a local business, assessing its environmental, social, and
economic impacts
● Presentation on biodiversity in a nearby area (e.g., a local park, a wetland, mangroves,
college campus etc) and propose conservation strategies to protect it.
● Develop a conservation plan for an endangered species found in Kerala.
● Analyze the green spaces in a local urban area and propose a plan to enhance urban
ecology using native plants and sustainable design.
● Create a model of a sustainable urban landscape for a chosen locality in Kerala.
Module-III
● Study a local water body (e.g., a river or lake) for signs of pollution or natural flow disruption and
suggest sustainable management and restoration practices.
● Analyse the effectiveness of water management in the college campus and propose improvements -
calculate the water footprint, how to reduce the footprint, how to increase supply through rainwater
harvesting, and how to decrease the supply-demand ratio
● Implement a zero waste initiative on the college campus for one week and document the challenges
and outcomes.
● Develop a waste audit report for the campus. Suggest a plan for a zero-waste approach.
● Create a circular economy model for a common product used in Kerala (e.g., coconut oil, cloth etc).
● Design a product or service based on circular economy and degrowth principles and present a
business plan.
● Develop a plan to improve pedestrian and cycling infrastructure in a chosen locality in Kerala

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

OPERATING SYSTEMS LAB

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

Course Code PCCSL407 CIE Marks 50

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

Credits 2 Exam Hours 2 Hrs. 30 Min.

Prerequisites (if any) GYEST204 Course Type Lab

Course Objectives:

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

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

Expt.
Experiments
No.

1 Familiarisation with basic Linux programming commands: ps, strace, gdb, strings,
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
2 (c) Number of processes currently running.
(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
5
executable named “myadder”. Now write another program that creates a new process
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
6 “PCCSL407” and the parent process should print the string “Operating Systems Lab”.
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
7 to the first process. The first process compares the original string and the
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).

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

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

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

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

problem.

14
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)
● 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
15 random page-reference string to each algorithm, and record the number of page faults
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
16 generate a random series of 10 cylinder requests and service them according to each of the
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 Name of the Edition

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

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

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

3 Unix Network Programming - Volume 2:

Richard Stevens Prentice Hall 2/e, 1999
Interprocess Communications

Reference Books/Websites

Name of the Edition

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

1 The Design of the UNIX

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

2 The Little Book of Semaphores Allen B. Downey Green Tea Press 1/e, 2016

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.

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

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

Continuous Assessment (25 Marks)

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

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

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

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

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

3. Lab Reports and Record Keeping (6 Marks)

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

4. Viva Voce (5 Marks)

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

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

Evaluation Pattern for End Semester Examination (50 Marks)

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

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

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

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

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

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

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

4. Viva Voce (10 Marks)

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

5. Record (5 Marks)

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

 SEMESTER S4

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

Course Code PCCSL408 CIE Marks 50

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

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.
11 Design a database application using any front-end tool for any problem selected in
 experiment number 1. The application constructed should have five or more tables**.
12 Perform basic CRUD (Create, Read, Update, Delete) operations on a Cassandra table.

13 Write and execute CQL queries to retrieve specific data from Cassandra tables
14 Create a simple application using Mongodb with python
** The problem must be designed to convey the difference of NoSQL from SQL databases.

Course Assessment Method

(CIE: 50 marks, ESE: 50 marks)

Continuous Internal Evaluation Marks (CIE):

Preparation/Pre-Lab Work experiments,

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

5 25 20 50

End Semester Examination Marks (ESE):

Procedure/ Conduct of experiment/ Result with valid

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

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

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

Course Outcomes (COs)

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

Bloom’s
Course Outcome Knowledge
Level (KL)
Develop database schema for a given real world problem-domain using
CO1 K3
standard design and modeling approaches
Construct queries using SQL for database creation, interaction, modification,
CO2 K3
and updation.
Plan and implement triggers and cursors, procedures, functions, and control
CO3 K3
structures using PL/SQL
CO4 Perform CRUD operations in NoSQL Databases K3

CO5 Design database applications using front-end tools and back-end DBMS K5
 Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create

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

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

CO3 3 3 3 1 3 3

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

Text Books
Sl. Name of the Edition
Title of the Book Name of the Author/s
No Publisher and Year
1 Fundamentals of Database Systems Elmasri, Navathe Pearson 7/e, 2017
2 Professional NoSQL Shashank Tiwari Wiley 1/e, 2011

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

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
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
(CYBER SECURITY)
 SEMESTER S5

APPLIED CRYPTOGRAPHY

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

Course Objectives:

1. Understand the fundamental principles of cryptography and network security.

2. Learn and apply cryptographic techniques and protocols.
3. Analyse the security mechanisms of symmetric and asymmetric cryptography.
4. Explore advanced cryptographic applications and emerging trends.
5. Implement security solutions in cloud computing, quantum computing, and IoT.
SYLLABUS

Module Contact
Syllabus Description
No. Hours
Introduction to Cryptography and Security
Introduction to Cryptography: Definition and History of Cryptography -
Importance and Applications - Key Terminologies and Concepts - Types of
Attacks
Classical Encryption Techniques: Substitution Ciphers: Caesar Cipher,
Monoalphabetic Cipher, Playfair Cipher, Hill Cipher, Polybius Square

1 Transposition Ciphers: Rail Fence, Columnar Transposition 10

Steganography: Principles of Steganography, Types of Steganography,
Steganography Versus Digital Watermarking, Types of Digital Watermarking,
Goals of Digital Watermarking.
Quick Review of Number Theory: Prime Numbers, Modular Arithmetic,
Greatest Common Divisor, Fermat's and Euler's Theorems, Chinese
Remainder Theorem
 Cryptographic Concepts and Techniques
Symmetric Key Cryptography: Block Ciphers: DES, 3DES, AES (Block
Level only) - Stream Ciphers: RC4 - Modes of Operation: ECB, CBC, CFB,

2 OFB, CTR 10
Asymmetric Key Cryptography: Principles of Public Key Cryptosystems-
RSA Algorithm-Diffie-Hellman Key Exchange-Elliptic Curve Cryptography

Cryptographic Hash Functions: Hash Function Requirements and

Properties, SHA-256, SHA-3, MD5, HMAC
Message Authentication and Cryptographic Protocols
3 11
Message Authentication Codes: Structure and Usage, CMAC, GMAC,
Digital Signatures: RSA, DSA, ECDSA
Cryptographic Protocols: Key Management and Distribution, Public Key
Infrastructure (PKI), SSL/TLS Protocol
Secure Electronic Transactions: E-commerce Security Requirements,
Payment Protocols - SET, 3D Secure, Cryptographic Tokens
Advanced Cryptographic Applications and Emerging Trends
Advanced Cryptographic Techniques: Homomorphic Encryption, Zero-
4 11
Knowledge Proofs Quantum Cryptography: Basics and Algorithms;
Cryptography in Cloud Computing and IoT: Security Challenges and
Cryptographic Solutions in Cloud Computing, Challenges and Cryptographic
Solutions in 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  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)
Students will be able to understand the fundamental principles and K3
CO1 historical context of cryptography, including key terminologies and
classical encryption techniques.
Students will be able to implement and analyze symmetric and K3
CO2 asymmetric cryptographic algorithms, hash functions, and message
authentication codes.
Students will demonstrate the ability to apply cryptographic protocols to K2
CO3
secure communication, key management, and electronic transactions.
Students will be able to understand advanced cryptographic applications K2
CO4 and emerging trends, including security in cloud computing, IoT, and
quantum computing.
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create
 CO-PO Mapping Table (Mapping of Course Outcomes to Program Outcomes)

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

CO2 3 3 3 1

CO3 3 3 3 3 1 1

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

Text Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Cryptography and Network
8th Ed,
1 Security: Principles and William Stallings Pearson
2021
Practices
Introduction to Modern
Jonathan Katz and 2020 (3rd
2 Cryptography: Principles and CRC Press
Yehuda Lindell Edition)
Protocols

Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Applied Cryptography:
1 Protocols, Algorithms, and Bruce Schneier Wiley 2015
Source Code in C
Cryptography and Network William Easttom
2 Dreamtech Press 2017
Security: Black Book
Understanding Cryptography:
Christof Paar and Jan
3 A Textbook for Students and Springer 2009
Pelzl
Practitioners
Network Security Essentials:
4 William Stallings Pearson 2016
Applications and Standards
 Video Links (NPTEL, SWAYAM…)
Module
Link ID
No.
1 https://www.youtube.com/watch?v=iTVyKbDCJrA
2 https://www.youtube.com/watch?v=UxtR-CB69Rw
https://www.youtube.com/watch?v=FOk8TN7HQLo
3

4 https://www.youtube.com/watch?v=9XC4mY_3X2I
 SEMESTER S5

NETWORK AND SYSTEM SECURITY

Course Code PCCCT502 CIE Marks 40

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

Credits 4 Exam Hours 2 Hrs. 30 Min.

Prerequisites (if any) Course Type Theory

Course Objectives:

1. Enables the learners to understand network security domain, the techniques for network protection
2. This course helps to identify the attacks and defence in Data and wireless networks.
3. Enables the students to the basic functionalities and hardening of Windows and Linux operating
system.
4. This course helps to identify the attacks and security in internet and web service.
SYLLABUS

Module Contact
Syllabus Description
No. Hours
Module-1 (Principles of Network Security)

Principles of network security,Network Security Terminologies, CIA TRIAD

Components of Network Security- Network Firewall-types, rules, personal
1 10
firewalls,Intrusion Detection and Prevention System, Advanced Threat
Protection,Network access Control,Web filtering. Network Security Policies.
Network segments,Perimeter Defense, NAT, Penetration testing.

Module-2( Network Security)

Network Attacks, Services and Mechanisms, Network Security model,

2 Network security and their relation to Steganography , Security in Data 10
Networks,Wireless Device security issues- GPRS security, GSM security, IP
security. Wireless Transport Layer Security-Secure Socket Layer, Wireless
 Transport Layer Security - WAP Security,WAP security Architecture,WAP
Gateway.

Module-3(System Security)

Windows Security: Attacks against windows system,Installing

applications,Authentication and access control,Upgrades and Patches,
Operating Windows safely,.
3 9
Linux Security- Attacks in Linux system,Physical security, Controlling the
configuration, Authentication and access control,Upgrades and Patches,
Operating Linux safely.

Module-4 (Web Security)

Web Browser and Client risk- How a web browser works, Web browser
attacks, Operating safely, Web security- How HTTP works, Server and Client

4 contents, Attacking Web servers, Web Services.E-mail security- The e-mail 10

risk, Protocols, Authentication, Operating safely when using email, Domain
Name System – DNS basics, Purpose of DNS, Security Issues with DNS, DNS
attacks. - WAP Gateway.

Course Assessment Method

(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

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

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

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

Part A Part B Total

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

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

Bloom’s
Course Outcome Knowledge
Level (KL)
Explain network security domain, the techniques for network K1
protection and explore new tools and attacks in Network security
CO1
domain.

Identify the attacks and defence in wireless and data networks. K2

CO2

Explain the functionalities and hardening of windows and Linux K1

CO3 operating systems.

Explain the various attacks as well as security measures in Internet K2

CO4 and Web services.

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

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

CO2 2 3 2 2 3 2 2

CO3 2 2 2 2 3 3 2

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

Text Books
Name of the Edition and
Sl. No Title of the Book Name of the Author/s
Publisher Year
Eric Cole, Ronald
Wiley India Pvt Ltd,
Network Security Bible Krutz, James W.
1 2010 First
Conley, Edition,2010

Principles of Information Michael A Whitman,

Cengage Learning
2 Security Herbert J.Mattord 4th Edition,
2016

Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
4th
William Stallings Pearson Education Edition,
Network Security Essentials
1 2011

Fundamentals of Network Michael A Whitman,

Tata McGraw-Hill
security Herbert J.Mattord 1st Edition,
2
2011
 Video Links (NPTEL, SWAYAM…)
Module
Link ID
No.
https://nptel.ac.in/courses/106106129
1
https://onlinecourses.swayam2.ac.in/nou24_cs13/preview
https://onlinecourses.nptel.ac.in/noc24_cs80/preview
2
https://nptel.ac.in/courses/106106129
https://nptel.ac.in/courses/106106129
3
https://www.udemy.com/course/web-security-and-bug-bounty-learn-penetration-testing/
4 https://nptel.ac.in/courses/106106129
 SEMESTER S5

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

Course Code PCCST503 CIE Marks 40

Teaching Hours/Week
3:0:0:0 ESE Marks 60
(L: T:P: R)
Credits 3 Exam Hours 2 Hrs. 30 Min.

Prerequisites (if any) None Course Type Theory

Course Objectives:

1. To impart the fundamentals principles of machine learning in computer and science.

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

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Introduction to ML :-

Machine Learning vs. Traditional Programming, Machine learning paradigms

- supervised, semi-supervised, unsupervised, reinforcement learning.

Parameter Estimation - Maximum likelihood estimation (MLE) and

maximum aposteriori estimation (MAP), Bayesian formulation.

1 Supervised Learning :- 9

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

Generalisation and Overfitting - Idea of overfitting, LASSO and RIDGE

regularization, Idea of Training, Testing, Validation

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

2 9
Measure, Receiver Operating Characteristic Curve(ROC), Area Under Curve
(AUC).

Regression - Mean Absolute Error (MAE), Root Mean Squared Error

(RMSE), R Squared/Coefficient of Determination.

SVM – Linear SVM, Idea of Hyperplane, Maximum Margin Hyperplane,

Non-linear SVM, Kernels for learning non-linear functions

3 Neural Networks (NN) - Perceptron, Neural Network - Multilayer feed- 9

forward network, Activation functions (Sigmoid, ReLU, Tanh), Back
propagation algorithm.

Unsupervised Learning

Clustering - Similarity measures, Hierarchical Clustering - Agglomerative

Clustering, partitional clustering, K-means clustering

4 9
Dimensionality reduction - Principal Component Analysis, Multidimensional
scaling

Ensemble methods - bagging, boosting; Resampling methods -

Bootstrapping, Cross Validation. Practical aspects - Bias-Variance tradeoff.
 Course Assessment Method
(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

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

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

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

Part A Part B Total

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

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

Bloom’s
Course Outcome Knowledge
Level (KL)
Illustrate Machine Learning concepts and basic parameter estimation
CO1 methods. K2

Demonstrate supervised learning concepts (regression, classification).

CO2 K3
Illustrate the concepts of Multilayer neural network and Decision trees
CO3 K3
Describe unsupervised learning concepts and dimensionality reduction
CO4 techniques K3

Use appropriate performance measures to evaluate machine learning

CO5 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 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 Wagner Meira Press 1/e, 2016
Algorithms
Neural Networks for Pattern Oxford University
3 Christopher Bishop Press 1/e, 1998
Recognition

Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
1 Applied Machine Learning M Gopal McGraw Hill 2/e, 2018
Machine Learning
Manaranjan Pradhan | U
2 Wiley 1/e, 2019
using Python Dinesh Kumar

Machine Learning: Theory and M.N. Murty, V.S.

3 Universities Press 1/e, 2024
Practice Ananthanarayana
 Video Links (NPTEL, SWAYAM…)
No. Link ID
1 https://archive.nptel.ac.in/courses/106/105/106105152/
2 https://archive.nptel.ac.in/courses/106/106/106106139/

3 https://nptel.ac.in/courses/106106202\
 SEMESTER S5

MICROCONTROLLERS
(Common to CS/CC)

Course Code PBCST504 CIE Marks 60

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

Course Objectives:

1. To introduce the ARM architecture and ARM-based microcontroller architecture.

2. To impart knowledge on the hardware and software components to develop embedded systems
using STM32 microcontrollers.
SYLLABUS

Module Contact
Syllabus Description
No. Hours
Introduction to ARM Cortex-M Architecture:-

Overview of Embedded Systems, Applications of Embedded Systems,

Introduction to Embedded C, Microcontrollers vs. Microprocessors,
1 Classification of processors, Overview of ARM Cortex-M Series, Introduction 8
to the Cortex-M23 and Cortex-M33 processors and the Armv8-mArchitecture,
ARM Core Features: Registers, Memory, and Bus Architecture, Comparison
with previous generations of Cortex-M processors.

STM32 Microcontroller Overview and Peripheral Programming:-

Introduction to STM32 Family, STM32U575 Features and Specifications,

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

Communication Protocols and USB:-

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

CAN), Interfacing an I2C Temperature Sensor and Displaying Data on an
3 LCD, writing to and Reading from an SPI-based EEPROM, Configuring and 10
Implementing CAN Communication between Multiple STM32U575
Microcontrollers, Creating a USB HID Device for Keyboard / Mouse
Emulation

IoT, Wireless Communication, and RTOS:-

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

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

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

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

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

Course Assessment Method

(CIE: 60 marks, ESE: 40 marks)

Continuous Internal Evaluation Marks (CIE):

Attendance Project Internal Ex-1 Internal Ex-2 Total

5 30 12.5 12.5 60

End Semester Examination Marks (ESE)

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

Part A Part B Total

● 2 Questions from each  2 questions will be given from each module, out
module. 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 architectural features and instructions of the ARM K2

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

Use various communication protocols of interaction with peer devices K3

CO3 and peripherals.

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

CO4 system applications.

Apply hardware security features of ARM in real world applications. K3

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

CO-PO Mapping Table:

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

CO2 3 3 3 3

CO3 3 3 3 3 3 3

CO4 3 3 3 3 3 3

CO5 3 3 3 3 3

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

2 Mastering STM32 Carmine Noviello Learnpub 2/e, 2022

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

Embedded System Design with Cem Ünsalan, Hüseyin

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

Introduction to ARM ®
3 Jonathan W. Valvano Self-Published 5/e, 2014
Cortex-M Microcontrollers

Video Links (NPTEL, SWAYAM…)

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

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

PBL Course Elements

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

(3 Hrs.) Tutorial Practical Presentation

Simulation/
Presentation
Lecture 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 S5
NETWORK FUNDAMENTALS FOR CLOUD

CIE
Course Code 40
PECCT521 Marks
Teaching 3:0:0:0 ESE
Hours/Week 60
Marks
(L: T:P: R)
3 Exam
Credits 2 Hrs. 30 Min.
Hours
Basic knowledge of networking
concepts and familiarity with Course
Prerequisites (if any) Theory
Type
operating systems

Course Objectives:

1. To understand core networking concepts, such as IP addressing, subnetting, and routing.

2. To implement cloud networking solutions, including designing and configuring virtual networks
and security settings.
3. To troubleshoot network issues within cloud environments.
4. To integrate cloud and on-premises networks, managing hybrid systems effectively
SYLLABUS

Module Contact
Syllabus Description
No. Hours
Introduction to Networking Concepts and Cloud Computing:- Basics of
Computer Networks: Overview of Network Types: LAN, WAN, Pan, OSI
and TCP/IP Models.IP Addressing and Subnetting: IPv4 vs. IPv6 Addressing,
SubnettingConcepts and Techniques.
1 9
Introduction to Cloud Computing: Cloud Computing Models: IaaS, PaaS,
SaaS. Cloud Architecture Overview.
Networking in Cloud Environments: Importance of Networking in Cloud,
Interaction Between Traditional Networks and Cloud Infrastructures.
Networking Protocols and Cloud Connectivity :-

2 TCP/IP Protocol Suite: Deep Dive into TCP/IP Protocols, Role of TCP/IP 9
in Cloud Environments.
 DNS and DHCP in the Cloud, DNS Configuration in Cloud, DHCP in Cloud
Networks.
Virtual Private Networks (VPN): VPN Implementation in Cloud, Securing
VPNs for Cloud Connectivity.
Load Balancing in Cloud: Load Balancer Types and Configurations,
Implementing Load Balancers in Cloud.
Virtual Private Cloud (VPC), VPC Configuration and Management, VPC
Peering and Gateways.
Hybrid Cloud Connectivity, Integrating Public and Private Clouds,
Challenges and Solutions in Hybrid Cloud Connectivity.
Cloud Networking Components, Architectures, and Security:
Virtual Networking and SDN: Virtual Networks(VNet) Configuration,
Principles of SDN and Implementation in Cloud, Network Function.
Virtualization (NFV) and Microservices: NFV Components and Architecture,
Networking for Containers (Docker, Kubernetes).

3 Cloud Network Design Principles: Designing for Scalability and Flexibility, 9

Redundancy and Disaster Recovery Planning.
Security in Cloud Networks: Cloud-Native Security Controls, Intrusion
Detection and Prevention Systems (IDPS), Identity and Access Management
(IAM), Encryption Techniques and Zero-Trust
Architecture.
Monitoring, Troubleshooting, and Optimizing Cloud Networks :-
Network Monitoring in Cloud: Tools for Cloud Network Monitoring, Setting
Up Alerts and Dashboards.
Troubleshooting Cloud Networks: Common Cloud Networking Issues and
Solutions, Using Diagnostic Tools (e.g., Traceroute, Ping).
4 9
Network Traffic Analysis and Optimization: Analyzing Traffic Patterns in
Cloud Networks, Performance Tuning and Cost- Effective Network
Configuration.
Automation in Cloud Network Management: Automating Network
Configuration and Management, Using Infrastructure as Code (IaC) 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 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 Fundamental Networking Concepts and Cloud
CO1 K2
Computing Basics.
CO2 Explain IP Addressing and Subnetting Techniques. K2
Apply Networking Protocols and Cloud Connectivity
CO3 K3
Solutions.
CO4 Illustrate Cloud Networking Components and SecurityMeasures K2

CO5 Troubleshooting and Optimization Techniques in CloudNetworks. 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 3 2 2

CO3 3 2 2

CO4 3 2 2

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

Text Books
Name of the Edition and
Sl. No Title of the Book Name of the Author/s
Publisher Year
Computer Networking: A Top- James F. Kurose and
Down Approach Keith W. Ross Pearson Eight
1 Publications Edition,
2017.
Cloud Computing: Concepts, Thomas Erl, Ricardo Prentice Hall
2 Technology & Architecture Puttini, and Zaigham Publications First
Mahmood edition,
2013.

Reference Books
Edition
Sl. No Title of the Book Name of the Author/s Name of the Publisher
and Year
Cloud Networking: Gary Lee and Lee
Understanding Cloud- based Hwee Kuan CRC Press First
1 Data Center Networks edition,
2017.
Network Security Essentials:
Applications and Standards William Stallings Pearson Sixth
2 Publications edition,
2020.
Brad Bulger, Ather
AWS Certified Advanced Khan, and Stephen Wiley First
3 Networking Official Study Cole Publications edition,
Guide: Specialty Exam 2020.
 Video Links (NPTEL, SWAYAM…)
Module
Link ID
No.
1 https://youtu.be/fErDcUtd8fA?si=vk5rYduwokgAqUMh
2 https://youtu.be/3NDhETVfrp0?si=MyOfYaRDJRJ0gn9F
3 https://youtu.be/RWgW-CgdIk0?si=HN9mHIo4w9-J4IaJ

4 https://youtu.be/YmYWevNdcik?si=8dO1vCGjO1yPQ8XE
 SEMESTER S5

BLOCKCHAIN AND CRYPTOCURRENCY

Course Code PECCT522 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 undertake path-breaking research that creates new computing technologies and solutions for
industry and society at large.
2. To create cryptocurrencies and give a strong technical understanding of Blockchain technologies
with an in-depth understanding of applications, open research challenges, and future directions .

SYLLABUS

Module Contact
Syllabus Description
No. Hours
INTRODUCTION TO BLOCKCHAIN
Block chain- Public Ledgers, Blockchain as Public Ledgers – Block in a

1 Blockchain, Transactions-The Chain and the Longest Chain – Permissioned 9

Model of Blockchain, Cryptographic -Hash Function, Properties of a hash
function-Hash pointer and Merkle tree
BITCOIN AND CRYPTOCURRENCY
A basic crypto currency, Creation of coins, Payments and double spending,

2 FORTH – the precursor for Bitcoin scripting, Bitcoin Scripts , Bitcoin P2P 9
Network, Transaction in Bitcoin Network, Block Mining, Block propagation
and block relay
BITCOIN CONSENSUS

3 Bitcoin Consensus, Proof of Work (PoW)- Hashcash PoW , Bitcoin 9

PoW, Attacks on PoW ,monopoly problem- Proof of Stake- Proof of Burn -
 Proof of Elapsed Time – Bitcoin Miner, Mining Difficulty, Mining Pool-
Permissioned model and use cases.
HYPERLEDGER FABRIC & ETHEREUM
Architecture of Hyperledger fabric v1.1- chain code- Ethereum: Ethereum
network, EVM, Transaction fee, Mist Browser, Ether, Gas, Solidity.
4 9
BLOCKCHAINAPPLICATIONS.
Blockchain Applications in Supply Chain Management, Logistics, Smart
Cities, Finance and Banking, Insurance, etc- 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 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 emerging abstract models for Blockchain Technology
CO1 K2

Identify major research challenges and technical gaps existing between

CO2 theory and practice in the crypto currency domain. K4

It provides conceptual understanding of the function of Blockchain as a

CO3 method of securing distributed ledgers, how consensus on their K2
contents is achieved, and the new applications that they enable.
Apply hyperledger Fabric and Ethereum platform to implement the
CO4 K3
Block chain Application
CO5 Understand the applications of blockchain in various fields. K2
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create

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

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

CO2 2 3 2 2

CO3 3 2 2 2

CO4 2 3 2 2

CO5 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
Mastering Blockchain: Inner
workings of blockchain, from
1 cryptography and decentralized Bashir and Imran Kindle Edition 2023
identities, to DeFi, NFTs and
Web3, 4th Edition
“Mastering Bitcoin: Unlocking Andreas Antonopoulos
2 O’Reilly 2023
Digital Cryptocurrencies”, Drescher
Elsevier Inc. ISBN:
Handbook of Research on
3 978012819816 2020.
Blockchain Technology

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
1 https://youtu.be/fu8SFiO948A?feature=shared
2 https://www.youtube.com/live/hixM4u7ep58?feature=shared
3 https://youtu.be/fw3WkySh_Ho?feature=shared
4 https://youtu.be/sro__4PhmKg?feature=shared
 SEMESTER S5

AI IN CYBER SECURITY

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

PECCT413
Prerequisites (if any) Course Type Theory
Introduction to AI and
ML

Course Objectives:

1. Understand the application of AI in various aspects of Cyber Security.

2. Identify and describe Machine Learning techniques used in threat detection.
3. Utilize AI-based tools for cybersecurity tasks.
4. Apply AI-driven data analysis to identify and mitigate cyber threats.
SYLLABUS

Module Contact
Syllabus Description
No. Hours
AI in Cyber Security
Role of AI in Cyber Security: Introduction to the role of AI in cybersecurity:
how AI is transforming cyber defences, Discussion on the current state of
cyber threats and how AI can mitigate them
Review of Basic Cyber Threats: Overview of basic cyber threats: malware,
phishing, DDoS attacks, etc.

1 Introduction to AI Tools in Cyber Security: Overview of commonly used AI 9

tools (e.g., antivirus software, intrusion detection systems)
Case Studies: AI Applications in Cyber Security
Case Study 1: How AI stopped a major phishing campaign (e.g., Google’s
Safe Browsing)
Case Study 2: Using AI to detect anomalies in network traffic (e.g.,
DARPA’s Cyber Grand Challenge)
 Machine Learning in Threat Detection
Application of Supervised Learning in Threat Detection: Introduction to
supervised learning: concepts and algorithms, Practical examples of
supervised learning in detecting malware

2 Introduction to Unsupervised Learning Techniques for Anomaly 9

Detection: Overview of unsupervised learning: clustering, anomaly
detection
Case Study: Unsupervised learning in detecting insider threats (e.g., detecting
insider trading in financial institutions)
AI-Based Tools and Techniques in Cyber Security
Overview of AI-Powered Cybersecurity Tools: Introduction to advanced
AI-powered tools: firewalls, intrusion detection systems, Discussion on how
AI enhances traditional cybersecurity tools, AI-based firewalls and their real-

3 world applications 9
Introduction to AI-Driven Data Analysis Techniques: Basic concepts of
AI-driven data analysis in cybersecurity
Case Study: How AI-driven data analysis thwarted a cyber-attack (e.g.,
IBM’s Watson in Cybersecurity)
Ethical Considerations and Challenges in AI for Cyber Security
Ethical Implications of AI in Cyber Security: Ethical issues surrounding AI
in cybersecurity (privacy, bias, etc.)
Challenges in Implementing AI for Cyber Security: Technical challenges
in AI-based cybersecurity (data quality, model robustness), Future Trends and
4 9
Ethical Balances in AI and Cyber Security, Emerging trends in AI for
cybersecurity
Case Study: Privacy concerns with AI-driven surveillance (e.g., AI in facial
recognition by law enforcement)
 Course Assessment Method
(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

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

5 15 10 10 40

End Semester Examination Marks (ESE)

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

Part A Part B Total

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

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

Bloom’s
Course Outcome Knowledge
Level (KL)
CO1 To describe the role of AI in modern cybersecurity. K2
CO2 To explain the application of supervised learning in threat detection. K2
To analyze real-world applications of AI in virus detection and intrusion
CO3 K3
prevention.
To explain the ethical implications of AI in cybersecurity, including
CO4 K2
privacy and bias issues.
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create
 CO-PO Mapping Table (Mapping of Course Outcomes to Program Outcomes)

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

CO2 3 1 1 1

CO3 3 2 2 1 1 1

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

Text Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Himanshu Upadhyay,
Artificial Intelligence in Cyber Steven Lawrence
1 Springer International
Security: Theories and Fernandes, Tarun 2023
Publishing
Applications Kumar Sharma, Tushar
Bhardwaj
ARTIFICIAL Rahul Neware Khaja
2 INTELLIGENCE IN CYBER Mannanuddin, Mukesh
Book Rivers 2022
SECURITY Madanan, Dr. Shikha
Gupta

Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Artificial Intelligence in Springer International
1 Leslie F. Sikos 2018
Cybersecurity Publishing
Artificial Intelligence for
Springer International
2 Cybersecurity: Techniques, Mark Stamp 2022
Publishing
Challenges and Research
Machine Learning and
Clarence Chio, David
3 Security: Protecting Systems O'Reilly Media 2018
Freeman
with Data and Algorithms
 Video Links (NPTEL, SWAYAM…)
Module
Link ID
No.
1 Cyber Security and Privacy by Prof. Saji K Mathew (NPTEL)
Applied Accelerated Artificial Intelligence
2 By Prof. Satyajit Das, Prof. Satyadhyan Chickerur, Prof. Bharatkumar Sharma, Prof. Adesuyi
Tosin, Prof.Ashrut Ambastha
Applied Accelerated Artificial Intelligence
3 By Prof. Satyajit Das, Prof. Satyadhyan Chickerur, Prof. Bharatkumar Sharma, Prof. Adesuyi
Tosin, Prof.Ashrut Ambastha
Applied Accelerated Artificial Intelligence
4 By Prof. Satyajit Das, Prof. Satyadhyan Chickerur, Prof. Bharatkumar Sharma, Prof. Adesuyi
Tosin, Prof.Ashrut Ambastha
 SEMESTER S5

ADVANCED INDUSTRIAL CYBER SECURITY

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

PECCT414
FUNDAMENTALS OF
Prerequisites (if any) INDUSTRIAL
Course Type Theory
CONTROL SYSTEM
SECURITY

Course Objectives:

1. Enables the learners to understand the advanced concepts of Network Security and Endpoint
Security.
2. Enables the learners to apply the best practices in each phase of SDLC and gain an insight on data
classification and data loss prevention.
3. Enables learners to manage the full life cycle of digital entities, gain skills in deploying SIEM
systems and apply threat intelligence to improve organizational security.
4. Enables the learners to understand the Compliance and regulatory controls and gain knowledge
on emerging technologies related to industrial cyber security.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Network Security Controls : Firewalls - Types of Firewalls, Configuration
of Firewalls,
Intrusion Detection and Prevention Systems (IDPS), Virtual Private
1 9
Networks (VPNs),
Network Segmentation.
 Endpoint Security : Antivirus and Antimalware, Endpoint Detection and
Response (EDR),
Patch Management, Device Encryption.

Application Security Controls: Secure Software Development Lifecycle

(SDLC), Code Review
And Static Analysis, Web Application Firewalls (WAF), Database Security.

2 Data Protection Controls: Data Classification and Handling, Data Loss 9

Prevention (DLP),
Encryption (At Rest, In Transit),Backup and Recovery.

Identity and Access Management (IAM) : Identity Lifecycle

Management, Single Sign-On (SSO),Federation and Trust Models,
Privileged Access Management (PAM).

3 9
Security Monitoring and Incident Response: Security Information and
Event Management (SIEM),Threat Intelligence, Incident Response
Planning,Forensics and Post-Incident Analysis

Compliance and Regulatory Controls: General Data Protection Regulation

(GDPR), Health Insurance Portability and Accountability Act (HIPAA),
Sarbanes-Oxley Act (SOX), Payment Card Industry Data Security Standard
(PCI DSS). Emerging Trends and Technologies: Zero Trust Architecture,
4 10
Artificial Intelligence in Cyber Security, Block chain for Security, Quantum
Computing Implications.

Case Study: Analysis of Real-World Cyber security Incidents

 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)
Able to configure firewall rules and policies and identify different types K2
CO1
of malware.
Integrate security practices into each phase of SDLC and apply the K3
CO2
principles of encryption for data protection
Design and implement Identity management processes and understand K3
CO3
the role of SIEM systems in analysing security events.
Integrate Threat Intelligence into security operations and conduct post- K3
CO4
incident analysis to determine the root cause of security incidents.
Understand the compliance and regulatory controls and gain knowledge K2
CO5
on emerging technologies related to industrial cyber security.
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 1 1 1 1 1
CO2 3 2 2 2 1 1 1 1 1
CO3 3 2 2 2 1 1 1 1 1

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

Text Books
Name of the Edition and
Sl. No Title of the Book Name of the Author/s
Publisher Year
Network Security Essentials: Pearson 6th
1 William Stallings
Applications and Standards. Edition,2016
Network Intrusion Detection
Ali A Ghorbani, Wei Springer-Verlag 1st Edition,
2 and Prevention: Concepts and
Lu, Mahabod Tavallaee NewYork Inc. 2010
Practices
Malware Analyst’s Cookbook
Michael Ligh,
and DVD: Tools and 1st
3 Steven Adair, Wiley
Techniques for fighting Edition,2010
Blake Heartstein
malicious code
Software Security: Building 1st
4 Gary Mcgraw Addison-Wesley
Security In Edition,2006
Identity and Access
Management :Business 1st
5 Ertem Osmanoglu Syngress
Performance through Edition,2013
Connected Intelligence
Zero Trust Networks: Building Evan Gilman,
1st Edition
6 Secure systems in Untrusted Doug Barth O’Reilly
2017
Networks
 Reference Books
Name of the Edition and
Sl. No Title of the Book Name of the Author/s
Publisher Year
Web Application Security:
Exploitation and Orielly and 2nd
1 Andrew Hoffman
Countermeasures for Modern Associates Inc. Edition,2020
Web Applications
David Miller, Shon
Harris,
Security Information and Event Allen Harper, McGraw Hill 2nd
2
Management Implementation Stephen Wandyke, Education Edition,2010
Chris Blask

Block chain Basics : A Non-

1st edition,
3 Technical Introduction in 25 Daniel Drescher Apress
2017
steps

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
1 http://www.digimat.in/nptel/courses/video/106105031/L40.html

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

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

4 https://onlinecourses.nptel.ac.in/noc24_cs121/preview
http://www.digimat.in/nptel/courses/video/106104220/L01.html
 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 Scheduling -
1 8
Project Scheduling, Introduction to PERT and CPM, Critical 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 Components,
4 11
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/ 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)

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 and
Sl. No Title of the Book
Author/s Publisher Year
Succeeding with Agile: Software
1 Mike Cohn Addison-Wesley 1/e, 2009
Development Using Scrum

Reference Books
Name of the Edition and
Sl. No Title of the Book Name of the Publisher
Author/s Year
1 Agile Product Management with 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

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

Course Code PECST525 CIE Marks 40

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

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 10

Data warehouse - Differences between Operational Database Systems and Data

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

Data Preprocessing :-
2 Data Preprocessing - Need of data preprocessing, Data Cleaning- Missing values, 11

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 11
back propagation, Evaluation measures - accuracy, precision, recall, F1 score

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 12

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,

module. out of which 1 question should be answered.
 Total of 8 Questions,  Each question can have a maximum of 3
each carrying 3 marks subdivisions. 60
 Each question carries 9 marks.

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

Course Outcomes (COs)

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

Bloom’s
Course Outcome Knowledge
Level (KL)

Understand the key process of data mining and data K2

CO1
warehousing concepts in application domains.

Apply appropriate pre-processing techniques to convert raw data into K3

CO2
suitable format for practical data mining tasks

Illustrate the use of classification and clustering algorithms in various K3

CO3
application domains

CO4 Comprehend the use of association rule mining techniques K3

Explain advanced data mining concepts and their applications in K2

CO5
emerging domains

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

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

CO1 2 2 2

CO2 3 3 3 3 2 2

CO3 3 3 3 3 2 2

CO4 3 3 3 3 2 2

CO5 2 2 2

Text Books

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

2 Data Mining: Introductory 1/e, 2006

Dunham M H Pearson Education
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

2 Data Mining: Concepts, Models,

Mehmed Kantardzic Wiley 2/e, 2019
Methods, and Algorithms
 Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.

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

CRYPTOGRAPHY LAB

Course Code PCCCL507 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. Develop Practical Skills in Cryptographic Techniques: To equip students with hands-on experience
in implementing and analyzing various cryptographic algorithms, including classical ciphers,
symmetric encryption, and asymmetric encryption techniques.
2. Enhance Understanding of Cryptographic Principles and Applications: To enable students to
demonstrate and apply fundamental cryptographic principles in real-world scenarios, ensuring data
integrity, confidentiality, and authentication through practical coding exercises.
3. Foster Proficiency in Secure Communication and Memory Management: To cultivate students'
ability to design and implement secure communication protocols and to simulate memory
allocation and garbage collection using linked lists, integrating cryptographic methods with
effective memory management techniques.

Expt.
Experiments
No.
Represent a string (char pointer) with a value “Hello world”. The program should XOR
1 each character in this string with 0 and displays the result.*

Represent string (char pointer) with a value “Hello world” The program should AND, OR,
2
and XOR each character in this string with 127 and display the result.
Perform encryption and decryption using the following algorithms*
3
a. Ceaser cipher b. Substitution cipher c. Hill Cipher
4 Implementation of Encryption and Decryption using DES*
5 Implementation of RSA Encryption Algorithm
 6 Implementation of Hash Functions*
7 Implementation of Blowfish algorithm logic*
8 Implement the Diffie-Hellman Key Exchange mechanism
9 Implement RC4 logic using Java*
10 Encrypt the text “Hello world” using Blowfish.
11 Implement the SIGNATURE SCHEME –Digital Signature Standard*
12 Implement LSB Steganography.

PRACTICE QUESTIONS

1. Write a C program that contains a string (char pointer) with a value”Helloworld”. The program
should XOR each character in this string with 0 and displays the result.
2. Write a C program that contains a string (char pointer) with a value “Hello world‟. The program
should AND, OR, and XOR each character in this string with 127 and display the result.
3. Write a Java program to perform encryption and decryption using the following algorithms
a. Caeser cipher
b. Substitution cipher
c. Hill Cipher
4. Write a C/JAVA program to implement DES Encryption and Decryption
5. Write a C/JAVA program to implement RSA Encryption Algorithm
6. Write a C/JAVA program to implementation of Hash Functions.
7. Write a C/JAVA program to implement the Blowfish algorithm logic.
8. Write the RC4 logic in Java Using Java cryptography; encrypt the text Hello world using
Blowfish. Create your own key using Java key tool.
9. Write a C/JAVA program to implement the Diffie-Hellman Key Exchange mechanism
10. Implement the SIGNATURE SCHEME –Digital Signature Standard
11. Embed a short text message (up to 8 characters) into the least significant bits of the image's pixel
data. Read the modified image and extract the hidden message.

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)
Students will implement various classical and modern cipher techniques to K3
CO1
understand the process of securing information.
Students will code and distinguish between symmetric and asymmetric K3
CO2
cryptographic methods, gaining practical knowledge of both types.
Students will explore and implement different encryption techniques and K3
CO3
message authentication codes (MACs) to ensure data integrity and security.
Students will write programs to implement the DES (Data Encryption K3
CO4 Standard) and RSA (Rivest-Shamir-Adleman) algorithms, understanding
their mechanisms and uses.
Students will create a program using linked lists to simulate memory K3
CO5 allocation and garbage collection, applying data structure concepts to
memory management.
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 2 1 1 1 1

CO2 3 3 3 2 1 1 1 1

CO3 3 3 3 2 1 1 1 1

CO4 3 3 3 2 1 1 1 1

CO5 3 3 3 2 1 1 1
1: Slight (Low), 2: Moderate (Medium), 3: Substantial (High), -: No Correlation
 Text Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Applied Cryptography:
1 Protocols, Algorithms and Bruce Schneier Wiley 2015
Source Code in C

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
1 https://cse29-iiith.vlabs.ac.in/ (AICTE Virtual Labs)

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

NETWORK AND SYSTEM SECURITY LAB

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

None /
Prerequisites (if any) Course Type Lab
Course Code

Course Objectives:

1. Familiarize tools to prevent latest threats

2. Analyze the network traffic using sniffing tools.
3. Use network scanning tools
4. Familiarize various Steganography tools
5. Use tools for Penetration testing

Expt.
Experiments
No.

1
Preventing PC against latest threats using Windows Defender.

2 Data hiding using Xiao Steganography

3 Website mirroring using HTTrack

4 Monitor, capture and analyze network packets using Wireshark.

5 Network mapping and analysing. Using Nmap

6 Port Scanning using Angry IP Scanner or Advanced IP Scanner.

7 Penetration testing and Vulnerability Scanning using Burp Suit.

8 Password Cracking-Use John The ripper /hydra

PRACTICE QUESTIONS

1. You need to protect a Windows computer from malware and viruses without installing any third-party
software. Which built-in tool can you use to scan and remove malicious threats?
2. A user reports that their computer is behaving strangely, and you suspect malware. Which default
Windows tool would you use to perform a quick or full system scan to identify and eliminate the
threat?
3. You need to troubleshoot network latency issues by examining the timing of packet transmissions.
Which tool will help you capture and analyze the packet flow to identify the cause of the delay?
4. To verify the integrity of communication between two endpoints on your network, you want to
capture and analyze the packets being exchanged. Which tool would be best suited for this task?
5. You need to scan a network to discover active devices and identify open ports on each device. Which
tool can you use to perform this network discovery and security auditing?
6. You need to create an offline copy of a website for analysis and reference. Which tool can you use to
download the entire site, including HTML, images, and other files?
7. You want to back up a website's content and structure to ensure you have a local copy in case the site
becomes unavailable. Which tool should you use to accomplish this task efficiently?
8. You need to hide sensitive data within an image file to ensure it remains undetected by unauthorized
users. Which tool would you use to embed and later extract this hidden information?
9. During a network inventory process, you want to quickly discover and document all the IP addresses
currently in use. Which tool would help you perform this task efficiently?
10. To test the security of a web application, you need to perform automated vulnerability scanning and
manual testing for common web application flaws. Which tool provides integrated features for both
types of testing?
 Course Assessment Method

(CIE: 50 marks, ESE: 50 marks)

Continuous Internal Evaluation Marks (CIE):

Preparation/Pre-Lab Work experiments,

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

5 25 20 50

End Semester Examination Marks (ESE):

Procedure/ Conduct of experiment/ Result with valid

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

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

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

Course Outcomes (COs)

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

Bloom’s
Course Outcome Knowledge
Level (KL)
CO1 Familiarize tools to prevent latest threats K3
CO2 Analyze the network traffic using sniffing tools K3

CO3 Use network scanning tools K3

CO4 Familiarize various Steganography tools K3

CO5 Use tools for Penetration testing K3

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

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

CO2 2 2 2 2 3 2 2

CO3 2 2 3 2 3 2 2

CO4 2 2 3 2 3 2 2

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

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
(CYBER SECURITY)
 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.

1 Scanners - Recognizing Words, Regular Expressions, From Regular 6

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

Intermediate Representations: An IR Taxonomy, Graphical IRs -

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
Calls
Code Optimization - Introduction, Opportunities for Optimization,
4 14
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 Techniques and Tools and D. Ullman. Addison Wesley, 2/e, 2010.

Compiler Construction - 1/e, 2007

Kenneth C Louden Thomson Learning
2 Principles and Practice

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

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

Video Links (NPTEL, SWAYAM…)

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

CYBER FORENSICS

Course Code PCCCT602 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 about Computer Forensics and the procedures for investigations and incident
response.
2. To study about data acquisition and to have an understanding of different forensic acquisition
tools.
3. To explore the various cyber threats, attacks and the different anti forensic techniques.
4. To study the theory behind Network Forensics, Mobile Forensics and various types of Forensics.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Cyber Forensics and Investigations: Introduction- Computer Forensic
Investigations - Forensics Investigation Process -Preparing for computer
investigations, understanding Public and private investigations. Data
Acquisition - storage formats for digital evidence, determining the best
1
acquisition method -Forensic Protocol for Evidence Acquisition - Digital
9
Forensics Standards and Guidelines – Incident Response stages -Digital
Evidence – identification, collection, processing, seizing documenting and
storing - contingency planning for image acquisitions.

Cyber Forensics Tools and Types of Forensics:

2 Cyber Forensics Tools-Computer Forensics software and hardware tools -

9
Open Source and Proprietary -Challenges in Cyber Forensics, Skills
 Required to Become a Cyber Forensic Expert- Physical Requirements of a
Cyber forensics Lab, Types of Cyber forensics.

File System Forensics-Working with windows and CLI systems- file

systems, exploring Microsoft file structures, examining FAT and NTFS
disks, whole disk encryption, the windows registry, Microsoft start up tasks-
Windows7,Windows 8,Windows 10- Examining UNIX and LINUX disk
structures and boot processes, understanding Disk drives, Solid State storage
devices.

OS and Network Forensics

Windows Forensics-Live Response: Data Collection- Introduction , Locard’s

Exchange Principle, Order of Volatility - Volatile and Non Volatile Data
Live-Response Methodologies: Data Analysis, Windows Memory Analysis,
Rootkits and Rootkit detection. Linux Forensics: Live Response- Data
Collection- Data Analysis- Log Analysis, Keyword Searches, User Activity,
Network Connections, Running Processes, Open File Handlers, The Hacking
3 9
Top Ten and Reconnaissance Tools.

Network Forensics: The OSI Model, Forensic Footprints, Seizure of

Networking Devices, Network Forensic Artifacts, ICMP Attacks, Drive-By
Downloads, Network Forensic Analysis Tools, Network Log analysis, Case
Study: Wireshark. Web Attack Forensics: OWASP Top 10, Web Attack
Tests, Penetration Testing.
Mobile Device Forensics and Internet of Anything- Cloud Forensics.

Cyber Security and Anti Forensics

Cyber Security: Cybercrimes, Types of Cybercrimes –Cyber Security Steps

taken to protect ICT and prevent Misuse of Internet- IT Act 2000 and
amendments- Email and Social Media Investigations-. Cyber Technology-
4
Technological/Governance/Judicial/Legal Aspects and perspectives of Cyber 9
Forensics/Security. Cyber-attack Frameworks-Mitre Framework-Crypto
currency.
 Anti-Forensics

Anti-forensic Practices - Data Wiping and Shredding- Data Remanence,

Degaussing, Case Study: USB Oblivion, Eraser - Trail Obfuscation:
Spoofing, Data Modification, Case Study: Timestamp – Encryption, Case
Study: VeraCrypt, Anti-forensics Detection Techniques

Course Assessment Method

(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

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

5 15 10 10 40

End Semester Examination Marks (ESE)

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

Part A Part B Total

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

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

Bloom’s
Course Outcome Knowledge
Level (KL)
Explain the basic concepts in cyber forensics, forensics Investigation
CO1 K2
Process and the usage of Cyber Forensics Tools in investigations
Infer the basic concepts of file systems, its associated attribute
CO2 K2
definitions
Utilize the methodologies used in memory analysis and network
CO3 K3
analysis for detection of artifacts
Explain the basic concepts in cyber security and study the essence of
CO4 K2
IT Act.

CO5 Summarize anti forensics practices and data hiding methods. K2

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

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

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

CO2 2 2 2

CO3 2 2 3 3 3 2

CO4 2 2 3 3 3 2

CO5 2 2 2 2
Note: 1: Slight (Low), 2: Moderate (Medium), 3: Substantial (High), -: No Correlation
 Text Books
Name of the Edition and
Sl. No Title of the Book Name of the Author/s
Publisher Year
Bill Nelson, Amelia
Guide to computer forensics 6th Edition
1 Philipps and Christopher Cengage
and investigations 2020
Steuart
Pearson Education, 1st
2 File System Forensic Analysis Brian Carrier
Inc. Edition,2005
Windows Forensic Analysis 2nd
3 Harlan Carvey Syngress
DVD Toolkit Edition,2009
Unix and Linux Forensic Chris Pogue , Cory 1st
4 Syngress
Analysis DVD Toolkit Altheide, Tode Haverkos Edition,2008
Fundamentals of Network 1st Edition,
5 E. Maiwald McGraw-Hill
Security 2017
Network Security Essentials 6th Edition,
6 William Stallings Pearson Education
Applications and Standards 2018

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
Information Security and Cyber Forensics-- NPTEL/SWAYAM
I
By Prof. Pratosh Bansal | Devi Ahilya Vishwavidyalaya, Indore
Digital Forensics-- NPTEL/SWAYAM
II/III
By Dr. Jeetendra Pande | Uttarakhand Open University, Haldwani
Cyber Security and Privacy
IV
By Prof. Saji K Mathew | IIT Madras
 SEMESTER S6

CLOUD INFRASTRUCTRE AND SYSTEMS

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

Course Objectives:

1. To provide students with a comprehensive understanding of cloud computing concepts and

infrastructure.
2. To explore various cloud service models and deployment models.
3. To understand the security challenges and solutions in cloud computing environments.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Traditional computing: Limitations, Overview of Computing Paradigms:
Grid Computing, Cluster Computing, Distributed Computing, Utility
Computing, Cloud Computing, NIST reference Model, Basic terminology
and concepts, Cloud characteristics, benefits and challenges,
1
Cloud delivery (service) models: Infrastructure-as-a-Service (IaaS), Platform-
9
as-a-Service (PaaS), Software-asaService (SaaS), XaaS (Anything-as-a-
service), Cloud deployment models: Public cloud, Community cloud, Private
cloud, Hybrid cloud, Open Cloud Services.
Basic Terms and Concepts in Security, Threat Agents, Cloud Security
Threats, Identity Management

2 and Access Control, Cloud Security Working Groups, Elements of

Cloud Security Model, Cloud Security Reference Model, Examining Cloud 9
Security against Traditional Computing
 Introduction to AWS, AWS history, AWS global Infrastructure, AWS
3 9
services, AWS ecosystem, comparison of AWS, Azure and Google cloud.
Security Management in the Cloud Security Management Standards,
Security Management in the Cloud, Availability Management: SaaS, PaaS,

4 IaaS, Privacy Issues, Data Life Cycle, Key Privacy Concerns in the Cloud,
9
Protecting Privacy, Changes to Privacy Risk Management and Compliance
in Relation to Cloud Computing, Legal and Regulatory Implications

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)
To provide students with a comprehensive understanding of cloud
CO1 K2
computing concepts and infrastructure
CO2 To explore various cloud service models and deployment models K2
To understand the security challenges and solutions in cloud
CO3 K2
computing environments
To understand fundamental of Identity and Access Management and K3
CO4
compliance
Identify the industry security standards, regulatory mandates, audit K3
CO5
policies and compliance requirements for Cloud based infrastructures
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 3 3 2 2

CO3 3 2 2

CO4 3 2 2 2 2 2

CO5 3 2 2 2
Note: 1: Slight (Low), 2: Moderate (Medium), 3: Substantial (High), -: No Correlation
 Text Books
Name of the Edition and
Sl. No Title of the Book Name of the Author/s
Publisher Year
Cambridge University First edition
1 Cloud computing Bhowmik, S.
Press, 2017 ,2017
Thomas, E., Zaigham, First
2 Cloud Computing Concepts, Prentice Hall,
M., Ricardo, P Edition,2013
Technology & Architecture
Cloud Security: A Comprehensive Ronald L. Krutz, Wiley Publishing, First edition
3
Guide to Secure Cloud Computing Russell Dean Vines 2010 ,2010
Tim Mather,
O’Reilly Media, Inc., First edition
4 Cloud Security and Privacy SubraKumaraswamy,
2009 2009
and ShahedLatif
 SEMESTER S6

CRYPTOGRAPHIC ALGORITHMS IN BLOCK CHAIN

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

CCT 412
Prerequisites (if any) Course Type Theory

Course Objectives:

1. To understand building blocks of Blockchain.

2. The course introduces the cryptographic principles behind blockchain
SYLLABUS

Module Contact
Syllabus Description
No. Hours
Foundations of Blockchain
Blockchain Architecture –Challenges –Applications –Blockchain Design
Principles -The Blockchain Ecosystem - The consensus problem -
1
Asynchronous Byzantine Agreement - AAP protocol and its analysis - peer-
7
to-peer network – Abstract Models - GARAY model - RLA Model-Proof of
Work (PoW) -Proof of Stake (PoS) based Chains - Hybrid models.
Fundamentals of Cryptography
Introduction to Cryptography, Symmetric cryptography – AES. Asymmetric
cryptography – RSA. Elliptic curve cryptography, Digital signatures – RSA
2 7
digital signature algorithms. Secure Hash Algorithms – SHA-256.
Applications of cryptographic hash functions – Merkle trees, Distributed
hash tables.
Crypto Primitives, Securing and Interconnecting Public and Private
Block Chains
3 7
Hash Function and Merle Tree-Security Properties-Security Considerations
for block chain Digital Signature-Public Key Cryptography-Bitcoin
 blockchain incentive structures- Nash Equilibriums- evolutionary stable
strategies,-and Pareto efficiency (game theory) Weaknesses and news Points
of Failure, Mitigation Methods, Redundancies and fall-back methods.
Blockchain Protocols
Ethereum tokens –Augur -Golem -Understanding Ethereum tokens -App
4 6
Coins and Protocol Tokens - Blockchain Token Securities Law Framework -
Token Economy - Token sale structure - Ethereum Subreddit.

Course Assessment Method

(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

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

5 15 10 10 40

End Semester Examination Marks (ESE)

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

Part A Part B Total

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

module.  Two questions will be given from each module, out
 Total of 8 Questions, each of which 1 question should be answered.
carrying 3 marks  Each question can have a maximum of 3 sub
divisions. 60
(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 Blockchain ecosystem and its services in real world K2
CO1
sceneries.
Distinguish between Symmetric cryptography and asymmetric K4
CO2
cryptography.
CO3 Explain the working of AES algorithm. K4
Understanding the methods for Securing and Interconnecting Public K2
CO4
and Private Block Chains
CO5 Acquaint the protocol and assess their computational requirements K2

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

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

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

CO2 2 2 3 1 2 2

CO3 2 2 3 1 2 2

CO4 2 2 3 1 2 2

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

Text Books
Name of the Edition and
Sl. No Title of the Book Name of the Author/s
Publisher Year
Blockchain enabled Dhillon, V., Metcalf, D., 1st Edition,
1 CA: Apress, Berkeley
applications and Hooper, M 2017
Mastering Blockchain: A deep
dive into distributed ledgers,
Third
consensus protocols, smart
2 Imran Bashir Packt Publishing edition,
contracts, DApps,
2020
cryptocurrencies, Ethereum,
and more
 Reference Books
Name of the Edition and
Sl. No Title of the Book Name of the Author/s
Publisher Year
Blockchains, digital assets,
Diedrich, Wildfire publishing, 1st Edition,
1 smart contracts, decentralized
H. Ethereum Sydney. 2016
autonomous organizations
Blockchain Technology: Kumar Saurabh, 1st
2 Wiley Publications
Concepts and Applications Ashutosh Saxena Edition,2020
Chandramouli
Universities Press First edition,
3 Blockchain Technology Subramanian, Asha A
(India) Pvt. Ltd August 2020
George, et al
Createspace
Distributed Ledger
Independent Pub,
4 Technology: The Science of Wattenhofer, R. P 2 nd Edition
Scotts Valley,
the Blockchain
California, US.

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
1 https://youtu.be/mzPoUjQC4WU
2 https://youtu.be/LjEZzYe5uOo?feature=shared
3 https://youtu.be/3FnEwnOpo_k?feature=shared
4 https://youtu.be/v1MSq7m7lzA?feature=shared
 SEMESTER S6

AI AND ML IN CYBER SECURITY DEFENCE

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

PECCT413 Introduction to
AI and ML
Prerequisites (if any) PECCT523 AI in Cyber
Course Type Theory
Security

Course Objectives:

1. To provide students with a comprehensive understanding of the importance, challenges, and

promises of AI in the cybersecurity landscape.
2. To familiarize students with various machine learning techniques and their applications within the
cybersecurity domain, including anomaly detection and intrusion detection.
3. To introduce students to generative AI concepts, algorithms, and models, and explore their
applications in cybersecurity, including threat detection and incident response.
4. To equip students with the knowledge to identify potential security risks associated with AI and
generative AI, and to develop best practices for securing AI systems in cybersecurity.
SYLLABUS

Module Contact
Syllabus Description
No. Hours
Introduction: Role of AI in Cyber Security and Security Framework
Review of Artificial Intelligence in Cyber Security: Definition and
Importance, Challenges and promises, Security Threats of Artificial
Intelligence: Types and Examples

1 Machine Learning in Cyber Security

Introduction to Machine Learning: Concepts and Terminology, 8
Applications of Machine Learning in the Cyber Security Domain , Machine
Learning Tasks and Approaches: Supervised vs. Unsupervised Learning
Anomaly Detection Techniques in Cybersecurity,
 Privacy Preserving Nearest Neighbour Search; Techniques and Applications,
Machine Learning Applied to Intrusion Detection
Fundamentals of Generative AI:
Concepts, Algorithms, and Models; Generative AI Techniques: Variational
Autoencoders (VAEs), Generative Adversarial Networks (GANs),

2 Transformer-Based Models
Applications of Generative AI in Various Domains: Text Generation, Image 10
Synthesis
Case Study: Successful Generative AI Applications and their Impact
Generative AI for Cybersecurity
Overview of Cybersecurity Challenges and the Potential of Generative
AI: Applications of Generative AI in Cybersecurity; Anomaly Detection,
Threat Hunting, Vulnerability Analysis

3 Generative AI for Automated Incident Response and Mitigation

9
Case Study: Generative AI in Real-World Cybersecurity Scenarios
Generative AI Security Risks and Challenges
Potential Security Risks Associated with Generative AI: Data Poisoning,
Model Inversion, Adversarial Attacks
Overview of Generative AI Applications in Cybersecurity Defence:
Predictive Analytics for Threat Detection Using Generative AI, Automated
Security Patch Generation and Vulnerability Management, Strengthening

4 Encryption Protocols 9
Case Study: Real-World Applications of Generative AI in Cybersecurity
defence, Best Practices for Securing Generative AI Systems, Future Trends
in Generative AI for Cybersecurity defence
 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)
To explain the significance of AI in cybersecurity, including its K2
CO1
challenges and potential threats.
To identify and apply machine learning techniques relevant to K3
CO2
cybersecurity tasks, such as anomaly detection and intrusion detection.
To evaluate the effectiveness of generative AI techniques in addressing K4
CO3 cybersecurity challenges, including incident response and threat
mitigation.
To assess security risks related to AI systems and propose best practices K4
CO4
for securing generative AI applications in cybersecurity.
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 1

CO2 2 3 2

CO3 2 2 1

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

Text Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Himanshu Upadhyay,
Artificial Intelligence in Cyber Steven Lawrence
Springer International
1 Security: Theories and Fernandes, Tarun Kumar 2023
Publishing
Applications Sharma, Tushar
Bhardwaj
Rahul Neware Khaja
ARTIFICIAL
INTELLIGENCE IN CYBER Mannanuddin, Mukesh
2 Book Rivers 2022
SECURITY Madanan, Dr. Shikha
Gupta

Reference Books
Name of the Name of the Edition
Sl. No Title of the Book
Author/s Publisher and Year
Hands-on Artificial Intelligence for Alessandro
1 Packt Publishing 2022
Cybersecurity Parisi
Artificial Intelligence for Cybersecurity: Springer International
2 Mark Stamp 2022
Techniques, Challenges and Research Publishing

3 Generative AI for Cybersecurity Edited Volume Springer 2023

 Video Links (NPTEL, SWAYAM…)
Module
Link ID
No.
1 https://www.youtube.com/watch?v=fC7V8QsPBec
2 https://www.youtube.com/watch?v=oJlb4jBbKWw
3 https://www.youtube.com/watch?v=oJlb4jBbKWw
4 https://www.youtube.com/watch?v=oJlb4jBbKWw
 SEMESTER S6

OT THREAT PREVENTION

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

Fundamentals and
Prerequisites (if any) Course Type Theory
advanced Industrial
Cyber Security

Course Objectives:

1. Enables the learners to understand the Distinctions and Integration of OT and IT Systems and
helps the students to identify the difference between OT and IT networks in Industrial Systems.
2. Enables the students to identify and classify OT Assets based on criticality.
3. Enables the learners to implement Access Control and Secure Network Access.
4. Enables the learners to monitor, analyze, and respond to Threats and Vulnerabilities
SYLLABUS

Module Contact
Syllabus Description
No. Hours
Understanding OT and IT Systems
Overview of OT and IT Systems: Defining Operational Technology (OT)
and Information Technology (IT), Key differences between OT and IT in
terms of architecture, functionality, and security, Independent OT networks:
Architecture, use cases, and benefits.
Integration of OT with IT Networks: Drivers for OT-IT convergence,
1
Challenges in integrating OT with IT networks, Common architectures for
9
OT-IT integration
Threats and Vulnerabilities in Integrated Networks:Threat landscape for
integrated OT-IT environments, Vulnerabilities specific to OT, IT, and their
integration, Case studies of security incidents in integrated networks
 Asset Identification and Criticality Classification: Identifying OT
Assets: Techniques for asset discovery in OT environments, Importance of
maintaining an up-to-date asset inventory, Tools and technologies for OT
asset identification
Criticality Classification: Criteria for classifying OT assets based on

2 criticality, Impact analysis of OT asset failure on overall operations,

Prioritizing security efforts based on asset criticality 10

Risk Management and Compliance: Applying risk management

frameworks in integrated networks, Compliance considerations in OT-IT
integration, Standards and best practices (e.g., NIST, IEC 62443)

Securing Access and Dynamic Network Segmentation:

Securing Wired and Wireless Access: Best practices for securing wired
access in OT-IT networks, Wireless security protocols and their application
in OT environments, Managing and securing remote access in integrated
networks
Dynamic Network Segmentation: Concepts of network segmentation and
3
micro-segmentation, Implementing dynamic network segmentation in OT-IT 12
environments.
Monitoring, Analysis, and Threat Response
Monitoring and Threat Detection: Importance of continuous monitoring in
integrated OT-IT networks, Tools and techniques for monitoring OT and IT
systems.
Analyzing Threats and Vulnerabilities: Techniques for analyzing security
data from integrated networks, Vulnerability management and patching in
OT-IT systems, Incident detection and analysis for OT-IT integrated
environments.

4 Incident Response and Recovery: Developing incident response plans 10

specific to OT-IT integration, Threat hunting and proactive security
measures, Recovery strategies and business continuity planning for
integrated networks.
 Course Assessment Method
(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

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

5 15 10 10 40

End Semester Examination Marks (ESE)

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

Part A Part B Total

 2 Questions from each  Each question carries 9 marks.
module.  Two questions will be given from each module, 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)
Differentiate Between OT and IT Systems and Understand Their K2
CO1
Integration.
CO2 Identify, Inventory, and Classify OT Assets Based on Criticality. K2
Implement Effective Access Control and Secure Network Access K3
CO3
Mechanisms.
Deploy Continuous Monitoring and Advanced Threat Detection K3
CO4
Systems.
Develop and Execute Comprehensive Incident Response and Recovery K3
CO5
Plans.
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 1 1 2 1
CO2 3 2 2 2 1 1 1 2 1
CO3 3 3 2 3 1 2 2 2 1 1
CO4 3 3 3 3 2 3 2 3 2 2 1 2
CO5 3 3 3 3 3 3 2 3 3 3 2 3
Note: 1: Slight (Low), 2: Moderate (Medium), 3: Substantial (High), -: No Correlation

Text Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Thomson
Practical Industrial Delmar Cengage
2nd edition,
1 Cybersecurity: ICS, OT, and Philip A. Craig Learning
2013
IIoT
Cybersecurity for Industrial Tyson Macaulay, Bryan Ist edition,
2 Control Systems: SCADA, CRC Press
L. Singer 2012
DCS, PLC, HMI, and SIS
Applied Cyber Security and the
Smart Grid: Implementing Eric D. Knapp, Raj Ist edition,
3 Syngress
Security Controls into the Samani 2013
Modern Power Infrastructure
Industrial Network Security
:Securing Critical Infrastructure 2nd Edition,
Eric D Knapp
4 Networks for Smart Grid, Syngress
Joel Thomas Langill 2014
SCADA and other Industrial
Control Systems
Industrial Cybersecurity: 2nd Edition,
5 Efficiently Secure Critical Pascal Ackerman Packt Publishing
2021
Infrastructure Systems
Building an Effective
Cybersecurity Program: Ist edition,
6 Lessons Learned from an Tari Schreider Rothstein Publishing
2017
Industrial Control Systems
Environment
 Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Industrial Automation using 2nd Edition,
1 R.G.Jamkar Global Education Ltd
PLC , SCADA & DCS 2018
Handbook of SCADA/Control Robert Radvanovsky, 2nd Edition,
2 CRC Press
Systems Security Jacob Brodsky 2016
Effective Cyber security : A
Addison-Wesley 1st edition,
3 Guide to Using Best Practices William Stallings
Professional 2018
and Standards

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
https://nptel.ac.in/courses/106/105/106105217/
1 https://nptel.ac.in/courses/108/105/108105088/

https://nptel.ac.in/courses/108/101/108101167/
2 https://nptel.ac.in/courses/106/105/106105217/

https://nptel.ac.in/courses/106/106/106106220/
3 https://nptel.ac.in/courses/108/108/108108122/

https://nptel.ac.in/courses/108/108/108108098/
4 https://nptel.ac.in/courses/106/105/106105217/
 SEMESTER S6

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

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

Prerequisites (if any) None Course Type Theory

Course Objectives:

1. To provide students with a comprehensive understanding of the principles, technologies,

and processes involved in biometric systems, including various recognition techniques
and performance measures.
2. To enable students to critically evaluate security issues, privacy concerns, and biometric
standards, while exploring the practical applications of biometric systems across different
fields.
SYLLABUS
Module Contact
Syllabus Description
No. Hours
Biometric fundamentals – Biometric technologies – Biometrics Vs
traditional techniques – Characteristics of a good biometric system –
Benefits of biometrics – Key biometric processes: verification, identification

1 and biometric matching – Performance measures in biometric systems, FAR,

FRR, FTE rate, EER and ATV rate, Applications of Biometric Systems, 8
Security and Privacy Issues, Physiological Biometrics and Behavioural
Biometrics.
Fingerprint recognition: Friction ridge patterns, Acquisition, Feature
extraction, matching, indexing, synthesis, palm print. Face recognition:

2 Introduction, image acquisition, face detection. Feature extraction of face

recognition, matching, heterogeneous face recognition. Signature-scan, 11
Keystroke Scan– components, working principles.
 Iris recognition, Image acquisition, iris segmentation, normalization.
Encoding and matching, quality assessment, performance evaluation Ear
3 8
detection and recognition – challenges, gait and hand geometry. Feature
extraction and matching
Security of bio-metric systems: adversary attacks, attacks on user interface,

4 attacks on bio-metric processing, database attacks. Biometric standards,

7
biometric databases

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

End Semester Examination Marks (ESE):

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

Part A Part B Total

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

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

Bloom’s
Course Outcome Knowledge
Level (KL)
Understand the fundamental concepts of biometric systems, including K2
CO1
their technologies and key processes.
Understand key performance metrics of biometric systems and their K2
CO2
relevance to system accuracy.
Apply various biometric recognition techniques, including fingerprint, K3

CO3 face, iris, and palm print recognition, understanding the acquisition,
feature extraction, and matching processes.
Identify potential security and privacy threats in biometric systems, K3
CO4 and recommend strategies to mitigate attacks on biometric processing,
user interfaces, and databases.
Understand the biometric standards, databases, and their applications K2

CO5 across different industries, as well as the differences between

physiological and behavioural biometrics.
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create

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

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

CO2 2 2 2 2

CO3 3 3 2 2 2 2

CO4 3 3 2 2 2 2

CO5 2 2 2 2 2 2
Note: 1: Slight (Low), 2: Moderate (Medium), 3: Substantial (High), -: No Correlation
 Text Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Anil K. Jain, Arun A.
1 Introduction to Biometrics Ross, Karthik Springer 2011
Nandakumar,
2 Handbook of Biometrics Jain, P. Flynn, A. Ross Springer 2008

Reference Books

Name of the Edition

Sl. No Title of the Book Name of the Author/s
Publisher and Year
Biometric Technologies and
1 John R. Vacca Elsevier 2007
Verification Systems
Biometrics – Identity
Samir Nanavati, Michael Wiley-dreamtech India
2 Verification in a Networked 2003
Thieme, Raj Nanavati Pvt Ltd, New Delhi
World
Biometrics for Network Pearson Education,
3 Paul Reid 2004
Security New Delhi

Video Links (NPTEL, SWAYAM…)

Modu
Link ID
le No.
https://www.youtube.com/watch?v=GMDggxifxqk&list=PLbMVogVj5nJSCwX0N6MAXPsKGW
1
FRI5Y5m&index=1
https://www.youtube.com/watch?v=7aQgQGeZ_qo&list=PLbMVogVj5nJSCwX0N6MAXPsKGW
2
FRI5Y5m&index=5
https://www.youtube.com/watch?v=ZEV3th6_olk&list=PLbMVogVj5nJSCwX0N6MAXPsKGWF
3
RI5Y5m&index=8
https://www.youtube.com/watch?v=eNPAas0XgVI&list=PLbMVogVj5nJSCwX0N6MAXPsKGW
4
FRI5Y5m&index=15
 SEMESTER S6

ETHICAL HACKING & IOT SECURITY

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

None/
Prerequisites (if any) Course Type Theory
(Course code)

Course Objectives:

1. To learn ethical hacking and security challenges in computer networking.

2. To protect the network system using firewalls and filters, about the legal, professional and ethical
issues.
SYLLABUS

Module Contact
Syllabus Description
No. Hours
Elements of Information Security, Authenticity and Non-Repudiation, Security
Challenges, Effects of Hacking, Hacker – Types of Hacker, Ethical Hacker,
Role of Security and Penetration Tester, Penetration Testing Methodologies:–
OSSTMM, NIST, OWASP, Categories of Penetration Test, Types of
Penetration Tests, Vulnerability Assessment.
1
Tools for Foot Printing, Conducting Competitive Intelligence, Google 11
Hacking, Scanning, Enumeration, Trojans & Backdoors, Virus & Worms,
Proxy & Packet Filtering, Denial of Service, Sniffer, Social Engineering–
shoulder surfing, Dumpster Diving, Piggybacking.
Vulnerability Data Resources – Exploit Databases – Network Sniffing –
Types of Sniffing – MITM Attacks – ARP Attacks – Denial of Service
Attacks - Hijacking Session with MITM Attack -DNS Spoofing – ARP
2 Spoofing Attack Manipulating the DNS Records – DHCP Spoofing -Remote
11
Exploitation – Attacking Network Remote Services – Overview of Brute
Force Attacks – Traditional Brute Force – Attacking SMTP – Attacking SQL
 Servers – Testing for Weak Authentication.
Routers, Firewall & Honey pots, IDS &IPS, Web Filtering, Vulnerability,
Penetration Testing, Session Hijacking, Web Server, SQL Injection, Cross
Site Scripting, Exploit Writing, Buffer Overflow, Reverse Engineering,
Email Hacking, Incident Handling & Response, Bluetooth Hacking, Mobiles
Phone Hacking.
What is IoT, Genesis of IoT, IoT and Digitization, IoT Impact, Convergence
of IT and IoT, IoT Challenges, IoT Network Architecture and Design,
Drivers Behind New Network Architectures, Comparing IoT Architectures,
A Simplified IoT Architecture, The Core IoT Functional Stack, IoT Data
Management and Compute Stack.

3 Smart Objects: The “Things” in IoT, Sensors, Actuators, and Smart Objects, 11
Sensor Networks, Connecting Smart Objects, Communications Criteria, IoT
Access Technologies.
IP as the IoT Network Layer, The Business Case for IP, The need for
Optimization, Optimizing IP for IoT, Profiles and Compliances, Application
Protocols for IoT, The Transport Layer, IoT Application Transport Methods.
Data and Analytics for IoT, An Introduction to Data Analytics for IoT,
Machine Learning, Big Data Analytics Tools and Technology, Edge
Streaming Analytics, Network Analytics, Securing IoT, A Brief History of
4 OT Security, Common Challenges in OT Security, Differences between IT 11
and OT Security Practices and Systems, Formal Risk Analysis Structures:
OCTAVE and FAIR.

Course Assessment Method

(CIE: 60 marks, ESE: 40 marks)

Continuous Internal Evaluation Marks (CIE):

Attendance Project Internal Ex-1 Internal Ex-2 Total

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

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

Part A Part B Total

 2 Questions from each  2 questions will be given from each module,
module. out of which 1 question should be answered.
 Total of 8 Questions,  Each question can have a maximum of 2 sub
40
each carrying 2 marks divisions.
(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)
CO1 Explain the basic concepts of Ethical hacking K2
Utilize the tools to conduct competitive intelligence and social K3
CO2
engineering.
CO3 Appreciate the security considerations in IoT. K2
Outline the fundamentals of IoT and its underlying physical and logical K2
CO4
architecture
CO5 Implement IoT applications using the available hardware and software. K3

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

CO-PO Mapping Table:

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

CO2 3 2 2

CO3 3 2 2

CO4 3 2 2

CO5 3 2 2 2 2 2
 Text Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
“Hands on ethical hacking and Michael T Simpson,
2nd edition,
1 network defense”, Cengage Kent Back man, James
2010
Learning. Corley,
“Ethical Hacking and
2 Rafay Baloch CRC Press 2014.
Penetration Testing Guide”
“Internet of Things: A hands- Arshadeep Bahga, Vijay 2015 (First
3 University Press
on approach” Madisetti, edition)
Internet of Things: Converging
Technologies for Smart Dr. Ovidiu Vermesan,
4 River Publishers 2013
Environments and Integrated Dr. Peter Friess
Ecosystems,

Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
“Certified Ethical Hacker: A
1 Study Guide”, Wiley Kimberly Graves, Wiley Publishing, Inc. 2010
Publishing, Inc., 2010.
“Hacking Exposed 7 :Network Stuart Mc Clure, Joel McGraw-Hill edition 7,
2
Security Secrets & Solutions” Scambray, publishing, 2012
"IoT Fundamentals: David Hanes, Gonzalo
Networking Technologies, Salgueiro, Patrick
3 Pearson Education 1st Edition
Protocols, and Use Cases for rossetete, Robert Barton,
the Internet of Things” Jerome Henry ,
“Internet of Things:
McGraw Hill (India)
4 Architecture and Design Rajkamal
Private Limited
Principles”
 Video Links (NPTEL, SWAYAM…)
Module
Link ID
No.
1 https://www.youtube.com/watch?v=fNzpcB7ODxQ

2 https://www.youtube.com/@HackerSploit
3 https://www.youtube.com/watch?v=7zWVxrjjIpE
4 https://www.youtube.com/playlist?list=PL1ljc761XCiaTRgucelgZS8pbTEyt1BjX

PBL Course Elements

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

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

Assessment and Evaluation for Project Activity

Sl. No Evaluation for Allotted

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

 Clarity and feasibility of the project plan

 Research and background understanding
 Defined objectives and methodology

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

 Individual contribution to the presentation

 Effectiveness in answering questions and handling feedback

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

 Active participation and individual contribution

 Teamwork and collaboration

4. Execution and Implementation (10 Marks)

 Adherence to the project timeline and milestones

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

5. Final Presentation (5 Marks)

 Quality and clarity of the overall presentation

 Individual contribution to the presentation
 Effectiveness in answering questions

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

 Overall quality and technical excellence of the project

 Innovation and originality in the project
 Creativity in solutions and approaches
 SEMESTER S6

DESIGN THINKING AND PRODUCT DEVELOPMENT

(Common to Group A & Group B)

Course Code GXEST605 CIE Marks 40

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

Credits 2 Exam Hours 2 Hrs. 30 Min.

None
Prerequisites (if any) Course Type Theory

Course Objectives:

1. To guide students through the iterative stages of design thinking, including empathizing with
users, defining problems, ideating solutions and developing Proof of Concepts (PoC) and
technical feasibility studies.

2. To promote the development of critical thinking skills by engaging students in integrative

inquiry, where they ask meaningful questions that connect classroom knowledge with real-world
applications.

3. To equip students with the ability to involve in product design considering the sustainability,
inclusivity, diversity and equity aspects.

SYLLABUS
Module Contact
Syllabus Description
No. Hours
Fundamentals of design thinking and product development: Overview of
stages of product development lifecycle; Design thinking -Definition-Design
thinking for product innovation; Bringing social impact in ideation-

1 Identifying societal needs-understanding multi-faceted issues-community 6

engagement and empathetic design- technological innovation meeting
societal needs; Understanding and Bridging the divide using Human
Centered Design (HCD); Designing for inclusivity in product development-
 embracing user diversity - Long term impact - sustainability encompassing
environmental,economic and social dimensions; Technology Readiness
Level in the Innovation Life-cycle; Performing a self-check on innovative
ideas - Originality of idea- understanding innovation landscape -
patentability - understanding the economic landscape - Unique Selling
Proposition (USP) - Repeatability and Manufacturability - Sustainability -
Leveraging business models for comprehensive analysis
Empathize: Design thinking phases; Role of empathy in design thinking;
Methods of empathize phase - Ask 5 Why/ 5 W+H questions; Empathy
maps - Things to be done prior to empathy mapping - Activities during and

2 after the session; Understanding empathy tools - Customer Journey Map - 6

Personas.
Define: Methods of Define Phase: Storytelling, Critical items diagrams,
Define success.
Ideation : Stages of ideation; Techniques and tools - Divergent thinking
tools - Convergent thinking tools - Idea capturing tools; Cross-industry
inspiration; Role of research in ideation - Market research - consumer
research - leveraging research for informed ideation; Technological trends -
navigating the technological landscape - Integrating emerging technologies;
3 6
Feasibility studies - technical, economic, market, operational, legal, and
ethical feasibility; Ideation session- techniques and tips.
Proof of Concept (PoC) : Setting objectives; Risk assessment; Technology
scouting; Document and process management; Change management;
Knowledge Capture; Validating PoC; Story telling in PoC presentation
Design: Navigating from PoC to detailed design; Developing Specification
Requirement Document (SRD)/Software Requirement Specification (SRS);
Design for manufacturability; Industrial standards and readability of code;
Design to cost; Pre-compliance; Optimized code; Design Failure Mode and
Effects Analysis (DFMEA); Forecasting future design changes.
4 6
Prototyping: Alpha prototypes; Beta prototypes; Transition from design to
prototype; Goals and expectations for Alpha and Beta prototypes; Effective
strategies for maintaining timeline in prototyping; Testing and refining
Alpha prototypes; Transitioning to Beta prototypes.
Pilot build: Definition and purpose of a pilot build; setting objectives;
 Identification and selection of manufacturing partner for pilot build; Testing
procedures in pilot build; Scaling from pilot build to full-scale production /
implementation.

Course Assessment Method

(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

Internal
Examination Reflective Journal
Attendance Assignments Total
and Portfolio

5 20 10 5 40

End Semester Examination Marks (ESE)

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

Part A Part B Total

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

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

Bloom’s
Course Outcome Knowledge
Level (KL)
Empathize to capture the user needs and define the objectives with due
CO1 consideration of various aspects including inclusivity, diversity and K5
equity
Ideate using divergent and convergent thinking to arrive at innovative
CO2 ideas keeping in mind the sustainability, inclusivity, diversity and K6
equity aspects.
Engage in Human Centric Design of innovative products meeting the
CO3 K5
specifications
Develop Proof of Concepts (PoC), prototypes & pilot build of
CO4 products and test their performance with respect to the Specification K4
Requirement Document.
Reflect on professional and personal growth through the learnings in
CO5 K4
the course, identifying areas for further development
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create

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

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 2 2 2 3 3 3 2 2 3
CO2 3 2 3 2 3 3 3 2 2 3
CO3 3 2 3 2 3 3 2 2 2 3
CO4 3 2 2 3 3 3 2 2 2 3
CO5 3 3 3 2 2 2 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
Product Sense: Engineering
1 Dr. K R Suresh Nair NotionPress.com 2024
your ideas into reality
Change by Design: How
Design Thinking Transforms HarperCollins
2 Tim Brown 2009
Organizations and Publishers Ltd.
Inspires Innovation
Design Thinking for Strategic John Wiley & Sons
3 Idris Mootee 2013
Innovation Inc.
Sample Assignments:

1. Evaluate and prepare a report on how the aspects including inclusivity, diversity and equity are taken
into consideration during the empathize and define phases of the Miniproject course.

2. Evaluate and prepare a report on how the aspects including sustainability, inclusivity, diversity and
equity are taken into consideration during the ideate phase of the Miniproject course.

3. Evaluate and prepare a report on how User-Centric Design (UCD) is used in the design and
development of PoC of the product being developed in the Miniproject course.

4. Prepare a plan for the prototype building of the product being developed in the Miniproject course.

5. Report on the activities during the empathize phase including the maps & other materials created during
the sessions.

6. Report on the activities during the define phase including the maps & other materials created during the
sessions.

7. Report of all the ideas created during the ideation phase of the Miniproject course through the tools
including SCAMPER technique, SWOT analysis, Decision matrix analysis, six thinking hats exercise

8. Prepare a full scale production plan for the product being developed in the Miniproject course.

9. Create a Stanford Business Model Canvas related to the Miniproject.

An industrial visit of at least a day for experiential learning and submit a report on the learnings, for
example industry standards and procedures.
 SEMESTER 6

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

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

Trees and Graphs

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

Sorting and Searching

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

Course Assessment Method

(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

Internal Internal
Assignment/ 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)

Identify appropriate data structures for solving real world

CO1 K3
problems.

Describe and implement linear data structures such as arrays,

CO2 K3
linked lists, stacks, and queues.

Describe and Implement non linear data structures such as trees

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

Ellis Horowitz, Sartaj Sahni Universities

1 Fundamentals of Data Structures in C 2/e, 2007
and Susan Anderson-Freed, Press

Thomas H Cormen, Charles

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

Reference Books

Name of the Edition

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

Prentice Hall
1 Classic Data Structures Samanta D. 2/e, 2018
India.

Aho A. V., J. E.
Pearson
2 Data Structures and Algorithms Hopcroft and J. D. 1/e, 2003
Publication.
Ullman

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

3 2/e, 2017
Applications Sorenson Hill.

Theory and Problems of Data

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

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.

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

2 https://ocw.mit.edu/courses/6-851-advanced-data-structures-spring-2012/
 SEMESTER S6

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

Course Code OECST612 CIE Marks 40

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

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 capacity formula. 10

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

2 (RZ), Multilevel binary, Biphase. Analog data to digital signal - Sampling 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 techniques - Direct Sequence Spread Spectrum (DSSS), Frequency Hopping 8
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,
Parity check, Checksum, Cyclic Redundancy Check (CRC), Forward Error
4 9
Correction (FEC), Hamming distance, Hamming code. Basic principles of
switching - Circuit switching, Packet switching, Message switching.

Course Assessment Method

(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

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

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

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

Part A Part B Total

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

Course Outcomes (COs)

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

Bloom’s
Course Outcome Knowledge
Level (KL)
Identify the characteristics of signals for analog and digital transmissions
CO1 K3
so as to define the associated real world challenges.
CO2 Select transmission media based on characteristics and propagation modes. K3
CO3 Choose appropriate signal encoding techniques for a given scenario K3
CO4 Illustrate multiplexing and spread spectrum technologies K2
Use error detection, correction and switching techniques in data
CO5 K3
communication
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create

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

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

CO2 3 3 3 2 3

CO3 3 3 2 3

CO4 3 3 3 2 3

CO5 3 3 3 2 3
Note: 1: Slight (Low), 2: Moderate (Medium), 3: Substantial (High), -: No Correlation
 Text Books
Name of the Name of the Edition
Sl. No Title of the Book
Author/s Publisher and Year
1 Data Communications and Networking Forouzan B. A McGraw Hill 6/e, 2019

2 Data and Computer Communication William Stallings Pearson 10/e, 2016

Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
1 Mobile Communications Schiller J Pearson 2/e, 2009
Fundamentals of Networking
2 Curt M. White Cengage 7/e, 2010
and Communication

Video Links (NPTEL, SWAYAM…)

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

FOUNDATIONS OF CRYPTOGRAPHY

Course Code OECST613 CIE Marks 40

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

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
Extended Euclid’s Algorithm for GCD; Modular Arithmetic – Operations,
1 9
Properties, Polynomial Arithmetic; Algebraic Structures – Group Ring
Field.
Prime numbers and Prime Factorisation - Primitive Roots, Existence of
Primitive Roots for Primes, Fermat’s Theorem, Primality Testing, Euler’s
2 9
Theorem, Euler’s Totient Function, Discrete Logarithms, Modular
Arithmetic, Chinese Remainder Theorem.
Principles of security - Types of Security attacks, Security services, Security
Mechanisms; Cryptography - Introduction, cryptographic notations,
3 9
substitution techniques, Transposition Techniques, limitations of classical
cryptography.
Symmetric key Ciphers - Block Cipher principles & Algorithms- DES, AES,

4 Differential and Linear Cryptanalysis; Asymmetric Key Ciphers- RSA, ECC; 9

Hash Functions - MD5, SHA-1.
 Course Assessment Method
(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

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

5 15 10 10 40

End Semester Examination Marks (ESE)

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

Part A Part B Total

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

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

Bloom’s
Course Outcome Knowledge
Level (KL)
Explain the integer arithmetic operations including divisibility and
GCD algorithms, modular arithmetic operations and properties,
CO1 K2
polynomial arithmetic, and algebraic structures such as groups, rings,
and fields.
Describe the number theory concepts essential for cryptographic
CO2 K2
applications and mathematical problem-solving.
Explain the security principles, types of attacks, and protective
CO3 measures, alongside a thorough understanding of cryptographic K2
techniques and their applications in securing data.
Discuss symmetric and asymmetric key cryptography, including block
CO4 cipher principles, algorithms, public key cryptosystems, and hash K2
functions
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create
 CO-PO Mapping Table (Mapping of Course Outcomes to Program Outcomes)

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

CO2 2 2 2

CO3 2 2 2

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

Text Books
Sl. Name of the Edition
Title of the Book Name of the Author/s
No Publisher and Year
Cryptography & Network
1 Behrouz A. Forouzan McGraw Hill 3/e, 2007
Security

2 Charles P. Pfleeger, Shari L.

Security in Computing Prentice Hall 5/e, 2015
Pfleeger, Jonathan Margulies
3 Introduction to Cryptography:
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

Generalisation and Overfitting - Idea of overfitting, LASSO and RIDGE

regularization, Idea of Training, Testing, Validation

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

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/ Examination-1 Examination- 2
Attendance Total
Microproject
(Written) (Written )

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

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

Part A Part B Total

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

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

Course Outcomes (COs)

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

Bloom’s
Course Outcome Knowledge
Level (KL)

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

5 Data Mining and Analysis: Mohammed J. Zaki, | Cambridge

1/e, 2016
Fundamental Concepts and Algorithms Wagner Meira University Press

Reference Books

Name of the Name of the Edition

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

1 Machine Learning Tom Mitchell McGraw-Hill 1997

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

Neural Networks for Pattern

3 Christopher Bishop Oxford University Press 1995
Recognition

Machine Learning: A Probabilistic

4 Kevin P Murphy MIT Press 1/e, 2012
Perspective

Trevor Hastie,
The Elements Of Statistical
5 Robert Tibshirani, Springer 2/e, 2007
Learning
Jerome Friedman
 Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.

1 https://youtu.be/fC7V8QsPBec?si=8kqBn-_7x1RG5V1J

2 https://youtu.be/g__LURKuIj4?si=Xj10NPfMfpQSOhVx

3 https://youtu.be/yG1nETGyW2E?si=ySlxpeWuFAUQBf7-

4 https://youtu.be/zop2zuwF_bc?si=W7TpSHLdi4rykva4
 SEMESTER S6

OBJECT ORIENTED PROGRAMMING

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

Course Code OECST615 CIE Marks 40

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

Credits 3 Exam Hours 2 Hrs. 30 Min.

Prerequisites (if any) None Course Type Theory

Course Objectives:

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

Module Contact
Syllabus Description
No. Hours

Introduction to Java - Java programming Environment and Runtime

Environment (Command Line & IDE); Java compiler; Java Virtual Machine;
Primitive Data types and Wrapper Types; Casting and Autoboxing; Arrays;

1 Strings; Vector class; Operators - Arithmetic, Bitwise, Relational, Boolean 10

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

CYBER FORENSICS LAB

Course Code PCCCL607 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) PCCCT602 Course Type Lab

Course Objectives:

1. The course aims to master Cyber Forensics procedures and get hands-on exposure to different
Cyber Forensics tools.
2. The course aims to offer hands-on experience on integrity check of files and use it for security
implementations.
3. The course aims to offer exposure to live and static forensic analysis.

Expt.
Experiments
No.
1 Registry Viewing and Editing using native tools of Operating Systems.
Hex analysis using Hex Workshop tool
2 Using Hex Workshop perform file signature analysis. Write down the hex values of
popular file types
Bit level Forensic Analysis of evidential image using FTK or Encase or ProDiscover
3 Tools.
Image Acquisition and perform static analysis to mount an image of a drive.
Hash code generation, comparison of files using tools like HashCalc
4
Using HashCalc write down the Hash values of popular hashing algorithms.

5 Command line Analysis of disk images using The SleuthKit(TSK) tool

File System Forensic Analysis using Autopsy tool.

6
Using Autopsy perform file signature analysis. Write down the investigation report.
 7 Network Protocol Analysis using Wireshark and nmap.
8 Live Forensics and Memory Dump Analysis using LiME and Volatility Framework
9 Network Log analysis

Course Assessment Method

(CIE: 50 marks, ESE: 50 marks)

Continuous Internal Evaluation Marks (CIE):

Preparation/Pre-Lab Work experiments,

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

5 25 20 50

End Semester Examination Marks (ESE):

Procedure/ Conduct of experiment/ Result with valid

Preparatory Execution of work/ inference/ Viva
Record Total
work/Design/ troubleshooting/ Quality of voce
Algorithm Programming Output
10 15 10 10 5 50
 Submission of Record: Students shall be allowed for the end semester examination only upon
submitting the duly certified record.

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

Course Outcomes (COs)

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

Bloom’s
Course Outcome Knowledge
Level (KL)
CO1 Use the Windows Registry and Registry Editor. K3
Use the different Cyber Forensics Tools for static and dynamic forensics
CO2 K3
analysis.
CO3 Familiarize file signature analysis and applications. K3
Use FTK or Encase or ProDiscover tools for bit level forensic analysis of
CO4 K3
evidential image.
CO5 Prepare an investigation report following the chain of custody. 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

CO2 3 3

CO3 3 3

CO4 3 3

CO5 3 3 3
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
Bill Nelson, Amelia
1 Guide to computer forensics 6th Edition
Philipps and Christopher Cengage
and investigations 2020
Steuart
2 Windows Forensic Analysis 2nd
Harlan Carvey Syngress
DVD Toolkit Edition,2009
Unix and Linux Forensic Chris Pogue , Cory 1st
3 Altheide, Tode Haverkos Syngress
Analysis DVD Toolkit Edition,2008

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 S7
Computer Science and Engineering
(Cyber Security)
 SEMESTER S7

MALWARE FORENSICS

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

Course Objectives:

1. Acquire the ability to identify and assess various forms of malware, enabling students to tackle
the difficulties presented by newly evolving malware.
2. Applying both automatic and manual methods to examine malware, comprehend malware
activity monitoring tools and various malware analysis techniques.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Introduction to malware, malware threats, evolution of malware, malware
types. Types of malware Analysis – Static Analysis, Dynamic Analysis,
1 8
Malware Analysis Techniques - Obfuscated, Deobfuscated, Malware Analysis
Tools - Static Analysis Tools, Dynamic Analysis Tools. Static Analysis
Dynamic analysis: Live malware analysis, dead malware analysis, analyzing
traces of malware, system-calls, api-calls, registries, network activities. Anti-
dynamic analysis techniques anti-vm, runtime-evasion techniques, Malware
Sandbox, Monitoring with Process Monitor, Packet Sniffing with Wireshark,
Kernel vs. User-Mode, Debugging-OllyDbg, Breakpoints, Tracing, Exception
2
Handling, Patching.
11
Malware Detection Techniques: Signature-based techniques: malware
signatures, packed malware signature, metamorphic and polymorphic
signature. Non-signature based techniques: similarity-based techniques,
machine-learning methods.
Malware Incident response: Volatile Data Collection and Examination on a
3 10
Live Windows Systems - Volatile Data collection methodology from
 Windows systems- Preservation of Volatile data, Collecting Subject System
details, Identifying users Logged into the System, Inspect Network
Connections and Activity, Current and Recent Network Connections,
Collecting Process Information, Correlate Open Ports with Running Processes
and Programs, Identifying Services and Drivers, Determining Scheduled
Tasks, Collecting Clipboard Contents, Non-Volatile Data Collection from a
Live Windows System, Volatile Data collection methodology from Linux
systems, Non volatile Data collection from a live Linux system
Post-Mortem Forensics - Malware Discovery and Extraction from a Windows
and Linux system, Examine Windows and Linux file system, Examine

4 application traces, Examine Windows registry, keyword searching from 7

Windows and Linux systems, Forensic reconstruction of compromised Linux
and Windows 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  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 evolution, types, and threats of malware, and enable the
CO1 Understand
identification and classification of malicious software.
Understand static and dynamic analysis techniques to investigate
CO2 malware, utilizing tools to assess and mitigate malware impacts on Understand
systems.
Understand anti-dynamic analysis techniques to enhance the
CO3 Understand
effectiveness of malware analysis and detection.
Analyse and employ both signature-based and non-signature-based
CO4 malware detection techniques to detect and prevent advanced malware Analyse
threats.
Understand malware incident response strategies and post-mortem

CO5 forensics on compromised Windows and Linux systems, to ensure Understand

comprehensive system recovery and threat mitigation.
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 3 2 3

CO4 3 3 3 2 3

CO5 3 3 3 3 2 3
Note: 1: Slight (Low), 2: Moderate (Medium), 3: Substantial (High), -: No Correlation
 Text Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Malware Forensics Field Guide James M. Aquilina,
First
1 for Windows Systems: Digital Cameron H. Malin Syngress Publishing
Edition,2012
Forensics Field Guides ,Eoghan Casey
Malware Forensics Field Guide James M. Aquilina,
Second
2 for Linux Systems: Digital Cameron H. Malin, Syngress Publishing
Edition,2014
Forensics Field Guides” , Eoghan Casey
Practical malware analysis T he
Michael Sikorski and First
3 Hands-On Guide to Dissecting No starch press
Andrew Honig Edition,2012
Malicious Software
Malware Forensics Eoghan Casey, James M.
First
4 Investigating and Analysing Aquilina, Cameron H. Syngress Publishing,
Edition,2008
Malicious code Malin,

Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Malware & rootkits: malware & Michael Davis, Sean
Second
1 rootkits security secrets & Bodmer, Aaron McGraw Hill
Edition,2010
Solutions Lemasters
First
Windows Malware Analysis
2 Essentials
Victor Marak Packt Publishing Edition,
2015

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
1 https://www.youtube.com/watch?v=Bvqyg51Czdk
https://www.youtube.com/watch?v=uHhKkLwT4Mk&list=PLBf0hzazHTGMSlOI2HZGc0
2
8ePwut6A2Io&index=1
https://www.youtube.com/watch?v=lwUve1VdFYs&list=PLt9cUwGw6CYEpBwasTz7W
3
WgphfRWof0_O
4 https://www.youtube.com/watch?v=D0VLE1RnPmE
 SEMESTER S7

INTRUSION DETECTION & PREVENTION SYSTEM

Course Code PECCT742 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 of the fundamental concepts of Intrusion detection and prevention systems and the
different control strategies used to implement IDPS.
2. To understand of the usage of different Intrusion detection systems so that protection against attacks
can be minimized.
SYLLABUS

Module Contact
Syllabus Description
No. Hours
Introduction-Intrusion Detection and Prevention Systems, IDPS terminology,
Network attacks- Probes, Privilege Escalation Attacks, Denial of Service
(DoS) and Distributed Denial of Service (DDoS) Attacks, Worms Attacks,

1 Routing Attacks, Why use an IDPS, Types of IDPS, IDPS Detection methods-
Signature-Based IDPS, Statistical Anomaly-Based IDPS, Stateful Protocol 9
Analysis IDPS, Log File Monitors, IDPS Response Options Selecting IDPS
Approaches and Products, Strengths and Limitations of IDPSs.
IDPS Control Strategies-Centralized Control Strategy, Fully Distributed
Control Strategy, Partially Distributed Control Strategy, IDPS Deployment-
Deploying Network-Based IDPSs, Deploying Host Based IDPSs, Measuring
the Effectiveness of IDPSs, Intrusion Detection systems-How the IDS
2
Watches Your Network -Packet Sniffing, Log Parsing, System Call
9
Monitoring, Filesystem Watching, What the IDS Does When It Finds an
Attack Attempt, Passive Response, Active Response, Analyzing Your IDS
Design and Investment, False Positives versus False Negatives.
 IDPS Technologies-components and architecture, Network architectures,
security capabilities, prevention capabilities, Network based IDPS,
Networking overview, components and architecture, Security Capabilities,
Information Gathering Capabilities, Logging Capabilities, Detection
Capabilities, Types of Events Detected, Detection Accuracy , Tuning and
3 9
Customization, Technology Limitations, Prevention Capabilities,
Implementation, Wireless IDPS, WLAN Standards, WLAN Components,
Threats against WLANs, Components and Architecture, Sensor Locations,
Information Gathering Capabilities, Types of Events Detected, Prevention
Capabilities.
Host-Based IDPS-Components and Architecture, Typical Components,
Network Architectures, Agent Locations, Host Architectures, Security
Capabilities, Logging Capabilities, Detection Capabilities, Types of Events
Detected, Technology Limitations, Prevention Capabilities, Other
Capabilities, Implementation, The Need for Multiple IDPS Technologies,
Direct IDPS Integration, Indirect IDPS Integration, Network Forensic
Analysis Tool (NFAT) Software, Anti-Malware Technologies, Firewalls and
4
Routers, Honeypots. 11
IDPS Detection Approaches-Misuse detection-pattern matching, Rule based
techniques,state based techniques, Anomaly Detection-Advanced Statistical
Models, Rule based Techniques, Biological Models, Learning Models,
Specification-based Detection, Hybrid Detection, Architecture and
Implementation-Centralized, Distributed-Intelligent Agents,Mobile Agents,
Cooperative Intrusion Detection

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)
Comprehend the different terminologies and types related to Intrusion
CO1 Understand
detection and prevention systems.
CO2 Familiarize the different control strategies and and detection systems. Understand
Explore the different technologies and detection capabilities related to
CO3 Understand
Network IDPS.
CO4 Identify the capabilities, security attacks against wireless IDPS. Apply
Explore the different technologies and detection capabilities and
CO5 Apply
approaches related to host IDPS.
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

CO2 3 2 2 2

CO3 3 2 2 2

CO4 3 2 2 2 2

CO5 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
Fourth
Principles of Information Michael E. Whitman and Course Technology,
1 Edition
Security Herbert J. Mattord Cengage Learning
,2012
second
Brian Caswell, Mike Jay Beale's Open
2 Snort 2.1: Intrusion Detection edition,
Poor Source Security
2004.

Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
National Institute of
Guide to Intrusion Detection Karen Scarfone Peter First edition,
1 Standards and
and Prevention Systems (IDPS) Mell 2007
Technology,
Stephen Northcutt, Judy New Riders Third
2 Network Intrusion Detection
Novak Publications Edition,2002

Video Links (NPTEL, SWAYAM…)

Mod
ule Link ID
No.
https://www.youtube.com/watch?v=jbQBve0AXzM&pp=ygUQSURQUyB0ZXJtaW5vbG9n
1
eQ%3D%3D
https://www.youtube.com/watch?v=1EPu-
2
G09xyI&pp=ygUQIElEUFMgRGVwbG95bWVudA%3D%3D
https://www.youtube.com/watch?v=uDlqCaBnpq0&pp=ygUNV2lyZWxlc3MgSURQUw%3
3
D%3D
https://www.youtube.com/watch?v=463zDAhN6KE&pp=ygUZSURQUyBEZXRlY3Rpb24g
4
QXBwcm9hY2hlcw%3D%3D
 SEMESTER S7

BIG DATA SECURITY

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

Basic Understanding of
Prerequisites (if any) big Data Course Type Theory

Course Objectives:

1. To provide an understanding of the security challenges associated with Big Data systems.
2. To impart knowledge on securing Big Data environments using various techniques and
frameworks.
3. To explore privacy-preserving mechanisms and compliance with legal regulations in Big Data.
4. To equip students with skills to identify and mitigate threats and vulnerabilities in Big Data.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Introduction to Big Data:
Definition and characteristics: Volume, Velocity, Variety, Veracity, and
Value, Importance of Big Data in modern industries, Security Challenges in
Big Data:- Data breaches, privacy concerns, and compliance issues ,The CIA
triad in the context of Big Data.
1
Big Data Architecture: Hadoop ecosystem: HDFS, Map Reduce, YARN,
8

Apache Spark: Resilient Distributed Datasets (RDDs) and Data Frames,

NoSQL databases: Cassandra, MongoDB.
Case Studies:
Real-world examples of Big Data security breaches and their implications.
Security Mechanisms:
Authentication and Authorization: Kerberos, LDAP,
2
Access Control Frameworks: Apache Ranger, Apache Sentry, Data
8

Encryption: AES, RSA, SSL/TLS for data in transit and at rest.

 Data Privacy Issues -Overview of data privacy in Big Data: PII, sensitive data,
and business data.
Anonymization Techniques: - Techniques like k-anonymity, l-diversity, t-
closeness, Differential Privacy: -Concept, mechanisms, and applications.
Legal and Compliance Frameworks:- Overview of GDPR, CCPA, HIPAA,
and their implications for Big Data,
Threat Landscape: - Common threats: Insider threats, APTs, ransomware, and
DDoS attacks in Big Data.
3
Vulnerabilities: - Vulnerabilities in distributed frameworks: Hadoop, Spark,
10

and NoSQL databases, Security flaws in data aggregation and integration

processes.
Case studies on compliance challenges and solutions.
Risk Management - Risk assessment frameworks and tools specific to Big
Data, Threat modelling: STRIDE, DREAD models for Big Data systems.
Security Best Practices: - Data masking, tokenization, and maintaining audit

4 trails, Secure coding practices for Big Data applications. 10

Security Monitoring and Incident Response:- Security Information and Event
Management (SIEM) for Big Data, Incident response strategies for Big Data
breaches

Course Assessment Method

(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

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

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

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

Part A Part B Total

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

Course Outcomes (COs)

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

Bloom’s
Course Outcome Knowledge
Level (KL)
Understand and articulate the key characteristics of Big Data and athe
CO1 security challenges, including the CIA triad, within Big Data K2
architectures like Hadoop and Apache Spark.
Understand security mechanisms such as authentication, authorization,

CO2 encryption, and anonymization techniques to protect sensitive data K2

within Big Data environments
Understand the implications of major legal frameworks (e.g., GDPR,
CO3 CCPA, HIPAA) on Big Data, identifying common threats and K2
vulnerabilities in distributed systems.
Develop and implement risk management strategies, including threat

CO4 modelling and security best practices, to safeguard Big Data systems and K3
respond effectively to security incidents
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 1 1 1

CO2 3 2 3 2 2

CO3 3 2 2 3 2

CO4 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
Big Data: Principles and Best
Nathan Marz and James 1st edition
1 Practices of Scalable Real-time Warren. Manning Publications
2015
Data Systems
Hadoop Security: Protecting Ben Spivey and Joey 1st edition
2 O’Reilly Media
Your Big Data Platform Echeverria 2015
Hemalatha M, B. K. 1st edition
3 Big Data Security CRC
Tripathy, and L. Sudha. 2021

Reference Books
Name of the Name of the Edition
Sl. No Title of the Book
Author/s Publisher and Year
Security and Privacy in Big Data: Shui Yu and
1 Xiaodong Lin. Springer 1st edition
Volume 1: Foundations
Data-Intensive Text Processing with Jimmy Lin and Chris
2 Morgan & Claypool 1st edition
MapReduce Dyer
Benjamin C. M.
Privacy-Preserving Data Publishing:
Fung, Ke Wang, Ada
3 Anonymization Models, Algorithms, Chapman and Hall 1st edition
Wai-Chee Fu, and
and Applications
Philip S. Yu.
Computer Security: Principles and William Stallings
4 Pearson 4th edition
Practice and Lawrie Brown
 Video Links (NPTEL, SWAYAM…)
Module
Link ID
No.
[Introduction to Big Data (NPTEL)]
1
[Big Data Computing )
Cloud Computing
2
(NPTEL)
3 - [Information Security - V (NPTEL)]
[Information Security - IV (NPTEL)]
4
- [Network Security [NPTEL])
 SEMESTER S7

SECURITY OPERATIONS ANALYSIS

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

Industrial Cyber
Prerequisites (if any) Security , OT Threat Course Type Theory
Prevention

Course Objectives:

1. Enables the learners to Understand the Role of SOC in Industrial Environments.

2. Enables the students to Integrate IT and OT Security Practices.
3. Enables the learners to Leverage Industrial-Specific Threat Intelligence.
4. Enables the learners to Execute Incident Response and Forensics in OT.
5. Enables the learners to Apply Advanced Security Operations Techniques in OT.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
SOC in Industrial Environments
Overview of SOC Operations in OT Environments: Role of SOC in
industrial settings, Challenges of monitoring OT networks vs. IT networks

1 Integration of IT and OT Security Monitoring: Convergence of IT and OT 9

systems, Tools and techniques for unified monitoring.
Incident Detection in OT Networks: Threat vectors and vulnerabilities in
OT environments, Detection techniques for SCADA, PLCs, and ICS
Threat Intelligence for Industrial Cyber Security
Industrial-Specific Threat Intelligence: OT-specific threat intelligence
sources, ISACs and proprietary feeds for industrial environments

2 Vulnerability Management in OT: Identifying and managing OT system 10

vulnerabilities, Challenges in patch management for critical systems
Integrating Threat Intelligence with OT Systems: Correlating threat
intelligence with industrial protocols, Case studies of OT-targeted attacks
 Incident Response and Forensics in Industrial Environments
Incident Response Strategies for OT: Responding to incidents in OT
environments, Balancing operational safety with security response.

3 Forensic Analysis of OT Incidents: Techniques for forensic analysis in OT

11
systems, Data acquisition and analysis from industrial devices.
Coordination with Industrial Stakeholders: Collaborating with engineering
and operations teams, Best practices for communication during OT incidents.
Advanced Security Operations and Continuous Improvement in OT
Advanced Threat Detection in OT: Anomaly detection for industrial
protocols, Machine learning for OT-specific threat detection.
Proactive Security Measures in OT: Threat hunting in OT networks, Red
and purple teaming in industrial settings.
4 10
Security Metrics and Reporting in OT: KPIs for OT security operations,
Reporting to technical and non-technical stakeholders.
Continuous Improvement in OT Security Operations: Post-incident
reviews and OT security audits, Feedback loops for enhancing SOC
capabilities.

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 Proficient in SOC Operations for Industrial Environments. K2
CO2 Skilled in Integrating IT and OT Security. K2
CO3 Capable of Utilizing Industrial-Specific Threat Intelligence. K3
CO4 Prepared for Incident Response and Forensics in OT. K3
Advanced in Implementing Security Operations and Continuous
CO5 K3
Improvement.
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
CO2 3 2 3 3 2 2
CO3 3 3 2 2 3 2 2
CO4 3 3 3 3 2 2 2
CO5 3 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
Industrial Network Security:
Securing Critical Infrastructure
Eric D. Knapp and Joel 2nd edition,
1 Networks for Smart Grid, Syngress
Thomas Langill 2014
SCADA, and Other Industrial
Control Systems
Cybersecurity for Industrial
Tyson Macaulay, Bryan Ist edition,
2 Control Systems: SCADA, CRC Press
L. Singer 2012
DCS, PLC, HMI, and SIS
Applied Cyber Security and the
Smart Grid: Implementing Eric D. Knapp, Raj Ist edition,
3 Syngress
Security Controls into the Samani 2013
Modern Power Infrastructure
Building an Effective
Cybersecurity Program:
Ist edition,
4 Lessons Learned from an Tari Schreider Rothstein Publishing
2017
Industrial Control Systems
Environment

Reference Books
Name of the Name of the Edition
Sl. No Title of the Book
Author/s Publisher and Year
The Industrial Control System Cyber 1st edition,
Liam M. Randall Packt Publishing
1
Security: A Practitioner's Perspective 2020
Practical Industrial Cybersecurity: 1st edition,
2 Philip A. Craig Jr. Packt Publishing
ICS, SCADA, and PLC Security 2017
Josh Diakun, Paul R.
The Security Analyst's Guide to 1st edition,
3 Johnson, and Gary R. Packt Publishing
Splunk 2016
Jefress
 Video Links (NPTEL, SWAYAM…)
Module
Link ID
No.
https://archive.nptel.ac.in/courses/108/105/108105062/
1
https://onlinecourses.nptel.ac.in/noc23_cs127/preview

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

3 https://www.udemy.com/course/incident-response-for-cyber-professionals

https://nptel.ac.in/courses/108/108/108108098/
4
https://nptel.ac.in/courses/106/105/106105217/
 SEMESTER 7

COMPUTER VISION
PECST745
Course Code CIE Marks 40
Teaching Hours/Week
3:0:0:0 ESE Marks 60
(L: T:P: R)
Credits 5/3 Exam Hours 2 Hrs 30 Mins

Prerequisites (if any) None Course Type Theory

Course Objectives:

1. To cover the basics of image formation, key computer vision concepts, methods,
techniques, pattern recognition, and various problems in designing computer vision and
object recognition systems.
2. To enable the learners to understand the fundamentals of computer vision and machine
learning models to develop applications in computer vision.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Fundamentals in Computer Vision :-

Camera Calibration- Pinhole camera model, Geometric Image Features -

Curves, Surfaces, Analytical Image Features - Elements of Analytical

1 Euclidean Geometry, Geometric Camera Parameters, 9

Stereopsis - Binocular Camera Geometry, Epipolar Constraint, Binocular
Reconstruction, Local Methods for Binocular Fusion, Global Methods for
Binocular Fusion.

Features and Filters :-

Linear Filters- Linear Filters and Convolution, Shift Invariant Linear Systems.
Estimating Derivatives with Finite Differences, Noise, Edges and Gradient-

2 based Edge Detectors 9

Image Gradients - Computing the Image Gradient, Gradient Based Edge and
Corner Detection. Filters as Templates - Normalized Correlation and Finding
Patterns.
 Machine Learning for Computer Vision :-

Machine Learning - Introduction, Dataset for Machine Perception- Labelled

and Unlabelled Data, Basics of Classification and Clustering, Multi-Class
Perspective.

Machine Learning for Computer Vision -Machine Learning -Deep Learning

3 9
Use Cases.

Machine Learning Models for Vision - Image Vision-Pretrained Model,

Transfer Learning, Fine-Tuning, Convolutional Networks, Convolutional
Filters, Stacking Convolutional Layers, Pooling Layers - AlexNet, VGG19, ,
Modular architecture - ResNet, Neural Architecture Search Design - NASNet

Segmentation and Object detection :-

Segmentation Using Clustering Methods - Human vision- Grouping and

Gestalt, Applications- Shot Boundary Detection, Background Subtraction,
Image Segmentation by Clustering Pixels- Simple Clustering Methods,
Clustering and Segmentation by K-means
4 9
Object detection - YOLO, Segmentation-Mask R-CNN and Instance
Segmentation, U-Net and Semantic Segmentation, Model Quality Metrics

A case study to compare performance of various models on a suitable

dataset.

Course Assessment Method

(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

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

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

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

Part A Part B Total

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

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

Course Outcomes (COs)

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

Bloom’s
Course Outcome Knowledge
Level (KL)
Understand the basic concepts and terminologies like Camera
CO1 K2
Calibration, Stereopsis in computer vision
CO2 Apply filters for feature extraction and for finding patterns. K3
CO3 Build different machine learning models for computer vision K3
CO4 Implement segmentation and object detection models K3
Analyze different machine learning models for segmentation/object
CO5 K4
detection.
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create

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

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

CO2 3 3 3 3

CO3 3 3 3 3

CO4 3 3 3 3 3

CO5 3 3 3 3 3 3
Note: 1: Slight (Low), 2: Moderate (Medium), 3: Substantial (High), -: No Correlation
 Text Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Computer vision: A modern Forsyth, David, and Jean
1 Prentice hall 2011
approach Ponce

Emerging topics in computer Medioni, Gerard and Sing

2 PHI 2004
vision Bing Kang

Valliappa Lakshmanan,
Practical Machine Learning for
3 Martin Görner, Ryan O'Reilly Media 2021
Computer Vision
Gillard

Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Computer vision: algorithms Springer Science &
1 Szeliski, Richard 2010
and applications Business Media
Image Segmentation:
2 Principles, Techniques, and Tao Lei, Asoke K. Nandi John Wiley & Sons 2022
Applications
Deep Learning in Computer
Ali Ismail Awad,
3 Vision Principles and CRC Press 2020
Mahmoud Hassaballah
Applications

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
1 Computer Vision and Image Processing - Fundamentals and Applications by Prof. M.
K. Bhuyan at IIT Guwahati https://onlinecourses.nptel.ac.in/noc23_ee39/preview
2
Computer Vision by Prof. Jayanta Mukhopadhyay at IIT Kharagpur
3 https://onlinecourses.nptel.ac.in/noc19_cs58/preview

4 Deep Learning for Computer Vision by Prof. Vineeth N Balasubramanian at IIT

Hyderabad https://onlinecourses.nptel.ac.in/noc21_cs93/preview
COVID-Net Open Source Initiative - COVIDx CT-3 Dataset

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

DATA & COMPUTER COMMUNICATION

Course Code PECCT751 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. Enables the learners to understand the Fundamentals of Data Communication and Networking.
2. Enables the students to learn Networking Protocols and Standards.
3. Enables the learners to Explore Emerging Technologies and Trends in Networking.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Fundamentals of Data Communication
Introduction to Data Communication: Basic components: transmitters,
receivers, transmission media, Data flow types: simplex, half-duplex, full-
duplex.

1 Transmission Media: Guided media: twisted pair, coaxial, fiber optics, 10

Unguided media: radio waves, microwaves, infrared.
Data Encoding and Modulation: Digital-to-digital conversion, Analog-to-
digital conversion, Digital-to-analog modulation (ASK, FSK, PSK), Analog-
to-analog modulation (AM, FM, PM).
Network Models and Topologies
Network Models: OSI reference model: layers and functions, TCP/IP model:
layers and functions, Addressing schemes: MAC addresses, IP addresses

2 Network Topologies: Bus, star, ring, mesh topologies: structure, advantages, 9

disadvantages
Basic Networking Devices: Routers, switches, hubs, bridges, and their roles
in a network.
 Data Link Layer and Network Layer Protocols
Data Link Layer Protocols: Error detection and correction: CRC, Hamming
code, Flow control mechanisms: stop-and-wait, sliding window, MAC
3
protocols: CSMA/CD, CSMA/CA, Ethernet. 11
Network Layer Protocols: IPv4 and IPv6 addressing, subnetting, Routing
algorithms: distance vector, link state Routing protocols: RIP, OSPF, BGP.
Transport and Application Layer Protocols
Transport Layer Protocols : TCP , UDP
Application Layer Protocols: DNS, DHCP, HTTP, FTP, SMTP, SNMP
Network Design: LAN and WAN planning, VLANs, wireless technologies
4 11
(Wi-Fi, Bluetooth)
Emerging Technologies and Future Trends in Networking: Cloud
Computing and Data Centers , Internet of Things (IoT) , Edge computing, fog
computing, blockchain, quantum networking (Basic concepts only).

Course Assessment Method

(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

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

5 15 10 10 40

End Semester Examination Marks (ESE)

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

Part A Part B Total

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

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

Bloom’s
Course Outcome Knowledge
Level (KL)
Understand the basics of data communication, including transmission
CO1 K2
media and modulation techniques.

CO2 Explain network models, topologies, and the role of networking devices. K2
Apply data link and network layer protocols for efficient network
CO3 K3
communication.
Analyze the use of transport and application layer protocols in network
CO4 K3
services.
Explore emerging networking technologies and their future
CO5 K2
implications.
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create

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

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

Text Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Data and Computer
1 William Stallings Pearson 10th Edition
Communications
Andrew S. Tanenbaum and
2 Computer Networks Pearson 5th Edition
David J. Wetherall
Data Communications and McGraw-Hill
3 Behrouz A. Forouzan 5th Edition
Networking Education
 Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Communication Networks:
Alberto Leon-Garcia and
1 Fundamental Concepts and Indra Widjaja McGraw-Hill 2nd Edition
Key Architectures
Network Security Essentials:
2 William Stallings Pearson 6th Edition
Applications and Standards

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
https://nptel.ac.in/courses/106/105/106105082/
1
https://nptel.ac.in/courses/117/104/117104117/

https://nptel.ac.in/courses/106/105/106105183/
2
https://nptel.ac.in/courses/106/105/106105081/

https://nptel.ac.in/courses/106/105/106105183/

3 https://nptel.ac.in/courses/106/105/106105082/
https://nptel.ac.in/courses/106/102/106102245/

https://nptel.ac.in/courses/106/105/106105183/
https://nptel.ac.in/courses/106/105/106105166/
4
https://nptel.ac.in/courses/106/106/106106129/
https://nptel.ac.in/courses/115/106/115106086/
 SEMESTER S7

SOCIAL AND ETHICAL ISSUES OF THE INTERNET

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

Basic knowledge of
computer networks and
cybersecurity.
Prerequisites (if any) Course Type Theory
Familiarity with ethical
principles and data
privacy concepts.

Course Objectives:

1. Understand the social and ethical challenges posed by the widespread use of the internet.
2. Analyse legal frameworks and regulations governing digital spaces.
3. Assess the ethical implications of emerging technologies.
4. Develop strategies to address privacy, security, and ethical concerns in the digital world.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Basics of Social and Ethical Issues:
Understanding Ethics in the Digital World - Ethics, Relationship between
ethics and technology. Impact of the Internet on Society - Social consequences
of internet expansion, digital inequality, technology access.

1 Ethical concerns in internet conduct, online communities, and cyberbullying -

10
The significance of online identity and anonymity. Privacy and Monitoring -
Rights to privacy, techniques for surveillance, ethical considerations when
collecting and tracking data.
Case Studies - Ethical issues and scandals involving social media.
Laws and Regulations for the Internet:

2 Internet Governance and Regulations - The worldwide and local laws that
8
govern the internet, comparing self-regulation and government regulation
 (Overview only). Intellectual Property Rights (IPR) -copyright, patents,
trademarks, and their significance in the context of the internet.
Cybercrime and Cyber Law - Different types of cybercrimes, legislation
against cybercrime, digital evidence, and forensic analysis (Detailed study).
Ethical considerations of regulating content, hate speech, and censorship laws
in the debate between Freedom of Speech and Censorship (Overview only).
Case Studies of legal disputes - big companies involved in legal cases,
challenges with determining jurisdiction in cyberspace.
Data Protection and Security:
Principles of data protection, GDPR, and other regulations for ethical data
handling.
Ethical issues in data aggregation and the commercialization of personal data
in Big Data and Surveillance Capitalism.

3 Ethical principles in cybersecurity - Proper disclosure, moral hacking, 10

technologies with both peaceful and problematic applications (Overview
only). User agreement and openness - Consent in gathering data, deceptive
practices, ethical development.
Case Studies - Real-life examples involving data breach and law enforcement
agencies.
Social media, AI, and Emerging Technology Ethics: Ethical Issues in
social media - Content moderation, biased algorithms, and misinformation
(Overview only). Algorithms and Echo Chambers - Combating
misinformation.

4 Digital Identity and Online Reputation - Ethical issues in managing digital 8

identity and online harassment. AI and Emerging Technologies -Ethical
dilemmas in AI, deepfakes, content creation (Overview only).
Case Studies - Social media’s role in election manipulation and AI in content
moderation.

Course Assessment Method

(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

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

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

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

Part A Part B Total

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

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

Bloom’s
Course Outcome Knowledge
Level (KL)
Understand and analyse the ethical implications of technology and the
CO1 K2
internet
Evaluate legal and regulatory challenges associated with internet
CO2 K4
governance and cybercrimes
Critically assess ethical practices in data handling, privacy, and
CO3 K4
cybersecurity
Examine the impact of social media, AI, and algorithms on ethics and
CO4 K3
society
Discuss and propose ethical solutions for challenges posed by emerging
CO5 K4
technologies
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 - 1 - 2 - 3 - - - 2

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

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

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

CO5 3 3 2 3 2 1 - 2 1 1 2 3
Note: 1: Slight (Low), 2: Moderate (Medium), 3: Substantial (High), -: No Correlation
 Text Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Michael J. Quinn 7th Edition,
1 Ethics for the Information Age Pearson
2017

Cyber-ethics: Morality and Law Jones & Bartlett 6th Edition,

2 Richard Spinello
in Cyberspace Learning 2017
Oxford University
3 The Ethics of Information Luciano Floridi 2013
Press

Reference Books
Name of the Name of the Edition
Sl. No Title of the Book
Author/s Publisher and Year
The Ethics of Cybersecurity Markus Christen et al. Springer 2020
1
Cybersecurity Ethics: An 1st Edition,
2 Mary Manjikian Routledge
Introduction 2017

3 AI Ethics Mark Coeckelbergh MIT Press 2020

Data and Goliath: The Hidden Battles
W.W. Norton &
to Collect Your Data and Control Bruce Schneier 2015
4
Your World Company

Internet Governance: The New 2008

5 John Mathiason Routledge
Frontier of Global Institutions

Video Links (NPTEL, SWAYAM…)

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

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

3 https://nptel.ac.in/courses/106104119)

4 https://onlinecourses.swayam2.ac.in/cec21_ge12/preview
 SEMESTER S7

INFORMATION SECURITY IN PUBLIC AND PRIVATE SECTORS

Course Code PECCT753 CIE Marks 40

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

Credits 3 Exam Hours 2 Hrs. 30 Min.

Prerequisites (if any) None Course Type Theory

Course Objectives:

1. The goal of this course is to familiarize students with Security in computing, program security
in the context of Public and private sectors.
2. The topics also cover the familiarization of database security and the methods of administering
security in private and public domains.
SYLLABUS

Module Contact
Syllabus Description
No. Hours
Security Problem in Computing:
The meaning of computer Security, Computer Criminals, Methods of Defense,

1 Elementary Cryptography: Substitution Ciphers, Transpositions, Making 9

“Good” Encryption algorithms, The Data Encryption Standard, The AES
Encryption Algorithms, Public Key Encryptions, Uses of Encryption.
Program Security:
Secure Programs, Non malicious Program Errors, viruses and other malicious
code, Targeted Malicious code, controls Against Program Threats, Protection
in General- Purpose operating system protected objects and methods of
2 9
protection memory and add mens protection, File protection Mechanisms,
User Authentication Designing Trusted O.S: Security polices, models of
security, trusted O.S design, Assurance in trusted O.S. Implementation
examples.
Data base Security:
Security requirements, Reliability and integrity, Sensitive data, Inference,
3
multilevel database, proposals for multilevel security. Security in Network: 9
 Threats in Network, Network Security Controls, Firewalls, Intrusion
Detection Systems, Secure E-Mail.
Administering Security:
Security Planning, Risk Analysis, Organizational Security policies, Physical
Security. Legal Privacy and Ethical Issues in Computer Security: Protecting
4 9
Programs and data, Information and the law, Rights of Employees and
Employers, Software failures, Computer Crime, Praia, Ethical issues in
Computer Security, case studies of Ethics..

Course Assessment Method

(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

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

5 15 10 10 40

End Semester Examination Marks (ESE)

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

Part A Part B Total

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

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

Bloom’s
Course Outcome Knowledge
Level (KL)
CO1 To understand the foundation of security problems in computing Understand
To understand and to employ methods for program security and for
CO2 Apply
protecting files
To understand and to employ methods for database security and for
CO3 Apply
protecting network in public and private domains
Investigate and do administration on Organizational policies and adopt
CO4 Analyze
ethical policies in Security.
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create

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

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 3 2
CO2 3 3 2
CO3 3 3 2
CO4 3 3 2
CO5 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
Charles P.Pfleeger, Shari 5th Edition,
1 Security in Computing PHI
Lawrence Pfleeger 2015

Cryptography and Network 3rd Edition,

2 A. Kahate TMH
Analysis DVD Toolkit 2017
Windows Registry Forensics:
Harlan Carvey Syngress Inc. Edition
3 Advanced Digital Forensic
2,2009
Analysis of the Windows
Registry
Practical Linux Forensics: A Bruce Nikkel
4 Guide For Digital 2021
Investigators
 SEMESTER S7

ENGINEERING OF TRUSTWORTHY SECURE SYSTEMS

Course Code PECCT754 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 address the major questions, challenges, and processes that Systems Security Engineers (SSE)
face in evaluating the cyber risk and resiliency associated with a large-scale system.
2. To develop systems that are more cyber-resilient.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Define key concepts and principles of Systems Security Engineering.
Summarize the role of policies, standards, procedures, and guidelines in
securing systems. Outline the transferable (i.e. soft) and technical skills that
effective Systems Security Engineers embody.
Define the three system security engineering contexts - problem context,
1
solution context, and trustworthiness context SIE 573 5 - as outlined in the 11
System Security Engineering Framework. Identify the systems security
outcomes, tasks, and activities relevant to each process outlined in the System
Life Cycle - Technical, Technical Management, Organizational Project-
Enabling, and Agreement.
Supervisory Control and Data Acquisition (SCADA) system. security
techniques used in Supervisory Control and Data Acquisition (SCADA)
systems. Classification of the 16 Critical Infrastructure (CI) Sectors.

2 Overview and Application of the Risk Management Framework; how to use

9
the Risk Management Framework(RMF).Risk Management Framework
(RMF) activities, tasks, and outcomes. Development of a risk management
assessment utilizing the Risk Management Framework.
 Security and Privacy Controls: Utilize the National Institute of Standards and
Technology (NIST) Security Control Catalog. Select security control
baselines utilizing the guidelines established by the National Institute of
Standards and Technology (NIST), Customize and create overlays of security

3 controls, Documentation the control selection process. 11

Overview and Application of the Cybersecurity Framework (CSF) Navigate
the Cybersecurity Framework (CSF). Utilize the Cybersecurity Framework
(CSF) to manage activities, tasks, and outcomes. Tailor the Cybersecurity
Framework (CSF) to create a security plan.
Cyber Resiliency Considerations: Cyber Resiliency Engineering Framework.
Interpret Cyber Resiliency Goals and Objectives. Describe Cyber Resiliency

4 Goals and Objectives. Differentiate Cyber resiliency techniques, approaches

9
and design principles. Prioritize Cyber resilience in the System Development
Lifecycle (SDLC).
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 ability to develop and apply cyber-related engineering
CO1 Analyse
design considerations.
Identify, formulate, and solve complex engineering problems in Systems
CO2 Apply
Security Engineering and Cyber Resiliency
Recognize and address both ethical and professional responsibilities in
CO3 Understand
cyber policy, standards and engineering.
identifying specific security controls for any shortcomings that may be
CO4 uncovered during a security/compliance assessment as it relates to a Analyse
specific critical infrastructure sector.
Understanding how and where cyber resiliency factors should be
CO5 Understand
considered throughout the SDLC.
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

CO2 3 2 2 2

CO3 3 2 2 2

CO4 3 2 2 2 2

CO5 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
Security and Privacy Controls National Institute of
for Information Systems and Special Publication Fifth Edition
1 Standards and
Organizations,Special 800-53 ,2020
Technology (NIST)
Publication 800-53.
Risk-Management Framework
for Information Systems and National Institute of second
Special Publication
2 Organizations – A System Life Standards and edition,
800-37
Cycle Approach for Security Technology (NIST) 2018.
and Privacy.
National Institute of
Engineering Trustworthy Special Publication First
3 Standards and
Secure Systems 800-160. edition,2022
Technology (NIST)
Developing Cyber-Resilient National Institute of
Special Publication First
4 Systems, A Systems Security Standards and
800-160 edition,2021
Engineering Approach Technology (NIST)

Reference Books
Name of the Name of the Edition
Sl. No Title of the Book
Author/s Publisher and Year
Breyan Mesmer, Incose First edition,
1 Systems Engineering Principles Michael Watson Publications 2022
Principles for Trustworthy Design of Hild D, McEvilley M, MITRE Technical Third
2
Cyber-Physical Systems. Winstead M Report Edition,2021

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
https://www.youtube.com/watch?v=CrLRFn5O_F8&list=PLYwpaL_SFmcArHtWmbs_vXX6soTK3
1 WEJw

https://www.youtube.com/watch?v=XbZE0Xd5Rls&pp=ygU3U3VwZXJ2aXNvcnkgQ29udHJvbCB
2 BbmQgRGF0YSBBY3F1aXNpdGlvbiAoU0NBREEpIHN5c3RlbQ%3D%3D

https://www.youtube.com/watch?v=kbwsxEGYgbs&pp=ygUdU2VjdXJpdHkgYW5kIFByaXZhY3k
3 gQ29udHJvbHM%3D

https://www.youtube.com/watch?v=3DM2FsBSJjY&pp=ygUoIEN5YmVyIFJlc2lsaWVuY3kgRW5n
4 aW5lZXJpbmcgRnJhbWV3b3JrLg%3D%3D
 SEMESTER S7

CYBER THREAT INTELLIGENCE

Course Code PECCT755 CIE Marks 40
Teaching Hours/Week ESE Marks
(L: T:P: R) 60
3:0:0:0
Credits Exam Hours
5/3 2 Hrs. 30 Min.
Prerequisites (if any) Course Type
Nil Theory

Course Objectives:

1. Enables the learners to understand the basics of threat intelligence and how it helps organizations
protect their data.
2. Enables the learners to identify and manage different threat vectors and use scanning tools to detect
vulnerabilities.
3. Enables the learners to gain insights into securing applications and applying security measures
throughout the development process.
4. Enables the learners to explore how SIEM platforms work, utilize AI and user behavior analytics
in security, and practice threat hunting techniques.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Threat intelligence overview
Definition, Strategy and external sources, How organisation use CTI, Role of
CTI analyst, Threat intelligence platforms, Threat intelligence frameworks,

1 Security intelligence.
11
Data security and protection
Data security challenges, common pitfalls, Industry specific data security
challenges, Data protection capabilities
Threat vectors and scanning
Threat vector, types of threat vector, mitigate risk from threat vector, scanning,
2
types of scanning, port scanning, network protocol analyser, vulnerability 8
assessment tools.
 Application security and testing
Characteristic of security architecture, High level architectural models,

3 security patterns, Application security overview, Application security

10
standards and regulations, DevsecOps overview, DevsecOps Deployment,
Application security Defects, Effective defenses.
SIEM platforms and Threat Hunting
SIEM concepts and Benefits, SIEM Deployment, SIEM Solutions, vendors,

4 User behaviour analytics, AI and SIEM, Apply AI concepts, Apply user 10

behaviour analytics,AI and Cyber security, Apply AI to SIEM, Mitigate
upcoming future attacks with Cyber threat Hunting.

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

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 sub divisions. Each 60
each carrying 3 marks question carries 9 marks.
(8x3 =24marks) (4x9 = 36 marks)
 Course Outcomes (COs)

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

Bloom’s
Course Outcome Knowledge
Level (KL)
CO1 Understand Threat Intelligence. K2
CO2 Identify and Mitigate Threat Vectors. K3

CO3 Apply Application Security Measures. K3

CO4 Utilize SIEM Platforms. K2

CO5 Incorporate AI and Threat Hunting. K3

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

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

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

CO2 3 2 2 2 2

CO3 3 3 2 2 1 2

CO4 3 3 3 3 1 2 2 2

CO5 3 3 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
The Threat Intelligence
Handbook: A Practical Guide Recorded Future Ist Edition,
1 for Security Teams to Recorded Future
(Company) 2020
Unlocking the Power of Threat
Intelligence
6th Edition,
2 Network Security Essentials William Stallings Pearson
2019
Application Security Program:
A Practical Guide to Ist edition,
3 A. Michael Houghton CRC Press
Implementing Secure Software 2020
Development Lifecycle
Security Information and Event
Ist edition,
4 Management(SIEM) David Miller Packt Publishing
2019
Implementation
 Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Practical Malware Analysis:
Michael Sikorski and Ist Edition,
1 The Hands-On Guide to No Starch Press
Andrew Honig 2012
Dissecting Malicious Software
The Web Application Hacker's
Dafydd Stuttard and 2nd Edition,
2 Handbook: Discovering and Wiley
Marcus Pinto 2011
Exploiting Security Flaws
Practical Threat Hunting:
Ist Edition,
3 Detecting and Responding to Aditya K. Sood Springer
2020
Cyber Attacks

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
https://www.coursera.org/specializations/intro-cyber-security
1
https://www.udemy.com/course/cyber-threat-intelligence/

2 https://www.coursera.org/learn/network-security

3 https://www.udemy.com/topic/web-application-security-tester

4 https://www.udemy.com/course/cyber-security-soc-analyst-training-siem-splunk-60-hrs
 SEMESTER 7

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 Common Methods of Malware Propagation- Email Attachments, Malicious 9

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

4 on 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)
Explain the attacks, security mechanisms and services to user
CO1 K2
information
CO2 Identify the cybercrimes and discuss the cyber laws against the crimes K2
CO3 Discuss the malwares and the protection mechanisms against malwares K3
CO4 Describe the issues and solutions related with mobile applications K2
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create
 CO-PO Mapping Table (Mapping of Course Outcomes to Program Outcomes)

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

CO2 2 3 2 2

CO3 2 3 2 2

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

Reference Books
Sl. Name of the Name of the Edition
Title of the Book
No Author/s Publisher and Year
Computer Security: Principles and
1 William Stallings Pearson 5/e, 2011
Practices
Cyber Security- Understanding Cyber
Nina Godbole,
2 Crimes, Computer Forensics and Legal Wiley 1/e, 2011
Sunit Belapure
Perspectives
Computer and Cyber Security: B.B.Gupta, D.P
3 Principles, Algorithm, Applications, and Agrawal, Haoxiang CRC Press 1/e, 2018
Perspectives Wang.
James Graham,
4 Cyber Security Essentials Richard Howard, Auerbach 1/e, 2010
Ryan Otson

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
1 https://archive.nptel.ac.in/courses/111/101/111101137/
2 https://jurnal.fh.unila.ac.id/index.php/fiat/article/download/2667/1961/12044
https://www.coursera.org/learn/data-security-privacy#modules
3 https://nptel.ac.in/courses/106105217
4 https://archive.nptel.ac.in/courses/106/106/106106156/
 SEMESTER 7

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 8
Technology, Cloud Architecture, Cloud Modelling and Design.
Virtualization - Foundations, Grid, Cloud And Virtualization,
Virtualization And Cloud Computing; Data Storage And Cloud
2 9
Computing - Data Storage, Cloud Storage, Cloud Storage from LANs
to WANs.
Cloud Computing Services - Cloud Computing Elements,
Understanding Services and Applications by Type, Cloud Services;
3 10
Cloud Computing and 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
4 9
the 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/ 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)

Articulate the fundamental concepts of cloud computing, its types,

CO1 K2
and how cloud computing architecture operates.

Understand and describe the foundations of virtualization, its

CO2 K2
relationship with cloud computing.

Describe various cloud computing services, understand the

CO3 K3
different service models, and identify potential risks.

Demonstrate proficiency in using cloud computing tools such as

CO4 Apache Hadoop, and deploy applications using popular cloud K3
platforms.

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

PO
PO1 PO2 PO3 PO4 PO6 PO7 PO8 PO9 PO10 PO11 PO12
5

CO1 2 2 2 2

CO2 2 2 2 2 2

CO3 2 2 2 2 2

CO4 2 2 2 2 2

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

Text Books

Name of the Name of the Edition

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

1 Cloud Computing: A Practical Approach for A.Srinivasan,

Pearson 1/e, 2014
Learning and Implementation J.Suresh

Reference Books

Name of the Edition

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

Cloud Computing : Concepts,

1 Technology, Security, and Thomas Erl Pearson 2/e, 2023
Architecture

Cambridge University
2 Cloud Computing Sandeep Bhowmik 1/e, 2017
Press

Cloud Computing: A Hands-On Arshdeep Bahga and

3 Universities Press 1/e, 2014
Approach Vijay Madisetti

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.

1 https://onlinecourses.nptel.ac.in/noc21_cs14/preview
 SEMESTER 7

SOFTWARE ENGINEERING
Course Code OECST723 CIE Marks 40

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

Credits 3 Exam Hours 2 Hrs. 30 Min.

Prerequisites (if any) None Course Type Theory

Course Objectives:

1. To Provide fundamental knowledge in the Software Development Process including Software

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

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Introduction to Software Engineering and Process Models - Software
engineering, Software characteristics and types, Layers of Software Engineering-
Process, Methods, Tools and Quality focus. Software Process models –
Waterfall, Prototype, Spiral, Incremental, Agile model – Values and Principles.
1 9
Requirement engineering - Functional, Non-functional, System and User
requirements. Requirement elicitation techniques, Requirement validation,
Feasibility analysis and its types, SRS document characteristics and its structure.

Case study: SRS for College Library Management Software

Software design - Software architecture and its importance, Software

architecture patterns: Component and Connector, Layered, Repository, Client-
Server, Publish-Subscribe, Functional independence – Coupling and Cohesion
2 10
Case study: Ariane launch failure

Object Oriented Software Design - UML diagrams and relationships– Static

and dynamic models, Class diagram, State diagram, Use case diagram, 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 10
Overview of DevOps and Code Management - Code management, DevOps
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 7
Software Project Management - Planning, Staffing, Organisational structures,
Scheduling using Gantt chart. Software Configuration Management and its
phases, Software Quality Management – ISO 9000, CMM, Six Sigma for
software engineering.
 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)

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 Addison-Wesley
3 Helm, Ralph 1/e, 2009
Reusable Object Oriented Software
Johnson,John Vlissides

Reference Books

Name of the Name of the Edition

Sl. No Title of the Book
Author/s Publisher and Year
Pankaj Jalote’s Software Engineering:
1 Pankaj Jalote Wiley India 1/e, 2024
With Open Source and GenAI

Waman S
2 Software Engineering: A Primer Tata McGraw-Hill 1/e, 2008
Jawadekar

Object-Oriented Modelling Michael Blaha,

3 Pearson Education. 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.

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

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 9
IPv6; Unicast Routing Protocols- Distance Vector Routing, Link State Routing
Multicast Routing Protocols.
Transport Layer:-
Transport Layer Protocols- UDP, TCP; Congestion Control- Open Loop Vs
Closed Loop Congestion Control, Congestion Control in TCP; Application
4 8
Layer - Application Layer Paradigms, Client-server applications, World Wide
Web and HTTP, FTP. Electronic Mail, DNS; Peer-to-peer paradigm - P2P
Networks.
 Course Assessment Method
(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

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

5 15 10 10 40

End Semester Examination Marks (ESE)

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

Part A Part B Total

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

Course Outcomes (COs)

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

Bloom’s
Course Outcome Knowledge
Level (KL)
Comprehend the OSI and TCP/IP models, the functioning of different network
CO1 K2
layers, and the protocol stack used in computer networks.
Evaluate various transmission media (copper, fiber, wireless), error
detection/correction methods, and medium access control mechanisms in both
CO2 K2
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 mechanisms,
and understand client-server and peer-to-peer applications like HTTP, FTP,
CO4 K3
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
1 Computer Networks: A Top- Behrouz A Forouzan McGraw Hill SIE, 2017
Down Approach

Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Computer Networks, A Systems L. L. Peterson and B. S.
1 Morgan Kaufmann 5/e, 2011
Approach Davie
Sameer Seth
2 TCP/IP Architecture, design,
M. Ajaykumar Wiley 1/e, 2008
and implementation in Linux
Venkatesulu

3 Computer Networks Andrew Tanenbaum Pearson 6/e, 2021

Computer Networking: A Top-

4 J. F. Kurose and K. W.
Down Approach Featuring Pearson Education 8/e, 2022
Ross
Internet

Video Links (NPTEL, SWAYAM…)

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

MOBILE APPLICATION DEVELOPMENT

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

Course Code OECST725 CIE Marks 40

Teaching Hours/Week
3:0:0:0 ESE Marks 60
(L: T:P: R)
Credits 0 Exam Hours 2 Hrs. 30 Min.
GXEST204 OR
Prerequisites (if any) Course Type Theory
OECST615

Course Objectives:

1. To impart a Comprehensive Mobile Development Knowledge

2. To give Proficiency in Flutter and Dart, UI/UX Design Skills
3. To present the Industry Practices and Deployment such as app security, testing.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Fundamentals of Mobile Application Development:
Introduction to Mobile Application Development, Overview of Mobile
Platforms: iOS and Android, Introduction to Flutter: History, Features, and
1 Benefits, Setting Up the Flutter Development Environment*, Mobile App 9
Architectures (MVC, MVVM, and BLoC), Basics of Dart Programming
Language.

User Interface Design and User Experience:

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

2 Using Flutter Widgets: StatelessWidget and StatefulWidget, Layouts in Flutter: 9

Container, Column, Row, Stack, Navigation and Routing in Flutter, Customizing
UI with Themes and Styles.

Advanced Flutter Development:

3 9
State Management in Flutter: Provider, Riverpod, and BLoC
 Networking in Flutter: HTTP Requests, JSON Parsing, RESTful APIs

Data Persistence: SQLite, SharedPreferences, Hive

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

Industry Practices and App Deployment:

Advanced UI Components and Animations, App Security Best Practices,

4 Testing and Debugging Flutter Applications, Publishing Apps to Google Play 9

Store and Apple App Store, Industry Trends and Future of Mobile Development
with Flutter

Course Assessment Method

(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

Internal Internal
Assignment/ 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 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 data persistence in Flutter apps. K3

Apply security best practices in mobile app development and debug Flutter
CO4 applications effectively. 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

CO2 3 3 3 3 3 3

CO3 3 3 3 3 3 3

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

Text Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
1 Flutter Cookbook Simone Alessandria Packt 2/e, 2023

2 Flutter for Beginners Alessandro Biessek Packt 1/e, 2019

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

Sl.No. Link ID
1 https://www.youtube.com/watch?v=VPvVD8t02U8
 SEMESTER 8
COMPUTER SCIENCE AND ENGINEERING
(CYBER SECURITY)
 SEMESTER S8
IPR AND CYBER LAWS
Course Code PECCT861 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. A comprehensive understanding of the fundamental concepts of cyberspace and cyber law,

enabling them to analyse and address the challenges of regulating and securing the digital
world.
2. To understand cybercrime, cyber ethics, and ethical issues in emerging technologies,
enabling them to tackle related challenges effectively.
3. To equip students with a clear understanding of information security policies, legal frameworks
like the IT Act, and intellectual property rights related to technology.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Fundamentals of Cyber Law and Cyber Space

Introduction to cyber law,Contract Aspects in Cyber Law, Security

Aspects of Cyber Law, Intellectual Property aspect in Cyber Law and
Evidence aspect in Cyber Law, The criminal aspects in Cyber Law, Need
1 for Indian Cyber Law.
12
Cyberspace- Web space, Web hosting and web Development agreement,
Legal and Technological Significance of domain Names, Internet as a
tool for global access.

Cybercrime and Cyber Ethics

2 Introduction to cyber crime- Defintion and Origins of Cyber crime-

10
Classifications of Cybercrime, Cyber Offences- Strategic Attacks, Types of
 Attacks, Security Challenges Faced by Mobile Devices. Organizational
Measures for Handling Mobile Phones.

Ethics in the Information Society- Principles, Participation, People,

Profession, Privacy, Piracy, Protection, Power, Policy
Security Policies and Information Technology Act

Need for an Information Security policy, Information Security Standards-

3 ISO, Introducing various security policies and their review 9

process,Information Technology Act, 2000, Penalities, Adjudication and
appeals under the IT Act,2000, Offences under IT Act, 2000, Right to
Information Act, 2005, IT Act,2008 and its amentments.
Introduction to IPR

Meaning of property, Origin, Nature, Meaning of Intellectual Property

Rights -Copyright in Internet - Multimedia and Copyright issues, Software
Piracy, Patents- Understanding Patents, European Position on Computer
4 related Patents, Legal position of U.S.on Computer related Patents, Indian
10
Position on Computer related Patents, Trademarks -Trademarks in Internet,
Domain name registration - Domain Name Disputes & WIPO, Databases in
Information Technology - Protection of databases, Position in USA, EU and
India.

Course Assessment Method

(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

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

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

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

Part A Part B Total

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

Course Outcomes (COs)

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

Bloom’s
Course Outcome Knowledge
Level (KL)
Describe the concepts of cyber law and the various components and
CO1 K2
challenges associated with cyberspace.
Understand cybercrime classifications, mobile security challenges, and
CO2 K2
key ethical principles in information society.
Understand the need for information security policies, key ISO
CO3 standards, and the legal framework of the IT Act, including penalties, K2
appeals, and amendments.
Describe copyright and patent issues in IT, including software piracy,
CO4 trademarks, domain name disputes, and database protection, with a focus K2
on legal perspectives in the U.S., EU, and India.
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create
 CO-PO Mapping Table (Mapping of Course Outcomes to Program Outcomes)

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

Reference Books
Name of the Edition and
Sl. No Title of the Book Name of the Author/s
Publisher Year
Cyber Security and Cyber Nilakshi Jain, Ramesh
1 Wiley 2020
Laws Menon
Surya Prakash Tripathi,
Introduction to Information
2 Ritendra Goel, Praveen Dreamtech Press 2014
Security and Cyber Laws
Kumar Shukla
Universal Law
3 Cyber Laws Justice Yatindra Singh 2016.
Publishing
Cyber Ethics 4.0: Serving Christoph
4 Humanity with Values Stückelberger , Pavan Springer 2020
Duggal
Cyber Laws: Intellectual
First
5 property & E Commerce, K. Kumar Dominant Publisher
Edition,2011
Security

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
1 https://www.wbnsou.ac.in/NSOU-MOOC/mooc_cyber_security.shtml
2 https://onlinecourses.swayam2.ac.in/cec22_lw07/preview

3 https://www.coursera.org/learn/data-security-privacy#modules
4 https://jurnal.fh.unila.ac.id/index.php/fiat/article/download/2667/1961/12044
 SEMESTER S8
SECURITY IN WIRELESS NETWORKS
Course Code PECCT862 CIE Marks 40
Teaching Hours/Week
3:0:0:0 ESE Marks 60
(L: T:P: R)

Credits 3 Exam Hours 2 Hrs. 30 Min.

Prerequisites (if any) None Course Type Theory

Course Objectives:

1. This course covers the overview of wireless network

2. Also give the ideas about security WLANs and wireless networks
SYLLABUS

Module Contact
Syllabus Description
No. Hours
Overview of Wireless Networks

Introduction to wireless LANs - IEEE 802.11 WLANs - Physical Layer-

MAC sublayer-MAC Management SublayerWireless ATM - HIPERLAN -
HIPERLAN 2, WiMax, Wireless Local Loop (WLL). Migration path to
1 UMTS, UMTS Basics, Air Interface, 3GPP Network Architecture,
CDMA2000 overview- Radio and Network components, Network structure. 11
4G features and challenges, Technology path, IMS Architecture,
Convergent Devices, 4G technologies, Advanced Broadband Wireless
Access and Services.
Foundation

Introduction to security of existing and emerging wireless networks, 9

2
Introduction to cryptographic algorithms and protocols, Introduction to
game theory, Case studies: cellular, WiFi, Bluetooth, MANET, VANET et
Security in Wireless LANs

3 Authentication methods, Cross Domain Mobility Adaptive Authentication, 5

AAA Architecture and Authentication for wireless LAN Roaming,
Experimental Study on Security Protocols in WLANs
 Security of wireless networks

4 GSM, UMTS, WEP, IEEE 802.11i, Public Wifi hotspots, Bluetooth; 7

Vehicular Ad-hoc Networks: vulnerabilities, challenges, Security
architecture

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 wireless network K2
CO2 Demonstrate fundamental techniques of secure wireless systems K3
Examine security threats in wireless networks and design strategies to K4
CO3
manage network security
CO4 Understand the Security of wireless networks K2

CO5 Understand the vulnerabilities of vehicular Ad-hoc networks 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 1 1 1 2 2

CO2 2 3 2 1 2

CO3 2 1 2 2 1 1

CO4 2 2 2 1 1 2

CO5 2 1 1
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
Wireless Communications and 1st Edition,
1 William Stallings Prentice Hall
Networks 2004
Levente Buttyan
Security and Cooperation in (BME) and Jean- 1st Edition,
2 Cambridge University
Wireless Networks Pierre Hubaux 2007
(EPFL)
Security and Cooperation in
Wireless Networks: Thwarting Butty L. &Hubaux J. 1st Edition,
3 Cambridge University
Malicious and Selfish Behavior in P 2007
the Age of Ubiquitous Computing
Mobile and Wireless Network K Makki, P 1st Edition,
4 Springer
Security and Privacy Reiher,et. all. 2007
 Reference Books
Name of the Edition and
Sl. No Title of the Book Name of the Author/s
Publisher Year
Clint Smith. P.E., and 2nd Edition,
1 3G Wireless Networks Tata McGraw Hill
Daniel Collins 2007
Wireless and Mobile Network Pallapa Venkataram, 1st Edition,
2 Tata McGraw Hill
Security Satish Babu 2010
Wireless Security-Models, Tata McGraw – 1st Edition,
3 Nichols and Lekka
Threats and Solutions Hill, New Delhi 2006
Prentice Hall, New 1st Edition,
4 Security in Computing Charles P. Fleeger
Delhi 2009

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
1 https://youtu.be/pnunzdvezto?feature=shared
2 https://youtu.be/jSsehESW37c?feature=shared

3 https://youtu.be/YNmLYQWjYUY?feature=shared

4 https://youtu.be/bur9hq_abog?feature=shared
 SEMESTER S8

SECURE MOBILE APPLICATION DEVELOPMENT

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

A sound knowledge
Prerequisites (if any) Course Type Theory
in Java.

Course Objectives:

1. To understand mobile systems, interfaces, and the Android framework for app development.
2. To understand implementation of 2D graphics and multimedia techniques in Android
applications.
3. To explore mobile embedded system architecture and scheduling algorithms.
4. To understand application of data storage techniques and leverage mobile cloud computing in
app deployment.

SYLLABUS
Module Contact
Syllabus Description
No. Hours
Overview of Mobile App and Mobile Interface

Mobile Systems Overview, Mobile Interface and Application Optimizations,

Mobile Embedded System Basics, Mobile Cloud Computing Concepts, Big
Data Applications in Mobile Systems, Data Security and Privacy Protection in
Mobile Systems, Introduction to Mobile Apps (Android Focus), Android
1
Framework Setup, Key Concepts of Android: App Components, Resources,
9
Manifest

Case Study: Snapchat Data Breach (2014) - Analysing the vulnerabilities in

mobile systems that led to privacy violations, focusing on how improper data
security and privacy protection practices contributed to the breach.
 2D Graphics and Multimedia in Android Introduction to 2D Graphics
Techniques in Android, Advanced UI Design, Multimedia in Android: Audio
and Video Implementation

Mobile Embedded System Architecture

2 Embedded Systems Architecture, Scheduling Algorithms: FCFS, SJF,

Multiprocessor, Priority Scheduling, Memory Technology in Mobile 9
Systems, Messaging and Communication Mechanisms

Case Study: Stagefright Vulnerability in Android (2015) - Examination of

how multimedia components, particularly Android’s handling of video,
opened vulnerabilities for remote code execution attacks.
Data storage and SQLite Operations

Internal and External Storage in Android, Secure File Management: Saving,

Deleting, and Querying Space
SQLite Database: Table Structure and CRUD Operations, Secure SQLite
3 9
Operations, Content Provider and Secure Data Access

Case Study: Evernote Security Breach (2013) - Focus on how weak data
storage security led to breaches in a popular note-taking app, and how secure
SQLite operations could have mitigated the attack.
Mobile Cloud Computing in Mobile Applications Deployment

Mobile Cloud Computing Concepts, Differences Between Cloud and Mobile

Cloud Computing
Mobile Computing Architecture: Wireless LAN, WAN, Cellular Networks
Techniques for Mobile Cloud: Virtualization, Parallel Programming,
4 Distributed Storage, Mobile Cloud Computing Architecture, Security
9
Challenges in Mobile Cloud, Best Practices for Secure Mobile App
Deployment

Case Study: iCloud Hack (2014) - Analysis of how mobile cloud security
vulnerabilities exposed user data and what strategies could be used to prevent
such breaches in mobile cloud environments.
 Course Assessment Method
(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

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

5 15 10 10 40

End Semester Examination Marks (ESE)

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

Part A Part B Total

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

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

Bloom’s
Course Outcome Knowledge
Level (KL)
Describe the concepts, security challenges in mobile system and mobile K2
CO1
applications
Understand the implementation of 2D graphics, Graphical User K2
CO2
Interface and incorporation of multimedia in Android applications
Explain the concepts of general and Android based mobile embedded K2
CO3 systems and its application, processor technology and scheduling
algorithms
CO4 Illustrate the storage of data from mobile applications to a mobile device K2

CO5 Describe the techniques employed in mobile cloud K2

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

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

Text Books
Name of the Name of the
Sl. No Title of the Book Edition and Year
Author/s Publisher
Mobile Applications
Meikang Qiu,
Development with Android
1 Wenyun Dai, and Taylor and Francis
Technologies and
Keke Gai,
Algorithms
Himanshu Dwivedi,
Mobile Application McGraw-Hill
2 David Thiel, and
Security
Chris Clark
Education

Reference Books
Name of the Edition and
Sl. No Title of the Book Name of the Author/s
Publisher Year
Mobile Applications: Design,
1 Development, and Tejinder S. Randhawa Springer 2022
Optimization

Android Boot Camp for

Developers using Java, a Course Technology
2 Corinne Hoisington 2017
Beginner's Guide to Creating Inc
Your First Android Apps

Android Application Cengage 2013

3 Development for Java James C. Sheusi
Programmers
 Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
1 https://youtu.be/rjcpzn7ty0o

2 https://youtu.be/-j1wISEOXYc
3 https://youtu.be/b1AgSvtl03g

4 https://youtu.be/LcAPj95KeSA
 SEMESTER S8

NETWORK FORENSICS

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

5. Identify the significance and principles underlying networking concepts and protocols
6. Explain Network Forensics and its importance and understand Security issues of network
communications.
7. Understand network forensics tools and techniques and evaluate procedure for network
forensics investigation.
8. Comprehend wireless basics, authentication types, and attacks on wireless networks.
SYLLABUS

Module Contact
Syllabus Description
No. Hours
Basics of Computer Networks- Definition of Network, Need of Networks,
Protocol, Types of Networks- LAN, MAN, WAN. Network Components-
Twisted Pair Cable, Coaxial cable, Fiber Optic Cables, Network Interface
1 Card, HUB, Switch, Router. OSI model and TCP/IP protocol suite,
Introduction Network Protocols- IP, TCP, UDP, DHCP, DNS. Types of 9
Topologies- RING, STAR, BUS, MESH (features, advantages,
disadvantages). Classification by Component: Peer to Peer, Client/ Server.
Overview of Network Forensics: Definition, Process of Network Forensics,
Importance, Advantages and Disadvantages, Application of Network
2 Forensics. Network threats and vulnerabilities:
Types of network attacks- eavesdropping, spoofing, modification, Cross-site 9
scripting, DNS Spoofing, Routing Table Page Poisoning, ARP Poisoning,
 Web Jacking. Social Engineering Attacks and its types. Types of network
forensics investigations: Incident Response and Proactive Investigations
Identifying sources of evidence- Digital devices, Network traffic, Cloud
environments, Steps for handling evidence. Data acquisition methods-
Network traffic capture, Log file analysis, Memory acquisition, List Packet
capture tools. Introduction to Data Preservation Technique- Write-blocking,
Data encryption, Data hashing, Metadata preservation.
Network Traffic Analysis Methods- Flow analysis, Packet analysis, Deep
3 9
packet inspection (DPI), and Network behavior analysis.
Identifying sources of evidence, learning to handle the evidence, collecting
network traffic using tcpdump, Collecting network traffic using Wireshark,
Collecting network logs, Acquiring memory using FTK Imager, Tapping into
network traffic: Packet sniffing and analysis using Wireshark, Packet sniffing
and analysis using NetworkMiner.
Introduction to Wireless Networks: Basics of wireless (IEEE 802.11)
communication and security challenges.
Types of Authentications: WEP, WPA and WPA-2 Encryption. Attacks on
Wireless networks: Man-in-the middle (MITM), Brute-Force, Evil Twin,
Rogue access points, Phishing, Wireless Jamming (Denial-of-Service
4
Attacks), Wireless Eavesdropping. 9
Legal challenges in network forensics: Authorization, Privacy, Data
Preservation, Disclosure, Cross-Border Investigations. Digital Personal Data
Protection Act,2023: Introduction, Data, Data Fiduciary, Data Principal, Data
Processor, Personal Data Breach, Need of DPDP, Key Features of DPDP

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 Illustrate the Basics of Networking Concepts and Protocols Understand
Describe the significance of network forensics and the security concerns Understand
CO2
associated with network communications.
Describe the process of evidence handling, data acquisition methods, Analyse
CO3
and Network Traffic Analysis methods
Comprehend wireless basics, authentication types, and attacks on Understand
CO4
wireless networks
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create

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

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 2 2
CO2 3 2 2
CO3 3 2 2
CO4 3 2 2
CO5 3 2 2 2 2 2
Note: 1: Slight (Low), 2: Moderate (Medium), 3: Substantial (High), -: No Correlation
 Text Books
Name of the Name of the
Sl. No Title of the Book Edition and Year
Author/s Publisher
Learning Network
1 Samir Datt PACKT Publications , ISBN: 9781782174905
Forensics
Meghanathan, N.,
Tools and techniques for arXiv preprint
2 Allam, S. R., & 2010
network forensics arXiv:1004.0570.
Moore, L. A.
3 Network Forensics Ric Messier Wiley ISBN: 9781119328285
(2012)(Vol. 2014).
Network forensics:
Davidoff, S., & ISBN: 9780132565110
4 tracking hackers through Pearson
Ham, J. Upper Saddle River:
cyberspace
Prentice Hall.

Reference Books
Name of the Edition and
Sl. No Title of the Book Name of the Author/s
Publisher Year
Introduction to Security and CRC press
1 William J. Buchanan 2011
Network Forensics publications.
March 2019
2 Hands-On Network Forensics Nipun Jaswa PACKT Publications ,ISBN
9781789344523
December
CRC press 2021
3 Network Forensics Anchit Bijalwan
publications. 978-
0367493615

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
1 https://youtu.be/VwN91x5i25g?feature=shared
2 https://youtu.be/VklrX2IfCNk

3 https://youtu.be/VklrX2IfCNk?feature=shared
4 https://youtu.be/U_cl7QqCF3c?feature=shared
 SEMESTER S8

WINDOWS AND LINUX FORENSICS

Course Code PECCT866 CIE Marks 40

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

Credits 3 Exam Hours 2 Hrs. 30 Min.

Prerequisites (if any) None Course Type Theory

Course Objectives:

1. The goal of this course is to familiarize students with Windows and Linux OS forensic
analysis in the context of Disk Forensics.
2. The topics also covers the familiarization of different tools which may explore new
3. ways to approach problems in the fields of digital forensic analysis.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Digital investigation foundation: Digital investigations and evidence,
Digital crime scene investigation process, Data analysis, overview of
toolkits.
1
Computer foundations- Data organizations-booting process-Hard
9
disk technology- Hard disk data acquisition-introduction- reading the
source data-writing the output data.

Live Response: Data Collection Introduction, Live Response- Locard’s

Exchange Principle, Order of Volatility, When to Perform Live Response,
What Data to Collect, System Time, Logged-on Users, Open Files, Network
2
Information, Network Connections Process Information-, Process-to-Port
Mapping, Process Memory,

Network Status, Nonvolatile Information, Live Response Methodologies.

7
 Collecting Process Memory, Dumping Physical Memory, Analyzing a
Physical Memory Dump File Metadata, File Signature Analysis, NTFS
Alternate Data Streams, Executable File Analysis: Static Analysis,
3 Dynamic Analysis.

Registry Analysis: System Information, Auto Start Locations, USB

Removable Storage Devices, Mounted Devices, Portable Devices. 9

Finding Users, Tracking User Activity.

Linux Overview, Modern Linux Systems, Forensic Analysis of Linux

Systems, Linux File Types and Identification. Linux File Analysis, Crash
4
and Core Dumps, Investigating Evidences From Linux 9

Logs, Network Configuration Analysis, Network Security Artifacts.

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)
To understand the foundation of digital investigation and methods of Understand
CO1
data analysis.
Tools and utilities can be used to collect and analyze live response data Analyse
CO2
from questionable machines.
CO3 Conduct research and investigation in the disk forensic sector. Create
investigate and do research on Linux systems in order to create forensic Create
CO4
tools.
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create

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

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 2 2
CO2 3 2 2
CO3 3 2 2
CO4 3 2 2
CO5 3 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
Windows Forensic Harlan Carvey Syngress Inc. Edition
1
Analysis DVD Toolkit 2,2009
Windows Registry Forensics:
Advanced Digital Forensic Harlan Carvey Syngress Inc. Edition
2 Analysis of the Windows 2,2009
Registry
Practical Linux Forensics: A Bruce Nikkel
3 Guide For Digital 2021
Investigators
 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; Introduction
1 10
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 AR/VR
2 Environments, Spatial design principles, Immersion and presence in AR/VR, 10
User interface (UI) design for AR/VR; Prototyping and Testing - Rapid
prototyping technique, Usability testing methods, Iterative design and
feedback loops.

3 Advanced Interaction Techniques :- 13

 Gesture - Designing for gesture-based interaction, Implementing gesture
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
4 projects; Evaluating AR/VR Experiences - Evaluation methods and metrics, 11
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, 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 =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 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 emerging K5
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
Dieter Schmalstieg and
Augmented Reality: Principles and
3 Tobias Hollerer Pearson 1/e, 2016
Practice
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
Robert Scoble and Shel
The Fourth Transformation: How
Israel Patrick
7 Augmented Reality & Artificial 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 for Springer 1/e, 2019
Timothy Jung
Business

Video Links (NPTEL, SWAYAM…)

Sl.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 ALGORITHMS
(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
1 Complexity-Best, worst and Average Case Complexities- Complexity 9
Calculation of simple 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-
2 recursive), applications. Binary search tree – creation, insertion and 9
deletion and search 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 Abstraction, Fractional Knapsack Problem, 9
3
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
4 Path Algorithm - Floyd-Warshall Algorithm; The Control Abstraction of 9
Backtracking – The N-Queens Problem. Branch and Bound Algorithm
for Travelling Salesman Problem.

Course Assessment Method

(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

Internal Internal
Assignment/ 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)

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 K3
algorithms, and shortest paths with Dijkstra’s algorithm.

Understand the concepts of Dynamic Programming, Backtracking

CO5 K2
and Branch & Bound

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

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

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

CO1 3 3 3 1

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.
1 Introduction to Algorithms Leiserson, R. L. Rivest, C. Prentice-Hall India 4/e, 2022
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

Robert Sedgewick, Kevin

2 Algorithms Pearson 4/e, 2011
Wayne

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

Video Links (NPTEL, SWAYAM…)

Sl.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 9

Elements:, 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 ,

2 Nested Functions , The Document Object Model (DOM) - Nodes and 9

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
3 9
PHP , Object-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
4 9
Layering , 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 ReactJS
2 Chris Minnick Wiley 1/e, 2022
- An Approachable Guide
Internet & World Wide Web - How to Paul J. Deitel, Harvey M.
3 Pearson 1/e, 2011
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

1 coverage criteria; Types of Testing - Unit, Integration, System, 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:-

2 Unit Testing- Static and Dynamic Unit Testing, control flow testing, data 8
flow testing, domain testing; Mutation Testing- Mutation operators,
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
3 complex structures (e.g., loops, exceptions); Graph Coverage for Design 10
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/ 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)
Demonstrate the ability to apply a range of software testing
CO1 K2
techniques, including unit testing using JUnit and automation tools.
Illustrate using appropriate tools the mutation testing method for a
CO2 given piece of code to identify hidden defects that can’t be detected K3
using other testing methods.
Explain and apply graph coverage criteria in terms of control flow
CO3 K2
and data flow graphs to improve code quality.
Demonstrate the importance of black-box approaches in terms of
CO4 K3
Domain 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
CO6 optimize test case generation and also leverage AI tools for K3
automated test case prediction and symbolic execution with PEX.
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create
 CO-PO Mapping Table (Mapping of Course Outcomes to Program Outcomes)
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 3 3 3

CO2 3 3 3 3 3 3

CO3 3 3 3 3

CO4 3 3 3 3 3

CO5 3 3 3 3 3

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

Text Books

Sl. Name of the Edition

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

1 Cambridge
Introduction to Software Testing. Paul Ammann, Jeff Offutt 2/e, 2016
University Press

2 Software Testing and Quality Kshirasagar Naik,

Wiley 1/e, 2008
Assurance: Theory and Practice Priyadarshi Tripathy

Reference Books

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

1 Software Testing Ron Patten Pearson 2/e, 2005

Software Testing: A Craftsman’s

2 Paul C. Jorgensen CRC Press 4/e, 2017
Approach

3 Dorothy Graham, Rex

Foundations of Software Testing Cengage 4/e, 2021
Black, 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 levels
1 and Deployment templates, Domain Specific IoT- Home automation, Energy, 9
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 design
3 9
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- PcDino, 9
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/ 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
Knowledg
Course Outcome
e Level
(KL)
CO1 Understand domain-specific applications and apply the principles of IoT,
K2
including physical and logical design and deployment templates
CO2 Use the principles of IoT and M2M, their differences, and key concepts like
K3
SDN, NFV, and essential management protocols.
CO3 Develop and apply IoT design methodology, utilize Python for logical system
K3
design, and leverage key Python packages through practical case studies.
CO4 Experiment using Raspberry Pi with Python to control LEDs and switches,
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…)

Sl.No. Link ID
1 https://archive.nptel.ac.in/courses/106/105/106105166/
2 https://archive.nptel.ac.in/courses/108/108/108108179/
 SEMESTER 8

COMPUTER GRAPHICS
OECST835
Course Code 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 representations and
homogeneous coordinates.
2 10
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
4 algorithms- Back face detection, Depth buffer algorithm, Scan line algorithm, 8
A buffer algorithm.

Course Assessment Method

(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

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

5 15 10 10 40

End Semester Examination Marks (ESE)

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

Part A Part B Total

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

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

Bloom’s
Course Outcome Knowledge
Level (KL)
CO1 Understand the principles of computer graphics and displays K2

CO2 Illustrate line drawing, circle drawing and polygon filling algorithms K3

CO3 Illustrate 2D and 3D basic transformations and matrix representation K3

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

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

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

CO2 3 3 3 3 3

CO3 3 3 3 3 3

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

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

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 Computer William M. Newman and
4 McGraw Hill 1/e, 2001
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…)

Sl.No. Link ID

1. Computer Graphics By Prof. Samit Bhattacharya at IIT Guwahati

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