UDEMY 2021 - Discrete Math-Sets, Relations, Functions and Math Induction

0 165
:1of2
1
2
Related posts

Learn the Fundamental of Discrete Math as Discrete Math forms the basis of Computer Science.

What you’ll learn

• Fundamental of Discrete Math – Set Theory, Relations, Functions and Mathematical Induction!
• More than 1,700 students from 120 countries!
• More than 1,700 students from 120 countries!

• Over 6.5 hours of Learning!
• Over 6.5 hours of Learning!

• Certificate of Completion for your Job Interviews!
• By the end of 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;
• find the domain and range of the inverse function;
• Understand the concept of Mathematical Induction and the logic behind it;
• Learn to prove statements using Mathematical Induction;
• Learn to apply Mathematical Induction in a Brain Teasing Real World Problem;
• Understand the application of Mathematical Induction in Computer Program/Algorithm Correctness Proofs;
• Learn to apply Mathematical Induction for proving a Result from Geometry;
• Learn to apply Mathematical Induction for proving the Divisibilities;
• Learn to apply Mathematical Induction for proving the sum of Arithmetic Progressions;
• Learn to apply Mathematical Induction for proving the the Sum of squares of first n natural numbers;
• Learn to apply Mathematical Induction for proving the Inequalities;
• Learn to apply Mathematical Induction for proving the sum of Geometric Progressions.
• Requirements

• There are no pre-requisites for this course.
• Description

Welcome to this course on Discrete Mathematics.

In this course you will learn the important fundamentals of Discrete Math – Set Theory, Relations, Functions and Mathematical Induction with the help of 6.5 Hours of content comprising of Video Lectures, Quizzes and Exercises. Discrete Math is the real world mathematics. It is the mathematics of computing. 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 must have 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.

TinyURL for this post: https://tinyurl.com/y2twe995

Sorry, The Comment Form Is Temporarily Closed At This Time
:1of2
1
2
1
Next

This website uses cookies to improve your experience. We'll assume you're ok with this, but you can opt-out if you wish. Accept Read More

Language: