Discrete Mathematics

Master Discrete Math for Computer Science and Mathematics Students

WHAT IS THIS COURSE ABOUT?

What you’ll learn

  • You will learn and develop the ability to think, read and write abstractly and Mathematically..
  • You will learn the fundamentals of Set Theory including set builder notation, and set operations and properties..
  • You will learn tautologies, contradictions, De Morgan’s Laws in Logic, logical equivalence, and formulating quantified statements..
  • You will lear how to create truth tables and tell the falsehood and truthfulness of a compound statements..
  • You will know how to write, read and prove Mathematical statements using a variety of methods..
  • You will understand boolean expressions, black boxes, logical gates and digital circuits..
  • You will understand the Fundamental Theorem of Arithmetics, modular arithmetic, and learn how to find GCD & LCM..
  • You will acquire a solid foundation in functions, function composition & combination, bijective and inverse functions..
  • You will learn how to find equivalence relations and equivalence classes..
  • You will learn essential concepts in Statistics and Combinatorics..
  • You will master arithmetic and geometric sequences, and partial sums..
  • You will learn the fundamental concepts in Graph Theory like incidence and adjacency matrices, walks, eccentricity, hamiltonian paths and circuits, connectedness, and Ore’s Theorem..

Course Content

  • Sets –> 19 lectures • 2hr 41min.
  • Logic –> 23 lectures • 3hr 22min.
  • Number Theory –> 6 lectures • 58min.
  • Proofs –> 9 lectures • 1hr 51min.
  • Functions –> 16 lectures • 2hr 40min.
  • Relations –> 9 lectures • 1hr 11min.
  • Graph Theory –> 18 lectures • 3hr 26min.
  • Statistics –> 9 lectures • 39min.
  • Combinatorics –> 7 lectures • 1hr 4min.
  • Sequence and Series –> 8 lectures • 1hr 2min.

Discrete Mathematics

Requirements

  • A fair background in algebra..

WHAT IS THIS COURSE ABOUT?

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 continuous, for that, the course is a MUST for any Math or CS 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 in their education. The goal of this course is to build the mathematical foundation for computer science courses such as data structures, algorithms, relational and database theory, and for mathematics courses such as linear and abstract algebra, combinatorics, probability, logic and set theory, and number theory.

Discrete Mathematics gives students the ability to understand Math language and based on that, the course is divided into the following sections:

  1. Sets
  2. Logic
  3. Number Theory
  4. Proofs
  5. Functions
  6. Relations
  7. Graph Theory
  8. Statistics
  9. Combinatorics
  10. and Sequences and Series

YOU WILL ALSO GET:

  1. Lifetime Access
  2. Q&A section with support
  3. Certificate of completion
  4. 30-day money-back guarantee

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 through videos to make complex subjects easy to comprehend. More details on certain lessons are delivered through text files to provide more explanations or examples. The course is taught in plain English, away from cloudy, complicated mathematical jargon, to help the student learn the material rather than getting stuck on fancy words.

 

HOW DO I LEARN BETTER?

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

Get Tutorial