Discrete Math I (Entire Course)
Unlock the Logic: Master Discrete Math with Kimberly Brehm – From Propositions to Graphs, Equip Yourself with Essential Problem-Solving Skills!
5.0
(2)
18 learners
What you'll learn
- Understand and apply logical operations and connectives in propositions.
- Construct truth tables to evaluate compound statements and logical equivalences.
- Translate complex logic statements into predicate logic with quantifiers.
- Utilize set theory and functions in solving mathematical and real-world problems.
This course includes
- 18.5 hours of video
- Certificate of completion
- Access on mobile and TV
Course content
1 modules • 80 lessons • 18.5 hours of video
Discrete Mathematics Foundations and Applications
80 lessons
• 18.5 hours
Discrete Mathematics Foundations and Applications
80 lessons
• 18.5 hours
- Discrete Math - 1.1.1 Propositions, Negations, Conjunctions and Disjunctions 19:32
- Discrete Math - 1.1.2 Implications Converse, Inverse, Contrapositive, and Biconditionals 19:05
- Discrete Math - 1.1.3 Constructing a Truth Table for Compound Propositions 11:45
- Discrete Math 1.2.1 - Translating Propositional Logic Statements 11:10
- Discrete Math - 1.2.2 Solving Logic Puzzles 16:15
- Discrete Math - 1.2.3 Introduction to Logic Circuits 07:37
- Discrete Math - 1.3.1 “Proving” Logical Equivalences with Truth Tables 16:12
- Discrete Math - 1.3.2 Key Logical Equivalences Including De Morgan’s Laws 06:09
- Discrete Math - 1.3.3 Constructing New Logical Equivalences 14:29
- Discrete Math - 1.4.1 Predicate Logic 08:02
- Discrete Math - 1.4.2 Quantifiers 15:47
- Discrete Math - 1.4.3 Negating and Translating with Quantifiers 19:17
- Discrete Math - 1.5.1 Nested Quantifiers and Negations 18:20
- Discrete Math - 1.5.2 Translating with Nested Quantifiers 22:29
- Discrete Math - 1.6.1 Rules of Inference for Propositional Logic 28:34
- Discrete Math - 1.6.2 Rules of Inference for Quantified Statements 17:05
- Discrete Math - 1.7.1 Direct Proof 09:44
- Discrete Math - 1.7.2 Proof by Contraposition 06:39
- Discrete Math - 1.7.3 Proof by Contradiction 09:40
- Discrete Math - 1.8.1 Proof by Cases 18:47
- Discrete Math - 1.8.2 Proofs of Existence And Uniqueness 08:59
- Discrete Math - 2.1.1 Introduction to Sets 12:42
- Discrete Math - 2.1.2 Set Relationships 15:04
- Discrete Math - 2.2.1 Operations on Sets 13:32
- Discrete Math - 2.2.2 Set Identities 11:29
- Discrete Math - 2.2.3 Proving Set Identities 17:49
- Discrete Math - 2.3.1 Introduction to Functions 06:44
- Discrete Math - 2.3.2 One-to-One and Onto Functions 10:59
- Discrete Math - 2.3.3 Inverse Functions and Composition of Functions 12:02
- Discrete Math - 2.3.4 Useful Functions to Know 04:51
- Discrete Math - 2.4.1 Introduction to Sequences 11:46
- Discrete Math - 2.4.2 Recurrence Relations 15:07
- Discrete Math - 2.4.3 Summations and Sigma Notation 06:40
- Discrete Math - 2.4.4 Summation Properties and Formulas 13:53
- Discrete Math - 2.6.1 Matrices and Matrix Operations 20:06
- Discrete Math - 2.6.2 Matrix Operations on your TI-84 05:28
- Discrete Math - 2.6.3 Zero-One Matrices 08:34
- Discrete Math - 3.1.1 Introduction to Algorithms and Pseudo Code 08:44
- Discrete Math - 3.1.2 Searching Algorithms 10:45
- Discrete Math - 3.1.3 Sorting Algorithms 11:26
- Discrete Math - 3.1.4 Optimization Algorithms 07:35
- Discrete Math - 4.1.1 Divisibility 17:29
- Discrete Math - 4.1.2 Modular Arithmetic 22:27
- Discrete Math - 4.2.1 Decimal Expansions from Binary, Octal and Hexadecimal 11:47
- Discrete Math - 4.2.2 Binary, Octal and Hexadecimal Expansions From Decimal 07:44
- Discrete Math - 4.2.3 Conversions Between Binary, Octal and Hexadecimal Expansions 16:12
- Discrete Math - 4.2.4 Algorithms for Integer Operations 36:00
- Discrete Math - 4.3.1 Prime Numbers and Their Properties 13:40
- Discrete Math - 4.3.2 Greatest Common Divisors and Least Common Multiples 10:04
- Discrete Math - 4.3.3 The Euclidean Algorithm 07:34
- Discrete Math - 4.3.4 Greatest Common Divisors as Linear Combinations 11:54
- Discrete Math - 4.4.1 Solving Linear Congruences Using the Inverse 13:50
- Discrete Math - 5.1.1 Proof Using Mathematical Induction - Summation Formulae 23:24
- Discrete Math - 5.1.2 Proof Using Mathematical Induction - Inequalities 09:53
- Discrete Math - 5.1.3 Proof Using Mathematical Induction - Divisibility 07:41
- Discrete Math - 5.2.1 The Well-Ordering Principle and Strong Induction 09:40
- Discrete Math - 5.3.1 Revisiting Recursive Definitions 20:39
- Discrete Math - 5.3.2 Structural Induction 11:52
- Discrete Math - 5.4.1 Recursive Algorithms 10:26
- Discrete Math - 6.1.1 Counting Rules 11:57
- Discrete Math - 6.3.1 Permutations and Combinations 14:48
- Discrete Math - 6.3.2 Counting Rules Practice 29:25
- Discrete Math - 6.4.1 The Binomial Theorem 19:56
- Discrete Math - 7.1.1 An Intro to Discrete Probability 11:34
- Discrete Math - 7.1.2 Discrete Probability Practice 28:12
- Discrete Math - 7.2.1 Probability Theory 11:27
- Discrete Math - 7.2.2 Random Variables and the Binomial Distribution 13:49
- Discrete Math - 8.1.1 Modeling with Recurrence Relations 25:28
- Discrete Math - 8.5.1 The Principle of Inclusion-Exclusion 17:36
- Discrete Math - 9.1.1 Introduction to Relations 10:28
- Discrete Math - 9.1.2 Properties of Relations 21:40
- Discrete Math - 9.1.3 Combining Relations 16:03
- Discrete Math - 9.3.1 Matrix Representations of Relations and Properties 21:04
- Discrete Math - 9.3.2 Representing Relations Using Digraphs 12:28
- Discrete Math - 9.5.1 Equivalence Relations 22:30
- Discrete Math - 10.1.1 Introduction to Graphs 06:19
- Discrete Math - 10.2.1 Graph Terminology 13:12
- Discrete Math - 10.2.2 Special Types of Graphs 11:33
- Discrete Math - 10.2.3 Applications of Graphs 07:39
- Discrete Math - 11.1.1 Introduction to Trees 17:19
Related learning topics
Take this course with you
Download the app to continue lessons from your phone anytime.
