Your cart is empty.
Keep shoppingDiscrete Mathematics
29,370 students
Discrete Mathematics
Master Discrete Math with 400+ Practice Questions and Quizzes: Foundational for Computer Science and Math Students
Created byMiran Fattah
Last updated 2/2025
English
What you'll learn
- Develop the ability to think, read, and write abstractly and mathematically.
- Understand the fundamentals of set theory, including set-builder notation, set operations, and set properties.
- Learn tautologies, contradictions, De Morgan’s Laws, logical equivalence, and quantified statements.
- Create and analyze truth tables to determine the truth or falsehood of compound statements.
- Master proof techniques such as direct proof, contrapositive, contradiction, and induction.
- Understand Boolean expressions, logic gates, and digital circuits—the foundation of computer science.
- Explore the Fundamental Theorem of Arithmetic, modular arithmetic, and methods for finding GCD & LCM.
- Gain a solid foundation in functions: composition, combination, bijective, and inverse functions.
- Learn about relations, equivalence relations, and equivalence classes.
- Apply combinatorics and probability concepts, including counting principles, permutations, and combinations.
- Master arithmetic and geometric sequences, series, and partial sums.
- Learn fundamental concepts in graph theory such as adjacency matrices, connectedness, walks, and classic theorems like Ore’s Theorem.
- Reinforce your learning with 400+ carefully designed practice problems, ranging from beginner to advanced.
Explore related topics
Course content
10 sections • 133 lectures • 18h 59m total length
Requirements
- A fair background in algebra.
Description
WHAT IS THIS COURSE ABOUT?
Discrete Mathematics (DM) is the backbone of both Mathematics and Computer Science. Unlike continuous mathematics, DM focuses on discrete structures—sets, logic, numbers, graphs, and more—making it a core subject for any Math or CS student.
The concepts in this course provide the mathematical foundation for computer science (data structures, algorithms, database theory) as well as many areas of pure and applied math (linear algebra, abstract algebra, combinatorics, probability, and number theory). Mastering these topics will not only sharpen your problem-solving skills but also prepare you for advanced courses, research, and even coding interviews.
This course is structured into the following core sections:
Sets
Logic
Number Theory
Proofs
Functions
Relations
Graph Theory
Statistics
Combinatorics
Sequences and Series
YOU WILL ALSO GET:
400+ practice problems with full solutions, ranging from beginner to challenging
Quizzes after each lecture to test your understanding
Lifetime access to all course content
Direct support in the Q&A section
Certificate of Completion
30-Day Money-Back Guarantee
HOW IS IT DELIVERED?
This course is built with visual learners in mind. Complex topics are broken down into clear, step-by-step video lessons. You’ll see problems worked through in real time, making even the most abstract ideas simple and approachable. Some lessons include downloadable text explanations and additional worked examples.
All content is delivered in plain English — no unnecessary jargon — so you can focus on mastering the concepts, not deciphering the terminology.
HOW DO I LEARN BETTER?
Learning math is about practice and repetition. After each lecture, you’ll find a short quiz to reinforce your understanding. At the end of each section, there are 25 carefully designed practice problems (with detailed solutions) so you can apply what you’ve learned and build confidence. Revisiting lessons and re-working problems is strongly encouraged — that’s how mastery happens.
Who this course is for:
- This course is designed for students majoring or minoring in Computer Science, Mathematics, Mathematics Education, and Engineering.