Fds Course File
Fds Course File
MAHENDRA COLLEGE of
ENGINEERING
Salem-campus, attur main road, minnampalli, salem
Course File Evaluation Form
AI&DS
Subject Name: FUNDAMENTALS OF DATA SCIENCE AND ANALYTICS
Subject Code : AD3491
Faculty Name : Mrs.A.Brindha Monica Seles Year/ Semester :II/IV
MAHENDRA COLLEGE of
ENGINEERING
Salem-campus, attur main road, minnampalli, salem -636 106.
VISION
MISSION
VISION
MISSION
REGULATION 2021
SYLLABUS:
UNIT DETAILS HOURS
INTRODUCTION TO DATA SCIENCE
Need for data science – benefits and uses – facets of data – data science process –
setting the research goal – retrieving data – cleansing, integrating, and transforming 8
I data – exploratory data analysis – build the models – presenting and building
applications.
DESCRIPTIVE ANALYTICS
Frequency distributions – Outliers –interpreting distributions – graphs – averages -
II describing variability – inter quartile range – variability for qualitative and ranked
data - Normal distributions – z scores –correlation – scatter plots – regression – 10
regression line – least squares regression line – standard error of estimate –
interpretation of r2 – multiple regression equations – regression toward the mean.
INFERENTIAL STATISTICS
Populations – samples – random sampling – Sampling distribution- standard
III
error of the mean - Hypothesis testing – z-test – z-test procedure –decision
9
rule – calculations – decisions – interpretations - one-tailed and two-tailed
tests – Estimation – point estimate – confidence interval – level of
confidence – effect of sample size
ANALYSIS OF VARIANCE
t-test for one sample – sampling distribution of t – t-test procedure – t-test
IV
for two independent samples – p-value – statistical significance – t-test for 9
two related samples. F-test – ANOVA – Two factor experiments – three f-
tests – two-factor ANOVA –Introduction to chi-square tests.
PREDICTIVE ANALYTICS
V Lower - Bound Arguments - P, NP, NP- Complete and NP Hard Problems.
Backtracking – N Queen problem - Hamiltonian Circuit Problem – Subset
Sum Problem. Branch and Bound – LIFO Search and FIFO search - Assignment 9
problem – Knapsack Problem – Traveling Salesman Problem - Approximation
Algorithms for NP-Hard Problems – Traveling Salesman problem – Knapsack
problem
TOTAL HOURS 45
TEXT/REFERENCE BOOKS:
T/R BOOK TITLE/AUTHORS/PUBLICATION
David Cielen, Arno D. B. Meysman, and Mohamed Ali, “Introducing Data Science”,
T Manning Publications, 2016. (first two chapters for Unit I).
COURSE PRE-REQUISITES:
C.CODE COURSE NAME DESCRIPTION SEM
AI is a machine's ability to perform the cognitive functions
Artificial we associate with human minds, such as perceiving,
AL3391 3
Intelligence reasoning, learning, interacting with the environment,
problem-solving, and even exercising creativity.
COURSE OBJECTIVES:
1 To understand the techniques and processes of data science
2 To apply descriptive data analytics
3 To visualize data for various applications
4 To understand inferential data analytics
5 To analysis and build predictive models from data
COURSE OUTCOMES:
SNO DESCRIPTION
DELIVERY/INSTRUCTIONAL METHODOLOGIES:
☐ CHALK & TALK ☐ STUD. ASSIGNMENT ☐ WEB RESOURCES ☐ NPTEL/OTHERS
☐ LCD/SMART ☐ STUD. SEMINARS ☐ ADD-ON COURSES ☐ WEBNIARS
BOARDS
ASSESSMENT METHODOLOGIES-DIRECT
☐ ASSIGNMENTS ☐ STUD. SEMINARS ☐ TESTS/MODEL ☐ UNIV.
EXAMS EXAMINATION
☐ STUD. LAB ☐ STUD. VIVA ☐ MINI/MAJOR ☐ CERTIFICATIONS
PRACTICES PROJECTS
☐ ADD-ON COURSES ☐ OTHERS
ASSESSMENT METHODOLOGIES-INDIRECT
☐ ASSESSMENT OF COURSE OUTCOMES (BY ☐ STUDENT FEEDBACK ON FACULTY
FEEDBACK, ONCE) (TWICE)
☐ ASSESSMENT OF MINI/MAJOR PROJECTS BY ☐ OTHERS
EXT. EXPERTS
Prepared by Approved by
(HoD)
Format No: MCE/ 001
MAHENDRA COLLEGE of
ENGINEERING
Salem-campus, attur main road, minnampalli, salem -636 106.
REFERNCES:
1. Ellis Horowitz, Sartaj Sahni and Sanguthevar Rajasekaran, Computer Algorithms/ C++,
Second Edition, Universities Press, 2019.
2. Thomas H.Cormen, Charles E.Leiserson, Ronald L. Rivest and Clifford Stein, Introduction
to Algorithms, Third Edition, PHI Learning Private Limited, 2012.
3. S. Sridhar, Design and Analysis of Algorithms, Oxford university press, 2014.
4. Alfred V. Aho, John E. Hopcroft and Jeffrey D. Ullman, Data Structures and Algorithms,
Pearson Education, Reprint 2006.