CAMBRIDGE INSTITUTE OF TECHNOLOGY BENGALURU

MTech
in
Computer Science & Engineering
Academic year2024-2025

1
 CONTENTS
Syllabus of MTech in Computer Science and
Engineering
FIRST YEAR SYLLABUS
I Semester
Sl.No Subject Code Subject Name

1 PCS501 Mathematics for Machine Learning

2 PCS502 Advanced Algorithms and Analysis

3 PCS503 Internet of Things

4 PCS504 Advanced Computer Networks

5 PCS505 Fundamentals of Data Sciences

6 PCS506 Advanced Algorithms and Analysis Lab

7 PCS507 Research Methodology and IPR

II SEMESTER
Sl.No Subject Code Subject Name

1 PCS551 Mastering Machine Learning

2 PCS552 Cloud computing

3 PCS57x Professional Elective 1

4 PCS571 Image Processing and Computer Vision

5 PCS572 Natural Language Processing

6 PCS573 Social Networks Analysis

7 PCS58x Professional Elective 2

8 PCS581 Introduction to DevOps

9 PCS582 Cyber Security

11 PCS583 Cloud Security

12 PCS553 Mini Project with Seminar

13 PCS554 Mastering Machine Learning Lab

2
 MATHEMATICS FOR
Course Title MACHINE LEARNING Semester I

Course Code PCS501 CIE 50

Total No. of Contact Hours 40 SEE 50
No. of Contact Hours/week 4 Total 100
Exam.
Credits 4 3 Hours
Duration
Teaching Dept MATHS DEPT
Course objective is to:
 Understand vector spaces, subspaces, and linear transformations for mathematical modeling.
 Learn orthogonalization and QR factorization techniques for numerical computations.
 Apply probability and statistical measures to analyze data and distributions.
 Use multivariate calculus for solving problems involving partial differentiation and optimization.
 Develop skills in matrix algebra to solve linear systems and analyze eigenvalues and
eigenvectors.
Module-1 RBT Level: L1,L2 Hours: 8
Vector Spaces: Vector spaces, subspaces Linearly independent and dependent vectors Basis and
dimension’s ordinate vectors –Illustrative examples. Linear transformations, Representation of
Transformations by matrices.
Textbook:1
Module-2 RBT Level: L2,L3 Hours:8
Orthogonality and least squares: Inner product, orthogonal sets, orthogonal projections,
orthogonal bases.Gram-Schmidt orthogonalization process. QR-factorizations of matrices,
Textbook:1
Module-3 RBT Level:L2,L3 Hours:8
Conditional Probability; Mean, Median, Mode and Standard Deviation; Random Variables;
Distributions; uniform, normal, exponential, Poisson, Binomial.
Textbook:1
Suggested Learning Resources:
Module-4 RBT Level: L2,L3 Hours:8
TextBooks :
Multivariate Calculus: Partial differentiation, Total derivative – differentiation of composite functions.
Jacobian. Maxima and minima for a function of two variables
DavidC.Lay,StevenR.LayandJ.J.McDonald,“LinearAlgebraanditsApplications”,PearsonEduca
Textbook:3& Ref.book:3
1.
Module-5tionLtd, 5th Edition 2015. RBT Level:L1,L2 Hours:8
AlgebraDr.B.S.
of matrices, determinants,
Grewal, systems ofMathematics”,
“Higher Engineering linear equations, Eigen Publishers,
Khanna values and 42nd
Eigenedition,
vectors..2012.
2.
Textbook:2
3. Probability, Statistics and Random Process T. Veerarajan Tata Mc-Graw Hill Co 3 rd Edition
Reference Books:
1. I.N. Sneddon, Fourier Transform .

2. Kreyzig, “AdvancedEngineeringMathematics”.
R.E, Walpole, R.H.Myres, S.L.Myres and Keying Ye, “Probability and Statistics for Engineers
3. and Scientists”, 9th Edition, Pearson, 2012.
Web links and Video Lectures (e-Resources):
 HMC Calculus Tutorial: Geometry of Linear Transformations
3 (math.hmc).
Activity-Based Learning (Suggested Activities in Class)/ Practical Based learning
The students with the help of the course teacher can take up technical –activities which will enhance their skill
Or the students should interact with industry (small, medium and large), understand their problems or fore see
whatcan be undertaken for study in the form of research/testing/projects, and for creative and innovative
methods to solve the identified problem.Thepreparedreportshall beevaluatedforCIEmarks.
 Course outcomes:
Solve problems using concepts of vector spaces and represent linear transformations with
CO1 matrices.

CO2 Apply orthogonalization and QR factorization techniques in numerical computations.

CO3 Analyze and interpret data using probability distributions and statistical measures.

CO4 Utilize multivariate calculus techniques to solve optimization and differentiation problems.

CO5 Solve linear systems and compute eigenvalues and eigenvectors for practical applications.

CO-PO Mapping
CO/ PO PO PO PO PO PO PO PO PO1 PO1 PO1 PSO PSO
PO1
PO 2 3 4 5 6 7 8 9 0 1 2 1 2
CO1 3 3 3 3 3 1 1
CO2 3 3 3 2 2 1 1
CO3 3 3 3 2 2 1 1
CO4 3 3 3 2 2 1 1
CO5 3 3 3 2 2 1 1

High-3, Medium-2, Low-1

Question Paper Pattern:
CIE Assessment Pattern:
The weightage of Continuous Internal Evaluation (CIE) is 50%. The minimum passing mark for the CIE is
40% of the maximum marks (20 marks out of 50).
SEE Assessment Pattern:
The weightage of Semester End Exam (SEE) is 50%. The minimum passing mark for SEE is 35% of the
maximum marks (18 out of 50 marks). A student shall be deemed to have satisfied the academic
requirements and earned the credits allotted to course if the student secures a minimum of 40% (40 marks
out of 100) in the sum total of the CIE (Continuous Internal Evaluation) and SEE (Semester End
Examination) taken together.
Continuous Internal Evaluation:
There are 25 marks for the CIE’s Assignment component and 25 for the Internal Assessment Test
component. Each test shall be conducted for 25 marks. The first test will be administered after 40-50% of
the coverage of the syllabus, and the second test will be administered after 85- 90% of the coverage of the
syllabus. The average of the best of two tests shall be scaled down to 25 marks.
Two assignments must be planned properly by the course teacher in advance. If an assignment is project-
based then only one assignment for the course shall be planned.The teacher should not conduct two
assignments at the end of the semester if two assignments are planned. Each assignment shall be conducted
for 25 marks. (If two assignments are conducted then the sum of the two assignments shall be scaled down
to 25 marks).
4
The final CIE marks of the course out of 50 will be the sum of the scale-down marks of tests and
assignment/s marks.

Course Title ADVANCED ALGORITHMS Semester I

ANALYSIS
Course Code PCS502 CIE 50
Total No. of Contact Hours 50 SEE 50
No. of Contact Hours/week 4 Total 100
Exam.
Credits 4 3 Hours
Duration
Teaching Dept Computer Science and Engineering

Course objective is to:

 Study advanced/novel methods of designing and analyzing algorithms.
 Explore advanced topics in complexity theory and algorithms.
 Engage in analysis and design of complex algorithms for real-world problems in current
application domains. 5
  Interpret sturdy/open problems in algorithmics or complexity theory by analysing known
approaches and their limitations.
Module-1 RBT Level:L1, L2, L3 Hours: 10
Review of Analysis Techniques: Growth of Functions; Asymptotic notations; Standard notations and
common functions; Recurrences and Solution of Recurrence equations- The master method, The
substitution method, The recurrence – tree method; Amortized Analysis: Aggregate, Accounting and
Potential Methods.
Text Book 1: Ch 3, 4, 17
Module-2 RBT Level: L1, L2, L3 Hours: 10
Graph Algorithms: Bellman - Ford Algorithm; Single source shortest paths in a DAG; Johnson’s
Algorithm for sparse graphs;
Flow-Networks: Maxflow-mincut theorem, Ford-Fulkerson Method to compute maximum flow,
Edmond-Karp maximum-flow algorithm; Maximum bipartite matching.
Text Book 1: Ch:24, 25, 26, 30
Module-3 RBT Level: L1, L2, L3 Hours: 10
Number -Theoretic Algorithms: Elementary notions; GCD; Modular Arithmetic; Solving modular
linear equations; The Chinese remainder theorem; Powers of an element; RSA cryptosystem;
Primality testing; Integer factorization.
Text Book 1: Ch:31
Module-4 RBT Level: L1, L2, L3 Hours: 10
String-Matching Algorithms: Naive string Matching; Rabin - Karp algorithm; String matching with
finite automata; Knuth-Morris-Pratt algorithm; Boyer – Moore algorithms.
Text Book 1: Ch 32
Module-5 RBT Level: L1, L2, L3 Hours: 10
Polynomials and the FFT: Representation of polynomials; The DFT and FFT; Efficient
implementation of FFT.,
Probabilistic Analysis and Randomized Algorithms: The hiring problem, Indicator random variables,
Randomized algorithms, Probabilistic analysis and further uses of indicator random variables.
Case Study: Comparison of Algorithm Design Strategies based on CPU, Memory, Disk and Network
usage
Text Book 1: Ch: 5-30

Suggested Learning Resources:

Textbooks:
T. H Cormen, C E Leiserson, R L Rivest and C Stein. Introduction to Algorithms.
1. PHI, 3rd Edition, 2010.

Reference Books:
Ellis Horowitz, SartajSahni, S. Rajasekharan. Fundamentals of Computer Algorithms.
1.
Universities Press. 2nd Edition, 2007.
2. “The Design and Analysis of Computer Algorithms” by Aho, Hopcroft, Ullman.
3. Kenneth A. Berman. Algorithms. Cengage Learning. 2002.
Web links and Video Lectures (e-Resources):
https://pages.cs.wisc.edu/~shuchi/courses/787-F07/about.html 6
 Activity-Based Learning (Suggested Activities in Class)/ Practical Based learning
Case Study: Comparison of Algorithm Design Strategies based on CPU, Memory, Disk and
Network usage.
The students with the help of the course teacher can take up relevant technical –activities like
presentation or demonstration of workflow/ implementation of an algorithm which will enhance their
skills. The prepared report shall be evaluated for CIE marks.

Course outcomes:
CO1 Study advanced/novel methods of designing complexity theory and analyzing algorithms.
Applying graph algorithm in the field of network theory and polynomial representation of a
CO2 mathematical model
Engage in applying number theoretic algorithms in the field of cryptography and
CO3 cybersecurity.

CO4 .Understand and apply suitable string-matching algorithms in real-time applications.

CO5 Explore advanced topics in probabilistic and randomized algorithms.

CO-PO Mapping
PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO
CO/PO PO1
2
CO1 3 2 1 1 3 - - - - - 1 1 3 3

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

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

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

CO5 2 1 1 1 2 - - - - - 1 1 3 1

High-3, Medium-2, Low-1

Question Paper Pattern:

CIE Assessment Pattern:
The weightage of Continuous Internal Evaluation (CIE) is 50%. The minimum passing mark for the CIE is
40% of the maximum marks (20 marks out of 50).
SEE Assessment Pattern:
The weightage of Semester End Exam (SEE) is 50%. The minimum passing mark for SEE is 35% of the
maximum marks (18 out of 50 marks). A student shall be deemed to have satisfied the academic
requirements and earned the credits allotted to course if 7the student secures a minimum of 40% (40 marks
out of 100) in the sum total of the CIE (Continuous Internal Evaluation) and SEE (Semester End
Examination) taken together.
Continuous Internal Evaluation:
There are 25 marks for the CIE’s Assignment component and 25 for the Internal Assessment Test
component. Each test shall be conducted for 25 marks. The first test will be administered after 40-50% of
the coverage of the syllabus, and the second test will be administered after 85- 90% of the coverage of the
syllabus. The average of the best of two tests shall be scaled down to 25 marks.
Two assignments must be planned properly by the course teacher in advance. If an assignment is project-
based then only one assignment for the course shall be planned.The teacher should not conduct two
assignments at the end of the semester if two assignments are planned. Each assignment shall be conducted
for 25 marks. (If two assignments are conducted then the sum of the two assignments shall be scaled down
to 25 marks).
The final CIE marks of the course out of 50 will be the sum of the scale-down marks of tests and
assignment/s marks.

Course objective is to:

 Able to interpret the application areas of IOT ·
 Able to realize the revolution of Internet in Mobile Devices, Cloud & Sensor Networks ·
 Able to interpret building blocks of Internet of Things and characteristics

Module-1 RBT Level: L1, L2, Hours: 8

What is The Internet of Things? Overview and Motivations, Examples of Applications, IPV6 Role,
Areas of Development and Standardization, Scope of the Present Investigation.Internet of Things
Definitions and frameworks-IoT Definitions, IoT Frameworks, Basic Nodal Capabilities. Internet of
Things Application Examples- Overview, Smart Metering/Advanced Metering Infrastructure-
Health/Body Area Networks, City Automation, Automotive Applications, Home Automation, Smart
Cards, Tracking, OverThe-Air-Passive Surveillance/Ring of Steel, Control Application Examples,
Myriad Other Applications.

Module-2 RBT Level: L1, L2,L3 Hours: 8

Fundamental IoT Mechanism and Key Technologies-Identification of IoT Object and Services,
Structural Aspects of the IoT, Key IoT Technologies. Evolving IoT Standards-Overview and
Approaches, IETF IPV6 Routing Protocol for RPL Roll, Constrained Application Protocol,
Representational State Transfer, ETSI M2M,Third Generation Partnership Project Service
Course Titlefor Machine-Type
Requirements Internet of Things CENELEC, Semester
Communications, IETF IPv6 Over LowI power WPAN,
Zigbee IP(ZIP),IPSO
Course Code
Module-3 PCS503 CIE L1, L2,L3
RBT Level: 50 Hours: 8
Total½ No.
Layer of Contact
Connectivity: Wireless SEE
40 Technologies for the IoT-WPAN Technologies50for IoT/M2M,
Hoursand Mobile Network Technologies for IoT/M2M,Layer 3 Connectivity:IPv6 Technologies
Cellular
forNo. of Overview
the IoT: Contactand Motivations. Address Capabilities,IPv6
Total Protocol Overview, IPv6
3 100
Tunnelling,
Hours/week IPsec in IPv6,Header Compression Schemes, Quality of Service in IPv6, Migration
Strategies
Credits to IPv6. 3 Exam. Duration 3 Hours
Module-4 RBT Level: L1, L2, L3,L4,L5 Hours: 8
Teaching Dept Computer Science and Engineering
Case Studies illustrating IoT Design-Introduction, Home Automation, Cities, Environment,
Agriculture, Productivity Applications.
Module-5 8 RBT Level: L1, L2, L3,L4,L5 Hours: 8

Data Analytics for IoT – Introduction, Apache Hadoop, Using HadoopMapReduce for Batch Data
Analysis, Apache
Oozie, Apache Spark, Apache Storm, Using Apache Storm for Real-time Data Analysis, Structural
Health Monitoring Case Study.
 CO-PO Mapping
PO PO3 PO4 PO PO6 PO7 PO PO9 PO10 PO11 PO12 PSO1 PSO2
CO/PO PO1
2
Course outcomes: 5 8
Suggested Learning
Develop 2 for the applications of IOT in real time scenarios
Resources:
schemes 2
CO1
CO1
Textbooks:
CO2
CO2 Manage the Internet resources 3 3

Model the Internet

Building of things
the3 Internet oftoThings
business
2 with IPv6 and MIPv6:The Evolving World of M2M
1.CO3
CO3
Communications, Daniel Minoli, Wiley,2013.
CO4 Interpret data sets received through IoT devices and tools used for analysis
1 Internet
3 of Things: A 2 Hands on Approach, ArshdeepBahga, Vijay Madisetti,
2.CO4
Universities Press, 2015.
Reference Books:
1. The Internet of Things, Michael Miller, Pearson, 2015 First Edition
Designing Connected Products, Claire Rowland,Elizabeth Goodman et.al, O’Reilly,
2.
First Edition, 2015
Web links and Video Lectures (e-Resources):
 https://www.udemy.com/course/computer-networks-for-beginners-from-zero-to-hero/
 https://www.youtube.com/watch?v=f5ksLu5Xjnk&list=PLG9aCp4uE-
s3Mmbn4q5J87OriIN3CuFDS
 https://sites.google.com/site/computernetworksfall2009/course-outline
Activity-Based Learning (Suggested Activities in Class)/ Practical Based learning

The students with the help of the course teacher can take up relevant technical –activities which will
enhance their skill. The prepared report shall be evaluated for CIE marks.

Question Paper Pattern:

CIE Assessment Pattern:
The weightage of Continuous Internal Evaluation (CIE) is 50%. The minimum passing mark for the CIE is
40% of the maximum marks (20 marks out of 50).

SEE Assessment Pattern:

The weightage of Semester End Exam (SEE) is 50%. The minimum passing mark for SEE is 35% of the
maximum marks (18 out of 50 marks). A student shall be deemed to have satisfied the academic
requirements and earned the credits allotted to course if the student secures a minimum of 40% (40 marks
out of 100) in the sum total of the CIE (Continuous Internal Evaluation) and SEE (Semester End
Examination) taken together.

Continuous Internal Evaluation:

There are 25 marks for the CIE’s Assignment component and 25 for the Internal Assessment Test
component
. Each test shall be conducted for 25 marks. The first test will be administered after 40-50% of the coverage
of the syllabus, and the second test will be administered after 85- 90% of the coverage of the syllabus. The
average of the best of two tests shall be scaled down to 25 marks.
Two assignments must be planned properly by the course teacher in advance. If an assignment is project-
based then only one assignment for the course shall be planned.The teacher should not conduct two
assignments at the end of the semester if two assignments are planned. Each assignment shall be conducted
for 25 marks. (If two assignments are conducted then the sum of the two assignments shall be scaled down
to 25 marks).
The final CIE marks of the course out of 50 will be the sum of the scale-down marks of tests and
assignment/s marks.
9
10
 Advances in Computer
Course Title Semester I
Networks
Course Code PCS504 CIE 50
Total No. of Contact Hours 40 SEE 50
No. of Contact Hours/week 3 Total 100
Credits 3 Exam. Duration 3 Hours
Teaching Dept Computer Science and Engineering

Course objective is to:

 Students will be able to explain various network protocols of their respective layers.

Module-1 RBT Level: L1,L2 Hours: 8

Foundation: Building a Network, Requirements, Perspectives, Scalable Connectivity, Cost-Effective
Resource sharing, Support for Common Services, Manageability, Protocol layering, Performance,
Bandwidth and Latency, Delay X Bandwidth Product, Perspectives on Connecting, Classes of Links,
Reliable Transmission, Stop-and-Wait , Sliding Window, Concurrent Logical Channels.

Module-2 RBT Level: L1,L2 Hours: 8

Internetworking I: Switching and Bridging, Datagram’s, Virtual Circuit Switching, Source Routing,
Bridges and LAN Switches, Basic Internetworking (IP), What is an Internetwork?, Service Model,
Global Addresses, Datagram Forwarding in IP, sub netting and classless addressing, Address
Translation (ARP), Host Configuration (DHCP), Error Reporting (ICMP), Virtual Networks and
Tunnels.
Module-3 RBT Level: L2,L3 Hours: 8
Internetworking- II: Network as a Graph, Distance Vector (RIP), Link State (OSPF), Metrics, The
Global Internet, Routing Areas, Routing among Autonomous systems (BGP), IP Version 6 (IPv6),
Mobility and Mobile IP .
Module-4 RBT Level: L3,L4 Hours: 8
End-to-End Protocols: Simple Demultiplexer (UDP), Reliable Byte Stream(TCP), End-to-End Issues,
Segment Format, Connecting Establishment and Termination, Sliding Window Revisited, Triggering
Transmission, Adaptive Retransmission, Record Boundaries, TCP Extensions, Queuing Disciplines,
FIFO, Fair Queuing, TCP Congestion Control, Additive Increase/ Multiplicative Decrease, Slow
Start, Fast Retransmit and Fast Recovery
Module-5 RBT Level: L2,L3,L4 Hours: 8
Congestion Control and Resource Allocation Congestion-Avoidance Mechanisms, DEC bit, Random
Early Detection (RED), Source-Based Congestion Avoidance. The Domain Name System (DNS),
Electronic Mail (SMTP,POP,IMAP,MIME), World Wide Web (HTTP), Network Management
(SNMP)

Suggested Learning Resources:

Textbooks:
Computer Networks: A System Approach, Larry Peterson and Bruce S Davis,
1.
Elsevier, 5th Edition 2014
Internetworking with TCP/IP, Principles, Protocols and Architecture, Douglas E
2.
Comer, PHI, 6th Edition 2014. 11
 Reference Books:
Computer Networks, Protocols, Standards and Interfaces, Uyless Black , PHI, 2 nd
1.
Edition
2. TCP /IP Protocol Suite, Behrouz A Forouzan, Tata McGraw-Hill, 4 th Edition
Web links and Video Lectures (e-Resources):
 https://www.udemy.com/course/computer-networks-for-beginners-from-zero-to-hero/
 https://www.youtube.com/watch?v=f5ksLu5Xjnk&list=PLG9aCp4uE-
s3Mmbn4q5J87OriIN3CuFDS
 https://sites.google.com/site/computernetworksfall2009/course-outline

Activity-Based Learning (Suggested Activities in Class)/ Practical Based learning

1.The students with the help of the course teacher can take up relevant technical –activities which
will enhance their skill. The prepared report shall be evaluated for CIE marks.

Course outcomes:
List and classify network services, protocols and architectures, explain why they are
CO1
layered.
Choose key Internet applications and their protocols and apply to develop their own
CO2
applications (e.g. Client Server applications, Web Services) using the sockets API.
Develop effective communication mechanisms using techniques like connection
CO3
establishment, queuing theory, recovery Etc.

CO-PO Mapping
CO/ PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PS
PO1
PO O2
CO1 3 3 3 3 1 1
CO2 2 2 3 3 1
CO3 3 3 3 1

High-3, Medium-2, Low-1

Question Paper Pattern:
CIE Assessment Pattern:
The weightage of Continuous Internal Evaluation (CIE) is 50%. The minimum passing mark for the CIE is
40% of the maximum marks (20 marks out of 50).
SEE Assessment Pattern:
The weightage of Semester End Exam (SEE) is 50%. The minimum passing mark for SEE is 35% of the
maximum marks (18 out of 50 marks). A student shall be deemed to have satisfied the academic
requirements and earned the credits allotted to course if the student secures a minimum of 40% (40 marks
out of 100) in the sum total of the CIE (Continuous Internal Evaluation) and SEE (Semester End
Examination) taken together.
Continuous Internal Evaluation:
There are 25 marks for the CIE’s Assignment component and 25 for the Internal Assessment Test
component. Each test shall be conducted for 25 marks. The first test will be administered after 40-50% of
the coverage of the syllabus, and the second test will be administered after 85- 90% of the coverage of the
syllabus. The average of the best of two tests shall be scaled down to 25 marks.
Two assignments must be planned properly by the course teacher in advance. If an assignment is project-
based then only one assignment for the course shall be planned.The teacher should not conduct two
assignments at the end of the semester if two assignments12are planned. Each assignment shall be conducted
for 25 marks. (If two assignments are conducted then the sum of the two assignments shall be scaled down
to 25 marks).
The final CIE marks of the course out of 50 will be the sum of the scale-down marks of tests and
assignment/s marks.

13
Course Title Fundamentals of Data Sciences Semester I

Course Code PCS505 CIE 50

Total No. of Contact 50 SEE
50
Hours
No. of Contact Hours/week 5 Total 100
Credits 3 Exam. Duration 3 Hours
Teaching Dept Computer Science and Engineering

 Programing data science concepts and Big Data, modelling using R language.
 Analyze Basic tools of EDA, Data science process with case studies and Different algorithms.
 Optimize & solve real life problems with different spam filter.
 Explore Feature Generation and Feature Selection.
 Find different data visualization tools.
Module-1 RBT Level: L2,L3 Hours:10
Introduction: What is Data Science? Big Data and Data Science hype – and getting past the hype,
Why now? – Datafication, Current landscape of perspectives, A data Science Profile, Skill sets.
Statistical Inference, Populations and samples, Big Data, new kinds of data, modelling, statistical
modeling, how to build a model, probability distributions, fitting a model, Introduction to R –
Features, Applications, Constants, Variables, Basic data types, Basic Objects, Summary Tables in R.

Module-2 RBT Level: L1, L2 Hours:10

Exploratory Data Analysis and the Data Science Process: Basic tools (plots, graphs and summary
statistics) of EDA, Philosophy of EDA, The Data Science Process. Algorithms, Machine Learning
Algorithms, Three Basic Algorithms: Linear Regression, k-Nearest Neighbours (kNN), k-means, R
Programs for the algorithms.
Module-3 RBT Level: L1, L2,L3 Hours:10
Spam Filter, Linear Regression and Spam Filter, K-NN and spam Filter, Naïve Bayes Algorithm,
Spam Filter using Naïve Bayes, Laplace Smoothing, Comparing Naïve Bayes to K-NN, Scraping the
Web, introduction to Logistic Regression, Implementation, R programs for Naïve Bayes and k-NN
classifiers.
Module-4 RBT Level: L1, L2, L3, L4, L5 Hours:10
Feature Generation and Feature Selection (Extracting Meaning from Data): Data Science
Competitions, Crowdsourcing, The Kaggle Model, Ethical Implications of a Robo-Grader, Domain
Expertise versus Machine Learning Algorithms, Feature Selection, Motivating application: user
(customer) retention. Feature Generation or Feature Extraction, Filters, Wrappers, Decision Trees.
Recommendation Systems: Building a User-Facing Data Product, Nearest Neighbor Algorithm
Review, Some Problems with Nearest Neighbor, Beyond Nearest Neighbor: Machine Learning
Classification, Dimensionality Problem, Singular Value Decomposition, Important Properties of
Singular Value Decomposition, Principal Component Analysis.
Module-5 RBT Level: L1, L2, L3, L4, L5 Hours:10

14
A Deep Dive into Matplotlib: Overview of Plots in Matplotlib, Pyplot Basics, Basic Text and Legend
Functions, Basic Plots, Layouts, Images, Writing Mathematical Expressions.
Simplifying Visualizations Using Seaborn: Introduction, Controlling Figure Styles, Color Palettes,
Advanced Plots in Seaborn, Multi-Plots in Seaborn, Regression Plots, Squarify.

15
16
SL NO EXPERIMENTS
1. Load the ‘mtcars’ dataset of R.
 Find the dimensions of the data set, view the names of the variables and get the name of
each row in the first column, which is the name of each car
 Get the dimensions of the dataset in terms of number of rows and number of columns
and summarize the dataset.
 Prepare frequency table for the variables ‘mpg’, ‘wt’, ‘disp’ and ‘hp’.
 Compute and print the mean and the standard deviation for each of the variables. Which
measurement would you consider “best”, if you were to guess the car species based only
on those four values?
 Prepare a variance covariance matrix of the variables ‘mpg’, ‘wt’, ‘disp’ and ‘hp’ and
interpret the values.

2. Load the ‘mtcars’ dataset of R.

 Prepare frequency table for the variable ‘cyl’ and draw a bar diagram. Find the number
of cylinders of the cars that have the highest frequency.
 Create a histogram of the values for the variable ‘mpg’ and check which range has the
least frequency.
 Get the five point summary for the variable ‘mpg’ and create a boxplot to visualize the
distribution of values for a certain variable.
 Create a scatterplot of the pairwise combination of the variables ‘mpg’ and ‘wt’and
interpret their relationship.

3. Load the ‘cars’ dataset of R.

Create a scatterplot of the two variables, ‘speed’ and ‘dist’.
Split the dataset into two separate dataframes – training and test.
Apply the linear regression algorithm to the training dataset and find the equation to the
linear regression line. Interpret the results. Test if your linear model has a good fit.
Predict for the test dataset. Visualize the training set results and test set results.
Create the residual plot and QQ Plot.
4. Load the Iris dataset.
 Split the dataset into two separate dataframes – training and test.
 What is the proportion of Setosa types in the test datadframe?
 Create the the K-Nearest Neighbor model for different values of k (k=1 to 20).
 Plot the accuracy of the model for the different values of k.
5. Load the Iris dataset.
 Split the dataset into two separate dataframes – training and test.
 Implement the naïve Bayesian classifier for the training data set.
 Compute the accuracy of the classifier.
6. Load the Iris dataset.
 Apply k-Means algorithm to cluster the iris dataset.
 Comment on the quality of clustering.
 Plot the clusters formed.
7. Load the Titanic dataset.
 Convert it to a dataframe. Create a logistic regression model.
 Make predictions on the dataset using the 17 fitted model.
 Plot the ROC curve.
 Determine the AUC (area under the curve) value.
 Suggested Learning Resources:
Textbooks:

1. Cathy O Neil, Rachel Schutt, 2014, “Doing Data Science-Straight Talk from the
Frontline”, Orielly
2. Jure Leskovek, Anand Rajaraman, Jeffrey Ullman, 2014 Mining of Massive Data Sets,
Cambridge University Press
Reference Books:
1. Kevin Murphy, 2013, Machine learning: A Probabalistic Perspective,
2. Peter Bruce, Andre Bruce, Practical Statistics for Data Scientists, Orielly Series
Web links and Video Lectures (e-Resources):
1.

Activity-Based Learning (Suggested Activities in Class)/ Practical Based learning

The students with the help of the course teacher can take up activities which will enhance their
activity based learning like Quizzes, Assignments and Seminars.

Course outcomes:
CO1 Explain and program Data Science, Big data and fitting model
CO2 Explore Data Analysis, Data Science Process, R Programs for the algorithms.
CO3 Analyse the Feature Selection algorithms and Recommendation Systems
CO4 Design MapReduce solutions

CO-PO Mapping
CO/PO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
1 2 1
CO1
CO2 2 2 2

CO3 2 3 3 1 2

CO4 1 1 1 1 1 1

High-3, Medium-2, Low-1

CIE Assessment Pattern:

The weightage of Continuous Internal Evaluation (CIE) is 50%. The minimum passing mark for the
CIE is 40% of the maximum marks (20 marks out of 50).
SEE Assessment Pattern:
The weightage of Semester End Exam (SEE) is 50%. The minimum passing mark for SEE is 35% of
the maximum marks (18 out of 50 marks). A student shall be deemed to have satisfied the academic
requirements and earned the credits allotted to course if the student secures a minimum of 40% (40
marks out of 100) in the sum total of the CIE (Continuous Internal Evaluation) and SEE (Semester
End Examination) taken together.
18
Continuous Internal Evaluation:
There are 25 marks for the CIE’s Assignment component and 25 for the Internal Assessment Test
component. Each test shall be conducted for 25 marks. The first test will be administered after 40-50%
of the coverage of the syllabus, and the second test will be administered after 85- 90% of the coverage
of the syllabus. The average of the best of two tests shall be scaled down to 25 marks.
Two assignments must be planned properly by the course teacher in advance. If an assignment is
project-based then only one assignment for the course shall be planned.The teacher should not conduct
two assignments at the end of the semester if two assignments are planned. Each assignment shall be
conducted

Advanced Algorithms Analysis Lab

Course Code PCS506 CIE Marks 50

L:T:P:S 0:0:2:0 SEE Marks 50

Hrs. / Week 2 Total Marks 100

Credits 2 Exam Hours 03

19
Course objectives :
 Study advanced/novel methods of designing and analyzing algorithms.
 Explore advanced topics in complexity theory and algorithms.
 Engage in analysis and design of complex algorithms for real-world problems in current application
domains.
 Interpret sturdy/open problems in algorithmics or complexity theory by analysing known approaches
and their limitations.
To familiarize students with basic paradigms and data structures for solving advanced algorithmic
problems.

Pgm. No. List of Experiments / Programs Hours COs

PART-A

Title: Design, develop, and write a program to perform string

matching.
Hours: 2 Cos: 1
Problem Description: Given two strings, one is a text string,
1. txt and the other is a pattern string, pat. The task is to print the
indexes of all the occurrences of the pattern string in the text
string. Use one-based indexing while returning the indices.
Method: To solve the problem of finding all occurrences of a
pattern string in a text string and printing the indices using one-
based indexing, we can use the Knuth-Morris-Pratt (KMP)
algorithm.
Reference: Module 2, Text Book 1: Ch 32
Title: Design, develop, and write a program to solve the String-
matching using hashing technique.
2. Hours: 2 Cos: 1
Problem Description: Given two strings, a text string T of
length n and a pattern string P of length m. Both strings consist
only of lowercase English letters (‘a’ to ‘z’). Create and make
use of a function that should employ an efficient hashing
technique to perform string matching.
Method: The Rabin-Karp algorithm is a string-matching
algorithm that efficiently finds occurrences of a pattern within a
text using hashing. It computes hash values for the pattern and
substrings of the text and then compares these hashes for
potential matches.
Reference: Module 2, Text Book 1: Ch 32
Title: Design, develop, and write a program to solve String
matching using state-based method.
3. Hours: 2 Cos: 1
Problem Description: Given two strings, a text string T of
length n and a pattern string P of length m. Both strings consist
only of lowercase English letters (‘a’ to ‘z’). Develop a
function that identifies all starting positions where the pattern P
appears as a substring within the text T. The function should
use a state-based method to perform the string matching
efficiently.

Method: Constructing a state-based mechanism (finite

20
 automaton) for the pattern string P and then using this
mechanism to search through the text string T. This mechanism
will have states representing the length of the longest prefix of
the pattern that is also a suffix of the pattern up to the current
character. It will transition based on the current character in the
text string.
Reference: Module 2, Text Book 1: Ch 32
Title: Design, develop, and write a program to implement the
single source shortest path in a Directed Acyclic Graph
1. Hours: 2 Cos: 1
Problem Description: Given a Directed Acyclic Graph (DAG)
with V vertices and E edges, where each edge has a non-negative
weight. Find the shortest path from a given source vertex S to all
other vertices in the graph.
Method: We can calculate single source shortest distances for
DAG by making use of Topological Sorting and edge relaxation
in a Dynamic Programming approach.
Reference: Module 4, Text Book 1: Ch 24
PART-B

Title: Design, develop, and write a program to implement the

5. single source shortest path considering the possibility of Hours: 2 Cos: 2
negative edge weights

Problem Description: Given a directed graph 𝐺 (𝑉, 𝐸)

where 𝑉 represents a set of vertices and 𝐸 represents a set of
edges with weights, which may include negative weights. Find
the shortest path from a given source vertex 𝑠 to all other
vertices in the graph. Also, detect if there is any negative
weight cycle in the graph that is reachable from the source
vertex.

Method: The Bellman-Ford algorithm is a dynamic

programming-based approach used to find the shortest path
from a single source vertex to all other vertices in a weighted
graph, even in the presence of negative weight edges.

Reference: Module 4, Text Book 1: Ch 24

Title: Design, develop, and write a program to determine if a

6. given integer is prime or not, using a probabilistic method with Hours: 2 Cos: 3
multiple iterations and determine its performance.

Problem Description: The Monte Carlo algorithm is used here

to test the primality of a given integer. The probabilistic
primality test will provide a probabilistic indication of whether
an integer is prime or not.

Method: The Monte Carlo algorithm for testing primality

21
 probabilistically determines whether a given number is prime
or composite. It randomly selects witnesses and performs a
series of modular exponentiations to check if the number
satisfies certain conditions.

Reference: Module 3, Text Book 1: Ch:31

Title: Design, develop and write a program to find the

7. maximum flow in a flow network. Hours: 2 Cos: 4
Problem Description: find the maximum flow in a flow
network using the Edmonds- Karp algorithm.

Method: The Ford-Fulkerson method is an algorithm used to

find the maximum flow in a flow network, which is based on
the idea of augmenting paths. The algorithm starts with an
initial flow of zero, and iteratively finds a path from s to t that
has available capacity, and then increases the flow along that
path by the maximum amount possible. This process continues
until no more augmenting paths can be found.

Reference: Module 4, Text Book 1: Ch:26

Title: Design, develop and write a program to implement the

8. Edmonds-Karp algorithm to solve the maximum flow problem Hours: 2 Cos: 4
in a flow network.

Problem Description: find the maximum flow in a flow

network using the Edmonds- Karp algorithm.

Method: The Ford-Fulkerson method is an algorithm used to

find the maximum flow in a flow network, which is based on
the idea of augmenting paths. The algorithm starts with an
initial flow of zero, and iteratively finds a path from s to t that
has available capacity, and then increases the flow along that
path by the maximum amount possible. This process continues
until no more augmenting paths can be found.

Reference: Module 4, Text Book 1: Ch:26

Suggested Learning Resources:

Textbooks/ Reference Books:

T. H Cormen, C E Leiserson, R L Rivest and C Stein. Introduction to Algorithms.

1.
PHI, 3rd Edition, 2010.
2. Ellis Horowitz, SartajSahni, S. Rajasekharan. Fundamentals of Computer Algorithms.
22
 Universities Press. 2nd Edition, 2007.

3. “The Design and Analysis of Computer Algorithms” by Aho, Hopcroft, Ullman.

4. Kenneth A. Berman. Algorithms. Cengage Learning. 2002.

Web links and Video Lectures (e-Resources):

1. https://pages.cs.wisc.edu/~shuchi/courses/787-F07/about.html

Activity-Based Learning (Suggested Activities in Class)/ Practical Based learning

The students with the help of the course teacher can take up relevant technical –activities like
presentations or demonstration of workflow/ implementation of an algorithm which will enhance
their skills. The prepared report shall be evaluated for CIE marks.

Course outcomes:

CO1 Implement string-matching algorithms.

Implement the single source shortest path from a vertex to all other vertices in a weighted
CO2 graph

CO3 Implement algorithms to test the primality of an integer.

CO4 Implement algorithms to compute the maximum flow in a flow network.

CO-PO Mapping

PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PS
CO/PO PO1 O2

CO1 3 2 1 1 3 1 1 3 3

CO2 2 1 1 1 2 1 1 3

CO3 2 1 1 1 2 1 3 1

CO4 2 1 1 1 2 1 3

Assessment Details (both CIE and SEE)

The weightage of Continuous Internal Evaluation (CIE) is 50% and for Semester End Exam (SEE) is
50%. The minimum passing mark for the CIE is 50% of the maximum marks. Minimum passing
marks in SEE is 40% of the maximum marks of SEE. A student shall be deemed to have satisfied the
academic requirements and earned the credits allotted to each subject/ course if the student secures not
less than 50% (50 marks out of 100) in the sum total of the CIE (Continuous Internal Evaluation) and
SEE (Semester End Examination) taken together.
1. CIE-Continuous Internal Evaluation:
One Unit Tests of 20 Marks.
Lab conduction 20 Marks and Record of 10 Marks. The sum of these three will be sumed up to 50
marks

23
CIE methods /question paper is designed to attain the different levels of Bloom’s taxonomy as per the
outcome defined for the course.

2. SEE- Semester End Examination:

The SEE question paper will be set for 100 marks and the marks scored will be for 100 Marks
The question paper will have one Program carrying 100 marks.
Each program is for 100 marks. The writing program will be for 20 Marks and conduction of program
which consists of execution of program 60 and viva -voice for 20 Marks.
The students will have to write the program and execute the selected program given from the list of
programs.

Course Title Research Methodology Semester I

Course Code PCS507 CIE 50
Total No. of Contact Hours 40 SEE 50
No. of Contact Hours/week 3 Total 100
Credits 3 Exam. Duration 3 Hours
Teaching Dept Computer Science and Engineering

24
 Course objective is to:
 To introduce various technologies of conducting research.
 To learn the concept of Literature Review.
 To choose an appropriate research design for the chosen problem.
 Choose appropriate tool for the conduction of research and to Understand the hypotheses
testing and procedure for hypotheses testing.
 To explain the art of interpretation and the art of writing research reports. And to learn Ethics
in Engineering Research.
Module-1 RBT Level: L1, L2 Hours: 10
What is Research: Introduction, Meaning of Research, Objectives of Research, Motivation in
Research, Types of Research, Research Approaches, Significance of Research, Research Methods
versus Methodology, Research and Scientific Method, Importance of Knowing How Research is
Done, Research Process, Criteria of Good Research, and Problems Encountered by Researchers in
India.
Defining the Research Problem: Research Problem, Selecting the Problem, Necessity of Defining the
Problem, Technique Involved in Defining a Problem,
Case study: converting a specific problem into research problem.
Text Book 1: Chapters:1,2
Module-2 RBT Level:L1, L2 Hours: 10
Reviewing the literature: Place of the literature review in research, bringing clarity and focus to your
research problem, improving research methodology, Broadening knowledge base in research area,
enabling contextual findings, how to review the literature, searching the existing literature, reviewing
the selected literature, developing a theoretical framework, developing a conceptual framework,
writing about the literature reviewed. Case study.
Text Book 2: Chapter:3
Module-3 RBT Level:L1, L2, L3 Hours: 10
Research Design: Meaning of Research Design, Need for Research Design, Features of a Good
Design, Important Concepts Relating to Research Design, Different Research Designs, Basic
Principles of Experimental Designs, Important Experimental Designs. Sampling design, Methods of
data collection, Case study.
Text Book 1: Chapter: 3,4 and 6
Module-4 RBT Level:L1, L2, L3 Hours: 10
Suggested
Free Writing Learning Resources:
and mining for ideas, Attributes and reasons of technical writing, Patent or Technical
Paper? writing Strategies, journal paper: structure and approach, Language Skills, writing styles, and
Textbooks:
editing, rules of mathematical writing, publish articles to get cited or perish. Case study.
Students self learning topics are METHODOLOGY
“RESEARCH Hypothesis Testing. METHODS and TECHNIQUES”, C.R.
1.Text Book 3: Chapters: 6
KOTHARI.
Module-5 ” Research Methodology a step-by-step guide for RBTBeginners”,
Level: L1, Ranjith
L2, L3 Kumar,3rd
Hours: 10
2.
Edition.
Presentation skills: oral presentations,
“ENGINEERING poster presentations,
RESEARCH METHODOLOGY presentation preparation
“a practical guidelines,
insight for
3.Bibliometrics and research quality. Ethics in engineering Research: Ethics in Engineering research
researchers, Dipankar Deb, Rajeeb Dey, Valentina E. Balas.
practice, types of research misconduct, ethical issues related to authorship. Case study.
Reference
Text BookBooks:
3: Chapters:5,9,10
DAVID V. THIEL” RESEARCH METHODS FOR ENGINEERS” CAMBRIDGE
1.
UNIVERSITY PRESS.
“Bordens, K. S. and Abbott, B. B., Research Design and Methods” – A Process
2.
Approach, 8th Edition, McGraw-Hill, 2011.
Web links and Video Lectures (e-Resources):
https://doi.org/10.1007/978-981-13-2947-0 25
Activity-Based Learning (Suggested Activities in Class)/ Practical Based learning
The students with the help of the course teacher can take up relevant technical –activities like
Research or presentation or demonstration of workflow/ implementation of an algorithm which will
enhance their skills. The prepared report/research paper shall be evaluated for CIE marks.
 Course outcomes:
CO1 Understand some basic concepts of research and its methodologies.
Know the procedure for literature review define and apply appropriate parameters and
CO2
research problems.
CO3 Develop skills to draft a research paper.
Analyse and comprehend the ethical practices in conducting research and dissemination of
CO4
results in different forms.

CO-PO Mapping
CO/ PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO1 PO1 PO1 PSO PSO
PO1
PO 0 1 2 1 2
CO 1 1 1 1 2
1
CO 2 2 2 2 2
2
CO 3 3 3 3 3 1 2
3
CO 4 4 4 4 4 1
4
CO 5 5 5 5 5 1 2
5
High-3, Medium-2, Low-1

Question Paper Pattern:

CIE Assessment Pattern:
The weightage of Continuous Internal Evaluation (CIE) is 50%. The minimum passing mark for the
CIE is 40% of the maximum marks (20 marks out of 50).
SEE Assessment Pattern:
The weightage of Semester End Exam (SEE) is 50%. The minimum passing mark for SEE is 35% of
the maximum marks (18 out of 50 marks). A student shall be deemed to have satisfied the academic
requirements and earned the credits allotted to course if the student secures a minimum of 40% (40
marks out of 100) in the sum total of the CIE (Continuous Internal Evaluation) and SEE (Semester
End Examination) taken together.

Continuous Internal Evaluation:

There are 25 marks for the CIE’s Assignment component and 25 for the Internal Assessment Test
component. Each test shall be conducted for 25 marks. The first test will be administered after 40-50%
of the coverage of the syllabus, and the second test will be administered after 85- 90% of the coverage
of the syllabus. The average of the best of two tests shall be scaled down to 25 marks.
Two assignments must be planned properly by the course teacher in advance. If an assignment is
project-based then only one assignment for the course shall be planned.The teacher should not conduct
26
 two assignments at the end of the semester if two assignments are planned. Each assignment shall be
conducted for 25 marks. (If two assignments are conducted then the sum of the two assignments shall
be scaled down to 25 marks).
The final CIE marks of the course out of 50 will be the sum of the scale-down marks of tests and
assignment/s marks.

MASTERING MACHINE
Course Title Semester II
LEARNING
Course Code PCS551 CIE 50
Total No. of Contact Hours 40 SEE 50
No. of Contact Hours/week 4 Total 100
Credits 4 Exam. Duration 3 Hours
Teaching Dept Computer Science and Engineering

27
Course
Suggestedobjective is to:Resources:
Learning
 To be able to formulate machine learning problems corresponding to different applications.
Textbooks:
 To understand a range of machine learning algorithms along with their strengths and weaknesses.
 To apply the algorithms
Machine to a real-world
Learning: Theory andproblem,
Practiceoptimize
by M Nthe models
Murty andlearned and report on
Ananthanarayana the
V S,
1.
expected accuracy
ISBN: 9789393
that can330697
be achieved
| Year:
by 2024.
applying the models.
2.
Module-1 Deep Learning Foundations and Concepts Christopher RBTM Bishop
Level: L1,L2,L3 Hours: 8
Reference
Evolution Books:
of Machine Learning, Paradigms for ML: Supervised Learning, Unsupervised
ReinforcementStephen
Learning. Types of “Machine
Marsland, Data. Stages in Machine
Learning: Learning, AutoML
An Algorithmic (Automated
Perspective”, Machine
Chapman &
1.
Learning frameworks): Auto-sklearn toolkit.
Hall/CRC, 2nd Edition, 2014.
Text Book 1: Chapter
2. 1
Kevin Murphy, “Machine Learning: A Probabilistic Perspective”, MIT Press, 2012
Self-Learning: Meta-Learning: Introduction and applications in image classification.
Web links and Video Lectures (e-Resources):
Module-2 RBT Level: L1,L2,L3 Hours: 8
1. https://pages.cs.wisc.edu/~shuchi/courses/787-F07/about.html
Introduction to Clustering: Partitioning of Data, Data Re-organization, Data Compression |
Summarization, Matrix Factorization, Clustering of Patterns, Data Abstraction. Clustering
Activity-Based LearningClustering,
Algorithms: Divisive (SuggestedAgglomerative
Activities in Class)/ Practical
Clustering, Based learning
Partitional Clustering: (K-Means
Clustering, K-Means++ Clustering, Soft Partitioning, Soft Clustering, Hard Clustering, Expectation
The students with the Clustering,
Maximization-Based help of the course
Spectralteacher can take
Clustering), up relevant
DBSCAN, technicalLarge
Clustering –activities
Data like
Sets, Divide-
and-ConquerorMethod.
presentation demonstration of workflow/ implementation of an algorithm which will enhance their
Text Book 1: Chapter 7 shall be evaluated for CIE marks.
skills. The prepared report
Self-Learning:
 Fuzzy C-Means
Need for machine learning. Clustering
Prediction and classification methods. Use cases in application
Module-3 RBT Level:L1,L2,L3 Hours: 8
domains. Interpretation of results. Limitations of various techniques.End to end Machine
Introduction to Decision Trees: Decision Trees for Classification, Impurity Measures for Decision
learning - data collection, data preparation, model selection.
Tree Construction, Properties of the Decision Tree Classifier (DTC), Applications in Breast Cancer
Data. Ensemble Methods: Random Forests for Classification, Gradient Boosting Machines (GBM)
and XGBoost. The Bayes Classifier: Introduction to the Bayes Classifier, Probability, Conditional
Probability and Bayes’ Rule, Bayes’ Rule and Inference, Naive Bayes Classifier (NBC)..
Text Book 1: Chapter 3, 4
Self-Learning: Markov Chain Monte Carlo (MCMC) methods.
Module-4 RBT Level: L1,L2,L3 Hours: 8
Neural Networks: The basic building blocks of deep learning, Training of Neural Networks.
Initializing Weights, Improved Optimization Methods, Adaptive Optimization, Loss Functions,
Regularization. Deep Neural Networks: Autoencoders, Variational Autoencoders (VAEs), and
attention mechanisms.
. Text Book 1: Chapter 9
Self-learning: Object Detection: YOLO, Faster R-CNN), Image Segmentation: U-Net for medical
imaging.
Module-5 RBT Level: L1,L2,L3 Hours: 8
Convolution Neural Network: Definition, Need, the basic building blocks of CNNs, Convolution,
Padding Zero Rows and Columns, Pooling to Reduce Dimensionality. CNN Architecture: ResNet,
DenseNet. Introduction to Recurrent Neural Networks: The basic building blocks of RNNs and
other architectural details, Training an RNN. Encoder–Decoder Models: Generative Adversarial
Networks, Applications.
Text Book 1: Chapter 9, Text Book 2: Chapter 10
Self-Learning: RNN Variants (Long Short-Term Memory (LSTM) and Gated Recurrent Unit (GRU)
models)

28
Course outcomes:
To understand the concepts and mathematical foundations of machine learning and types of
CO1 problems tackled by machine learning

CO2 To explore the different supervised learning techniques including ensemble methods

CO3 To learn different aspects of unsupervised learning and reinforcement learning

CO-PO Mapping
CO/ PO PO2 PO3 PO4 PO5 PO6 PO7 PO PO9 PO1 PO1 PO1 PSO PSO2
PO 1 8 0 1 2 1
3 2 2 2 2 1 1 1 1
CO1
CO2 2 2 2 2 2 1 1 1

CO3 3 3 2 2 2 1 1 1

CO4 3 3 2 2 2 2 1 1

CO5 3 3 2 2 2 2 1 1 1 1

High-3, Medium-2, Low-1

Question Paper Pattern:
2. . CIE Assessment Pattern:
The weightage of Continuous Internal Evaluation (CIE) is 50%. The minimum passing mark for the
CIE is 40% of the maximum marks (20 marks out of 50).
3.
4. SEE Assessment Pattern:
The weightage of Semester End Exam (SEE) is 50%. The minimum passing mark for SEE is 35% of
the maximum marks (18 out of 50 marks). A student shall be deemed to have satisfied the academic
requirements and earned the credits allotted to course if the student secures a minimum of 40% (40
marks out of 100) in the sum total of the CIE (Continuous Internal Evaluation) and SEE (Semester
End Examination) taken together.

Continuous Internal Evaluation:

There are 25 marks for the CIE’s Assignment component and 25 for the Internal Assessment Test
component
. Each test shall be conducted for 25 marks. The first test will be administered after 40-50% of the
coverage of the syllabus, and the second test will be administered after 85- 90% of the coverage of the
syllabus. The average of the best of two tests shall be scaled down to 25 marks.
Two assignments must be planned properly by the course teacher in advance. If an assignment is
project-based then only one assignment for the course shall be planned.The teacher should not conduct
two assignments at the end of the semester if two assignments are planned. Each assignment shall be
conducted for 25 marks. (If two assignments are conducted then the sum of the two assignments shall
be scaled down to 25 marks).
The final CIE marks of the course out of 50 will be the sum of the scale-down marks of tests and
assignment/s marks.

29
Course Title CLOUD COMPUTING Semester II

Course Code PCS552 CIE 50

Total No. of Contact Hours 50 SEE 50
No. of Contact Hours/week 5 Total 100
Credits 3 Exam. Duration 3 Hours
Teaching Dept Computer Science and Engineering

Course objective is to:

 Discuss the concepts, characteristics, delivery models and benefits of cloud computing, explore the key
technical, organizational and compliance challenges of cloud computing, grasp the concepts of
virtualization efficiently, explore the security issues that arise from cloud computing architectures
intended for delivering cloud based enterprise it services.privacy and interoperability, design cloud
services, set a private cloud
Module-1 RBT Level: L1,L2,L3 Hours:10
Cloud computing, Cloud computing delivery models and services, Cloud computing at Amazon,
Cloud computing the Google perspective, Microsoft Windows Azure and online services, Open-
source software platforms for private clouds, Cloud storage diversity and vendor lock-in, Energy use
and ecological impact, Service level agreements, User experience and software licensing. Exercises
and problems.
Text Book 1: Ch:1,3
Module-2 RBT Level: L1,L2,L3 Hours:10
Challenges of cloud computing, Architectural styles of cloud computing, Workflows: Coordination of
multiple activities, Coordination based on a state machine model: The Zookeeper, The Map Reduce
programming model, A case study: The Grep The Web application, Cloud for science and
engineering, High-performance computing on a cloud, Cloud computing for Biology research, Social
computing, digital content and cloud computing.
Text Book 1: Ch:4
30
 Module-3 RBT Level:L1,L2,L3 Hours:10
Virtualization, Layering and virtualization, Virtual machine monitors, Virtual Machines, Performance
and Security Isolation, Full virtualization and paravirtualization, Hardware support for virtualization,
Case Study: Xen a VMM based paravirtualization, Optimization of network virtualization, vBlades,
Performance comparison of virtual machines, The dark side of virtualization, Exercises and problems.
Text Book 1: Ch:5
Module-4 RBT Level: L2,L3 Hours:10
Cloud Security, Threats to Cloud Security,Infrastructure Security,Information Security,Identity
Management and Access Control,Cloud Security Design Principles ,Cloud Security Management
Frameworks,Security-as-a-Service,Protection of Privacy,Key Privacy Concerns in the Cloud,Security
vs Privacy,The Importance of Privacy Policy,Compliance,Governance, Risk and Compliance
(GRC),Audit and Monitoring
Text Book 2: Ch:16,17
Module-5 RBT Level: L2,L3 Hours:10
Amazon web services: EC2 instances, Connecting clients to cloud instances through firewalls,
Security rules for application and transport layer protocols in EC2, How to launch an EC2 Linux
instance and connect to it, How to use S3 in java, Cloud-based simulation of a distributed trust
algorithm, A trust management service, A cloud service for adaptive data streaming, Cloud based
optimal FPGA synthesis .Exercises and problems.
Text Book 1: Ch: 11

Sl.no Experiments & Mini project

1 install Virtualbox/VMware Workstation with different flavours of linux or windows OS on top
of windows7 or 8.
2 Install a C compiler in the virtual machine created using virtual box and execute Simple
Programs.
3 Install Google App Engine. Create hello world app and other simple web applications using
python/java.
4 Implementing applications using Google App Engine (PaaS).
5 Develop MapReduce application (example-URL Pattern count and others) using Hadoop cluster
set up (Single node and multi node).
6 Working and installation of Microsoft Azure
7 Find a procedure to transfer the files from one virtual machine to another virtual machine.
8 Register with Amazon AWS and create a windows/linux instance and launch an EC2 Linux
instance and connect to it and create S3 buckets
(Mini Design and develop custom Application using Cloud.
Project)

Suggested Learning Resources:

Textbooks:

1. Cloud Computing Theory and Practice Dan C Marinescu Elsevier(MK) 2013.

Ronald L. Krutz, Russell Dean Vines, “Cloud Security A comprehensive Guide to
2.
secure Cloud Computing” Wiley.
Reference Books:
31
 .Rajkumar Buyya , James Broberg, Andrzej Goscinski Computing Principles and
1.
Paradigms Willey 2014
Cloud Computing Implementation, Management and Security John W Rittinghouse,
2.
James F Ransome CRC Press 2013.
Web links and Video Lectures (e-Resources):
1. https://www.javatpoint.com/cloud-computing-tutorial
2. https://www.tutorialspoint.com/cloud_computing/index.htm
3. https://www.digimat.in/nptel/courses/video/106105167/L01.html (Video Lectures)
Activity-Based Learning (Suggested Activities in Class)/ Practical Based learning
The students with the help of the course teacher can take up relevant technical –activities like
presentation or demonstration of Design/ implementation of cloud service which will enhance their
skills. The prepared report shall be evaluated for CIE marks.

Course
CO-PO outcomes:
Mapping
CO1 PO1
CO/PO Compare
PO2 the
PO3strengths
PO4 and
PO5limitations
PO6 of
PO7cloudPO8
computing
PO9 PO10 PO11 PO12 PSO1 PSO
2
CO2 Identify the architecture, infrastructure and delivery models of cloud computing
1 2 1
CO1
Demonstrate the working of VM and VMM on any cloud platforms(public/private), and run a
CO3
CO2 software
1 service on that 1 1
Identify the known threats, risks, vulnerabilities and privacy issues associated with Cloud
CO4
CO3 2 based IT services. 2 2
CO5 Compare the strengths and limitations of cloud computing
CO4 1

High-3, Medium-2, Low-1

Question Paper Pattern:
5. CIE Assessment Pattern:
The weightage of Continuous Internal Evaluation (CIE) is 50%. The minimum passing mark for the
CIE is 40% of the maximum marks (20 marks out of 50).
6.
SEE Assessment Pattern:
The weightage of Semester End Exam (SEE) is 50%. The minimum passing mark for SEE is 35% of
the maximum marks (18 out of 50 marks). A student shall be deemed to have satisfied the academic
requirements and earned the credits allotted to course if the student secures a minimum of 40% (40
marks out of 100) in the sum total of the CIE (Continuous Internal Evaluation) and SEE (Semester
End Examination) taken together.

7. Continuous Internal Evaluation:

There are 25 marks for the CIE’s Assignment component and 25 for the Internal Assessment Test
component
. Each test shall be conducted for 25 marks. The first test will be administered after 40-50% of the
coverage of the syllabus, and the second test will be administered after 85- 90% of the coverage of the
syllabus. The average of the best of two tests shall be scaled down to 25 marks.
Two assignments must be planned properly by the course teacher in advance. If an assignment is
project-based then only one assignment for the course shall be planned.The teacher should not conduct
two assignments at the end of the semester if two assignments are planned. Each assignment shall be
conducted for 25 marks. (If two assignments are conducted then the sum of the two assignments shall
be scaled down to 25 marks). 32
The final CIE marks of the course out of 50 will be the sum of the scale-down marks of tests and
assignment/s marks.

Image Processing and

Course Title Semester II
Computer Vision

Course Code PCS571 CIE 50

Total No. of Contact Hours 40 SEE 50
No. of Contact Hours/week 3 Total 100
Credits 3 Exam. Duration 3 Hours
Teaching Dept Computer Science and Engineering

33
Course objective is to:
 Understand the Fundamentals of Vision Systems:
 Learn Digital Image Processing Techniques:
 Apply various image enhancement techniques in spatial and frequency domains, and
understand the principles and methods of image compression.
 Perform Advanced Image Segmentation and Morphological Operations
 Explore Neural Networks and Deep Learning for Image Processing
Module-1 RBT Level: L1,L2,L3 Hours:8
Computer Vision: Introduction to vision, human vision,computer, image processing, Case study on
Scene understanding and object recognition. Image Formation Models: Imaging systems,
Orthographic & Perspective Projection, Camera calibration and basics of image processing.
Text Book 1: Ch 1,2,3
Module-2 RBT Level: L1,L2,L3 Hours:8
Steps in digital image processing-Elements of visual perception- brightness adaptation, Mach band
effect. Interesting Problems in image processing, Some Basic Relationships between pixels, point,
line and edge detection. Point Detection, Edge detection, Sampling, Quantization,Histograms.
Image enhancement in spatial and frequency domain,smoothning and sharpening filters, Gaussian
filters, Homomorphic filtering, Histogram equalization.
Text Book 2: Ch: 1-3.4, 6, 6.1-6.9, 7, 7.8,7.9.
Module-3 RBT Level:L1,L2,L3 Hours:8
Fundamental of color image processing: color models, RGB, CMY, YIQ, HIS. Pseudo Color Image
processing.Case study on colour adjustment of image.
Image Compression: concept of redundancy,huffman encoding,run length coding, block transform,
An insight to process video frames, check quality of fusion image before and after compression.
Text Book 2: Ch: 8.1-8.9
Module-4 RBT Level: L1,L2,L3 Hours:8
Erosion, dilation, open and closing , boundary extraction, hole filling,Thinning, Region growing,
region shrinking. Breif overview on background substraction through examples. Fuzzy clustering,
Watershed algorithm, Thresholding – global, using Otsu’s method ,Segmentation basics,
Segmentation using region-growing and region-merging ,Segmentation using morphological
operations. Case study on semantic segmentation.
Text Book 2: Ch: 9, 10, 9.1-9.6, 10.1-10.5
Module-5 RBT Level:L1,L2,L3 Hours:8
Edge detection through fourier series, Hough transform, shape skeletonization, Boundary descriptors
and algorithms, Moments, Texture descriptors, Neural Networks and Deep Learning, Deep
convolution Neural Network. Future aspects of image processing. Neural Net applications on image
classification.
Text Book 2: Ch: 3.5-3.6, 4, 7, 4.7-4.10, 7.8,7.9,11.5

Suggested Learning Resources:

Textbooks:

D. A. Forsyth and J. Ponce, Computer Vision, A Modern Approach, Pearson

1.
Education, 2003.
2. Rafael C. Gonzalez, Richard E. Woods, Digital Image Processing', Pearson
34
 Education, Inc., Third Edition, 2004.
Reference Books:
Wesley E. Snyder and Hairong Qui, “Fundamentals of Computer Vision”, Cambridge
1.
University Press, 2017.
Anil K. Jain, Fundamentals of Digital Image Processing', Pearson Education, Inc.,
2.
2002.
Web links and Video Lectures (e-Resources):
 https://in.udacity.com/course/introduction‐to‐computer‐vision‐‐ud810
 https://onlinecourses.nptel.ac.in/noc18_ee08
 https://nptel.ac.in/courses/117/105/117105079/
Activity-Based Learning (Suggested Activities in Class)/ Practical Based learning.
The students with the help of the course teacher can take up relevant technical –activities like
Research or presentation or demonstration of workflow/ implementation of an algorithm which will
enhance their skills. The prepared report/research paper shall be evaluated for CIE marks.

Course outcomes:
CO1 Be familiar with the theoretical aspects of images, introduction to computer vision
To Gain practical aspects of computing with images ,exposure to object and scene
CO2 recognition and categorization.

CO3 Identify and describe operation of different smoothing and sharpening filters.

CO4 To analyze the different segmentation techniques

CO5 Outline the various feature extraction techniques for image analysis.
CO-PO Mapping
CO/ PO PO PO PO PO PO PO PO PO PO1 PO1 PO1 PSO PSO2
PO 1 2 3 4 5 6 7 8 9 0 1 2 1
3 2 1 2 1 1 3 1 1
CO1
CO2 2 2 1 1 1 1 2 1

CO3 2 2 2 3 1 2 3 1

CO4 2 2 2 3 1 2 3

CO5 2 2 2 2 1 1 2 2 1

High-3, Medium-2, Low-1

Question Paper Pattern:
8. CIE Assessment Pattern:
The weightage of Continuous Internal Evaluation (CIE) is 50%. The minimum passing mark for the
CIE is 40% of the maximum marks (20 marks out of 50).

9. SEE Assessment Pattern:

The weightage of Semester End Exam (SEE) is 50%. The minimum passing mark for SEE is 35% of
the maximum marks (18 out of 50 marks). A student shall be deemed to have satisfied the academic
requirements and earned the credits allotted to course if the student secures a minimum of 40% (40
35
marks out of 100) in the sum total of the CIE (Continuous Internal Evaluation) and SEE (Semester
End Examination) taken together.

10. Continuous Internal Evaluation:

There are 25 marks for the CIE’s Assignment component and 25 for the Internal Assessment Test
component
. Each test shall be conducted for 25 marks. The first test will be administered after 40-50% of the
coverage of the syllabus, and the second test will be administered after 85- 90% of the coverage of the
syllabus. The average of the best of two tests shall be scaled down to 25 marks.
Two assignments must be planned properly by the course teacher in advance. If an assignment is
project-based then only one assignment for the course shall be planned.The teacher should not conduct
two assignments at the end of the semester if two assignments are planned. Each assignment shall be
conducted for 25 marks. (If two assignments are conducted then the sum of the two assignments shall
be scaled down to 25 marks).
The final CIE marks of the course out of 50 will be the sum of the scale-down marks of tests and
assignment/s marks.

Natural Language
Course Title Semester II
Processing

Course Code PCS572 CIE 50

Total No. of Contact Hours 40 SEE 50
No. of Contact Hours/week 3 Total 100
Credits 3 Exam. Duration 3 Hours
Teaching Dept Computer Science and Engineering

Course objective is to:

 To define natural language processing and to learn various stages of natural language
processing.
 To describe basic concepts and algorithmic description of the main language levels:
Morphology, Syntax, Semantics, and Pragmatics &Discourse analysis.
 To design and implement various language models and POS tagging techniques.
 To design and learn NLP applications such as Information Extraction, Question answering.
 To design and implement applications based on natural language processing.
Module-1 RBT Level: L1,L2,L3 Hours: 8
Origin & History of NLP, Challenges of NLP, Basic Terms: Tokenization, Stemming,
Lemmatization; Survey of English Morphology, Inflectional Morphology, Derivational Morphology;
Regular expression with types;
36
Morphological Models: Dictionary lookup, finite state morphology; Morphological parsing with FST
(Finite State Transducer);Lexicon free FST Porter Stemmer algorithm; Grams and its variation:
Bigram, Trigram; Simple (Unsmoothed) N-grams;
N-gram Sensitivity to the Training Corpus; Unknown Words: Open versus closed vocabulary tasks;
Evaluating N-grams: Perplexity.Smoothing: Laplace Smoothing, Good-Turing Discounting;
Self-Learning topics: Noisy channel models, various edit distance, Advance Issues in Language
Modelling.
Module-2 RBT Level: L2,L3,L4 Hours: 8
Syntax analysis: Part-Of-Speech tagging(POS); Tag set for English (Upenn Treebank);
Difficulties /Challenges in POS tagging; Rule-based, Stochastic and Transformation-based tagging;
Generative Model: Hidden Markov Model (HMM Viterbi) for POS tagging;
Issues in HMM POS tagging; Discriminative Model: Maximum Entropy model, Conditional random
Field (CRF);Parsers: Top down and Bottom up; Modelling constituency; Bottom Up Parser: CYK,
PCFG (Probabilistic Context Free Grammar), Shift Reduce Parser; Top Down Parser: Early Parser,
Predictive Parser
Self-Learning topics: Evaluating parsers, Parsers based language, modelling, Regional languages
POS tree banks
Module-3 RBT Level:L2,L3,L4 Hours: 8
Semantic Analysis: Introduction, meaning representation; Lexical Semantics; Corpus study; Study of
Various language dictionaries like WorldNet, Babelnet; Relations among lexemes & their senses –
Homonymy, Polysemy, Synonymy, Hyponymy; Semantic Ambiguity;
Word Sense Disambiguation (WSD); Knowledge based approach( Lesk‘s Algorithm), Supervised
(Naïve Bayes, Decision List),Introduction to Semi-supervised method (Yarowsky)
Unsupervised (Hyperlex).
Self-Learning topics: Dictionaries for regional languages, Distributional Semantics, Topic Models
Module-4 RBT Level: L2,L3,L4 Hours: 8
Pragmatic & Discourse Processing: Discourse: Reference Resolution, Reference Phenomena,
Syntactic & Semantic constraint on coherence; Anaphora Resolution using Hobbs and Cantering
Algorithm.
Introduction to Information Retrieval: Definitions, architecture, and applications, Indexing:
Inverted index, compression techniques, Retrieval Models: Boolean, vector space, probabilistic
models, Evaluation Metrics: Precision, recall, F1-score, MAP, Advanced Topics: Latent Semantic
Indexing (LSI), BM25, neural IR models, Web Search: Crawling, indexing, and ranking
Self-Learning topics: Discourse segmentation, Conference resolution
Module-5 RBT Level: L3,L4,L5 Hours: 8
Applications of NLP: Case studies on (preferable in regional language):Machine translation; Text
Summarization; Sentiment analysis; Information retrieval; Question Answering system.
Self-Learning topics: Applications based on Deep Neural Network with NLP such as LSTM
network, Recurrent Neural network etc.

Suggested Learning Resources:

Textbooks:

1. Daniel Jurafsky, James H. and Martin, Speech and Language Processing, Second
Edition, Prentice Hall, 2008.
2. Christopher D.Manning and HinrichSchutze, Foundations of Statistical Natural
Language Processing, MIT Press, 1999.
Reference Books:
1. Siddiqui and Tiwary U.S., Natural Language Processing and Information Retrieval,
Oxford University Press, 2008.
37
2. Daniel M Bikel and ImedZitouni ― Multilingual natural language processing
applications:
3. Alexander Clark, Chris Fox, Shalom Lappin ― The Handbook of Computational
Linguistics and Natural Language Processing, John Wiley and Sons, 2012.
4. Nitin Indurkhya and Fred J. Damerau, ―Handbook of Natural Language Processing,
Second Edition, Chapman and Hall/CRC Press, 2010.
Web links and Video Lectures (e-Resources):
 http://www.cse.iitb.ac.in/~cs626-449
 http://cse24-iiith.virtual-labs.ac.in/#
 https://nptel.ac.in/courses/106105158
Activity-Based Learning (Suggested Activities in Class)/ Practical Based learning
The students with the help of the course teacher can take up relevant technical –activities like
Research or presentation or demonstration of workflow/ implementation of an algorithm which will
enhance their skills. The prepared report/research paper shall be evaluated for CIE marks.

Course outcomes:
CO1 To describe the field of natural language processing.

CO2 To design language model for word level analysis for text processing.

CO3 To design various POS tagging techniques and parsers.

CO4 To design, implement and test algorithms for semantic and pragmatic analysis.

CO5 To formulate the discourse segmentation and anaphora resolution.

CO-PO Mapping
PO PO2 PO3 PO4 PO PO6 PO7 PO8 PO9 PO10 PO1 PO12 PSO1 PSO2
CO/PO
1 5 1
CO1 3 2 1 3 2
CO2 3 3 2 2 1 3 2
CO3 3 3 3 2 1 3 2
CO4 3 3 3 3 2 1 3 2
CO5 3 3 3 3 2 2 3 3

High-3, Medium-2, Low-1

Question Paper Pattern:
CIE Assessment Pattern:
The weightage of Continuous Internal Evaluation (CIE) is 50%. The minimum passing mark for the
CIE is 40% of the maximum marks (20 marks out of 50).

SEE Assessment Pattern:

The weightage of Semester End Exam (SEE) is 50%. The minimum passing mark for SEE is 35% of
the maximum marks (18 out of 50 marks). A student shall be deemed to have satisfied the academic
38
requirements and earned the credits allotted to course if the student secures a minimum of 40% (40
marks out of 100) in the sum total of the CIE (Continuous Internal Evaluation) and SEE (Semester
End Examination) taken together.

Continuous Internal Evaluation:

There are 25 marks for the CIE’s Assignment component and 25 for the Internal Assessment Test
component
. Each test shall be conducted for 25 marks. The first test will be administered after 40-50% of the
coverage of the syllabus, and the second test will be administered after 85- 90% of the coverage of the
syllabus. The average of the best of two tests shall be scaled down to 25 marks.
Two assignments must be planned properly by the course teacher in advance. If an assignment is
project-based then only one assignment for the course shall be planned.The teacher should not conduct
two assignments at the end of the semester if two assignments are planned. Each assignment shall be
conducted for 25 marks. (If two assignments are conducted then the sum of the two assignments shall
be scaled down to 25 marks).
The final CIE marks of the course out of 50 will be the sum of the scale-down marks of tests and
assignment/s marks.

Course Title Social Networks Analysis Semester II

Course Code PCS573 CIE 50

Total No. of Contact Hours 40 SEE 50
No. of Contact Hours/week 3 Total 100
Credits 3 Exam. Duration 3 Hours
Teaching Dept Computer Science and Engineering

Course objective is to:

 Understanding the structure and analysis of social networks and on models and algorithms that
abstract their basic properties. and network measures
 Understanding the network growth models and link analysis
 exploring different community structure in networks and evaluating link prediction.
 identifying cascade behaviour and network effects and anomaly detection
 Representing information through graph representation learning and how to practically analyse
large-scale network data and how to reason about it through models for network structure and
evolution.
Module-1 39 RBT Level: L1,L2 Hours: 8
Introduction, Applications, Preliminaries, Three Levels of SNA, Historical Development, Graph
Visualization Tools.
NETWORK MEASURES: Network Basics, Node Centrality, Assortativity, Transitive and
Reciprocity, Similarity.

Module-2 RBT Level: L1,L2 Hours: 8

NETWORK GROWTH MODELS: Properties of real-world networks, Random network model, Ring
Lattice Network Model, Watts Strogatz model. Preferential Attachment model, Price’s model.
LINK ANALYSIS: Applications, Signed networks, Strong and weak Ties, Link analysis and
algorithms, Page Rank, Personalized Page Rank, Divrank, Simrank.
Module-3 RBT Level: L1,L2,L3 Hours: 8
COMMUNITY STRUCTURE IN NETWORKS: Applications, Types of communities, Community
detection methods, Disjoint community detection, overlapping community detection, local community
detection, community detection vs community search, evaluation.
LINK PREDICTION: Applications, temporal changes in a network, Problem definition, evaluating
link prediction networks, Heuristic Models, probabilistic Models, Supervised Random Walk,
Information- theoretic model.
Module-4 RBT Level: L1,L2 Hours: 8
CASCADE BEHAVIOR AND NETWORK EFFECTS: Preliminaries, Cascade model, case study,
probabilistic cascades, epidemic models, independent cascade models, Cascade prediction.
ANOMALY DETECTION IN STATIC NETWORKS: Outliers vs Network-based anomalies,
challenges, Anomaly detection in static and dynamic networks.
Module-5 RBT Level: L1,L2,L3 Hours: 8
GRAPH REPRESENTATION LEARNING: Machine learning pipelines, Intuition behind
representation learning, benefits, criteria of GRL, GRL pipelines, representation learning methods.
APPLICATION AND CASE STUDIES: Malicious activities on OSNs, Sock puppets in
OSNs, Modeling the spread of COVID 19, Recommendation System.

Suggested Learning Resources:

Textbooks:

1. Social Network Analysis, Tanmoy Chakraborty, Wiley, 2021

Reference Books:
1. Network Science, Albert-Lazzlo Barabasi
Social Network Analysis: Methods and Applications, Stanley Wasserman, Katherine
2.
Faus
3. Social Network Analysis- Fourth Edition - John Scott
“Introduction to Social Network Methods”, Robert A Hanneman, University of
4.
California Riverside, 2005.
“Social and Economic Networks”, Mathew O Jackson, Princeton University Press,
5.
2008.
Web links and Video Lectures (e-Resources):
 https://onlinecourses.nptel.ac.in/noc22_cs117/preview
Activity-Based Learning (Suggested Activities in Class)/ Practical Based learning
40
The students with the help of the course teacher can take up relevant technical –activities like
Research or presentation or demonstration of workflow/ implementation of Social network which
will enhance their skills. The prepared report/research paper shall be evaluated for CIE marks.

Course outcomes:
CO1 Understand the concept of social network and related applications.

CO2 Learn knowledge representation using ontology.

CO3 Understand human behavior in social web and related communities

CO4 Learn visualization of social networks.

To have access to a variety of descriptive measures for networks and software to calculate
CO5 them, and have the ability to interpret the results.

CO-PO Mapping
CO/ PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO PSO
PO1
PO 1 2
1 1 2 1 2
CO1

CO2 2 2 2 1

CO3 3 3 3 3 1

CO4 4 4 4 4 4 1 2

CO5 5 5 5 1 2

High-3, Medium-2, Low-1

Question Paper Pattern:

11. CIE Assessment Pattern:
The weightage of Continuous Internal Evaluation (CIE) is 50%. The minimum passing mark for the
CIE is 40% of the maximum marks (20 marks out of 50).

12. SEE Assessment Pattern:

The weightage of Semester End Exam (SEE) is 50%. The minimum passing mark for SEE is 35% of
the maximum marks (18 out of 50 marks). A student shall be deemed to have satisfied the academic
requirements and earned the credits allotted to course if the student secures a minimum of 40% (40
marks out of 100) in the sum total of the CIE (Continuous Internal Evaluation) and SEE (Semester
End Examination) taken together.

Continuous Internal Evaluation:

There are 25 marks for the CIE’s Assignment component and 25 for the Internal Assessment Test
component
. Each test shall be conducted for 25 marks. The first test will be administered after 40-50% of the
coverage of the syllabus, and the second test will be administered after 85- 90% of the coverage of the
syllabus. The average of the best of two tests shall be scaled down to 25 marks.
41
Two assignments must be planned properly by the course teacher in advance. If an assignment is
project-based then only one assignment for the course shall be planned.The teacher should not conduct
two assignments at the end of the semester if two assignments are planned. Each assignment shall be
conducted for 25 marks. (If two assignments are conducted then the sum of the two assignments shall
be scaled down to 25 marks).
The final CIE marks of the course out of 50 will be the sum of the scale-down marks of tests and
assignment/s marks.

Course Title Introduction to DevOps Semester II

Course Code PCS581 CIE 50

Total No. of Contact Hours 40 SEE 50
No. of Contact Hours/week 3 Total 100
Credits 3 Exam. Duration 3 Hours
Teaching Dept Computer Science and Engineering

Course objective is to:

 Understand the Core Concepts of DevOps
 Learn Tools and Technologies for DevOps
 Implement Continuous Integration and Continuous Delivery
 Automate Deployment and Monitoring Processes
 Manage Infrastructure and Configuration
Module-1 RBT Level: L1,L2,L3 Hours: 8
Foundational Terminology and Introduction to DevOps: Software development methodologies,
Operational Methodologies: ITIL, Development, Testing, Release, and Deployment Concepts ,
Provisioning, Version Control ,Test Driven Development, Feature Driven Development ,Behavior-
driven development. Problems of Delivering Software. Principles of Software Delivery , Need for
DevOps , Evolution of DevOps , DevOps Practices, The Continuous DevOps LifeCycle Process
(Continuous Integration, Continuous Inspection, Continuous Deployment, Continuous Delivery,
Continuous Monitoring), DevOps Culture Case Study- (IBM/Facebook/NetFlix).

Module-2 42 RBT Level: L1,L2,L3 Hours: 8

 DevOps Dimensions and Source Code Management: Three dimensions of DevOps – People,
Process, Technology/Tools, DevOps- Process , DevOps – People, Technology in
DevOps(Infrastructure as code, Delivery Pipeline, Release Management)
Tools/technology as enablers for DevOps. Version control system and its types, Introduction to GIT,
GIT Basics commands (Creating Repositories, clone, push, commit, review) , Git workflows- Feature
workflow, Master workflow, Centralized workflow, Feature branching, Managing Conflicts ,
Tagging and Merging , Best Practices- clean code.
Module-3 RBT Level: L1,L2,L3 Hours: 8
Continuous build and code quality, Continuous Integration and Delivery: Manage Dependencies,
Automate the process of assembling software ,components with build tools , Use of Build Tools-
Maven, Gradle , Unit testing, Enable Fast Reliable Automated Testing, Setting up Automated Test
Suite – Selenium , Continuous code inspection - Code quality Code quality analysis tools- sonarqube
Implementing Continuous Integration-Version control, automated build, Test Prerequisites for
Continuous Integration , Continuous Integration Practices, Team responsibilities, Using Continuous
Integration Software (Jenkins as an example tool), Jenkins Architecture, Integrating Source code
management, build, testing tools etc., with Jenkins – plugins. Artefacts management, Setting up the
Continuous Integration pipeline Continuous delivery to staging environment or the pre-production
environment, Self-healing systems
Module-4 RBT Level: L1,L2,L3 Hours: 8
Continuous Deployment and Monitoring: Deployment pipeline, Human-free deployments ,
Implementing and Automating the deployment process, Deploying it to testing environments,
Releasing software into production Environment-based release patterns, Rolling Back Deployments
and Zero-Downtime Releases Blue/Green Deployment, Rolling Upgrade, The canary release pattern-
Dark Launches. Goals of monitoring, Challenges of monitoring under continuous change, Alert
management, Analytics Continuous customer feedback and optimization, Use of ELK (Elasticsearch,
Logstash, and Kibana) Stack
Module-5 RBT Level: L1,L2,L3 Hours: 8
Configuration Management and Virtualization: Infrastructure as code , Managing Infrastructure
and Environments(Production, pre-production, Test, Developer Environment), Environment
provisioning, Automating and Managing Server Provisioning, Configuration management tools-
Chef, Puppet Managing on-demand infrastructure, Auto scaling. Virtualization , Virtualization vs
Containerization, Containerization using Dockers, Docker Images, Micro-services and
Containerization Current Trends- Kubernetes, DevOps on Cloud, Function-As-A-Service (AWS
Lambda)

Suggested Learning Resources:

Textbooks:

DevOps: A Software Architect's Perspective (SEI Series in Software Engineering) by

1.
Len Bass, Ingo Weber, Liming Zhu , Publisher: Addison Wesley (18 May 2015).
Continuous Delivery: Reliable Software Releases through Build, Test, and
2. Deployment Automation by Jez Humble, David Farley. Publisher: Addison Wesley,
2011.
Reference Books:
Effective DevOps: Building A Culture of Collaboration, Affinity, and Tooling at
1.
Scale by Jennifer Davis , Ryn Daniels. Publisher: O'Reilly Media, June 2016
The DevOPS Handbook: How to Create World-Class Agility, Reliability, and
2. Security in Technology Organizations by Gene Kim, Patrick Debois, John Willis, Jez
Humble, John Allspaw.Publisher: IT Revolution Press (October 6, 2016)
43
 Web links and Video Lectures (e-Resources):
1) https://jenkins.io/
2) https://xebialabs.com/solutions/devops/
3) https://www.ibm.com/ibm/devops/us/en/casestudies/#all
4) https://git-scm.com/
5) https://hub.docker.com/
6) https://www.atlassian.com/git/tutorials/comparing-workflows
7) https://www.tutorialspoint.com/puppet/
8) https://www.tutorialspoint.com/chef/
Activity-Based Learning (Suggested Activities in Class)/ Practical Based learning
The students with the help of the course teacher can take up relevant technical –activities like
presentation or demonstration of workflow/ implementation of an algorithm which will enhance their
skills. The prepared report shall be evaluated for CIE marks.

Course outcomes:
CO1 Explain the need for DevOps and list down the primary benefits of DevOps from
perspective of business and IT teams
CO2 List the ways in which DevOps uses new tools/technologies to deliver quality software more
rapidly.
CO3 Illustrate the practices of version control and configuration management.
CO4 Summarize the essentials of continuous integration (CI) and outline the principles and
practices of continuous delivery (CD)
CO5 Implement an automated deployment pipeline and create a DevOps toolchain

CO-PO Mapping
PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PS
CO/PO PO1
O2
CO1 1 2 3 3 3 3

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

High-3, Medium-2, Low-1

Question Paper Pattern:
13. CIE Assessment Pattern:
he weightage of Continuous Internal Evaluation (CIE) is 50%. The minimum passing mark for the CIE
is 40% of the maximum marks (20 marks out of 50).

14. SEE Assessment Pattern:

44
The weightage of Semester End Exam (SEE) is 50%. The minimum passing mark for SEE is 35% of
the maximum marks (18 out of 50 marks). A student shall be deemed to have satisfied the academic
requirements and earned the credits allotted to course if the student secures a minimum of 40% (40
marks out of 100) in the sum total of the CIE (Continuous Internal Evaluation) and SEE (Semester
End Examination) taken together.

15. Continuous Internal Evaluation:

There are 25 marks for the CIE’s Assignment component and 25 for the Internal Assessment Test
component
. Each test shall be conducted for 25 marks. The first test will be administered after 40-50% of the
coverage of the syllabus, and the second test will be administered after 85- 90% of the coverage of the
syllabus. The average of the best of two tests shall be scaled down to 25 marks.
Two assignments must be planned properly by the course teacher in advance. If an assignment is
project-based then only one assignment for the course shall be planned.The teacher should not conduct
two assignments at the end of the semester if two assignments are planned. Each assignment shall be
conducted for 25 marks. (If two assignments are conducted then the sum of the two assignments shall
be scaled down to 25 marks).
The final CIE marks of the course out of 50 will be the sum of the scale-down marks of tests and
assignment/s marks.

Course Title Cyber Security Semester II

Course Code PCS582 CIE 50

Total No. of Contact Hours 40 SEE 50
No. of Contact Hours/week 3 Total 100
Credits 3 Exam. Duration 3 Hours
Teaching Dept Computer Science and Engineering

Course objective is to:

 Understand the Core Concepts of Information Security
 Learn Key Network Security Terminologies and Models
 Analyze Various Types of Security Attacks
 Explore Open-Source Tools and Cryptographic Techniques
 Apply Digital Signatures and Network Access Control
Module-1 RBT Level: L1,L2,L3 Hours: 8
Security, Elements of Information Security, Security Policy, Security Techniques, The Operation
Model of Network Security, Basic Network Security Terminologies, Security Attacks, Open-Source
Tools, Symmetric Cipher Model, Principles of Public-Key Cryptosystems, Applications of
Cryptographic Hash Functions, Message Authentication Requirements, Message Authentication
Functions, Digital Signatures, Network Access Control, IP Security.
Text Book 2: Chapter 1, Text Book 1: 2.1, 9.1, 11.1, 12.1, 12.2, 13.1, 16.1, 20.1.
Module-2 RBT Level:L1,L2,L3 Hours: 8

45
Introduction, Sources of Threats: Threat Actors and their Motivations, What is a Cyberattack? Tools
and Methods Used in Cyberattacks/Cybercrimes, Responding to Cyberattacks and the Cyber Kill
Chain, Cyberattacks: Organizational Implications, Cyberattacks Impacting Citizens and Communities,
What is a Cybercrime? Classification of Cybercrimes, Forms of Cybercrimes, Cyber Scams and
Frauds, Prevention of Cybercrime, National Cybersecurity Policy, Online Code of Conduct and
Computer Ethics.
Text Book 1: Chapter 2
Module-3 RBT Level: L1,L2,L3 Hours: 8
Overview of Cybersecurity Management, Information Classification Process, Security Policies,
Security Procedures and Guidelines, Information Security Governance and Risk Management, Cyber
Risk Management, Cybersecurity Frameworks, Cyber Resilience, Industry-specific Cybersecurity
Frameworks, The Human Factor in Cybersecurity, Algorithms and Techniques for Cybersecurity.
Text Book 1: Chapter 4, 6
Module-4 RBT Level: L1,L2,L3 Hours: 8
Introduction, What is Personal Cybersecurity? Common Causes of Personal Security Breaches,
Personal Cybersecurity Best Practices, Privacy Regulations and Cybersecurity, The Role of Ethics in
Cybersecurity, Future Challenges in Cybersecurity, Artificial Intelligence for Cybersecurity, Quantum
Computing and Cybersecurity, Other Evolving Aspects of Cybersecurity.
Text Book 1: Chapter 8
Module-5 RBT Level: L1,L2,L3 Hours: 8
Case Study 1: Financial Fraud in Cyber Domain
Financial fraud in the banking and credit card sectors is a critical and growing concern, characterized
by increasingly sophisticated methods such as phishing, social engineering, card skimming, data
breaches, account takeovers, and identity theft. These fraudulent activities result in substantial
financial losses, damage to institutional reputation, and significant inconvenience to customers. By
examining case studies of financial fraud incidents within these sectors, organizations can better
understand the tactics employed by fraudsters and develop more effective strategies to mitigate these
risks. This analysis can provide valuable insights into enhancing security measures, improving
detection capabilities, and fostering a culture of vigilance and proactive defense against financial
fraud.
Case Study 2: Digital Signature
Fraud involving digital signatures poses a significant risk to the integrity and security of digital
transactions and documents. By studying case studies of such fraud incidents, organizations can better
understand the tactics used by fraudsters and develop more effective strategies to safeguard their
digital signature infrastructure. This analysis can provide crucial insights into enhancing key
management, securing Certificate Authorities, protecting communication channels, and mitigating
insider threats, ultimately strengthening the overall security posture against digital signature fraud.
Text Book 4: Chapter 11

Suggested Learning Resources:

Textbooks:

Ajay Singh, Introduction to Cybersecurity: Concepts, Principles, Technologies and

1.
Practices, Universities Press, 2023.
V K Pachghare, Cryptography and Network Security, PHI Learning, 3rd Edition,
2.
2019.
3. William Stallings, Cryptography and Network Security, Pearson, 6th edition, 2013.
Nina Godbole, Sunit Belapure, Cyber Security: Understanding Cyber Crimes,
4.
Computer Forensics and Legal Perspectives, Willey, 1st Edition, 2011
46
Reference Books:
1. Computer Security: Principles and Practice" by William Stallings and Lawrie Brown
Cybersecurity and Cyberwar: What Everyone Needs to Know" by P.W. Singer and
2.
Allan Friedman
Web links and Video Lectures (e-Resources):
 Personal Cybersecurity Best Practices
 Privacy Regulations and Cybersecurity
 Cyber Crime Overview
Activity-Based Learning (Suggested Activities in Class)/ Practical Based learning

The students with the help of the course teacher can take up relevant technical –activities like
presentation or demonstration of workflow/ implementation of an algorithm which will enhance their
skills. The prepared report shall be evaluated for CIE marks.

Course outcomes:
CO1 Understand the core concepts of Information and Network Security.

CO2 Learn and Analyze Various Types of Cyber-Attacks and Cyber-Crimes.

CO3 Analyze and Apply Various Risk Management Strategies.

CO4 Gain Insights on How to Apply Cybersecurity in Evolving Technologies.

CO-PO Mapping
CO/PO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 2 1 1 3 1 1
CO2 3 3 2 3 2 1 1
CO3 3 3 3 3 3 1 1
CO4 3 2 3 2 3 1 1

High-3, Medium-2, Low-1

Question Paper Pattern:
16. CIE Assessment Pattern:
The weightage of Continuous Internal Evaluation (CIE) is 50%. The minimum passing mark for the
CIE is 40% of the maximum marks (20 marks out of 50).

17. SEE Assessment Pattern:

The weightage of Semester End Exam (SEE) is 50%. The minimum passing mark for SEE is 35% of
the maximum marks (18 out of 50 marks). A student shall be deemed to have satisfied the academic
requirements and earned the credits allotted to course if the student secures a minimum of 40% (40
marks out of 100) in the sum total of the CIE (Continuous Internal Evaluation) and SEE (Semester
End Examination) taken together.

18. Continuous Internal Evaluation:

There are 25 marks for the CIE’s Assignment component and 25 for the Internal Assessment Test
component

47
. Each test shall be conducted for 25 marks. The first test will be administered after 40-50% of the
coverage of the syllabus, and the second test will be administered after 85- 90% of the coverage of the
syllabus. The average of the best of two tests shall be scaled down to 25 marks.
Two assignments must be planned properly by the course teacher in advance. If an assignment is
project-based then only one assignment for the course shall be planned.The teacher should not conduct
two assignments at the end of the semester if two assignments are planned. Each assignment shall be
conducted for 25 marks. (If two assignments are conducted then the sum of the two assignments shall
be scaled down to 25 marks).
The final CIE marks of the course out of 50 will be the sum of the scale-down marks of tests and
assignment/s marks.

Course Title Cloud Security Semester II

Course Code PCS583 CIE 50
Total No. of Contact Hours 40 SEE 50
No. of Contact Hours/week 3 Total 100
Credits 3 Exam. Duration 3 Hours
Teaching Dept Computer Science and Engineering

Course objective is to:

 Identify Cloud Security Threats and Risks
 Manage Identity and Access in the Cloud:
 Design Secure Cloud Architectures and Secure Cloud Data
 Apply Risk Management Principles
 Update with Emerging Technologies and Trends
Module-1 RBT Level: L1 Hours: 8
Review : cloud computing , cloud architecture.
Security concerns, risk issues and legal aspects: security concerns, Assesing the risk,Privacy and
Confidentiallity concerns, Data Ownership and Locale Concerns, Auditing and Forensics, Emerging
Threats.
Text Book 1: Ch 3
Module-2 RBT Level: L2 Hours: 8
Securing the cloud: Architecture: Security Requirements for the Architecture, Security policies and
Architectural elements, Clous Security Architecture,planning Ket Stratagies for Secure Operation.
Text Book 1: Ch 4
48
Module-3 RBT Level: L2 Hours: 8
Securing the cloud: Data Security: Overview of Data Security in Cloud Computing, Data encryption,
Cloud Data Security,Cloud Data Storage, Cloud lock-in.
Text Book 1: Ch 7,8
Module-4 RBT Level: L3 Hours: 8
Risk Management , Security Controls , limits of Security Controls. Security Monitoring . Security
Criteria: Building an Internal Cloud: Private Clouds, Security Criteria for ensuring a private cloud.
Text Book 1: Ch:6
Module-5 RBT Level: L3 Hours: 8
Evaluating : An Information Security Framework: Evaluating Cloud Security, Checklist for
Evaluating Cloud Security. Best practices for cloud Security.
Text Book 1: Ch:9

Suggested Learning Resources:

Course outcomes:
Textbooks:
CO1 Assessing Cloud Security Risks
Vic (J.R.) Winkler, Securing the Cloud, Cloud Computer Security Techniques and
1.
CO2 Implementing Cloud Security Controls,
Tactics, Syngress, 2011
Reference Books:
CO3 Securing Cloud Data
"Cloud Security: A Comprehensive Guide to Secure Cloud Computing" by Ronald L.
1. Managing Identity and Access
CO4 Krutz and Russell Deanin the Cloud
Vines
"Architecting the Cloud: Design Decisions for Cloud Computing Service Models
2.
CO5 Explore(SaaS,
Infrastructure Security and Application-Level Data Security
PaaS, and IaaS)" by Michael J. Kavis
NIST Special Publication 800-144: "Guidelines on Security and Privacy in Public
3.
Cloud Computing"
Online resources and cloud provider documentation (AWS, Azure, Google Cloud
4.
Platform)
Web links and Video Lectures (e-Resources):
 IBM Cloud Security.
 Google Cloud Security.

Activity-Based Learning (Suggested Activities in Class)/ Practical Based learning

The students with the help of the course teacher can take up relevant technical –activities which will
enhance their skill.

CO-PO Mapping
CO/PO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
2 2 2
CO1
CO2 2 2 2

CO3 1 2

CO4 3 2 1

CO5 2 1 1 1

49
High-3, Medium-2, Low-1
Question Paper Pattern:
19. CIE Assessment Pattern:
The weightage of Continuous Internal Evaluation (CIE) is 50%. The minimum passing mark for the
CIE is 40% of the maximum marks (20 marks out of 50).

20. SEE Assessment Pattern:

The weightage of Semester End Exam (SEE) is 50%. The minimum passing mark for SEE is 35% of
the maximum marks (18 out of 50 marks). A student shall be deemed to have satisfied the academic
requirements and earned the credits allotted to course if the student secures a minimum of 40% (40
marks out of 100) in the sum total of the CIE (Continuous Internal Evaluation) and SEE (Semester
End Examination) taken together.

21. Continuous Internal Evaluation:

There are 25 marks for the CIE’s Assignment component and 25 for the Internal Assessment Test
component
. Each test shall be conducted for 25 marks. The first test will be administered after 40-50% of the
coverage of the syllabus, and the second test will be administered after 85- 90% of the coverage of the
syllabus. The average of the best of two tests shall be scaled down to 25 marks.
Two assignments must be planned properly by the course teacher in advance. If an assignment is
project-based then only one assignment for the course shall be planned.The teacher should not conduct
two assignments at the end of the semester if two assignments are planned. Each assignment shall be
conducted for 25 marks. (If two assignments are conducted then the sum of the two assignments shall
be scaled down to 25 marks).
The final CIE marks of the course out of 50 will be the sum of the scale-down marks of tests and
assignment/s marks.

50
Course Title Mini Project with Seminar Semester II
Course Code PCS553 CIE 50
Total No. of Contact Hours 20 SEE --
No. of Contact Hours/week 3 Total 50
Exam.
Credits 2 --
Duration
Teaching Dept Computer Science and Engineering

Course objective is to:

 To enable students to apply theoretical concepts learned during the course to solve real-world
problems.
 To develop students' abilities to conduct independent research, including literature review,
problem formulation, and experimentation.
 To enhance students' ability to communicate technical information effectively through
written reports and oral presentations.

Mini-Project with seminar: Students will engage in hands-on practice, surveys, data analysis,
coding, app development, field visits, system modeling, simulation, and case studies. Students shall
involve in carrying out the project work jointly in constant consultation with internal guide, and
prepare the project report as per the norms avoiding plagiarism.
Activity 1: Exploration into Emerging Technologies /Research RBT Levels: L1, 3 Hours
Domains & selection of Topic L2
Activity 2: Define the Project Objective RBT Levels: L1, 3 Hours
L2
Activity 3: Literature Review and a Project Plan RBT Levels: L1, 3 Hours
L2,L3
Activity 4: Implement the Project RBT Levels: 6 Hours
L4,L5
Activity 5: Report RBT Levels: L1, 3 Hours
L2,L3,L4,L5

Course outcomes:
CO1 Present the mini-project and be able to defend it.
Make links across different areas of knowledge and to generate, develop and evaluate ideas
CO2 and information so as to apply these skills to the project task.

CO3 Habituated to critical thinking and use problem solving skills.

Communicate effectively and to present ideas clearly and coherently in both the written and
CO4 oral forms.
CO5 Learn on their own, reflect on their learning and take appropriate actions to improve it

51
CIE procedure for Mini - Project:
The Continuous Internal Evaluation (CIE) marks awarded for Mini - Project, shall be based on the
evaluation of Mini - Project Work & Report, Project Presentation skill and Question and Answer
session in the ratio 50:25:25. CIE will be awarded by a committee comprising the HoD, the project
guide/co-guide, and a senior faculty member.

Mandatory Participation: Participation in the seminar, where students present their Mini Project, is
mandatory for all postgraduate students in the program. The Mini Project with Seminar is a required
course for progression and the award of the degree.

Completion Requirements: Students who do not complete the Mini Project and Seminar will be
declared as failing the course and must complete it in the subsequent semester, with no Semester End
Examination (SEE) for this course.

52
 Advanced Machine Learning Lab

Course Code PCS554 CIE Marks 50

L:T:P:S 0:0:2:0 SEE Marks 50

Hrs. / Week 2 Total Marks 100

Credits 1 Exam Hours 03

Teaching Dept Computer Science and Engineering

Course Learning Objectives:

 To understand the basic theory underlying machine learning.
 To be able to formulate machine learning problems corresponding to different applications.
 To understand a range of machine learning algorithms along with their strengths and weaknesses.
 To be able to apply machine learning algorithms to solve problems of moderate complexity.
To apply the algorithms to a real-world problem, optimize the models learned and report on the expected
accuracy that can be achieved by applying the models.

Pgm. No. List of Experiments / Programs Hours COs

PART-A

Title: Design an END to END pipeline for Hand Written

1. Recognition System.
Hours:2 COs:1
Problem Description: The handwritten digit recognition is the
capability of computer applications to recognize the
human handwritten digits. It is a hard task for
the machine because handwritten digits are not perfect and can
be made with many different shapes and sizes. The handwritten
digit recognition system is a way to tackle this problem which
uses the image of a digit and recognizes the digit present in the
image. problem which uses the image of a digit and recognizes
the digit present in the image.

Method:. Convolutional Neural Network (CNN) is one of the

most widely used methods for handwriting recognition. Before
entering into Convolutional Neural Network the image must go
through pre-processing first.

2 Title: Download heart disease data set from Kaggle dataset.

Apply supervised learning algorithm to identify the person is
53
 having heart disease or not. Hours:2 COs:1

Problem Description:Objective: To develop a supervised

learning model that can accurately predict whether an
individual has heart disease based on various health attributes.

Method: Apply supervised learning algorithm to identify the

person is having heart disease or not.

3 Title: Customer Segmentation means the segmentation of

customers on the basis of their similar characteristics, behavior,
and needs. Apply K-Means clustering algorithm for Hours:2 COs:1
segmentation Use customer behavior dataset from Kaggle.
Problem Description:Objective: To segment customers based
on their characteristics and behaviors using the K-Means
clustering algorithm, enabling targeted marketing and
personalized service offerings.
Method: By applying K-Means clustering, businesses can gain
deeper insights into customer segments, allowing for more
effective marketing strategies and improved customer
satisfaction.
4 Title: Understanding customer sentiment is a crucial strength
for businesses and can be significantly improved with AI. It
enables you to better meet customer needs before, during, and Hours:2 COs:1
after they arise. Generate an Deep Learning application to
understand the tone of a customer’s feedback and the emotions
behind their message.
Problem Description:To develop a deep learning application
that accurately analyzes customer feedback to determine
sentiment and underlying emotions. This application will
enable businesses to better understand customer needs and
improve engagement strategies.
Method: Recurrent Neural Networks (RNNs):Effective for
sequential data like text. Variants like Long Short-Term
Memory (LSTM) and Gated Recurrent Unit (GRU) are
particularly useful for capturing long-range dependencies in
text.
5 Title: Develop Deep Learning algorithm text classification is
with document classification models.
Hours:2 COs:2
Problem Description:To develop a deep learning algorithm
for text classification, specifically targeting document
classification tasks. The goal is to automatically categorize
documents into predefined categories based on their content.

Merhod:Choose an appropriate deep learning architecture,

such as:LSTM/GRU: For capturing sequential dependencies in
the text. CNN: For recognizing patterns in text data.
Transformers (e.g., BERT): For advanced context
understanding and improved accuracy.54
6 Title: Applying the Deep Learning Models in the field of
Natural Language Processing Text Classification with Movie
Review Example. Hours:2 COs:3

Problem Description:The goal of this project is to apply deep

learning models in Natural Language Processing (NLP) for the
task of text classification, specifically focusing on classifying
movie reviews into categories such as positive, negative, or
neutral. This classification will help in understanding audience
sentiment towards films, which can be valuable for filmmakers,
marketers, and platforms that curate movie content.

Method: TF-IDF: To represent the importance of words in the

document.Word Embeddings: Use pre-trained embeddings
(e.g., Word2Vec, GloVe) or contextual embeddings (e.g.,
BERT).

7 Title: Apply RNN to perform time series forecast using

historical stock data for Google from Yahoo Finance
Hours:2 COs:4
Problem Description:To develop a Recurrent Neural Network
(RNN) model for time series forecasting using historical stock
data of Google obtained from Yahoo Finance. The goal is to
predict future stock prices based on past performance,
providing insights for investors and stakeholders.

Method: Design an RNN architecture, potentially using Long

Short-Term Memory (LSTM) or Gated Recurrent Unit (GRU)
layers to capture temporal dependencies in the stock price data.

8 Title: Apply Generative Adversial Networks for image

generation .
Hours:2 COs:4
Problem Description:To develop a Generative Adversarial
Network (GAN) for the purpose of generating realistic images
based on a specified dataset. The aim is to explore the potential
of GANs in creating high-quality synthetic images that can be
indistinguishable from real images.

Method: By applying Generative Adversarial Networks for

image generation, researchers and practitioners can explore
creative applications in art, design, and data augmentation,
ultimately pushing the boundaries of synthetic media and
generative modeling.

55
 Suggested Learning Resources:
Textbooks/ Reference Books:

Machine Learning: Theory and Practice by M N Murty and Ananthanarayana V S,

1.
ISBN: 9789393 330697 | Year: 2024.
2. Deep Learning Foundations and Concepts Christopher M Bishop
Stephen Marsland, “Machine Learning: An Algorithmic Perspective”, Chapman &
3.
Hall/CRC, 2nd Edition, 2014.
4. Kevin Murphy, “Machine Learning: A Probabilistic Perspective”, MIT Press, 2012
Web links and Video Lectures (e-Resources):
 https://pages.cs.wisc.edu/~shuchi/courses/787-F07/about.html

Activity-Based Learning (Suggested Activities in Class)/ Practical Based learning

The students with the help of the course teacher can take up relevant technical –activities like
presentation or demonstration of workflow/ implementation of an algorithm which will enhance their
skills. The prepared report shall be evaluated for CIE marks.
Need for machine learning. Prediction and classification methods. Use cases in application domains.
Interpretation of results. Limitations of various techniques.End to end Machine learning - data
collection, data preparation, model selection.

Course outcomes:

CO1 Apply Feature Extracting and Feature Engineering techniques.

CO2 Implement Exploratory Data Analysis on real time datasets.

Evaluate the machine learning models pre-processed through various feature engineering
CO3 algorithms by python programming.

CO4 Design and apply various reinforcement algorithms to solve real time complex problems.

CO5 Understand the basic concepts of deep neural network model and design the same..

56
CO-PO Mapping

CO/ PO2 PO3 PO4 PO PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
PO1
PO 5

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

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

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

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

CO5 2 1 1 1 2 - - - - - - 1 1 1

Hig:3, Medium:2, Low:1

Assessment Details (both CIE and SEE)
The weightage of Continuous Internal Evaluation (CIE) is 50% and for Semester End Exam (SEE) is
50%. The minimum passing mark for the CIE is 50% of the maximum marks. Minimum passing
marks in SEE is 40% of the maximum marks of SEE. A student shall be deemed to have satisfied the
academic requirements and earned the credits allotted to each subject/ course if the student secures not
less than 50% (50 marks out of 100) in the sum total of the CIE (Continuous Internal Evaluation) and
SEE (Semester End Examination) taken together.

CIE-Continuous Internal Evaluation:

One Unit Tests of 20 Marks.
Lab conduction 20 Marks and Record of 10 Marks. The sum of these three will be sumed up to 50
marks
CIE methods /question paper is designed to attain the different levels of Bloom’s taxonomy as per the
outcome defined for the course.

SEE- Semester End Examination:

The SEE question paper will be set for 100 marks and the marks scored will be for 100 Marks
The question paper will have one Program carrying 100 marks.
Each program is for 100 marks. The writing program will be for 20 Marks and conduction of program
which consists of execution of program 60 and viva -voice for 20 Marks.
The students will have to write the program and execute the selected program given from the list of
programs.

57
 Syllabus of MTech in Computer Science
and Engineering
SECOND YEAR SYLLABUS

III Semester
Sl.No Subject Code Subject Name

1 PCS601 Advances in Data Base Management System

2 PCS67X Professional Elective 3

3 PCS671 Blockchain Technology

4 PCS672 Big Data Analytics

5 PCS673 Object Oriented Software Engineering

6 PCS68X Open Elective Courses-1

7 PCS681 Innovation Strategies of Teaching and Learning

8 PCS682 Open-Source software Engineering

9 PCS683 User Experienced Design

10 PCS602 Software Engineering in Practice

11 PCS603 Societal Project

12 PCS604 Project Work Phase 1

13 PCS605 Internship

Sl.No Subject Code Subject Name

1 PCS651 Project work Phase -2

2 PCS652 Suggested Online Course

58
 Advances in DataBase
Course Title Semester III
Management
Course Code PCS601 CIE 50
Total No. of Contact Hours 50 SEE 50
No. of Contact Hours/week 3 Total 100
Credits 4 Exam. Duration 3 Hours
Teaching Dept Computer Science and Engineering
Course objective is to:
 Understand Database Concepts and Architecture:
 Master Query Processing and Optimization
 Explore Analytical Databases and Vertica Integration
 Learn Graph Databases and Neo4j
 Understand and Utilize Vector Databases
Module-1 RBT Level: L1,L2,L3 Hours: 10
Review of database terminology. Database system concepts and architecture- Data Models , Schemas
and instances Conceptual Data modelling. Conceptual data model design. Relational Data model and
Relational Data model constraint.
Text book 1:. 1,2,3,5
Module-2 RBT Level: L1,L2,L3 Hours: 10
Strategies for Query Processing,Translating SQL Queries into Relational Algebra, and Other
Operators, Algorithms for External Sorting , Algorithms for SELECT Operation, Implementing the
JOIN Operation, Algorithms for PROJECT and Set Operations , Implementing Aggregate Operations
and Different Types of JOINs, Combining Operations Using Pipelining , Parallel Algorithms for
Query Processing. Query Trees and Heuristics for Query Optimization, Choice of Query Execution
Plans. Use of Selectivities in Cost-Based Optimization. Cost Functions for SELECT Operation , Cost
Functions for the JOIN.
Text Book 1: Chapter 18,19.
Module-3 RBT Level: L1,L2,L3 Hours: 10
Why to use Analytical database, Key Characteristics of an Analytics Database? OLAP vs OLTP.
Examples of analytical databases. Integrate Vertica with your environment, Transform and analyze
data with the power of Vertica, Add scripts, SQL functions, and external libraries that automate tasks
and extend Vertica functionality.
Text Book 1:
Module-4 RBT Level: L1,L2,L3 Hours:10
Graph Databases Theoretical Module Introduction, Graph Theory usage in Graph Databases, Graph
database comparison with Relational database. Graph database use cases. Neo4j Data Modelling,
Symbolic Representation of Graph, Neo4j query Cypher Language, Datatype in Neo4j, Neo4j create
node command, delete node command, Neo4j create constraint, Basic Queries , Neo4j clauses ,
Example query in Neo4J.
TextBook 1: Chapter 24
Module-5 RBT Level: L1,L2,L3 Hours: 10
Fundamentals of Vector Database, How vector database store data? How do vector database
works? . SQLite Database ,Storing and Retrieving Vector Data in SQLite, Vectors and Embeddings,
Create Embeddings using OpenAI, Vector Similarity Search, Chroma DB-Local Vector Data.
Introduction to ChromaDB, Methods on Collection, storing “The Matrix Collection” , adding
document associated embeddings, Query with ‘Where’ filter.
59
 Suggested Learning Resources:
Textbooks:

Fundamentals of Database Systems, Ramez Elmasri and Shamkant B. Navathe, 7th

1.
Edition, 2017, Pearson
Reference Books:
Silberschatz A, Korth H F and Sudharshan S, “Database System Concepts”, Sixth
1.
Edition, Tata McGraw-Hill Publishing Company Limited, 2010.
Database management systems, Ramakrishnan, and Gehrke, 3rd Edition, 2014,
2.
McGraw Hill.
Web links and Video Lectures (e-Resources):
1. https://www.sciencedirect.com/topics/computer-science/analytical-database
2. https://www.udemy.com/course/data-modelling-and-database-design-for-business-analysts/?
3. https://github.com/neo4j-graph-examples
4. https://neo4j.com/
5. Udemy Course : Vector Database Fundamentals
6. https://www.coursera.org/learn/vector-databases-introduction-with-chromadb:
Activity-Based Learning (Suggested Activities in Class)/ Practical Based learning
 The students with the help of the course teacher can take up relevant technical –activities like
presentation or certification course.
 Demonstration and implementation of a Database which will enhance their skills and shall be
evaluated for CIE marks.

Course outcomes:
CO1 Understand and analyze the RDBMS and its internal organization .
CO2 Implement optimized the query by using the algorithm.

CO3 Able to create an application with Vertical

CO4 Understand and Develop an application in Neo4j application

CO5 Understand and Develop an application in application Chroma DB

CO-PO Mapping
CO/ PO PO PO PO PO PO PO PO PO PO1 PO1 PO1 PSO PSO
PO 1 2 3 4 5 6 7 8 9 0 1 2 1 2
CO1 3 2 1 1 2 1 1 1
CO2 3 3 2 2 3 1 1
CO3 2 2 2 2 3 1 1
CO4 3 2 3 2 3 1 1
CO5 2 2 2 2 3 1 1

High-3, Medium-2, Low-1

Assessment Details (both CIE and SEE)
60
The weightage of Continuous Internal Evaluation (CIE) is 50% and for Semester End Exam (SEE) is 50%.
The minimum passing mark for the CIE is 50% of the maximum marks. Minimum passing marks in SEE is
40% of the maximum marks of SEE. A student shall be deemed to have satisfied the academic requirements
and earned the credits allotted to each subject/ course if the student secures not less than 50% (50 marks out
of 100) in the sum total of the CIE (Continuous Internal Evaluation) and SEE (Semester End Examination)
taken together.
CIE-Continuous Internal Evaluation:
Three Unit Tests each of 20 Marks
Two assignments each of 20 Marks or one Skill Development Activity of 40 marks to attain the COs and
POs The sum of three tests, two assignments/skill Development Activities, will be scaled down to 50 marks
CIE methods /question paper is designed to attain the different levels of Bloom’s taxonomy as per the
outcome
defined for the course.

SEE- Semester End Examination:

The SEE question paper will be set for 100 marks and the marks scored will be proportionately reduced to
50.
The question paper will have ten full questions carrying equal marks.
Each full question is for 20 marks. There will be two full questions (with a maximum of four sub-questions)
from each module.
Each full question will have a sub-question covering all the topics under a module.
The students will have to answer five full questions, selecting one full question from each module

61
Course Title Blockchain Technology Semester III
Course Code PCS671 CIE 50
Total No. of Contact Hours 40 SEE 50
No. of Contact Hours/week 3 Total 100
Credits 3 Exam. Duration 3 Hours
Teaching Dept Computer Science and Engineering

Course objective is to:

 Explain the strong technical knowledge of Blockchain technologies.
 Analyzing the blockchain decentralization and cryptography concepts.
 Explore the driving force behind the cryptocurrency Bitcoin along with the decentralization.
Module-1 RBT Level: L1, L2,L3 Hours: 8
Distributed systems, Introduction to Blockchain, Types of blockchain, Consensus , CAP theorem,
Cryptography: Hash functions, Hash Pointers and Data structure, Digital Signature-ECDSA, Zero
Knowledge Proof.
Text Book 1& 2
Module-2 RBT Level: L1,L2,L3 Hours: 8
Decentralization using blockchain, Methods of decentralization, Routes to decentralization,
Decentralized organizations, Cryptography and Technical Foundations: introduction, Cryptographic
primitives, Public and Private keys.
Text Book 2
Module-3 RBT Level:L1,L2,L3 Hours: 8
Bitcoin, Digital keys and addresses, Transactions, Blockchain, Mining, Wallets, Theoretical
zfoundations, Bitcoin limitations, Namecoin, litecoin, Primecoin, Zcash.
Text Book 2
Module-4 RBT Level: L1,L2,L3 Hours: 8
Smart Contracts, Ricardian Contracts, Ethereum: Introduction, The Ethereum Network, Components
of Ethereum.
Text Book 2
Module-5 RBT Level: L1,L2,L3 Hours: 8
Manufacturing and production, supply chain management, logistics and transportation, Internet of
Things, Government, Health, Finance, Media and future of Blockchain.
Text Book 2

Suggested Learning Resources:

Textbooks:

Arvind Narayanan, Joseph Bonneau, Edward Felten, Andrew Miller and Steven
1. Goldfeder, Bitcoin and Cryptocurrency Technologies: A Comprehensive Introduction,
First Edition, Princeton University, 2016
Imran Bashir, Mastering Blockchain: Distributed ledgers, Decentralization and Smart
2.
Contracts explained. 2nd Edition, March62 2018.
Reference Books:
 Arshdeep Bahga and Vijay K MAdisetti, Blockchain Applications: A Hands-on
1.
Approach, VPT, ISBN: 9780996025560, 2017.
Andreas M. Antonopou. Mastering Bitcoin: Unlocking Digital Cryptocurrencies,
2.
O’Reilly Media, First Edition, 2014
Web links and Video Lectures (e-Resources):
 http://www.digimat.in/nptel/courses/video/106105184/L03.html
 https://www.digimat.in/nptel/courses/video/106104220/L01.html

Activity-Based Learning (Suggested Activities in Class)/ Practical Based learning.

The students with the help of the course teacher can take up relevant technical –activities like
presentation or demonstration of workflow/ implementation of an algorithm which will enhance their
skills. The prepared report shall be evaluated for CIE marks.

Course outcomes:
CO1 Understand how Blockchain systems works
CO2 Analyzing the Blockchain decentralization and cryptography concepts

CO3 Describe the features and importance of Bitcoin

CO4 Explain about the principles of Ethereum Virtual Machine

CO5 Evaluate alternative Blockchains and their applicability

CO-PO Mapping
CO/PO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
3 1 0 1 0 1 0 0 1 2 1 2
CO1
CO2 3 3 2 2 2 0 0 1 1 1 1 2

CO3 3 2 2 1 2 1 0 1 2 0 1 2

CO4 3 2 1 0 2 1 1 0 2 0 1 2

CO5 3 2 2 0 1 3 2 0 2 2 1 3

High-3, Medium-2, Low-1

Assessment Details (both CIE and SEE)
The weightage of Continuous Internal Evaluation (CIE) is 50% and for Semester End Exam (SEE) is 50%.
The minimum passing mark for the CIE is 50% of the maximum marks. Minimum passing marks in SEE is
40% of the maximum marks of SEE. A student shall be deemed to have satisfied the academic requirements
and earned the credits allotted to each subject/ course if the student secures not less than 50% (50 marks out
of 100) in the sum total of the CIE (Continuous Internal Evaluation) and SEE (Semester End Examination)
taken together.
CIE-Continuous Internal Evaluation:
Three Unit Tests each of 20 Marks
63
Two assignments each of 20 Marks or one Skill Development Activity of 40 marks to attain the COs and
POs The sum of three tests, two assignments/skill Development Activities, will be scaled down to 50 marks
CIE methods /question paper is designed to attain the different levels of Bloom’s taxonomy as per the
outcome
defined for the course.

SEE- Semester End Examination:

The SEE question paper will be set for 100 marks and the marks scored will be proportionately reduced to
50.
The question paper will have ten full questions carrying equal marks.
Each full question is for 20 marks. There will be two full questions (with a maximum of four sub-questions)
from each module.
Each full question will have a sub-question covering all the topics under a module.
The students will have to answer five full questions, selecting one full question from each module.

64
Course Title Big Data Analytics Semester III

Course Code PCS672 CIE 50

Total No. of Contact Hours 40 SEE 50
No. of Contact Hours/week 3 Total 100
Credits 3 Exam. Duration 3 Hours
Teaching Dept Computer Science and Engineering

Course objective is to:

 Understand Big Data Concepts and Analytics Lifecycle
 Learn Big Data Analytics Algorithms and Tools
 Explore Big Data Visualization Techniques and Tools
 Get Acquainted with Advanced Big Data Analytics Techniques
 Apply Big Data Concepts to Real-World Case Studies
Module-1 RBT Level: L1,L2,L3 Hours: 8
Big data: characteristics, types, sources, architectures, Data analysis process, Data analytics lifecycle,
Pre-processing data, Market and Business Drivers for Big Data Analytics, Business Problems Suited
to Big Data Analytics.
Case study: Data analytics lifecycle.
Module-2 RBT Level: L1,L2,L3 Hours: 8
Distributed and Parallel Computing for Big Data, Cloud Computing and Big Data, In-Memory
Computing Technology for Big Data, Introduction to Hadoop, HDFS, MapReduce, YARN, HBase,
Combining HDFS and HBase.
Case study: Using MapReduce to scale algorithms for Big Data analytics
Module-3 RBT Level: L1,L2,L3 Hours: 8
Hadoop ecosystem: Sqoop, Impala, Apache Flume, Pig, Hive, Data transformation and analysis using
Pig, Data analysis using Hive and Impala, Mahout, Oozie, Zookeeper etc.
Case study: Sentiment analysis
Module-4 RBT Level: L1,L2,L3 Hours: 8
Big data analytics with PySpark: Python and Apache Spark
Big data analytics with RHadoop: R and Hadoop, Text mining in RHadoop, Data mining in Hive,
Data Analysis MapReduce techniques using RHadoop.
Case study: Cloudera platform: western union bank
Module-5 RBT Level: L1,L2,L3 Hours: 8
Visualizing Big Data, Importance of data visualization, Challenges, Need for advanced visualization
techniques, Tools used in data visualization, Big Data Visualization with R/Python/Tableau/other
tools.
Case study: Industrial Big Data Visualization: A Case Study Using Flight Data Recordings
65
Suggested Learning Resources:
 Textbooks:

DT Editorial Services, “Big Data, Black Book: Covers Hadoop 2, MapReduce, Hive,
1.
YARN, Pig, R and Data Visualization”
David Dietrich, Barry Hiller, “Data Science and Big Data Analytics”, EMC education
2.
services, Wiley publications, 2012, ISBN0-07-120413-X
Mohammed Guller, “Big Data Analytics with Spark: A Practitioner's Guide to Using
3.
Spark for Large Scale Data Analysis”, ISBN-13:978-1484209653
David Loshin, “Big Data Analytics From Strategic Planning to Enterprise Integration
4.
with Tools, Techniques, NoSQL, and Graph”, Morgan Kaufmann
Reference Books:
1. Venkat Ankam, “Big Data Analytics”, Packt Publishing
Jenny Kim, Benjamin Bengfort, “Data Analytics with Hadoop”, O'Reilly Media, Inc.,
2.
ISBN: 9781491913734
Glenn J. Myatt, “Making Sense of Data: A Practical Guide to Exploratory Data
3.
Analysis and Data Mining”
Ebook Hector Cuesta and Dr Sampath Kumar, “Practical Data Analysis”, 2nd Edition
Web links and Video Lectures (e-Resources):
 https://nptel.ac.in/courses/111/104/111104120/
 https://nptel.ac.in/courses/110/106/110106064/
 https://nptel.ac.in/courses/106/104/106104189/
 https://hadoop.apache.org/
 http://spark.apache.org/
Activity-Based Learning (Suggested Activities in Class)/ Practical Based learning

The students with the help of the course teacher can take up relevant technical –activities like
presentation or demonstration of workflow/ implementation of an algorithm which will enhance their
skills. The prepared report shall be evaluated for CIE marks.

Course outcomes:
CO1 To understand the big data concepts and big data analytics lifecycle

CO2 To understand the big data analytics algorithms and tools

CO3 To understand the importance of big data visualization tools and techniques

CO4 To get acquainted with advancements in tools and techniques used for big data analytics

High-3, Medium-2, Low-1

CO-PO Mapping
CO/ PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
PO1
PO
CO1 3 2 1 2 2 1 1
CO2 3 3 2 3 3 1
CO3 2 2 3 2 3 1 1
CO4 3 2 3 3 3 1

Assessment Details (both CIE and SEE) 66

The weightage of Continuous Internal Evaluation (CIE) is 50% and for Semester End Exam (SEE) is 50%.
The minimum passing mark for the CIE is 50% of the maximum marks. Minimum passing marks in SEE is
40% of the maximum marks of SEE. A student shall be deemed to have satisfied the academic requirements
and earned the credits allotted to each subject/ course if the student secures not less than 50% (50 marks out
of 100) in the sum total of the CIE (Continuous Internal Evaluation) and SEE (Semester End Examination)
taken together.

CIE-Continuous Internal Evaluation:

Three Unit Tests each of 20 Marks
Two assignments each of 20 Marks or one Skill Development Activity of 40 marks to attain the COs and
POs The sum of three tests, two assignments/skill Development Activities, will be scaled down to 50 marks
CIE methods /question paper is designed to attain the different levels of Bloom’s taxonomy as per the
outcome
defined for the course.

SEE- Semester End Examination:

The SEE question paper will be set for 100 marks and the marks scored will be proportionately reduced to
50.
The question paper will have ten full questions carrying equal marks.
Each full question is for 20 marks. There will be two full questions (with a maximum of four sub-questions)
from each module.
Each full question will have a sub-question covering all the topics under a module.
The students will have to answer five full questions, selecting one full question from each module

67
 Object Oriented Software
Course Title Semester III
Engineering

Course Code PCS673 CIE 50

Total No. of Contact Hours 40 SEE 50
No. of Contact Hours/week 3 Total 100
Credits 3 Exam. Duration 3 Hours
Teaching Dept Computer Science and Engineering

Course objective is to:

 To understand Software Engineering approach in every aspect
 To Perform software requirements analysis
 To gain knowledge of the System Analysis and Design concepts using UML.
 To understand software testing and maintenance approaches
 To work on project management scheduling using DevOps
Module-1 RBT Level: L1,L2,L3 Hours: 8
Software Requirement: Functional and Non-functional Requirements, Known and Unknown
Requirements. Characteristics of a Good Requirement, Software Requirements Specification
Document: Nature of the SRS Document, Organization of the SRS Documents, Requirements Change
Management, Overview of Analysis, Analysis Object Models and Dynamic Models, Entity,
Boundary, and Control Objects, Structured Analysis versus Object-Oriented Analysis, Identification
of Classes: Entity Classes, Interface Classes, Control Classes, Identification of Relationships:
Association, Aggregation, Multiplicity, Composition, Dependency, Generalization, Modeling
Relationships.
Module-2 RBT Level:L1,L2,L3 Hours: 8
Object Orientation, Importance of Modeling; Object Oriented Modeling, Object oriented analysis,
Identifying the elements of an object model, Introduction to UML, Conceptual Model of UML,
Architecture, Object Oriented methodologies, Basic and Advanced Structural Modeling, Classes
Relationship, Class diagram, Advanced Relationship, Interface, Packages, Object Diagram, Basic
Behavioral Modeling, Use cases, Use Case Diagram, Interaction Diagram, Activity Diagram, State
chart Diagram
Module-3 RBT Level:L1,L2,L3 Hours:8
Interaction Diagrams, Refinement of Use Case Description, Construction of Detailed Class diagram,
Development of Detailed Design and Creation of Software Design Document, Generating Test Cases
from Use Cases, Object-Oriented Design Principles for Improving Software Quality, Commonly Used
Testing Terminology, and Deriving Test Cases from Use Cases. Frameworks and design patterns.
Module-4 RBT Level:L1,L2,L3 Hours: 8
Planning of software process, components of a software project management plan, software project
management plan frame work, planning of object-oriented projects, Need of Object-Oriented
Module-5 RBT Level: L1,L2,L3 Hours: 8
Software Estimation, Use Case Points Method: Classification of Actors and Use Cases, Calculating
Environmental Complexity Factors, Calculating Use Case Points, Object-Oriented Function Point:
Relationship between Function Points and Object Points, Counting Internal Classes, External Classes
and Services, Risk Management: What is Risk, Framework for Managing Risks, Risk Identification,
Risk Analysis and Prioritization, Risk Avoidance 68and Mitigation Strategies, Risk Monitoring
Estimating Risk Based on Schedule.
 Suggested Learning Resources:
Textbooks:
Object Oriented Software Engineering, A.A. Puntambekar ,Technical Publications
1. 2023 .

Reference Books:
Object-Oriented Software Engineering, Bernd Bruegge, Alan H Dutoit, Pearson
1.
Education, 3 rd edition,2014.
Object oriented software engineering, David C. Kung, Tata McGraw Hill 2015. “The
2.
Design and Analysis of Computer Algorithms” by Aho, Hopcroft, Ullman.
3. Object oriented software engineering, Stephan R. Schach, Tata McGraw Hill 2008.
Applying UML and Patterns, Craig Larman, Pearson Education 3rd ed, 2005.
4.
Web links and Video Lectures (e-Resources):
1. https://medium.com/javarevisited/my-favorite-courses-to-learn-object-oriented-programming-anddesign-in-
2019-197bab351733
2. https://www.youtube.com/watch?v=BqVqjJq7_vI

Activity-Based Learning (Suggested Activities in Class)/ Practical Based learning

The students with the help of the course teacher can take up relevant technical –activities like presentation or
demonstration of workflow/ implementation of an algorithm which will enhance their skills. The prepared report shall be
evaluated for CIE marks.

Course outcomes:
CO1 Study Object Oriented Software Engineering approach in every aspect of software project
CO2 Understand software domain requirements and Analyze based on constraints.

CO3 Adapt appropriate object oriented design aspects in the development process

CO4 Understand software testing and Maintenance in the development process

CO5 Gain knowledge on Project Management approaches and the use of DevOps.

High-3, Medium-2, Low-1

CO-PO Mapping
CO/ PO PO PO PO PO PO PO PO PO PO1 PO1 PO1 PSO PSO
PO 1 2 3 4 5 6 7 8 9 0 1 2 1 2
1 1 1 1- - - - 1 2
CO1
CO2 2 3 - 1 - - - 1

CO3 2 3 - - - - - 1

CO4 2 2 - - - - - 1

CO5 3 1 1 1 1

Assessment Details (both CIE and SEE)

69
The weightage of Continuous Internal Evaluation (CIE) is 50% and for Semester End Exam (SEE) is 50%.
The minimum passing mark for the CIE is 50% of the maximum marks. Minimum passing marks in SEE is
40% of the maximum marks of SEE. A student shall be deemed to have satisfied the academic requirements
and earned the credits allotted to each subject/ course if the student secures not less than 50% (50 marks out
of 100) in the sum total of the CIE (Continuous Internal Evaluation) and SEE (Semester End Examination)
taken together.
CIE-Continuous Internal Evaluation:
Three Unit Tests each of 20 Marks
Two assignments each of 20 Marks or one Skill Development Activity of 40 marks to attain the COs and
POs The sum of three tests, two assignments/skill Development Activities, will be scaled down to 50 marks
CIE methods /question paper is designed to attain the different levels of Bloom’s taxonomy as per the
outcome defined for the course.

SEE- Semester End Examination:

The SEE question paper will be set for 100 marks and the marks scored will be proportionately reduced to
50.
The question paper will have ten full questions carrying equal marks.
Each full question is for 20 marks. There will be two full questions (with a maximum of four sub-questions)
from each module.
Each full question will have a sub-question covering all the topics under a module.
The students will have to answer five full questions, selecting one full question from each module.

70
 Innovative Strategies Of
Course Title Semester III
Teaching And Learning

Course Code PCS681 CIE 50

Total No. of Contact Hours 40 SEE 50
No. of Contact Hours/week 3 Total 100
Credits 3 Exam. Duration 3 Hours
Teaching Dept Computer Science and Engineering

Course objective is to:

 Understand and Implement Effective Teaching Strategies.
 Explore and Apply Innovative Teaching Methods.
 Integrate Technology in Education.
 Implement Problem-Based and Project-Based Learning Techniques.
Module-1 RBT Level: L1,L2,L3 Hours: 8
Overview of the Teaching Learning Process, Learning Styles and Preferences, Lesson Planning and
Curriculum Design, Classroom Management.
Exercise: Presentation Preparation

Module-2 RBT Level: L1,L2,L3 Hours: 8

Introduction to Teaching Methods, Traditional Teaching Methods, Active Learning Strategies,
Student-Centered Approaches, Collaborative and Cooperative Learning, Creative and Innovative
Teaching Strategies.
Exercise: Blended Learning
Module-3 RBT Level: L1,L2,L3 Hours:8
The Role of Technology in Education, Digital Literacy and Digital Citizenship, E-Learning and
Online Learning Platforms, Interactive and Multimedia Tools, Online and Blended Learning,
Gamification and Game-Based Learning, Artificial Intelligence in Education.

Exercise: Educational Technology Exploration

Module-4 RBT Level: L1,L2,L3 Hours: 8
Problem-Based Learning, Project-Based Learning, Experiential Learning, Inquiry-based Learning,
Cloud Computing Teaching, Crossover Teaching, Micro Teaching.

Exercise: Cooperative Learning

Module-5 RBT Level: L1,L2,L3 Hours: 8
Creative Problem-Solving Techniques, Collaborative Problem-Solving, Continuous Assessment
Practices, Rubrics and Criteria-Based Assessment, Peer Assessment and Self-Assessment, Data-
Driven Decision Making.
71
Exercise: Designing a Problem-Solving Lesson with Continuous Assessment
 Suggested Learning Resources:
Textbooks:

1. "Teaching and Learning STEM: A Practical Guide" by Richard M. Felder and Rebecca Brent
Reference Books:
1. "Engineering Education: Research and Development in Curriculum and Instruction" by John Heywood.
Web links and Video Lectures (e-Resources):
 https://onlinecourses.swayam2.ac.in/cec22_ed10/preview
 https://onlinecourses.nptel.ac.in/noc20_ge21/preview
 https://iucee.org/engineering-educator-certification-iieecp/

Activity-Based Learning (Suggested Activities in Class)/ Practical Based learning

The students with the help of the course teacher can take up relevant technical –activities like
presentation, Role-Playing Scenarios and Collaborative Learning Projects which will enhance their
skills. The prepared report shall be evaluated for CIE marks.

Course outcomes:
CO1 Analyze and critique theoretical frameworks of innovation in education.

CO2 Design and implement creative and effective instructional strategies.

CO3 Employ technology and digital tools to enhance learning experiences.

CO4 Utilize innovative approaches to increase student engagement and motivation.

CO5 Evaluate the effectiveness of innovative teaching methods through various assessment tools.

CO-PO Mapping
CO/PO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
3 3 3 3 3 2 2 2 2
CO1
CO2 3 3 3 3 3 1 1 1

CO3 3 3 2 2 2 1 1 1

CO4 2 2 2 2 2 1 1

CO5 2 2 2 2 1 2 1 1

High-3, Medium-2, Low-1

Assessment Details (both CIE and SEE)
The weightage of Continuous Internal Evaluation (CIE) is 50% and for Semester End Exam (SEE) is 50%.
The minimum passing mark for the CIE is 50% of the maximum marks. Minimum passing marks in SEE is
40% of the maximum marks of SEE. A student shall be deemed to have satisfied the academic requirements
and earned the credits allotted to each subject/ course if the student secures not less than 50% (50 marks out
of 100) in the sum total of the CIE (Continuous Internal Evaluation) and SEE (Semester End Examination)
taken together. 72
CIE-Continuous Internal Evaluation:
Three Unit Tests each of 20 Marks
Two assignments each of 20 Marks or one Skill Development Activity of 40 marks to attain the COs and
POs The sum of three tests, two assignments/skill Development Activities, will be scaled down to 50 marks
CIE methods /question paper is designed to attain the different levels of Bloom’s taxonomy as per the
outcome
defined for the course.

SEE- Semester End Examination:

The SEE question paper will be set for 100 marks and the marks scored will be proportionately reduced to
50.
The question paper will have ten full questions carrying equal marks.
Each full question is for 20 marks. There will be two full questions (with a maximum of four sub-questions)
from each module.
Each full question will have a sub-question covering all the topics under a module.
The students will have to answer five full questions, selecting one full question from each module.

73
 Open Source Software
Course Title Semester III
Engineering

Course Code PCS682 CIE 50

Total No. of Contact Hours 40 SEE 50
No. of Contact Hours/week 3 Total 100
Credits 3 Exam. Duration 3 Hours
Teaching Dept Computer Science and Engineering

Course objective is to:

 To provide an understanding of the development models and tools used in open source
software engineering.
 To familiarize students with the various open source licenses and their compliance
requirements.
 To introduce quality assurance practices and tools used in open source software projects.
 To teach students about the security measures necessary in open source software projects.
 To enable students to manage open source software projects effectively.
Module-1 RBT Level: L2,L3 Hours: 8

OPEN SOURCE DEVELOPMENT MODELS: Cathedral and Bazaar Model, Open Source Project
Structure, Governance Models, Development Workflow, Open Source Contribution Process, Version
Control Systems (Git), Bug Tracking Systems, Communication Tools and Platforms, Documentation
in Open Source Projects.
Text Book 1: Ch 2, 3
Module-2 RBT Level: L1,L3,L4 Hours: 8
OPEN SOURCE LICENSES: Categories of Open Source Licenses, Popular Open Source Licenses
(GPL, MIT, Apache, BSD), License Compatibility and Conflicts, Intellectual Property Rights, Legal
Implications of Using Open Source Software, Compliance and Risk Management, Open Source
License Management Tools.
Text Book 1: Ch 4
Module-3 RBT Level: L2,L3,L4 Hours: 8
QUALITY ASSURANCE IN OPEN SOURCE SOFTWARE: Importance of Quality Assurance,
Testing in Open Source Projects, Types of Testing (Unit, Integration, System, Acceptance), Test
Automation Tools (Selenium, JUnit), Continuous Integration and Continuous Deployment (CI/CD) in
Open Source, Code Review Practices, Static Analysis Tools, Metrics and Measurement in Open
Source Projects, Advanced Git Techniques (Branching Strategies, Merging, Rebasing, Git
Workflows).
Text Book 2: Ch 5,6
Module-4 RBT Level: L2,L3,L4 Hours: 8
SECURITY IN OPEN SOURCE SOFTWARE: Common Security Issues in Open Source Software,
Secure Coding Practices, Security Testing Tools, Vulnerability Management, Patch Management,
74 and Best Practices in Open Source Projects.
Encryption and Secure Communication, Security Policies
Text Book 1: Ch:5
 Module-5 RBT Level: L2,L3,L5 Hours: 8
MANAGING OPEN SOURCE SOFTWARE PROJECTS: Project Planning and Scheduling,
Resource Management, Community Management and Engagement, Collaboration and Coordination,
Conflict Resolution, Financial and Funding Models, Sustainability of Open Source Projects, Case
Studies of Successful Open Source Projects, Git in Project Management (Repository Management,
Collaborative Development, Pull Requests, Issue Tracking with Git).
Text Book 1: Ch:7,8

Suggested Learning Resources:

Textbooks:

1. "Open Source Software: Implementation and Management" by Paul Kavanagh

"Producing Open Source Software: How to Run a Successful Free Software Project"
2.
by Karl Fogel
Reference Books:
"The Cathedral & the Bazaar: Musings on Linux and Open Source by an Accidental
1.
Revolutionary" by Eric S. Raymond
Web links and Video Lectures (e-Resources):
 Coursera: Open Source Software Development Methods.
 GitHub Learning Lab.
 Mozilla Open Source Student Network
Activity-Based Learning (Suggested Activities in Class)/ Practical Based learning

The students with the help of the course teacher can take up relevant technical –activities which will
enhance their skill.

Course outcomes:
CO1 Describe the development models and tools used in open source software engineering
CO2 Understand and apply the various open source licenses and their compliance requirements
Explain and implement quality assurance practices and tools used in open source software
CO3 projects

CO4 Identify and implement security measures in open source software (L2 - Understand,
Demonstrate the management of open source software projects, including the use of Git for
CO5 project management

High-3, Medium-2, Low-1

CO-PO Mapping

CO/PO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 3 2 1 1 3 1 1 1

CO2 3 2 2 3 2 1 1 1

CO3 3 3 3 3 3 1 1 1

CO4 3 3 3 2 3 1 1 1

CO5 3 3 3 2 3 1 1 1
75
Assessment Details (both CIE and SEE)
The weightage of Continuous Internal Evaluation (CIE) is 50% and for Semester End Exam (SEE) is 50%.
The minimum passing mark for the CIE is 50% of the maximum marks. Minimum passing marks in SEE is
40% of the maximum marks of SEE. A student shall be deemed to have satisfied the academic requirements
and earned the credits allotted to each subject/ course if the student secures not less than 50% (50 marks out
of 100) in the sum total of the CIE (Continuous Internal Evaluation) and SEE (Semester End Examination)
taken together.
CIE-Continuous Internal Evaluation:
Three Unit Tests each of 20 Marks
Two assignments each of 20 Marks or one Skill Development Activity of 40 marks to attain the COs and
POs The sum of three tests, two assignments/skill Development Activities, will be scaled down to 50 marks
CIE methods /question paper is designed to attain the different levels of Bloom’s taxonomy as per the
outcome
defined for the course.

SEE- Semester End Examination:

The SEE question paper will be set for 100 marks and the marks scored will be proportionately reduced to
50.
The question paper will have ten full questions carrying equal marks.
Each full question is for 20 marks. There will be two full questions (with a maximum of four sub-questions)
from each module.
Each full question will have a sub-question covering all the topics under a module.
The students will have to answer five full questions, selecting one full question from each module.

76
Course Title User Experience Design Semester III

Course Code PCS683 CIE 50

Total No. of Contact Hours 40 SEE 50
No. of Contact Hours/week 3 Total 100
Exam.
Credits 3 3 Hours
Duration
Teaching Dept Computer Science and Engineering

Course objective is to:

 To understand the fundamentals of UX design.
 To gain proficiency in user research methodologies.
 To learn how to create effective interaction designs and information architectures.
 To develop skills in prototyping and usability testing.
 To apply UX principles to real-world projects.
Module-1 RBT Level: L1,L2,L3 Hours: 8
Introduction to UX Design: Overview of UX Design: Introduction to UX Design, Difference between
UX and UI, Importance of UX in product development.
Design Thinking Process: Understanding Design Thinking, Phases of Design Thinking.
Hands on: Evaluate the UX of existing products, Design Thinking workshop.
Module-2 RBT Level: L1,L2,L3 Hours: 8
User Research: Understanding Users: User Personas and User Journey Maps, Empathy Mapping.
User Research Technique: Qualitative and Quantitative Research Method, Interviews, Surveys, and
Observations.
Interactive Session: Create user personas and journey maps, conduct user research for a given project.
Module-3 RBT Level: L1,L2,L3 Hours: 8
Information Architecture & Interaction Design: Information Architecture: Principles of Information
Architecture, Card Sorting and Site Mapping.
Interaction Design: Basics of Interaction Design, Designing for Different Devices.
Interactive Session: Create a sitemap for a given project, Create wireframes and interactive prototypes
Module-4 RBT Level: L1,L2,L3 Hours: 8
Visual Design & Prototyping: Visual Design Principles: Typography, Color Theory, and Layout,
Accessibility in Design.
Prototyping: Low-fidelity vs. High-fidelity Prototypes, Tools for Prototyping (e.g., Sketch, Figma,
Adobe XD).

77
Interactive Session: Redesign a webpage with a focus on visual design, develop and high-fidelity
 prototypes using Figma or Adobe XD
Module-5 RBT Level: L1,L2,L3 Hours: 8
Usability Testing, Evaluation and Advanced UX Topics: Usability Testing: Importance of Usability
Testing, Planning and Conducting Usability Tests, Metrics and KPIs for UX,
Analyzing and Reporting Usability Test Results
Advanced UX Topics: UX for Emerging Technologies (AR/VR, AI), Inclusive Design and
Accessibility.
Interactive Session: Conduct usability testing sessions, analyze usability test results and present
findings, Design a UX solution for an emerging technology.

Suggested Learning Resources:

Textbooks:

1. The Basics of User Experience Design”-By Interaction Design Foundation

2. "The Design of Everyday Things" by Don Norman
“Think Like a UX Researcher” by David Travis Philip Hodgson-© 2019 by Taylor &
3.
Francis Group, LLC
Reference Books:
"Don’t Make Me Think, Revisited: A Common-Sense Approach to Web Usability" by
1.
Steve Krug
“UX Research: Practical Techniques for Designing Better Products" by Brad
2.
Nunnally and David Farkas
Web links and Video Lectures (e-Resources):
 https://www.amazon.com/Dont-Make-Think-Revisited-Usability/dp/0321965515/
 https://www.amazon.com/Design-Everyday-Things-Revised-Expanded/dp/0465050654/
 https://www.interaction-design.org/literature/topics/ux-design
 https://www.hotjar.com/ux-design/
 https://www.visily.ai/blog/what-is-ux-design/
Activity-Based Learning (Suggested Activities in Class)/ Practical Based learning
 Redesign a website or App, create a Mobile App Prototype, Conduct User Research are the few
skill development activities.
 The students with the help of the course teacher can also take up relevant technical –activities
which will enhance their skill. The prepared report shall be evaluated for CIE marks.

Course outcomes:
CO1 Understand the definition and principles of UX Design in order to design with intention
Achieve a deep understanding of the entire life cycle of design—the process, purpose, and
CO2 tools

CO3 Discover the industry-standard tools and specific project deliverables in UX.

CO4 Explain why you made design decisions, through presentations of assignments

CO-PO Mapping
PO PO2 PO3 PO4 PO PO6 PO7 PO8 PO9 PO10 PO1 PO12 PSO1 PSO2
CO/PO
1 5 1
2 2 2
CO1
CO2 3 2
78
 CO3 2 3

CO4 3 2

High-3, Medium-2, Low-1

Assessment Details (both CIE and SEE)

The weightage of Continuous Internal Evaluation (CIE) is 50% and for Semester End Exam (SEE) is 50%.
The minimum passing mark for the CIE is 50% of the maximum marks. Minimum passing marks in SEE is
40% of the maximum marks of SEE. A student shall be deemed to have satisfied the academic requirements
and earned the credits allotted to each subject/ course if the student secures not less than 50% (50 marks out
of 100) in the sum total of the CIE (Continuous Internal Evaluation) and SEE (Semester End Examination)
taken together.
CIE-Continuous Internal Evaluation:
Three Unit Tests each of 20 Marks
Two assignments each of 20 Marks or one Skill Development Activity of 40 marks to attain the COs and
POs The sum of three tests, two assignments/skill Development Activities, will be scaled down to 50 marks
CIE methods /question paper is designed to attain the different levels of Bloom’s taxonomy as per the
outcome
defined for the course.

SEE- Semester End Examination:

The SEE question paper will be set for 100 marks and the marks scored will be proportionately reduced to
50.
The question paper will have ten full questions carrying equal marks.
Each full question is for 20 marks. There will be two full questions (with a maximum of four sub-questions)
from each module.
Each full question will have a sub-question covering all the topics under a module.
The students will have to answer five full questions, selecting one full question from each module.

79
 Software Engineering in
Course Title Semester III
Practice

Course Code PCS602 CIE 50

Total No. of Contact Hours 30 SEE 50
No. of Contact Hours/week 3 Total 100
Credits 2 Exam. Duration 3 Hours
Teaching Dept Computer Science and Engineering

Course objective is to:

 Understand the software development lifecycle and methodologies.
 Develop skills in software project management.
 Gain proficiency in software design and architectural patterns.
 Learn techniques for software testing and quality assurance.
 Apply best practices in software maintenance and documentation.
 Work effectively in teams to develop software projects.
SL. NO EXPERIMENTS HOURS COS
Version Control with Git
1. Install Git and set up a GitHub account.
2. Initialize a Git repository.
1. 3. Perform basic Git operations: add, commit, Hours :2 COs: 2
push, pull, clone.
4. Branching and merging.
5. Resolve merge conflicts.
2. Requirements Gathering and Analysis Hours :2 COs: 1

Objective: Understand the process of gathering and

analyzing requirements.

Activities:

 Conduct an interview with a mock client to gather

requirements.
 Document functional and non-functional
requirements.
 Create a requirements specification document.
 Use case diagrams and descriptions.
80
Deliverables: Submit the requirements specification
 document and use case diagrams.

UML Modeling

Objective: Create UML diagrams to model software

systems.

Activities:

3.  Install a UML modeling tool (e.g., StarUML, Hours :2 COs: 4

Lucidchart).
 Create class diagrams for a given case study.
 Create sequence diagrams for key use cases.
 Create activity diagrams to model workflows.

Deliverables: Submit the UML diagrams as PDF files.

Continuous Integration and Deployment
Objective: Implement CI/CD for a project.
Activities:

 Set up a CI/CD pipeline using a tool like Jenkins or

GitHub Actions.
4.  Configure automated builds and tests. Hours :2 COs: 4
 Implement automated deployment to a staging
environment.
 Monitor the pipeline and fix any issues.

Deliverables: Submit the pipeline configuration files and a

report on the CI/CD process.
Unit Testing with CUnit
Objective: Write unit tests for a C program using CUnit.
Activities:

 Install CUnit.
5.  Write unit tests for basic arithmetic functions (add, Hours :2 COs: 5
subtract, multiply, divide).
 Execute tests and generate a report.
 Interpret test results and improve code quality.

Deliverables: Submit the C code, test cases, and a test

report.
6. Integration Testing Hours :2 COs: 3
Objective: Perform integration testing on a simple
system.
Activities:
81
Develop individual modules for a simple banking
 application.
Write integration tests to verify module
interactions.
Execute tests and log results.
Debug and fix any integration issues found.

Deliverables: Submit the integration test cases and test

results.
Web Application Development
Objective: Develop a basic web application.
Activities:

Set up a web development environment (e.g.,

Node.js, Express, React).
7. Implement a simple web application with user Hours :2 COs: 5
authentication and CRUD operations.
Deploy the web application to a cloud platform
(e.g., Heroku, AWS).

Deliverables: Submit the code repository and a link to the

deployed application.
Agile Methodologies and Scrum
Objective: Understand Agile methodologies and practice
Scrum.
Activities:

8.  Participate in a Scrum simulation. Hours :2 COs: 1,2

 Create user stories and a product backlog.
 Plan sprints and conduct sprint reviews.
 Reflect on the Agile process and its benefits.

Deliverables: Submit a report on the Scrum simulation

and your reflections on the process
Software Maintenance and Refactoring
Objective: Practice software maintenance and refactoring.
Activities:

Identify code smells in a given codebase.

9. Refactor the code to improve readability and Hours :2 COs: 4,5
maintainability.
Ensure that the refactored code passes all tests.
Document the changes made.

Deliverables: Submit the original and refactored code,

along with a report on the refactoring process.
82
 Final Project

Objective: Apply all the skills learned in a comprehensive

project.

Activities:

1. Form teams and choose a project topic.

10. 2. Gather requirements, design the system, and create Hours :3 COs:1,2,3,4,5
UML diagrams.
3. Develop the application, following best practices
in coding, testing, and documentation.
4. Implement CI/CD and deploy the application.
5. Present the project to the class.

Deliverables: Submit the project code, documentation,

and a video presentation.

Suggested Learning Resources:

Textbooks/Reference Books:

1. Sommerville, I. (2011). Software Engineering (9th ed.). Pearson.

Pressman, R. S. (2014). Software Engineering: A Practitioner's Approach (8th ed.).

2.
McGraw-Hill.
Web links and Video Lectures (e-Resources):
 Git Documentation: https://git-scm.com/doc
 CUnit Documentation: http://cunit.sourceforge.net/
 Agile Manifesto: https://agilemanifesto.org/
Activity-Based Learning (Suggested Activities in Class)/ Practical Based learning:

The students with the help of the course teacher can also take up relevant technical –activities which
will enhance their skill. The prepared report shall be evaluated for CIE marks. The skills can be
project presention/paper publication for the respective project done.

Course outcomes:
CO1 Understand Software Development Lifecycle

CO2 Apply Software Engineering Principles

CO3 Utilize Version Control Systems

CO4 Model Software Systems
CO5 Develop and Test Software Applications
CO-PO Mapping
CO/ PO PO PO PO PO PO PO PO PO PO1 PO PO1 PSO PSO2
PO 1 2 3 4 5 6 7 8 9 0 11 2 1
CO1 2 3 2 1 1 1 1
CO2 2 3 3 2 2 1 1
83
CO3 1 2 2 1 3 1 1
CO4 1 2 3 2 3 1 1
CO5 2 3 3 3 3 1 1
High-3, Medium-2, Low-1
Assessment Details (both CIE and SEE)
The weightage of Continuous Internal Evaluation (CIE) is 50% and for Semester End Exam (SEE) is 50%.
The minimum passing mark for the CIE is 50% of the maximum marks. Minimum passing marks in SEE is
40% of the maximum marks of SEE. A student shall be deemed to have satisfied the academic requirements
and earned the credits allotted to each subject/ course if the student secures not less than 50% (50 marks out
of 100) in the sum total of the CIE (Continuous Internal Evaluation) and SEE (Semester End Examination)
taken together.

CIE-Continuous Internal Evaluation:

One Unit Tests of 20 Marks.
Lab conduction 20 Marks and Record of 10 Marks. The sum of these three will be sumed up to 50 marks
CIE methods /question paper is designed to attain the different levels of Bloom’s taxonomy as per the
outcome defined for the course.

SEE- Semester End Examination:

The SEE question paper will be set for 100 marks and the marks scored will be for 100 Marks
The question paper will have one Program carrying 100 marks.
Each program is for 100 marks. The writing program will be for 20 Marks and conduction of program which
consists of execution of program 60 and viva -voice for 20 Marks.
The students will have to write the program and execute the selected program given from the list of
programs.

84