Mathematics underpins every aspect of computing, from algorithms and artificial intelligence to data analysis and cryptography. Applied Mathematical Methods for Computing equips you with essential tools in algebra, vectors, matrices, sequences, series, combinatorics, probability, and statistics. These methods provide the structure and reasoning needed to solve complex computational problems. Across four modules, you’ll explore advanced techniques, practise solving real-world examples, and build the confidence to apply mathematics in programming, algorithms, and data science. By the end, you’ll have a comprehensive toolkit for modelling systems, analysing uncertainty, and reasoning rigorously about computational tasks. Whether you’re preparing for advanced studies in computer science or strengthening your foundations for professional roles, this course offers the mathematical depth you need to succeed.
Syllabus 4
Algebra, vectors and matrices 4.5 hours
In this module, we will introduce algebra, vectors and matrices. This week, we will introduce vectors and vector spaces and look at how to perform basic operations with vectors. We will then introduce linear transformations and their representation via matrices. We will use matrices to describe and…
Sequence and Series 6 hours
In this module, we will cover the key concepts of sequences, series and the principle of mathematical induction. We will understand what a sequence is and look at its convergence and divergence. We will also introduce the concept of series.
Combinatorics 6 hours
In this module, we will cover the following key concepts: counting, permutations, combinations, inclusions, exclusions and the Pigeonhole Principle.
Probability and Statistics 3 hours
This week, we will introduce basic concepts of statistics. We will look at how to estimate probabilities from data and how to define and extract important measures from data, like mean, median and variance.
Advantages and disadvantages
Advantages
Structured courses with graded quizzes, assignments and deadlines you can reset.
A shareable certificate from the university or company when you pay.
Financial aid is often approved for students in India (apply 15 days before you need it).
Self-paced: start any time.
A clear syllabus (4 parts) you can see before you start.
Disadvantages
Paid after a 7-day free trial (Coursera Plus or per course).
Some courses can be audited for free, but graded work and certificates need payment.
Some points apply to every course of this kind; see how we rank.
This course is paid. Here is how to take it for free
Free trials: You can start a 7-day free trial for many individual courses, Specializations, or a Coursera Plus subscription to test full course features. Cancel before the seventh day if you do not want to be charged.
Financial aid: If you cannot afford the fee for a certificate, you can apply for financial aid through the link on the course home page by filling out an application about your background and goals.
Taught by
Omar KarakchiLecture, Computing Department, Goldsmiths, University of London
This course provides an introduction to mathematical modeling of computational problems. It covers the common algorithms, algorithmic paradigms, and data structures used to solve these problems. The course emphasizes the relationship between algorithms and programming, and introduces basic performa…
-Learn more and enroll in the program: https://online.stanford.edu/programs/generative-ai-technology-business-and-society-program Recent advancements in generative AI are reshaping industries, pushing technological boundaries, and revolutionizing creative processes. In this fast-changing landscape…
For more information about Stanford's Artificial Intelligence programs visit: https://stanford.io/ai Delve into the exciting world of Artificial Intelligence with insights and research from the world's top experts. This playlist offers a comprehensive journey, from foundational machine learning con…
Led by Andrew Ng, this course provides a broad introduction to machine learning and statistical pattern recognition. Topics include: supervised learning (generative/discriminative learning, parametric/non-parametric learning, neural networks, support vector machines); unsupervised learning (cluster…
View the complete course: http://ocw.mit.edu/6-034F10 Instructor: Patrick Winston In these lectures, Prof. Patrick Winston introduces the 6.034 material from a conceptual, big-picture perspective. Topics include reasoning, search, constraints, learning, representations, architectures, and probabili…