Discrete Mathematics Udemy

Discrete Mathematics. Master Discrete Math for Computer Science and Mathematics Students. You will learn and develop the ability to think, read and write abstractly and Mathematically.

  • 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.

Discrete Mathematics Course Requirements

  • A fair background in algebra.

Discrete Mathematics Course Description

WHAT IS THIS COURSE ABOUT?

Discrete mathematics (DM) or discrete mathematics is the backbone of mathematics and computer science. DM is the study of topics that are discrete rather than continuous, which is why the course is a MUST for any math or computer science student.

The topics covered in this course are the most essential, those that will touch all math and science students at some point in their education. The objective 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 theory. of sets and number theory.


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

Sets

Logic

Number theory

Tests

Features

Relations

Graphic Schema Theory

Stats

Combinatorial

and sequences and series

YOU WILL ALSO GET:

Lifetime access

Questions and answers section with support

Certificate of completion

30-day money-back guarantee

HOW IS IT DELIVERED? I know that seeing a problem solved visually is the easiest and most direct way for a student to learn, so I designed the course with this in mind. Materials are delivered through videos to facilitate understanding of complex topics. More details on certain lessons are provided via text files to provide further explanation or examples. The course is taught in plain English, away from complicated and murky math jargon, to help the student learn the material instead of getting bogged down in fancy words.

HOW DO I LEARN BETTER? There are quizzes after each conference so you can test your knowledge and see how much of the material has been assimilated. I suggest that you repeat each lesson several times to better understand the content.

Who this course is for:

  • This course is designed for students majoring or minoring in Computer Science, Mathematics, Mathematics Education, and Engineering.

Source: https://www.udemy.com/course/discrete-math/

Leave a Comment

Please disable your adblocker or whitelist this site! And Reload Page