Semester IV Credits: 25

CWA ASSIGN Total

Course ATT MTE MENT / ESE
SN CC Course Title L T P CR /PWA Marks
Code VIVA
10 50/4
5 15 20 100
0

THEORY

Artificial Intelligence and

1 BTCS202T MCS 3 0 0 3 5 15 20 10 50 100
Machine Learning

2 BTCS208T MCS Data Structure II 3 0 0 3 5 15 20 10 50 100

Software Engineering and

3 BTCS206T MCS 3 0 0 3 5 15 20 10 50 100
Project Management
Department Specific Elective
4 BTCSDxxxT DSE 3 0 0 3 5 15 20 10 50 100
(DSE)-IV

5 UVC009 VAC Open Source AI Tools 2 0 0 2 5 15 20 10 50 100

6 UVCxxxT VAC Career Advancement Module 1 0 0 1 5 15 20 10 50 100

7 OXXxxxxT OE Open Elective -I 3 0 0 3 5 15 20 10 50 100

PRACTICALS

Artificial Intelligence and

8 BTCS202P MCS 0 0 2 1 10 20 20 10 40 100
Machine Learning Lab

9 BTCS208P MCS Data Structure II Lab 0 0 2 1 10 20 20 10 40 100

10 UAC007P AEC Mongo DB Atlus 0 0 2 1 10 20 20 10 40 100

Problem Solving Using AI/
11 SECS04 SEC ML and Project Building and 0 0 6 3 10 20 20 10 40 100
Career Preparation

12 BTCS004P PR Project IV 0 0 2 1 10 20 20 10 40 100

TOTAL 18 0 14 25 1200

*SEC (Skill Enhancement Courses) will be evaluated by the T & P cell based on Assignments/ Tutorials/Mock
Interviews.

19
 Artificial Intelligence and Machine Learning

L T P
Course Code: BTCS202T Credit: 3
3 0 0
Prerequisite Understanding of Basic Programming Concept and Mathematics
(probability and statistics).

To empower students with the theoretical foundations, practical

skills, and ethical considerations necessary to design, develop,
Course Objective
and deploy artificial intelligence and machine learning solutions
across various domains, fostering innovation and problem-solving
capabilities.

COURSE OUTCOMES

Bloom’s
S No. Course Outcomes
Level
List various approaches of artificial intelligence (AI) and machine BL1
CO1 learning (ML).

Understand the need for artificial intelligence and describe machine

BL2
CO2 learning algorithms to solve real-world problems.

Design, development, and Implementation of various AI and ML

CO3 methods for prediction, regression, classification, clustering, and BL3
decision-making, problems.

Demonstration of idea behind selection of appropriate AI as well as ML

BL4
CO4 methods for solving different real-world data-driven problems.

Apply learning techniques to solve real world & artificial intelligence

BL5
CO5 and machine learning problems.

89
Detailed Syllabus

Unit Contact
Contents
No. Hours
Introduction to Artificial Intelligence (AI), Machine Learning (ML) and Deep
Learning (DL), Applications & limitations of AI, ML & DL, or need for
I applying ML algorithms, Types of Machine Learning and their use cases,
8
Types of problem – Regression and Classification, Types of data – Structured
Data and Unstructured Data. Batch and online learning. Introduction of tools
required for machine learning- Python Libraries, Framework for machine
learning algorithm, Popular ML Datasets & Data repositories.
Algorithms for Heuristic search and State space search, Defining problem as
state space search, Production Systems, Production System Characteristics
II 8
and issues in the design of search programs, Additional problems.
Generate-and-test, Hill climbing, Best-first
search, Depth-first search, Problem, Constraint satisfaction.
Basic concept of Probability theory and Linear Algebra, Bias, Variance,
Bias-Variance trade-off, overfitting and underfitting. Data Sampling strategy,
III 8
Importance of cross validation – Holdout Method and K-fold cross validation.
Introduction to performance metrics for Machine Learning Algorithm,
Confusion Matrix, Curse of dimensionality. Data visualization using different
open-source python libraries.
Dimensionality Reduction & Feature Selection Methods, Fine tuning methods
– Grid Search, Randomized Search, Ensemble Methods – Bagging &
IV
Boosting Concept. 8
Introduction to regression and classification problems, Types of Linear
Regression, Introduction, Gradient Descent Algorithm, K Nearest Neighbors
(KNN), Support Vector Machines (SVM), Decision Tree (DT).
Introduction to classification problems and Types of classification - Binary
Classification, Multi-Class Classification, Imbalanced Classification.
V Introduction to Clustering – K- means, Hierarchical, DBSCAN, Introduction 8
to reinforcement learning and types - Model- Free and Model-Based RL.
Project Task - End-to-End Machine learning Model Development.

90
MAPPING OF COURSE OUTCOMES WITH PROGRAM OUTCOMES

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

CO1 2 3 2 1

CO2 3 2 2 2

CO3 3 3 1

CO4 3 2 1 1

CO5 2 3 2 1

SUGGESTED BOOKS AND READING MATERIAL

Text Books

1 Artificial Intelligence: A Modern Approach by Stuart Russell and Peter Norvig

2 Pattern Recognition and Machine Learning by Christopher M. Bishop
3 Shalev-Shwartz, Shai, and Shai Ben-David, Understanding machine learning: From
theory to algorithms (3 ed.), Cambridge university press

Reference Books:

1 Nils J. Nilsson, Artificial Intelligence: A New Synthesis (1 ed.), Morgan-Kaufmann

2 Machine Learning: A Probabilistic Perspective by Kevin P. Murphy
3 Hands-On Machine Learning with Scikit-Learn, Keras, and TensorFlow by Aurélien Géron

91
 Artificial Intelligence and Machine Learning Lab

L T P
Course Code: BTCS202P Credit: 1
0 0 2
Prerequisite Understanding of Basic Programming Concept and Mathematics
(probability and statistics).

To empower students with the theoretical foundations, practical

Course Objective skills, and ethical considerations necessary to design, develop,
and deploy artificial intelligence and machine learning solutions
across various domains, fostering innovation and problem-solving
capabilities.

COURSE OUTCOMES

Bloom’s
S No. Course Outcomes
Level
List various approaches of artificial intelligence (AI) and machine BL1
CO1 learning (ML).

Understand the need for artificial intelligence and describe machine

BL2
CO2 learning algorithms to solve real-world problems.

Design, development, and Implementation of various AI and ML

CO3 methods for prediction, regression, classification, clustering, and BL3
decision-making problems.
Demonstration of idea behind selection of appropriate AI as well as ML
BL4
CO4 methods for solving different real-world data-driven problems.

Apply learning techniques to solve real world & artificial intelligence

BL5
CO5 and machine learning problems.

92
Detailed Syllabus

Unit Contact
Contents
No. Hours
1. Installation of essential Python libraries (NumPy, Pandas, Matplotlib,
Scikit-learn), Demonstration of various ML frameworks and their 2
configuration settings (Anaconda, Jupyter Notebook, VS Code)

2. Demonstration of Basic ML development Components using Python. (Loading

2
Dataset, Perform Exploratory Data Analysis (EDA) and Data Visualization).

3.
Implementation of a simple linear regression model using a dataset 2

4.
Implementation of K-Nearest Neighbor (KNN) models. 2

5.
Implementation of SVM-based classification models. 2

6.
Implementation of K-means clustering algorithms with result visualization. 2

7. Write a program to calculate and interpret confusion matrix, accuracy,

2
precision, recall, F1-score using visualization.

8. Implementation of Feature Selection & Hyperparameter Tuning using an

2
open-source dataset.
9. Implementation and comparison of different tree-based ML models (DT, ET,
2
RF) using any public dataset.

10.
Demonstration End-to-End ML model development project by students. 2

93
MAPPING OF COURSE OUTCOMES WITH PROGRAM OUTCOMES

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

CO1
3 2 2 1 3 1 1 1 2 1 1 3
CO2
3 2 2 1 3 1 1 1 2 1 1 3
CO3
3 3 3 2 3 1 1 1 3 2 2 3
CO4
3 3 3 2 3 1 1 1 3 2 2 3
CO5
3 3 3 2 3 1 1 1 3 2 2 3

SUGGESTED BOOKS AND READING MATERIAL

Text Books

1 Fluent Python: Clear, Concise, and Effective Programming" by Luciano Ramalho

(2nd Edition, 2019)
2 Python 3 Object-Oriented Programming" by Dusty Phillips (3rd Edition, 2018)
3 Python for Data Analysis" by Wes McKinney (2nd Edition, 2017)

Reference Books:

1 Python Cookbook" by David Beazley and Brian K. Jones (3rd Edition, 2013)
2 Python Crash Course" by Eric Matthes (2nd Edition, 2019)
3 Automate the Boring Stuff with Python" by Al Sweigart (2nd Edition, 2019).

94
 Data Structure II

L T P
Course Code: BTCS208T Credit: 3
3 0 0
Prerequisite Basic understanding of data structures such as arrays, stacks,
queues, linked lists, trees, and graphs, as well as knowledge of
algorithm design and analysis, including sorting, searching, and
recursion.

To equip students with in-depth knowledge of advanced data

structures and algorithms, enabling them to analyze complex
Course Objective
problems, design efficient solutions, and apply these concepts in
real-world and computational applications.

COURSE OUTCOMES

Bloom’s
S No. Course Outcomes
Level
Understand and analyze the performance of algorithms using time and
space complexity, and solve recurrence relations. BL- 2&4
CO1

BL-3&5
CO2 Apply and evaluate advanced tree structures like B+ Tree, Threaded
Trees, and Red-Black Trees.

BL-3&4
Apply various graph algorithms like DFS, BFS, shortest path, spanning
CO3
trees, topological sorting, and network flow algorithms.

BL-3&4
Solve optimization problems using greedy strategies and understand
CO4
their real-life applications.

Implement dynamic programming and backtracking techniques for BL-3&6

CO5 classical problems like 0/1 knapsack, LCS, and graph coloring.

95
Detailed Syllabus

Unit Contact
Contents
No. Hours
Review of Data Structures, Program Performance: Time and space, 9
complexity, asymptotic notation, complexity, analysis, recurrence equations
I and their solution. Advanced Trees: B+ Tree, Threaded binary trees, Red
black tree.
Graph Algorithms: Depth First Search, Breadth First Search, Minimum cost 9
spanning trees: Kruskal’s and Prim’s; Single source shortest paths (SSSP):
II Bellman ford, SSSP using DAG & Dijkstra’s algorithm; all pairs shortest
path: Floyd Warshall algorithm; Topological sorting; bipartite graphs;
Network flow problem: Ford-Fulkerson Max Flow algorithm

Greedy Method, and its applications, fractional knapsack problem, activity 8

selection problem, Huffman codes, job sequencing problem.
III

Dynamic Programming and its performance analysis, optimal binary search 9

IV trees, Longest Common Subsequence, Matrix chain multiplication,
Travelling salesman problem, 0/1 knapsack problem; Concept of
backtracking, n-queen’s problem, graph coloring, Hamiltonian cycles
P and NP-classes, NP- Complete problems, NP-hard problems, Reduction; 9
String Matching Algorithms: naïve string matching, Rabin-Karp algorithm,
V Knuth-Morris-Pratt algorithm; Approximation Algorithms: Vertex cover
problem, Set covering problem, Subset sum problem

96
MAPPING OF COURSE OUTCOMES WITH PROGRAM OUTCOMES

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

SUGGESTED BOOKS AND READING MATERIAL

Text Books

1 "Introduction to Algorithms" by Cormen et al.

2 "Data Structures and Algorithm Analysis in C++" by Mark Allen Weiss
3 "Algorithm Design" by Jon Kleinberg and Éva Tardos

Reference Books:

1 "Algorithms" by Robert Sedgewick and Kevin Wayne

2 "The Design and Analysis of Computer Algorithms" by Aho, Hopcroft, and Ullman
3 "Advanced Data Structures" by Peter Brass

97
 Data Structure II Lab

L T P
Course Code: BTCS208P Credit: 1
0 0 2
Prerequisite Basic understanding of data structures such as arrays, stacks,
queues, linked lists, trees, and graphs, as well as knowledge of
algorithm design and analysis, including sorting, searching, and
recursion.

To equip students with in-depth knowledge of advanced data

structures and algorithms, enabling them to analyze complex
Course Objective
problems, design efficient solutions, and apply these concepts in
real-world and computational applications.

COURSE OUTCOMES

Bloom’s
S No. Course Outcomes
Level
Understand and analyze the performance of algorithms using time and
space complexity, and solve recurrence relations. BL- 2&4
CO1

BL-3&5
CO2 Apply and evaluate advanced tree structures like B+ Tree, Threaded
Trees, and Red-Black Trees.

BL-3&4
Apply various graph algorithms like DFS, BFS, shortest path, spanning
CO3
trees, topological sorting, and network flow algorithms.

BL-3&4
Solve optimization problems using greedy strategies and understand
CO4
their real-life applications.

Implement dynamic programming and backtracking techniques for BL-3&6

CO5 classical problems like 0/1 knapsack, LCS, and graph coloring.

98
Detailed Syllabus

Unit Contact
Contents
No. Hours
1 Analyze time and space complexity of basic recursive and iterative algorithms. 2

a. Implement recursive and iterative Fibonacci.

b. Analyze merge sort and quick sort for time complexity using input of various
sizes.

2 Solve and implement recursive algorithms and analyze recurrence relations. 2

a. Implement binary search recursively and solve its recurrence.

b. Derive and plot time complexity of Tower of Hanoi.

3 2
Implement and analyze advanced tree data structures.

a. Implement a B+ Tree with insert and search operations.

b. Implement Red-Black Tree with insert and delete.
c. Implement Threaded Binary Tree with in-order traversal.

4 2
Implement graph representations and traversals.

a. Represent a graph using adjacency list and matrix.

b. Implement DFS and BFS.
c. Implement topological sort for a DAG.

5 2
Apply graph algorithms for shortest path and MST.

a. Implement Kruskal’s and Prim’s algorithms for MST.

b. Implement Dijkstra’s and Bellman-Ford algorithms for SSSP.
c. Implement Floyd-Warshall for APSP.

6 2
Understand flow networks and bipartite graph checking.

a. Implement Ford-Fulkerson algorithm for Max Flow.

b. Check whether a graph is bipartite using BFS.

99
7 2
Solve optimization problems using greedy methods.

a. Implement fractional knapsack using greedy approach.

b. Implement job sequencing with deadlines.
c. Implement Huffman coding.

8 2
Apply dynamic programming to classical problems.

a. Implement Longest Common Subsequence (LCS).

b. Implement 0/1 Knapsack problem.
c. Implement Matrix Chain Multiplication.
9 2
Solve constraint satisfaction problems using backtracking.

a. Solve the N-Queens problem.

b. Solve the Graph Coloring problem.
c. Find all Hamiltonian cycles in a graph

10 2
Understand intractable problems and approximation techniques.

a. Implement Naive, Rabin-Karp, and KMP string matching algorithms.

b. Implement Approximation algorithm for Vertex Cover and Set Cover.
c. Write a program to demonstrate subset sum approximation.

100
MAPPING OF COURSE OUTCOMES WITH PROGRAM OUTCOMES

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

SUGGESTED BOOKS AND READING MATERIAL

Text Books

1 "Introduction to Algorithms" by Cormen et al.

2 "Data Structures and Algorithm Analysis in C++" by Mark Allen Weiss
3 "Algorithm Design" by Jon Kleinberg and Éva Tardos

Reference Books:

1 "Algorithms" by Robert Sedgewick and Kevin Wayne

2 "The Design and Analysis of Computer Algorithms" by Aho, Hopcroft, and Ullman
3 "Advanced Data Structures" by Peter Brass

101
 Software Engineering and Project Management

L T P
Course Code: BTCS206T Credit: 3
3 0 0
Prerequisite None

To provide students with comprehensive knowledge and practical

skills in software engineering principles, methodologies, and
Course Objective project management techniques to effectively develop and manage
software projects within specified constraints and quality
standards.

COURSE OUTCOMES

Bloom’s
S No. Course Outcomes
Level

To understand the principles of software engineering. BL-2

CO1

To understand the principles of Software Architecture and Design BL-2

CO2

To understand the principles of Essence of Modern Software BL-2

CO3
Engineering

To understand the concepts of Software Testing BL-2

CO4

To understand the principles of Software Project Management BL-2

CO5

102
Detailed Syllabus

Unit Contact
Contents
No. Hours
Introduction of Software Engineering: Need for software engineering,
Software quality attributes, Software product pipelines, Software life cycle 9
I
models and processes, Requirement engineering using UML Diagrams.

Software Architecture and Design: Design principles, Design Patterns,

6
II Architecture Versus Design, Modularity, Software Components and
Connectors, Architecture Styles.
Essence of Modern Software Engineering: Software engineering essence,
Essence language, Essence kernel, Using essence kernel in agile development
III 13
practices, Agile Principles, Agile process models through essence kernel,
Large scale complex development Using kernel.
Software Testing: Quality metrics, Coding style and Static analysis tools,
7
IV Verification and validation, Various testing techniques and Test case
generations.
Software Project Management: Software versioning and Continuous
integration, Project management and Risk analysis, Configuration 7
V
management,
Cost analysis and estimation.

103
MAPPING OF COURSE OUTCOMES WITH PROGRAM OUTCOMES

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

CO1
3 2 2 1 1
CO2
3 1 1 2 1 1
CO3
2 2 2 1
CO4
2 1 1 1 2
CO5
2 2 2 1 3

SUGGESTED BOOKS AND READING MATERIAL

Text Books

1 R.S. PRESSMAN, B.R. MAXIM (2019), Software Engineering: A Practitioner’s

Approach, McGraw-Hill India, 2019, 9th Edition.
2 Mark Richards, Neal Ford (2020), Fundamentals of Software Architecture, O'Reilly Media,
Inc.
3 L. BASS, P. CLEMENTS, R. KAZMAN (2012), Software Architecture in Practice,
Pearson, 3rd Edition.

Reference Books:

1 JACOBSON, H. LAWSON, P.W. NG, P.E. McMAHON, M. GOEDICKE (2019), The

Essentials of Modern Software Engineering, ACM Books.
2 Software Engineering, A Precise Approach: Pankaj Jalote, Wiley India-2010
3 Software Project Management : Saikat Dutt /S. Chandramouli, Pearson-Second Edition.

104
 MongoDB Atlas

L T P
Course Code: UAC007P Credit: 2
2 0 0
Prerequisite
Basic understanding of database concepts Programming
experience (familiarity with a Language like Python or Java is
helpful)

To equip participants with the knowledge and skills to effectively

Course Objective utilize MongoDB Atlas, including database design, querying,
performance optimization, and deployment in cloud
environments, for scalable and efficient data management.

COURSE OUTCOMES

Bloom’s
S No. Course Outcomes
Level

Recall the advantages and use cases of NoSQL databases compared to BL 1,2
CO1
relational databases.

Explain the core functionalities and benefits of MongoDB Atlas as a BL 1,2

CO2
cloud- based document database platform.

Classify data requirements and design effective data models using BL 1,2
CO3
MongoDB documents, collections, and relationships.

Implement MQL queries to retrieve, filter, sort, and manipulate data BL 3,4
CO4
within MongoDB Atlas.

Evaluate the role of indexes in optimizing query performance and BL 3,4

CO5
choose appropriate indexes for specific queries.

155
Detailed Syllabus

Unit Contact
Contents
No. Hours

Introduction to NoSQL Databases

I ● Characteristics of NoSQL databases
● Comparison of NoSQL vs. relational databases
● Use cases for NoSQL databases
6
Introduction to MongoDB Atlas

● Key features and benefits of MongoDB Atlas

Getting started with MongoDB Atlas (creating accounts, clusters, databases)

Data Modeling for MongoDB

II ● Document structure (fields, data types)
● Collections (groups of documents)
● Relationships between documents (references, embedding) 6
Designing effective data models

MongoDB Query Language (MQL)

III ● Basic querying (find, filter)
● Projection (specifying document fields) 6
● Sorting and limiting results
Advanced querying (aggregation pipelines, operators)

Working with Indexes

● Understanding indexes and their benefits
IV ● Creating and managing indexes 6
Choosing appropriate indexes for queries

Administration and Security

V ● User management and access control
● Backup and restore procedures 6
Monitoring and performance optimization techniques

156
MAPPING OF COURSE OUTCOMES WITH PROGRAM OUTCOMES

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

CO1
3 2 2 1 1
CO2
3 1 1 2 1 1
CO3
2 2 2 1
CO4
2 1 1 1 2
CO5
2 2 2 1 3

SUGGESTED BOOKS AND READING MATERIAL

Text Books

1 MongoDB: The Definitive Guide by Kristina Chodorow and Peter Mehrholz

2 Head First NoSQL" by Elisabeth Robson

Reference Books:

1 Head First Learn to Code: Python (Revised Edition)by Jennifer Greene (2020),
O'Reilly Media

2 Automate the Boring Stuff with Python: Practical Programming for the Everyday
Programmer (2nd Edition)by Al Sweigart (2019).

157
 Open Source AI tools

L T P
Course Code: UVC009 Credit: 2
2 0 0
Prerequisite

The objective of OpenAI tools is to advance the development and

Course Objective democratization of artificial intelligence while ensuring ethical
considerations and fostering collaboration for societal benefit.

COURSE OUTCOMES

Bloom’s
S No. Course Outcomes
Level

Understand OpenAI Models BL-2

CO1

Apply Ethical Principles in AI Development BL-3

CO2

Solve Complex Problems Using AI Techniques BL-4

CO3

CO4 Collaborate Effectively in AI Projects BL-3

CO5 Contribute to Advancements in AI Research BL-2

169
Detailed Syllabus

Unit Contact
Contents
No. Hours

I Overview of popular AI tools for chatbot development, video creation, 2

text-to-speech, and presentations. Understanding the impact of AI tools on
marketing, communication, and content creation

II Introduction to chatbots and their applications in customer service, sales, and 2

marketing, Overview of popular chatbot development platforms such as
ChatGPT

Introduction to video creation and its importance in marketing and content

creation, Overview of popular video creation tools such as Synthesia, Lumen5,
III and Powtoon. 2

Hands-on exercises on creating videos using video creation tools, including

adding text, images, animations, and voiceovers

IV Introduction to text-to-speech technology and its applications in accessibility, 2

content creation, and [Link] of popular text-to-speech tools.

Introduction to presentation creation and its role in marketing, sales, and

communication. Overview of popular presentation creation tools such as
V 2
Tome, Understanding the responsible and ethical use of AI tools in marketing,
communication, and content creation.

170
MAPPING OF COURSE OUTCOMES WITH PROGRAM OUTCOMES

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

CO1
3
CO2
3
CO3
2
CO4
3 2
CO5
3

171
 Introduction to Data Science and Analytics

L T P
Course Code: BTCSD206T Credit: 3
3 0 0

Prerequisite Basic understanding of Class 12-level mathematics, familiarity

with Python programming fundamentals, and exposure to basic
data structures and algorithms.

This course introduces students to the foundational concepts of

data science and analytics. It focuses on the data science life
cycle, data wrangling, exploratory data analysis, statistical
inference, and predictive modeling. Students will learn to apply
Course Objective tools like Python, Pandas, NumPy, and data visualization
libraries to derive insights from structured and unstructured data,
building strong analytical skills for real-world problem-solving.

COURSE OUTCOMES

Bloom’s
S No. Course Outcomes
Level

Understand the foundational concepts, workflow, and applications of BL-2

CO1 data science.

Apply data cleaning and preprocessing techniques to prepare data for BL-3
CO2 analysis.

Perform exploratory data analysis and visualize datasets to identify BL-4

CO3 patterns and insights.

Apply basic statistical and inferential techniques in analytical contexts. BL-3

CO4

Demonstrate the use of Python-based tools to solve real-world data BL-4

CO5 science problems.

215
Detailed Syllabus

Unit Contact
Contents
No. Hours

Introduction to Data Science

I 8
Definition and scope of data science, data types and sources, structured vs
unstructured data, data science process/life cycle, role of a data scientist, key
data science tools (Jupyter, Python, Git, SQL), applications in healthcare,
business, and social media.

Data Collection, Cleaning & Preprocessing

II 8
Data acquisition methods (web scraping, APIs, CSV, databases), handling
missing data, data type conversions, filtering and sorting, feature
engineering, outlier detection, and preprocessing techniques using Pandas
and NumPy.

Exploratory Data Analysis (EDA) & Visualization

III 6
Descriptive statistics (mean, median, mode, variance, skewness, kurtosis),
data distributions, correlation and covariance, data visualization using
Matplotlib, Seaborn, and Plotly (bar, histogram, boxplot, scatter, heatmap),
insights generation from real datasets.

Introduction to Analytics & Statistical Inference

IV Types of analytics: descriptive, diagnostic, predictive, prescriptive; 7

probability concepts, hypothesis testing (z-test, t-test), confidence intervals,
and chi-square test; regression analysis basics; model evaluation metrics
(MAE, RMSE, R²).

Data Science Tools & Real-World Applications

V 8
Overview of machine learning models (supervised vs. unsupervised),
introduction to scikit-learn, basic classification and clustering techniques
(k-NN, k-means), project cycle (data to insight), ethical concerns in data
science, and a mini-capstone group project using real-world datasets.

216
MAPPING OF COURSE OUTCOMES WITH PROGRAM OUTCOMES

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

CO1 3 2 3 1

CO2 3 3 3 2

CO3 3 3 2 2 3

CO4 3 3 3 2 2

CO5 3 3 3 2 3

SUGGESTED BOOKS AND READING MATERIAL

Text Books

1 Doing Data Science – Cathy O’Neil and Rachel Schutt

2 Python for Data Analysis – Wes McKinney

3 Data Science from Scratch – Joel Grus

Reference Books:

1 Practical Statistics for Data Scientists – Peter Bruce, Andrew Bruce

2 NPTEL: Data Science for Engineers

3 IBM/Coursera: Applied Data Science with Python

4 Kaggle Datasets and Competitions

5 OpenIntro Statistics (free resource)

217
Digital Marketing

L T P:
Course Code: OSB010 Credits: 03
2 0 2

Pre-Requisite NIL

Course
To impart knowledge of Digital Marketing and develop its skills.
Objectives

Course Outcomes

Understand the distinction between Internet Marketing and

CO 1 Traditional Marketing, along with the foundational concepts of web BL 2
development.

Gain practical skills in installing and setting up web development

CO 2 BL 3
tools like XAMPP and WordPress.

Develop a comprehensive understanding of SEO fundamentals,

CO 3 including search engine algorithms, optimization techniques, and BL 4
best practices.

Learn the essentials of Social Media Optimization (SMO), including

CO 4 creating business pages, leveraging social platforms, and analyzing BL 5
competitor strategies.

Master content marketing strategies, explore various monetization

CO 5 avenues, and apply advanced SEO techniques to enhance website BL 5
visibility and performance.

Unit Content Hours

Digital marketing: Introduction, Objective, Web Advertising, Current

Trends, Blog creation, On Page Search Engine Optimization, Off Page
I Search Engine Optimization. 12
Internet Marketing: Structure, Objective, Digital Marketing
Framework, Email Marketing, Bounce Rate.
 Search Engine Optimization (SEO) Fundamentals

Introduction, Structure, Objective, create ad campaigns, YouTube

II marketing, Display Marketing (Animated ads, Video ads, Lightbox 12
ads), trends in digital advertising, Analytical tools, Traffic generation
by SEO.

Social Media Optimization (SMO): Structure, Objective, Influencer

marketing, facebook marketing (organic marketing, paid marketing),
III create advertising campaigns (facebook business manager), LinkedIn 12
marketing, LinkedIn ads, content strategy, traffic generation by
LinkedIn, E-Commerce.

Affiliate program: Affiliate Marketing (using amazon, Flipkart,

IV earnkaro, direct marketing), Twitter Marketing, Mobile 12
Marketing, Web Stories, creating youtube channel,

Emerging Platform: Book Publishing, Website creating using google

V or wordpress, Web analytics (Google analytics, amazon analytics), 12
google Adwords, Introduction to SAP, case studies and tools

Total: 60 Hours