Discrete Mathematics
4.1 (112 ratings)
783 students enrolled
Wishlisted Wishlist

# Discrete Mathematics

Master Discrete Math, the backbone of Mathematics and Computer Science
4.1 (112 ratings)
783 students enrolled
Created by Miran Fattah
Last updated 1/2017
English
Current price: \$10 Original price: \$45 Discount: 78% off
5 hours left at this price!
30-Day Money-Back Guarantee
Includes:
• 3.5 hours on-demand video
• 5 Supplemental Resources
• Access on mobile and TV
• Certificate of Completion
What Will I Learn?
• Most comprehensive Discrete Mathematics course on Udemy.
• Understand the backbones of Mathematics and Computer Science.
• Understand Sets, Logic, Divisors, Proofs, Functions, and Relations.
• Learn the language of Mathematics.
• Learn necessary Mathematical symbols.
• Construct and read Mathematical statements.
• Prove Mathematical statements.
• Prove statements by induction.
• Learn how to use Venn diagrams.
• Learn how to construct truth tables.
• Know how to tell the falsehood and truthfulness of a compound statements.
• Know how to create new sets using different operations.
• Find equivalence relations and equivalence classes.
• Learn how to find odd and even functions.
• Know how to check if a set is injective, bijective, or surjective.
• Understand Fundamental Theorem of Arithmetics.
• Learn how to find GCD & LCM.
• Learn basics of Modular Arithmetics.
• Learn essential concepts in Probability.
View Curriculum
Requirements
• Know basic operations like addition and multiplication.
Description

Discrete Mathematics (DM), or Discrete Math is the backbone of Mathematics and Computer Science. DM is the study of topics that are discrete rather than continues, for that, the course is a MUST for any Math or SC student. The topics that are covered in this course are the most essential ones, those that will touch every Math and Science student at some point of their education. Discrete Mathematics gives students the ability to understand Math language and based on that, the course is divided into 8 sections. The sections are:

1. Symbols
2. Sets
3. Logic
4. Arithmetic
5. Proofs
6. Functions
7. Relations
8. Probability
9. and Combinatorics

.

.

How is it delivered?

I know visually seeing a problem getting solved is the easiest and the most direct way for a student to learn so I designed the course keeping this in mind. The materials are delivered mostly through videos to make complex subject easy to comprehend. More details on certain lessons are delivered through text files to provide more explanation or examples. The course is taught in plain English, away from cloudy, complicated mathematical jargons and that is to help the student learn the material rather than getting stuck with fancy words.

.

.

How do I learn better?

There are quizzes after each section so you can test your knowledge and see how much of the material has sank in. I suggest you go through each lesson several times to better understand the content.

Who is the target audience?
• This course is designed for Math and Computer Science majors or anyone interested in learning what makes the backbones of Mathematics and Computer Science.
Compare to Other Discrete Math Courses
Curriculum For This Course
58 Lectures
03:45:48
+
Introduction
1 Lecture 01:46
Preview 01:46
+
Symbols
1 Lecture 00:00

Symbols used throughout the course.

Mathematical Symbols
2 pages
+
Sets
8 Lectures 25:27
Basics
03:34

Special Types of Sets
02:19

Number Sets
06:15

Preview 01:42

Operations
04:26

Binary Operations Properties
05:11

De Morgan's laws for Sets
1 page

Power Sets
02:00

Section 2 Quiz
7 questions
+
Logic
6 Lectures 23:23
Statements
02:09

Compound Statements
02:13

Truth Tables
12:45

Logical Equivalences
02:09

De Morgan's laws in Logic
04:07

More Logical Equvielances
2 pages

Section 3 Quiz
4 questions
+
Arithmetics
8 Lectures 22:46
Divisors
03:39

Divisibility Rules 1-5
03:20

More Divisibility Rules 1-12
2 pages

Primes, Odds & Evens
04:28

Preview 01:41

More Examples on FTA
1 page

GCD & LCM
05:09

Modular Arithmetics
04:29

Section 4 Quiz
7 questions
+
Proofs
7 Lectures 28:45
Intro
03:46

Direct Proofs
03:41

Induction Proofs
07:50

04:03

Contrapositive Proofs
03:40

Construction Proofs
02:46

Exhaustion Proofs
02:59

Section 5 Quiz
6 questions
+
Functions
8 Lectures 30:49
Functions
03:35

Domains
02:42

Range
02:55

Injection
05:20

Surjection
03:56

Bijection
01:57

Even and Odd Functions
06:06

Function Compositions
04:18

Section 6 Quiz
7 questions
+
Relations
2 Lectures 07:38
Preview 05:55

Equivalence Class
01:43

Section 7 Quiz
6 questions
+
Probability
10 Lectures 25:43
Average
02:44

Median
02:54

Mode
01:58

Range
00:41

Outlier
01:53

Variance
03:50

Standard Deviation
02:18

Expected Value (EV)
05:06

Law of Large Numbers
01:38

Gambler's Fallacy
02:41

Chapter Quiz
8 questions
+
Combinatorics
7 Lectures 51:31
What is Combinatorics?
01:14

Factorials
05:05

The Basic Counting Principle
09:16

Permutations
12:39

Combinations
05:29

Pigeonhole Principle
06:39

http://mathforum.org/dr.cgi/pascal.cgi?

The above website is a Pascal's Triangle generator. All you have to do is to indicate how many rows you want and it will generate the corresponding Pascal's Triangle.

Pascal's Triangle
11:09

Chapter Quiz
8 questions