Advanced Mathematics: Calculus & Analysis
Master differential and integral calculus, real analysis, and multivariable functions through structured, concept-first teaching.
0+
Years of Experience
0+
Students Taught
0
Courses
0+
Lectures Recorded
0+
Study Materials
Dr. Arjun Mehta
Senior Lecturer & Academic Mentor
Ph.D.
IIT Bombay
Senior Lecturer & Academic Mentor · IIT Bombay
Senior Lecturer at IIT Bombay with 15+ years of experience in Mathematics and Computer Science. Published researcher, award-winning educator, and mentor to thousands of students.
Ph.D., IIT Bombay
Computer Science & Algorithms
15+ Years Teaching
Undergraduate & Postgraduate
Best Teacher Award
IIT Bombay, 3 consecutive years
3,200+ Students
Mentored & guided
Areas of Expertise
Rigorous, well-structured courses across core academic disciplines — built to develop deep understanding from foundations up.
Carefully designed courses that build understanding step by step — from core concepts to advanced applications.
Browse all coursesMaster differential and integral calculus, real analysis, and multivariable functions through structured, concept-first teaching.
Build deep expertise in algorithms and data structures — from arrays and linked lists to graphs and dynamic programming.
Develop a strong intuitive and rigorous understanding of linear algebra — the mathematical language of machine learning and engineering.
New lectures added regularly across all subjects and difficulty levels.
View all lecturesDevelop a thorough understanding of dynamic programming starting from the classic Fibonacci problem. We build intuition for identifying optimal substructure and overlapping subproblems.
A rigorous introduction to one-dimensional kinematics using calculus. We derive the equations of motion from first principles and apply them to a variety of problems.
We introduce vectors in n-dimensional space, covering addition, scalar multiplication, dot product, and their geometric meanings including angles and projections.
A complete treatment of linked list data structures — implementation, traversal, reversal, and detecting cycles. Includes Floyd's cycle detection algorithm.
Lecture notes, revision guides, question banks, and previous year papers — all curated and ready to download.
Explore all resourcesData Structures & Algorithms
Advanced Mathematics: Calculus & Analysis
Discrete Mathematics for Computer Science
Probability & Statistics for Engineers
Real feedback from students who have completed courses on AcadPro.
“Dr. Mehta's approach to calculus is unlike any I've experienced before. He breaks down epsilon-delta proofs in a way that finally made them click for me. I went from dreading analysis to genuinely enjoying it. The lecture notes alone are worth every moment.”
Priya Sharma
Advanced Mathematics: Calculus & Analysis
Important updates, new content, and upcoming events — all in one place.
View all announcementsThe platform will undergo scheduled maintenance on Sunday, 8th September 2024 between 02:00 and 06:00 IST. During this window, the platform will be unavailable. Please plan your study sessions accordingly. All progress and data will be preserved. Thank you for your understanding.
Assignment 3 for the Data Structures & Algorithms course is now live. This assignment covers dynamic programming and includes 8 problems of varying difficulty. The submission deadline is 15th September 2024. Please read the instructions carefully — solutions must include both the approach explanation and the code implementation. Partial credit will be given for correct approaches even if the implementation has minor errors.
The end-of-semester Advanced Calculus exam is scheduled for 20th September 2024. I have uploaded a comprehensive revision package including previous year papers (2019–2024) with full solutions, a formula reference sheet, and a practice quiz covering all major topics. I strongly recommend completing the revision quiz at least one week before the exam to identify any areas requiring further attention.
I have just completed uploading a new set of 6 lectures covering graph algorithms in depth — including Dijkstra's algorithm with proof of correctness, Bellman-Ford, Floyd-Warshall, Kruskal's and Prim's MST algorithms. These lectures are part of the Data Structures & Algorithms course but are also accessible to anyone interested in graph theory.