Computer Science Fundamentals
Beginner
Discrete Math
The mathematics computer science actually runs on: propositional and predicate logic, proof by induction, set theory, relations and functions, recurrence relations, combinatorics and discrete probability.
29 chapters
7h 45m
What you'll learn
- Introduction to Discrete Mathematics
- Propositional Logic Fundamentals
- Logical Operators and Truth Tables
- Conditional Statements and Logical Equivalence
- Predicate Logic and Quantifiers
- Rules of Inference
- Set Theory Fundamentals
- Set Operations and Venn Diagrams
Course content
29 chapters · 7h 45m- 1 Introduction to Discrete Mathematics 15 min
- 2 Propositional Logic Fundamentals 15 min
- 3 Logical Operators and Truth Tables 15 min
- 4 Conditional Statements and Logical Equivalence 15 min
- 5 Predicate Logic and Quantifiers 15 min
- 6 Rules of Inference 15 min
- 7 Set Theory Fundamentals 15 min
- 8 Set Operations and Venn Diagrams 15 min
- 9 Relations and Their Properties 15 min
- 10 Functions and Types of Functions 15 min
- 11 Sequences and Summations 15 min
- 12 Mathematical Induction 15 min
- 13 Recursive Definitions and Recurrence Relations 15 min
- 14 Counting Principles 15 min
- 15 Permutations and Combinations 15 min
- 16 Binomial Theorem and Pascal’s Triangle 15 min
- 17 Probability Fundamentals 15 min
- 18 Conditional Probability and Bayes’ Theorem 15 min
- 19 Boolean Algebra 15 min
- 20 Logic Gates and Digital Circuits 15 min
- 21 Graph Theory Fundamentals 15 min
- 22 Trees and Spanning Trees 15 min
- 23 Planar Graphs and Graph Coloring 15 min
- 24 Finite State Machines and Automata Basics 15 min
- 25 Number Theory Fundamentals 15 min
- 26 Modular Arithmetic and Cryptography Basics 15 min
- 27 Discrete Mathematics in Algorithms 15 min
- 28 Interview Preparation and Competitive Programming Math 15 min
- 29 Final Projects and Real-World Applications 45 min