4.3 Read 9 reviews
Overview
Discrete Mathematics is the language of Computer Science. One needs to be fluent in it to work in many fields including data science, machine learning, and software engineering (it is not a coincidence that math puzzles are often used for interviews). This Introduction to Discrete Mathematics for Computer Science course offered by Coursera in partnership with University of California San Diego introduces you to this language through a fun try-this-before-we-explain-everything approach: first you solve many interactive puzzles that are carefully designed specifically for this online specialization, and then we explain how to solve the puzzles, and introduce important ideas along the way. We believe that this way, you will get a deeper understanding and will better appreciate the beauty of the underlying ideas (not to mention the self confidence that you gain if you invent these ideas on your own!). To bring your experience closer to IT-applications, we incorporate programming examples, problems, and projects in the specialization.
Applied Learning Project
We’ll implement together an efficient program for a problem needed by delivery companies all over the world millions times per day — the travelling salesman problem. The goal in this problem is to visit all the given places as quickly as possible. How to find an optimal solution to this problem quickly? We still don’t have provably efficient algorithms for this difficult computational problem and this is the essence of the P versus NP problem, the most important open question in Computer Science. Still, we’ll implement several efficient solutions for real world instances of the travelling salesman problem. While designing these solutions, we will rely heavily on the material learned in the courses of the specialization: proof techniques, combinatorics, probability, graph theory. We’ll see several examples of using discrete mathematics ideas to get more and more efficient solutions.
Skills You Will Gain:
- Graph Theory
- Number Theory
- Cryptography
- Probability
Get more details
Visit programme websiteProgramme Structure
Courses include:
- Mathematical Thinking in Computer Science
- Combinatorics and Probability
- Introduction to Graph Theory
- Number Theory and Cryptography
- Delivery Problem
Check out the full curriculum
Visit programme websiteKey information
Duration
- Part-time
- 3 months
- Flexible
Start dates & application deadlines
You can apply for and start this programme anytime.
Language
English
Delivered
Online
Disciplines
Applied Mathematics Computer Sciences View 746 other Short Courses in Computer Sciences in United StatesExplore more key information
Visit programme websiteAcademic requirements
We are not aware of any specific GRE, GMAT or GPA grading score requirements for this programme.
English requirements
We are not aware of any English requirements for this programme.
Other requirements
General requirements
Beginner level
- No prior experience required
Make sure you meet all requirements
Visit programme websiteTuition Fee
To always see correct tuition fees
-
International
FreeTuition FeeBased on the tuition of 0 USD for the full programme during 3 months. -
National
FreeTuition FeeBased on the tuition of 0 USD for the full programme during 3 months.
You can choose from hundreds of free courses, or get a degree or certificate at a breakthrough price. You can now select Coursera Plus, an annual subscription that provides unlimited access.
Funding
Coursera provides financial aid to learners who cannot afford the fee. Apply for it by clicking on the Financial Aid link beneath the "Enroll" button on the left. You'll be prompted to complete an application and will be notified if you are approved. You'll need to complete this step for each course in the Specialization, including the Capstone Project.
Improve page content