SGBAU · Third Year B.E. Computer Science and Engineering · NEP 2020
Data Science and Statistics
5CS223PE1 · Elective I · Semester V · 3 credits · IE 40 + ESE 60
One of the Elective I options.
Unit 1: Introduction to Data Science
6 hoursData science and its relationship to other fields and to information science, computational thinking, the skills and tools of data science, ethics, bias and privacy, data types, data collection and preprocessing.
Examined in the 60-mark end-semester paper
- The data science process
- Data science versus data analytics
- Data collection strategies
- Data wrangling and preprocessing
- Data science roles, applications and data security
Unit 2: Data Analytics and Statistical Techniques
6 hoursData analysis and analytics — descriptive, diagnostic, predictive and prescriptive; exploratory data analysis, mechanistic analysis and an introduction to regression analysis.
Examined in the 60-mark end-semester paper
- The data analytics lifecycle
- Descriptive statistics
- Univariate and multivariate visualisation
- Predictive modelling applications
Unit 3: Python for Data Science
6 hoursPython environments and basic examples, control structures, importing datasets, visualisation and plotting, correlation analysis, and linear and multiple linear regression in Python.
Examined in the 60-mark end-semester paper
- Python for data science: NumPy, Pandas and Matplotlib
- Correlation
- Regression: linear and logistic
Unit 4: Machine Learning for Data Science
6 hoursMachine learning, supervised and unsupervised learning, classification and clustering concepts, regression in machine learning, and gradient descent and optimisation basics.
Examined in the 60-mark end-semester paper
- Introduction to machine learning
- Types of learning
- Gradient descent
Unit 5: Supervised Learning Techniques
6 hoursLogistic and softmax regression, k-nearest-neighbour classification, decision trees, random forests and the naive Bayes classifier.
Examined in the 60-mark end-semester paper
- Classification: naive Bayes and decision trees
- k-nearest neighbour classification
- Ensembles: bagging and boosting
Unit 6: Unsupervised Learning and Advanced Concepts
6 hoursUnsupervised learning, agglomerative and divisive clustering, the expectation-maximisation algorithm, and an overview of reinforcement learning and its applications.
Examined in the 60-mark end-semester paper
- Clustering: K-means and hierarchical
- Hierarchical and density-based clustering
- Reinforcement learning basics
Unit contents are summarised from the official SGBAU syllabus . AiCanCode.org is not affiliated with Sant Gadge Baba Amravati University (SGBAU).