Registry Synced

BSMA1001 - Mathematics for Data Science I

693 words
3 min read
FieldValue
Course CodeBSMA1001
LevelFoundational Level Course
Credits4
TypeFoundational
Pre-requisitesNone
VideosYouTube Playlist

πŸ“– Description

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.

πŸ—“οΈ Weekly Syllabus

WeekTopic
Week 1Set Theory - Number system, Sets and their operations, Relations and functions - Relations and their types, Functions and their types
Week 2Rectangular coordinate system, Straight Lines - Slope of a line, Parallel and perpendicular lines, Representations of a Line, General equations of a l
Week 3Quadratic Functions - Quadratic functions, Minima, maxima, vertex, and slope, Quadratic Equations
Week 4Algebra of Polynomials - Addition, subtraction, multiplication, and division, Algorithms, Graphs of Polynomials - X-intercepts, multiplicities, end be
Week 5Functions - Horizontal and vertical line tests, Exponential functions, Composite functions, Inverse functions
Week 6Logarithmic Functions - Properties, Graphs, Exponential equations, Logarithmic equations
Week 7Sequence and Limits - Function of One variable - β€’ Function of one variable β€’ Graphs and Tangents β€’ Limits for sequences β€’ Limits for function of one
Week 8Derivatives, Tangents and Critical points - β€’ Differentiability and the derivative β€’ Computing derivatives and L’HΛ†opital’s rule β€’ Derivatives, tangen
Week 9Integral of a function of one variable - β€’ Computing areas, Computing areas under a curve, The integral of a function of one variable β€’ Derivatives an
Week 10Graph Theory - Representation of graphs, Breadth-first search, Depth-first search, Applications of BFS and DFS; Directed Acyclic Graphs - Complexity o
Week 11Longest path, Transitive closure, Matrix multiplication Graph theory Algorithms - Single-source shortest paths, Dijkstra's algorithm, Bellman-Ford alg
Week 12Revision

πŸ“Ž Reference Documents

πŸ“š Books & Resources

Reference Documents / Books
        Sets & Functions (VOL 1)
            DOWNLOAD
        
        Calculus (VOL 2)
            DOWNLOAD
        
        GRAPH THEORY (VOL 3)
            DOWNLOAD
        
    
    

    
    
    
        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

Neelesh Upadhye
Associate Professor,
Department of Mathematics,
IIT Madras
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.
less
Visit website
Madhavan Mukund
Director,
Chennai Mathematical Institute
Madhavan Mukund studied at IIT Bombay (BTech) and Aarhus University (PhD). He has been a faculty member at Chennai Mathematical Institute since 1992.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.
...
more
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.
less
Visit website
Other courses by the same instructor:
BSCS1001 -
Computational Thinking
,
BSCS2002 -
Programming, Data Structures and Algorithms using Python
and
BSCS2005 -
Programming Concepts using Java

Document Outline
Table of Contents
System Normal // Awaiting Context

Intelligence Hub

Navigate the knowledge graph to generate context. The Hub adapts dynamically to surface backlinks, related notes, and metadata insights.