Learn the language of computer science. Discover the mathematics that underpins computer science, and practice its application through mathematical proofs and Python code.
Suggested by: Coursera (What is Coursera?)
No prior knowledge required
No unnecessary risks
Discrete mathematics is the language of computer science. Mastering it is necessary to work in many fields, including:
We will expose you to this language through a fun “try first, understand later” approach: first you will solve interactive puzzles, and then we will explain how to solve the puzzles and present important ideas.
We will incorporate programming examples, problems, and projects during the training.
Together we will complete an efficient program for the traveling salesman problem, the goal being to visit all given locations as quickly as possible. We will explore solutions to this difficult computational problem, which is the essence of the P vs. NP problem.
We will complete several effective solutions to real-world examples of the traveling salesman problem, using the material learned in the courses:
We will see examples of using ideas from discrete mathematics to arrive at more efficient solutions.
Course 1
41 hours
4.4 (2,241 ratings)
What you will learn: Mathematical thinking is crucial in various fields of computer science: algorithms, bioinformatics, computer graphics, data science, machine learning, and more. In this course, we will learn the most important tools in discrete mathematics: induction, approximation, logic, inequalities, optimality.
Course 2
23 hours
4.6 (847 ratings)
What you will learn: We will discuss the standard definitions of combinatorics, and develop the ability to distinguish between the definitions in real life and algorithmic problems.
Course 3
20 hours
4.5 (1,005 ratings)
What you will learn: We will learn about graph theory, applications such as finding the shortest path, designing integrated circuits, and assembling genomes.
Course 4
16 hours
4.5 (595 ratings)
What you will learn: We will start with the basic principles of number theory and move on to cryptographic protocols based on it.
Course 5
13 hours
4.7 (372 ratings)
What you will learn: We will implement effective plans for a problem that is essential for delivery companies — the traveling salesman problem.
