SEMESTER 3

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

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

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

Models 2024
 Reference Books
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

COMPUTER ORGANISATION AND ARCHITECTURE

Course Code PCITT302 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.
GXEST203: Foundations of Computing
Prerequisites (if any) - From Hardware Essentials to Web Course Type Theory
Design

Course Objectives:

1. Students will be able to gain a comprehensive understanding of the fundamental principles

and operational concepts of computer architecture.
2. Students will be able to learn about the key elements and mechanisms of pipelining and its
implementation in modern processors.
3. Students will be able to acquire knowledge of cache memory and DRAM systems, focusing
on their organisation, performance, and optimisation techniques.
4. Students can explore and differentiate various parallel processing architectures and multicore
processors.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Fundamentals: Basic operational concepts, memory locations and
addresses, instructions and instruction sequencing, instruction set principles

1 modes, classifying instruction set architectures, memory addressing, type and 11

size of operands, operations in the instruction set, instructions for control
flow, encoding an instruction set, RISC architecture.

Pipelining: Introduction to single cycle and multi cycle processors.

Pipelining- Basic and intermediate concepts, Introduction to pipelining,
2 12
pipeline hazards, structural hazards, data hazards, control hazards, pipelining
implementation, RISC V integer pipeline to handle multicycle operations.

Memory Organization: Introduction to cache memory, cache mapping,

3 block replacement techniques, cache performance, six basic cache 12
optimizations. DRAM memory system organization, basic nomenclature,
 memory modules, basic DRAM memory access protocol, basic DRAM
commands, DRAM controller architecture, row buffer management policy,
open page row buffer management policy, close page row buffer
management policy.

Introduction to Parallel Processors: SISD, MIMD, SIMD, SPMD, and

4 vector hardware multithreading, multicore and other shared memory 9

multiprocessors, Case Study: Intel Core i7.

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)
Apply the fundamental concepts of computer operations, memory
CO1 K3
organization, and instruction set architectures.
Describe and apply the concepts of pipelining, including pipeline
CO2 K3
hazards and their implementation in RISC-V architecture.
Apply the principles and performance optimization techniques of cache
CO3 K2
memory and the organization and protocols of DRAM systems.
Understand different parallel processor architectures and multicore
CO4 K2
processors, with a case study on Intel Core i7.
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 2 3 - 3 - - - - - - -

CO4 3 2 2 - 3 - - - - 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
Computer Organization and Patterson D.A. and J. L. Morgan Kauffmann 5th Edition
1
Design Hennessey Publishers 2014
Hamacher C., Z. 5th edition
2 Computer Organization McGraw Hill
Vranesic and S. Zaky 2012
Memory Systems: Cache, Bruce Jacob, David T. Morgan Kauffmann 1st Edition
3
DRAM, Disk Wang, and Spencer Ng Publishers 2007
Computer Organization- A Patterson D.A. and J. L. Morgan Kauffmann 6th Edition
4
Quantitative Approach Hennessey Publishers 2019
 Reference Books
Name of the Edition and
Sl. No Title of the Book Name of the Author/s
Publisher Year
Computer Organization and
9th edition
1 Architecture: Designing for William Stallings Pearson
2013
Performance
Parallel Computers- V Rajaraman, C Siva 2nd Edition
2 PHI learning
Architecture and Programming Ram Murthy 2016

Video Links (NPTEL, SWAYAM…)

Module
Link ID
No.
1 https://onlinecourses.nptel.ac.in/noc19_cs62/preview
2 https://archive.nptel.ac.in/noc/courses/noc21/SEM1/noc21-cs47/
 SEMESTER S3

DATA STRUCTURES

Course Code PCITT303 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.
UCEST105: Algorithmic Thinking
Prerequisites (if any) in Python Course Type Theory
GXEST204: Programming in C

Course Objectives:

1. Students will be able to understand and classify various data structures and their complexities,
analyze algorithms for space and time efficiency, and perform basic operations on arrays,
stacks, and queues.
2. Students will be able to implement basic searching, sorting, and hash table operations for
efficient data management in computational applications.
3. Students will be able to master operations on linked lists and implement stacks and queues
using linked lists effectively.
4. Students will be able to achieve a solid grasp of tree and graph structures, their traversal
methods, and applications, including the implementation of binary search trees, heaps, and
graph algorithms like Dijkstra’s shortest path.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Introduction to Data Structures: Definitions, Classifications of Data
Structures- ADT and CDT, Linear and Non-Linear, Static and Dynamic.
Algorithm/Program Development: Analysis of Algorithms- Space
Complexity, Understanding the notion of Time Complexity using graphical
and tabular representation for Linear, Quadratic, Cubical, Logarithmic and
1 11
Exponential functions. Asymptotic Notations- Best Case, Worst Case,
Average Case. Arrays: Definition, Properties of Array. Representation of
Single/Two-dimensional Arrays, Sparse Matrix, Polynomial representation,
and manipulation using Arrays (Addition only). Stack: Operations on Stack
using Array Queues: Definition, Operations on Queue using Array, Circular
 Queue implementation using Array, Other types of Queues: Dequeue,
Priority Queue (Concept only)
Applications of Stack: Infix to Postfix conversion and Postfix evaluation.

Searching: Linear Search and Binary search.

Sorting: Bubble Sort, Selection Sort, Insertion Sort. Quicksort and Merge
Sort (Recursive Algorithms only) Complexity analysis of sorting algorithms
(Detailed analysis is not required) and Heap sort.

2 Hash Tables: Different Hash Functions: Division method, Multiplication 11

Method, Mid Square Method, Folding Method, Collision Resolution
Techniques: Closed Hashing (Linear Probing) -Drawbacks, Open Hashing
(Separate Chaining). Remedies-Random Probing, Quadratic Probing, Double
Hashing. Load Factor and Re-hashing

Linked List: Definition, Array Vs Linked List, Dynamic memory

management. Representation of a Linked List, Classification (Singly Linked
List, Doubly Linked List, Circular singly linked list), Operations on Singly
Linked List- Traversal, Insertion, Deletion and Searching.
Applications of Linked List: Polynomial representation and manipulation
3 11
(Addition only). Operations on Doubly Linked List- Traversal, Insertion,
Deletion and Searching, Circular Linked List (Concept only) Linked List
representation of Stack and Queue, Stack implementation and Operations on
Stack using Linked List, Queue implementation and Operations on Queue
using Linked list.

Trees: Definition, Height, Depth, Degree, Level.

Binary Trees: Properties of Binary Trees, Complete, Perfect and Full Binary
Tree, Linear and Linked List representations of Binary Trees, Binary Tree
Traversals - Preorder, In order, and Post order (Recursive Algorithms only),
Binary Tree Applications: Expression Tree creation.
4 11
Binary Search Tree: Creation, Insertion, Deletion, and Search operations.
Heap: Creation Graph: Definition, set representations, Directed and
Undirected Graph, Adjacency Matrix and Adjacency List representation,
Graph Traversal: Breadth First Search (BFS), Depth First Search (DFS),
Graph Applications: Shortest Path Problem-Dijkstra’s 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 sub
divisions.
(8x3 =24marks) (4x9 = 36 marks)

Course Outcomes (COs)

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

Bloom’s
Course Outcome Knowledge
Level (KL)
Apply the concept of data structure and analyze algorithm complexity
CO1 using graphical and tabular methods in implementing stack and queue K3
operations.
Implement and evaluate searching, sorting, and hash table operations
CO2 K3
with various collision resolution techniques.
Implement and manipulate linked lists and utilize them for stack and
CO3 K2
queue operations, including polynomial manipulation
Apply tree and graph algorithms to traverse, search, and solve
CO4 K3
problems, including shortest path computations in graph structures.
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 2 2 - - - - - - 2
CO2 3 3 2 2 3 - - - - - - 2

CO3 3 3 2 3 2 - - - - - - 2
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
2nd Edition
1 Classic Data Structures Debasis Samantha Prentice Hall
2008
3rd Edition
2 Data Structures Through C Yashvanth Kanenthkar BPB Publications
2019

Reference Books
Name of the Edition and
Sl. No Title of the Book Name of the Author/s
Publisher Year
A. Aho, J. Hopcroft, J. 2nd Edition
1 Data Structures and Algorithms Pearson Education
Ulman 2008
T.H.Cormen, C.E.
4th Edition
2 Introduction to Algorithms Leiserson, R.L. Rivest, MIT Press
2022
C. Stein
Introduction to Data Structures Tremblay J. P. and P. G. 2nd Edition
3 Tata McGraw Hill
with Applications Sorenson 2001
Fundamentals of Data E. Horwitz , S. Sahani, 2nd Edition
4 University Press
Structures in C D. Mehta 2008

Video Links (NPTEL, SWAYAM…)

No. Link ID
1 https://onlinecourses.nptel.ac.in/noc24_cs96/preview
 SEMESTER S3

DATABASE MANAGEMENT SYSTEM

Course Code PBITT304 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.
UCEST105: Algorithmic
Prerequisites (if any) Course Type Theory
Thinking with Python

Course Objectives:

1. Students will be able to understand the elementary concepts of a database management

system.
2. Students will be able to design and implement a database project based on these concepts.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Introduction:
 Overview of a database project and its scope and objectives.
 Importance of database management system in real-world
applications.
Database Design:
 Conceptual Design: Create an Entity-Relationship Diagram (ERD)
to model the entities, relationships, and attributes involved in your

1 project. 9
 Logical Design: Translate the ERD into a relational schema.
Database Creation:
 Implement a sample schema in a DBMS of your choice (e.g.,
MySQL, PostgreSQL, SQLite).
Tables and Relationships:
 Define tables with appropriate attributes (columns).
 Establish relationships (foreign keys) between tables.
Normalization:

2  Ensure your schema is normalized to minimize redundancy and 9

dependency issues.
 SQL Queries:
 Develop a set of SQL queries to demonstrate CRUD operations
(Create, Read, Update, Delete), complex joins, aggregations, and any
specialized queries required by your project.
Timeline:
 Create a timeline or project plan with milestones to ensure timely
completion.
Constraints:
 Entity Integrity
 Referential Integrity
 Domain Constraints
Transaction Management:
 Definition of transactions and transaction properties (ACID

3 properties). 9
 Implementation of transaction processing logic.
Concurrency Control:
 Techniques to manage concurrent access (e.g., locking, time
stamping).
Backup and Recovery:
 Strategies for database backup and recovery in case of failures.
Testing and Validation:
 Execute queries to validate the correctness of the schema and
constraints.
Integration with Applications:
 Develop simple applications (eg; using Python) to interact with the
4 9
database.
Documentation:
 Prepare comprehensive documentation covering project objectives,
database schema, constraints, transactions, and implementation
details.
Suggestions on Project Topics:

No. Project Topics

1 E-commerce Database Platform

2 Registered Vehicle Database Management

3 Library Database Management System

4 Student Database Management

5 Pharmacy Database Management System

6 Restaurant Database Management

7 Payroll Database Management System

8 Insurance Products Database Management

9 Hospital management system.

10 Bank transactions management system.

Course Assessment Method

(CIE: 60 marks, ESE: 40 marks)

Continuous Internal Evaluation Marks (CIE):

Internal Internal
Attendance Project Examination-1 Examination- 2 Total
(Written) (Written)

5 30 12.5 12.5 60

End Semester Examination Marks (ESE):

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

Part A Part B Total

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

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

Bloom’s
Course Outcome Knowledge
Level (KL)
Develop a relational database schema for a given project, utilizing
CO1 Entity-Relationship Diagrams (ERDs) and translating them into a K3
relational schema.
Normalize a database schema and develop complex SQL queries to
CO2 K3
manipulate and retrieve data efficiently.
Implement and manage database constraints, transactions, concurrency
CO3 control mechanisms, and backup/recovery strategies to ensure data K3
integrity and system reliability.

CO4 Develop database application and prepare detailed documentation. K3

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

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

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

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

Text Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Database Systems: Models,
Elmasri R. and S. 7th Edition
1 Languages, Design and Pearson Education
Navathe 2016
Application Programming
Silberschatz A., H. F. 7th Edition
2 Database System Concepts McGraw Hill
Korth and S. Sudarshan 2019
 Reference Books
Name of the Edition and
Sl. No Title of the Book Name of the Author/s
Publisher Year
C. J. Date, S.
An Introduction to Database 8th Edition
1 Swamynathan and A. Pearson Education
Systems 2006
Kannan
2 Database Management Systems G.K.Gupta Tata McGraw Hill 2011

Video Links (NPTEL, SWAYAM…)

No. Link ID
1 https://onlinecourses.swayam2.ac.in/ini24_cs01

Project Based Learning - Course Elements

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

Assessment and Evaluation for Project Activity

Sl. Allotted
Evaluation for
No Marks
1 Project Planning and Proposal 5
2 Contribution in Progress Presentations and Question Answer Sessions 4
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. Familiarize the basic concepts of Boolean algebra and digital systems. Further, the design of
simple combinational and sequential logic circuits which is essential in understanding
organization & design of computer systems.

SYLLABUS

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

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

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,

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

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

ECONOMICS FOR ENGINEERS

(Common to All Branches)

Course Code UCHUT346 CIE Marks 50

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

Credits 2 Exam Hours 2 Hrs. 30 min.

Prerequisites (if any) None Course Type Theory

Course Objectives:

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

Module Contact
Syllabus Description
No. Hours

Basic Economics Concepts - Basic economic problems – Production

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

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

Internal and External Economies – Cobb-Douglas Production Function

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

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

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

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

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

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

Benefit Analysis - Capital Budgeting - Process planning

Course Assessment Method

(CIE: 50 marks, ESE: 50 marks)

Continuous Internal Evaluation Marks (CIE):

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

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

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

Part A Part B Total

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

Course Outcomes (COs)

At the end of the course students should be able to:
Bloom’s
Course Outcome Knowledge
Level (KL)

Understand the fundamentals of various economic issues using laws K2

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

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

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

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

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

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

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

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

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

3 R. Paneerselvam PHI 2012

Engineering Economics

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

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

Engineering Economics and Donald G. Newman,

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

Contemporary Engineering Prentice Hall of India

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

ENGINEERING ETHICS AND SUSTAINABLE DEVELOPMENT

Course Code UCHUT347 CIE Marks 50

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

Course Objectives:

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

SYLLABUS

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

Introduction to Environmental Ethics: Definition, importance and

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

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

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

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

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

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

degrowth principles, Strategies for implementing circular economy practices
and degrowth principles in engineering. Mobility and Sustainable
Transportation: Impacts of transportation on the environment and climate,
Basic tenets of a Sustainable Transportation design, Sustainable urban
mobility solutions, Integrated mobility systems, E-Mobility, Existing and
upcoming models of sustainable mobility solutions.
 Renewable Energy and Sustainable Technologies: Overview of renewable
energy sources (solar, wind, hydro, biomass), Sustainable technologies in
energy production and consumption, Challenges and opportunities in
renewable energy adoption. Climate Change and Engineering Solutions:
Basics of climate change science, Impact of climate change on natural and
human systems, Kerala/India and the Climate crisis, Engineering solutions to
mitigate, adapt and build resilience to climate change. Environmental
4 Policies and Regulations: Overview of key environmental policies and
6

regulations (national and international), Role of engineers in policy

implementation and compliance, Ethical considerations in environmental
policy-making. Case Studies and Future Directions: Analysis of real-
world case studies, Emerging trends and future directions in environmental
ethics and sustainability, Discussion on the role of engineers in promoting a
sustainable future.

Course Assessment Method

(CIE: 50 marks , ESE: 50)

Continuous Internal Evaluation Marks (CIE):

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

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

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

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

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

prepare a report

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

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

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

4 Final A comprehensive presentation summarising the key takeaways G 5

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

Total Marks 50

*Can be taken from the given sample activities/projects

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

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

Bloom’s
Course Outcome Knowledge
Level (KL)

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

CO1
professional life.
Develop the ability to exercise gender-sensitive practices in their K4
CO2
professional lives
Develop the ability to explore contemporary environmental issues and K5
CO3
sustainable practices.
Develop the ability to analyse the role of engineers in promoting K4
CO4
sustainability and climate resilience.
Develop interest and skills in addressing pertinent environmental and K3
CO5
climate-related challenges through a sustainable engineering approach.

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

CO-PO Mapping Table:

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

CO2 1 3 2 3 3 2 2

CO3 3 3 2 3 2 2

CO4 1 3 3 2 3 2 2

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

Cambridge University November

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

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

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

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

New age international

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

Tata McGraw Hill

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

Suggested Activities/Projects:

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

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

PROGRAMMING IN PYTHON LAB

Course Code PCITL307 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.
UCEST105: Algorithm Thinking
Prerequisites (if any) Course Type Lab
With Python
Course Objectives:

1. Students will be able to develop skills in text processing, advanced function handling, and
exception handling.
2. Students will be able to provide hands-on experience with image processing techniques and
object-oriented programming principles.

SYLLABUS

Experiment
No.
Experiments
a) Creation of List & List Operations
b) Advanced List Comprehension
1
c) Tuple and Tuple operations
d) Creation of Dictionary and Operations

Text Processing

Sample Program
a) Given an input file which contains a list of names and phone numbers separated by
spaces in the following format: “Phone Number contains a 3- or 2-digit area code and
2
a hyphen followed by an 8-digit number”. Find all names having phone numbers with
a 3-digit area code using regular expressions.
b) Write a Python program to check the validity of a password given by the user.
c) Write a Python program to validate mobile number
 Working with functions
Sample Program:
a) Write a program to solve a classic ancient Chinese puzzle: Get the input from the
user for the number of heads (eg: 35 heads) and legs (eg: 94 legs) among the
chickens and rabbits in a farm. Display the number of rabbits and chickens we have.
Use the function solve(heads, legs). Hint: Use for loop to iterate all possible
solutions.
b)You are given an array A of size N. Your friend gave me an amazing task for you.
Your friend likes one type of Sequence. So, he called that type of sequence a fair
sequence. You should select a fair sequence of maximum length from an array. Here
3
a fair sequence is nothing but you have to select elements in a pattern like positive
element, negative element, positive element… negative element, positive element,
negative element, to form a sequence. Your task is to print the maximum sum of
elements possible by selecting a fair subsequence with maximum length. (Use
functions).
Ex: If array A = [-1, 18, 13, 18, 2, 16,7,-1, -213, 11]. Here your minimum length can
be 6. The fair subsequence is -1, -18,-7, -2, 7,-1, 11. The Sum is 32 which is the
maximum possible. Your friend also kept a timer of 15 min. You will win, will you
be able to do it?
c) Working with Lambda function

Exception Handling and User defined exception(s)

Sample Program:
4
a) Write a python program to catch different types of exceptions
b) Write a python program to create user defined exceptions.

File handling
Sample Program:
Write a Python program that manages book records using a binary file called
5 book.dat. The program should have the following functions:
● add_record()
This function should prompt the user to input data for a book, including the Book
Number, Book Name, Author, and Price. The data should be stored in a list format:
 [BookNo, Book_Name, Author, Price]. The function should then add the book data
to the book.dat binary file using pickling.
● display_records()

This function should display all the records stored in the book.dat file on the screen.
Each record should be displayed with its corresponding attributes: Book Number,
Book Name, Author, and Price.
● books_by_author()
This function should ask the user to input an author's name. It should then search
through the records in the book.dat file and display all the records for books written
by the given author.
● books_by_price(price)
This function should receive a maximum price as an argument. It should search
through the records in the book.dat file and display all the records for books with a
price less than the provided maximum price.
● copy_data()
This function should read the contents of the book.dat file. It should copy the records
of books whose price is more than $500 to a new file named costly_book.dat using
pickling. The function should return the count of records copied.
● delete_record(book_number)
This function should receive book number as an argument. If a record with the given
book number exists, it should be deleted from the book.dat file. If the record does not
exist, display an error message.
● update_record(book_number)
This function should receive a maximum price as an argument. If a record with the
given book number exists, prompt the user to update the Book Name, Author, and
Price for that record. If the record does not exist, display an error message.
In the program, include a menu-based interface that allows users to choose which
function to execute.

Working with data (Use of user- defined/ Built-in modules)

6 Sample Program:
a) Querying an SQL light database- insert, update, select, delete
 b) Comparing data in a .CSV file and write to a new .CSV file.

Working with data (Use of user- defined/ Built-in modules): Getting data from
Web, JSON

7 Sample Program:
a) Scrap HTML content from a page and pass the code with beautiful soup.
b) Serializing/ Deserializing JSON – Access and work with data stored as JSON

Image Processing

8 Sample Program:
a) Reading, Saving and displaying an image using OpenCV-PyPI, matplotlib

Advanced Image processing

Sample Program:

9 a) Image statistics cropping,

b) Converting images from RGB to Gray and Resizing the image

c) Skin color detection

Basic Object-Oriented
Sample Program:
a) Write a Python class named Person with attributes name, age, weight (kgs), height
10
(ft) and takes them through the constructor and exposes a method get_bmi_result()
which returns one of "underweight", "healthy", "obese".
b) Write a python program to demonstrate operator overloading.

Advanced Object-Oriented
Sample Program:
11
a) Write a python program to demonstrate various kinds of inheritance
b) Write a python program to create abstract classes and abstract methods

Implement a micro project using any of the Python concepts described in

experiments 1-11.
12
For Projects, Students may be grouped with maximum of 4 persons. Evaluation shall
be done on demonstration and presentation of project for maximum 10 minutes.
 Example: Creating a snake and ladder game, PageRank Algorithm implementation
etc.

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

Conduct of
Procedure/ Result with valid
experiment/
Preparatory inference/ Viva
Execution of work/ Record Total
work/Design/ Quality of voce
troubleshooting/
Algorithm Output
Programming
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)
Apply advanced list comprehensions, tuples, and dictionaries for
efficient data manipulation and develop text processing scripts,
CO1 including functions with advanced argument handling and lambda
K3
functions.
Implement robust programs using exception handling and user-defined
CO2 K3
exceptions.
Implement file operations, work with relational databases, CSV, and
CO3 K3
web-based data sources effectively.
Perform basic and advanced image processing using libraries such as
CO4 OpenCV and matplotlib, and demonstrate basic and advanced object- K3
oriented programming concepts.
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 2 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
How to think like a Computer Allen Downey, Jeffrey 1st edition,
1 Green Tea Press
Scientist- Learning with Python Elkner, Chris Meyers 2002
Learning Python: Powerful O’Reilly Media Inc. 5th edition,
2 Mark Lutz
Object-Oriented Programming 2013
 Reference Books
Name of the Edition and
Sl. No Title of the Book Name of the Author/s
Publisher Year
Yes Dee Publishing
Problem Solving and PYTHON 2nd edition,
1 S.A.Kulkarni Pvt Ltd
Programming 2008
Programming in Python 3: A
2nd edition,
2 Complete Introduction to the Mark Summerfield Pearson Education
2018
Python Language
Cengage Learning
Kenneth A. Lambert, B. 1st edition,
3 Fundamentals of Python India Pvt. Ltd.
L. Juneja 2015
Yashavant Kanetkar 1st edition,
4 Let Us Python BPB Publications
,Aditya Kanetkar 2019

Video Links (NPTEL, SWAYAM…)

Link No. Link ID
1 https://onlinecourses.nptel.ac.in/noc19_cs40/preview
2 www.https://realpython.com/
3 https://onlinecourses.nptel.ac.in/noc24_cs113/preview
4 https://docs.python.org/3/reference/

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 question.
 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

DATA STRUCTURES LAB

Course Code PCITL308 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.
GXEST204: Programming
Prerequisites (if any) Course Type Lab
in C

Course Objectives:

1. Understand the importance of data structures, abstract data type, and their basic usability in
different applications.
2. Implement basic searching, sorting, and hashing algorithms to efficiently solve data organization
and retrieval problems.
3. Implement linear and non-linear data structures using arrays and linked lists.
4. Apply various data structures such as stacks, queues, trees, graphs, etc. to solve various
computing problems.
5. Identify suitable data structures and algorithms to solve a real-world problem.

Experiment
Experiments
No.
1 Implementation of Stack using array.

Utilize stack to perform the following tasks:

2 i) Convert an infix expression to a postfix expression.
ii) ii) Evaluate a given postfix expression

3 Representation of polynomials using arrays and perform polynomial addition.

4 Implementation of Queue and Circular Queue using arrays.

Implementation of various sorting algorithms – Bubble sort, Insertion sort, Selection

5
sort, Quick sort, and Merge sort.

6 Implementation of basic searching algorithms – linear search and binary search.

 Implementation of hash tables using various mapping functions and resolving
7
collisions (if any) using various collision resolution schemes.
Implementation of Singly linked list operations- traversing, searching, insertion,
8
deletion.
Implementation of Doubly linked list operations- traversing, searching, insertion, and
9
deletion.

10 Representation of polynomials using linked lists and perform polynomial addition.

11 Implementation of Stack and Queue using linked list.

Implementation of preorder, in-order, and post-order traversals on binary trees using

12
recursive algorithm.

13 Implementation of binary search trees – creation, insertion, deletion, searches.

14 Implementation of heap sort.

Representation of graph using adjacency list and adjacency matrix and compute
15
various parameters (in degree, out-degree, etc.).

16 Implementation of BFS and DFS for each graph representation.

17 Implementation of Dijkstra's algorithm for finding the shortest path.

18 Any application program using trees.

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

Conduct of
Procedure/ Result with valid
experiment/
Preparatory inference/ Viva
Execution of work/ Record Total
work/Design/ Quality of voce
troubleshooting/
Algorithm Output
Programming
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)
Perform operations on fundamental data structures such as arrays,
CO1 K3
stacks, queues, linked lists, and hash tables.
Implement and analyze various sorting (e.g., bubble, insertion,
CO2 selection, quick, merge) and searching algorithms (linear and binary K3
search), understanding their efficiency and use cases.
CO3 Solve complex problems involving tree and graph data structures. K3
Analyze and optimize the performance of data structure operations,
CO4 including polynomial representation and addition, using both arrays K3
and linked lists and different implementations of stacks and queues.
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 2 - - - - - - 1
CO2 3 3 2 2 2 - - - - - - 2

CO3 3 3 3 2 2 - - - - - - 2
CO4 3 3 2 3 3 - - - - - - 2
Note: 1: Slight (Low), 2: Moderate (Medium), 3: Substantial (High), -: No Correlation
 Text Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
2nd Edition
1 Classic Data Structures Debasis Samantha Prentice Hall
2008
rd
3 Edition
2 Data Structures Through C Yashvanth Kanenthkar BPB Publications
2019

Reference Books
Name of the Edition and
Sl. No Title of the Book Name of the Author/s
Publisher Year
A. Aho, J. Hopcroft, J. Pearson Education 2nd Edition
1 Data Structures and Algorithms
Ulman 2008
T.H.Cormen, C.E.
4th Edition
2 Introduction to Algorithms Leiserson, R.L. Rivest, MIT Press
2022
C. Stein
Introduction to Data Structures Tremblay J. P. and P. G. Tata 2nd Edition
3 McGraw Hill
with Applications Sorenson 2001
Fundamentals of Data E. Horwitz , S. Sahani, 2nd Edition
4 University Press
Structures in C D. Mehta 2008

Video Links (NPTEL, SWAYAM…)

Link No. Link ID

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

Continuous Assessment (25 Marks):

1. Preparation and Pre-Lab Work (7 Marks)
 Pre-Lab Assignments: Assessment of pre-lab assignments or quizzes that test understanding
of the upcoming experiment.
 Understanding of Theory: Evaluation based on students’ preparation and understanding of
the theoretical background related to the experiments.
2. Conduct of Experiments (7 Marks)
 Procedure and Execution: Adherence to correct procedures, accurate execution of
experiments, and following safety protocols.
 Skill Proficiency: Proficiency in handling equipment, accuracy in observations, and
troubleshooting skills during the experiments.
  Teamwork: Collaboration and participation in group experiments.
3. Lab Reports and Record Keeping (6 Marks)
 Quality of Reports: Clarity, completeness and accuracy of lab reports. Proper documentation
of experiments, data analysis and conclusions.
 Timely Submission: Adhering to deadlines for submitting lab reports/rough record and
maintaining a well-organized fair record.
4. Viva Voce (5 Marks)
 Oral Examination: Ability to explain the experiment, results and underlying principles during
a viva voce session.

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

Evaluation Pattern for End Semester Examination (50 Marks):

1. Procedure/Preliminary Work/Design/Algorithm (10 Marks)
 Procedure Understanding and Description: Clarity in explaining the procedure and understanding
each step involved.
 Preliminary Work and Planning: Thoroughness in planning and organizing materials/equipment.
 Algorithm Development: Correctness and efficiency of the algorithm related to the experiment.
 Creativity and logic in algorithm or experimental design.
2. Conduct of Experiment/Execution of Work/Programming (15 Marks)
 Setup and Execution: Proper setup and accurate execution of the experiment or programming
task.
3. Result with Valid Inference/Quality of Output (10 Marks)
 Accuracy of Results: Precision and correctness of the obtained results.
 Analysis and Interpretation: Validity of inferences drawn from the experiment or quality of
program output.
4. Viva Voce (10 Marks)
 Ability to explain the experiment, procedure results and answer related question.
 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
INFORMATION TECHNOLOGY
 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
1 1st edition,
Applications to Engineering Narsingh Deo Learning Private
1979
and Computer Science Limited

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

COMPUTER NETWORKS

Course Code PCITT402 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 familiarise with the fundamental concepts of Computer Networks, Network hardware and
Software.
2. To familiarize with the terminologies and concepts and protocols associated with the different
layers of the Computer Software with the help of Reference Models.
3. To raise awareness of students with the fundamentals of Internet and internet services.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Introduction: Uses of computer networks, Network hardware, Network
software, Reference Models –The OSI Reference Model, TCP/IP Reference
Model, Comparison of the OSI and TCP/IP Reference Models.
Physical Layer: Guided Transmission Media (twisted pair, coaxial cable,

1 Fiber Cables), Wireless Transmission (Radio Transmission, Microwave 8

Transmission, Infrared Transmission), Communication satellites (GEO,
LEO, MEO).
Interfacing devices: Repeaters, Hubs, Bridges, Switches, Routers, And
Gateways

Data link layer: Data link layer design issues, Error detection and correction
- Error Correcting codes (Hamming codes, Reed-Solomon codes, Low-
Density Parity Check codes), Error-Detecting Codes (Parity, Checksums,
2 12
Cyclic Redundancy Checks), A Simplex Stop-and-Wait Protocol for a Noisy
Channel, Sliding window protocols.
Medium Access Control (MAC) sublayer: Channel allocation problem,
 Multiple access protocols (ALOHA, Slotted ALOHA, Carrier Sense Multiple
Access Protocols, Collision-Free Protocols -bit map protocol, token passing,
binary countdown, Wireless LAN Protocols).

Ethernet: Frame format, types- Fast Ethernet, Gigabit Ethernet, 10-Gigabit

Ethernet.

Network Layer: Network layer design issues. Routing algorithms - The

Optimality Principle, Shortest path routing, Flooding, Distance Vector
Routing, Link State Routing, Multicast routing, Routing for mobile hosts.
Congestion control algorithms: Approaches to Congestion Control- Choke
3 12
Packets, Random Early Detection. Quality-of-service - Application
Requirements, Traffic Shaping - Leaky and Token Buckets.
The Network Layer in the internet: Internet Protocol, IP Version 4
Protocol, IP Addresses, IP Version 6.

Transport Layer: Transport service – Services provided to the upper layers,

Transport service primitives. Socket programming, User Datagram Protocol
(UDP)- User Datagram, Checksum. Real-Time Transport Protocols (RTP,
RTCP), Transmission Control Protocol (TCP)- TCP Service Model, TCP

4 Protocol, TCP Segment Header, TCP Connection Establishment, TCP 12

Connection Release, TCP Sliding Window, TCP Congestion Control.
Application Layer: Domain Name System (DNS)- Electronic mail. World
Wide Web - Architectural Overview, HTTP—The Hypertext Transfer
Protocol.

Course Assessment Method

(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

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

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

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

Part A Part B Total

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

Course Outcomes (COs)

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

Bloom’s
Course Outcome Knowledge
Level (KL)
Distinguish the terminology and concepts of computer networks and
CO1 K2
Physical Layer
Illustrate different concepts of Data Link Layer including Error
CO2 Control, Channel allocation and popular wired and wireless LAN K2
technologies
Describe the network layer concepts, routing algorithms, congestion
CO3 K2
control approaches and IP protocol and addressing fundamentals.
Describe the features and format of different Transport layer and
CO4 K2
Application layers protocols
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

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

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

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

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

 Text Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
6th Edition
1 Computer Networks Andrew S. Tanenbaum Pearson
2021

Reference Books
Name of the Edition and
Sl. No Title of the Book Name of the Author/s
Publisher Year
Data Communication and 4th Edition
1 Behrouz A Forouzan Tata McGraw Hill
Networking 2007
Computer Networking - A Top-
7th edition
2 Down Approach featuring the James F Kurose Pearson Education
2016
Internet
The Morgan
Computer Networks: A Larry Peterson and Bruce 5th Edition
3 Kaufmann Series in
Systems Approach Davie Networking
2011

Video Links (NPTEL, SWAYAM…)

No. Link ID
Computer Networks and Internet Protocol By Prof. Soumya Kanti Ghosh, Prof. Sandip Chakraborty
1
https://onlinecourses.nptel.ac.in/noc22_cs19/preview
 SEMESTER S4

OPERATING SYSTEMS

Course Code PCITT403 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.
PCITT302: Computer
Prerequisites (if any) Course Type Theory
Organisation and Architecture

Course Objectives:

1. To understand the mechanisms like process management in the Operating System.

2. To understand the mechanisms of process synchronization and dead lock.
3. To understand the functions of memory management, file system implementation and storage
structures used in OS.
4. To understand the concepts of Virtual Machines.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Introduction: Functions of OS, Types of OS - Batch, Multi programmed,
Time-sharing and Real time systems, System calls, System structure -
Simple structure, Layered approach, Microkernel system structure,
Monolithic, Modules, Hybrid Systems, System Boot.

1 Process Management: Process concept, Process State, PCB-Multithreading 11

- Benefits. Case study: Linux system - process management.
Process Scheduling: Basic concepts, Non Pre-emptive Scheduling, Pre-
emptive Scheduling, Dispatcher, Scheduling criteria, Scheduling Algorithms
- FCFS, SJF, Priority scheduling, Round Robin Scheduling.

Process Synchronization: Race Conditions - Critical Sections – Peterson’s

Solution-Mutual Exclusion - Busy Waiting- Sleep and Wakeup – Bakery
Algorithm-Semaphores.
2 11
Deadlocks: Deadlock characteristics - conditions for deadlock - Prevention –
Avoidance -Safe state, Resource Allocation Graph, Banker’s algorithm,
Deadlock Detection, Recovery from dead lock.
 Memory Management: Basics, Swapping, Memory Allocation - fixed
partitions, variable partitions, Fragmentation, Paging, Segmentation, Virtual
3 11
memory concepts, Demand paging, Page replacement algorithms - FIFO,
Optimal, LRU, Allocation of frames, Thrashing.

File System: File concept - Attributes, Operations, File Types - File

structure - File access methods (Sequential Access, Direct Access, Indexed
Access)– File allocation methods (Contiguous, linked, and indexed
allocation), Directory structure (Single-Level, Two-Level, Tree-Structured,
Acyclic Graph, General Graph), Case Study: Linux file systems
4 11
Disk Management: Introduction, Disk Scheduling algorithms (FCFS, SSTF,
SCAN, C-SCAN, LOOK, C-LOOK)
Virtual Machines: Benefits & Features- Building Blocks- Types of VMs-
Virtualization & Operating System Components.

Course Assessment Method

(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

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

5 15 10 10 40

End Semester Examination Marks (ESE):

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

Part A Part B Total

 2 Questions from each  Each question carries 9 marks.
module.  Two questions will be given from each module,
 Total of 8 Questions, out of which 1 question should be answered.
60
each carrying 3 marks  Each question can have a maximum of 3 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 operating systems and apply process
CO1 K2
management and process scheduling concepts to solve problems.
Illustrate process synchronization, deadlock, and deadlock – prevention
CO2 K2
and avoidance techniques.

CO3 Illustrate the memory management techniques K2

Illustrate disk scheduling algorithm to solve problems and describe the
CO4 K2
file system implementation and virtual machine.
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create

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

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

CO3 3 3 3 2 - - - - - - - 2
CO4 3 3 3 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
A. Silberschatz, G.Gagne 9th edition
1 Operating System Concepts Wiley Publications
and P.Galvin 2018

Reference Books
Name of the Edition and
Sl. No Title of the Book Name of the Author/s
Publisher Year
Andrew S. Tanenbaum 5th Edition
1 Modern Operating Systems Pearson
and Herbert Bos 2022
Operating Systems A Concept- Tata McGraw 2nd Edition
2 D M Dhamdhere
based Approach Hill 2006
th
Operating Systems: Internals 9 Edition
3 William Stallings Pearson
and Design Principles 2018
 Video Links (NPTEL, SWAYAM…)

No. Link ID

1 https://archive.nptel.ac.in/courses/106/106/106106144/
 SEMESTER S4

DATA SCIENCE

Course Code PBITT404 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.
UCEST105: Algorithmic Thinking with
Prerequisites (if any) Python and PCITL307: Programming in Course Type Theory
Python Lab

Course Objectives:

1. Students will be able to gain a comprehensive understanding of data science, including data
preprocessing, exploratory data analysis, building data pipelines, implementing machine
learning algorithms, and evaluating model performance.
2. Students will be able to develop practical skills in using Python and relevant data science
tools to apply these concepts effectively.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Introducing data science and Python: Definition of data Science,
Installing latest version of python:-Step by step installation of python ,

1 Installing necessary packages of python , Introducing Jupyter. 9

Data science process, Data loading and preprocessing with pandas- Fast and
easy data loading- Data preprocessing- Data selection.
Data Pipeline, Exploratory data analysis (EDA) - Building new features-
Dimensionality reduction- The detection and treatment of outliers-
Validation metrics- Testing and validating- Cross-validation-
2 9
Hyperparameter optimization- Feature selection- Wrapping everything in a
pipeline.
Preparing tools and datasets, Plotting scatter plots for relationships in data.
Machine Learning
Supervised Learning: Rule-Based Classification- Using IF-THEN Rules for
Classification, K-Nearest-Neighbour Classifier.
3 9
Unsupervised Learning: K-means Clustering, Hierarchical Clustering,
Agglomerative versus Divisive Hierarchical Clustering, Distance Measures
in Algorithmic Methods, Density based Clustering - DBSCAN.
 Linear and Logistic Regression, Ensemble strategies.

Evaluation
Evaluating model performance, Confusion matrices, Precision and recall,

4 Sensitivity and specificity, F-measure, ROC curves. 9

Case Study: Building Your First Model in data science, Making Predictions,
Evaluating the Model.

Suggestions on Project Topics:

No. Project Topics

1 Churn Prediction using Machine Learning

2 Credit Analysis

3 Employee Access-Challenge as a Classification Problem

4 Fake News Detection

5 House Price Prediction using Machine Learning

6 Loan Default Prediction

7 Model Insurance Claim Severity

8 Personalized Medicine Recommending System

9 Price Recommendation using Machine Learning

10 Recommendation System for Retail Stores

11 Sales Forecasting

12 Sentiment Analysis of Product Reviews

Course Assessment Method

(CIE: 60 marks, ESE: 40 marks)

Continuous Internal Evaluation Marks (CIE):

Internal Internal
Attendance Project Examination-1 Examination- 2 Total
(Written) (Written)

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

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

Part A Part B Total

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

Course Outcomes (COs)

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

Bloom’s
Course Outcome Knowledge
Level (KL)
Apply the fundamental concepts and scope of data science, install and
CO1 K3
utilize Python and Jupyter Notebook for data science applications.
Perform exploratory data analysis (EDA), build effective data pipelines
CO2 including feature engineering, dimensionality reduction, and K3
hyperparameter optimization.

CO3 Implement and evaluate various machine learning algorithms. K3

CO4 Apply various performance metrics on Machine Learning 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 2 1 1 1 2 - - - - - - -

CO2 - 2 2 - 3 - - 2 2 - 2 2
CO3 3 2 2 2 3 - - 2 2 - 2 2
CO4 3 2 2 2 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
Alberto Boschetti, Luca 3rd Edition
1 Python Data Science Essentials Packt Publishing Ltd.
Massaron 2018
Introduction to Machine
Andreas C. Müller and
2 Learning with Python A Guide O’Reilly Media, Inc. 2017
Sarah Guido
for Data Scientists
Data Mining: Concepts and Jiawei Han, Micheline 3rd Edition
3 Morgan Kaufmann
Techniques Kamber, Jian Pe 2012

Reference Books
Name of the Edition and
Sl. No Title of the Book Name of the Author/s
Publisher Year
Data science: Concepts and Vijay Kotu 2nd Edition
1 Morgan Kaufmann
practice Bala Deshpande 2019
3rd Edition
2 Data Mining Techniques Arun K Pujari University Press
2013

Video Links (NPTEL, SWAYAM…)

No. Link ID
1 https://onlinecourses.nptel.ac.in/noc20_cs80

Project Based Learning - Course Elements

L: Lecture R: Project (1 Hr.), 2 Faculty Members
(3 Hrs.) Tutorial Practical Presentation
Simulation/ Presentation
Lecture delivery Project identification Laboratory Work/ (Progress and Final
Workshops Presentations)
Group discussion Project Analysis Data Collection Evaluation
Question answer
Project Milestone Reviews,
Sessions/ Analytical thinking and
Testing Feedback,
Brainstorming self-learning
Project reformation (If required)
Sessions
Poster Presentation/
Guest Speakers Case Study/ Field Survey Video Presentation: Students
Prototyping
(Industry Experts) Report present their results in a 2 to 5
minutes video
 Assessment and Evaluation for Project Activity
Sl. Allotted
Evaluation for
No Marks
1 Project Planning and Proposal 5
2 Contribution in Progress Presentations and Question Answer Sessions 4
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
OBJECT ORIENTED DESIGN USING JAVA

Course Code PEITT411 CIE Marks 40

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

Course Objectives:

1. Students should be able to understand the concepts of Software Engineering, Object oriented
programming and UML
2. To provide students with a comprehensive understanding of the key concepts, activities, and
management practices involved in the Requirements Elicitation, Analysis, and System Design
phases of software engineering, enabling them to effectively gather, analyze, and structure
requirements and design solutions that align with project goals. Work with Concurrency,
Collections, and Event Handling in Java
3. To equip students with the skills to apply object-oriented design principles, including reusing
pattern solutions and specifying interfaces, and to proficiently map models to code, ensuring
that the software design meets functional and non-functional requirements and is
implemented effectively.
SYLLABUS

Module Contact
Syllabus Description
No. Hours
Introduction to Software Engineering:
What is Software Engineering, Software Engineering Concepts, Software
Engineering Development Activities, Managing Software Development.

1 Introduction to Java: Objects, Classes, Constructors, Inheritance 9

Modeling With UML: An overview of UML, Modeling Concepts, Use case
Diagrams, Class Diagrams, Interaction Diagrams, State Machine Diagrams,
Activity Diagrams, Diagram Organization, Diagram Extensions.

Requirements Elicitation: Introduction, Overview, Concepts, Activities,

2 Managing Requirements Elicitation. 9

Analysis: Introduction, Overview, Concepts, Activities, Managing Analysis
 System Design: Decomposing the system - Introduction, Overview,
Concepts, Activities, Addressing Design goals - Introduction, Overview,

3 Concepts, Activities, Managing System Design. 9

Object Design: Reusing Pattern Solutions- Introduction, Overview, Reuse
Concepts, Reuse Activities, Managing Reuse.

Object Design: Specifying Interfaces- Introduction, Overview, Interface

Specification Concepts, Interface Specification Activities, Managing Object

4 Design. 9
Mapping Models to Code: Introduction, Overview, Mapping Concepts,
Mapping Activities, Managing Implementation.

Course Assessment Method

(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

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

5 15 10 10 40

End Semester Examination Marks (ESE):

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

Part A Part B Total

 2 Questions from each  Each question carries 9 marks.
module.  Two questions will be given from each module, out
 Total of 8 Questions, each of which 1 question should be answered.
60
carrying 3 marks  Each question can have a maximum of 3 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 an understanding of the fundamental concepts and
activities of software engineering, including the principles of software
CO1 K3
development and management, and apply these concepts in designing
object-oriented solutions using Java and UML diagrams.
Illustrate the ability to effectively gather, analyze, and manage
software requirements, and design system architectures by applying
CO2 K3
fundamental concepts and best practices in requirements elicitation,
analysis, and system decomposition.
Apply system design principles to address design goals and effectively
CO3 reuse pattern solutions in object design, ensuring the development of K3
robust, maintainable, and scalable software systems.
Develop the ability to specify interfaces in object design and
CO4 proficiently map models to code, ensuring accurate implementation K3
and effective management of the software development process.
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create

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

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 2 3 2 2 - - - 2 2 - 2
CO2 3 3 3 2 2 - - - 2 2 - 2
CO3 3 3 3 2 3 - 2 - 2 2 - 2
CO4 3 2 3 2 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
Object Oriented Software
3rd Edition
1 Engineering using UML, Bernd Bruegge Prentice Hall
2010
Patterns and Java
McGraw-Hill 13th Edition
2 Java: The Complete Reference Herbert Schildt
Education 2023
 Reference Books
Name of the Edition and
Sl. No Title of the Book Name of the Author/s
Publisher Year
Applying UML and Patterns:
An Introduction to Object- 3rd Edition
1 Craig Larman Pearson Education
oriented Analysis and Design 2005
and Iterative Development
Object Oriented Analysis and 3rd Edition
2 Grady Booch Pearson Education
Design with Applications 2014
Core Java Volume I - 12th Edition
3 Cay S. Horstmann Prentice Hall
Fundamentals 2024

Video Links (NPTEL, SWAYAM…)

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

DATA COMMUNICATION AND NETWORKING

Course Code PEITT412 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.
GAEST305: Digital Electronics &
Prerequisites (if any) Course Type Theory
Logic Design

Course Objectives:

1. To familiarise with the fundamental concepts of analog and digital data communication.
2. To equip students to apply their knowledge in various data communication techniques for
signal encoding, and error control.
3. To familiarise with the data link layer concepts and control protocols.
4. To raise awareness of students with the fundamentals of computer communication and
internet services.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Data Communication Overview: Data Communications Model, Networks,
The Internet.

Data Transmission: Concepts and Terminology, Analog and Digital Data

1 6
Transmission, Transmission Impairments, Channel capacity.
Transmission Media: Guided Transmission Media, Wireless Transmission,
Wireless Propagation.

Signal Encoding Techniques: Digital Data to Digital Signals (NRZ-L,

NRZ-I, Bipolar- AMI, Pseudo ternary, Manchester, Differential Manchester,
Scrambling techniques), Digital Data to Analog Signals (ASK, PSK, FSK),

2 Analog Data to Digital Signals (PCM, DM), Analog Data to Analog Signals. 11
Digital Data Communication Techniques: Asynchronous and
Synchronous Transmission, Types of Errors, Error Detection (parity check,
CRC), Error Correction, Line Configurations.
 Data Link Control Protocols: Flow Control, Error Control, Multiplexing -
Frequency-Division Multiplexing, Synchronous Time-Division

3 Multiplexing, Statistical Time-Division Multiplexing, Spread Spectrum - 10

The Concept of Spread Spectrum - Frequency Hopping Spread Spectrum,
Direct Sequence Spread Spectrum, Code-Division Multiple Access.

Circuit Switching and Packet Switching: Switched Communications

Networks, Circuit-Switching Network, circuit switching concepts, softswitch
architecture, Packet Switching Principles.
Routing in Packet-Switched Networks: Routing in Packet-Switching
4 Networks - Characteristics, Routing Strategies. 9

Wireless LANs: 802.11 Architecture and Protocol Stack, frame format,

Bluetooth- Bluetooth Architecture.

Cellular Wireless Networks: Principles of Cellular 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)
Explain the fundamental concepts of analog and digital Data
CO1 K2
Communication and various transmission media.
Apply different signal encoding and error control techniques in data
CO2 K3
transmission.
Explain data link control protocols and concepts of multiplexing and
CO3 K2
spread spectrum.
Explain the principles of Networking, Wireless LANs and Cellular
CO4 K2
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 2 - - - - - - - - - - 2
CO2 2 2 - 2 - - - - - - - 2
CO3 2 - - - - - - - - - - 2
CO4 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
Data and Computer 8th Edition
1 William Stallings Pearson Education
Communication 2007

Reference Books
Name of the Edition and
Sl. No Title of the Book Name of the Author/s
Publisher Year
Data communication and 4th Edition
1 Behrouz A Forouzan McGraw Hill
Networking 2007
5th Edition
2 Computer Networks Andrew S Tanenbaum Pearson Education
2011
 Video Links (NPTEL, SWAYAM…)

No. Link ID
1 https://nptel.ac.in/courses/106105082
2 https://onlinecourses.nptel.ac.in/noc24_ee135/preview
3 https://nptel.ac.in/courses/106105082
 SEMESTER S4

FOUNDATIONS OF SECURITY

Course Code PEITT413 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.
PCITT205: Discrete Mathematical
Prerequisites (if any) Course Type Theory
Structures

Course Objectives:

1. To build a robust understanding of essential mathematical concepts and apply these theories
to understand and develop traditional and modern cryptographic techniques, including
substitution techniques, stream and block ciphers, and secret key ciphers.
2. To solve complex mathematical problems related to number theory and algebraic structures,
and apply these solutions to practical cryptographic scenarios.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Divisibility and Modular Arithmetic: Finite Fields – Groups, Rings and
Fields. Divisibility - Divisibility and Division Algorithms, Well ordering

1 Principle, Bezout’s Identity. Modular Arithmetic- Properties, Euclidean 9

algorithm for the greatest common divisor, Extended Euclidean Algorithm,
Least Common multiple, Modular Division.

Primes and Congruences: Prime Numbers - Prime Numbers and prime-

power factorization, Fermat and Mersenne primes, Primality testing and

2 factorization. Congruences - Linear congruences, Chinese Remainder 9

Theorem, 2*2 Linear Systems, Fermat’s little theorem, Pseudoprimes and
Carmichael numbers.

Euler's Function & Quadratic Residues: Euler's Function - Euler’s Totient

function, Applications of Euler’s Totient function, Quadratic Residues-

3 Quadratic Congruences, The group of Quadratic residues, Legendre symbol, 9

Jacobi Symbol, Quadratic reciprocity.
Sum of Squares and Continued Fractions: Sum of Squares - Sum of two
 squares, The Gaussian Integers, Sum of three squares, Sum of four squares.
Continued Fractions - Finite continued fractions, Infinite continued fractions.

Traditional and Modern Cryptosystems: Substitution Techniques,

Monoalphabetic Cipher, Caesar Cipher, Affine Cipher, Polyalphabetic

4 Ciphers, Autokey Cipher, Playfair Cipher, Hill Cipher, Vigenere Cipher, One 9
Time Pad Cipher, Limitations. Stream and Block Ciphers, Modern Secret
Key Ciphers - Substitution Box-Permutation Box-Product Ciphers.

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 fundamental concepts of divisibility, modular
CO1 arithmetic, and finite fields, and apply these concepts to solve K2
mathematical problems.
Solve problems related to prime numbers, congruences, and primality
CO2 testing, including the application of the Chinese Remainder Theorem K3
and Fermat's Little Theorem.
Apply Euler's Totient function, quadratic residues, and concepts of the
CO3 K3
group of units in various mathematical and cryptographic contexts.
Solve complex problems involving the sum of squares, continued
CO4 fractions, and traditional cryptosystems, and assess the effectiveness of K3
various cryptographic algorithms and techniques.
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create

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

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

CO2 3 3 3 3 - - - - - - - -

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

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

Text Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Elementary Number Theory 2nd Edition
1 Thomas Koshy Elsevier Science
with Applications 2007
2 Elementary Number Theory G.A. Jones & J.M. Jones, Springer UTM 2007
A Friendly introduction to
3 Joseph Silverman Pearson Ed 2009
Number Theory
 Reference Books
Name of the Edition and
Sl. No Title of the Book Name of the Author/s
Publisher Year
A Course in Number Theory
1 Neal Koblitz Springer New York 2012
and Cryptography
Cryptography and Network
4th Edition
2 Security: Principles and William Stalling Pearson Education
2016
Practice" by
Narosa Publishing
Introduction to Analytic
3 Tom M. Apostol House Pvt. Ltd, 1996
Number Theory’
New Delhi

Video Links (NPTEL, SWAYAM…)

No. Link ID
1 https://onlinecourses.nptel.ac.in/noc24_ma89/preview
2 https://onlinecourses.nptel.ac.in/noc22_cs90/preview
 SEMESTER S4

COMPUTER GRAPHICS

Course Code PEITT414 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 build an understanding of the fundamental concepts of computer graphics.
2. To familiarize the working principles of various display technologies.
3. To understand the three dimensional transformations in graphics.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Basics of Computer Graphics and its Applications. Raster Scan & Random
Scan systems. Display Technologies: Overview of CRT, LCD, Plasma, LED,
OLED, AMOLED, E-Paper displays.

1 Output Primitives – Line Drawing Algorithms - DDA, Bresenham’s, 9

Midpoint Circle generation algorithm.
Filled Area Primitives – Scan Fill, Flood Fill, Boundary Fill. Inside outside
tests.

Two-dimensional transformations - Translation, Rotation, Scaling,

Reflection and Shearing, Composite transformations, Matrix representations,
and homogeneous coordinates.
2 9
2-D Clipping- Window to viewport transformation, Point Clipping, Cohen-
Sutherland Line Clipping Algorithm, Sutherland-Hodgeman, and Weiler-
Atherton Polygon clipping algorithms.

Three-Dimensional Concepts: Three-Dimensional Display, Methods Parallel

3 Projection, Perspective Projection, Depth Cueing, Visible Line and Surface, 9
Identification, Surface Rendering, Exploded and Cutaway Views, Three-
 Dimensional and Stereoscopic Views
Three-Dimensional transformation, Translations, Scaling, Rotation, Viewing
Transformation, The Perspective, Algorithms, Three-Dimensional Clipping,
Perspective view of Cube

Visible Surface Detection Methods: Depth Buffer, A-Buffer, Scan line,

Depth sorting methods. Hidden Surface Removal: Back face detection - Z-

4 buffer method - Painter's algorithm - scan-line algorithm – BSP Trees - Area 9

sub-division method - Ray tracing - Animation - Morphing.
Introduction to Digital Image Processing.

Course Assessment Method

(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

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

5 15 10 10 40

End Semester Examination Marks (ESE):

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

Part A Part B Total

 2 Questions from each  Each question carries 9 marks.
module.  Two questions will be given from each module, out
 Total of 8 Questions, each of which 1 question should be answered.
60
carrying 3 marks  Each question can have a maximum of 3 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 working principles of graphics devices. Illustrate line
CO1 K3
drawing, circle drawing and polygon filling algorithms.
Demonstrate geometric representations and transformations on 2D
CO2 K3
objects. Explain the working of line and polygon clipping algorithms

CO3 Apply 3D transformation and viewing into the real-world applications K3

Describe visible surface detection methods and digital image
CO4 K2
processing.
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 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
Computer Graphics with Donald Hearn and M. 4th Edition
1 Pearson
OpenGL Pauline Baker 2013

Reference Books
Name of the Edition and
Sl. No Title of the Book Name of the Author/s
Publisher Year
nd
Principles of Interactive William M. Newman and 2 Edition
1 McGraw Hill
Computer Graphics Robert F. Sproull 2001
rd
Computer Graphics Using 3 Edition
2 Francis Hill Jr. Pearson Education
OpenGL 2007
Computer Graphics
V. Scott Gordon, John
3 Programming in OpenGL with De Gruyter 2024
Clevenger
C++
 Video Links (NPTEL, SWAYAM…)

No. Link ID
1 https://youtu.be/V4mP2pQyou0?si=znq_J6ES0MB03Qkm
2 https://youtu.be/8HWvyahgesY?si=1k1hCqfNE19Z00S3
3 https://youtu.be/7iYggzuo6Ks?si=G0Xnf1UA_dRRJaLf
4 https://youtu.be/b1Qpvqm0UAo?si=M6ALob-iLJ9E0i_r
 SEMESTER S4

OPERATIONS RESEARCH

Course Code PEITT415 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.
GAMAT301: Mathematics for
Prerequisites (if any) Course Type Theory
Information Science-3

Course Objectives:

1. This course introduces students to the fundamental concepts and methods of operations
research, focusing on applications in Information Technology.
2. Students will learn to model and solve real-world problems using OR techniques and tools.
3. Students will learn to model complex problems in diverse industries and use mathematical
optimization and simulation to solve them.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Modelling with Linear Programming: Two-Variable LP Model, Graphical
LP Solution, Linear Programming Applications - Investment, Production
Planning and Inventory Control, Workforce Planning, Urban Development

1 Planning - The Simplex Method - LP Model in Equation Form, The Simplex 9

Method - Iterative Nature of the Simplex Method, Computational Details of
the Simplex Algorithm-Artificial Starting Solution - M-Method, Two-Phase
Method.

Special Cases in the Simplex Method: Degeneracy, Alternative Optima,

Unbounded Solution, Infeasible Solution. Sensitivity Analysis - Algebraic
Sensitivity Analysis—Changes in the Right-Hand Side, Algebraic Sensitivity
2 Analysis—Objective Function, Sensitivity Analysis with TORA, Solver, and 9
AMPL. Computational Issues in Linear Programming.

Dual Problem: Definition of the Dual Problem, Primal–Dual Relationships.

Transportation Model: Definition of the Transportation Model,

3 9
Nontraditional Transportation Models, The Transportation Algorithm,
 Determination of the Starting Solution, Iterative Computations of the
Transportation Algorithm. The Assignment Model - The Hungarian Method

Decision Analysis and Games: Decision Making Under Certainty—

Analytic Hierarchy Process (AHP), Decision Making Under Risk, Decision

4 Tree–Based Expected Value Criterion, Variants of the Expected Value 9

Criterion. Decision Under Uncertainty Game Theory - Optimal Solution of
Two-Person Zero-Sum Games.

Course Assessment Method

(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

Internal Examination Evaluate Level Analyze Level

Attendance Total
(Written) Assessment Assessment

5 15 10 10 40

Evaluate and Analyze Level Assessment [20 Marks]

Students should evaluate and analyze a real-world optimization problem, assess the proposed
solutions, provide a conclusion on which solution is most appropriate for the problem, and
implement the chosen solution using Python.

Criteria for evaluation:

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

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

Part A Part B Total

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

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

Bloom’s
Course Outcome Knowledge
Level (KL)
Formulate and solve linear programming problems using both
CO1 graphical methods and the Simplex Method, applying these techniques K3
to real-world scenarios.
Analyze and resolve special cases in linear programming, such as
degeneracy, alternative optima, unbounded solutions, and infeasible
CO2 K4
solutions, and perform sensitivity analysis to understand the impact of
changes in problem parameters.
Apply transportation and network modeling techniques, including the
CO3 transportation algorithm, and the Hungarian method for assignment K3
problems
Utilize decision analysis tools and game theory to make informed
decisions under certainty, risk, and uncertainty, employing methods
CO4 K3
like the Analytic Hierarchy Process (AHP), decision trees, and
strategies for solving two-person zero-sum
Evaluate any real-world problem and propose a solution using the
CO5 K5
concepts learned in this course.
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create
 CO-PO Mapping Table (Mapping of Course Outcomes to Program Outcomes)

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 3 2 2 3 - - - - - - -
CO2 3 3 2 3 - - - - - - -
CO3 3 3 3 2 2 - - - - - - -
CO4 3 3 2 3 2 - - - - - -
CO5 3 3 3 3 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
Operations Research-An 10th Edition
1 Hamdy A Thaha Pearson Education
Introduction 2017
2 Operations Research T Veerarajan Universities Press 2017

Reference Books
Name of the Edition and
Sl. No Title of the Book Name of the Author/s
Publisher Year
Introduction to Operations Federick S Hiller, Gerald 9th Edition
1 Tata McGraw Hill
Research J Lieberman 2010
Prem Kumar Gupta & D 7th Edition
2 Operations Research S Chand Publishing
S Hira 2014
Linear and Nonlinear David G. Luenberger, 5th Edition
3 Springer
Programming Yinyu Ye 2021

Video Links (NPTEL, SWAYAM…)

No. Link ID
1 https://onlinecourses.swayam2.ac.in/cec20_ma10/preview
2 https://onlinecourses.nptel.ac.in/noc22_ma48/preview
 SEMESTER S4

ECONOMICS FOR ENGINEERS

(Common to All Branches)

Course Code UCHUT346 CIE Marks 50

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

Credits 2 Exam Hours 2 Hrs. 30 Min.

Prerequisites (if any) None Course Type Theory

Course Objectives:

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

SYLLABUS

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

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

Internal and External Economies – Cobb-Douglas Production Function

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

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

– Monopoly - Monopolistic Competition - Oligopoly (features and
equilibrium of a firm)
 Monetary System – Money – Functions - Central Banking –Inflation -
Causes and Effects – Measures to Control Inflation - Monetary and Fiscal
policies – Deflation

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

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

Course Assessment Method

(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

Assignment/ Internal Internal

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

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

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

Part A Part B Total

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

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

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

CO-PO Mapping Table:

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

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

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

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

Text Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Geetika, Piyali Ghosh
1 Managerial Economics Tata McGraw Hill, 2015
and Chodhury
H. G. Thuesen, W. J.
2 Engineering Economy PHI 1966
Fabrycky
3 Engineering Economics R. Paneerselvam PHI 2012
 Reference Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Leland Blank P.E,
1 Engineering Economy Mc Graw Hill 7TH Edition
Anthony Tarquin P. E.
2 Indian Financial System Khan M. Y. Tata McGraw Hill 2011
Engineering Economics and Donald G. Newman,
3 Engg. Press, Texas 2002
analysis Jerome P. Lavelle
Contemporary Engineering Prentice Hall of India
4 Chan S. Park 2001
Economics Ltd
 SEMESTER S3/S4

ENGINEERING ETHICS AND SUSTAINABLE DEVELOPMENT

Course Code UCHUT347 CIE Marks 50

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

Course Objectives:

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

SYLLABUS

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

Introduction to Environmental Ethics: Definition, importance and

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

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

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

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

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

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

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

Renewable Energy and Sustainable Technologies: Overview of renewable

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

Course Assessment Method

(CIE: 50 marks , ESE: 50)

Continuous Internal Evaluation Marks (CIE):

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

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

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

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

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

prepare a report

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

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

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

4 Final A comprehensive presentation summarising the key takeaways G 5

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

Total Marks 50

*Can be taken from the given sample activities/projects

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

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

Bloom’s
Course Outcome Knowledge
Level (KL)

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

CO1
professional life.
Develop the ability to exercise gender-sensitive practices in their K4
CO2
professional lives
Develop the ability to explore contemporary environmental issues and K5
CO3
sustainable practices.
Develop the ability to analyse the role of engineers in promoting K4
CO4
sustainability and climate resilience.
Develop interest and skills in addressing pertinent environmental and K3
CO5
climate-related challenges through a sustainable engineering approach.

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

CO-PO Mapping Table:

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

CO2 1 3 2 3 3 2 2

CO3 3 3 2 3 2 2

CO4 1 3 3 2 3 2 2

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

Cambridge University November

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

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

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

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

New age international

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

Tata McGraw Hill

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

Suggested Activities/Projects:

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

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

COMPUTER NETWORKS LAB

Course Code PCITL407 CIE Marks 50

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

Course Objectives:

1. To familiarize students with internetworking concepts and provide hands-on experience in

identifying, configuring, and troubleshooting key network components such as routers,
switches, and network interfaces
2. To enable students to configure, implement, and verify both static and dynamic routing
protocols, ensuring effective and efficient routing within a network.
3. To equip students with the skills to design, implement, and manage Virtual LANs (VLANs)
as well as configure and apply standard and extended access control lists (ACLs) for network
security and traffic management.
4. To teach students how to use remote login, file transfer, and automatic network configuration
protocols such as Telnet, FTP, and DHCP, enhancing their ability to manage and automate
network operations.

Experiment
Experiments
No.
Familiarization of network components- Hub, Switch, Bridge, Router, Access Point,
1
Network cables, Colour coding, Crimping.
Familiarization of Internetworking operating system – access the CLI, switch
2 between different command modes, basic IOS commands - to display device
information and configurations, to configure interface and basic troubleshooting.

3 Study of IPv4, IPv6 addresses and subnetting.

4 Configure and verify IPv4 static routing in a network that includes subnetting.

Configure and verify Routing Information Protocol (RIP) for dynamic routing in a
5
network that includes subnetting.
Configure and verify Enhanced Interior Gateway Routing Protocol (EIGRP) routing
6
in a network that includes subnetting.
Configure and verify Open Shortest Path First (OSPF) routing in a network that
7
includes subnetting.
 Implement Unicast IPv6 Addresses on routers and verify static routing, RIPNG and
8
OSPFv3.
Create and apply Standard and Extended ACLs on routers to filter traffic based on IP
9
addresses and protocols.
Configure VLANs and implement Inter-VLAN routing using router on a stick
10
technique.
Configure TELNET, login to a remote machine and view the files on the remote
11
machine. Configure FTP and transfer files between two machines.
Configure and verify the operation of a DHCP (Dynamic Host Configuration
12
Protocol) server in a network.

13 Configure and verify Network Address Translation (NAT) on a router.

14 Familiarize with any popular network simulator.

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

Conduct of
Procedure/ Result with valid
experiment/
Preparatory inference/ Viva
Execution of work/ Record Total
work/Design/ Quality of voce
troubleshooting/
Algorithm Output
Programming
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 Demonstrate internetworking and network components K3
CO2 Configure and verify both static and dynamic routing protocols K3
Develop the ability to implement and manage VLANs, standard and
CO3 K3
extended access lists.
Use remote login, file transfer and automatic network configuration
CO4 K3
protocols
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 - - - - - 2 - 2
CO2 3 2 3 2 - - - - 3 2 - 2

CO3 3 2 3 2 - - - - 3 2 - 2
CO4 3 2 3 2 - - - - 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
CCNA 200-301 Official Cert 2nd Edition
1 Wendell Odom Cisco Press
Guide, Volume 1 2024
CCNA –Cisco Certified Network 6th Edition
2 Todd Lammle Wiley India
Associate. Study Guide 2007

Reference Books
Name of the Name of the Edition and
Sl. No Title of the Book
Author/s Publisher Year
Computer Networking: The Complete
Beginner's Guide to Learning the Science &
1 Basics of Network Security, Computer Benjamin Walker Technology 2019
Architecture, Wireless Technology and
Communications Systems
Computer Networking Bible: The
Complete Crash Course to Effectively Independently
2 Rick C. Worley 2023
Design, Implement and Manage published
Networks.
 Video Links (NPTEL, SWAYAM…)

Link No. Link ID

1 https://archive.nptel.ac.in/courses/106/106/106106091/
2 https://archive.nptel.ac.in/courses/106/105/106105081/
3 https://archive.nptel.ac.in/courses/106/105/106105183/
4 https://archive.nptel.ac.in/courses/106/106/106106243/

Continuous Assessment (25 Marks):

5. Preparation and Pre-Lab Work (7 Marks)
 Pre-Lab Assignments: Assessment of pre-lab assignments or quizzes that test
understanding of the upcoming experiment.
 Understanding of Theory: Evaluation based on students’ preparation and understanding
of the theoretical background related to the experiments.
6. Conduct of Experiments (7 Marks)
 Procedure and Execution: Adherence to correct procedures, accurate execution of
experiments, and following safety protocols.
 Skill Proficiency: Proficiency in handling equipment, accuracy in observations, and
troubleshooting skills during the experiments.
 Teamwork: Collaboration and participation in group experiments.
7. Lab Reports and Record Keeping (6 Marks)
 Quality of Reports: Clarity, completeness, and accuracy of lab reports. Proper
documentation of experiments, data analysis and conclusions.
 Timely Submission: Adhering to deadlines for submitting lab reports/rough record and
maintaining a well-organized fair record.
8. Viva Voce (5 Marks)
 Oral Examination: Ability to explain the experiment, results, and underlying principles
during a viva voce session.

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

Evaluation Pattern for End Semester Examination (50 Marks):

6. Procedure/Preliminary Work/Design/Algorithm (10 Marks)
 Procedure Understanding and Description: Clarity in explaining the procedure and
understanding each step involved.
  Preliminary Work and Planning: Thoroughness in planning and organizing
materials/equipment.
 Algorithm Development: Correctness and efficiency of the algorithm related to the
experiment.
 Creativity and logic in algorithm or experimental design.
7. Conduct of Experiment/Execution of Work/Programming (15 Marks)
 Setup and Execution: Proper setup and accurate execution of the experiment or programming
task.
8. Result with Valid Inference/Quality of Output (10 Marks)
 Accuracy of Results: Precision and correctness of the obtained results.
 Analysis and Interpretation: Validity of inferences drawn from the experiment or quality of
program output.
9. Viva Voce (10 Marks)
 Ability to explain the experiment, procedure results and answer related question.
 Proficiency in answering questions related to theoretical and practical aspects of the subject.
10.Record (5 Marks)
 Completeness, clarity, and accuracy of the lab record submitted
 SEMESTER S4

OPERATING SYSTEMS LAB

Course Code PCITL408 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) GXEST204: Programming in C Course Type Lab

Course Objectives:

1. Students will be able to perform basic and advanced UNIX commands, system calls, threads
and inter process communication essential for operating system functionalities.
2. Students will be able to solve classical synchronization problems using appropriate techniques
such as semaphores, threads, and shared memory.
3. Students will be able to understand and implement various memory management schemes,
page replacement algorithms, disk scheduling algorithms, and file organization techniques.

Experiment
Experiments
No.
Familiarization of system calls (fork, exec, getpid, exit, wait, close, stat etc) in
1 operating system and Demonstration of creating partition and installing Operating
System (Not for Examination purpose)
Implementation of Process and thread (Life cycle of process): (i) Process creation and
2
Termination; (ii) Thread creation and Termination
Implement process scheduling algorithms (FCFS, SJF, Round Robin, Priority) and
3
compute average waiting time and average turn-around time.

4 Inter-process communication using pipes, message queues and shared memory.

5 Implement Producer-Consumer Problem and solve the problem using Semaphores

6 Implementation of Dining Philosophers’ Problem using threads and semaphores

7 Implementation of banker’s algorithm

8 Implement memory management schemes (first fit, best fit and worst fit)

9 Implement page replacement algorithms: FIFO, LRU and Optimal

 Implementation of Disk Scheduling using FCFS, SCAN, C-SCAN, LOOK, C-LOOK
10
and SSTF algorithm
Implement File Organization Technique (Single Level and Multi-Level Directory)
11
and Allocation Strategies (Sequential, Linked and Indexed)

12 Familiarization of Cloud Platforms and Virtualization tools(eg:-VMWare)

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

Conduct of
Procedure/ Result with valid
experiment/
Preparatory inference/ Viva
Execution of work/ Record Total
work/Design/ Quality of voce
troubleshooting/
Algorithm Output
Programming
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)
Implement process and thread lifecycle management, including
CO1 K3
creation, termination, and scheduling.
Implement inter-process communication techniques such as pipes,
CO2 K3
message queues, and shared memory.
Solve classical synchronization problems like Producer-Consumer and
CO3 K3
Dining Philosophers using semaphores and threads.
Implement memory management and disk scheduling algorithms, and
CO4 K3
understand file organization and allocation strategies.
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create
CO-PO Mapping Table (Mapping of Course Outcomes to Program Outcomes)

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

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

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

Abraham Silberschatz,
10th Edition
1 Operating System Concepts Peter B Galvin, Greg John Wiley & Sons
2021
Gagne

Mc Graw Hill 8th Edition

2 Programming in C E. Balagurusamy
2019

Reference Books
Name of the Edition and
Sl. No Title of the Book Name of the Author/s
Publisher Year
Pearson 4th Edition
1 Modern Operating Systems Andrew S Tanenbaum
2016
6th Edition
2 C Primer Plus Stephen Prata Pearson
2020
 Video Links (NPTEL, SWAYAM…)

Link No. Link ID

1 https://onlinecourses.nptel.ac.in/noc24_cs80/preview
2 https://onlinecourses.nptel.ac.in/noc24_cs123/preview

Continuous Assessment (25 Marks):

1. Preparation and Pre-Lab Work (7 Marks)
 Pre-Lab Assignments: Assessment of pre-lab assignments or quizzes that test
understanding of the upcoming experiment.
 Understanding of Theory: Evaluation based on students’ preparation and understanding
of the theoretical background related to the experiments.
2. Conduct of Experiments (7 Marks)
 Procedure and Execution: Adherence to correct procedures, accurate execution of
experiments, and following safety protocols.
 Skill Proficiency: Proficiency in handling equipment, accuracy in observations, and
troubleshooting skills during the experiments.
 Teamwork: Collaboration and participation in group experiments.
3. Lab Reports and Record Keeping (6 Marks)
 Quality of Reports: Clarity, completeness and accuracy of lab reports. Proper
documentation of experiments, data analysis and conclusions.
 Timely Submission: Adhering to deadlines for submitting lab reports/rough record and
maintaining a well-organized fair record.
4. Viva Voce (5 Marks)
 Oral Examination: Ability to explain the experiment, results and underlying principles
during a viva voce session.

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

Evaluation Pattern for End Semester Examination (50 Marks):

1. Procedure/Preliminary Work/Design/Algorithm (10 Marks)
 Procedure Understanding and Description: Clarity in explaining the procedure and
understanding each step involved.
 Preliminary Work and Planning: Thoroughness in planning and organizing
materials/equipment.
  Algorithm Development: Correctness and efficiency of the algorithm related to the
experiment.
 Creativity and logic in algorithm or experimental design.
2. Conduct of Experiment/Execution of Work/Programming (15 Marks)
 Setup and Execution: Proper setup and accurate execution of the experiment or programming
task.
3. Result with Valid Inference/Quality of Output (10 Marks)
 Accuracy of Results: Precision and correctness of the obtained results.
 Analysis and Interpretation: Validity of inferences drawn from the experiment or quality of
program output.
4. Viva Voce (10 Marks)
 Ability to explain the experiment, procedure results and answer related question.
 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
INFORMATION TECHNOLOGY
 SEMESTER S5
MACHINE LEARNING

Course Code PCITT501 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) PBITT404 Data Science Course Type Theory

Course Objectives:

1. Gain a comprehensive core machine learning concepts, pre-process and analyze data, build
and assess supervised learning models, and interpret their performance.

2. Acquire the knowledge of implementing and fine-tuning advanced machine learning models,
including SVMs and neural networks, and effectively use unsupervised learning,
reinforcement learning, and deep learning methods to solve complex problems.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Overview of Machine Learning - Introduction to Machine Learning,
Examples of Machine Learning Applications - Learning Associations,
Classification, Regression, Unsupervised Learning, Reinforcement Learning.
Parametric Methods - Maximum Likelihood Estimation- Bernoulli Density,
Multinomial Density, Gaussian (Normal) Density, Evaluating an Estimator:
1 10
Bias and Variance, The Bayes’ Estimator, Parametric Classification,
Regression, Tuning Model Complexity: Bias/Variance Trade-off.
Dimensionality Reduction – Principal Component Analysis, Linear
Discriminant Analysis.

Supervised Learning - Linear Regression - Least squares, Gradient

Descent, Assessing Performance: Error Metrics, Overfitting, Linear
Classifiers - Logistic regression, Naïve Bayes’, Measuring Classifier
2 Performance – Confusion Matrix, Cross Validation. Bootstrapping, Model 12
Selection Procedures, Regularization Techniques – LASSO, RIDGE.
Learning with Trees - Decision Trees, Types- Classification and Regression
 Trees, Feature Selection Measures - Entropy, Information Gain, ID3
Algorithm, Issues in Decision tree Learning, Ensemble Learning – Boosting
– Bagging.

Support Vector Machine – Optimal Separating hyper plane, Soft-margin &

Hard- margin, Kernel trick, Kernel functions.
3 10
Neural Networks – The Perceptron Algorithm, Activation Functions, Feed
Forward Network, Back Propagation Algorithm.

Unsupervised Learning - Clustering Methods - K-means, Expectation-

Maximization Algorithm, Density based clustering.

4 Reinforcement Learning - Monte Carlo, TD Learning, Q Learning. 12

Basics of Deep Learning - Convolutional Neural Networks – Convolution,
Pooling Layers, Hyperparameters, Transformers.

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

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

Bloom’s
Course Outcome Knowledge
Level (KL)
Explain basic machine learning concepts, parametric methods for
CO1 K2
estimation and dimensionality reduction techniques to improve models.
Use supervised learning methods like linear regression and decision
CO2 K3
trees, evaluate model performance and ensemble techniques.
Use Support Vector Machines and Neural Networks, including
CO3 understanding margins, kernel functions, and the basics of the K3
perceptron algorithm and back propagation.
Apply clustering methods, reinforcement learning techniques, and
CO4 basic deep learning concepts like convolutional neural networks and K3
transformers.
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create

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

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

Text Books
Name of the Edition and
Sl. No Title of the Book Name of the Author/s
Publisher Year
Introduction to Machine Third Edition,
1 Ethem Alpaydin MIT Press
Learning 2014
McGraw Hill First Edition,
2 Machine Learning Tom M Mitchell
Education 2013
Reinforcement Learning – An
Richard S. Sutton, Andrew Second
3 Introduction MIT Press
G. Barto, Francis Bach Edition, 2018

Ian Goodfellow, Yoshua 1st Edition,

4 Deep Learning MIT Press
Bengio and Aaron Courville 2016.
 Reference Books
Name of the Edition and
Sl. No Title of the Book Name of the Author/s
Publisher Year
rd
Data Mining Concepts & Jiawei Han, Micheline 3 Edition,
1 Morgan Kaufmann
Techniques Kamber and Jian Pei. 2012
Gareth James, Daniela
An Introduction to Statistical
Witten, Trevor 2nd Edition,
2 Learning: with Applications in Springer
Hastie , Robert 2021
R
Tibshirani
Neural Networks for Pattern Oxford University 1995
3 Christopher Bishop
Recognition Press
Neural Networks and Deep
4 Charu C. Aggarwal Springer 2019
Learning: A Textbook

Video Links (NPTEL, SWAYAM…)

No. Link ID
1 https://nptel.ac.in/courses/106106139
2 https://archive.nptel.ac.in/courses/106/106/106106184
3 https://nptel.ac.in/courses/106106198
 SEMESTER S5

ALGORITHM ANALYSIS AND DESIGN

Course Code PEITT502 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) PCITT303 - Data structures Course Type Theory

Course Objectives:

1. Understand and Apply Fundamental Algorithmic Concepts

2. Master Algorithm Design Paradigms and Complexity Analysis

SYLLABUS

Contact
Module Hours
Syllabus Description
No. (44
Hrs)
Algorithms – Properties of a Good algorithm, Characteristics, Criteria for
Analysing Algorithms.
Time and Space Complexity - Best, Worst and Average Case Complexities.
Asymptotic Notations and their properties.
Time and Space Complexity Calculation of simple algorithms.
1 11
Analysis of Recursive Algorithms: Recurrence Equations,
Solution of Recurrence Equations – Iteration Method, Recursion Tree
Method, Substitution method and Master’s Theorem (Proof not required).
Amortized Complexity – aggregate analysis, Cost-Accounting and Potential
Methods.
Balanced Search Trees - AVL Trees (Insertion and deletion operations with
all rotations in detail, algorithms not expected); Red Black Trees – Properties
Disjoint Sets- Disjoint set operations, Union and find algorithms, Analysis of

2 union by rank with path compression, Connected components of a Graph. 11

Graphs – Representations, Traversals – BFS, DFS and their analysis,
Strongly Connected Components, Topological Sorting.
 Divide and Conquer – Control Abstraction, Finding Minimum and
Maximum, Quicksort, Merge Sort, Strassen’s Matrix Multiplication, analysis
Greedy Algorithms: Control Abstraction, Fractional Knapsack, Minimum
Cost Spanning Tree – Kruskal’s and Prim’s, analysis, Job Sequencing with
deadlines
3 11
Dynamic Programming: Control Abstraction, Optimality Principle, DP
Solution for Travelling Salesman Problem and 0/1 Knapsack Problem,
Backtracking: Control Abstraction, N – Queens Problem, algorithm.
Branch and Bound: Control Abstraction, FIFO, LIFO and LC Branch and
Bound, 15 – Puzzle Problem
String Matching – KMP Algorithm, Rabin-Karp Algorithm.
4 11
Tractable and Intractable Problems, Complexity Classes – P, NP, NP- Hard
and NP-Complete Classes.
Approximation algorithms- Planar Graph Coloring, Vertex Cover

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)
Explain asymptotic notations used in the performance analysis of
CO1 algorithms, to solve recurrence equations and study the amortized K2
analysis.
Apply divide and conquer strategy to solve practical problems
CO2 K3
efficiently
Apply greedy and dynamic programming techniques in algorithm
CO3 K3
design
Apply backtracking and branch and bound techniques in algorithm
CO4 K3
design.
Explain Balanced Search Trees, Graph Traversals, and sophisticated
CO5 K2
algorithms such as string matching and approximation algorithms
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create

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

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

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

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

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

CO5 3 3 3 3 - - - - 1 1 - 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
T.H.Cormen,
2nd Edition
1 Introduction to Algorithms C.E.Leiserson, Prentice-Hall India
(2001)
R.L.Rivest, C. Stein
Ellis Horowitz, Sartaj
Fundamentals of Computer Orient Longman 2nd Edition
2 Sahni, Sanguthevar
Algorithms Universities Press (2008)
Rajasekaran
Computer Algorithms,
Sara Baase and Allen 3rd Edition
3 Introduction to Design and Pearson Education
Van Gelder (2009)
Analysis
 Reference Books
Name of the Edition and
Sl. No Title of the Book Name of the Author/s
Publisher Year
Jon Kleinberg and Éva 1st Edition
1 Algorithm Design Pearson
Tardos 2005
Robert Sedgewick and 4th Edition
2 Algorithms Addison-Wesley
Kevin Wayne 2011
Computers and Intractability: A
Michael R. Garey and 1st Edition
3 Guide to the Theory of NP- W. H. Freeman
David S. Johnson 1979
Completeness

Video Links (NPTEL, SWAYAM…)

No. Link ID
1 https://onlinecourses.nptel.ac.in/noc24_cs79/
 SEMESTER S5

SOFTWARE ENGINEERING

Course Code PCITT503 CIE Marks 40

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

Course Objectives:

1. To understand the fundamental concepts of Software Engineering, Software Development

Life Cycle (SDLC) and Software Process Models.
2. To develop proficiency in Object-Oriented Modeling and Design.

SYLLABUS

Module Contact
Syllabus Description
No. Hours

The Software Process: Software Engineering, Software Process, Software

Engineering Practice, Phases of Software Development Life Cycle (SDLC)-
Requirements, Design, Implementation, Testing, Deployment and
1 9
Maintenance, Software Process models- Prescriptive and Specialized Process
Models, Characteristics of Software Engineer, Software Team, Team
Structure, Software Engineering Ethics.

Requirements Engineering: Functional and Non-Functional Requirements,

Requirement Engineering Process, Requirements elicitation, Requirements
2 9
Specification, SRS Template, Requirements Validation, Requirements
Change, Requirement Analysis, Case Study.

Object Oriented Modeling: Object Oriented Development, Modeling,

Abstraction, Objects and Classes, Link and Association Concepts,
3 Generalization and Inheritance, N-ary Association, Abstract classes, 9
Aggregation, Packages, State Modeling, Interaction Modeling, Structural
Modeling, Behavioral Modeling.
 Object Oriented Design: Design Process, Design Concepts- Cohesion,
Coupling, Design Model, System Design, Class Design, Architectural
Design- Architectural design decisions, Architectural Views, Architectural
4 9
Patterns and Application architectures, Component-level Design, Design and
Implementation- Object-oriented design using the UML, Open-source
development.

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)

Discuss the software process and lifecycle models of software

CO1 engineering, including the roles of software engineers in various K2
phases of development.
Apply various techniques to elicit requirements from stakeholders,
create detailed requirement specifications, and ensure that requirements
CO2 K3
are well-defined and traceable throughout the software development
process.
Apply object-oriented modeling techniques to design and document
CO3 K3
software systems.
Explain the fundamental principles of software design, including
CO4 K2
design process and architectural patterns.
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create

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

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

CO1 2 - - - 2 - - 2 2 - 2 2

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

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

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

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

 Text Books

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

1 Software Engineering: A Roger S Pressman, Tata McGraw 8th edition, 2019

Practitioner’s Approach Bruce R Maxim Hill
2 Software Engineering Ian Somerville Pearson 10th edition,2017
3 Object-oriented modeling and Michael R Blaha, James Pearson 2nd edition, 2007
design with UML R Rumburg

Reference Books

Name of the Edition and

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

1 Fundamentals of Software Rajib Mall PHI 5th edition,

Engineering 2018

2 Software Engineering: Theory Shari Pfleeger, Joanne Pearson 4th edition,

and Practice Atlee 2009

3 Applying UML and Patterns: Craig Larman PHI 3rd edition,

An Introduction to Object- 2004
Oriented Analysis and Design
and Iterative Development

4 Design Patterns: Elements of Erich Gamma Pearson 1st edition,

Reusable object-oriented 2015
software

Video Links (NPTEL, SWAYAM…)

No. Link ID
1 https://onlinecourses.nptel.ac.in/noc24_cs119/preview
 SEMESTER S5
WEB APPLICATION DEVELOPMENT
Course Code PBITT504 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.
GYEST203: Foundations of Computing:
Prerequisites (if any) From Hardware Essentials to Web Design Course Type Theory
and GYEST204: Programming in C

Course Objectives:
1. Students will be able to gain a comprehensive understanding of javascript, node.js and mongodb to
develop web applications.
2. Students will be able to develop web application based solutions to real world problems using modern
web application development tools.

SYLLABUS
Module Contact
Syllabus Description
No. Hours
Javascript: How javascript makes web pages more interactive, Examples of
javascript in the browser, How html, css & javascript fit together, creating a basic
javascript, placing the script in the page, where to place your scripts, basic
Javascript instructions: statements, comments, variables, data types, arrays,
expressions, operators; functions methods and objects: function, anonymous
function, variable scope, object, this keyword, arrays of objects and objects in
arrays built-in objects, browser object model, document object model, Global
objects: string, number, math, date

1 DOM: Document Object Model (DOM), working with DOM tree, accessing 9
elements, nodelists, selecting elements: using class attribute, tag name, css
selectors; repeating actions for an entire nodelist, looping through a nodelist,
traversing the DOM, previous & next sibling, first & last child, textcontent, adding
or removing html content, update text and markup, adding/removing elements,
creating attributes and changing their values, removing attributes
Event handling: different event types, three ways to bind an event to an element,
using DOM event handlers, using event listeners, using parameters with event
listeners, the event object, event bubbling, user interface events
ECMA Script: ECMA Script versions, ES5 Features, ES6 introduction,
var declarations and hoisting, let declaration, constant declaration, function

2 with default parameter values, default parameter expressions, unnamed 10

parameters, the spread operator, arrow functions, object destructuring, array
destructuring, sets and maps, Array.find, Array.findIndex, template strings,
 javascript classes, callbacks, promises, async/await

AJAX: What is Ajax?, why use ajax?, How ajax works?, Handling ajax request
and response, data formats: XML, JSON; Working with JSON data, Loading
HTML with Ajax, Loading JSON with ajax, working with data from other servers
JQUERY: A basic jquery example, Why use Jquery?, finding elements, jquery
selection, getting element content, updating elements, changing content, inserting
elements, adding new content, getting and setting attributes, getting and setting css
properties, using .each(), events, event object, effects, animating css properties,
using animation, traversing the dom, working with forms, jquery and ajax
Node.js: What is Node.js?, installing Node.js, creating first server, request and
response, responding with HTML, installing custom packages with NPM,
introduction to express, handling request with express, serving other html files,
serving static files with express, automatic server restart with nodemon, public
folder for serving static files, creating page routes, templating engines
3 MongoDB: Architecture of MongoDB, installing MongoDB, mongoose, defining
10
a model, CRUD operations with Mongoose models, reading data from MongoDB
using Mongoose, updating record, deleting a single record, saving to the database,
dynamic data with templating engines, adding fields to the schema, uploading
image with express, saving uploaded images to database
Refactoring to MVC: Express middleware, custom middleware, registering
validation middleware, refactoring to MVC, refactoring validation layer, mongoose
validation, password encryption, user login process, user authentication with
express sessions, authentication middleware, user logout, handling non-existent

4 routes, displaying validation errors in templates, duplicate entry error, flushing 7

error messages from session, customising error message, persist request data on
form, adding a WYSIWYG editor
Deployment: setting up MongoDB atlas, deploying web apps on Heroku,
deployment

Suggestions on Project Topics:

No. Project Topics

1 Countdown clock (javascript)

2 To do list (javascript)

3 Rock paper scissors game (javascript)

4 Shopping cart page (javascript)

5 Calculator app (javascript)

 6 Memory game (javascript)

7 Movie app (Node.js, Express, MongoDB)

8 Chat app (Node.js, Express, MongoDB)

9 Hotel booking app (Node.js, Express, MongoDB)

10 Library app (Node.js, Express, MongoDB)

11 Job search app (Node.js, Express, MongoDB)

12 E-commerce website (Node.js, Express, MongoDB)

Course Assessment Method

(CIE: 60 marks, ESE: 40 marks)

Continuous Internal Evaluation Marks (CIE):

Internal Internal Examination-

Attendance Project Examination-1 2 Total
(Written) (Written)

5 30 12.5 12.5 60

End Semester Examination Marks (ESE):

In Part A, all questions need to be answered and in Part B, each student can choose any one
full question out of two questions
Part A Part B Total
● 2 Questions from each module. ● Two questions will be given from each module, out of
● Total of 8 Questions, each which 1 question should be answered.
carrying 2 marks ● Each question can have a maximum of 2 sub divisions.
● Each question carries 6 marks. 40
(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)
Apply the fundamental concepts of javascript to add user interaction in the
CO1 website.
K3

CO2 Compare javascript, jquery in terms of performance and ease of use. K2

CO3 Build web applications with Node.js, express and MongoDB. K3
Develop and deploy web applications with Node.js, express, MongoDB
CO4 adhering to MVC 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 2 2 3 - 2 - - - 2 - - 2

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

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

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

Text Books
Edition and
Sl. No Title of the Book Name of the Author/s Name of the Publisher
Year
Javascript and JQuery: Interactive 1st Edition
1 Jon Ducket Wiley
front end development 2013
1st Edition
2 Understanding ECMASCRIPT6 Nicholas C Zakas No starch press
2016
Beginning Node.js, Express and 1st Edition
3 Greg Lim Greg Lim
mongoDB development 2019

Reference Books
Name of the Edition and
Sl. No Title of the Book Name of the Author/s
Publisher Year
HTML & CSS : Design and build
1 Jon Duckett Wiley 1st Edition 2011
websites
Internet & World Wide Web how Paul Deitel, Harvey Deitel,
2 Deitel 5th Edition 2013
to programme Abbey Deitel
Web development with Node &
3 Ethan Brown O’Reilly 1st Edition 2014
Express

Video Links (NPTEL, SWAYAM…)

No. Link ID

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

Assessment and Evaluation for Project Activity

Sl. Allotted
Evaluation for
No Marks
1 Project Planning and Proposal 5
2 Contribution in Progress Presentations and Question Answer Sessions 4
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
SOFT COMPUTING

Course Code PEITT521 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) PCITT303 Data structures Course Type Theory

Course Objectives:

1. To provide students with an understanding of computing techniques that handle imprecision,

uncertainty, and approximation.
2. To equip students with both theoretical knowledge and practical skills in soft computing,
preparing them for advanced studies or professional work in the field.
SYLLABUS

Module Contact
Syllabus Description
No. Hours
Introduction to Soft Computing and Neural Networks: Evolution of
Computing, Soft Computing Definition, Comparison with Hard Computing,
Soft Computing Basic Components, Scope and Applications, Structure of
1 9
Artificial Neuron and Biological Neuron, Activation functions, McCulloch-
Pitts Neuron, Single-layer Perceptron, Multi-layer Feedforward Networks,
Learning Logic GATE Functions, Backpropagation Neural Networks.

Fuzzy Logic and Fuzzy Sets: Fuzzy Logic, Classical Sets, Fuzzy Sets, Fuzzy
Relations, Operations on Fuzzy Relations, Fuzzy Membership Functions,
2 9
Fuzzification, Methods of Membership Value Assignments, Defuzzification
Methods.

Fuzzy Rule Base and Approximate Reasoning: Fuzzy Rules- Formation,

Decomposition and Aggregation, Fuzzy Reasoning, Fuzzy Inference System-

3 Mamdani Fuzzy Inference System and Takagi Sugeno Fuzzy Model, 9

Comparison between Mamdani and Sugeno Method, Fuzzy Decision
Making.
 Genetic Algorithm and Hybrid Systems: Basic Version of Genetic
Algorithm, Encoding Methods, Selection Mechanisms, Crossover

4 Techniques, Mutation Operators, Hybrid Soft Computing Systems- Neuro 9

Fuzzy Hybrid System, Neuro Genetic Hybrid System and Fuzzy Genetic
Hybrid 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)
Describe the role of soft computing techniques and apply various
CO1 artificial neural networks to learn and approximate logic gate K3
functions.
Design and implement fuzzy logic systems to handle uncertainty and
CO2 imprecision and apply these systems to solve engineering problems and K3
decision-making tasks.
Apply genetic algorithms to solve complex optimization problems,
CO3 including defining suitable fitness functions and selecting appropriate K3
genetic operators.
Explain hybrid systems that integrate multiple soft computing
CO4 K2
techniques to address complex problems.
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 2 2 2 - - 2 - - 2

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

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

CO4 3 2 2 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
2nd
S.N. Sivanandam,
1 Principles of Soft Computing Wiley India Pvt. Ltd. Edition,
S.N. Deepa
2011
Neural Networks, Fuzzy Logic
S. Rajasekaran,
2 and Genetic Algorithm, PHI Learning Pvt. Ltd. 2017
G.A. Vijayalakshmi Pai
Synthesis and Applications
Fuzzy Sets and Fuzzy Logic-
3 George J. Klir, Bo Yuan Prentice Hall 1996
Theory and Applications
Jyh-Shing Roger Jang,
Neuro-Fuzzy and Soft
4 Chuen-Tsai Sun, Eiji Prentice-Hall 2002
Computing
Mizutani
 Reference Books
Name of the Edition and
Sl. No Title of the Book Name of the Author/s
Publisher Year
Neural Networks Algorithms,
James A. Freeman,
1 Applications, and Programming Addison Wesley 2003
David M. Skapura
Techniques
Introduction to Artificial
2 Jacek M. Zurada PWS Publishers 1992
Neural Systems
An Introduction to Genetic
3 Mitchell Melanie Prentice Hall 1998
Algorithm
Genetic Algorithms in Search,
4 Optimization and Machine David E. Goldberg Addison Wesley 1997
Learning

Video Links (NPTEL, SWAYAM…)

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

INTERNETWORKING USING TCP/IP

Course Code PEITT522 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.
PCITT402 Computer
Prerequisites (if any) Course Type Theory
Networks

Course Objectives:

1. To familiarize with various protocols in TCP/IP suit.

2. To equip students to apply their knowledge in solving issues in handling IP networks
3. To familiarize with the different routing scenarios in unicasting & multicasting in IP
networks.
4. To familiarize with label switching & technology and MPLS.
SYLLABUS

Module Contact
Syllabus Description
No. Hours
TCP/IP protocol suite- Comparison between OSI and TCP/IP Protocol Suite
Layers in the TCP/IP Protocol Suite, Addressing, IPv4 Addresses - Address
Space, Notation, Range of Addresses, Classful Addressing, Classless
Addressing (simple problems on subnetting), Special Addresses, NAT,
1 9
Delivery and Forwarding of IP Packets - Delivery, Forwarding - Forwarding
Based on Destination Address, Forwarding with Classful Addressing
(without and with subnetting), Forwarding with Classless Addressing,
Address Aggregation, Longest Mask Matching, Structure of a Router.

IPv4 - Datagram, Fragmentation, Options, Checksum, Address Mapping-

ARP Protocol, ARP Package, ICMPv4- ICMP encapsulation, Messages,
Debugging Tool, ICMP package, Mobile IP - addressing, agents, three
2 9
phases, inefficiency in mobile IP,

Unicast Routing Protocols - RIP, OSPF - Areas, Types of Links, OSPF

Packets, Common Header, Link State Update Packet (general format & LSA
 general header only), Hello Message, Database Description Message, Link
State Request Packet, Link State Acknowledgment Packet), BGP.

Multicasting and Multicast Routing Protocols - Multicasting, Multicast

Addresses in IPv4, Delivery of Multicast Packets at Data Link Layer, IGMP
- Group Management, IGMP Messages (Membership Query Message
3 9
Format, Three Formats of Query Messages, Membership Report Message
Format), Multicast routing, Multicast routing protocols - MOSPF, DVMRP,
PIM.

TCP - TCP Services, TCP features, TCP Segment format & encapsulation,
State transition diagram (TCP connection management), Windows in TCP,
TCP timers, TCP options, TCP Package,
IPv6 - Notations, Address Space, Three address types, Address Space
allocation Algorithm, Auto Configuration, Renumbering, Packet Format
4 9
(base header and extension headers),
Label Switching, Flows, and MPLS- Switching Technology, Flows and Flow
Setup, Large Networks, Label Swapping, and Paths, IP Switching
Technologies and MPLS, Labels and Label Assignment, MPLS
Encapsulation, Label Switching Router (Text Book 2)

Course Assessment Method

(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

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

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

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

Part A Part B Total

● 2 Questions from each ● Each question carries 9 marks.
module. ● Two questions will be given from each module, out
● Total of 8 Questions, each of which 1 question should be answered.
60
carrying 3 marks ● Each question can have a maximum of 3 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 IP addressing & IP forwarding concepts in solving
CO1 K3
addressing problems
CO2 Understand the IP layer unicast routing protocols ICMPv4 and ARP. K2
CO3 Illustrate the concepts of multicasting and multicast routing protocols. K2
CO4 Summarize the TCP protocol concepts and TCP package. K2

CO5 Understand IPv6, Label Switching, Flows, And MPLS 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 - - - - - - - 3
CO2 2 2 2 2 - - - - - - - 3
CO3 2 2 - 2 - - - - - - - 3
CO4 2 2 - 2 - - - - - - - 3
CO5 2 2 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
Fourth
1 TCP/IP Protocol Suite Behrouz A. Forouzan McGraw-Hill
Edition
Internetworking With TCP/IP Sixth
2 Vol I: Principles, Protocols, and Douglas E. Comer Pearson Education
Architecture Edition

Reference Books
Name of the Edition and
Sl. No Title of the Book Name of the Author/s
Publisher Year
Computer
Computer Networks: A Larry Peterson and Networks: A
1 Larry Peterson
Systems Approach Bruce Davie Systems
Approach

Video Links (NPTEL, SWAYAM…)

No. Link ID
1 https://onlinecourses.nptel.ac.in/noc24_cs69/preview
 SEMESTER S5
CLOUD COMPUTING
Course Code PEITT523 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.
PCITT402 Computer Networks
Prerequisites (if any) Course Type Theory
PCITT403 Operating Systems

Course Objectives:
1. Gain a comprehensive understanding of cloud computing principles, including service and deployment
models, and the key characteristics that define cloud computing.
2. Familiarize with the cloud computing reference architecture and understand the significance of
virtualization in cloud computing.
3. Explore various cloud software environments and the architectural design of computing and storage
clouds.
4. Learn about the security challenges in cloud computing, the role of cryptography, and various
architectures to ensure secure data storage and processing in the cloud.
5. Gain proficiency in parallel and distributed programming models and develop practical skills in using
major cloud platforms.
SYLLABUS
Module Contact
Syllabus Description
No. Hours
Cloud Computing – Introduction. Overview of Computing Paradigms-Grid
Computing, Cluster Computing, Distributed Computing, Utility Computing. Cloud
Service Models - Software as a Service, Platform as a Service, Infrastructure as a
Service. Cloud Deployment Models - Private Cloud, Public Cloud, Community

1 Cloud, Hybrid Cloud. Characteristics of Cloud Computing. Advantages and 9

disadvantages of cloud computing. Cloud Computing Reference Architecture-Cloud
Consumer, Cloud Provider, Cloud Auditor, Cloud Broker, Cloud Carrier, IBM
Cloud Computing Reference Architecture. Cloud Computing Use Cases - Business
Use Cases, Technical Use Cases

Virtualization- Introduction. Characteristics of Virtualization. Importance of

Virtualization. Classification of Virtualization-Network Virtualization, Desktop
Virtualization, Application Virtualization, Central Processing Unit Virtualization,
2 Memory Virtualization, Input/Output Devices Virtualization. Virtualization to 10
Private Cloud Services -Five High-Level Steps. Virtualization Architecture-
Virtualization Platforms, Hypervisor. Tools and Mechanisms for Implementation of
Virtualization. Physical and Virtual Clusters and Resource Management. Importance
 of Virtualization in Data Center Automation.

Architectural Design of Compute and Storage Clouds-Data Center Interconnection

Networks and Design, Architectural Design of Computing Clouds, Cloud Service
Models and Platforms, Resource Management and Design Challenges. Fundamental
Cloud Security-Threat agents, Cloud security threats, Operating system security,
Infrastructure security-
3 Network Level Security, Host Level Security, Application level security. Secure
10
Distributed Data Storage in Cloud - Cryptography as a Primary Technique to Ensure
Security, Gartner’s Seven Cloud Computing Security Risks, Need for Data Security.
Cloud Computing—Attacks. Cloud Data Security Requirements. Cloud Security—
Controls. Cloud Security Architecture. Cloud Data Security.
Parallel and Distributed Programming Models. MapReduce- MapReduce
Programming Model, Logical Data Flow and Control Flow, Case Study: MapReduce
Program to Find Inverted Index of Documents. Twister and Iterative MapReduce,
Hadoop Library, Apache Spark. Cloud Software Environments-Eucalyptus,
OpenNebula, OpenStack, Aneka, CloudSim. Popular Cloud Databases – MongoDB,
4 HBase. Popular Cloud Platforms. Amazon Web Services- Amazon Web Services
9
(AWS)- Elastic Compute Cloud (EC2), Simple Storage Service (Amazon S3),
Elastic Block Store (EBS), Amazon CDN services. Google Cloud Platform (GCP)-
Compute Engine (GCE), Google App Engine (GAE), Cloud Storage, Gmail, Google
Drive. Microsoft Azure- Azure Virtual Machine, Hyper-V, Azure Storage services.

Course Assessment Method

(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

Internal Internal Examination-

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

5 15 10 10 40
 End Semester Examination Marks (ESE):
In Part A, all questions need to be answered and in Part B, each student can choose any one
full question out of two questions
Part A Part B Total
● 2 Questions from each module. ● Each question carries 9 marks.
● Total of 8 Questions, each ● Two questions will be given from each module, out of
carrying 3 marks which 1 question should be answered.
● 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)
Describe the fundamental concepts of cloud computing, including service and
CO1 K2
deployment models, and the cloud computing reference architecture.
Explain the principles of virtualization and its role in enabling cloud services,
CO2 K2
including different types of virtualization and their applications.
Identify the architectural components of compute and storage clouds and
CO3 K2
discuss basic security challenges in cloud computing.
Implement parallel and distributed programming models using MapReduce
CO4 K3
and utilize cloud databases like MongoDB and HBase.
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
CO2 3 2 - 2 1 - - - - - - 2

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

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

Text Books
Edition and
Sl. No Title of the Book Name of the Author/s Name of the Publisher
Year
Cloud Computing & Big Data Sudheep E. M., Sarith D.
1st Edition,
1 From the basics to practical use M., Lija M., Tanmay K. P. Cengage Learning
2024
cases & Shubham A.
Cloud Computing Concepts,
Thomas, E., Zaigham M., & 1st Edition,
2 Technology & Prentice Hall
Ricardo P. 2013
Architecture
Mastering cloud computing: Buyya, R., Vecchiola, C., & 1st Edition,
3 Morgan Kaufmann
foundations and Selvi, S. T. 2017
 applications programming
Cambridge University 1st Edition,
4 Cloud computing Bhowmik, S.
Press 2017

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

Video Links (NPTEL, SWAYAM…)

No. Link ID
1 https://youtu.be/NzZXz3fJf6o
2 https://youtu.be/fZ3D6HQrWzs

3 https://youtu.be/LcAPj95KeSA
4 https://youtu.be/TOOSVsxEIpo
 SEMESTER S5

DATA MINING AND WAREHOUSING

Course Code PEITT524 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) PBITT404 Data Science Course Type Theory

Course Objectives:

1. To understand the fundamental concepts of data mining and data warehousing.

2. To apply data mining techniques to process and interpret large datasets.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Data mining Introduction –Types of data to be mined - Data mining
functionalities - Classification of Data mining system- Data mining task
primitives - Major issues in Data mining.
1
Data pre-processing – Need of data pre-processing - Descriptive Data
11
summarization – Data cleaning- Data integration and transformation -
Data reduction -Data discretization and Concept Hierarchy Generation.
Data Warehouse and OLAP Technology: Overview –
Multidimensional Data Model- Data Warehouse Architecture - Data
2
Warehouse Implementation – From Data Warehousing to Data
9
Mining.
Classification Techniques - Decision Trees - Naive Bayes - k-Nearest
Neighbors - Support Vector Machines
Clustering Techniques - k-Means - Hierarchical Clustering and

3 DBSCAN.
10
Association Rule Mining - Apriori algorithm - FP-Growth Algorithm.
Model Evaluation and Validation - Cross-validation, confusion matrix,
ROC curves.
 Advanced Data Mining Techniques: Multimedia Data Mining —Text
Mining - Text Data Analysis and Information Retrieval, Text mining

4 approaches - Web Mining- Web Content Mining, Web Structure

9
Mining, Web Usage Mining. CRM Applications and Data mining -
Practical Data Mining Tools: Weka, RapidMiner.

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  2 questions will be given from each module, out
module. of which 1 question should be answered.
● Total of 8 Questions, each  Each question can have a maximum of 3 sub
carrying 3 marks divisions. 60
 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 basic concepts in data mining and the data
CO1 K2
preprocessing.
Describe the architecture, components, and design of data warehouses,
CO2 K2
including ETL processes and schema designs.
Apply various data mining techniques such as classification, clustering,
CO3 K3
and association rule mining to real-world datasets.
Demonstrate advanced data mining topics and practical applications,
CO4 demonstrating the ability to integrate and apply knowledge in a real- K3
world context.

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 - - - - - - -
CO2 2 2 1 - - - - - - 1
CO3 2 2 2 1 - - - - - - 1
CO4 2 2 2 1 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
2nd Edition,
Jaiwei Han,
1 Data Mining Concepts and Elsevier 2006.
MichelineKamber
Techniques
Edition,
Data Warehousing, Data AlexBerson and Tenth
2 TataMcGraw Hill
Mining & OLAP Stephen J. Smith, Reprint
2007.
 Reference Books
Sl. Name of the Name of the
Title of the Book Edition and Year
No Author/s Publisher
Data Warehousing Fundamentals: A
1 Comprehensive Guide for IT Pualraj Ponnaiah Wiley 2nd edition, 2001
Professionals
Data Mining: Introductory and Pearson New Delhi,
2 Dunham M H
Advanced Topics Education 2003.
Morgan
Ian Witten, Eibe
3 Data Mining; Practical Machine Kaufmann 3rd edition, 2011
Frank
Learning Tools and Techniques
Pang-Ning Tan
4 Introduction to Data Mining and Michael Addison Wesley 2nd edition, 2006
Steinbach
Cengage
Data Mining and Warehousing M Sudeep
5 Learning India 1stEdition, 2015
Elayidom
Pvt. Ltd

Video Links (NPTEL, SWAYAM…)

No. Link ID
1 https://onlinecourses.nptel.ac.in/noc21_cs06/preview
 SEMESTER S5

FORMAL LANGUAGES AND AUTOMATA THEORY

Course Code PEITT525 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.
GAMAT301: Mathematics for
Prerequisites (if any) Course Type Theory
Information Science-3

Course Objectives:

1. To design various computational models useful for solving problems.

2. To understand the relationship among digital computer, algorithm and Turing machine.
3. To discuss the Chomsky classification of formal languages with discussion on grammar and
automata for regular, context-free, context-sensitive, and unrestricted languages.
4. To verify whether a given problem is solvable or tractable.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Finite Automata:Need for mathematical modelling, Symbols, Alphabets,
Strings, Languages, Formal definition of a finite automaton, Deterministic
Finite Automata (DFA), Regular languages, Formal definition of a

1 nondeterministic finite automaton, Equivalence of NFAs and DFAs (Proof 9

not expected) - Subset Construction. Minimization of DFA NFA with
epsilon transitions, Eliminating epsilon transitions, Moore and Mealy
machines .
Regular Expressions: 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, Regular languages.
2 Properties of Regular Languages: Closure and Decision Properties of 9
Regular Languages, Pumping Lemma for Regular Languages, Myhill-
Nerode Theorem(MNT) without proof, Applications of MNT.
Context-Free Grammars and Applications: Formal definition of a
 context-free grammar, Designing context-free grammars, Parse Trees,
Ambiguous Grammars, CYK-Algorithm.
Pushdown Automata: Formal definition of a pushdown automaton (PDA),
Design of Deterministic PDA and Nondeterministic PDA.
Simplification of Context-Free Languages: Chomsky normal form,
Greibach normal form.
3 Properties of Context-Free Languages: The Pumping Lemma for Context- 9

Free Languages, Closure and Decision Properties of Context-Free

Languages.
Linear Bounded Automata
Turing Machines: Definition of a Turing machine (TM), Design of Turing
machines – TM as language acceptors, TM as computers of functions,
Variants of Turing Machines, Recursive and recursively enumerable
4 languages Chomsky hierarchy. 9
Computability: Universal Machine, Church Turing thesis, Decidable and
Undecidable Problems, Halting problem of TM.

Course Assessment Method

(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

Internal Examination Evaluate Level Analyze Level

Attendance Total
(Written) Assessment Assessment

5 15 10 10 40

Evaluate and Analyze Level Assessment [20 Marks]

Design and implement a tool that handles various formal language concepts. Your tool should integrate
functionalities for the following tasks:
1. Finite Automata Simulation: Simulate both deterministic finite automata (DFA) and non-
deterministic finite automata (NFA). Your tool should allow users to input an automaton and a
string and should output whether the string is accepted by the automaton.
2. Regular Expression Parsing: Parse regular expressions to construct an equivalent NFA or
DFA. The tool should allow users to input a regular expression and a string, and determine if
the string matches the regular expression.
3. Context-Free Grammar Checking: Verify if a string can be generated by a given context-free
grammar (CFG). Users should be able to input a CFG and a string, and your tool should check
if the string can be derived from the CFG.
 4. Turing Machine Simulation: Implement a Turing machine simulator where users can define
the machine’s states, transitions, input alphabet, and initial configuration. The tool should
simulate the Turing machine's operation on a given input tape.
5. Automata Conversion: Implement algorithms to convert between different types of automata,
such as converting an NFA to a DFA or converting a regular expression to an NFA.

6. Use JFLAP to evaluate and demonstrate your tool’s functionalities.

Criteria for evaluation:

1. Finite Automata Simulation (K4- 4 points)

a. Application (K3- 2 points): Ability to simulate DFA and NFA correctly. The tool should
accept an automaton and a string, and accurately determine whether the string is accepted.
b. Analysis (K4- 2 points): Proper handling of different types of automata inputs
(DFA/NFA) and edge cases. Includes correct processing of input strings and states.
2. Regular Expression Parsing (K4- 4 points)
a. Application (K3-2 points): Correct parsing of regular expressions to construct equivalent
NFA or DFA. The tool should accurately build the automaton and match strings against the
regular expression.
b. Analysis (K4- 2 points): Handling of complex regular expressions and accurate matching
results. Proper conversion and processing of regular expressions.
3. Context-Free Grammar Checking (K4- 4 points)
a. Application (K3- 2 points): Correctly verify if a string can be generated by a given CFG.
The tool should accept a CFG and a string and check if the string can be derived from the
CFG.
b. Analysis (K4- 2 points): Handling of different CFGs and strings, including edge cases and
complex grammars.
4. Turing Machine Simulation (K4- 4 points)
a. Application (K3- 2 points): Functional simulation of a Turing machine based on user-
defined states, transitions, and input. Accurate simulation of operations on an input tape.
b. Analysis (K4- 2 points): Proper handling of various Turing machine configurations and
input scenarios. Effective simulation of state transitions and tape operations.
5. Automata Conversion (K4- 2 points)
a. Application (K3- 1 point): Correct implementation of algorithms to convert between
different types of automata (e.g., NFA to DFA).
b. Analysis (K4- 1 point): Accurate conversion processes and handling of edge cases.
Effective demonstration of the conversion algorithms in practice.
 6. Integration with JFLAP (K5- 2 points)
a. Evaluation (1 point): Effective use of JFLAP for visual representation and evaluation of
the tool’s functionalities.
b. Presentation (1 point): Clear and effective demonstration of the tool using JFLAP,
including accurate representation of results.

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

4. Minimal (1 point): Incomplete or significantly flawed.

End Semester Examination Marks (ESE):

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

Part A Part B Total

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

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

Bloom’s
Course Outcome Knowledge
Level (KL)
Explain the fundamental concepts in automata theory and formal
CO1 K2
languages.
Design finite state automata, regular grammar and regular expression for
CO2 K3
regular languages.
Design push-down automata and context-free grammar representations for
CO3 K3
context-free languages.
Design Turing Machines to accept recursive and recursively enumerable
CO4 K3
languages.
Analyse the limitations of computational models and understand
CO5 decidability and undecidability of problems. 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 2 1 1 - - - - - - - - 1
CO2 3 3 3 2 - - - - - - - 1
CO3 3 3 3 2 - - - - - - - 1
CO4 3 3 3 2 - - - - - - - 1
CO5 3 3 1 1 - - - - - - - 2
Note: 1: Slight (Low), 2: Moderate (Medium), 3: Substantial (High), -: No Correlation

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

Introduction to Automata Third Edition,

Hopcroft,
2 Theory Languages and Pearson Publishers 2006
Motwani, and Ullman
Computation
Seventh
An Introduction to Formal Peter Linz and Susan H. Jones and Bartlett
3 Edition,
Languages and Automata Rodger Publishers, Inc
,2022

Reference Books
Name of the Edition and
Sl. No Title of the Book Name of the Author/s
Publisher Year
1 Automata and Computability Dexter C. Kozen Springer 2007
Third
Introduction to Languages and Edition, 2003
2 John Martin McGraw-Hill
the Theory of Computation
Education

Video Links (NPTEL, SWAYAM…)

No. Link ID
1 https://archive.nptel.ac.in/courses/106/104/106104148/
2 https://nptel.ac.in/courses/106106049
 SEMESTER S5
MACHINE LEARNING LAB
Course Code PCITL507 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. By the end of this course, students will be able to implement and evaluate multiple machine learning
models, including Multiple Linear Regression, Logistic Regression, Decision Trees (ID3 & CART),
Naïve Bayes’ Classifier, and Support Vector Machines, using practical datasets such as house prices,
Titanic survival data, and spam emails.
2. Gain hands-on experience in applying advanced machine learning techniques to various tasks,
including character recognition using Multilayer Perceptron, clustering with K-Means and DBScan,
sentiment analysis with Random Forest, Adaboost, and XGBoost, Q-Learning for game strategies, and
image classification using Convolutional Neural Networks (CNNs).

Experiment Experiment
No.
1 Study of Python Libraries for ML applications such as Pandas and Matplotlib.

2 Implement Multiple Linear Regression for House Price Prediction.

Implement Logistic Regression for Titanic Survival Prediction without using

3
Libraries.

4 Implement Decision trees – ID3 & CART.

5 Implement Naïve Bayes’ Classifier for Diagnosis of Heart Patients.

6 Implement Support Vector Machines to Filter Spam Mails.

7 Implement Multilayer Perceptron for Character Recognition using MNIST Dataset

8 Implement k-Nearest Neighbor without using libraries for IRIS Dataset

9 Implement K-Means Clustering & DBScan.

10 Implement Sentiment Analysis using Random Forest, Adaboost, XGboost

11 Implement Q-Learning for a Simple Game.
 12 Implement CNN for Image Classification.

Course Assessment Method

(CIE: 50 marks, ESE: 50 marks)

Continuous Internal Evaluation Marks (CIE):

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

5 20 20 50

End Semester Examination Marks (ESE):

Procedure/
Conduct of experiment/ Result with valid
Preparatory Viva
Execution of work/ inference/ Record Total
work/Design/ voce
troubleshooting/ Programming Quality of 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)
Demonstrate proficiency in Python Libraries for Machine Learning, Python
libraries such as Pandas and Matplotlib to preprocess data, visualize datasets,
CO1 and gain insights essential for machine learning applications. K3

Implement various machine learning algorithms, including Multiple Linear

Regression, Logistic Regression, Decision Trees (ID3 & CART), and Naïve
CO2 Bayes’ Classifier, and will be able to assess their performance on different K3
datasets.
 Build and apply advanced models such as Multilayer Perceptron for character
recognition, Support Vector Machines for spam filtering, and Convolutional
CO3 Neural Networks for image classification, as well as implement clustering K3
techniques like K-Means and DBScan.
Implement Q-Learning for simple game scenarios and perform sentiment
analysis using ensemble methods such as Random Forest, Adaboost, and
XGboost, demonstrating a comprehensive understanding of both supervised
CO4 and reinforcement learning techniques. K3

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

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

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

CO1 3 3 2 2 2 2 - - 2 - - 2

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

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

CO4 3 3 2 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
Sebastian
2nd Edition,
1 Python Machine Learning Raschka (Author), Vahid Packt
2019
Mirjalili (Author)
McGraw Hill First Edition,
2 Machine Learning Tom M Mitchell
Education 2013
Introduction to Machine Learning Andreas C. Müller, Sarah
3 O'Reilly Media, Inc. 2016
with Python Guido

Reference Books
Name of the
Sl. No Title of the Book Name of the Author/s Edition and Year
Publisher
Hands-On Machine Learning
1 with Scikit-Learn, Keras, and Aurélien Géron O'Reilly Media, Inc. 2nd Edition, 2019
TensorFlow,

Video Links (NPTEL, SWAYAM…)

No. Link ID

1 https://cse.iitkgp.ac.in/~pabitra/course/ml/ml.html
Continuous Assessment (20 Marks)
1. Preparation and Pre-Lab Work (5 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 (5 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 (5 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

ALGORITHM ANALYSIS AND DESIGN LAB

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

PCITL308: Datastructures
Prerequisites (if any) Lab Course Type Practical

Course Objectives:

1. To equip students to develop proficiency in Algorithmic Techniques and Data Structures

2. Enable students to design and implement algorithms for solving complex computational
problems using C programming language.

SYLLABUS

Experiment Experiment
No.
1 Implement BFS on an undirected graph.

2 Implement DFS on a directed graph.

Implement the program to find the Strongly Connected Components of a directed
3
graph.

4 Implement a Program to find the Topological Sorting of a Directed Graph.

Implement the divide and conquer algorithm to find Minimum and Maximum in an
5
array of elements.

6 Implement Merge Sort

7 Implement Quick Sort

8 Implement Greedy algorithm to find the solution to fractional Knapsack Problem.

9 Implement Kruskal’s algorithm to find Minimum Spanning Tree.

 10 Implement Prim’s Algorithm to find Minimum Spanning Tree.

Implement Dynamic Programming algorithm to find the solution to Travelling

11
Salesman Problem.
Implement Dynamic Programming algorithm to find the solution to 0/1 Knapsack
12
Problem.

13. Implement Backtracking algorithm to find the solution to N-Queen’s problem.

14. Implement KMP String Matching Algorithm.

15. Implement Rabin Karp String Matching Algorithm.

Course Assessment Method

(CIE: 50 marks, ESE: 50 marks)

Continuous Internal Evaluation Marks (CIE):

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

End Semester Examination Marks (ESE):

Result with valid

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

10 15 10 10 5 50

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

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

Bloom’s
Course Outcome Knowledge
Level (KL)
CO1 Implement Graph Traversals and their applications. K3
CO2 Implement Divide and Conquer and Greedy Technique. K3
CO3 Implement Dynamic Programming and Backtracking Techniques K3
CO4 Implement String Matching Algorithms 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 2 3 2 2

CO2 3 2 2 2 3 2 2

CO3 3 2 2 2 3 2 2

CO4 3 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
T.H.Cormen,
2nd Edition
1 Introduction to Algorithms C.E.Leiserson, Prentice-Hall India
(2001)
R.L.Rivest, C. Stein
Ellis Horowitz, Sartaj
Fundamentals of Computer Orient Longman 2nd Edition
2 Sahni, Sanguthevar
Algorithms Universities Press (2008)
Rajasekaran
Computer Algorithms,
Sara Baase and Allen 3rd Edition
3 Introduction to Design and Pearson Education
Van Gelder (2009)
Analysis

Reference Books
Name of the Edition and
Sl. No Title of the Book Name of the Author/s
Publisher Year
A Practical Guide : to Analysis
1 Dr. Deepshikha Agarwal Notion Press January 2021
and Design of Algorithms
McGraw Hill 8th edition,
2 Programming In Ansi C E Balagurusamy
Education March 2019
 Video Links (NPTEL, SWAYAM…)

No. Link ID
1 https://onlinecourses.nptel.ac.in/noc19_cs47/preview

Continuous Assessment (20 Marks)

1. Preparation and Pre-Lab Work (5 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 (5 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 (5 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
INFORMATION TECHNOLOGY
 SEMESTER S6
CRYPTOGRAPHY AND NETWORK SECURITY

Course Code PCITT601 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 explain the basics of Security and mathematical foundations of cryptography

2. To describe Cryptography fundamentals and traditional ciphers
3. To interpret the standard symmetric and asymmetric cryptosystems.
4. To create an awareness for the design of various cryptographic primitives
5. To analyze different types of attacks on various cryptosystems.
6. To create an understanding of the modern applications of cryptography.

SYLLABUS

Contact
Module
Syllabus Description Hours
No.
(44 Hrs)
Introduction to Security:- Security Goals – Security services
(Confidentiality, Integrity, Authentication, Non-repudiation, Access
control) – Security Mechanisms (Encipherment, Data Integrity, Digital
Signature, Authentication Exchange, Traffic Padding, Routing Control,
Notarization, Access control), Security Principles.
1 10
Basics of Algebra and Number Theory:- Integer Arithmetic- Modular
Arithmetic- Algebraic structures – Prime Numbers - Fermat’s and Euler’s
Theorem – Factorization - Chinese Remainder Theorem - Linear and
Quadratic Congruence - Discrete Logarithms.

Introduction to Cryptography:- Kerckhoff's Principle -Classification of

Cryptosystems- Cryptanalytic attacks- Cipher Properties (Confusion,

2 Diffusion). 12
Traditional Secret Key Ciphers:- Substitution Ciphers – (Mono alphabetic
ciphers-Ceaser, Affine, Poly alphabetic ciphers-Autokey, Playfair,
 Vigenere and Hill)- Transposition Ciphers – (Rail Fence, Keyed
transposition ciphers) - Stream and Block Ciphers.
Modern Secret Key Ciphers:- Substitution Box-Permutation Box-Product
Ciphers, Data Encryption Standard (DES) (Fiestel and Non-Fiestel
Ciphers, Structure of DES, DES Attacks, 2-DES, 3-DES) - Advanced
Encryption Standard (AES) (Structure, Analysis)
Cryptographic Hash Functions:– Properties - Secure Hash Algorithm-
(SHA-512 Logic, Round Function), Message Authentication Code (MAC).
Public Key Cryptosystems (PKC):- Types of PKC– Trapdoor - one way
functions -RSA Cryptosystem (Integer Factorisation Trapdoor, Key
Generation, Encryption, Decryption) - El Gamal Cryptosystem (Discrete
Logarithm Trapdoor, Key Generation, Encryption, Decryption) - Diffie-
3 Hellman Key Exchange Protocol, Man in the Middle attack on Diffie- 11
Hellman Protocol.
Digital Signature:- Signing – Verification - Digital signature forgery
(Existential forgery, Selective forgery, Universal forgery) - RSA Digital
Signature Scheme - ElGamal Signature Scheme – Elliptic Curve Digital
Signature Scheme(ECDSS)

Network Security:- Electronic Mail Security -Pretty Good Privacy- PGP

message format - Transmission and Reception of PGP Messages, S/MIME.
IP Security Overview, IP Security Architecture, Authentication Header,
Encapsulating Security Payload- Intruders, Intrusion Detection, Distributed
Denial of Service attacks- Secure Electronic Transaction – Payment
Processing - Dual Signature, Firewalls - Firewall Design Principles.
4 11
Application of Cryptography:- Blockchain fundamentals(Blockchain
defined, Blockchain architecture, Generic elements of a blockchain, Benefits,
features, and limitations of blockchain, Types of blockchain) - Secure
Multiparty Computation(Outsourced Computation, Multi-Party
Computation, Applications).
 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,
 Total of 8 Questions, each out of which 1 question should be answered.
60
carrying 3 marks  Each question can have a maximum of 3 sub
divisions.
(8x3 =24marks) (4x9 = 36 marks)

Course Outcomes (COs)

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

Bloom’s
Course Outcome Knowledge
Level (KL)
Describe the various network security aspects and apply number
CO1 theory concepts in solving cryptographic problems. K3

Illustrate the process of enciphering and deciphering of classical

CO2 K3
cryptosystems and modern symmetric key cryptosystems.
Apply the principles of asymmetric key cryptosystems and
CO3 digital signature. K3

Discuss various protocols to ensure Email Security and Network

CO4 Security. K2

CO5 Explain the various applications of cryptography K2

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

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

CO2 3 3 3 2 1 3

CO3 3 3 3 2 1 3

CO4 3 2 2 2 1 3

CO5 2 2 2 2 1 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
Cryptography and Network
7th Edition,
1 Security William Stallings Pearson Education
2017

Behrouz A. Forouzan
Cryptography & Network Security, Tata McGraw Hill, 3rd Edition,
2 and Debdeep
Second Edition New Delhi, 2015
Mukhopadhyay
3rd Edition
3 Mastering BlockChain Imran Bashir Packt
2020
David Evans; Vladimir
A Pragmatic Introduction to Secure
4 Kolesnikov; Mike NOW Publishers 2018
Multi-Party Computation
Rosulek

Reference Books
Name of the Edition and
Sl. No Title of the Book Name of the Author/s
Publisher Year
Cryptography and Network 3rd edition
1 Atul Kahate Tata McGraw Hill 2017
Security
Network Security and Cengage Learning
2 Bernard Menezes India 2011
Cryptography
Applied Cryptography:
Protocols, Algorthms, and John Wiley and
3 Bruce Schneier 2001
Source Code in C”, Second Sons Inc
Edition, , 2001.

Video Links (NPTEL, SWAYAM…)

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

2 https://onlinecourses.swayam2.ac.in/cec24_cs16/preview
 SEMESTER S6

ADVANCED ARTIFICIAL INTELLIGENCE

Course Code PCITT602 CIE Marks 40

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

Prerequisites (if any) None Course Type Theory

Course Objectives:

1. To provide a comprehensive overview of modern AI technologies, focusing on both

traditional methods and recent advancements.
2. To learn methods and practices for making AI decisions transparent and understandable.
3. To provide a comprehensive understanding of the principles, practices, and implications of
responsible AI.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Foundations of Modern Artificial Intelligence (AI): Introduction to AI-
Historical Overview and Definitions, AI System Categories- Systems that
think like humans, act like humans, think rationally and act rationally, AI

1 Agents and Environment- Simple Reflex, Model Based, Goal Based, and 7
Utility Based Agents. Traditional AI Techniques- Outline of Knowledge
based Systems and Expert Systems. Modern AI Techniques- Outline of
Federated Learning, Reinforcement Learning and Transfer Learning.

AI Search Strategies: Uninformed Search Strategies-Depth First Search,

Breadth First Search, Depth Limited Search, Iterative Deepening Depth-First
Search, Informed search strategies- Hill Climbing, Best First Search, A*

2 algorithm, AO* algorithm, Game Playing- Minimax algorithm, Alpha Beta 10

Pruning, Constraint Satisfaction Problem- Backtracking, Constraint
Propagation, Comparison between Informed and Uninformed Search
Strategies.
 Explainable AI (XAI): Introduction to Explainable AI- Importance and
challenges of XAI, Overview of XAI techniques, Interpretable Models-
Decision trees, linear models, and rule-based models, Trade-offs between
interpretability and accuracy, Post-Hoc Explanation Techniques- Local
Interpretable Model-agnostic Explanations (LIME), SHapley Additive
3 11
exPlanations (SHAP), Counterfactual explanation, Evaluating Explanations-
Metrics for evaluating the quality and usefulness of explanations, User
studies and feedback mechanisms, Regulatory and Ethical Considerations-
Compliance with regulations like GDPR and the AI Act, Balancing
transparency with privacy.

Responsible AI, Societal Impact, and Future Directions: Responsible AI

Practices- Principles of responsible AI (fairness, accountability,
transparency), Designing and auditing AI systems for ethical compliance,

4 Societal Impact of AI- AI’s role in various sectors (healthcare, finance, 8

transportation), Privacy concerns and data security, Future Directions and
Emerging Trends- Advances in AI research: neuromorphic computing,
quantum AI, Potential societal transformations and ethical considerations

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 of AI from its historical roots to
CO1 contemporary techniques, including traditional methods and modern K2
approaches.

CO2 Implement various search strategies used in artificial intelligence. K3

Apply various XAI techniques and assess the trade-offs between
CO3 K3
interpretability and accuracy in AI systems.
Apply principles of responsible AI, assess AI’s societal impact across
CO4 different sectors, and understand the regulatory and ethical K3
considerations influencing AI development and deployment.
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create

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

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

An introduction to machine
2 Hall, Patrick, and Navdeep Gil O'Reilly Media 2019
learning interpretability

Reference Books
Name of the Edition and
Sl. No Title of the Book Name of the Author/s
Publisher Year
Artificial Intelligence: A Guide
1 Melanie Mitchell 2019
for Thinking Humans

2 AI Ethics Coeckelbergh M. MIT Press 2020

Video Links (NPTEL, SWAYAM…)

No. Link ID
1 https://www.javatpoint.com/artificial-intelligence-ai
2 https://www.solulab.com/ai-deep-learning-techniques/
3 https://onlinecourses.nptel.ac.in/noc22_cs56/preview
4 https://onlinecourses.nptel.ac.in/noc24_cs132/preview
 SEMESTER S6
COMPILER DESIGN
Course Code PEITT631 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.
PCITT303 - Data structures
Prerequisites (if any) PEITT525 - Formal Languages Course Type Theory
and Automata Theory

Course Objectives:
1. To provide students with a foundational knowledge of compiler design, including the need for
compilers, their phases, and the tools used in their construction.

2. To enable students to design and implement lexical and syntax analyzers using various parsing
methods, including both top-down and bottom-up approaches.

3. To equip students with the skills to generate intermediate code, optimize code, and develop a basic
code generator.

SYLLABUS
Module Contact
Syllabus Description
No. Hours
Fundamentals: Need of compiler, Analysis of the source program, Phases of a
compiler, grouping of phases, compiler writing tools, Cross compiler. Lexical
1 Analyser: The role of Lexical Analyzer, Review of Finite Automata, Design of
9
Lexical Analyser using DFAs, Specification of Tokens using Regular Expressions.
Syntax Analyser: Review context-free grammars, Parse Trees, Ambiguous

2 Grammars. Top – Down Parsing: Recursive Descent Parser, Predictive Parser-LL(1). 9

Bottom-Up Parsing: LR(0) parser, SLR(1) parser, CLR(1) parser, LALR parser.
Semantic Analyser: Syntax directed definitions: S-attributed definitions, L-
attributed definitions. Bottom- up evaluation of S- attributed definitions, Top-down

3 translation, Bottom-up evaluation of inherited attributes. Intermediate Code 9

Generation (ICG): Need of ICG, Different representation of intermediate code,
intermediate code for assignment statement.
Code Optimization: Principal sources of optimization, Optimization of basic

4 blocks. Code Generation: Issues in the design of a code generator, A simple code 9
generator.
Course Assessment Method
(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

 Internal Internal Examination-
Assignment/
Attendance Examination-1 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 module. ● Each question carries 9 marks.
● Total of 8 Questions, each ● Two questions will be given from each module, out of
carrying 3 marks which 1 question should be answered. 60
● Each question can have a maximum of 3 sub divisions.
(8x3 =24marks) (4x9 = 36 marks)

Course Outcomes (COs)

At the end of the course students should be able to:
Bloom’s
Course Outcome Knowledge
Level (KL)
Describe the phases of a compiler, their functions, and the tools utilized in
CO1 compiler construction.
K2

Design and implement a lexical analyzer using deterministic finite automata

CO2 (DFAs) and regular expressions.
K3

Apply various parsing techniques, including top-down (recursive descent and

CO3 LL(1)) and bottom-up (LR(0), SLR(1), CLR(1), and LALR) methods, and K3
construct parse trees.
Develop test automation strategies and utilize automation and testing tools
effectively to test object-oriented software and web-based systems, while
CO4 applying debugging techniques to track and resolve bugs in various
K3
environments

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

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

CO1 3 3 - - - - - - - - - -

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

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

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

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

Text Books
Edition and
Sl. No Title of the Book Name of the Author/s Name of the Publisher
Year
Updated
Second
Compilers Principles, Techniques Alfred Aho, Ravi Sethi and Edition,
1 Pearson Education
and Tools Jeffrey D Ullman 2023

Reference Books
Name of the Edition and
Sl. No Title of the Book Name of the Author/s
Publisher Year
Second
Compiler Construction: Principles PWS Publishing
1 Kenneth C. Louden Edition,
and Practice Company 1997
Levine J.R, Mason T, First edition,
2 Lex &Yacc
Brown D OReilly Associates 1992
First edition,
3 Compiler Design in C Allen I. Holub Prentice Hall 2003

Video Links (NPTEL, SWAYAM…)

No. Link ID

1 https://archive.nptel.ac.in/courses/106/105/106105190/
2 https://archive.nptel.ac.in/courses/106/105/106105190/
3 https://nptel.ac.in/courses/106108113
4 https://nptel.ac.in/courses/106108113
 SEMESTER S6

METAHEURISTIC OPTIMIZATION

Course Code PEITT632 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) PCITT303 Data structures Course Type Theory

Course Objectives:

1. To provide a structured framework for students to grasp both theoretical and practical aspects
of metaheuristics.
2. To enable the students to effectively use and evaluate metaheuristics in various optimization
scenarios.

SYLLABUS

Contact
Module Hours
Syllabus Description
No. (36
Hrs)
Fundamentals of Metaheuristics: Classical Optimization Models,
Optimization Methods-Exact Methods and Approximate Methods,
1 9
Metaheuristics Concepts–Representation, Objective Function, Constraint
Handling, Parameter Tuning and Performance Analysis.

Single Solution Based Metaheuristics: Local Search- Neighbor Selection and

Escaping from Local Optima, Simulated Annealing- Move Acceptance and
Cooling Schedule, Tabu Search- Types of memory, Iterated Local Search-
2 9
Perturbation Method and Acceptance Criteria, Variable Neighbourhood
Search- Variable Neighborhood Descent and General Variable
Neighborhood Search.

Ant Colony Optimization (ACO): Inspiration from Nature-Ant Foraging

Behavior, Ant System, Basic Principles of ACO- Pheromone Deposition,
3 9
Pheromone Updating Rules, Construction of Solutions and Pheromone
Evaporation, Ant System Variants-Elitist Ant System, Rank Based Ant
 System, Max Min Ant System, Application of ACO to the Travelling
Salesman Problem.

Particle Swarm Optimization (PSO): Inspiration from Nature- Social

Behavior of Bird Flock, Basic Models of PSO- Local Best PSO and Global
Best PSO, gbest versus lbest PSO, Velocity Update Equations, Position

4 Update Equations, Velocity Clamping, Inertia Weight, Constriction 9

Coefficients, Synchronous and Asynchronous Updates, Velocity Models,
Basic PSO Parameters, Guaranteed Convergence PSO, Problem Formulation
of PSO algorithm, Advantages and Disadvantages of PSO.

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 classical optimization models, optimization methods and
CO1 K2
explain the main concepts of metaheuristics.
Apply single solution based metaheuristics to solve optimization
CO2 K3
problems.
Analyze the optimization problem and apply ant colony optimization
CO3 K4
algorithm to solve it.
Analyze real world problems and solve them using particle swarm
CO4 K4
optimization algorithm.
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create

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

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 2 2 - - - - - - - - 2
CO2 2 3 3 2 2 2 - - 2 - 2 2
CO3 2 3 3 3 2 2 - - 2 - 2 2
CO4 2 3 3 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
Metaheuristics: from design to John Wiley &
1 Talbi, El–Ghazali Vol. 74, 2009
implementation Sons
Second edition,
2 Essentials of Metaheuristics Luke, Sean Lulu
2013
Gendreau, Michel, and New York:
3 Handbook of metaheuristics Vol. 2, 2010
Jean-Yves Potvin Springer
Handbook of approximation
4 Gonzalez, Teofilo F CRC Press 2007
algorithms and metaheuristics

Reference Books
Sl. No Title of the Book Name of the Author/s Name of the Edition and
 Publisher Year
Computational intelligence: an
1 Engelbrecht, A. P John Wiley & Sons 2007
introduction
Marco Dorigo and
2 Ant Colony optimization MIT Press 2004
Thomas Stutzle
Swarm Intelligence: From Eric Bonabeau, Marco Oxford University 2000
3
Natural to Artificial Systems Dorigo, Guy Theraulaz Press

Video Links (NPTEL, SWAYAM…)

No. Link ID

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

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

3 https://nptel.ac.in/courses/103103164
 SEMESTER S6

SOFTWARE PROJECT MANAGEMENT

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

PCITT503 - Software
Prerequisites (if any) Engineering Course Type Theory

Course Objectives:

1. To provide an in-depth understanding of the software project management process,

including its key concepts, methodologies, and frameworks.
2. To equip students with the skills required to evaluate, plan, and estimate software projects,
ensuring effective management of project portfolios and individual projects.
3. To develop students' ability to apply principles of activity planning, risk management, and
resource allocation to ensure efficient sequencing, scheduling, and management of project
activities and resources.
4. To enhance students' knowledge of monitoring and control processes, contract
management, people management, and teamwork, enabling them to support successful
project execution and delivery.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Introduction to Software Project Management: Introduction, Importance,
Activities, Plans, methods and methodologies, Categorization, Project
Charter, Stake holders, Setting Objectives,
1 9
Management: Management Control, Project Management Life Cycle,
Traditional vs Modern project management

Project Evaluation: Project portfolio management- Evaluation of individual

projects- Cost benefit evaluation techniques- Risk evaluation- Programme
2 9
Management- Managing allocation of resources-Strategic Programme
Management-Creating a Programme- Aids to Programme Management-
 Benefits Management.
Project Planning: Step wise Project Planning
Software Estimation: Basis for software estimation- Software Effort
estimation techniques- Bottom-up and Top-down estimation- Function Point
Analysis- COCOMO II. Cost Estimation- Staffing Pattern- Schedule
compression.

Activity Planning: Objectives- Project Schedules- Projects and Activities-

Sequencing and Scheduling Activities- Network Planning Models- Forward
Pass- Backward pass- Identifying Critical Path – Activity Float- Shortening
the Project Duration- Identifying Critical Activities- Activity-on-arrow
networks.
Risk Management: Risk- Categories of Risk- Risk Management
3 9
Approaches-Risk Identification- Risk Assessment- Risk Planning- Risk
management- Risk Evaluation- PERT, Monte Carlo Simulation, Critical
Chain.
Resource Allocation: Nature of Resources- Identifying and Scheduling
Resources- Creating Critical Paths- Cost Schedule- Scheduling sequence.

Monitoring and Control: Creating the framework- Collecting data- Review

- Visualizing Progress- Cost Monitoring- Earned Value Analysis-
Prioritizing Monitoring-Getting the project back to target- Change control-
Software Configuration Management.
Managing Contracts- Types of Contract-Stages in Contract Placement-
Contract Management
4 9
Managing People: Organizational Behaviour- Selecting the right Person-
Motivation- The Oldham-Hackman Job Characteristics Model-Stress- Stress
Management- Health and Safety- Ethical and Professional Concerns
Working in Teams- Becoming a Team- Decision Making- Organization and
Team Structures- Coordination Dependencies- Dispersed and Virtual Teams
– Communication Genres- Communication Plans- Leadership.
 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)
CO1 Explain the fundamentals of software project management K2
Apply project evaluation, planning, and software estimation techniques
CO2 to effectively manage project portfolios, individual projects ensuring K3
optimal resource allocation and cost estimation
Describe the principles of activity planning, risk management and
CO3 resource allocation to effectively sequence, schedule and manage K2
project activities and resources
Explain the principles of monitoring and control, contract
CO4 management, people management, and team work to effectively K2
support project execution and delivery
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 2

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

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

CO4 3 - - - - - - - 3 2 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
Bob Hughes, Mike 6th edition,
1 Software Project Management Mc Graw Hill India
Cotterell, Rajib Mall 2017

Reference Books
Name of the Edition and
Sl. No Title of the Book Name of the Author/s
Publisher Year
Software Project Management 1st edition,
1 Pankaj Jalote Pearson 2015
in Practice
10th
2 Software Engineering Ian Somerville Pearson edition,2017
Software Engineering : A Roger S Pressman, Bruce 8th edition,
3 Tata McGraw Hill
Practitioner’s Approach R Maxim 2019

Video Links (NPTEL, SWAYAM…)

No. Link ID
1 https://onlinecourses.nptel.ac.in/noc24_mg78/preview
 SEMESTER S6
QUANTUM COMPUTING
Course Code PEITT634 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.

GAPHT121: Physics for

Prerequisites (if any) Information Science Course Type Theory

Course Objectives:
1. Understand the fundamentals of quantum computing and quantum information.
2. Explore and implement quantum algorithms.
3. Learn and apply principles of linear algebra and quantum mechanics.
4. Design and analyze quantum circuits and universal quantum gates.
5. Explore advanced topics in quantum computation.
SYLLABUS
Module Contact
Syllabus Description
No. Hours
Fundamental Concepts: History of quantum computation and quantum
information, Quantum bits, Quantum computation – Single qubit gates-

1 Multiple qubit gates-Quantum Circuits-Qubit copying circuit-Example: Bell 9

states. Quantum algorithms-Classical computations on a quantum computer-
Quantum parallelism-Deutsch’s algorithm-The Deutsch–Jozsa algorithm.
Introduction to quantum mechanisms: Linear algebra, Bases and linear
independence- Linear operators and matrices- The Pauli matrices- Inner
2 9
products-Eigenvectors and eigenvalues-Adjoints and Hermitian operators-
Tensor products-Operator functions.
The Postulates of Quantum Mechanics: State space-Evolution-Quantum

3 measurement-Distinguishing quantum states-Projective measurements- 9

POVM measurements-Phase- Composite systems.
Quantum Computation: Quantum circuits-Universal quantum gates-
Simulation of quantum systems. The quantum Fourier transform- Phase
4 9
estimation-Application: order-finding-Quantum search algorithms-Quantum
search as a quantum simulation.
 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)
Discuss the historical evolution, foundational concepts, and essential
CO1 algorithms in quantum computation and quantum information, K2
encompassing qubits, gates, and circuits.
Describe the fundamental concepts of quantum mechanics, including
CO2 linear algebra, bases, linear independence, operators, matrices, and key K2
elements like the Pauli matrices and eigenvalues.
Discuss the postulates of quantum mechanics, including state space,
evolution, quantum measurement, distinguishing quantum states,
CO3 K2
projective measurements, POVM measurements, phase, and composite
systems.
Apply knowledge of quantum computation to design quantum circuits
using universal quantum gates, simulate quantum systems, perform the
CO4 quantum Fourier transform, estimate phases, implement order-finding K3
applications, and utilize quantum search algorithms for quantum
simulation.
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create
 CO-PO Mapping Table (Mapping of Course Outcomes to Program Outcomes)

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

CO2 3 3 2

CO3 3 2 3

CO4 3 3 2 2

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

Text Books
Name of the Edition and
Sl. No Title of the Book Name of the Author/s
Publisher Year
Quantum Computation and Michael A. Nielsen & Cambridge University 10th Edition,
1
Quantum Information Isaac L. Chuang Press 2010

Reference Books
Name of the Edition and
Sl. No Title of the Book Name of the Author/s
Publisher Year
An Introduction to Quantum Oxford University
1 Kaye P, Laflamme R 2007
Computing Press
Quantum Computer Science: Cambridge
2 Mermin N.D. 2007
An Introduction University Press

Video Links (NPTEL, SWAYAM…)

No. Link ID
1 https://nptel.ac.in/courses/106106232
2 https://onlinecourses.nptel.ac.in/noc21_cs103/preview
 SEMESTER S6
DATA ANALYTICS

Course Code PEITT635 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) PBITT404: Data Science Course Type Theory

Course Objectives:

1. To introduce the fundamental concepts of data analytics, including data collection, cleaning, and
preprocessing.
2. To explore statistical methods and data mining techniques for data analysis and pattern discovery.
3. To understand the role of machine learning algorithms in predictive analytics and their
implementation.
4. To examine advanced data analytics topics such as big data analytics, real-time data processing,
and data visualization.
SYLLABUS

Module Contact
Syllabus Description
No. Hours
Introduction to Data Analytics and Preprocessing:
Overview of Data Analytics: Definitions, Types, and Applications
Data Collection Techniques: Sources, Tools, and Methods
1 9
Data Cleaning: Handling Missing Data, Outlier Detection, Data Imputation
Data Transformation: Normalization, Standardization, Feature Engineering
Introduction to R for Data Analytics
Statistical Methods and Data Mining:
Descriptive Statistics: Mean, Median, Mode, Variance, Standard Deviation
Inferential Statistics: Hypothesis Testing, Confidence Intervals, p-Values
Data Mining Techniques: Classification, Clustering, Association Rule
2 9
Mining
Feature Selection and Dimensionality Reduction: PCA, LDA
Applications of Data Mining: Market Basket Analysis, Customer
Segmentation
 Predictive Analytics and Machine Learning:
Introduction to Predictive Analytics: Concepts and Applications
Supervised Learning: Linear Regression, Decision Trees, Random Forests
3 9
Unsupervised Learning: k-Means Clustering, Hierarchical Clustering
Model Evaluation and Optimization: Cross-Validation, Grid Search
Case Studies in Predictive Analytics: Financial Forecasting, Health Analytics
Advanced Topics in Data Analytics:
Big Data Analytics: Hadoop, Spark, NoSQL Databases
Real-Time Data Processing: Streaming Data, Apache Kafka

4 Data Visualization Techniques: Dashboards, Reports, Data Storytelling 9

Ethical Considerations in Data Analytics: Privacy, Security, and Bias
Future Trends in Data Analytics: AI-Driven Analytics, Automated Data
Science.

Course Assessment Method

(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

Internal Examination Evaluate Level Analyze Level

Attendance Total
(Written) Assessment Assessment

5 15 10 10 40

Evaluate and Analyze Level Assessment [20 Marks]

Students should evaluate and analyze a real-world optimization problem, assess the proposed
solutions, provide a conclusion on which solution is most appropriate for the problem, and
implement the chosen solution using Python.

Criteria for evaluation:

1. Problem Definition (K4 - 4 points)
a. Clearly defines the real-world analytical problem.
b. Data is collected from reliable sources and is thoroughly cleaned,
transformed, and preprocessed with no errors.

2. Problem Analysis (K4 - 4 points)

a. Exploratory Data Analysis is comprehensive, revealing deep insights and
 trends with clear visualizations and interpretations.
b. Advanced and appropriate analytical methods are to applied
3. Evaluate (K5 - 4 points)
a. Thoroughly evaluate the proposed solutions.
b. Demonstrates strong awareness and adherence to ethical standards in data
usage, privacy, and compliance..
c. Considers feasibility, scalability, and practical implications.
4. Python Implementation (K5 - 4 points)
a. Select the most feasible solution by implementing the proposed solutions.
b. Successfully translates the chosen solution into Python code.

c. Demonstrates expert use of data analytics tools and technologies

5. Conclusion (K4- 2 points, K5 – 2 points)
a. Demonstrates exceptional creativity and innovation in problem-solving. (K4)
b. Results are interpreted accurately with strong, well-supported conclusions
and actionable insights. (K5)
Scoring:
1. Accomplished (4 points): Exceptional analysis, clear implementation, and depth of
understanding.
2. Competent (3 points): Solid performance with minor areas for improvement.
3. Developing (2 points): Adequate effort but lacks depth or clarity.
4. Minimal (1 point): Incomplete or significantly flawed.

End Semester Examination Marks (ESE):

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

Part A Part B Total

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

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

Bloom’s
Course Outcome Knowledge
Level (KL)
CO1 Apply various techniques for data preprocessing and analytics K3
Implement statistical and data mining methods for data analysis and
CO2 K3
pattern discovery.
Utilize machine learning algorithms for predictive analytics in real-
CO3 K3
world scenarios.
Analyse big data and implement real-time data processing and
CO4 K3
visualization techniques.
Synthesize and evaluate complex data analytics solutions for large-
CO5 K5
scale and real-time applications.
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create

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

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 3 2 2 1 - - 2 - - - 2
CO2 3 3 3 2 2 - - - 2 1 - 2
CO3 3 3 3 2 2 - - - 1 - - 2
CO4 3 3 3 3 2 1 - 3 - 1 - 3
CO5 3 3 3 3 3 2 1 - 2 2 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 Science for Business:
What You Need to Know Foster Provost, Tom 1st Edition,
1 About Data Mining and Data- Fawcett O'Reilly Media 2013
Analytic Thinking
 Reference Books
Name of the Edition and
Sl. No Title of the Book Name of the Author/s
Publisher Year
Python for Data Analysis: Data
Wrangling with Pandas, 2nd Edition,
1 NumPy, and IPython Wes McKinney O'Reilly Media
2017

Jiawei Han, Micheline

Data Mining: Concepts and Kamber, Jian Pei 3rd Edition,
2 Morgan Kaufmann
Techniques 2011

Hands-On Machine Learning

2nd Edition,
3 with Scikit-Learn, Keras, and Aurélien Géron O'Reilly Media
2019
TensorFlow
Big Data: Principles and Best
Practices of Scalable Real- Nathan Marz, James Manning 1st Edition,
4 Time Data Systems Warren Publications 2015

Video Links (NPTEL, SWAYAM…)

No. Link ID
1 https://www.youtube.com/watch?v=ua-CiDNNj30
2 https://www.youtube.com/watch?v=7eh4d6sabA0
3 https://www.youtube.com/watch?v=7eh4d6sabA0
4 https://www.youtube.com/watch?v=s0dMTAQM4cw
 SEMESTER S6

INTERNET OF THINGS

Course Code PBITT604 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) Programming Basics Course Type Theory

Course Objectives:

1. Students will be able to gain a comprehensive understanding of IoT, from its foundational
technologies to emerging trends and future directions.
2. Students will be able to develop IoT applications using Arduino and Raspberry Pi, focusing
on real-world scenarios and problem-solving.

SYLLABUS

Contact
Module
Syllabus Description Hours (44
No.
Hrs)

The Internet of Things Today: Time for Convergence, Towards the IoT
Universe(s), Internet of Things Vision, IoT Strategic Research and
Innovation Directions, IoT Applications.

Internet of Things and related future Internet technologies, Infrastructure,

1 Networks and Communication, Processes, Data management, Security, 11
Privacy & Trust, Device Level Energy Issues.

Current trends in Internet: Internet of Everything, Internet of Thing-

Storage, Databases.

IoT Standardisation: Status, Requirements, Initiatives and Organisations,

M2M Service Layer Standardisation, OGC Sensor Web for IoT, IEEE and
IETF, ITU-T. A Common Architectural Approach- The IoT-A Reference
Model.
2 11
IoT Software Platforms: Node-RED, ThingSpeak, Blynk, IoTivity

IoT Operating Systems: Contiki, RIOT, TinyOS

Cloud Platforms for IoT: AWS IoT, Google Cloud IoT, Microsoft Azure.

IoT Protocols:
3 11
Physical Data Link Layer: IEEE 802.15.4, LoRa, NFC, Zigbee,
 Bluetooth/Bluetooth Low Energy (BLE), 6LoWPAN

Network Layer: IPv4/IPv6, RPL, CoAP

Transport Layer: TCP, UDP, DTLS

Session & Application Layer: CoAP, MQTT, HTTP/HTTPS, XMPP,

AMQP, DDS

MQTT Publisher-Subscriber Model using MQTT Broker (Implementation)

HTTP - WebSocket communication

IoT Hardware:

Arduino – Introduction-Making the Sketch. ESP32 System on a Chip (SoC)

microcontroller.

Simple Digital and Analog Input-Using a Switch, Reading a Keypad,

Reading Analog Values

Getting Input from Sensors-Detecting Movement, light, motion, distance,

vibration, sound and temperature

Reading RFID Tags, Getting Location from a GPS

4 Visual Output-Connecting and Using LEDs 11

Physical Output-Controlling the Position of a Servo

Remotely Controlling External Devices-Controlling a Digital Camera

Connect Arduino to wired and wireless networks.

Raspberry Pi – Introduction, Python/Micro python and Raspberry Pi,

Arduino and Raspberry Pi, Basic Input and Output, Programming Inputs
and Outputs with Python.

IoT deployment for Raspberry Pi /Arduino/Equivalent development

platforms
Suggestions on Project Topics:
No. Project Topics

1 Smart Home Automation System

2 Smart Garden with Environmental Monitoring

3 RFID-based Attendance System

4 GPS-based Vehicle Tracking System

5 IoT-based Weather Station

6 Remote Surveillance System with Camera Control

7 Health Monitoring System

8 Smart Traffic Management System

9 Air Quality Monitoring System

10 Smart Waste Management System

11 IoT-based Smart Parking System

12 Smart Door Lock System

13 IoT-based Personal Safety Device

14 Smart Irrigation System

15 Smart City Infrastructure Monitoring

Course Assessment Method

(CIE: 60 marks, ESE: 40 marks)

Continuous Internal Evaluation Marks (CIE):

Internal Internal
Attendance Project Examination-1 Examination- 2 Total
(Written) (Written)

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

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

Part A Part B Total

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

Course Outcomes (COs)

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

Bloom’s
Course Outcome Knowledge
Level (KL)

Explain the current state and future of the Internet of Things (IoT),
CO1 covering its key technologies, infrastructure, data management, K2
security, and energy challenges.
Explain IoT standardization, including major organizations and
CO2 standards, and understand current trends like the Internet of Everything K2
and how storage and databases are used in IoT.
CO3 Identify and describe key IoT protocols across different layers. K3
Apply Arduino and Raspberry Pi to develop and deploy IoT solutions
CO4 K3
effectively.
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create
 CO-PO Mapping Table (Mapping of Course Outcomes to Program Outcomes)
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12

CO1 3 1 1 3 2 - - - - - - -

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

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

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

Internet of Things:
Dr. Ovidiu Vermesan,
Converging Technologies 1st Edition
1 Dr. Peter Friess River Publishers.
for Smart Environments 2013
and Integrated Ecosystems
3rd Edition
2 Arduino Cookbook Michael Margolis O'Reilly Media
2020
Getting Started With Matt Richardson, 3rd Edition
3 O'Reilly Media
Raspberry Pi Shawn Wallace 2013

Reference Books

Name of the Edition and

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

1 Building The Internet of 2nd Edition

Daniel Minoli Wiley
Things with IPv6 And MIPv6 2019

The Internet of Things: Key Olivier Hersent, David 2nd Edition,

2 Boswarthick, and Omar Wiley
Applications and Protocols 2012
Elloumi
 Video Links (NPTEL, SWAYAM…)

No. Link ID
1 https://onlinecourses.nptel.ac.in/noc24_cs115/
2 https://onlinecourses.swayam2.ac.in/ntr24_ed44/
3 https://onlinecourses.nptel.ac.in/noc24_cs115

Project Based Learning - Course Elements

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

Assessment and Evaluation for Project Activity

Sl. Allotted
Evaluation for
No Marks
1 Project Planning and Proposal 5
2 Contribution in Progress Presentations and Question Answer Sessions 4
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

OBJECT-ORIENTED PROGRAMMING IN JAVA

Course Code OEITT611 CIE Marks 40

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

Prerequisites (if any) None Course Type Theory

Course Objectives:

1.To equip students with the fundamental concepts of Object-Oriented Programming (OOP) using
Java.
2.Students will learn how to design, implement, and test Java programs, focusing on
encapsulation, inheritance, and polymorphism principles.
3.Students will be equipped with problem-solving, algorithm development, and good
programming practices.
SYLLABUS

Module Contact
Syllabus Description
No. Hours
Introduction to Java and OOP: Overview of programming languages,
Setting up the development environment (IDE, JDK), Writing and running a
simple Java program
1 9
Basics of Java: Variables, data types, and operators, control structures
(conditional control statements, loops), Input/output Basics (reading console
input, writing console output)
Classes and Objects: Defining classes and objects, Constructors and
instance variables, Methods and method overloading
2 9
Encapsulation and Access Modifiers: Encapsulation principles, Access
modifiers (public, private, protected), Getters and setters

Inheritance: Inheritance hierarchy, Method overriding Superclass and

subclass relationships
3 9
Polymorphism: Method overloading vs. method overriding, Dynamic
method dispatch, Abstract classes and interfaces
 Exception Handling: Handling exceptions (try-catch blocks), Custom
exceptions, Checked vs. unchecked exceptions. Errors: Understanding
common Error types in Java, using Java Error information for root cause
4 9
analysis and JVM tuning.
Collections and Data Structures: Lists, sets, and maps, ArrayList, HashSet,
HashMap, Iterators
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 module. Each question carries 9 marks.
Total of 8 Questions, each Two questions will be given from each module, out of
carrying 3 marks which 1 question should be answered.
60
Each question can have a maximum of 3 sub divisions.
(8x3 =24marks) (4x9 = 36 marks)

Course Outcomes (COs)

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

Bloom’s
Course Outcome Knowledge
Level (KL)
Demonstrate the ability to set up the Java development environment
CO1 K3
and write a simple Java program.
Define and instantiate classes and objects in Java, implement
CO2 constructors and instance variables, and apply encapsulation principles K3
and access modifiers
Implement inheritance hierarchy and polymorphism principles,
CO3 including method overriding, dynamic method dispatch, and the use of K3
abstract classes and interfaces
Apply exception handling mechanisms and use custom exceptions, and
CO4 K3
utilize Java collections and data structures like lists, sets, and maps.
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 2 2

CO2 3 3 3 3 2

CO3 3 3 3 3 2

CO4 3 3 3 3 2

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

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

Herbert Schildt, 13th

1 Java: The Complete Reference McGraw Hill Edition,
Danny Coward 2023
7th Edition,
2 Programming with Java E. Balagurusamy McGraw Hill
2023

Reference Books
Name of the Edition and
Sl. No Title of the Book Name of the Author/s
Publisher Year
9th Edition,
Core Java Volume –I Cay S. Horstmann,
1 Prentice Hall 2013.
Fundamentals Gary Cornell

Paul Deitel, Harvey 3rd Edition,

2 Java SE 8 for Programmers Pearson
Deitel 2015
Bart Baesens, Aimee
3 Beginning Java Programming Backiel, Seppe vanden Wrox,O’Reilly 2015
Broucke
Learn Java Fundamentals –
4 Vahe Aslanyan freeCodeCamp 2023
Object-Oriented Programming

Video Links (NPTEL, SWAYAM…)

No. Link ID
1 https://onlinecourses.nptel.ac.in/noc22_cs47/

2 https://nptel.ac.in/courses/106105191
 SEMESTER S6

DATA STRUCTURES USING C++

Course Code OEITT612 CIE Marks 40

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

Credits 3 Exam Hours 2 Hrs. 30 Min.

Prerequisites (if any) None Course Type Theory

Course Objectives:

1. To introduce the fundamental concepts of data structures and their implementation using C++.
2. To explore linear data structures such as arrays, linked lists, stacks, and queues.
3. To understand non-linear data structures such as trees and graphs, and their applications.
4. To examine advanced data structures and algorithms for efficient data management and
retrieval.
SYLLABUS

Module Contact
Syllabus Description
No. Hours
Module 1: Introduction to Data Structures and C++ Basics
Overview of Data Structures: Definition, Importance, and Applications
C++ Programming Basics: Pointers, References, Dynamic Memory

1 Allocation 9
Introduction to Abstract Data Types (ADTs)
Complexity Analysis: Time and Space Complexity
Basic C++ STL Containers: Vectors, Lists, Stacks, and Queues

Module 2: Linear Data Structures

Arrays and Strings: One-Dimensional and Multidimensional Arrays, String
Manipulation

2 Linked Lists: Singly Linked List, Doubly Linked List, Circular Linked List 9
Stacks: Implementation using Arrays and Linked Lists, Applications
Queues: Implementation using Arrays and Linked Lists, Circular Queue,
Priority Queue
 C++ STL Implementation of Linear Data Structures

Module 3: Non-Linear Data Structures

Trees: Binary Trees, Binary Search Trees (BST)

Tree Traversal Techniques: Inorder, Preorder, Postorder, Level Order

3 Heaps: Min-Heap, Max-Heap, Heap Sort 9

Graphs: Representation (Adjacency Matrix, Adjacency List), Graph
Traversal (DFS, BFS)
Applications of Trees and Graphs in Problem Solving

Advanced Data Structures and Algorithms

Hashing: Hash Functions, Collision Resolution Techniques, Applications

Search Algorithms: Binary Search, Interpolation Search, Exponential Search

4 9
Sorting Algorithms: Bubble Sort, Insertion Sort, Selection Sort, Quick Sort,
Merge Sort, Heap Sort, Radix Sort
C++ STL Implementation of Advanced Data Structures

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)
Apply basic data structure concepts to develop simple programs using
CO1 K3
C++
Implement linear data structures using C++ for various computational
CO2 K3
tasks.
Utilize non-linear data structures like trees and graphs for complex
CO3 K3
problem-solving
Analyze and implement advanced data structures and algorithms for
CO4 K2
optimized performance.
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create

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

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

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

1 Data Structures Through C++ Yashwant Kanetkar BPB 5th Edition,2019

Data Structures and Algorithm 4th Edition,

2 Mark Allen Weiss Pearson
Analysis in C++ 2013
 Reference Books
Name of the Edition and
Sl. No Title of the Book Name of the Author/s
Publisher Year
C++ Programming: Principles 2nd Edition
1 Bjarne Stroustrup Addison-Wesley
and Practice Using C++ 2014
Data Structures and Algorithms 4th Edition,
2 Adam Drozdek Cengage Learning
in C++ 2012
Thomas H. Cormen,
Charles E. Leiserson, 3rd Edition,
3 Introduction to Algorithms MIT Press
Ronald L. Rivest, 2009
Clifford Stein
The Art of Computer
Addison-Wesley Box Set
4 Programming, Volumes 1-4A Donald E. Knuth
Professional Edition, 2011
Boxed Set

Video Links (NPTEL, SWAYAM…)

No. Link ID
1 https://www.youtube.com/watch?v=ZyRLdtKXW4s
2 https://www.youtube.com/watch?v=MeNaA-eG25k
3 https://www.youtube.com/watch?v=6oL-0TdVy28
4 https://www.youtube.com/watch?v=oaY3m2hVGw8
 SEMESTER S6
AI WITH PYTHON
Course Code OEITT613 CIE Marks 40

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

Credits 3 Exam Hours 2 Hrs. 30 Min.

Prerequisites (if any) None Course Type Theory

Course Objectives:
1. To provide a comprehensive overview of artificial intelligence and its practical applications.
2. To demonstrate proficiency in AI problem definition, algorithm design, and Python
implementation.
SYLLABUS

Module Contact
Syllabus Description
No. Hours
Introduction to Artificial Intelligence (AI) and Python: Overview of AI and
Agents- Definition and History of AI, Narrow AI vs. General AI, AI
Applications, Definition and Components of AI Agents, Types of Agents-

1 Simple Reflex, Model Based, Goal Based, and Utility Based Agents, Agent 9
Architectures and Environments. Python for AI- Python basic data
structures, Setting Up Python Environment, Key Libraries and Tools-
NumPy, Pandas, Matplotlib.

AI Problems: Definition and formulation of AI problems, State space

representation, actions, and goals, Problem characteristics- problem
decomposability, solution steps consideration, problem solution

2 predictability, absolute or relative problem solution, state or path solution, 9

role of knowledge in problem solving, human interaction in problem solving.
Problem definition and Python implementation of Water Jug Problem,
8-Puzzle Problem & Missionaries and Cannibals Problem.

AI Search Algorithms: Uninformed Search Algorithm- Breadth First Search

and Depth First Search algorithms description and implementation using

3 Python, Informed Search Algorithms- Hill Climbing, A* Search algorithm, 9

and AO* Search algorithm description and implementation using Python,
Comparison of informed and uninformed search algorithms.
 Game Playing and Constraint Satisfaction Problem (CSP): Minimax
algorithm and Alpha-Beta Pruning, Game Playing Implementation- Tic-Tac-

4 Toe with minimax and alpha-beta pruning, Introduction to CSP- Definitions 9

and basic concepts, Techniques for CSP- Backtracking and Constraint
Propagation.

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 evolution and types of AI, outline the role of different AI
CO1 agents, and set up a Python environment for AI development.
K2
Understand, represent, and solve fundamental AI problems using
CO2 Python.
K3
Implement various search algorithms used in AI to efficiently solve
CO3 problems.
K3
Implement game-playing algorithms and constraint satisfaction
CO4 techniques using Python.
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 1 1 2 - - - 2 - - 2
CO2 3 3 3 2 3 2 - - 2 - - 2
CO3 3 3 3 2 3 3 - - 2 - - 2
CO4 3 3 2 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
Artificial Intelligence: A Stuart Russell and Peter 4th Edition,
1 Pearson
Modern Approach Norvig 2020
Artificial Intelligence:
Poole, D. L. and Cambridge University
2 Foundations of Computational 2010
Mackworth, A.K. Press
Agents

Reference Books
Name of the Edition and
Sl. No Title of the Book Name of the Author/s
Publisher Year
Artificial Intelligence: A Guide 1st Edition,
1 Melanie Mitchell Penguin Books
for Thinking Humans 2019
Introduction to Artificial 1st Edition,
2 Wolfgang Ertel Springer
Intelligence 2018
Principles of Artificial
3 Nils J. Nilsson Morgan Kaufmann 2014
Intelligence

Video Links (NPTEL, SWAYAM…)

No. Link ID
1 https://onlinecourses.nptel.ac.in/noc24_ge47/preview
2 https://onlinecourses.nptel.ac.in/noc22_cs32/preview
3 https://onlinecourses.nptel.ac.in/noc21_cs79/preview
4 https://onlinecourses.nptel.ac.in/noc22_cs56/preview
5 https://onlinecourses.nptel.ac.in/noc22_cs06/preview
 SEMESTER S6

NETWORK SECURITY LAB

Course Code PCITL607 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) PCITT402: Computer Networks Course Type Lab

Course Objectives:

1. To understand and implement modern symmetric key algorithms and public key infrastructure
in network security.
2. To explore and apply digital signatures and cryptographic hash functions in secure
communication.

3. To study and implement intrusion detection and prevention systems for securing networks.

4. To configure and test firewalls, network security protocols, and cryptographic protocols.

Experiment
Experiments
No.
1 Implementation of AES and DES algorithms for data encryption and decryption.
Setting up and configuring a public key infrastructure (PKI) for secure
2
communication.
Key management using RSA algorithm and certificate generation in a simulated
3
environment.

4 Implementation of digital signatures using RSA and DSA algorithms.

Application of cryptographic hash functions (SHA-256, MD5) for data integrity

5
verification.

6 Secure message transmission using digital signatures and hash functions.

7 Configuration and deployment of Snort as an Intrusion Detection System (IDS).

8 Implementation of an Intrusion Prevention System (IPS) using open-source tools.

 9 Analysis of network traffic and identification of malicious activities using IDS/IPS.

10 Configuration of a network firewall using iptables/pfSense.

11 Implementation of VPN protocols (IPSec, SSL/TLS) for secure communication.

Testing and validation of cryptographic protocols (SSL/TLS) in securing web

12
transactions.

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

Conduct of
Procedure/ Result with valid
experiment/
Preparatory inference/ Viva
Execution of work/ Record Total
work/Design/ Quality of voce
troubleshooting/
Algorithm Output
Programming
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)
Implement modern symmetric key algorithms and configure public key
CO1 K3
infrastructure to secure data transmission.
Use digital signatures and cryptographic hash functions for secure
CO2 K3
communication and data integrity.
Apply and evaluate intrusion detection and prevention systems to
CO3 K3
protect network infrastructures.
Configure and test firewalls and network security protocols to
CO4 K3
safeguard 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 2 2 - - 1 1 - - 2
CO2 3 3 3 2 2 - - 1 1 - - 2
CO3 3 3 3 3 2 - - - 2 - - 3
CO4 3 3 3 3 2 - - - 2 1 - 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
Cryptography and Network Pearson Education 7th Edition,
1 William Stallings
Security: Principles and Practice Press 2017

Reference Books
Name of the Name of the Edition and
Sl. No Title of the Book
Author/s Publisher Year
20th
Applied Cryptography: Protocols,
1 Bruce Schneier Wiley Anniversary
Algorithms, and Source Code in C
Edition, 2015
Network Security Essentials: 6th Edition,
2 William Stallings Pearson Education
Applications and Standards 2017
 John Viega, Matt
1st Edition,
3 Network Security with OpenSSL Messier, Pravir O'Reilly Media
2002
Chandra
William R.
2nd Edition,
Firewalls and Internet Security: Cheswick, Steven
4 Addison-Wesley 2003
Repelling the Wily Hacker M. Bellovin,
Aviel D. Rubin

Video Links (NPTEL, SWAYAM…)

Link No. Link ID

1 https://www.youtube.com/watch?v=ZD71JeX4VkI
2 https://www.youtube.com/watch?v=3QnD2c4Xovk
3 https://www.youtube.com/watch?v=jvf4eCW1XI4
4 https://www.youtube.com/watch?v=8yKpQSHpYP0

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 question.
● Proficiency in answering questions related to theoretical and practical aspects of the subject.
5. Record (5 Marks)
● Completeness, clarity, and accuracy of the lab record submitted
 SEMESTER 7
INFORMATION TECHNOLOGY
 SEMESTER S7

NATURAL LANGUAGE PROCESSING

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

 Students will be able to understand fundamental concepts of natural language processing

(NLP).
 Students will be able to understand advanced NLP techniques for syntactic and semantic
understanding, including POS tagging, HMM tagging, named entity recognition, coreference
resolution, and semantic role labelling
 Students will be able to understand practical NLP applications such as machine translation,
question answering systems, chatbots, dialogue systems, automatic speech recognition, and
text-to-speech technologies.
SYLLABUS

Module Contact
Syllabus Description
No. Hours
Introduction to Natural Language Understanding: Applications, Levels of
NLP, Basic Text Processing, Empirical Laws, Minimum Edit Distance.
N-gram Language Models: N-grams, Evaluating Language Models,
1 Smoothing:Knesser-Ney Smoothing, Perplexity’s Relation to Entropy. 9
Naive Bayes, Text Classification, and Sentiment: Naive Bayes Classifiers,
Training the Naive Bayes Classifier, Evaluation: Precision, Recall, F-
measure, Test sets and Cross-validation.

POS Tagging, HMM POS Tagging, Viterbi Algorithm, Morphology, Named

2 9
Entity Recognition, Conditional Random Fields.
 Lexical Semantics, Vector Semantics, TF-IDF, PMI, Word2Vec, Word
Senses, Word Sense Disambiguation, WordNet
Context-Free Grammars and Constituency Parsing, Treebank.

Semantic Roles, Logical Representations of Sentence Meaning, Semantic

3 Role Labeling, Lexicons for Sentiment, Affect, and Connotation, 9
Coreference Resolution, Discourse Coherence.

NLP Applications:
Machine Translation, Question Answering and Information Retrieval,
4 9
Chatbots & Dialogue Systems, Automatic Speech Recognition and Text-to-
Speech, Relation and Event Extraction.

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)
Explain and implement basic text processing, n-gram language models,
CO1 K2
and Naive Bayes classifiers

Illustrate advanced natural language processing techniques to analyze

CO2 K2
and process natural language text effectively.

Describe semantic role labeling, logical representations of sentence

CO3 meaning, and coreference resolution to ensure discourse coherence and K2

accurate semantic understanding.

Summarize different natural language processing (NLP) applications

CO4 by applying appropriate NLP techniques and evaluating their K2

effectiveness.

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

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

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

CO1 3 2 2 - 2 - - - - - - 2

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

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

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

Speech and Language Dan Jurafksy, Pearson Education

1 3rd edition
Processing James H Martin India

Reference Books
Name of the Edition and
Sl. No Title of the Book Name of the Author/s
Publisher Year
Natural Language
1 James Allen Pearson 2nd edition
Understanding
Foundations of Statistical
2 Christopher Manning MIT Press 1st edition
Natural Language Processing

Video Links (NPTEL, SWAYAM…)

No. Link ID

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

2 https://archive.nptel.ac.in/noc/courses/noc19/SEM2/noc19-cs56/

3 https://web.stanford.edu/~jurafsky/slp3/
 SEMESTER S7

SOFTWARE DEVELOPMENT WITH AGILE AND DEVOPS

Course Code PEITT742 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) PCITT503: Software Course Type Theory

Engineering

Course Objectives:

1. To understand the core concepts of DevOps and how they integrate with Agile practices to
enhance software development and deployment.
2. To understand the core concepts of DevOps and how they integrate with Agile practices to
enhance software development and deployment.
3. To equip students with the knowledge and skills to develop secure software by integrating
security best practices throughout the development lifecycle.
4. To explore advanced concepts in Agile and DevOps, with a focus on scaling and continuous
improvement in large and complex environments.
SYLLABUS

Modu Contact
Syllabus Description
le No. Hours
Introduction to Agile Development
Introduction to Agile Methodology: Overview of traditional vs. Agile
development, Agile Manifesto and Principles.
Agile Frameworks: Scrum, Kanban, XP (Extreme Programming).
1 9
Agile Project Management: User Stories, Backlogs, Sprints, and Releases.
Roles in Agile Teams: Product Owner, Scrum Master, Development Team.
Agile Planning and Estimation: Story Points, Velocity, and Burndown Charts.
Agile Metrics and Reporting: Measuring progress, continuous improvement.
DevOps Fundamentals and Practices
2 9
Introduction to DevOps: Definition, need for DevOps, DevOps lifecycle.
 Continuous Integration and Continuous Deployment (CI/CD): Jenkins, GitLab
CI, Travis CI.
Infrastructure as Code (IaC): Terraform, Ansible, Docker, and Kubernetes.
Version Control Systems: Git, Git workflows, branching strategies.
Automated Testing in DevOps: Unit tests, integration tests, deployment
testing.
Secure Software Development
Introduction to Secure Software Development: Importance of security in
software, common vulnerabilities.
Secure Coding Practices: OWASP Top 10, secure coding standards.
3 Threat Modeling: Identifying threats, security design principles. 9
Security Testing: Static Application Security Testing (SAST), Dynamic
Application Security Testing (DAST), and penetration testing.
Security in CI/CD Pipeline: Integrating security into DevOps (DevSecOps),
automated security tools.
Advanced DevOps and Agile Practices
Advanced CI/CD Pipelines: Custom pipelines, Blue-Green deployments,
Canary releases.
Monitoring and Logging: Prometheus, Grafana, ELK Stack (Elasticsearch,
Logstash, Kibana).
4 9
Cloud and DevOps: DevOps practices in AWS, Azure, and GCP.
Agile at Scale: Scaling Agile in large organizations, SAFe (Scaled Agile
Framework), LeSS (Large Scale Scrum).
Continuous Feedback and Improvement: Retrospectives, continuous learning
and adaptation.

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)
Discuss Agile principles and practices to manage and deliver software
CO1 K2
projects effectively.
Explain DevOps practices to automate and streamline software
CO2 K2
development, testing, and deployment processes.
Describe secure coding practices and integrate security into the
CO3 K2
software development process.
Illustrate advanced DevOps practices in a cloud environment to
CO4 K2
enhance software delivery.
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create

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

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 2 3 - - - - - - - 2 2
CO2 3 3 3 - - - - - - - 2 2
CO3 3 3 3 2 - - - - - - 2 2
CO4 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 and
Sl. No Title of the Book Name of the Author/s
Publisher Year

Agile Software Development,

1st Edition,
1 Principles, Patterns, and Robert C. Martin Prentice Hall
2002
Practices

Reference Books
Name of the Edition and
Sl. No Title of the Book Name of the Author/s
Publisher Year
Scrum: The Art of Doing
1st Edition,
1 Twice the Work in Half the Jeff Sutherland Crown Business
2014
Time
The Phoenix Project: A Novel 5th
Gene Kim, Kevin Behr,
2 About IT, DevOps, and IT Revolution Press Anniversary
George Spafford
Helping Your Business Win Edition, 2018
The Web Application Hacker's
Dafydd Stuttard, Marcus 2nd Edition,
3 Handbook: Finding and Wiley
Pinto 2011
Exploiting Security Flaws
Continuous Delivery: Reliable
Software Releases through Jez Humble, David 1st Edition,
4 Addison-Wesley
Build, Test, and Deployment Farley 2010
Automation

Video Links (NPTEL, SWAYAM…)

No. Link ID

1 https://www.youtube.com/watch?v=VFQtSqChlsk&t=4223s

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

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

https://www.youtube.com/watch?v=egTi9U9vw3E&list=PLjNII-
4
Jkdjfz5EXWlGMBRk63PC8uJsHMo
 SEMESTER S7

BLOCKCHAIN TECHNOLOGY

Course Code PEITT743 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) PCITT601: Cryptography Course Type Theory

and Network Security

Course Objectives:

1. Students will be familiar with the working of popular blockchain platforms: bitcoin &
Ethereum and will acquire understanding of underlying principles of blockchain.
2. Students will be able to develop and deploy smart contracts in Ethereum blockchain.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Blockchain Introduction: Fundamentals of blockchain - historical
background, basic terminologies in Blockchain, structure of a block (till
this from Ref. 3), Blockchain architecture, generic elements of a blockchain,
How blockchain works, benefits, features, and limitations of blockchain
(till this from Textbook 1), Types of Blockchain, The Evolutionary
1 8
Transformation of Blockchain, Comparison of different generation of
blockchain (till this from Ref. 3)
Decentralization using blockchain: Methods of decentralization, Routes
to decentralization, Blockchain and full ecosystem decentralization, IPFS
basics

Cryptography for blockchain: cryptographic primitives - Secure Hash

algorithms, Applications of cryptographic hash functions, Message
2 9
Authentication Codes, Digital signatures, Merkle tree, Elliptic curve
cryptography fundamentals
 Consensus Algorithms: Introducing the consensus problem, The
Byzantine generals problem, Fault tolerance, FLP impossibility,
Classification and categories of consensus algorithms - CFT algorithms,
BFT algorithms, Nakamoto consensus, Proof of Stake, Choosing a
consensus algorithm

Bitcoin: The beginnings of Bitcoin, Bitcoin Definition, Bitcoin - a user's

perspective, Cryptographic keys, Addresses in Bitcoin, Transactions, The
transaction lifecycle, The transaction data structure, The Script language,
3 7
Types of scripts, Coinbase transactions, Transaction validation, Transaction
bugs, Bitcoin blockchain, The genesis block, Mining, Proof of work, The
mining algorithm, The hash rate, Mining systems, Mining pools, wallets

Ethereum: A General-Purpose Blockchain, Ethereum’s components,

Ethereum and Turing Completeness, From General-Purpose Blockchains to
Decentralized Applications (DApps), Ether currency units, Getting Started
with MetaMask, Introducing the world Computer, Externally Owned
Accounts (EOAs) and Contracts
A simple Contract: A Test Ether Faucet, Compiling the Faucet Contract,
Creating the Contract on the Blockchain, Interacting with the Contract, The
4 12
Structure of a Transaction, Special Transaction: Contract Creation, A
Blockchain Based Supply Chain Management Testcase ( from Ref. 3)
Smart Contracts and Solidity: Life Cycle of a Smart Contract, Building a
Smart Contract with Solidity, The Ethereum Contract ABI, Programming
with Solidity
Tokens: How Tokens Are Used, The ERC20 Token Standard, Launching
Our Own ERC20 Token,

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 summarize foundational concepts of decentralization with blockchain K2

CO2 Interpret the importance of cryptography and consensus in Blockchain K2

CO3 Outline the working of Bitcoin blockchain K2

CO4 Build and deploy smart contract in Ethereum blockchain K3

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

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

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 2 - 3 - - - - - - - 3
CO2 3 - - 3 2 - - - - - - 3
CO3 3 3 3 2 2 - - - - - - 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

3rd Edition
1 Mastering Blockchain Imran Bashir Packt Publishing Ltd.
2020

Andreas M. Antonopoulos 1st Edition

2 Mastering Ethereum O’Reilly Media, Inc
and Dr. Gavin Wood 2018

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

Lorne Lantz and Daniel O’Reilly Media, 1st Edition

1 Mastering Blockchain
Cawrey Inc., 2020

Solidity Programming 1st Edition

2 Ritesh Modi Packt Publishing
Essentials 2018
Blockchain 1.0 to Blockchain
4.0—The Evolutionary Pratyusa Mukherjee,
3 De Gruyter May, 2021
Transformation of Chittaranjan Pradhan
Blockchain Technology
Bitcoin: A Peer-to-Peer
4 Satoshi Nakamoto Bitcoin.org Oct, 2008
Electronic Cash System

Video Links (NPTEL, SWAYAM…)

No. Link ID

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

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

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

4 https://onlinecourses.swayam2.ac.in/aic21_ge01/preview
 SEMESTER S7

MOBILE APP DEVELOPMENT

Course Code PEITT744 CIE Marks 40

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

Credits 3 Exam Hours 2 Hrs. 30 Min.

Prerequisites (if any) None Course Type Theory

Course Objectives:

1. To introduce students to the fundamentals of mobile application development, including different

mobile platforms and development environments.
2. To familiarize students with UI/UX design principles and their application in creating user-
friendly and aesthetically pleasing mobile applications.
3. To provide knowledge on backend integration, including APIs, cloud services, and database
management for mobile applications.
4. To explore advanced topics in mobile app development such as performance optimization,
security practices, cross-platform development, and future trends.
SYLLABUS

Module Contact
Syllabus Description
No. Hours
Introduction to Mobile App Development - Overview of Mobile
Application Development: History, Trends, and Importance, Mobile
Platforms: Android, iOS, and Cross-Platform Development, Development
Environments: Android Studio, Xcode, and Visual Studio Code, Basic App
Development Lifecycle: Design, Development, Testing, and Deployment,
1 11
Introduction to Programming Languages: Java, Kotlin, Swift, and Dart.

Lab: Setting up development environments (Android Studio, Xcode,

Visual Studio Code), Building a simple "Hello World" app using Java
(Android) and Swift (iOS), Exploring cross-platform development with
Flutter
 UI/UX Design for Mobile Apps - UI/UX Design Principles: Visual Design,
Information Architecture, Interaction Design - Wireframing and
Prototyping Tools: Figma, Sketch, Adobe XD - Responsive Design for
Multiple Devices and Screen Sizes - Material Design Guidelines for
Android and Human Interface Guidelines for iOS - Accessibility in Mobile
2 11
App Design
Lab: Creating wireframes and prototypes using Figma or Sketch -
Implementing responsive design in Android and iOS apps - Applying
Material Design and Human Interface Guidelines in simple UI components
-Testing app accessibility features on various devices

Backend Integration and APIs- Connecting Mobile Apps to Backend

Services: RESTful APIs, GraphQL-Cloud Services for Mobile Apps:
Firebase, AWS Amplify, Google Cloud-Working with Databases: SQLite,
Realm, Firebase Realtime Database-Data Storage and Management in
Mobile Apps-Implementing Push Notifications and In-App Messaging
3 11
Lab: Setting up and integrating a Firebase backend with a mobile app-
Implementing RESTful API calls in an app using Retrofit (Android) and
URLSession (iOS)-Storing and retrieving data using SQLite and Firebase
Realtime Database-Configuring push notifications and sending in-app
messages

Advanced Topics in Mobile App Development-Performance Optimization:

Profiling, Memory Management, and Battery Efficiency-Mobile App
Security: Secure Coding Practices, Encryption, and Authentication-Cross-
Platform Development: React Native, Flutter, Xamarin-App Store
Deployment: Google Play Store, Apple App Store.
4 11
Lab: Profiling and optimizing app performance using Android Studio and
Xcode tools, Implementing secure coding practices and encryption in
mobile apps, Developing and deploying a cross-platform app using Flutter,
Preparing and submitting apps to the Google Play Store and Apple App
Store.
 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 an understanding of mobile application development
CO1 fundamentals, including platform architecture and development K3
environments.

Apply UI/UX design principles to develop user-centric mobile

CO2 K3
applications with effective interface designs.

Use backend services, APIs, and databases in mobile applications to

CO3 K3
enhance functionality and data management.

Implement mobile applications by optimizing for performance and

CO4 security, and apply cross-platform development strategies and future K3
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 3 2 - 2 - - - 3 - - -
CO2 2 3 2 2 2 - - - 3 - - -
CO3 2 3 3 2 2 - - - 3 2 - -
CO4 3 3 3 2 3 - - - 3 2 - 2

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

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

Bill Phillips, Chris

Android Programming: The Big Nerd Ranch 4th Edition
1 Stewart, Kristin
Big Nerd Ranch Guide Guides 2019
Marsicano

iOS Programming: The Big Christian Keur, Aaron Big Nerd Ranch 7th Edition
2
Nerd Ranch Guide Hillegass Guides 2020

Reference Books
Name of the Edition and
Sl. No Title of the Book Name of the Author/s
Publisher Year
Flutter for Beginners: An
Introductory Guide to Building 2nd Edition
1 Alessandro Biessek Packt Publishing
Cross-Platform Mobile 2021
Applications

Kotlin Programming: The Big Josh Skeen, David Big Nerd Ranch 1st Edition
2
Nerd Ranch Guide Greenhalgh Guides 2018

Pro iOS 14 Development with 2021Bonnie

3 Wallace Wang Apress
Swift 5 Eisenman
Learning React Native:
2nd Edition
4 Building Native Mobile Apps Bonnie Eisenman O'Reilly Media
2017
with JavaScript
Mobile App Development with
Ionic, Revised Edition: Cross-
5 Chris Griffith O'Reilly Media 2017
Platform Apps with Ionic,
Angular, and Cordova

Video Links (NPTEL, SWAYAM…)

No. Link ID

1 https://onlinecourses.swayam2.ac.in/nou21_ge41/preview

2 https://archive.nptel.ac.in/courses/106/106/106106156/
 SEMESTER S7

DEEP LEARNING

Course Code PEITT745 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) PCITT501: Machine Learning Course Type Theory

Course Objectives:

1. To enable students to understand the fundamental deep learning techniques and apply them to
solve real-world problems.
2. To enable students to analyze and evaluate advanced deep learning models and their applications
to determine the most suitable approach for complex problems.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Deep Learning Fundamentals: Principal Component Analysis,
Conditional Probability- Chain Rule, Bayes’ Rule, Hyper parameter
Optimization - Gradient- Based Optimization – SGD, Adaptive GD,
1 RMSprop, Constrained Optimization, Regularization - L1 and L2 9
regularization.
Deep Feedforward Networks: Gradient-Based Learning, Hidden Units,
Architecture Design, Backpropagation
Recurrent Neural Networks:
Architecture, Challenges, Bi-directional RNN, Enocder- Decoder
2 9
Sequence-to-Sequence Application, LSTM, Gated Recurrent Unit
networks, Applications of RNN.
 Convolutional Networks:
Basic Structure of Convolutional Network, Training a Convolutional
3 9
Network, Transfer learning models - AlexNet, GoogleNet, VGG Net,
ResNet, Applications of CNN

Advanced Deep Learning:

Transformers and Pre-trained networks, Generative Adversarial Network,
4 Autoencoder: Basic Principles, Deep Autoencoder, Applications, 9
Competitive Learning- Self Organising Map, Applications of Deep
Learning

Course Assessment Method

(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

Internal Evaluate
Analyze Level
Attendance Examination Level Total
Assessment
(Written) Assessment

5 15 10 10 40

Evaluate and Analyze Level Assessment [20 Marks]

Students should evaluate and analyze a real-world problem, assess the proposed solutions,
provide a conclusion on which solution is most appropriate for the problem, and implement
the chosen solution.

Criteria for evaluation:

1. Problem Definition (K2 - 4 points)
a. Clearly defines the real-world problem, ensuring it is specific and relevant.
b. Problem is excellently defined with precise, impactful objectives that
highlight the importance and scope of the issue.
2. Problem Analysis (K4 - 4 points)
a. Break-down and presents a well-reasoned solution approach, including the
rationale behind chosen methods.
b. Performance metrics are expertly selected, analysis is deep, insightful, and
 demonstrates strong understanding of the problem and proposed solutions.
3. Evaluate (K5 - 4 points)
a. Thoroughly evaluate the proposed solutions, comparing their effectiveness
and relevance.
b. Data is excellently selected; preprocessing is sophisticated and enhances
model performance.
c. Training process is expertly handled, validation is extensive, demonstrating
strong generalization and robustness of the model.
4. Implementation (K3 - 4 points)
a. Select the most feasible solution based on evaluation and implements it.

b. Successfully translates the chosen solution into code with a clear, working
implementation.
c. Design is innovative, implementation is flawless and optimized for
performance.

5. Conclusion (K4- 2 points, K5 – 2 points)

a. Provides a highly creative and innovative conclusion, pushing the boundaries
of standard methods. (K4)
b. Demonstrates an excellent grasp of deep learning concepts, applied
creatively and effectively in the context of the solution. (K5)
Scoring:
1. Accomplished (4 points): Exceptional analysis, clear implementation, and depth of
understanding.
2. Competent (3 points): Solid performance with minor areas for improvement.

3. Developing (2 points): Adequate effort but lacks depth or clarity in analysis or

implementation.
4. Minimal (1 point): Incomplete or significantly flawed analysis or implementation.
End Semester Examination Marks (ESE):

In Part A, all questions need to be answered and 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 fundamental concepts of deep learning to design, train, and K3
CO1
evaluate deep feedforward networks.

Implement and compare various gradient-based optimization K3

CO2
techniques to optimize deep learning models.

Design and develop deep feedforward networks and recurrent neural K3

CO3 networks, including architectures like LSTM and GRUs, to address
specific tasks.

Explore and apply various CNN to solve complex visual recognition K3

CO4
tasks.

Analyze and evaluate advanced deep learning techniques, to innovative

CO5 K5
applications.

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

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

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

Text Books
Sl. Edition and
Title of the Book Name of the Author/s Name of the Publisher
No Year
Neural Networks and
Springer International
1 Deep Learning: A Charu C. Aggarwal 1st ed. 2018
Publishing AG
Textbook
Speech and Language James H Matin, Dan https://web.stanford.edu/~
2 (3rd ed. draft)
Processing Jurafsky jurafsky/slp3/
2 November
Deep Learning:
Christopher M. Springer-Nature New 2023
3 Foundations and
Bishop, Hugh Bishop York Inc
Concepts

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

Machine Learning: Theory and M. Narasimha Murty, Univerities

1 1st Edition, 2024
Practice Ananthanarayana V S Press

Deep Learning (Adaptive

Ian Goodfellow, Yoshua 2016
2 Computation and Machine MIT Press
Bengio, Aaron Courville
Learning Series)
Pattern Recognition and 1st Edition
3 Bishop C M Springer
Machine Learning Reprint, Jan 2009
 Video Links (NPTEL, SWAYAM…)

No. Link ID

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

2 https://onlinecourses.nptel.ac.in/noc20_cs62/preview
 SEMESTER S7

APPROXIMATION ALGORITHMS

Course Code PEITT751 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) PCITT502: Algorithm Course Type Theory

Analysis and Design

Course Objectives:

1. To introduce the fundamental concepts of approximation algorithms and their importance in

solving NP-hard problems.
2. To explore various design techniques used in approximation algorithms, including greedy
methods, layering, primal-dual method and semidefinite programming.
3. To understand the analysis of approximation algorithms and the concepts of approximation
ratio, performance guarantees and inapproximability results.
4. To introduce the fundamental concepts of fixed-parameter tractable algorithms and various
design techniques used in parameterized complexity to solve NP-hard problems.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Module 1: Overview of Computational Complexity and Introduction to
Approximation Algorithms
Overview of Computational Complexity: Decision problem vs
Optimization problem - P, NP, co-NP, NP-Hard, and NP-Complete classes—
1 along with their interrelationships- Intractability of NP-Complete problems: 9
Challenges and Importance- Polynomial time reductions- Examples of NP-
Complete problems -SAT, 3-SAT, Clique, Vertex Cover.
Approaches to solve NP-Complete Problems (Concept only):
Approximation algorithms, Exact algorithms, Randomized algorithms,
 Fixed-parameter tractable algorithms.
Introduction to Approximation Algorithms: Definition and Motivation-
Approximation Ratio: Definition - Basic Techniques : Greedy Algorithms
and Local Search. : Basic Concept, Algorithm and analysis of
approximation factor (detailed analysis not required) of Set Cover problem,
Scheduling jobs on identical parallel machines, Travelling Salesman
problem, Metric Steiner Tree problem.
Module 2: Advanced Techniques for Designing Approximation
Algorithms
Primal Dual Schema: Introduction to Linear Programming, Concept of
Primal Dual Schema- LP Duality Theorem, Complementary Slackness
Theorem. Linear programming formulation of the Set Cover, Vertex Cover,
Minimum Multicut, Multiwaycut and Weighted Vertex Cover Problems -
Approximation algorithm for the SET Cover problem - using simple
2 rounding technique and primal dual schema - analysis of approximation 9
factor.
Randomized Algorithms: Concept of randomization, Randomized rounding
-Set Cover Problem, Randomized algorithm for MAX CUT problem,
Derandomization of MAX CUT algorithm.
Semidefinite Programming (SDP) : Basics of SDP and its relation to LP,
Formulating approximation problems using SDP, SDP-based approximation
algorithm and analysis of approximation ratio for the MAX-CUT problem.
Module 3: Hardness of Approximation Algorithms
Hardness of Approximation: Reductions, gaps, and hardness factors, PCP
3 Theorem, Hardness of MAX-3SAT, Hardness of MAX-3SAT with bounded 9
occurrence of variables, Hardness of vertex cover and Steiner tree, Hardness
of Clique.
Module 4: Introduction to Parameterized Complexity Theory
Introduction to Parameterized Complexity Theory : Parameterized
problem- Definition and Example, Fixed-parameter Tractable (FPT)
algorithms - Definition.
Design Techniques in Parameterized Complexity : Kernelization-
4 9
Concept, FPT algorithms for Vertex Cover problem and 3-Hitting set
problem, Bounded Search Tree - Concept, FPT algorithms for Vertex Cover
problem and Feedback Vertex Set problem, Iterative Compression -
Concept, FPT algorithms for Vertex Cover problem.
Parameterized Intractability: Parameterized reductions, W-hierarchy.
 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 fundamentals of computational complexity and apply
CO1 the basic concepts of approximation algorithms to solve NP-hard K3
problems with near-optimal solutions.

Integrate advanced techniques in approximation algorithms to tackle

CO2 K3
complex computational problems.

CO3 Analyze the hardness of approximation for various problems. K3

Design Fixed-parameter tractable (FPT) algorithms for practically

CO4 K2
relevant NP-hard problems.

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

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

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

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

1 The Design of Approximation David P. Williamson, Cambridge 1st Edition,

Algorithms David B. Shmoys University Press 2011

2 1st Edition,
Approximation Algorithms Vijay V. Vazirani Springer
2001

3 1st Edition,
Parameterized Algorithms Cygan et. al Springer
2015

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

Rajeev Motwani, Cambridge 1st Edition,

1 Randomized Algorithms
Prabhakar Raghavan University Press 1995
Approximation Algorithms for 1st Edition,
2 Dorit Hochbaum PWS Publishing
NP-Hard Problems 1997
Complexity and Approximation:
Giorgio Ausiello,
Combinatorial Optimization 1st Edition,
3 Pierluigi Crescenzi, Springer
Problems and Their 2003
Giorgio Gambosi
Approximability Properties

Video Links (NPTEL, SWAYAM…)

No. Link ID

1 https://onlinecourses.nptel.ac.in/noc24_cs97

2 https://onlinecourses.nptel.ac.in/noc20_cs39

3 https://onlinecourses.nptel.ac.in/noc21_cs92
 SEMESTER S7

SOFTWARE QUALITY ASSURANCE

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

PEITT633: SOFTWARE
Prerequisites (if any) Course Type Theory
PROJECT MANAGEMENT

Course Objectives:

1. To provide students with a deep understanding of Software Quality Assurance (SQA)

concepts, and models, including McCall’s Classic Model and ISO/IEC 25010, as well as the
ability to evaluate software compliance with quality factors and navigate the challenges
associated with maintaining software quality.
2. To enable students to design and implement effective SQA processes, including pre-project
quality components, SQA plans, and project plans, while understanding the cost implications
of software quality
3. To prepare students to apply various tools and methods, including templates, checklists,
configuration management, and case tools/IDEs, to support SQA processes.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Introduction:
SQA: Definitions and Concepts, McCall’s Classic Model, ISO/IEC 25010
Model and other alternative models, Software compliance with quality
1 factors, software quality challenges, Organization for assuring software 9
quality, Components of SQA System.
Pre-Project Software Quality Components:
Contract Review, Development and Quality Plans
 SQA Process Implementation Plan and Activities:
2 Establishing SQA Process, SQA Plan and Project Plan, Cost of Software 9
Quality, The SQA Model, SQA records and documentation control

Product Assurance Activities for conformance:

Evaluation of Products, Reviews, Software Testing, Product Quality
3 Metrics. 9
Process Assurance Activities:
Improvement Processes, Process Quality Metrics, Change Control Process.

Tools and Methods:

Templates and Checklists, Configuration Management, Case Tools and
IDEs.
4 9
Process Standards:
Quality Assurance Standards, Quality Management Standards and Models,
Project Progress Control, From SDLC to Agile

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
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 foundational concepts of Software Quality Assurance
CO1 (SQA) and apply pre-project quality components to ensure software K2
compliance with quality factors.

Develop and implement a comprehensive Software Quality Assurance

CO2 K3
(SQA) process

Describe product and process assurance activities to ensure software

CO3 K2
conformance.
Use tools and methods to effectively manage and improve software
CO4 K3
quality and familiarize with Agile methodologies.

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

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

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

Software Quality:Concepts and 1st edition,

1 Daniel Galin Wiley
Practice 2018

Reference Books
Name of the Edition and
Sl. No Title of the Book Name of the Author/s
Publisher Year
Software Quality Assurance 2nd edition,
1 Daniel Galin Pearson Education
From theory to implementation 2009
Software Engineering: A 8th edition,
2 Roger S Pressman McGrawHill
Practitioner’s Approach 2014
Software Quality: Theory and 3rd edition,
3 Alan Gillies
Management 2018

Video Links (NPTEL, SWAYAM…)

No. Link ID

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

2 https://onlinecourses.swayam2.ac.in/cec21_cs21/preview
 SEMESTER S7

AUGMENTED AND VIRTUAL REALITY

Course Code PEITT753 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 foundational concepts and technologies behind augmented and virtual reality
systems.
2. To explore the development of AR and VR applications, focusing on interaction techniques
and user experience.
3. To understand the hardware and software components used in AR and VR systems.
4. To examine the practical applications, challenges, and future trends in augmented and virtual
reality.
SYLLABUS

Module Contact
Syllabus Description
No. Hours
Introduction to Augmented and Virtual Reality- Overview of AR and
VR: Definitions, History, and Evolution, Basic Concepts in AR and VR:
Immersion, Presence, Interaction, Components of AR and VR Systems:
1 9
Display Devices, Input Devices, Tracking Systems, AR vs. VR: Differences
and Similarities, Applications of AR and VR: Gaming, Education,
Healthcare, Industry.
AR and VR Application Development - AR Application Development:
SDKs and Tools (ARCore, ARKit) - VR Application Development: Game
2 Engines (Unity, Unreal Engine) - Interaction Techniques: Gesture 9
Recognition, Voice Commands, Haptic Feedback-User Experience (UX)
Design in AR and VR: Design Principles, Best Practices-Case Studies:
 Successful AR and VR Applications.

AR and VR Hardware and Software-AR Hardware: Smart Glasses, Head-

Up Displays, Mobile Devices-VR Hardware: Head-Mounted Displays
(HMDs), Motion Controllers, Treadmills-Software Architectures for AR and
3 9
VR Systems-Rendering Techniques in AR and VR: Real-Time Graphics, 3D
Audio, Physics Engines-Performance Optimization in AR and VR: Latency
Reduction, Frame Rate Optimization.
Advanced Topics and Applications in AR and VR-Challenges in AR and
VR: Technical, Ethical, and Social Issues-AR and VR in Education,
Training, and Simulation-AR and VR in Healthcare: Therapy, Surgery,
4 9
Rehabilitation-Future Trends in AR and VR: Mixed Reality (MR),
Augmented Virtuality (AV), Metaverse-Ethical Considerations: Privacy,
Security, and Impact on Society.

Course Assessment Method

(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

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

5 15 10 10 40

End Semester Examination Marks (ESE):

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

Part A Part B Total

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

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

Bloom’s
Course Outcome Knowledge
Level (KL)
Identify and describe the basic principles of augmented and virtual
CO1 K2
reality, including their systems and applications.

Demonstrate the ability to develop simple AR and VR applications

CO2 K2
with a focus on user interaction and experience

Understand the appropriate hardware and software tools for building

CO3 K2
AR and VR systems.

Discuss potential applications and future trends in AR and VR

CO4 K2
technology.

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 - 3 3 2 - 2 - - - - -
CO3 2 2 3 3 2 - - - - - - -
CO4 2 - - - 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

Augmented Reality: Principles and Dieter Schmalstieg, Addison-Wesley 1st Edition

1
Practice Tobias Hollerer Professional 2016

Learning Virtual Reality:

Developing Immersive Experiences 1st Edition
2 Tony Parisi O'Reilly Media
and Applications for Desktop, 2015
Web, and Mobile
 Reference Books
Name of the Edition and
Sl. No Title of the Book Name of the Author/s
Publisher Year
Augmented Reality and Virtual
Timothy Jung, M. 1st Edition
1 Reality: The Power of AR and Springer
Claudia tom Dieck 2021
VR for Business

Bruno Arnaldi, Pascal

Virtual Reality and Augmented 1st Edition
2 Guitton, Guillaume CRC press
Reality: Myths and Realities 2018
Moreau

Practical Augmented Reality: A

Guide to the Technologies, Addison-Wesley 1st Edition,
3 Steve Aukstakalnis
Applications, and Human Professional 2017
Factors for AR and VR

Video Links (NPTEL, SWAYAM…)

No. Link ID

1 https://onlinecourses.swayam2.ac.in/nou23_ge34/preview

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

3 https://www.youtube.com/watch?v=MGuSTAqlZ9Q
 SEMESTER S7

NETWORK SCIENCE

Course Code PEITT754 CIE Marks 40

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

Credits 3 Exam Hours 2 Hrs. 30 Min.

GAMAT301-Mathematics for
Prerequisites (if any) Information Science, GAMAT401- Course Type Theory
Mathematics for Information Science

Course Objectives:

4. The students will learn the main concepts and characteristics of network science.
5. The students will learn the evolution of random networks based on graph theoretical concepts.
6. To equip the students to analyse the robustness of the network by assessing the structural
vulnerabilities.
7. To equip the students to model disease spreading patterns in communities.
SYLLABUS

Module Contact
Syllabus Description
No. Hours
Introduction to network science - The main premise of network science,
History and relation to graph theory, physics, sociology, and other
disciplines, Examples of networks from different application domains, The
characteristics of Network Science, societal and scientific impact.
1 9
Familiarisation of Network analysis and visualization tools - NetworkX,
Gephi, Cytoscape, Infomap, Igraph, Statnet, Network Workbench, Pajek
network visualization, Jung network analysis, GraphViz, Matlab's Random
Boolean Networks (RBN) toolbox.

Relevant Concepts From Graph Theory - Undirected, directed, signed,

weighted and spatial networks, Paths, connected components,Directed
2 9
Acyclic Graphs, Bipartite graphs, Clustering coefficients.
The Random Network Model - Introduction, Number of Links, Degree
 Distribution in random network, The Evolution of a Random Network,
Small Worlds, Clustering Coefficient in random network, Watts-Strogatz
model.

The Barabasi-Albert model- Growth and Preferential Attachment, The

Barabási-Albert Model.

Network Robustness- Percolation Theory, Inverse Percolation Transition

and Robustness, Robustness of Scale-free Networks, Molloy-Reed
3 Criterion, Critical Threshold, Attack Tolerance, Cascading Failures, 9
Modelling Cascading Failures, Failure Propagation Model, Branching
Model, Building Robustness, Designing Robust Networks.
Communities- Basics of Communities, Hierarchical Clustering,
Agglomerative Procedures: the Ravasz Algorithm, Divisive Procedures: the
Girvan-Newman Algorithm, Hierarchy in Real Networks, Modularity.
Spreading Phenomena- Epidemic Modelling, Susceptible-Infected (SI)
4 Model, Susceptible-Infected-Susceptible (SIS) Model, Susceptible- 9
Infected-Recovered (SIR) Model, Network Epidemics, Susceptible-Infected
(SI) Model on a Network, SIS Model and the Vanishing Epidemic
Threshold, Contact Networks, Digital Viruses, Immunization, Random
Immunization, Vaccination Strategies in Scale-Free 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)

CO1 Discuss the main concepts and characteristics of network science K2

Explain the evolution of random network based on graph theoretical

CO2 K2
concepts.

CO3 Build robust network by assessing the structural vulnerabilities K3

CO4 Model disease spreading pattern in communities. K3

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

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

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

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

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

Cambridge University
1 Network Science A-L. Barabási 2016
Press

2 Networks - An introduction M.E.J. Newman Oxford Univ Press 2010

Reference Books
Name of the Edition and
Sl. No Title of the Book Name of the Author/s
Publisher Year
Complex Networks - Structure, Cambridge
1 R. Cohen and S. Havlin 2010
Robustness and Function University Press
Princeton Univ
2 Social and Economic Networks M.O. Jackson 2008
Press

Dynamical Processes on Barrat, M. Barthelemy Cambridge Univ

3 2008
Complex Networks and A. Vespignani Press

Statistical analysis of network

4 E. Kolaczyk Springer 2009
data

Video Links (NPTEL, SWAYAM…)

No. Link ID

1 https://nptel.ac.in/courses/106105154,

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

3 https://www.youtube.com/watch?v=2pnLsvz1fSw,

4 https://www.youtube.com/watch?v=WABtTfTnVCI

5 https://www.youtube.com/watch?v=Q7M79w1ZAy8

6 https://www.youtube.com/watch?v=DmwFt5QjL1s

7 https://www.youtube.com/watch?v=TYod3lGidPo

8 https://www.youtube.com/watch?v=W8sR_sq_Lec, ,,

9 https://www.youtube.com/watch?v=qEjhXvqADTQ,

10 https://www.youtube.com/watch?v=X3xE9oj5-3o
 SEMESTER S7
CYBER AND NETWORK FORENSICS
Course Code PEITT755 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) PCITT402: Computer Networks Course Type Theory

Course Objectives:

1. To introduce the fundamental concepts of cyber forensics and its importance in investigating
cybercrimes.
2. To explore the techniques and tools used in network forensics for detecting and analysing network
intrusions.
3. To understand the legal aspects, standards, and procedures involved in cyber and network
forensics investigations.
4. To examine advanced topics in cyber and network forensics, including incident response and
digital evidence management.
SYLLABUS

Module Contact
Syllabus Description
No. Hours
Introduction to Cyber Forensics:
Overview of Cyber Forensics: Definition, Importance, and Applications

Types of Cybercrimes: Hacking, Phishing, Identity Theft, Cyberstalking

1 9
Digital Evidence: Collection, Preservation, and Analysis

Cyber Forensics Tools: EnCase, FTK, Autopsy

Case Studies: Real-World Cybercrime Investigations

Network Forensics:
Introduction to Network Forensics: Definition and Importance
2 9
Network Traffic Analysis: Packet Sniffing, Protocol Analysis, Flow
Analysis
 Intrusion Detection and Prevention Systems: Snort, Suricata

Network Forensics Tools: Wireshark, tcpdump, NetFlow

Case Studies: Network Breach Investigations

Legal Framework for Cybercrime Investigations: Laws and Regulations

Digital Forensics Standards and Best Practices: ISO/IEC 27037

Chain of Custody: Importance, Documentation, and Maintenance

3 9
Report Writing and Presentation in Forensics: Documentation, Expert
Testimony

Ethical Issues in Cyber and Network Forensics

Advanced Topics in Cyber and Network Forensics:

Incident Response: Preparation, Detection, Containment, Eradication,
Recovery

Digital Evidence Management: Storage, Archiving, and Retrieval

4 9
Cloud Forensics: Challenges and Solutions

Forensics in Mobile Devices and IoT: Techniques and Tools

Future Trends in Cyber and Network Forensics: AI in Forensics,

Blockchain Forensics

Course Assessment Method

(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

Internal Evaluate
Analyze Level
Attendance Examination Level Total
Assessment
(Written) Assessment

5 15 10 10 40

Evaluate and Analyse Level Assessment [20 Marks]

Students should evaluate and analyze a real-world problem, assess the proposed solutions,
provide a conclusion on which solution is most appropriate for the problem, and implement
the chosen solution.
Criteria for evaluation:
● Problem Definition (K4 - 4 points)
○ Clearly defines the real-world problem.
○ Collects and preserves evidence meticulously, following all legal and
procedural guidelines.

● Problem Analysis (K4 - 4 points)

○ Break-down and presents a well-reasoned solution approach.
○ Provides insightful and accurate analysis of the evidence, drawing well-
supported conclusions..
● Evaluate (K5 - 4 points)
○ Demonstrates exceptional understanding and application of advanced
forensic tools and techniques.
○ Shows a strong commitment to ethical standards, ensuring privacy and legal
compliance throughout the project.

● Implementation (K5 - 4 points)

○ Demonstrates expert handling of incidents with clear, effective, and timely
response strategies.
○ Demonstrates exceptional creativity and problem-solving skills
● Conclusion (K4- 2 points, K5 – 2 points)
○ Summarizes findings and insights. (K4)
○ Reflects critical thinking and informed decision-making. (K5)
Scoring:
● Accomplished (4 points): Exceptional analysis, clear implementation, and depth of
understanding.
● Competent (3 points): Solid performance with minor areas for improvement.
● Developing (2 points): Adequate effort but lacks depth or clarity.
● Minimal (1 point): Incomplete or significantly flawed.
End Semester Examination Marks (ESE):

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

Part A Part B Total

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

Course Outcomes (COs)

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

Bloom’s
Course Outcome Knowledge
Level (KL)
Apply the basic principles of cyber forensics to investigate and analyze
CO1 K3
digital evidence.

Implement network forensics techniques to detect and analyze network

CO2 K3
intrusions.

Utilize legal standards and procedures in conducting cyber and

CO3 K3
network forensics investigations

Analyse and manage digital evidence in advanced cyber forensics

CO4 K4
scenarios.

Synthesize and evaluate comprehensive cyber and network forensics

CO5 K5
strategies for large-scale and complex investigations

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

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

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

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

Digital Forensics and Cyber 11st

Nilakshi Jain, Dhananjay
1 Crime: A Hands-On Approach Wiley Edition,
Kalbande
2017

Reference Books
Name of the Edition and
Sl. No Title of the Book Name of the Author/s
Publisher Year
Computer Forensics:
2nd Edition,
1 Investigating Network EC-Council Cengage Learning
2010
Intrusions and Cybercrime

Network Forensics: Tracking Sherri Davidoff, 1st Edition,

2 Prentice Hall
Hackers through Cyberspace Jonathan Ham 2012

Legal Principles of Digital Kim-Kwang Raymond 1st Edition,

3 Springer
Forensics Choo 2019

Incident Response & Computer Kevin Mandia, Chris McGraw-Hill 3rd Edition,
4
Forensics Prosise, Matt Pepe Education 2014
 Video Links (NPTEL, SWAYAM…)

No. Link ID

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

2 https://www.youtube.com/watch?v=8wF5WysAUzU

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

4 https://www.youtube.com/watch?v=93-hn8QIgr8
 SEMESTER S7

MACHINE LEARNING

Course Code OEITT721 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 students the overview of machine learning, including various types of learning,
data preprocessing techniques, and key algorithms.
2. To enable students to acquire the knowledge of model selection, regularization techniques and
neural network architectures.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Introduction to Machine Learning: Overview of Machine Learning-
Definition, Types of Machine Learning- Supervised Learning,
1 Unsupervised Learning and Reinforcement Learning, Data Preprocessing- 9
Cleaning, Normalization and Splitting Data-Training St, Test Set and
Validation Set, Feature Engineering- Feature Selection and Extraction.

Supervised Learning Algorithms: Linear Models- Linear Regression and

Logistic Regression, Decision Trees- Basics, Splitting Criteria and
2 11
Overfitting, Ensemble Methods- Random Forests and Gradient Boosting
Machines, Support Vector Machines (SVMs)- SVM Concepts and Kernels.
 Model Selection and Neural Networks: Model Evaluation Metrics-
Accuracy, Precision, Recall, F1 Score, Receiver Operating Characteristic
Curve (ROC Curve), Area Under ROC Curve (AUC Curve), Model
3 9
Selection- Cross-Validation and Bias-Variance Trade-off, Regularization
Techniques- L1 and L2 Regularization, Introduction to Neural Networks-
Perceptron, Multi-Layer Perceptron and Perceptron Training Algorithm.
Unsupervised Learning Algorithms: Clustering- K-Means,
Hierarchical Clustering and Density-based Spatial Clustering of
4 Applications with Noise (DBSCAN), Dimensionality Reduction- 7
Principal Component Analysis (PCA), Reinforcement Learning
(RL)- RL Concepts and Q-Learning.

Course Assessment Method

(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

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

5 15 10 10 40

End Semester Examination Marks (ESE):

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

Part A Part B Total

● 2 Questions from each ● Each question carries 9 marks.
module. ● Two questions will be given from each module, out
● Total of 8 Questions, each of which 1 question should be answered.
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)

Explain machine learning concepts and gain insights into data K2

CO1
preprocessing techniques and feature engineering.

Demonstrate proficiency in implementing supervised learning K3

CO2
algorithms and understand the key concepts in SVMs.

Gain insights into model selection and architecture of neural

K3
CO3 networks as well as apply cross-validation techniques to address
bias-variance trade-offs and implement regularization methods.
Explore and apply unsupervised learning techniques and K3
CO4 reinforcement learning.

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

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

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 2 2 2 - - 2 - - - - 2
CO2 3 3 2 2 - - 2 - - - - 2
CO3 3 3 3 2 - - 2 - - - - 2
CO4 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

Pattern Recognition and

1 Bishop, C. M. Springer, New York 2006
Machine Learning

Introduction to Machine
2 E. Alpaydin PHI 2005
Learning

3 Machine Learning Tom Mitchell McGraw Hill 1997

Machine Learning: A
4 Kevin P. Murphy MIT Press 2012
Probabilistic Perspective

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

The Elements of Statistical Hastie, T., Tibshirani, R.

1 Springer 2001
Learning and Friedman, J.

Introduction to Machine Cambridge

2 Alex Smola and SVN 2008
Learning University Press

Video Links (NPTEL, SWAYAM…)

No. Link ID

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

2 https://onlinecourses.nptel.ac.in/noc24_ma87/preview
 SEMESTER S7

DATA SCIENCE FOR ENGINEERS

Course Code OEITT722 CIE Marks 40

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

Credits 3 Exam Hours 2 Hrs. 30 Min.

Prerequisites (if any) None Course Type Theory

Course Objectives:

1. Develop proficiency in R programming by mastering foundational concepts such as

variables, data types, and data manipulation techniques, including data frames, recasting, and
joining. Students will also gain experience in implementing functions, control structures, and
performing arithmetic, logical, and matrix operations in R, enabling them to handle complex
data analysis tasks.
2. Apply key data science techniques across linear algebra, statistics, supervised, and
unsupervised learning. This includes solving linear equations, understanding statistical
modeling, executing linear and logistic regression, and performing clustering methods like k-
means and hierarchical clustering, all with practical implementation in R.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
R for Data Science - Introduction to R, Variables, and Datatypes in R, Data
Frames, Recasting and Joining of Dataframes, Arithmetic, Logical and
1 9
Matrix operations in R, Functions, Control structures, Data visualization in
R.

Linear Algebra for Data Science - Solving Linear Equations, Distance,

Hyperplanes and Halfspaces, Eigenvalues, Eigenvectors.
2 9
Statistics for Data Science- Statistical Modelling, Random Variables and
Probability Mass/Density Functions, Sample Statistics, Hypotheses Testing,
 Foundations of Data Science - Introduction to data science, Properties of
data, Classification of Data Science, Data Science Process.
Supervised Learning - Regression - Simple Linear Regression, Multiple
3 Linear Regression, Model Assessment, Implementation of Linear Regression 11
Models in R, Cross Validation, Classification - Logistic Regression,
Performance Measures, Logistic Regression Implementation in R, k -
Nearest Neighbors (kNN), k - Nearest Neighbors Implementation in R.
Unsupervised Learning – Clustering - k- means Clustering, k-means
4 implementation in R, Hierarchical Clustering – Agglomerative Clustering 7
Algorithm, Implementation in R.

Course Assessment Method

(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

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

5 15 10 10 40

End Semester Examination Marks (ESE):

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

Part A Part B Total

● 2 Questions from each 4. Each question carries 9 marks.
module. 5. 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 6. 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)
Utilize R for data science, including variable management, data frames
CO1 manipulation, recasting, and joining operations, as well as performing K2
arithmetic, logical, and matrix operations using R.

Discuss linear algebra concepts crucial to data science, such as solving

CO2 linear equations, understanding distances, hyperplanes, halfspaces, and K2
calculating eigenvalues and eigenvectors.

Explain statistical modeling, random variables, probability

CO3 distributions, and hypotheses testing, and will be able to apply these K2
concepts to real-world data science problems.

Implement various supervised learning models, such as linear

regression and logistic regression, and unsupervised learning
CO4 techniques, such as k-means and hierarchical clustering, using R, and K3
will be able to assess model performance and validate results
effectively

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

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

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

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

 Text Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Raghunathan 1st
1 Data Science for Engineers Rengaswamy, Resmi CRC Press Edition,
Suresh 2022
6th
Applied Statistics and Douglas C. Montgomery
2 Wiley Edition,
Probability for Engineers and George C. Runger
2016
Data science: Concepts and Morgan Kaufmann
3 Kotu, V., & Deshpande, B 2019
practice

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

Data Science and Big Data David Dietrich,

Analytics: Discovering, Barry Heller and EMC Education 1st Edition,

1
Analyzing, Visualizing and Beibei Yang Services 2015
Presenting Data

An Introduction to Statistical
James, G., Witten, D., Springer
2 Learning: with Applications in 2017
Hastie, T., Tibshirani, R.
R.
R for Data Science: Import,
Hadley Wickham,
3 Tidy, Transform, Visualize, and O’Reilly 2017
Garrett Grolemund
Model Data

Video Links (NPTEL, SWAYAM…)

No. Link ID

1 https://nptel.ac.in/courses/106106179
 SEMESTER S7
INTERNET OF THINGS

Course Code OEITT723 CIE Marks 40

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

Course Objectives:

1. To introduce the fundamental concepts, architecture, and protocols of the Internet of Things
(IoT).
2. To explore the hardware and software platforms used in IoT systems.

3. To understand the role of data analytics and cloud integration in IoT.

4. To examine the applications, security challenges, and future trends in IoT.

SYLLABUS

Contact
Module
Syllabus Description Hours
No.
(36 Hrs)

Introduction to IoT:
Internet, Intranet and Extranet. Comparison,
Internet of Things Vision, IoT Strategic Research and Innovation Directions,
IoT Applications, Infrastructure, Networks and Communication, Processes,
1 Data Management, Security, Privacy & Trust, Device Level Energy Issues. 8

IoT reference model, IoT Architecture and core IoT function, Layers,
Components, and Protocols.

IoT Protocols:

Physical Data Link Layer: IEEE 802.15.4, LoRa, NFC, Zigbee,

2 Bluetooth/Bluetooth Low Energy (BLE), 6LoWPAN 8

Network Layer: IPv4/IPv6, RPL, CoAP

 Transport Layer: TCP, UDP, DTLS

Session & Application Layer: CoAP, MQTT, HTTP/HTTPS, XMPP,AMQP,

DDS
IoT Hardware and Software Platforms :

IoT Hardware Platforms:Sensors -LED, Switch,LDR, Temperature

Sensor,Fiber Optic.

Actuators and Smart Objectives. Raspberry Pi Development Kit, Arduino

IDE and board types, ESP8266

IoT Software Platforms: Node-RED, ThingSpeak, Blynk, IoTivity

3 IoT Operating Systems: Contiki, RIOT, TinyOS 11

Cloud Platforms for IoT: AWS IoT, Google Cloud IoT, Microsoft Azure.

Introduction to Data Analytics in IoT: Importance, Techniques, and Tools

Data Storage and Management in IoT: Edge Computing, Fog Computing

Data Visualization and Reporting in IoT

Building IoT Applications: Data Collection, Processing, and Actuation,

Security.

IoT Security Challenges: Threats, Vulnerabilities, and Solutions.

IoT Privacy and Data Protection: Best Practices and Standards

4 Future Trends in IoT: AI Integration, 5G, IoT for Sustainability 9

Case Studies: Smart Homes, Smart Parking , Transportation, Wearables.
Industrial IoT-Smart Agriculture, Smart Cities, Healthcare IoT, Smart and
connected Cities- Street layer, City Layer, Data Center Layer.

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

Apply the basic principles of IoT to understand its architecture,

CO1 K3
components, and protocols.
Develop IoT applications using appropriate hardware and software
CO2 K3
platforms.
Integrate data analytics and cloud services in IoT systems for enhanced
CO3 K3
functionality.
CO4 Analyse the security challenges and future trends in IoT 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 2 2 2 - - 2 - - 2 1

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

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

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

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

 Text Books

Name of the Edition

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

Internet of Things: A Hands-On Arshdeep Bahga, Vijay 1st Edition,

1 Approach Universities Press
Madisetti 2015

Reference Books

Name of the Edition and

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

The Internet of Things: Key Olivier Hersent, David 2nd Edition,

1 Boswarthick, Omar Wiley
Applications and Protocols 2012
Elloumi
Building the Internet of Things:
Implement New Business 1st Edition,
2 Maciej Kranz Wiley
Models, Disrupt Competitors, 2016
and Transform Your Industry

Cloud Computing and the 1st Edition,

Internet of Things: Amita Kapoor, Arshdeep 2020
3 Springer
Technologies, Applications and Bahga, Vijay Madisetti
Security

Security and Privacy in Internet

of Things (IoTs): Models, Fei Hu 1st Edition,
4 CRC Press
Algorithms, and 2016
Implementations

5 3rd Edition
Arduino Cookbook Michael Margolis O'Reilly Media
2020

6 Getting Started With Matt Richardson, 3rd Edition

O'Reilly Media
Raspberry Pi Shawn Wallace 2013

Video Links (NPTEL, SWAYAM…)

No. Link ID
1 https://onlinecourses.nptel.ac.in/noc24_cs115/
2 https://onlinecourses.swayam2.ac.in/ntr24_ed44/
3 https://onlinecourses.nptel.ac.in/noc24_cs115
 SEMESTER 8
INFORMATION TECHNOLOGY
 SEMESTER S8

BIOINFORMATICS

Course Code PEITT861 CIE Marks 40

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

Prerequisites (if any) None Course Type Theory

Course Objectives:

1. Students should be able to grasp the foundational principles of molecular biology to

effectively navigate and utilize them in research and analysis.
2. To equip students with a range of computational tools and algorithms to perform pairwise and
multiple sequence alignments, and construct phylogenetic trees, enabling the identification of
evolutionary relationships and genetic variations.
3. Students will be able to utilize statistical and computational algorithms to predict the
secondary structures of proteins and RNA, aiding in the understanding of their functions and
interactions in biological systems.
SYLLABUS

Module Contact
Syllabus Description
No. Hours
Introduction to Bioinformatics – scope, elementary tasks in bioinformatics,
Molecular biology basics - human genome organization, central dogma,
DNA and RNA structure, Genetic codes, Datatypes - Gene expression data,
1 9
Micro Arrays, NGS, Pathways, molecular interactions, Biological Databases
- Types of databases, Sequence databases – GenBank, DDBJ, EMBL,
Entrez, Unigene, Protein sequence databases – SwissProt, UniProt, PDB
Sequence Alignment – local and global alignment, similarity vs homology,
dot matrices and hash coding, FASTA files, Algorithms for pairwise
sequence alignment – Needleman and Wunsch, Scoring Matrices – basic
2 9
concepts, BLAST and its variants, Multiple Sequence Alignment – Goals,
scoring, substitution matrices, PAM and BLOSUM, gap penalties,
CLUSTAL and its variants
 Phylogenetic trees, Topologies, Distance matrix based and Character based
tree construction, Algorithms for Phylogenetic tree construction – UPGMA,
Neighbor-Joining, Maximum Parsimony, Pattern representations –
3 9
deterministic and probabilistic patterns, algorithms for pattern discovery –
HMM, gene discovery using GeneMark

Introduction to Protein structures – primary, secondary and tertiary,

measures of prediction accuracy, statistical algorithms for protein secondary
4 structure prediction – Chou-Fasman, Protein Folding – Lattice models, 9
algorithms for predicting RNA secondary structure – Nussinov algorithm

Course Assessment Method

(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

Internal Internal Examination-

Assignment/
Attendance Examination-1 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 of
 Total of 8 Questions, each which 1 question should be answered.
60
carrying 3 marks  Each question can have a maximum of 3 sub
divisions.
(8x3 =24marks) (4x9 = 36 marks)
 Course Outcomes (COs)

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

Bloom’s
Course Outcome Knowledge
Level (KL)
Explain basic concepts in molecular biology and familiarize various
CO1 biological datatypes and databases K2

Discuss various algorithms and tools for performing pairwise and

CO2 K2
multiple sequence alignment

Apply various algorithms for the construction of phylogenetic trees and

CO3 familiarize basic algorithms for gene discovery K3

Apply various statistical algorithms for predicting protein and RNA

CO4 secondary structure K3

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

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

CO2 3 2 3 3 3 2 3

CO3 3 2 3 3 3 2 3

CO4 3 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
Bioinformatics Databases and
1 N Gautham Narosa Publications 2006
Algorithms

Fundamental Concepts of D. E. Krane ,

Pearson Education 2003
2
Bioinformatics M. L. Raymer

Bioinformatics: Basics, Ruchi Singh, Richa

3 Universities Press 2010
Algorithms and Applications Sharma
 Reference Books
Name of the Edition and
Sl. No Title of the Book Name of the Author/s
Publisher Year
An Introduction to Neil C Jones and Pavel A 2004
1 MIT Press
Bioinformatics Algorithms Pevzner

T. K. Attwood and D. J. Pearson

2 Introduction to Bioinformatics 2003
Parry-Smith

Bioinformatics: Sequence and

3 David W. Mount CBS Publishers 2005
Genome Analaysis

Video Links (NPTEL, SWAYAM…)

Sl. No Link ID

1 https://onlinecourses.nptel.ac.in/noc21_bt06/preview
 SEMESTER S7

SOFTWARE TESTING

Course Code PEITT862 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) PCITT503: Software Engineering Course Type Theory

Course Objectives:

1. To provide students with foundational knowledge of essential software testing techniques,

including unit testing, boundary value testing, equivalence class testing, and decision table-
based testing.

2. To introduce students to life cycle-based and agile testing methodologies to ensure software
quality throughout various stages of development and learn about test management, planning,
and the use of automated testing tools.

3. To equip students with the skills to apply system testing and object-oriented testing
techniques to identify and resolve software defects.

4. To foster Test-Driven Development Practices: Encourage students to adopt test-driven

development to produce reliable and maintainable software solutions.

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Introduction- Software Testing Terminology- STLC-Software Testing
Methodology- Verification and Validation Activities-Verification –

1 Verification of Requirements- Verification of High level Design- 9

Verification of Low level Design - How to verify Code- Validation,
Functional testing, Non Functional Testing, SDLC and STLC relationship.

Testing Techniques: Dynamic Testing: Black Box Testing, Dynamic

2 Testing: White Box Testing, Static Testing, Validation Activities, Regression 9
Testing, Unit Testing, Integration Testing, Sanity Testing, Smoke Testing,
 Performance Testing, Load Testing, Stress Testing, Usability Testing,
Compatibility Testing

Managing The Test Process:Test Management, Software Metrics, Testing

Metrics for Monitoring and Controlling the Testing Process, Efficient Test
3 9
Suite Management, Testing Process Maturity Models, Introduction to Test
Management Tool - Jira

Test Automation: Automation and Testing Tools - Testing For Specialized

4 Environment: Testing Object Oriented Software, Testing Web based 9

Systems, Tracking The Bug: Debugging

Course Assessment Method

(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

Internal Internal Examination-

Assignment/
Attendance Examination-1 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 of
● Total of 8 Questions, each which 1 question should be answered.
60
carrying 3 marks ● Each question can have a maximum of 3 sub divisions.
(4x9 = 36 marks)
(8x3 =24marks)
 Course Outcomes (COs)

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

Bloom’s
Course Outcome Knowledge
Level (KL)
Explain software testing life cycle (STLC) to ensure comprehensive
CO1 K2
software quality.

Apply various software testing techniques to ensure comprehensive

CO2 K3
validation and reliability of software systems.

Perform the software testing process effectively to monitor, control,

CO3 and improve the testing process. K3

Apply test automation strategies to effectively test object-oriented

CO4 software and web-based systems K3

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

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

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

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

CO4 3 3 3 2 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
Software testing : principles Oxford University 2nd edition,
1 Naresh Chauhan
and practices Press 2016

Software Testing: A 4th Edition,

2 Paul C. Jorgensen CRC Press
Craftsman’s Approach 2014

Introduction to Software Paul Ammann and Jeff Cambridge University

3 2008
Testing, Offutt Press.
 Reference Books
Name of the Edition and
Sl. No Title of the Book Name of the Author/s
Publisher Year
Glenford J. Myers, Tom John Wiley & Sons 3rd Edition,
1 The Art of Software Testing
Badgett, Corey Sandler Publication 2012

Software Testing and Quality KshirasagarNaik and 1st edition,

2 Wiley-Spektrum
Assurance: Theory and Practice PriyadarshiTripathy 2008

Video Links (NPTEL, SWAYAM…)

Sl. No Link ID
1 https://www.youtube.com/playlist?list=PLrpK1inhO61VDiW_RBhkizmTYyUE0eoAF
2 https://nptel.ac.in/courses/106105150
3 https://www.youtube.com/watch?v=BlJEP7XG5iY
4 https://youtu.be/b1Qpvqm0UAo?si=M6ALob-iLJ9E0i_r
 SEMESTER S8

ADHOC AND WIRELESS SENSOR NETWORKS

Course Code PEITT863 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) PCITT402: Computer Networks Course Type Theory

Course Objectives:

1. To introduce the fundamental concepts and characteristics of Adhoc networks.

2. To understand the routing protocols and techniques used in Adhoc networks.
3. To explore the architecture and protocols of Wireless Sensor Networks (WSNs).
4. To examine the applications, challenges, and security concerns in Adhoc and Wireless Sensor
Networks
SYLLABUS
Module Contact
Syllabus Description
No. Hours
Introduction to Adhoc Networks: Definition and Characteristics, Types of
Adhoc Networks: MANETs, VANETs, and FANETs, Challenges in Adhoc
1 9
Networks: Scalability, Mobility, Energy Efficiency, Medium Access Control
in Adhoc Networks, Case Studies and Examples.
Introduction to Routing in Adhoc Networks, Proactive, Reactive, and Hybrid
Routing Protocols, AODV, DSR, OLSR, and TORA Protocols, Quality of
2 9
Service (QoS) in Adhoc Networks, Performance Analysis of Routing
Protocols.
Introduction to Wireless Sensor Networks: Architecture and Protocols,
Sensor Node Architecture and Design, Communication Protocols in WSNs:
3 MAC, Routing, and Transport Layer Protocols, Energy Management in 9
WSNs, WSN Applications in Environmental Monitoring, Healthcare, and
Industrial Automation.
Key Applications of Adhoc Networks and WSNs, Challenges in Deployment
and Maintenance, Security Issues in Adhoc Networks and WSNs: Attacks,
4 9
Intrusion Detection, Privacy Concerns and Mitigation Techniques, Future
Trends and Emerging Technologies in Adhoc and WSNs.
 Course Assessment Method
(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

Internal Internal Examination-

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

5 15 10 10 40

End Semester Examination Marks (ESE):

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

Part A Part B Total

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

Course Outcomes (COs)

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

Bloom’s
Course Outcome Knowledge
Level (KL)
Apply the principles of Adhoc networks to design and implement basic
CO1 K3
network configurations.

CO2 Analyze and implement routing protocols specific to Adhoc networks. K3

Design and evaluate Wireless Sensor Networks for various
CO3 K3
applications
Assess the challenges, applications, and security measures in Adhoc
CO4 K3
and Wireless Sensor Networks.
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create
 CO-PO Mapping Table (Mapping of Course Outcomes to Program Outcomes)

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 3 3 3 - - - - - - - 3
CO2 3 3 3 3 - - - - - - - 3
CO3 3 3 3 3 - - - - - - - 3
CO4 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
Ad Hoc and Sensor Networks: Carlos Corderio, Dharma
World Scientific 2nd Edition,
1 P. Agrawal
Theory and Applications 2011

Reference Books
Name of the Edition and
Sl. No Title of the Book Name of the Author/s
Publisher Year
Module I: Mobile Ad Hoc Stefano Basagni, Marco 2nd Edition,
1 Networking: The Cutting Edge Conti, Silvia Giordano, Wiley-IEEE Press 2013
Directions Ivan Stojmenovic.

Module II: Ad Hoc Wireless

C. Siva Ram Murthy, B. 1st Edition,
2 Networks: Architectures and Pearson Education
S. Manoj 2004
Protocols

Module III: Wireless Sensor

Networks: An Information Feng Zhao, Leonidas J. 1st Edition,
3 Morgan Kaufmann
Processing Approach Guibas 2004

Module IV: Security in

Wireless Ad Hoc and Sensor Erdal Cayirci, Chunming 1st Edition,
4 Wiley
Networks Rong 2009

Video Links (NPTEL, SWAYAM…)

Sl. No Link ID
1 https://www.youtube.com/watch?v=Jh46Ivv6gQ0
2 https://www.youtube.com/watch?v=YFPln8wDMEg
3 https://www.youtube.com/watch?v=B3ZNjE_gO6w
4 https://www.youtube.com/watch?v=zQWE7HEBOck
 SEMESTER S8
SEMANTIC WEB
Course Code PEITT864 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.

PBITT504 - Web Application

Prerequisites (if any) Development Course Type Theory

Course Objectives:
1. To introduce the foundational concepts and architecture of the Semantic Web.
2. To explore RDF and SPARQL as the core technologies for representing and querying data on the
Semantic Web.
3. To provide an understanding of Ontology design and the use of OWL for Semantic Web applications.
4. To investigate the practical applications of the Semantic Web and the role of reasoning techniques.

SYLLABUS
Module Contact
Syllabus Description
No. Hours
Introduction to the Semantic Web and RDF: Evolution of the Web and the need
for the Semantic Web, Semantic Modeling, Semantic Web Technologies: RDF,
RDFS, OWL, and SPARQL
1 9
RDF (Resource Description Framework): Syntax , Semantics

URI, Vocabularies, Metadata and the Semantic Web

RDF and SPARQL: Semantic Web Application Architecture, RDF and Interfacing,
RDF Schema, RDFS-Plus, SKOS,FOAF, The Semantic Web, RDF, and Linked Data
2 (and SPARQL) , SPARQL Queries- Copying, Creating, and Converting Data (and 9
Finding Bad Data)

Ontologies and OWL: Introduction to Ontologies: Concepts and Importance,

Ontology Design Principles

3 Basic OWL(Web Ontology Language), Ontologies in OWL, OWL Formal

9
Semantics, Ontologies and Rules, Ontology Engineering

Semantic Web Applications: Applying Machine Reasoning and Learning in Real

World Applications, Case Studies of Semantic Web Applications - Achieving

4 Balance Between Innovation and Security in the Cloud With Artificial Intelligence 9
of Things: Semantic Web Control Models- Traffic: An Intelligent System for
Detecting Traffic Events Based on Ontologies- Multi-Factor Authentication Web
 Security System Based on Facial Recognition, One Time Password, and Hashed
Secure Question- Enhancing Usability and Control in Artificial Intelligence of
Things Environments (AIoT) Through Semantic Web Control Models- Emerging
Trends in Artificial Intelligence of Things With Machine Learning and Semantic
Web Convergence

Course Assessment Method

(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

Internal
Assignment/ Internal Examination- 2
Attendance Examination-1 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 module. ● Each question carries 9 marks.
● Total of 8 Questions, each ● Two questions will be given from each module, out of
carrying 3 marks which 1 question should be answered. 60
● Each question can have a maximum of 3 sub divisions.
(8x3 =24marks) (4x9 = 36 marks)

Course Outcomes (COs)

At the end of the course students should be able to:
Bloom’s
Course Outcome Knowledge
Level (KL)
CO1 Apply the principles of the Semantic Web to describe its layered architecture. K3
Construct and query RDF data using SPARQL in Semantic Web
CO2 environments.
K3

Develop and implement ontologies using OWL for semantic data

CO3 representation.
K3
Utilize reasoning techniques in Semantic Web applications to solve complex
CO4 problems.
K3

Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create
CO-PO Mapping Table (Mapping of Course Outcomes to Program Outcomes)
 PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12

CO1 3 2 2 2 3 - - - - 1 1 2

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

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

CO4 3 3 3 3 3 - - - - 1 1 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
Semantic Web for the Working
Dean Allemang, 2nd Edition,
Ontologist: Effective Modeling in Morgan Kaufmann
1 2011
RDFS and OWL James Hendler

Pascal Hitzler,
Foundations of Semantic Web Chapman and 1st Edition,
2 Markus Krötzsch,
Technologies Hall/CRC 2009
Sebastian Rudolph

Reference Books
Name of the Edition and
Sl. No Title of the Book Name of the Author/s
Publisher Year
2nd Edition,
1 Learning SPARQL Bob DuCharme O'Reilly Media
2013

Mari Carmen Suárez-

Ontology Engineering in a 1st Edition,
2 Figueroa, Asunción Gómez- Springer
Networked World 2012
Pérez, Enrico Motta

Reasoning Web: Logical Gerhard Lakemeyer,

Foundation of Knowledge Graph Bernhard Nebel 1st Edition,
3 Springer
Construction and Query 2015
Answering
Fernando Ortiz-Rodriguez,

Semantic Web Technologies and Amed Leyva-Mederos, Sanju

Applications in Artificial Tiwari, Ania R. Hernandez- IGI Global May, 2024

4
Intelligence of Things Quintana, Jose L. and
Martinez-Rodriguez
 Video Links (NPTEL, SWAYAM…)

Sl. No Link ID
1 https://www.youtube.com/watch?v=sLnbDyG2z3Q

2 https://youtu.be/8LBS5S3-4bI

3 https://youtu.be/HEQDRWMK06I

4 https://www.youtube.com/watch?v=3JZ7l_OeQyE
 SEMESTER S8

ROBOTICS AND AUTOMATION

Course Code PEITT865 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.
PCITT501: Machine Learning,
Prerequisites (if any) PCITT602: Advanced Artificial Course Type Theory
Intelligence

Course Objectives:

1. To introduce students to the fundamental concepts and history of robotics, and familiarize
them with basic robotic systems and programming.
2. To provide an in-depth understanding of the kinematics and dynamics of robotic systems, and
to develop skills in trajectory planning and control.
3. To introduce automation concepts and industrial robots, focusing on their application in
modern manufacturing and production systems.
4. To explore advanced topics in robotics and automation, including machine learning, human-
robot interaction, and future trends.
5. To develop students' abilities to critically analyze, evaluate, and design complex robotics and
automation systems by applying advanced concepts, tools, and frameworks.

SYLLABUS
Module Contact
Syllabus Description
No. Hours
History and Overview of Robotics: Evolution of robotics, types of robots,
and applications.

Fundamental Concepts in Robotics: Kinematics, dynamics, control

systems, sensors, and actuators.
1 9
Robot Classification: Based on geometry, degrees of freedom, and
application areas.
Basic Programming for Robots: Introduction to robot programming
languages and simulators (e.g., Python, ROS basics).
 History and Overview of Robotics: Evolution of robotics, types of robots,
and applications.
Fundamental Concepts in Robotics: Kinematics, dynamics, control
systems, sensors, and actuators.
2 9
Robot Classification: Based on geometry, degrees of freedom, and
application areas.
Basic Programming for Robots: Introduction to robot programming
languages and simulators (e.g., Python, ROS basics).

Introduction to Automation: Concepts of automation, types of automation

(fixed, programmable, flexible).
Industrial Robots: Types of industrial robots, applications in
manufacturing, assembly, and inspection.
3 9
PLC and SCADA Systems: Basics of Programmable Logic Controllers
(PLCs), Supervisory Control and Data Acquisition (SCADA) systems.
Sensors and Actuators in Automation: Types of sensors (proximity,
vision, force), actuators (electric, hydraulic, pneumatic).

Machine Learning in Robotics: Introduction to machine learning

algorithms and their applications in robotics (e.g., vision, decision-making).

Human-Robot Interaction (HRI): Fundamentals of HRI, collaborative

robots (cobots), safety in HRI.
4 9
Robot Operating System (ROS): Advanced ROS concepts, ROS packages
for manipulation and navigation.
Future Trends in Robotics and Automation: Autonomous systems,
robotics in healthcare, AI-driven automation.

Course Assessment Method

(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

Internal Examination Evaluate Level Analyze Level

Attendance Total
(Written) Assessment Assessment

5 15 10 10 40
Evaluate and Analyze Level Assessment [20 Marks]

Students should evaluate and analyze a real-world optimization problem, assess the proposed
solutions, provide a conclusion on which solution is most appropriate for the problem.

Criteria for evaluation:

1. Case Study Analysis (K4 - 4 points)
Assignment:
● Provide students with a case study of a real-world robotics or automation
system. This could involve a specific robot used in manufacturing, a
robotic surgery system, or an automated warehouse system.
● Task: Ask students to analyze the system by breaking it down into its
components (e.g., sensors, actuators, control systems, software). They
should evaluate how each component contributes to the overall
functionality and how these components interact with each other.
● Expected Output: A detailed report where students identify key elements,
explain their roles, and analyze the strengths and weaknesses of the
system's design.
2. Comparative Evaluation of Robotics Frameworks (K4 – 4 Points)
Project:

● Have students work on a project where they compare two different

robotics frameworks or automation tools (e.g., ROS vs. a proprietary
robotics framework, or different PLC brands in automation).
● Task: They should evaluate the frameworks/tools based on criteria such as
ease of use, scalability, cost, community support, and performance in
specific tasks.
● Expected Output: A comparative study report or presentation that not
only compares the tools but also provides a well-reasoned conclusion
about which tool is better suited for particular applications, supported by
evidence and critical evaluation.

3. Design and Critique (K5 - Evaluating)

Design Task:

● Ask students to design a simple robotic system or automation process for a

given problem, such as automating a repetitive task in a manufacturing
line or designing a robot for a specific healthcare application.
 ● Task: Once the design is completed, have them critique their own design
by identifying potential weaknesses, risks, and areas for improvement. This
self-evaluation should consider factors like efficiency, safety, and cost-
effectiveness.
● Expected Output: A design document with a critical evaluation section
where students justify their design choices and propose enhancements
based on their evaluation.

4. Simulation-Based Problem Solving (K5 - 4 points)

Lab Task:

● Use a robotics simulation software (e.g., Gazebo with ROS) where

students are given a scenario with specific goals (e.g., navigate an
environment, complete a task).
● Task: Students must analyze the problem, develop a solution within the
simulation environment, and then evaluate the effectiveness of their
solution, including how they could optimize the process or improve
performance.
● Expected Output: A simulation report or demonstration video,
accompanied by an analysis of the performance and a critique of the
solution, with suggestions for improvements.

5. Peer Review (K4- 2 points, K5 – 2 points)

Activity:

● Organize a peer review session where students present their projects to

their peers. Each student group reviews another group's project, analyzing
its strengths and weaknesses.
● Task: Students must provide constructive feedback and evaluate the
feasibility and effectiveness of the approach taken by their peers, based on
criteria such as technical soundness, innovation, and potential for real-
world application.
● Expected Output: Written feedback and evaluation reports from peers
(K4), followed by a discussion where students defend their design
decisions based on the critiques received (K5).
 Scoring:
1. Accomplished (4 points): Exceptional analysis, clear implementation, and depth
of understanding.
2. Competent (3 points): Solid performance with minor areas for improvement.
3. Developing (2 points): Adequate effort but lacks depth or clarity.

4. Minimal (1 point): Incomplete or significantly flawed.

End Semester Examination Marks (ESE):

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

Part A Part B Total

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

Course Outcomes (COs)

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

Bloom’s
Course Outcome Knowledge
Level (KL)
Apply basic principles of robotics to program and simulate simple
CO1 K3
robotic tasks.
Apply kinematic and dynamic models to design and control robotic
CO2 K3
manipulators.
Implement automation systems using industrial robots, PLCs, and
CO3 K3
SCADA systems.
Apply advanced techniques in robotics and automation to develop
CO4 K3
innovative solutions in emerging areas.
Critically evaluate and optimize robotics and automation systems by
CO5 K5
analyzing their design, performance, and impact.
Note: K1- Remember, K2- Understand, K3- Apply, K4- Analyse, K5- Evaluate, K6- Create
 CO-PO Mapping Table (Mapping of Course Outcomes to Program Outcomes)

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

Text Books
Name of the Edition and
Sl. No Title of the Book Name of the Author/s
Publisher Year
Introduction to Robotics: 4th Edition,
1 John J. Craig Pearson
Mechanics and Control 2017

Reference Books
Name of the Edition and
Sl. No Title of the Book Name of the Author/s
Publisher Year
Bruno Siciliano, Lorenzo
Robotics: Modelling, Planning 2nd Edition,
1 Sciavicco, Luigi Villani, Springer
and Control 2010
Giuseppe Oriolo
Mark W. Spong, Seth
1st Edition,
2 Robot Modeling and Control Hutchinson, M. Wiley
2005
Vidyasagar
Automation, Production
Dafydd Stuttard, Marcus 2nd Edition,
3 Systems, and Computer- Wiley
Pinto 2011
Integrated Manufacturing
Sebastian Thrun,
1st Edition,
4 Probabilistic Robotics Wolfram Burgard, Dieter MIT Press
2005
Fox

Video Links (NPTEL, SWAYAM…)

Sl. No Link ID
https://www.youtube.com/watch?v=rYWJdZ5qg6M&list=PLbRMhDVUMngcdUbBySzyzcPiFTY
1
Wr4rV_
https://www.youtube.com/watch?v=gXX-
2
4rrB4tw&list=PLQ3sZ7NCnFlEej8AWH_BfO9W7xlirvK6l
3 https://www.youtube.com/watch?v=uOtdWHMKhnw

4 https://www.youtube.com/watch?v=LyC9RAYE96M
 SEMESTER S8

COMPUTER VISION

Course Code OEITT831 CIE Marks 40

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

Course Objectives:

1. To equip students of image processing techniques for computer vision

2. Enable students to analyze various geometric techniques in computer vision
3. To enable students to summarize various feature detectors and descriptors and feature-
matching algorithms
4. To equip students to describe motion analysis and object recognition techniques
5. To enable students to explore the applications of computer vision

SYLLABUS

Module Contact
Syllabus Description
No. Hours
Introduction and Goals of Computer Vision
Review of image processing techniques: Image filtering, Image

1 enhancement, Image segmentation, thresholding, Image Transforms, Color 9

Image Processing, Mathematical morphology and use in texture
analysis,Binary shape analysis and connectedness
Measuring Light and Radiometry: Reflectance and BRDF(basics only),
Monocular and binocular imaging system, Geometric
Transformation,Orthographic & Perspective Projection, Camera model-
2 9
Basic Pinhole Camera model
Stereo vision: introduction; concept of disparity and its relationship with
depth
Feature Detection and Description: Harris Corner Detection, Canny Edge
Detection, Blob Detection, Line and curve detection, Hough transform
3 9
Feature Descriptors: Histogram of Oriented Gradients, Scale Invariant
Feature Transform(SIFT),Mosaics and Snakes, Feature Matching algorithms:
 Brute Force Matcher, Need for feature detection and description and
limitations
Shape from X - Shape from shading, Photometric stereo. Occluding contour
detection.
Motion Analysis-Regularization theory, Optical Flow: brightness constancy
equation, Lucas- Kanade method, Principles of Structure from
4 9
motion(Introduction).
Object recognition: Hough transforms and other simple object recognition
methods
Application: Face detection, Face recognition and Eigen faces

Course Assessment Method

(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

Internal Internal Examination-

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

5 15 10 10 40

End Semester Examination Marks (ESE):

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

Part A Part B Total

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

Course Outcomes (COs)

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

Bloom’s
Course Outcome Knowledge
Level (KL)
Implement fundamental image processing techniques required for
CO1 K3
computer vision

CO2 Describe various geometric techniques in computer vision K2

Illustrate various feature descriptors and image matching algorithms

CO3 K3
used in computer vision

Explain various applications of computer vision that use motion

CO4 K2
tracking, object detection and recognition techniques

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

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

Text Books
Name of the Edition
Sl. No Title of the Book Name of the Author/s
Publisher and Year
Computer vision: A modern Second
1 Forsyth and Ponce Prentice Hall of India
approach Edition,2015

Computer Vision: Algorithms Second

2 Richard Szeleski Springer
& Applications Edition,2022

3 Robot Vision B K P Horn McGraw-Hill 1986

Reference Books
Sl. No Title of the Book Name of the Author/s Name of the Edition and
 Publisher Year
Multiple View Geometry in Richard Hartley and Cambridge Second
1
Computer Vision Andrew Zisserman University Press Edition,2004

Fourth
2 Computer & Machine Vision E R Davies Academic Press
Edition,2012

Video Links (NPTEL, SWAYAM…)

Sl. No Link ID
Link to an NPTEL course on Computer Vision:
1
https://archive.nptel.ac.in/courses/106/105/106105216/

2 Computer Vision Models: https://udlbook.github.io/cvbook/

 SEMESTER S8

DEEP LEARNING
Course Code OEITT832 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) OEITT721 Course Type Theory

Course Objectives:

1. To provide students the understanding of deep learning principles and neural network architectures.
2. To enable students to explore generative models and transfer learning, the latest trends in deep learning.
SYLLABUS
Contact
Module
Syllabus Description Hours
No.
(36 Hrs)
Introduction to Deep Learning: Traditional Machine Learning to Deep Learning,
Neural Networks- Feedforward Neural Networks, Activation Functions -Sigmoid,

1 ReLU, Tanh, Softmax, Training Neural Networks- Forward and Backward 9

Propagation Algorithm, Optimization Algorithms (Gradient Descent, Stochastic
Gradient Descent, Adam).

Convolutional Neural Networks (CNNs): CNN Basics- Convolutional Layers,

2 Pooling Layers, CNN Architectures- LeNet, AlexNet, VGG, ResNet, Applications 8

of CNNs.

Recurrent Neural Networks (RNNs) and Transformers: RNN Basics- RNN

Structure, Backpropagation Through Time (BPTT), Vanishing and Exploding

3 Gradients, Advanced RNN Architectures- Long Short-Term Memory (LSTM), 11

Gated Recurrent Units (GRU), Transformers and Attention Mechanisms- Attention
Mechanism Basics, Transformer Architecture (BERT, GPT).

Generative Models and Transfer Learning: Generative Adversarial Networks

4 (GANs)- GAN Basics, Applications of GANs, Autoencoders- Architecture, Transfer 8

Learning and Fine-Tuning- Pre-trained Models, Fine-Tuning Strategies.
 Course Assessment Method
(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

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

5 15 10 10 40

End Semester Examination Marks (ESE):

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

Course Outcomes (COs)

At the end of the course students should be able to:
Bloom’s
Course Outcome Knowledge
Level (KL)
Build basic Neural Network models using appropriate activation functions and K3
CO1 optimization techniques.

K3
CO2 Apply Convolutional Neural Networks and their architectures to various tasks.

K3
CO3 Develop Recurrent Neural Networks and Transformer models.

K2
CO4 Explain the principles of Generative Adversarial Networks and Autoencoders.

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

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

CO1 2 3 2 2 - - - - 2 - - 2
CO2 1 3 2 2 - - - - 2 - - 2

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

CO4 1 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
Ian Goodfellow, Yoshua
1st Edition,
1 Deep Learning Bengio, and Aaron MIT Press
2016
Courville

Reference Books
Name of the Edition and
Sl. No Title of the Book Name of the Author/s
Publisher Year
Neural Networks and Deep
1 Charu C. Aggarwal Springer 1st Edition, 2018
Learning: A Textbook

Deep Learning for Computer Rajalingappaa

2 Packt Publishing 1st Edition, 2018
Vision Shanmugamani

Natural Language Processing with Delip Rao and Brian

3 O'Reilly Media 1st Edition, 2019
PyTorch McMahan

Generative Deep Learning:

4 Teaching Machines to Paint, David Foster O'Reilly Media 1st Edition, 2020
Write, Compose, and Play

Video Links (NPTEL, SWAYAM…)

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

2 https://archive.nptel.ac.in/courses/106/106/106106184/
 SEMESTER S8

WEB DESIGNING

Course Code OEITT833 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. Gain a comprehensive understanding of web development, from structuring and styling web
pages with HTML and CSS to adding interactivity with JavaScript and jQuery, and
understanding server interactions and web hosting.

SYLLABUS
Module Contact
Syllabus Description
No. Hours
Website creation roles, Gearing up for web design, Web Page Addresses-
URL.
HTML: HTML document structure, identifying text elements, adding an
image, Changing the look with a style sheet, marking up Elements: Text,

1 Paragraph, Heading, Horizontal Rule, Lists, Links, href attribute, Linking to 8

pages on the web, Linking within your site, Targeting a new browser
window, Mail links. Images: image formats, img element, adding SVG
elements, Responsive image markup. Table, Forms, Embedded media:
iframe, object, video and audio, canvas.
Concept of CSS, Creating Style Sheet, CSS Properties, CSS Styling
(Background, Text Format, Controlling Fonts), Working with block elements
and objects, Working with Lists and Tables, CSS Id and Class, Box Model
(Introduction, Border properties, Padding Properties, Margin properties),

2 Navigation Bar, CSS Color, Creating page Layout and Site Designs, 10
Positioning: Floating and positioning: normal flow, floating, fancy text wrap
with CSS shapes, positioning basics, relative positioning, Absolute
positioning, fixed positioning; CSS Layout with Flexbox and Grid.
Responsive Web Design: RWD, The responsive recipe, choosing
 breakpoints, designing responsively, Transition, Transforms, and
Animations: CSS transitions, CSS transforms, Keyframe animations
Introduction to JavaScript: JavaScript, Adding JavaScript to a page, the
anatomy of a script, the browser object, Events, putting it all together, Meet
the DOM, Polyfills, JavaScript libraries
jQuery: jQuery, A basic jQuery example, jQuery use, finding elements,
jQuery selection, Getting element content, Updating elements, Changing
3 10
content, Inserting elements, Adding new content, Getting and setting
attributes, Getting and setting CSS properties, Using .each(), events, The
event object, Effects, Animating CSS properties, Using animation,
traversing the DOM, Working with forms, JavaScript libraries, jQuery and
Ajax.
Introduction to XML: syntax, element, attribute, HttpRequest SVG: Drawing
with XML, Features of SVG as XML, SVG tools, SVG production tips,
Responsive SVG.
4 8
Web Servers: Introduction, HTTP Transactions, Multitier Application
Architecture, Client-Side Scripting versus Server-Side Scripting, Accessing
Web Servers. Introduction to Web Publishing or Hosting.

Course Assessment Method

(CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation Marks (CIE):

Internal Internal Examination-

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

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

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

Part A Part B Total

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

Course Outcomes (COs)

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

Bloom’s
Course Outcome Knowledge
Level (KL)
CO1 Summarise HTML tags. K2

CO2 Apply CSS to add presentation style to web pages. K3

CO3 Apply JavaScript to add functionality to web pages. K3

CO4 Understand the basics of XML, SVG, and web servers. 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 - 3 - - - 2 - - 2

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

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

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

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

 Text Books
Name of the Name of the Edition and
Sl. No Title of the Book
Author/s Publisher Year
Jennifer Niederst
1 Learning Web Design O’Reilly Fifth/2018
Robbins

JavaScript and JQuery:

2 Interactive Front–End Web Jon Duckett Wiley First/2014

Development
Laura Lemay
MASTERING HTML, CSS
Rafe Colburn BPB Publications First/2016
3
& Java Script Web Publishing
Jennifer Kyrnin

Paul J. Deitel, Harvey

Internet and World Wide
4 M. Deitel, Abbey Pearson Education Fifth/2012
Web How To Program
Deitel

Reference Books
Name of the Edition and
Sl. No Title of the Book Name of the Author/s
Publisher Year
HTML and CSS: Design and 1st Edition
1 Jon Duckett Wiley
Build Websites 2011
4th Edition
2 CSS: The Definitive Guide Eric A. Meyer O'Reilly Media
2017
CSS Secrets: Better Solutions 1st Edition

3 to Everyday Web Design Lea Verou O'Reilly Media 2015

Problems
Bulma: A Modern CSS 1st Edition
4 Michael L. Smith Packt Publishing
Framework 2019
1st Edition
5 JavaScript: The Good Parts Douglas Crockford O'Reilly Media
2008
Eloquent JavaScript: A Modern 3rd Edition
6 Marijn Haverbeke No Starch Press
Introduction to Programming 2018

Video Links (NPTEL, SWAYAM…)

Sl. No Link ID
1 https://archive.nptel.ac.in/courses/106/106/106106156/