Learn the basic building blocks of Discrete Math, the backbone of Computer Science and Modern Mathematics
Welcome to this course on Discrete Mathematics.
Discrete Math is the mathematics of computing. It is very much the real world mathematics and has very wide uses in the modern areas of Computer Science and Advanced Mathematics. The mathematics of modern computer science is built almost entirely on discrete math. This means that in order to learn the fundamental algorithms used by computer programmers, students will need a solid background in Discrete Math. At most of the universities, a undergraduate-level course in discrete mathematics is a required part of pursuing a computer science degree.
This course will make you master Discrete Math’s Set Theory, Relations, and Functions in a very short amount of time with the help of several worked out problems. Set Theory, Relations and Functions form an integral part of Discrete Math. They are the building blocks of Discrete Math and are a must to explore. Nearly all the areas of research be it Computer Science, Mathematics, Actuarial Science, Data Science or even Engineering use Set Theory, Relations and Functions in one way or the other.
After completing this course, you will be able to:
- define a set and represent the same in different forms;
- define different types of sets such as, finite and infinite sets, empty set, singleton set, equivalent sets, equal sets, sub sets, proper subsets, supersets, give examples of each kind of set, and solve problems based on them;
- define union and intersection of two sets, and solve problems based on them;
- define universal set, complement of a set, difference between two sets, and solve problems based on them;
- define Cartesian product of two sets, and solve problems based on them;
- represent union and intersection of two sets, universal sets, complement of a set, difference between two sets by Venn Diagram;
- solve problems based on Venn Diagram;
- define relation and quote examples of relations;
- find the domain and range of a relation;
- represent relations diagrammatically;
- define different types of relations such as, empty relation, universal relation, identity relation, inverse relation, reflexive relation, symmetric relation, transitive relation, equivalence relation, and solve problems based on them;
- define function and give examples of functions;
- find the domain, codomain and range of a function;
- define the different types of functions such as injective function (one-to-one function), surjective function (onto function), bijective function, give examples of each kind of function, and solve problems based on them.
- define and give examples of even and odd functions;
- figure out if any given function is even, odd, or neither from graphs as well as equations;
- define composition of two functions;
- find the composition of functions;
- define the inverse of a function;
- find the inverse of any given function; and
- find the domain and range of the inverse function.
This course is for anyone planning to have a career in Math or Computer Science or is a working IT professional or a Math researcher. Even if you have the basic knowledge of Set Theory, Relations and Functions, it is still beneficial to opt for this Discrete Math course as it will explain the fundamental aspects of Set Theory, Relations and Functions in a much more deeper way and make you more efficient in solving problems based on them.
Overall, after completing this discrete math course, you will find yourself very confident Set Theory, Relations and Functions, and will be clear with all the different terms and concepts associated with them.
- 5 hours on-demand video
- 3 Articles
- Full lifetime access
- Access on mobile and TV
- Certificate of Completion
- [Size: 477.7 MB]