About this Course

497,291 recent views

Learner Career Outcomes

41%

started a new career after completing these courses

37%

got a tangible career benefit from this course

Shareable Certificate

Earn a Certificate upon completion

100% online

Start instantly and learn at your own schedule.

Flexible deadlines

Reset deadlines in accordance to your schedule.

Beginner Level

Approx. 36 hours to complete

English

Subtitles: English, Arabic

Skills you will gain

Mathematical InductionProof TheoryDiscrete MathematicsMathematical Logic

Learner Career Outcomes

41%

started a new career after completing these courses

37%

got a tangible career benefit from this course

Shareable Certificate

Earn a Certificate upon completion

100% online

Start instantly and learn at your own schedule.

Flexible deadlines

Reset deadlines in accordance to your schedule.

Beginner Level

Approx. 36 hours to complete

English

Subtitles: English, Arabic

Offered by

University of California San Diego logo

University of California San Diego

National Research University Higher School of Economics logo

National Research University Higher School of Economics

Syllabus - What you will learn from this course

Content RatingThumbs Up86%(15,182 ratings)Info
Week
1

Week 1

3 hours to complete

Making Convincing Arguments

3 hours to complete
10 videos (Total 43 min), 4 readings, 4 quizzes
10 videos
Proofs?3m
Proof by Example1m
Impossibility Proof2m
Impossibility Proof, II and Conclusion3m
One Example is Enough3m
Splitting an Octagon1m
Making Fun in Real Life: Tensegrities (Optional)10m
Know Your Rights5m
Nobody Can Win All The Time: Nonexisting Examples8m
4 readings
Slides10m
Python10m
Slides1m
Acknowledgements1m
1 practice exercise
Tiles, dominos, black and white, even and odd30m
Week
2

Week 2

6 hours to complete

How to Find an Example?

6 hours to complete
16 videos (Total 90 min), 6 readings, 12 quizzes
16 videos
Narrowing the Search6m
Multiplicative Magic Squares5m
More Puzzles9m
Integer Linear Combinations5m
Paths In a Graph4m
N Queens: Brute Force Search (Optional)10m
N Queens: Backtracking: Example (Optional)7m
N Queens: Backtracking: Code (Optional)7m
16 Diagonals (Optional)3m
Warm-up5m
Subset without x and 100-x4m
Rooks on a Chessboard2m
Knights on a Chessboard5m
Bishops on a Chessboard2m
Subset without x and 2x6m
6 readings
Slides1m
N Queens: Brute Force Solution Code (Optional)10m
N Queens: Backtracking Solution Code (Optional)10m
16 Diagonals: Code (Optional)10m
Slides (Optional)1m
Slides1m
3 practice exercises
Is there...20m
Number of Solutions for the 8 Queens Puzzle (Optional)20m
Maximum Number of Two-digit Integers30m
Week
3

Week 3

6 hours to complete

Recursion and Induction

6 hours to complete
13 videos (Total 111 min), 3 readings, 8 quizzes
13 videos
Coin Problem4m
Hanoi Towers7m
Introduction, Lines and Triangles Problem10m
Lines and Triangles: Proof by Induction5m
Connecting Points12m
Odd Points: Proof by Induction5m
Sums of Numbers8m
Bernoulli's Inequality8m
Coins Problem9m
Cutting a Triangle8m
Flawed Induction Proofs9m
Alternating Sum9m
3 readings
Two Cells of Opposite Colors: Hints10m
Slides1m
Slides10m
5 practice exercises
Largest Amount that Cannot Be Paid with 5- and 7-Coins10m
Pay Any Large Amount with 5- and 7-Coins20m
Number of Moves to Solve the Hanoi Towers Puzzle30m
Two Cells of Opposite Colors: Feedback
Induction30m
Week
4

Week 4

4 hours to complete

Logic

4 hours to complete
10 videos (Total 53 min), 2 readings, 9 quizzes
10 videos
Counterexamples4m
Basic Logic Constructs10m
If-Then Generalization, Quantification8m
Reductio ad Absurdum4m
Balls in Boxes4m
Numbers in Tables5m
Pigeonhole Principle2m
An (-1,0,1) Antimagic Square2m
Handshakes3m
2 readings
Slides10m
Slides1m
4 practice exercises
Examples, Counterexamples and Logic30m
Numbers in Boxes5m
How to Pick Socks5m
Pigeonhole Principle10m

About the Introduction to Discrete Mathematics for Computer Science Specialization

Discrete Math is needed to see mathematical structures in the object you work with, and understand their properties. This ability is important for software engineers, data scientists, security and financial analysts (it is not a coincidence that math puzzles are often used for interviews). We cover the basic notions and results (combinatorics, graphs, probability, number theory) that are universally needed. To deliver techniques and ideas in discrete mathematics to the learner we extensively use interactive puzzles specially created for this specialization. To bring the learners experience closer to IT-applications we incorporate programming examples, problems and projects in our courses....
Introduction to Discrete Mathematics for Computer Science

Frequently Asked Questions

  • Once you enroll for a Certificate, you’ll have access to all videos, quizzes, and programming assignments (if applicable). Peer review assignments can only be submitted and reviewed once your session has begun. If you choose to explore the course without purchasing, you may not be able to access certain assignments.

  • When you enroll in the course, you get access to all of the courses in the Specialization, and you earn a certificate when you complete the work. Your electronic Certificate will be added to your Accomplishments page - from there, you can print your Certificate or add it to your LinkedIn profile. If you only want to read and view the course content, you can audit the course for free.

  • If you subscribed, you get a 7-day free trial during which you can cancel at no penalty. After that, we don’t give refunds, but you can cancel your subscription at any time. See our full refund policy.

  • Yes, 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. Learn more.

More questions? Visit the Learner Help Center.