Savitribai Phule Pune University

(Formerly University of Pune)

Bachelors Degree in Data Science

(Faculty of Science and Technology)

Syllabi for
B.Sc. (Data Science)

(For Colleges Affiliated to Savitribai Phule Pune University)

Choice Based Credit System (CBCS) Syllabus

Under National Education Policy (NEP)

To be implemented from Academic Year 2024-2025

SPPU B.Sc. Data Science Syllabus from 2024-25 1

Preamble
Welcome to the B.Sc.(Data Science) programme! This programme is designed to empower
students with knowledge and skills required to thrive in an era of data science and technology. By
choosing B.Sc. (Data Science) Programme, students enter into the dynamic field of data science and
data analytics. Students will engage and build strong foundation in mathematics, statistics,
computer science and ethical data practices. This programme not only equips students with
technical expertise but also fosters a mindset of continuous learning, adaptability and ethical
leadership.
As you navigate this syllabus, consider it a roadmap to your future in data science. Welcome
to the world where data becomes insight and insight drives innovation.

Eligibility
(a) Higher Secondary School Certificate (10+2) Science Stream with Mathematics or its
equivalent examination
OR
(b) Three Years Diploma Course after S.S.C. (10th standard) of Board of Technical Education
conducted by Government of Maharashtra or its equivalent.

Programme Outcomes:
PO 1: The programme seeks to develop strong foundation in Mathematics, Statistics and Computer
Science that demonstrate proficiency in basic programming languages and tools.
PO 2: The programme aims to understand the principles of data storage and retrieval by acquiring
knowledge of data type structures and basic data manipulation techniques.
PO 3: The programme helps to learn database management techniques with design and
management of databases as well as executing SQL queries for data retrieval and
manipulation.
PO 4: By applying advanced statistical methods and machine learning techniques, the students can
analyze complex datasets, interpret and communicate findings effectively.
PO 5: The programme also aims to understand and work with big data technologies and apply
these technologies to process and analyze large-scale datasets.
PO 6: The students can create clear and effective data visualizations using various tools and
communicate complex findings through visual representations.

SPPU B.Sc. Data Science Syllabus from 2024-25 2

PO 7: The programme also seeks to develop comprehensive projects by applying data science
techniques to solve real-world problems that will improve the ability of learner to integrate
knowledge and skills acquired throughout the programme.
PO 8: Through hands-on projects, practical assignments, and exposure to state-of-the-art tools and
technologies, programme aim to develop the technical proficiency and problem-solving
skills necessary for success in the professional world.
PO 9: Depending on the chosen track, students can develop expertise in data analytics with areas
such as Business, Social Media, HR, Financial, Healthcare, Supply Chain & Logistics and
Big Data etc.
PO 10: The program include On Job Training, internships and research work that provides learners
with practical experience, applying their knowledge to real-world challenges.
PO 11: Graduates will be adept at presenting complex technical concepts clearly and effectively,
both in written and oral forms, to various audiences.
PO 12: The programme places a strong emphasis on ethical considerations, responsible use of
technology, and awareness of the societal impact of data science and computing solutions.
PO 13: The programme aim to produce graduates who approach their work with integrity and a
sense of social responsibility.
PO 14: Acknowledging the dynamic nature of computer science, the programme aim to inspire
students for continuous learning and professional development, empowering them to adapt
and thrive in the face of technological advancements; prepared them to adapt to new
technologies and methodologies throughout their careers.
PO 15: The students will be encouraged to think creatively and innovatively, exploring new ideas
and approaches to solve data science related problems and advance the state of the art in the
field.

SPPU B.Sc. Data Science Syllabus from 2024-25 3

 Savitribai Phule Pune University
Syllabus Structure as per NEP Guidelines
B.Sc. (Data Science) from 2024-25
FY (Level 4.5) SEMESTER I
Course Course code Course Name Credits Teaching Examination
Type Scheme Scheme and
Hrs/Week Marks
T P TH PR C E Total
H R E E
DS101MJ Problem Solving and C 4 - 4 - 30 70 100
Major
Programming
Core
DS102MJP Lab Course on DS101MJ - 2 - 4 15 35 50
VSC DS121VSC Computer Organization 2 - 2 - 15 35 50
DS101IKS Computing in Ancient 2 - 2 - 15 35 50
IKS
India
From University Basket 2 - 2 - 15 35 50
GE/OE
From University Basket - 2 - 4 15 35 50
SEC101DS Computational 2 - 2 - 15 35 50
SEC
Mathematics
AEC101MAR/ MIL-I (Hindi) / MIL-I 2 - 2 - 15 35 50
AEC
HIN (Marathi)
VEC VEC101ENV EVS-I 2 - 2 - 50 - 50
CC101PE/ From University Basket 2 - 2 - 50 - 50
CC
NSS/ NCC

Total 18 4 18 8 550

SPPU B.Sc. Data Science Syllabus from 2024-25 4

 Savitribai Phule Pune University
Syllabus Structure as per NEP Guidelines
B.Sc. (Data Science) from 2024-25
FY (Level 4.5) SEMESTER II
Course Course code Course Name Credits Teaching Examination
Type Scheme Scheme and
Hrs/Week Marks
T P TH PR C E Total
H R E E
Major DS151MJ Python Programming 4 - 4 - 30 70 100
Core DS152MJP Lab Course on DS151MJ - 2 - 4 15 35 50
VSC DS171VSCP Excel and Advanced Excel - 2 - 4 15 35 50
DS191MN Probability and Descriptive of 2 - 2 - 15 35 50
Minor
Statistics
From University Basket 2 - 2 - 15 35 50
GE/OE
From University Basket - 2 - 4 15 35 50
SEC SEC151DS Graph Theory 2 - 2 - 15 35 50
AEC151MAR/ MIL-II (Hindi) / MIL-II 2 - 2 - 15 35 50
AEC
HIN (Marathi)
VEC VEC151ENV EVS-II 2 - 2 - 50 - 50
CC151PE/ From University Basket 2 - 2 - 50 - 50
CC
NSS/ NCC

Total 16 6 16 12 550

SPPU B.Sc. Data Science Syllabus from 2024-25 5

 Savitribai Phule Pune University
Syllabus Structure as per NEP Guidelines
B.Sc. (Data Science) from 2024-25
SY (Level 5.0) SEMESTER III
Course Course code Course Name Credits Teaching Examination
Type Scheme Scheme and
Hrs/Week Marks
T P TH PR C E Total
H R E E
DS201MJ Database Management System 4 - 4 - 30 70 100
Major
DS202MJ Software Engineering 2 - 2 - 15 35 50
Core
DS203MJP Lab Course on DS201MJ - 2 - 4 15 35 50
VSC DS221VSC Skills on Data Science 2 - 2 - 15 35 50
FP/ DS231FP - 2 - 4 15 35 50
Mini Project
CEP
DS241MN Probability Distribution and 2 - 2 - 15 35 50
Minor Modelling
DS242MNP Lab Course on DS241MN 2 - 4 15 35 50
GE/OE From University Basket 2 - 2 - 15 35 50
AEC AEC201ENG Soft Skills-I 2 - 2 - 15 35 50
CC201PE/ From University Basket - 2 - 4 50 - 50
CC
NSS/ NCC

Total 14 8 14 16 550

SPPU B.Sc. Data Science Syllabus from 2024-25 6

 Savitribai Phule Pune University
Syllabus Structure as per NEP Guidelines
B.Sc. (Data Science) from 2024-25
SY (Level 5.0) SEMESTER IV
Course Course code Course Name Credits Teaching Examination
Type Scheme Scheme and
Hrs/Week Marks
T P TH PR C E Total
H R E E
DS251MJ Data Analytics 4 - 4 - 30 70 100
Major
DS252MJ Data Structure 2 - 2 - 15 35 50
Core
DS253MJP Lab Course on DS252MJ - 2 - 4 15 35 50
FP/ DS281FP - 2 - 4 15 35 50
Mini Project
CEP
DS291MNT Testing of Hypothesis and 2 - 2 - 15 35 50
Minor Sampling Distributions
DS292MNP Lab Course on DS291MNT - 2 - 4 15 35 50
GE/OE From University Basket - 2 - 4 15 35 50
SEC251DSP Lab Course on Data - 2 - 4 15 35 50
SEC
Analytics
AEC AEC251ENG Soft Skills-II 2 - 2 - 15 35 50
CC251PE/ From University Basket - 2 - 4 50 - 50
CC
NSS/ NCC

Total 10 12 10 24 550

SPPU B.Sc. Data Science Syllabus from 2024-25 7

 Savitribai Phule Pune University
Syllabus Structure as per NEP Guidelines
B.Sc. (Data Science) from 2024-25
TY (Level 5.5) SEMESTER V
Course Course code Course Name Credits Teaching Examination
Type Scheme Scheme and
Hrs/Week Marks
T P TH PR C E Total
H R E E
DS301MJ NoSQL databases 4 - 4 - 30 70 100
DS302MJ Data Security and Privacy 2 - 2 - 15 35 50
Major
Core DS303MJP Lab Course on DS301MJ - 2 - 4 15 35 50
DS304MJP Lab Course on R - 2 - 4 15 35 50
Programming
DS310MJ Business Analytics 2 - 2 - 15 35 50
DS311MJP Lab Course - 2 - 4 15 35 50
Major
OR -
Elective
DS312MJ Social Media Analytics 2 - 2 - 15 35 50
DS313MJP Lab Course - 2 - 4 15 35 50
VSC DS321VSCP Lab Course on MATLAB - 2 - 4 15 35 50
FP/CEP DS331FP Mini Project - 2 - 4 15 35 50
DS341MN Categorical Data Analysis 2 - 2 - 15 35 50
Minor
DS342MNP Lab Course on DS341MN - 2 - 4 15 35 50

Total 10 12 10 24 550

SPPU B.Sc. Data Science Syllabus from 2024-25 8

 Savitribai Phule Pune University
Syllabus Structure as per NEP Guidelines
B.Sc. (Data Science) from 2024-25
TY (Level 5.5) SEMESTER VI
Course Course Course Name Credits Teaching Examination
Type code Scheme Scheme and
Hrs/Week Marks
T P TH PR CE E Total
H R E
DS351MJ Data Visualization and 4 - 4 - 30 70 100
Modelling
Major DS352MJ Foundations of Artificial 2 - 2 - 15 35 50
Core Intelligence
DS353MJP Lab on DS351MJT - 2 - 4 15 35 50
DS354MJP Lab Course on DS352MJ - 2 - 4 15 35 50
DS360MJ HR Analytics 2 - 2 - 15 35 50
DS361MJP Lab Course - 2 - 4 15 35 50
Major OR
Elective
DS362MJ Financial Analytics 2 - 2 - 15 35 50
DS363MJP Lab Course - 2 - 4 15 35 50
OJT DS381OJT On Job Training - 4 - 8 100 - 100
DS391MN Multivariate Analysis 2 - 2 - 15 35 50
Minor
DS392MNP Lab Course on DS391MN - 2 - 4 15 35 50

Total 10 12 10 24 550

SPPU B.Sc. Data Science Syllabus from 2024-25 9

 Savitribai Phule Pune University
Syllabus Structure as per NEP Guidelines
B.Sc. (Data Science) from 2024-25
(Level 6.0) SEMESTER VII (Honors with Research Degree)
Course Course Course Name Credits Teaching Examination
Type code Scheme Scheme and
Hrs/Week Marks
T P TH PR C E Total
H R E E
DS401MJ Machine Learning 4 - 4 - 30 70 100
Major DS402MJ Basics of Cloud Computing 2 - 2 - 15 35 50
Core DS403MJP Lab Course on DS401MJ - 2 - 4 15 35 50
DS404MJP Lab Course on DS402MJ - 2 - 4 15 35 50
DS410MJ Supply Chain & Logistics 2 - 2 - 15 35 50
Analytics
Major DS411MJP Lab Course - 2 - 4 15 35 50
Elective OR
DS412MJ Healthcare Analytics 2 - 2 - 15 35 50
DS413MJP Lab Course - 2 - 4 15 35 50
RP DS431RP Research Project - 4 - 8 30 70 100
RM DS441RM Research Methodology 4 - 4 - 30 70 100
Total 12 10 12 20 550
OR
(Level 6.0) SEMESTER VII (Honors Degree)
Course Course Course Name Credits Teaching Examination
Type code Scheme Scheme and
Hrs/Week Marks
T P TH PR C E Total
H R E E
DS401MJ Machine Learning 4 - 4 - 30 70 100
DS402MJ Basics of Cloud Computing 2 - 2 - 15 35 50
Major
DS403MJP Lab Course on DS401MJ - 2 - 4 15 35 50
Core
DS404MJP Lab Course on DS402MJ - 2 - 4 15 35 50
DS405MJ Big Data Analytics 4 - 4 - 30 70 100
DS410MJ Supply Chain & Logistics 2 - 2 - 15 35 50
Analytics
Major DS411MJP Lab Course - 2 - 4 15 35 50
Elective OR
DS412MJ Healthcare Analytics 2 - 2 - 15 35 50
DS413MJP Lab Course - 2 - 4 15 35 50
RM DS441RM Research Methodology 4 - 4 - 30 70 100
Total 16 6 16 12 550

SPPU B.Sc. Data Science Syllabus from 2024-25 10

 Savitribai Phule Pune University
Syllabus Structure as per NEP Guidelines
B.Sc. (Data Science) from 2024-25
(Level 6.0) SEMESTER VIII (Honors with Research Degree)
Course Course Course Name Credits Teaching Examination
Type code Scheme Scheme and
Hrs/Week Marks
T P TH PR C EE Tota
H R E l
DS451MJ Data Mining and Warehousing 4 - 4 - 30 70 100
Major DS452MJ Deep Learning 2 - 2 - 15 35 50
Core DS453MJP Lab Course on DS451MJ - 2 - 4 15 35 50
DS454MJP Lab Course on DS452MJ - 2 - 4 15 35 50
DS460MJ Geospatial Technology 2 - 2 - 15 35 50
DS461MJP Lab Course - 2 - 4 15 35 50
Major
OR
Elective
DS462MJ E-Commerce 2 - 2 - 15 35 50
DS463MJP Lab Course - 2 - 4 15 35 50
RP DS481RP Research Project - 8 - 16 60 140 200
Total 8 14 8 28 550
OR
(Level 6.0) SEMESTER VIII (Honors Degree)
Course Course Course Name Credits Teaching Examination
Type code Scheme Scheme and
Hrs/Week Marks
T P TH PR C E Total
H R E E
DS451MJ Data Mining and Warehousing 4 - 4 - 30 70 100
DS452MJ Deep Learning 2 - 2 - 15 35 50
Major
DS453MJP Lab Course on DS451MJ - 2 - 4 15 35 50
Core
DS454MJP Lab Course on DS452MJ - 2 - 4 15 35 50
DS455MJ Natural Language Processing 4 - 4 - 30 70 100
DS456MJ Geospatial Technology 2 - 2 - 15 35 50
DS457MJP Lab Course - 2 - 4 15 35 50
Major
OR
Elective
DS458MJ E-Commerce 2 - 2 - 15 35 50
DS459MJP Lab Course - 2 - 4 15 35 50
OJT DS481OJT On Job Training - 4 - 8 30 70 100
Total 12 10 550

SPPU B.Sc. Data Science Syllabus from 2024-25 11

 Savitribai Phule Pune University
B.Sc. Data Science (2023 Pattern)
Semester-I
DS101MJ : Problem Solving and C Programming
No. of Credits: Teaching Scheme Examination Scheme
4 Theory: 4 Hrs/Week Continuous Evaluation: 30 Marks
End Semester : 70 Marks
Prerequisites
 Basic knowledge of mathematics, logic.
 Puzzle solving Aptitude
 Knowledge of problem solving tools like algorithms, flowcharts and pseudocodes will
be an added advantage.

Objectives
 To teach students systematic and efficient problem-solving methods, including problem
analysis, algorithm design, and solution implementation.
 To provide a solid understanding of the C programming language, including its syntax,
data types, control structures, and functions.
 To instill good programming habits, including code readability, commenting, and
documentation.
 To nurture the ability to think algorithmically and express solutions as step-by-step
processes using C programs.
 To improve debugging techniques and error identification and correction in C programs.
 To introduce the concepts of modular programming, including arrays, strings, functions,
structures, and file handling.
 To expose students to real-world problem-solving scenarios and encourage the
application of programming to practical issues.

Course Outcomes
On Completion of this course, student will be able to -
CO 01: Understand and dissect problems to identify the key components, requirements,
and constraints.
CO 02: Create clear and efficient algorithms for solving a variety of problems.
CO 03: Write C programs to implement algorithms and solve problems.
CO 04: Identify and correct errors in C programs using systematic debugging techniques.
CO 05: Exhibit proficiency in writing organized and readable code in the C language.
CO 06: Create modular programs using functions & structures to manage code complexity.
CO 07: Use problem-solving and programming skills to address real-world issues and
demonstrate practical applications.
CO 08: Understand basic concepts like arrays, strings, pointers, functions and file
handling.
CO 09: Implement industry-standard coding conventions, documentation, and code
versioning practices.
CO 10: Apply problem-solving techniques and C programming skills to various domains,
such as data processing, simple games, or text processing.

SPPU B.Sc. Data Science Syllabus from 2024-25 12

Unit Name of Unit Teaching CO Targeted
No. Hours

1 Introduction to Problem Solving 5 CO 1,2,3,7

 What is problem solving?

 Problem solving steps.
 Algorithms - definition, characteristics, examples, advantages and limitations.
 Flowcharts - definition, notations, examples, advantages and limitations, Comparison
with algorithms.
 Pseudo codes - notations, examples, advantages and limitations.
 Introduction to Programming
 Programming Languages as tools, programming paradigms, types of languages
 Converting pseudo-code to programs.

2 C Programming Fundamentals 10 CO 3,4,5,9

 History of C Programming Language

 Features of C Programming
 Structure of a ‘C’ Program
 C Program Development Life Cycle
 Functions as Building Blocks
 Character set, C Tokens, Identifiers and Keywords, Variables and Comments
 Introduction to data types
 Simple Hello World Program
 Compiling, Linking and Executing C Programs.
 Operators - Arithmetic operators, Relational, Logical operators, Assignment, increment
and decrement operators, conditional operators, bitwise operators, special operators
 Expressions - arithmetic expressions, evaluation of arithmetic expressions, precedence
of arithmetic expressions, some computational problems, type conversion in expressions
 Enumerated Data Type, Escape Sequence
 Operator precedence and associativity
 Storage classes in C - Auto, Static, Extern, Register
 Type casting
 Character input and output, String input and output, Formatted input and output.

3 Decision Making – Branching & Looping 7 CO 4,5,9

 Decision making-if statement, if-else, if else if ladder, nested if, switch statement
 Looping -While statement, do-while statement, for statement, Nested Loops
 Use of break and continue statements.
 Unconditional branching (goto statement).

4 Arrays and Strings 10 CO 6,7,8

 Array Definition
 Types of Array - One dimensional array, two dimensional array, multi-dimensional
array
 Array Applications - Finding maximum and minimum, Counting occurrences, Linear
search, Sorting an array, Matrix operations
 String Definition
SPPU B.Sc. Data Science Syllabus from 2024-25 13
  Declaring and initializing string variables, reading string from terminal, writing string to
screen, putting strings together, comparison of two strings
 String handling functions
 Math Functions in C programming

5 Functions and Pointers 10 CO 6,7,8,10

 Function Definition
 Standard library functions
 User defined functions
 Passing values between functions,
 Scope rules of functions,
 Calling convention, return type of functions,
 Call by Value and Call by Reference,
 Recursive Functions
 Understanding pointers, accessing the address of a variable
 Declaring pointer variables, initialization of pointer variables
 Accessing a variable through its pointer
 Pointer and arrays, pointers and character strings, array of pointers
 Pointers as function arguments, functions returning pointers, pointers to functions
 Dynamic Memory Allocation – definition, malloc, calloc, realloc, free

6 Structures and Unions 9 CO 6,7,8,9

 Defining a structure,
 Declaring Structure variables, accessing structure members, structure initialization
 Copying and comparing structure variables, operation on individual members
 Arrays of structures, arrays within structures
 Nested Structures
 Structures and Functions
 pointers and Structures
 Concept of Union, declaration, definition, accessing union members.
 Difference between structures and union

7 File Handling and Preprocessors 9 CO 6,8,9,10

 Concepts of Streams
 Types of Files
 Functions for file handling operations - Creation, Opening, Reading, Writing the file
 Random Access to Files
 Command Line Arguments.
 Standard C preprocessors
 Role of Preprocessor
 Format of preprocessor directive
 Directives in C programming - #include #define
 Defining and calling macros, Macro substitution directive,
 Argumented and nested macro
 Macros versus functions

Reference Books
SPPU B.Sc. Data Science Syllabus from 2024-25 14
1. C: the Complete Reference, Schildt Herbert, 4 th edition, McGraw Hill
2. Programming in ANSI C, E. Balagurusamy, 7th Edition, McGraw Hill.
3. How to solve it by Computer, R.G. Dromey, Pearson Education.
4. Let us C, Kanetkar Y, BPB Publications.A Structured Programming Approach Using C,
Behrouz A. Forouzan, Richard F. Gilberg, Cengage Learning India
5. The ‘C’ programming language, Brian Kernighan, Dennis Ritchie, PHI
6. Programming in C , A Practical Approach, Ajay Mittal , Pearson
7. Programming with C, B. Gottfried, 3rd edition, Schaum’s outline Series, Tata McGraw Hill.

SPPU B.Sc. Data Science Syllabus from 2024-25 15

 Savitribai Phule Pune University
B.Sc. Data Science (2023 Pattern)
Semester-I
DS102MJP : Lab Course on DS101MJ (Problem Solving and C
Programming)

No. of Credits: Teaching Scheme Examination Scheme

2 Practical: 4 Hrs/Week Continuous Evaluation: 15Marks
End Semester : 35 Marks
Objectives
 To Recognize and understand the syntax and construction of C programming code.
 To Gain experience of procedural language programming.
 To Know the steps involved in compiling, linking and debugging C code.
 To Understand using header files.
 To Learn the methods of iteration or looping and branching.
 To Make use of different data-structures like arrays, pointers, structures and files.
 To Understand function declaration and definition.
 To Understand proper use of user defined functions.
 To Write programs to print output on the screen as well as in the files.
 To Apply all the concepts that have been covered in the theory course, and Know the
alternative ways of providing solution to a given problem.

Course Outcomes
On Completion of this course, student will be able to -
CO 01: Write C programs to implement algorithms and solve problems.
CO 02: Identify and correct errors in C programs using systematic debugging techniques.
CO 03: Exhibit proficiency in writing organized and readable code in the C language.
CO 04: Create modular programs using functions and structures to manage code
complexity.
CO 05: Use problem-solving and programming skills to address real-world issues and
demonstrate practical applications.
CO 06: Develop programs using arrays, strings, pointers, functions and file handling.
Assignment 1:
Basic Programs, and programs on Decision Making and Looping statements
Assignments 2:
Programs on Arrays and Strings
Assignments 3:
Programs on Pointers and Functions
Assignments 4:
Programs on Structures and Union
Assignment 6:
Programs on Command line Arguments, File Handling and Preprocessors

SPPU B.Sc. Data Science Syllabus from 2024-25 16

 EXERCISE
List of Sample Program Questions:
1. Write a C program to display “This is my first C Program”.
2. Write a C program to add two numbers (2 and 6) and display its sum.
3. Write a C program to multiply two numbers (4 and 5) and display its product.
4. Write a C program to calculate area and circumference of a circle.
5. Write a C program to perform addition, subtraction, division and multiplication of two
numbers.
6. Write a program to calculate simple and compound interest.
7. Write a program to swap values of two variables with and without using third variable.
8. Write a program to display the size of every data type using “sizeof” operator.
9. Write a program to illustrate the use of unary prefix and postfix increment and
decrement operators.
10. Write a program to input two numbers and display the maximum number.
11. Write a program to find the largest of three numbers using ternary operators.
12. Write a program to find the roots of quadratic equation.
13. Write a program to input name, marks of 5 subjects of a student and display the name of
the student, the total marks scored, percentage scored and the class of result
14. Write a Program to Check Whether a Number is Prime or not.
15. Write a program to find the largest and smallest among three entered numbers and also
display whether the identified largest/smallest number is even or odd.
16. Write a program to compute grade of students using if else adder.
17. Write a program to check whether the entered year is leap year or not (a year is leap if it
is divisible by 4 and divisible by 100 or 400.)
18. Write a program to find the factorial of a number.
19. Write a program to check number is Armstrong or not. (Hint: A number is Armstrong if
the sum of cubes of individual digits of a number is equal to the number itself).
20. Write a program to count number of digits in a given integer.
21. Write a program to reverse a given integer.
22. Write a program to print number in reverse order with a difference of 2.
23. Write a program to print the sum of digits of a number using for loop.
24. Write a program to check whether a number is Palindrome or not.
25. Write a program to generate Fibonacci series.
26. If a four-digit number is input through the keyboard, write a program to obtain the sum
of the first and last digit of this number.
27. Write a program to find GCD (greatest common divisor or HCF) and LCM (least
common multiple) of two numbers.
28. Write a Program to Search an element in array.
29. Write a Program to perform addition of all elements in Array.
30. Write a Program to find the largest and smallest element in Array.
31. Write a Program to reverse the array elements in C Programming.
32. Write a Program for deletion of an element from the specified location from Array.
33. Write a Program to access an element in 2-D Array.
34. Write a program for addition of two matrices of any order in C.
35. Write a Program to multiply two 3 X 3 Matrices.
36. Write a program to read a string and check for palindrome without using string related
function (a string is palindrome if its half is mirror by itself eg: abcdcba).
37. Write a program to accept a string and count the number of vowels present in this string.
38. Write a program to add, subtract, multiply and divide two integers using user defined
type function with return type.

SPPU B.Sc. Data Science Syllabus from 2024-25 17

39. Write a program to calculate sum of first 20 natural numbers using recursive function.
40. Write a program to generate Fibonacci series using recursive function.
41. Write a program to swap two integers using call by value and call by reference methods
of passing arguments to a function.
42. Write a program to find sum of digits of the number using Recursive Function.
43. Write a program to read an integer number and print the reverse of that number using
recursion.
44. Write a C program to find maximum and minimum between two numbers using
functions.
45. Write a C program to check whether a number is even or odd using functions.
46. Write a C program to check whether a number is prime, Armstrong or perfect number
using functions.
47. Write a C program to find power of any number using recursion.
48. Write a program to find the sum of all the elements of an array using pointers.
49. Write a program to swap value of two variables using pointer.
50. Write a program to add two numbers using pointers.
51. Write a program to input and print array elements using pointer.
52. Write a program to copy one array to another using pointer.
53. Write a program to swap two arrays using pointers.
54. Write a program to reverse an array using pointers. 8. Write a program to search an
element in array using pointers.
55. Write a program to add two 2 X 2 matrix using pointers.
56. Write a program to multiply two 2 X 2 matrix using pointers.
57. Write a program to find length of string using pointers.
58. Write a program to copy one string to another using pointer.
59. Write a program to concatenate two strings using pointers.
60. Write a program to compare two strings using pointers.
61. Write a program to create a structure named company which has name, address, phone
and no of Employee as member variables. Read name of company, its address, phone
and no of Employee. Finally display these members’ value.
62. Define a structure “complex” (typedef) to read two complex numbers and perform
addition, subtraction of these two complex numbers and display the result.
63. Write a program to read RollNo, Name, Address, Age & average-marks of students and
display the details using functions.
64. Write a program to add two distances in feet and inches using structure
65. Write a program to read and print an Employee’s Details using Structure.
66. Write a C Program to list all files and sub-directories in a directory
67. Write a C Program to count number of lines in a file
68. Write a C Program to print contents of file
69. Write a C Program to copy contents of one file to another file
70. Write a C Program to merge contents of two files into a third file
71. Write a C program to delete a file.

SPPU B.Sc. Data Science Syllabus from 2024-25 18

 Savitribai Phule Pune University
B.Sc. Data Science (2023 Pattern)
Semester-I
DS121VSC: Computer Organization
Examination Scheme
No. of Credits: Teaching Scheme
Continuous Evaluation:15 Marks
2 Theory: 2 Hours/Week
End Semester :35 Marks
Prerequisites
 Number systems and basics of digital electronics.
Objectives
 To revise about different number systems, codes, logic gates with truth tables.
 To understand combinational and sequential circuits of digital electronics.
 To conceptualize the basics of organizational and architectural issues of a digital computer
and learn about various data transfer techniques in digital computer and the I/O interfaces.
 To know how I/O devices are accessed and its principles and to provide the knowledge on
Instruction Level Parallelism.
 To study architecture
Course Outcomes
On Completion of this course, student will be able to -
CO1: Understand number systems related to computer and their inter-conversion.
CO2: Familiar with digital circuits, their types, and applications.
CO3: Understand CPU and Memory organizations for the fundamentals of computer.
CO4: Study interfacing of peripherals with CPU in serial and parallel manner with data
convertors.
CO5:Study basics of microprocessor architecture and concept of pipelining

Unit Teaching
Name of Unit CO Targeted
No. Hours
1 Digital Circuits 14 CO1, CO2
Number Systems: Binary, Hexadecimal, BCD and their inter-conversion. Gray code and ASCII
code. Logic Gates: Basic gates, derived gates, positive and negative logic, Simplification of logic
circuits, De-Morgan’s theorem. Concept of K map and simplification of single expressions (upto 4
variables). Combinational circuits: Half adder, full adder, half Subtractor, Multiplexer ( 2:1 and
4:1), Demultiplexer (1:2 and 1:4) using basic gates, Encoder - Decimal to BCD, Decoder - 3 to 8
decoder. Sequential circuits: Concept of triggering, Flip-Flops: SR, JK, D and T.Counters:
Synchronous and Asynchronous (3-bit), Shift registers: types and applications.
2 CPU, Memory and I/O Organizations 14 CO3, CO4
CPU Organization: Functions of CPU, General registers used in CPU: PC, SP, instruction
pointer, instruction register, instruction decoder, flag, general purpose registers, memory address
register, memory byte register, General register organization of CPU, Concept of stack.
Memory organization: Memory hierarchy, cache memory and its address mapping, Associative
memory, Virtual memory, Memory management through segmentation and paging.
SPPU B.Sc. Data Science Syllabus from 2024-25 19
I/O Organization: Block diagram of parallel interface and function of blocks, Concept of
interrupt, IVT, Types of I/O transfer, CPU initiated, interrupt initiated, DMA (only concept),Data
convertors:R-2RDAC, ADC (flash, successive approximation), Serial communication and types.
Architecture of Microprocessor and Parallel
3 8 CO5
Processing
Architecture of Microprocessor: Block diagram of 8086 and function of blocks, 8086 Registers,
Numeric co-processor - concept, block diagram and functions of blocks.
Parallel Processing: Concept of parallelism, Parallel computer structures. Concept of pipelining,
Pipelined computers, Instruction pipeline, Arithmetic pipeline, Concept of RISC and CISC. RISC
pipelining.
Reference Books
1. Modern Digital Electronics, 4thedition, R P Jain, Tata McGraw Hill publication.
2. Digital Logic & Computer Design, Morris Mano, Pearson.
3. Computer Systems Architecture – Moris Mano, 3rdEdition, Pearson
4. Computer Systems Organization & Architecture- John D. Carinelli Pearson publication.

SPPU B.Sc. Data Science Syllabus from 2024-25 20

 Savitribai Phule Pune University
B.Sc. Data Science (2023 Pattern)
Semester-I
DS101IKS: Computing in Ancient India
Teaching Scheme No. of Credits Examination Scheme
02 Hrs/ week 2 Continuous Evaluation:15 Marks
End Semester :35 Marks
Prerequisites
 No prerequisites required
Course Objectives
 This course is intended to introduce students to the history of computing in Ancient
India
 To familiarize students to the computing in ancient India.
 To understand origin of modern hashing technique.
Course Outcomes
On completion of the course,
CO1 The students will have a comprehensive understanding of the computing in different
fields in ancient India.
CO2 The students will have a familiarity with the rise and development of the computing
in ancient India.
CO3 The students will have understanding about the origin and growth of computing in
ancient India.
CO4 The students will have understanding of the basics of decimal system and binary
number system.
CO5 The students will have understanding about basics of modern hashing technique.
Course Contents
Chapter 1 Introduction to Computing in Ancient India 03 Lect
1.1 History of Computing Science
1.2 Overview of Ancient Indian Science
1.3 Science and Technology- The Beginning (Development in different branches of
science in ancient India – Mathematics, Engineering)
Chapter 2 Binary Numbers in Indian Antiquity 10 Lect
2.1 Preliminary
2.2 The Sanskrit Metrical Tradition - Pingala
2.3 Finding the Decimal Equivalent of a Metrical Pattern
2.4 Finding the Binary Equivalent of a Decimal Number
Chapter 3 The Katapayadi Formula and Modern Hashing Technique, 08 Lect
The Panini-Backus Forms in Syntax of Formal Languages
3.1 Introduction
3.2 Hashing
3.3 Katapayadi Scheme
3.4 An Application of Katapayadi Scheme

SPPU B.Sc. Data Science Syllabus from 2024-25 21

 3.5 Introduction to the Panini-Backus Forms in Syntax of Formal Languages
3.6 What is BNF notation?
Chapter 4 Formal Structures in Indian Logic 06Lect
4.1 Introduction
4.2 Panini’s Grammar
4.3 Language Ambiguities
4.4 Analysis of Language
4.5 Terminology of Predicate Calculus with Equality of Expression
4.6 Examples of Predicate Logic
Chapter 5 Science and Technology in Ancient India 03 Lect
5.1 Science and Technology - Features
5.2 Development of Science
5.3 Technology in Ancient India
5.4 Significant science and Technology in Ancient India
Reference Books:
1. Computing Science in Ancient India – T.R.N. Rao, Subhash Kak
2. History of Science and Technology in India – Dr. Binod Bihari Satpathy
3. https://prepp.in/news/e-492-science-and-technology-in-ancient-india-ancient-india-
history-notes#Technology
4. https://core.ac.uk/download/pdf/82001817.pdf

SPPU B.Sc. Data Science Syllabus from 2024-25 22

 Savitribai Phule Pune University
B.Sc. Data Science (2023 Pattern)
Semester-I
SEC101DS : Computational Mathematics

No. of Credits: 2 Teaching Scheme Examination Scheme

Theory: 2 Hrs/Week Continuous Evaluation:15 Marks
End Semester: 35 Marks
Prerequisites
 Basic Mathematics Skills

Objectives
 To understand the basic arithmetic operations on vectors and matrices, including
determinants, using technology where appropriate.
 To solving systems of linear equations, using technology to facilitate row reduction.
 To understand the basic terminology of linear algebra in Euclidean spaces, including
linear independence, spanning, basis, rank, nullity, subspace, and linear transformation.
 To abstract notions of vector space and inner product space.
 To understand find the eigen values and eigenvectors of a matrix or a linear
transformation, and using them to diagonalize a matrix.
 Enables to find projections and orthogonality among Euclidean vectors, including the
Gram-Schmidt ortho normalization process and orthogonal matrices.

Course Outcomes
On Completion of this course, student will be able to -
CO1: Solve systems of linear equations using methods by Gaussian elimination.
CO2: Demonstrate understanding of the concepts of vector space, linear independence and basis.
CO3: Determine eigen values and eigenvectors and solve eigenvalue problems.
CO4: Demonstrate understanding the use of truth tables and laws of identity, distributive,
commutative, and domination.
CO5: Simplify and prove Boolean expressions, Compute sum of products and product of sum
expansions.
Unit Name of Unit Teaching CO Targeted
No. Hours
1 System of Linear Equation 6 CO1
Matrices, Determinants, Cramer’s Rule, Echelon form, Row reduction, Gaussian elimination
method.
2 Vector Spaces 10 CO1, CO2
Introduction to vector spaces, Some properties of vector spaces, Linear combination, Linear
independence, Linear dependence, Basis and Dimension of a vector space, Row space, Column
space.
3 Eigen values and Eigen vectors 10 CO3
Eigen values and Eigen vectors, The characteristic equation, Diagonalization.
SPPU B.Sc. Data Science Syllabus from 2024-25 23
 4 Boolean function 10 CO4,CO5
Relations, Types of Relations, Equivalence relations, Digraphs of relations, Matrix representation and
Composition of Relations, Transitive closure and Warshall’s Algorithm, Poset, Hasse diagram, Boolean
Functions : Introduction, Boolean variable, Boolean Function of degree n, Boolean identities, Definition
of Boolean Algebra, Representation of Boolean Functions : Minterm, Maxterm Disjunctive normal form,
Conjunctive normal Form.
Reference Books
1. Howard Anton, Chris Rorres, Elementary Linear Algebra, Application Version, Ninth
Edition, Wiley, 11th edition.
2. K. Hoffman and R. Kunze, Linear Algebra, 2nd edition(2014), Prentice Hall of India, New
Delhi.
3. Steven J. Leon, Linear Algebra with Applications, 4th edition(1994), Prentice Hall of India.
New Delhi.
4. Discrete Mathematical Structures, by Kolman, Busby, Ross, Rehman, Prentice Hall

SPPU B.Sc. Data Science Syllabus from 2024-25 24

 SavitribaiPhulePuneUniversity
B.Sc. Data Science (2023 Pattern)
Semester-II
DS151MJ : Python Programming
No. of Credits: 4 Teaching Scheme Examination Scheme
Theory:4 Hrs /Week ContinuousEvaluation:30 Marks
End Semester:70 Marks
Prerequisites
 Fundamentals of high-level programming language like C language.
 Prior knowledge of computational mathematics.
Objectives
 To learn and understand Python programming basics and paradigm.
 To understand and implement the concepts of variables,stringsfunctions,loops and
conditions in Python.
 To understand the concepts of lists, tuples, Dictionaries, objects and classes in Python
 To implement libraries like Pandas, NumPy,SciPy, Matplotlib, Scikit-learn etc. in
Python.
 Students should be made familiar with the concepts of GUI controls and designing GUI
applications.
 To learn and know the concepts of file handling, exception handling.
Course Outcomes
On Completion of this course, student will be able to -
CO1:Define and demonstrate the use of built-in data structures “lists” and “dictionary”.
CO2:Design and implement a program to solve a computational problem.
CO3: Understand implementation of libraries like Pandas, NumPy, SciPy, Matplotlib, Scikit-
learn etc. in Python.
CO4:Design and implement GUI application and how to handle exceptions and files.
CO5: Understand Object Oriented Concepts and modules and packges in Python.

Unit Name of Unit Teaching CO Targeted

No. Hours
1 Introduction to Python 10 CO1
1.1 History, feature of Python, setting up path, working with python Interpreter, basic syntax,
variable and data types, operators
1.2 Conditional statements-If, If-Else, nested if-else, Examples.
1.3 Looping-For,While,Nested loops, Examples
1.4 Control Statements-Break, Continue, Pass.
1.5 String Manipulation-Accessing String, Basic Operations, String Slices, Function and
Methods, Examples.

SPPU B.Sc. Data Science Syllabus from 2024-25 25

1.6 Lists-Introduction, accessing list, operations, working with lists, function & methods.
1.7 Tuple-Introduction, accessing tuples, operations working, function & methods, Examples.
1.8 Dictionaries-Introduction,Accessingvalues in dictionaries, working with dictionaries,
properties, function, Examples.
1.9 Functions-Defining a function, Calling a function, types of function, function arguments,
anonymous function, global & local variable, Examples
2 Classes, Objects and Inheritance 10 CO5
2.1 Classes and Objects
2.1.1 Classes as User Defined Data Type
2.1.2 Objects as Instances of Classes
2.1.3 Creating Class and Objects
2.1.4 Creating Objects By Passing Values
2.1.5 Variables & Methods in a Class
2.2 Inheritance
2.2.1 Single Inheritance
2.2.2 Multilevel
2.2.3 Multiple Inheritance
2.2.4 Hybrid Inheritance
2.2.5 Hierarchical Inheritance
2.2.6 IS-A Relationship and HAS-A Relationship
3 Modules and Packages 8 CO5
3.1Built in Modules
3.1.1 Importing modules in python program
3.1.2 Working with Random Modules.
3.1.3 E.g. - built-ins, time, date time, calendar, sys, etc
3.2 User Defined functions
3.2.1Structure of Python Modules
3.3 Packages
3.3.1 Predefined Packages
3.3.2User defined Packages
4 Python Libraries 20 CO2 & CO3
4.1 Introduction to Python Libraries
4.1.1 Statistical Analysis- NumPy, SciPy, Pandas, StatsModels
4.1.2 Data Visualization- Matplotlib, Seaborn, Plotly
4.1.3 Data Modelling and Machine Learning- Scikit-learn, XGBoost, Eli5
4.1.4 Deep Learning- TensorFlow, Pytorch, Keras
4.1.5 Natural Language Processing (NLP)- NLTK, SpaCy, Gensim
4.2 Working with Tabular Numeric Data(Numpy with Python)
4.2.1 NumPy Arrays Creation Using array() Function
4.2.2 Array Attributes, NumPy Arrays Creation with Initial Placeholder Content
4.2.3 Integer Indexing, Array Indexing, Boolean ArrayIndexing, Slicing and Iterating in Arrays
Basic Arithmetic Operations on NumPy Arrays
4.2.4 Mathematical Functions in NumPy
4.2.5 Changing the Shape of an Array, Stacking and Splitting of Arrays, Broadcasting in
Arrays.
SPPU B.Sc. Data Science Syllabus from 2024-25 26
4.3 Working with Data Series and Frames
4.3.1 Pandas Data Structures, Reshaping Data, Handling Missing Data
4.3.2 Combining Data, Ordering and Describing Data, Transforming Data, Taming Pandas File
I/O
4.4 Plotting
Basic Plotting with PyPlot, Matplotlib, Getting to Know Other Plot Types, Plotting with
Pandas
5 Exception Handling 6 CO4
5.1 Python Exception
5.2 Common Exception
5.3 Exception handling in Python (try-except-else)
5.4 The except statement with no exception
5.5 Multiple Exception
5.6 The try-finally clause
5.7 Custom Exception and assert statement
6 GUI Programming 6 CO4
6.1 Introduction
6.2 Tkinter programming
6.3 Tkinter widgets
6.5 Frame
6.6 Button
6.7 Label
6.8 Entry
Reference Books
1.Mark Lutz, Programming Python, O`Reilly, 4th Edition, 2010
2.Dive into Python, Mike
3. Learning Python, 4th Edition by Mark Lutz
4. Programming Python, 4th Edition by Mark Lutz
5.Python Programming:An introduction to computer,John Zelle,3rd Edition.
6. Data Science Essentials in Python: Collect, Organize, Explore, Predict, Value. Dmitry
Zinoriev, The Pragmatic Programmers LLC, 2016
7. Introduction to Python Programming. Gowrishankar S., Veena A. CRC Press, Taylor &
Francis Group, 2019

SPPU B.Sc. Data Science Syllabus from 2024-25 27

 Savitribai Phule Pune University
B.Sc. Data Science (2023 Pattern)
Semester-II
DS152MJP : Lab Course on DS151MJ (Python Programming)

No. of Credits: 2 Teaching Scheme Examination Scheme

Theory: 4 Hrs/Week Continuous Evaluation: 15 Marks
End Semester: 35 Marks
Prerequisites
 Practical Knowledge of high-level programming language like C language.
 Prior knowledge of computational mathematics.
Objectives
 Learn Programming fundamentals using Python
 Understand the concepts and usage data types, variables and other basic elements
 Learn about using operators and control statements in Python
 Learn about using arrays and strings in Python.
 Learn Object Oriented concepts in Python.
 Learn how to use modules in packages in Python Programming
 Introduce data Science Tools and plot data using appropriate Python visualization
libraries
Course Outcomes
On Completion of this course, student will be able to -
CO1: Implement the use of built-in data structures “lists” and “dictionary” “Tuples” and
“Sets”.
CO2; Implement programs on Arrays and Strings
CO3: Implement programs on Object Oriented concepts in Python.
CO4: Implement programs by importing modules and packages in Python.
CO5: Implement use of libraries like Pandas, NumPy,Matplotlib, etc. in Python.
CO6: Implement GUI application and how to handle exceptions and files.

Unit Name of Unit Teaching CO Targeted

No. Hours
1 Introduction to Python Language CO1
a. Write a Python program to explore various data types including numeric types, Boolean
types and compound types.
b. Write a Python program to perform Input and Output Operations.
c. Write a Python program to demonstrate looping in python and use of break statement
and continue statement.
2 Functions CO1
a. Write a Python program to define and use functions.
b. Write a Python program to demonstrate the use of Built-in Functions.
c. Write a Python Program to implement Lambda Functions.

SPPU B.Sc. Data Science Syllabus from 2024-25 28

 3 List, Tuples, Dictionaries and Sets CO1
a. Write a Python Program to create list, apply various functions to it.
b. Write a Python Program to demonstrate concept of aliasing and cloning.
c. Write a Python Program to implement tuples for storing data. Verify the immutability
property on tuples.
d. Write a Python Program to implement Dictionary and operations on dictionaries.
e. Write a Python Program to create sets and various operations on it.
4 Arrays and String CO2
a. Write a Python Program to implement arrays for storing homogeneous data items.
b. Apply indexing and slicing operations to access elements of array.
c. Write a Python Program to demonstrate operations and properties of string data types.
d. Write a Python Program implement and demonstrate the use of Membership operators
and Identity operators
5 Object Oriented Programming CO3
a. Write a Python program to define classes and create objects.
b. Program to implement the inheritance.
c. Program to implement the polymorphism.
6 Modules and Packages CO4
a. Write Python program to import built in and user defined modules.
b. Write Python program to import built in and user defined packages.
7 Python Numpy CO5
a. Assignments on Numpy basics.
b. Assignments on Numpy Arrays.
c. Assignments on Numpy Linear Algebra
d. Assignments on Numpy Statistics
e. Assignments on Numpy Strings
8 Python Pandas CO5
a. Assignments on reading and writing text, CSV files using Pandas
9 Plotting in Python CO5
a. Assignments on plotting graphs in python using Matplotlib and Pyplot
10 Assignments on Exception Handling CO6
11 Assignments on GUI CO6

SPPU B.Sc. Data Science Syllabus from 2024-25 29

 Savitribai Phule Pune University
B.Sc. Data Science (2023 Pattern)
Semester-II

DS171VSCP : Excel and Advanced Excel

No. of Credits: Teaching Scheme Examination Scheme

02 Practical: 4 Hrs/Week Continuous Evaluation:15 Marks
End Semester : 35 Marks
Prerequisites
 Basic Computer Skills and Mathematics Skill.
Objectives
 To familiarize the student in introducing and exploring MS excel.
 To provide different ways of representation and exploratory data analysis in excel.
 To prepare the students to use excel in their project works
 Analyze data like a professional.
Course Outcomes
On Completion of this course, student will be able to -
CO1: To Implement fundamental concept of Microsoft Excel
CO2: Perform calculations in excel and apply excel functions.
CO3: Represent data using charts and diagrams
CO4: Design advanced graphic presentations on stored data.
CO5: Perform various advanced data tools and data analytics.
Unit Name of Unit Teaching CO Targeted
No. Hours
1 Introduction to Microsoft Excel 8 CO1
 Concepts of Work book &Work sheets
 Various Data Types
 Using different features with data, Cell and Texts
 Inserting, Removing & Resizing of Columns & Rows
 Working with Data and Ranges
 Entering data into worksheet
 Saving & quitting worksheet
 Opening and moving around in an existing worksheet
 Toolbars and menu, keyboard shortcuts
 Working with single and multiple workbook- copying, renaming, moving, adding and
deleting, copy in gentries and moving between work books

SPPU B.Sc. Data Science Syllabus from 2024-25 30

 Different Views of Work sheets
 Column Freezing, Labels, Hiding, Splitting etc.
 Using different features with Data and Text; Advanced paste special techniques
2 Formulas ,Functions and charts in Excel 8 CO1,CO2,CO3
 Use of Formulas
 Calculations and Functions
 Chart Tools
 Different types of charts and their use
 Logical Functions
 Text Functions
 Date and Time Functions
 Lookups.
3 Advance Data Tools 6 CO5
 What-if-Analysis- Goal Seek, Data Table
 Scenario Manager
 Formatting Charts, 3D Graphs
4 Advanced Graphing and Charting 6 CO3,CO4
 Formatting and customizing Pivot tables
 Using advanced options of Pivot tables, Pivot charts
 Line, Bar and Pie charts
 Scatter plots
 Histograms.
5 Analytics using Excel 8 CO5
 Data analysis using normal chart
 Regression in Excel
 Correlation, stddev, average, ANOVA
Reference Books
1. Mastering MS Excel: Functions and Formulas, Webtech (Khanna Publications)
2. Microsoft Excel 2019 Data Analysis and Business Modeling, Wayne Winston, 2019
3. Advance Excel 2016, training Guide, By Ritu Arora

SPPU B.Sc. Data Science Syllabus from 2024-25 31

 Savitribai Phule Pune University
B.Sc. Data Science (2023 Pattern)
Semester-II
DS191MN : Probability and Descriptive Statistics
No. of Credits: 02 Teaching Scheme Examination Scheme
Theory: 2 Hrs/Week Continuous Evaluation:15 Marks
End Semester : 35 Marks
Prerequisites
 Basics of Set theory, Mathematical operations
Objectives
 To acquaint students with some basic concepts in Statistics.
 To introduce to some elementary statistical methods of analysis of data.
 To revise the basic concepts of probability, axiomatic theory of probability.
 To understand the concept of random variable
 To study probability distribution (univariate and bivariate) discrete random
variables, expectation and moments of probability distribution.
Course Outcomes
On Completion of this course, student will be able to –
CO1: Identify the different types of variables and data.
CO2:Compute various measures of central tendency, dispersion, skewness and kurtosis.
CO3:Analyze data pertaining to attributes and to interpret the results.
CO4: Identify the nature of distribution.
CO5:Distinguish between random and non-random experiments.
CO6:Find the probabilities of events and its expectation, mean, variance, etc.
Unit Name of Unit Teaching CO Targeted
No. Hours
1 Introduction to Statistics 03 CO1
 Meaning of Statistics and its importance in data science. Concept of population and sample.
Types of characteristics (variables and attributes), Types of data (primary and secondary).
Raw data and its classification. Ungrouped frequency distribution, grouped frequency
distribution and cumulative frequency distribution.
2 Measures of Central Tendency and Dispersion 12 CO2, CO3
 Measures of central tendency: Concept of central tendency of statistical data. Statistical
averages: Arithmetic mean (Definition, effect of change of origin and scale), Geometric
Mean and Harmonic Mean, median and mode, partition values (Definitions and examples
for ungrouped and grouped data). Situations where one kind of average is preferable to
other.

SPPU B.Sc. Data Science Syllabus from 2024-25 32

 Measures of dispersion: Concept of dispersion. Range, Semi-interquartile range (Quartile
deviation): Definition. Mean deviation: Definition, minimality property (without proof),
Variance and standard deviation: Definition, effect of change of origin and scale. Mean
squared deviation: Definition, minimality property of mean squared deviation (without
proof), Measures of dispersion for comparison: coefficient of range, coefficient of quartile
deviation and coefficient of mean deviation, coefficient of variation(C.V.).
3 Moments, Skewness and Kurtosis 05 CO4
 Moments: Raw moments and Central Moments (Definition for for ungrouped and grouped
data). Relation between Raw moments and Central Moments (upto 4 th order without proof).
 Skewness: Concept of skewness of frequency distribution, positive skewness, negative
skewness, symmetric frequency distribution. Bowley’s coefficient of skewness(Definition
and Examples and Bowley’s coefficient of skewnesslies between −1 to 1 (without proof)).
Karl Pearson’s coefficient of skewness (Definition and Examples). Measures of skewness
based on moments (Definition and Examples).
 Kurtosis: Concept of kurtosis, leptokurtic, mesokurtic and plat ykurtic frequency
distributions. Measures of kurtosis based on moments (Definition and Examples).
4 Introduction to Probability 05 CO5
 Basics of Probability: Experiments/Models, Ideas of deterministic and non-deterministic
models. Random Experiment.
 Definitions: Sample space, Discrete sample space: finite and countably infinite, Event,
Elementary event, Complement of an event, Certain event, Impossible event.
 Occurrence of events: Concept of occurrence of an event. Algebra of events and its
representation in set theory notation. Occurrence of following events (i) at least one of the
given events, (ii) none of the given events, (iii) all of the given events, (iv) mutually
exclusive events, (v) mutually exhaustive events, (vi) exactly one event out of the given
events.
 Classical definition of probability and its limitations. Probability model, probability of an
event, equiprobable and non-equiprobable sample space.
 Axiomatic definition of probability. Theorems and results on probability with proofs based
on axiomatic definition such as 𝑃(𝐴𝑈𝐵) = 𝑃(𝐴) + 𝑃(𝐵) − 𝑃(𝐴 ∩ 𝐵). Generalization
𝑃(𝐴𝑈𝐵𝑈𝐶 ), 0 ≤ 𝑃(𝐴) ≤ 1 , 𝑃(𝐴) + 𝑃(𝐴΄) = 1 , 𝑃(𝛷 ) = 0 and when 𝐴 ⊆ 𝐵 then
𝑃 (𝐴 ) ≤ 𝑃 (𝐵 ).
5 Conditional Probability 05 CO6
 Definition of conditional probability of an event. Results on conditional probability.

SPPU B.Sc. Data Science Syllabus from 2024-25 33

 Definition of independence of two events 𝑃(𝐴 ∩ 𝐵) = 𝑃(𝐴)𝑃(𝐵). Pairwise independence
and mutual independence for three events.
 Multiplication theorem 𝑃(𝐴 ∩ 𝐵) = 𝑃(𝐴) 𝑃(𝐵|𝐴).
 Generalization to 𝑃(𝐴 ∩ 𝐵 ∩ 𝐶). Partition of the samplespace, prior and posterior
probabilities.Proof of Bayes’ theorem. Applications of Bayes’ theorem in reallife.
6 Univariate Probability Distributions and its
10 CO6
Mathematical Expectation
 Univariate Probability Distributions defined on Discrete Sample Space: Concept and
definition of a discrete random variable. Probability Mass Function (pmf) and cumulative
Distribution Function (cdf), 𝐹(·) of discrete random variable, properties ofcdf. Mode and
median of a univariate discrete probability distribution.
 Mathematical Expectation: Definition of expectation (mean) of a random variable,
expectation of a function of a random variable, Moment Generating Function (mgf) and
Cumulative Generating Function (cgf). Properties of mgf and cgf.
 Definitions of variance, standard deviation (SD) and Coefficient of variation (CV) of
univariate probability distribution, effect of change of origin and scale on mean, variance
and SD. Definition of raw, central and factorial raw moments of univariate probability
Distributions and their interrelations (without proof). Coefficients of skewness and kurtosis
based on moments.
Reference Books
1. Goon, A. M., Gupta, M. K. and Dasgupta, B. (1983). Fundamentals of Statistics, Vol. 1,
Sixth Revised Edition,The World Press Pvt. Ltd., Calcutta.
2. Gupta, S. C. and Kapoor, V. K. (1983). Fundamentals of Mathematical Statistics, Eighth
Edition, Sultan Chand and Sons Publishers, NewDelhi.
3. Gupta, S. C. and Kapoor, V. K. (1997). Fundamentals of Applied Statistics, Third
Edition, Sultan Chand and Sons Publishers, NewDelhi.
4. Neil, A. Weiss, (2016). Introductory Statistics, Tenth Edition, Pearson.
5. Purohit, S. G., Gore S. D., Deshmukh S. R. (2008). Statistics Using R, Narosa
Publishing House, NewDelhi.
6. Sarma, K. V. S. (2001). Statistics Made it Simple: Do it yourself on PC. Prentce Hall of
India, NewDelhi.
7. W. and Cochran W. G.(1989). Statistical Methods, Eighth Ed. EastWestPress.
8. Hoel, P. G. (1971). Introduction to Mathematical Statistics, John Wiley and Sons, New
York.
9. Hogg,R.V.andCraig, R.G.(1989).Introduction to Mathematical Statistics, Ed. MacMillan

SPPU B.Sc. Data Science Syllabus from 2024-25 34

 Publishing Co., NewYork.
10. Mayer, P. (1972). Introductory Probability and Statistical Applications, Addison Wesley
Publishing Co.,London.
11. Mood, A. M. and Graybill, F. A. and Boes D.C. (1974). Introduction to the Theory of
Statistics, Ed. 3, McGraw Hill Book Company.
12. Rao, VLS Prakash (2008). First Course in Probability and Statistics, New Age
International Publishers, New Delhi.
13. Ross S. (2002). A First Course in Probability, Sixth Edition, Pearson Education, Inc. &
Dorling Kindersley Publishing,Inc.

SPPU B.Sc. Data Science Syllabus from 2024-25 35

 Savitribai Phule Pune University
B.Sc. Data Science (2023 Pattern)
Semester-II
SEC151DS : Graph Theory
No. of Credits: 2 Teaching Scheme Examination Scheme
Theory: 2 Hrs/Week Continuous Evaluation: 15 Marks
End Semester : 35 Marks
Prerequisites
 Basics of mathematics, Set Theory
Objectives
 To introduce students about graph, graph models, types of graph, connectivity,
applications of graph theory.
 To know how to find shortest path for different Eulerian and Hamiltonian circuit.
 To introduce students about Trees, applications of trees, binary tree, tree traversal ,
spanning trees.
 To know how to find minimum spanning trees.
 To make students familiar with the use of all these concepts as tools in other areas of
the course curriculum.
Course Outcomes
On Completion of this course, student will be able to :
CO1:Understand the graph, and graph models, terminology of graph.
CO2:Students can solve examples on adjacency and incidence matrix.
CO3:Identify the Euler tours and Hamiltonian cycle and find shortest path.
CO4:Able to Compute the shortest spanning trees.
CO5:Students can solve the problems on tournaments and traffic flow.
Unit Name of Unit Teaching CO Targeted
No. Hours
1 Graphs and Graph Models 4 CO1, CO5
Graph: Definition, basic terminology of Graph, Graph Models, Social networks,
Communication networks, Information networks ,Software Design Applications,
Transportation networks, Biological networks, Tournaments.
2 Graph Isomorphism 6 CO2
Handshaking lemma, Special Types of Graph, Directed graph, Matrix representation of graph,
Definition of isomorphism,Examples on isomorphism of graphs.
3 Connected Graph 10 CO3
Walk, trail, path, cycle, connected graph, disconnected graph, component, Cut edge, Cut vertex,

SPPU B.Sc. Data Science Syllabus from 2024-25 36

Cut set, Vertex connectivity, edge connectivity, Minimal degree of a graph, Relation between
Vertex connectivity, edge connectivity and Minimal degree of a graph,Weighted graph,
Shortest path algorithm, Dijkstra's algorithm
4 Eulerian and Hamiltonian Graphs . 6 CO3
The Konigsberg Seven Bridge problem, Euler’s path, Euler’s circuit, Eulerian graph, Fleury’s
algorithm, Hamilton path, Hamilton Circuit, Hamiltonian graph, Applications of Eulerian and
Hamiltonian graph: Traveling Salesman problem, Chinese Postman problem.
5 Trees 10 CO4
Definition of tree, basic terminology of tree, properties of trees, Eccentricity of a vertex,
Centre, diameter, radius of a tree, Spanning Tree, Chords and branches of Spanning Tree,
Shortest spanning tree, Kruskal’s algorithm, M-ary tree, binary tree, Tree traversal, Ordered
rooted tree, polish notation, arborescence.
Reference Books
1. Kenneth Rosen, Discrete Mathematics and It’s Applications, Tata McGraw Hill, Seventh
Edition.
2. Narsingh Deo, Graph Theory with applications to computer science and engineering,
Prentice Hall.
3. Dougals B. West, Introduction to Graph Theory, Pearson Education, Second edition.

SPPU B.Sc. Data Science Syllabus from 2024-25 37

 Savitribai Phule Pune University

Open Electives/General Electives

For other than faculty of Science and Technology

Offered by Board of Studies (BOS) in Computer Science

Course Course code Course Name Credits Teaching Examination

Type Scheme Scheme and
Hrs/Week Marks
T P TH PR C E Total
H R E E
FY (Level 4.5) SEMESTER I
OE101DS Office Automation 2 - 2 - 15 35 50
GE/OE OE102DSP Lab Course based on - 2 - 4 15 35 50
Office Automation
FY (Level 4.5) SEMESTER II
OE151DS Web Design 2 - 2 - 15 35 50
GE/OE OE152DSP Lab Course based on Web - 2 - 4 15 35 50
Design
SY (Level 5.0) SEMESTER III
GE/OE OE201DS E commerce 2 - 2 - 15 35 50
SY (Level 5.0) SEMESTER IV
GE/OE OE251DSP Digital Marketing - 2 - 4 15 35 50

SPPU B.Sc. Data Science Syllabus from 2024-25 38

 Savitribai Phule Pune University

Open Electives/General Electives Sem-I

For other than faculty of Science and Technology

Offered by Board of Studies (BOS) in Computer Science
OE101DS: Office Automation
No. of Credits: 2 Teaching Scheme Examination Scheme
Theory: 2 Hrs/Week Continuous Evaluation: 15 Marks
End Semester : 35 Marks
Prerequisites
 Basic knowledge and understanding of computer
Objectives
 To provide the basic knowledge of computers and operating systems
 To understand the use of software application in day-to-day activities
 To provide in depth training for office automation
 To teach the usage of Internet and Email
Course Outcomes
On completion of the course, student will be able to–
CO1: Understand the basics of computer and identify the components of computers
CO2: Understand and Apply various office tools and techniques to execute office work
efficiently
CO3: Acquainted with the usage of Internet
CO4: Understand and use Email for office work
Unit Name of Unit Teaching CO Targeted
No. Hours
1 Fundamental of Computers 6 CO1
1.1 Overview of a Computer-Definition, functionalities of Computer
1.2 Generations and Classification of Computers
1.3 Functional Components of a Computer
1.4 Applications Of Computers
1.5 Software and Hardware-Definition, types of software
1.6 Introduction to various Operating systems-Windows,Linux,Android,IOS
2 Word Processing 6 CO2
2.1 Introduction to Microsoft Word(MS-Word)
2.2 The File Tab/Office Button-Creating new document,saving document,opening existing
document,print document,publish document,close document
2.3 The Home Tab- Typing, Editing, Proofing and Reviewing, Formatting Text & Paragraphs,
Automatic Formatting and Styles
2.4 The Insert Tab- Pages,Working with Tables, Illustrations, Links, Header and Footer,
Textand Symbols
2.5 The Layout Tab-Page setup, Page background, Paragraph
2.6 The View Tab-Document Views, Show/Hide, Zoom
2.7 The Mailings Tab-Create,Start Mail Merge,Write and Insert Fields, Preview Results
2.8 The Review Tab-Proofing, Comments
SPPU B.Sc. Data Science Syllabus from 2024-25 39
 3 Spreadsheet 6 CO2
3.1 Introduction to Microsoft Excel(MS-Excel)
3.2 The Home Tab-Font, Clipboard, Alignment, Number, Styles, Cells, Editing
3.3 The Insert Tab-Tables, Illustrations, Charts, Links, Text
3.4 The Page Layout Tab-Page setup,Scale to fit,Sheet options
3.5 The Formulas Tab-Insert Function, Function Library(Autosum, Date time, Math, Statistical
functions)
3.6 The Data Tab-Sort & filter
3.7 The View Tab-Workbook views,Show/Hide,Zoom,Freeze Panes
4 Power Point Presentation 6 CO2
4.1 Introduction to Microsoft Power Point (MS-Power Point)
4.2 The Home Tab-Slides,Font,Paragraphs,Drawing,Editing
4.3 The Insert Tab-Tables,Illustrations,Links,Text,Media(Audio,Video)
4.4 The Design Tab-Themes, Slide Orientation,Background
4.5 The Animation Tab-Transition to the slide, Animation
4.6 The Slideshow Tab-Start slide show, Setup
5 Basics Of Internet 6 CO3, CO4
5.1 Basics of Internet
5.1.1 Introduction to Internet & WWW
5.1.2 Website Address and URL
5.1.3 Applications of Internet
5.1.4 Modes of Connecting Internet (Hotspot, Wi-Fi, USB Tethering)
5.1.5 Popular Web Browsers (Microsoft Edge, Google Chrome, Mozilla Firefox,Safari,
etc.)
5.1.6 Popular Search Engines.(Google,Bing,Startpage ,DuckDuckGo etc.. )
5.2 E-mail:
5.2.1 Configuring an E-mail Account
5.2.2 Composing and Sending Mail
5.2.3 Receiving, Replying to and Forwarding Mail
Reference Books
1. P.K. Sinha , "Computer Fundamentals" , BPB publications, 8th Edition
2. Microsoft Word &Powerpoint For Beginners & Power Users 2021: The Concise Microsoft
Word & PowerPoint A-Z Mastery Guide for All Users Paperback – May 11, 2021by Tech
Demystified (Author)
3. Livingston David, “Fundamentals of Computer & Internet”, Notion Press, ISBN:
9781639407255
4. Lisa A. Bucki , John Walkenbach, FaitheWempen , Michael Alexander, Dick Kusleika,
"Microsoft Office 2013 Bible", Wiley , ISBN-13 : 8126543625-978
5. Satish Jain/M.Geeta/Kratika , "Office 2010 Training Guide", BPB Publications, ISBN-13 : -
978 9381068045
6. RameshBangia ,"Learning Microsoft Office 2010", Khanna Book Publishing
Company,ISBN-13 : 9381068045-978
7. Robert T. Grauer , Maryann Barber ,"Exploring Microsoft Office Professional 2000,
Volume II", Pearson , ISBN-10 : 0130111007

SPPU B.Sc. Data Science Syllabus from 2024-25 40

 Savitribai Phule Pune University

Open Electives/General Electives Sem-I

For other than faculty of Science and Technology

Offered by Board of Studies (BOS) in Computer Science
OE102DSP: Lab Course on Office Automation
No. of Credits: 2 Teaching Scheme Examination Scheme
Theory: 4 Hrs/Week Continuous Evaluation: 15 Marks
End Semester : 35 Marks
Prerequisites
 Basic knowledge and understanding of computer
Objectives
 To provide the basic knowledge of computers and windows operating system
 To create and format word documents with basic MS-word features
 To explore Microsoft Excel environment
 To create impactful and professional power point presentations
 To draft and send emails
Course Outcomes
On completion of the course, student will be able to–
CO1: Understand the basics of computer and identify the components of computers
CO2: Learn various office tools and techniques to execute office work efficiently
CO3: Use of Internet in day to day life
CO4: Understand working of Email for office work
Assign Title of Practical Assignment
ment
No.
1 Computer Basic Assignment
 Introduction to Windows Operating System
 Handling of Notepad, Wordpad, Paint, Calculator,Browsers
2 Word Processing Assignment 1
 Creating and formatting word document and adding hyperlinks
 Publish word document in pdf format
3 Word Processing Assignment 2
 Creating a table and formatting table
4 Word Processing Assignment 3
 Mail Merge
5 Excel Spreadsheet Assignment 1
 Creating and formatting simple spreadsheet
6 Excel Spreadsheet Assignment 2
 Inserting Charts and Graphs
7 Excel Spreadsheet Assignment 3
 Usage of function library(Math’s and Statistical functions)
SPPU B.Sc. Data Science Syllabus from 2024-25 41
 8 Excel Spreadsheet Assignment 4
 Sort, filter and conditional formatting
9 Power Point Assignment 1
 Creating and formatting presentation
10 Power Point Assignment 2
 Usage of themes, animations
11 Power Point Assignment 3
 Usage of Audio and Video clips in present
12 Simple E-Mail Assignment
 Creating E-mail account
 Composing, adding attachments and sending an E-mail
 Sending bulk mails using CC and BCC
 Handle different search engines

SPPU B.Sc. Data Science Syllabus from 2024-25 42

 Savitribai Phule Pune University

Open Electives/General Electives Sem-II

For other than faculty of Science and Technology

Offered by Board of Studies (BOS) in Computer Science
OE151DS: Web Design
No. of Credits: 2 Teaching Scheme Examination Scheme
Theory: 2 Hrs/Week Continuous Evaluation: 15 Marks
End Semester : 35 Marks
Prerequisites
 Basic computer knowledge and the ability to work with files.
 Knowledge of other programming languages will enhance your abilities with HTML
and web development.
 Knowledge and understanding of Internet.
Objectives
 To learn HTML tags and programming concepts and techniques.
 To develop the ability to logically plan and develop web pages.
 To learn to write, test, and debug web pages using HTML
 To learn to design Style sheets.
 To know to link and publish Web pages
Course Outcomes
On completion of the course, student will be able to–
CO1: Understand the basic web related terminologies
CO2: Learn and use the HTML Tags.
CO3: Understand and resolves written HTML codes.
CO4: Design and develop the page using HTML codes, tables and forms
CO5: Learn and use the CSS to design WebPages.
CO6: Link and publish Web pages.
Unit Name of Unit Teaching CO Targeted
No. Hours
1 Introduction to Web Design 5 CO1
1.1 Introduction
1.2 Working of the Internet
1.3 Role of Web Servers, Clients(Communication)
1.4 Web Browsers
1.5 Working of the Internet , Intranet and WWW
1.6 E-Mail Servers and Protocols
1.7 E-mail Clients and Web Based Mail Access using Browser
1.8 Messenger Services and Clients(Chat)
1.9 Advantages and Disadvantages of Internet
1.10 Concept of effective Web Design (Web site, classification of website, Advantages and
SPPU B.Sc. Data Science Syllabus from 2024-25 43
Disadvantages. Of website)
1.11 Fundamental Principles of Web page design and issues
2 Getting Started with HTML 6 CO3,CO5
2.1 Introduction to scripting Languages
2.2 HTML Editing Tools
2.3 WYSISYG Authoring Tools
2.4 My First HTML Script
2.5 Basic HTML Document Structure
2.6 Common HTML Tags and it’s attributes
2.7 Design HTML Tags
2.8 Text Formatting and Styles
2.9 Images and Graphics
2.10 Button, Formatting and Style
2.11 Lists
2.12 Hyperlinks
2.13 Multimedia
2.14 Frames
2.15 HTML Forms
2.16 Linking Web pages
2.17 Publishing Web Pages
3 Tables 6 CO3, CO4
3.1 The summary of Table tags
3.2 Introduction to tables
3.3 The Basic table structure
3.4 Affecting table appearance
3.5 Table troubleshooting
3.6 Tips and tricks
3.7 Standard table templates
3.8 Multipart images in tables
4 Frame / Forms 6 CO3,CO4
4.1 The summary of Frame tags
4.2 Introduction to frames
4.3 The basic frameset structure
4.4 The frame function and appearance
4.5 Targeting frames
4.6 The Inline (Floating) frames
4.7 Frame design tips and tricks
4.8 Summary of FORM tags
4.9 Introduction to Forms and The basic form (FORM)
4. 10 The FORM elements and FORM attributes
4.11 Affecting the appearance of forms
4.12 Unconventional use of FORM elements
4.13 Demystifying CGI
4.14 Retrieving the parameter value using getParameter () method
SPPU B.Sc. Data Science Syllabus from 2024-25 44
 5 CSS 7 CO5
5.1 Introduction of CSS
5.2 CSS Syntax
5.3 Ways to Insert CSS
5.4 Background image handling
5.5 Background colour management using CSS
5.6 Text management using CSS
5.7 Font management using CSS
5.8 Managing Hyperlinks using CSS
5.9 Managing Lists using CSS
5.10 Designing Tables using CSS
5.11 Working with BOX Model
5.12 Designing Borders
5.13 Designing Outline
5.14 Setting Page Margin using CSS
Reference Books:
1. Computer Programming For Beginners:Learn The Basics Of HTML5-Joseph Connor
2. The Complete Reference HTML & CSS-Fifth Edition-Thomas A.Powell
3. Learning Web Design: A beginner’s Guide To HTML, CSS, Javascript, and Web Graphics
- Jennifer Robbins
4. HTML5: The Missing Manual - Matthew MacDonald

Sr. No. Assignment /Topic

1 Creating Simple HTML Pages..
2 HTML programming using lists and hyperlinks
3 HTML programming using tables
4 HTML programming using frames ,iframes
5 Advanced feature of HTML (Inline CSS and Internal CSS).
6 Advanced features of HTML (External CSS)
7 Creation of forms, small case study to create HTML pages using all the above
learnt techniques
8 Creation of Forms layout designing by using div element with CSS property
9 Create Multiple Web pages link them to publish a small website.

SPPU B.Sc. Data Science Syllabus from 2024-25 45

 Savitribai Phule Pune University

Open Electives/General Electives Sem-II

For other than faculty of Science and Technology

Offered by Board of Studies (BOS) in Computer Science
OE152DSP: Lab Course on Web Design
No. of Credits: Teaching Scheme Examination Scheme
2 Theory: 4 Hrs/Week Continuous Evaluation: 15 Marks
End Semester : 35 Marks
Prerequisites
 Basic knowledge and understanding of computer and Internet.
 Awareness of internet browsing and website navigation
Objectives
 To understand the basic structure and syntax of HTML including elements,tags and
attributes.
 To explore the hierarchical structure of HTML documents, including the head and
body section.
 To learn to build simple web pages integrating text, images, links, lists, tables,
frames forms and Multimedia.
 To introduce styling with CSS to enhance visual presentation of HTML elements.
 To Master the creation of hyperlinks to connect web pages and navigate through
website effectively.
Course Outcomes
On completion of the course, student will be able to–
CO1: Understand the Basic structure and syntaxes of HTML.
CO2: Build HTML Documents.
CO3: Construct simple web pages including various elements like text, image, etc.
CO4: Understand the usage of CSS for enhancing visuals of HTML elements.
CO5: Link webpages using hyperlinks and navigate through website effectively.
CO6: Create impactful and professional website.
Sr.No. Title of Practical Assignment
1 Web site Basic Handling of HTML editors, Browsers
2 Fundamental HTMLtags HTML, Head, title, body, text, links Text Formatting
3 Creating HTML Pages Anchor tag and hyperlink
4 Creating List using with attributes
5 Creating Tables using with attributes
6 Creating Frames using with attribute
7 Creating Forms using with attributes

SPPU B.Sc. Data Science Syllabus from 2024-25 46

 8 Creating HTML Pages with image mapping
9 Creating HTML Pages with multimedia (audio, Video)
10 Creating HTML with inline CSS
11 Creating HTML Pages External CSS
12 Creating Various Web pages of small website, link them and navigate
effectively

SPPU B.Sc. Data Science Syllabus from 2024-25 47