Foundational Level Course

Mathematics for Data Science I

This course introduces functions (straight lines, polynomials, exponentials and logarithms) and discrete mathematics (basics, graphs) with many examples. The students will be exposed to the idea of using abstract mathematical structures to represent concrete real life situations.

Course ID: BSCMA1001

Course Credits: 4

Course Type: Foundational

Prerequisites: None

What you’ll learn

Course structure & Assessments

12 weeks of coursework, weekly online assignments, 3 in-person invigilated quizzes, 1 in-person invigilated end term exam. For details of standard course structure and assessments, visit Academics page.

WEEK 1 - Click Here | Set Theory - Number system, Sets and their operations |

WEEK 2 | Relations and functions - Relations and their types, Functions and their types, Rectangular coordinate system |

WEEK 3 | Straight Lines- Slope of a line, Parallel and perpendicular lines, Representations of a Line, General equations of a line, Straight-line fit |

WEEK 4 | Quadratic Functions - Quadratic functions, Minima, maxima, vertex, and slope, Quadratic Equations |

WEEK 5 | Algebra of Polynomials - Addition, subtraction, multiplication, and division, Algorithms |

WEEK 6 | Graphs of Polynomials - X-intercepts, multiplicities, end behavior, and turning points, Graphing & polynomial creation |

WEEK 7 | Functions - Horizontal and vertical line tests, Exponential functions, Composite functions, Inverse functions |

WEEK 8 | Logarithmic Functions - Properties, Graphs, Exponential equations, Logarithmic equations |

WEEK 9 | Graph Theory - Representation of graphs, Breadth-first search, Depth-first search, Applications of BFS and DFS |

WEEK 10 | Directed Acyclic Graphs - Complexity of BFS and DFS, Topological sorting and longest path, Transitive closure, Matrix multiplication |

WEEK 11 | Graph theory Algorithms - Single source shortest paths, Dijkstra's algorithm, Bellman-Ford algorithm, All-pairs shortest paths, Floyd–Warshall algorithm, Minimum cost spanning trees, Prim's algorithm, Kruskal's algorithm |

WEEK 12 | Revision |

Prescribed Books

The following are the suggested books for the course:

Introductory Algebra: a real-world approach (4th Edition) - by Ignacio Bello

About the Instructors

Experienced Associate Professor with a demonstrated history of working in the higher education industry. Skilled in Mathematical Modeling, R, Stochastic Modeling, and Statistical Modeling. Strong education professional with a Doctor of Philosophy (Ph.D.) focused in Mathematical Statistics and Probability from Indian Institute of Technology, Bombay.

Madhavan Mukund studied at IIT Bombay (BTech) and Aarhus University (PhD). He has been a faculty member at Chennai Mathematical Institute since 1992, where he is presently Deputy Director and Dean of Studies. His main research area is formal verification. He has active research collaborations within and outside India and serves on international conference programme committees and editorial boards of journals.

He has served as President of both the Indian Association for Research in Computing Science (IARCS) (2011-2017) and the ACM India Council (2016-2018). He has been the National Coordinator of the Indian Computing Olympiad since 2002. He served as the Executive Director of the International Olympiad in Informatics from 2011-2014.

In addition to the NPTEL MOOC programme, he has been involved in organizing IARCS Instructional Courses for college teachers. He is a member of ACM India's Education Committee. He has contributed lectures on algorithms to the Massively Empowered Classroom (MEC) project of Microsoft Research and the QEEE programme of MHRD.

Other courses by the same instructor: BSCCS1001 - Computational Thinking , BSCCS2002 - Programming, Data Structures and Algorithms using Python and BSCCS2005 - Programming Concepts using Java