Mathematics for Computer Science (Coursera)

Mathematics for Computer Science (Coursera)

Welcome to Introduction to Numerical Mathematics. This is designed to give you part of the mathematical foundations needed to work in computer science in any of its strands, from business to visual digital arts, music, games.

Class Deals by MOOC List - Click here and see Coursera's Active Discounts, Deals, and Promo Codes.

At any stage of the problem solving and modelling stage you will require numerical and computational tools. We get you started in binary and other number bases, some tools to make sense of sequences of numbers, how to represent space numerical using coordinates, how to study variations of quantities via functions and their graphs. For this we prepared computing and everyday life problems for you to solve using these tools, from sending secret messages to designing computer graphics.
If you wish to take it further you can join the BSc Computer Science degree and complete the full module ‘Numerical Mathematics’. Enjoy!
Course 3 of 3 in the Introduction to Computer Science and Programming Specialization.

Syllabus

WEEK 1
Number bases - binary
In this week, we will cover the key concepts: Place value and Number systems. You will learn about the notion of number bases, how to do operate in binary.

WEEK 2
Number bases - other bases
In this week, we will extend the place value and number systems to Octal, Hexadecimal and any other bases. You will also be introduced to the usefulness of hexadecimal in computer science.

WEEK 3
Modular arithmetic
In this week, we will cover the key concept of congruence modulo an integer. You will also be introduced to the usefulness of congruence and modular arithmetic operations in computer science.

WEEK 4
Sequences
In this week, we will cover the key concept of number sequences. You will look into more detail at a special family of sequences, called progressions, and study arithmetic and geometric progressions.

WEEK 5
Series
In this week, we will cover the key concept of number series, building on number sequences. You will look into more detail at a special family of series arising from arithmetic and geometric progressions. You will look at expression summations of sequences using a compact form with a summation symbol.

WEEK 6
Introduction to Graph Sketching and Kinematics
In this week, we will cover the key concept of coordinate system, functions and graphical representation of functions, and kinematics. You will look at the example of modelling motion.

Go to Class
MOOC List is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

Related Courses

Geometría Analítica Preuniversitaria (Coursera) Coursera
Universidad Autónoma Metropolitana

Geometría Analítica Preuniversitaria (Coursera)

Líneas rectas, círculos, parábolas, elipses e hipérbolas son figuras geométricas que encontramos en nuestro derredor. Por ejemplo, mucha gente sabe que los planetas en nuestro sistema solar se mueven en órbitas elípticas teniendo al astro rey en un foco de esta figura. Sin embargo, pocos saben que la plaza de San Pedro en el Vaticano está construída sobre elipses donde sus focos se encuentran sobre las fuentes donde mucha gente se toma fotos. Estos son dos ejemplos que muestran la importancia de las figuras geométricas en nuestra vida.

Oct 5th 2026
5-12 Weeks
Introduction to Calculus (Coursera) Coursera
The University of Sydney

Introduction to Calculus (Coursera)

The focus and themes of the Introduction to Calculus course address the most important foundations for applications of mathematics in science, engineering and commerce. The course emphasises the key ideas and historical motivation for calculus, while at the same time striking a balance between theory and application, leading to a mastery of key threshold concepts in foundational mathematics.

Oct 5th 2026
5-12 Weeks
Approximation Algorithms Part I (Coursera) Coursera
École normale supérieure

Approximation Algorithms Part I (Coursera)

How efficiently can you pack objects into a minimum number of boxes? How well can you cluster nodes so as to cheaply separate a network into components around a few centers? These are examples of NP-hard combinatorial optimization problems. It is most likely impossible to solve such problems efficiently, so our aim is to give an approximate solution that can be computed in polynomial time and that at the same time has provable guarantees on its cost relative to the optimum.

Sep 28th 2026
5-12 Weeks
Algorithmic Thinking (Part 2) (Coursera) Coursera
Rice University

Algorithmic Thinking (Part 2) (Coursera)

Experienced Computer Scientists analyze and solve computational problems at a level of abstraction that is beyond that of any particular programming language. This two-part class is designed to train students in the mathematical concepts and process of "Algorithmic Thinking", allowing them to build simpler, more efficient solutions to computational problems.

Oct 5th 2026
4 Weeks
操作系统原理 (Operating Systems) (Coursera) Coursera
Peking University

操作系统原理 (Operating Systems) (Coursera)

操作系统原理》是针对计算机科学技术专业三年级本科生开设的一门专业基础课程。本课程着重学生系统观的培养,通过重点讲述操作系统的内部结构、工作原理及典型技术的实现,使学生建立起对操作系统的整体及各个功能模块的认识,从而系统掌握计算机的专业知识,进一步提升学生的软件开发能力乃至系统软件开发能力。

Sep 28th 2026
13-24 Weeks
Principles of Computing (Part 2) (Coursera) Coursera
Rice University

Principles of Computing (Part 2) (Coursera)

This two-part course introduces the basic mathematical and programming principles that underlie much of Computer Science. Understanding these principles is crucial to the process of creating efficient and well-structured solutions for computational problems. To get hands-on experience working with these concepts, we will use the Python programming language. The main focus of the class will be weekly mini-projects that build upon the mathematical and programming principles that are taught in the class.

Oct 5th 2026
4 Weeks
Information Theory (Coursera) Coursera
The Chinese University of Hong Kong

Information Theory (Coursera)

At the completion of this course, the student should be able to: demonstrate knowledge and understanding of the fundamentals of information theory; appreciate the notion of fundamental limits in communication systems and more generally all systems; develop deeper understanding of communication systems; apply the concepts of information theory to various disciplines in information science.

Oct 5th 2026
13-24 Weeks
Initiation à la théorie des distributions (Coursera) Coursera
École Polytechnique

Initiation à la théorie des distributions (Coursera)

Une fonction discontinue peut-elle être solution d'une équation différentielle? Comment définir rigoureusement la masse de Dirac (une "fonction" d'intégrale un, nulle partout sauf en un point) et ses dérivées? Peut-on définir une notion de "dérivée d'ordre fractionnaire"? Cette initiation aux distributions répond à ces questions - et à bien d'autres.

Oct 5th 2026
5-12 Weeks
Analysis of Algorithms (Coursera) Coursera
Princeton University

Analysis of Algorithms (Coursera)

This course teaches a calculus that enables precise quantitative predictions of large combinatorial structures. In addition, this course covers generating functions and real asymptotics and then introduces the symbolic method in the context of applications in the analysis of algorithms and basic structures such as permutations, trees, strings, words, and mappings.

Sep 28th 2026
5-12 Weeks
Computer Science: Programming with a Purpose (Coursera) Coursera
Princeton University

Computer Science: Programming with a Purpose (Coursera)

The basis for education in the last millennium was “reading, writing, and arithmetic;” now it is reading, writing, and computing. Learning to program is an essential part of the education of every student, not just in the sciences and engineering, but in the arts, social sciences, and humanities, as well. Beyond direct applications, it is the first step in understanding the nature of computer science’s undeniable impact on the modern world.

Oct 5th 2026
5-12 Weeks