Discrete Math Series : Set Theory & Algebra Masterclass

Learn Discrete Mathematics from scratch as Discrete Mathematics form the core of Computer Science

What you’ll learn
Master Discrete Mathematics
Master set theory and algebra
Get ready for advanced topics of Discrete mathematics like group theory , functions
Get ready for research in computer science

Requirements
Have a PC with internet connection
Even zero knowledge in discrete mathematics is fine – I will teach you everything

Description
You’ve just stumbled upon the most in-depth Discrete Math course series online. With over 15,000 students enrolled and thousands of 5 star reviews to date in the area of computer science, my computer science courses are enjoyed by students from 130 countries. Whether you want to:- build the skills in set theory topic of discrete math- crack interview or competitive exam questions on set theory topic of discrete math…this complete Masterclass on set theory is the course you need to do.Why would you choose to learn this course ?The reality is that there is a lot of computer science courses out there. It’s in the hundreds. Why would you choose my courses ?The number one reason is its simplicity. According to many students in udemy, my courses are simple to understand as I always teach concepts from scratch in a simple language.The second reason is you get a mentor for computer science through this course. I get lot of doubts from students regarding their career in computer science like which elective subject to choose, which book to refer, etc. The third reason is, you are not just watching my videos, you can also ask doubts if you get one while watching the lectures. Which text book should you refer ?I have used Henneth H Rosen textbook. Its a great textbook. You can follow it. But I have referred lot of other textbooksas well. So its upto you on which textbook you are comfortable with but follow a standard author book. If you complete this course, you will find it much easier to understand these textbooks. But anyway if you complete this course with good detailed notes, you don’t need to read any textbook as I am reading them for you and giving the contents in an easy to understand manner.Why should you take this course?You will be joining over 15000 students who are already enrolled in one of my courses.There are 4000+ reviews left by students. My Courses are rated as the best course to learn computer science for beginners.What makes this course a standout?Like you, thousands of others were frustrated and fed up with incomplete Youtube tutorials which assume you already know a bunch of stuff and also bulk textbooks able to send even the most intuitive person to sleep.Like you, they were tired of low-quality lessons, poorly explained topics and all-round confusing info presented in the wrong way. That’s why so many find success in my courses. It’s designed in a simple manner so that anybody will be able to understand. What if I have questions?You can ask questions anytime using the Q/A section or through personal messages. I take it very seriously and answer these questions in a detailed manner with simple english words so that anybody can understand it. Student Quote: “Everything you always wanted to know about OS but were afraid to ask”…And Vignesh Sekar gives the right answers” by Claus Kaliba.There’s no risk either!This course comes with a full 30 day money-back guarantee. Meaning if you are not completely satisfied with the course, you can request udemy for a refund within the first 30 days of purchase.You either end up with Computer Organization skills, learn other core computer subjects, get placed in top notch companies or research areas or you try the course and simply get all your money back if you don’t like it…You literally can’t lose.Ready to get started ?Enrol now using the “Add to Cart” button on the right, and get started on your way to computer science. See you on the inside (hurry, Discrete Math Series is waiting!)

Overview
Section 1: Sets – Basics

Lecture 1 Important : Introduction to Sets

Lecture 2 Subset, Superset, Proper subset, Proper superset

Lecture 3 Power set, Trivial Subsets

Lecture 4 Set Operations

Lecture 5 Properties of Sets

Lecture 6 Use of Venn diagrams

Lecture 7 Difference between subset and belongs to

Lecture 8 Example Problem

Section 2: Relations

Lecture 9 Cartesian product

Lecture 10 Relation Introduction

Lecture 11 Number of relations possible on a set with n elements

Section 3: Reflexive relation

Lecture 12 Reflexive relation with examples

Lecture 13 Minimum and Maximum cardinality of a reflexive relation

Lecture 14 Number of reflexive relations possible on a set with n elements

Lecture 15 Problem on closure properties of Reflexive relation

Lecture 16 Problems on Reflexive relation – 1

Lecture 17 Problems on Reflexive relation – 2

Lecture 18 Problems on Reflexive relation – 3

Lecture 19 Problems on Reflexive relation – 4

Lecture 20 Problems on Reflexive relation – 5

Section 4: Irreflexive relation

Lecture 21 Irreflexive relation with examples

Lecture 22 Relationship between reflexive and irreflexive relations

Lecture 23 Minimum and Maximum cardinality of an irreflexive relation

Lecture 24 Number of irreflexive relations possible on a set with n elements

Lecture 25 Relationship between reflexive and irreflexive relations continued

Lecture 26 Problems on Irreflexive relation

Lecture 27 Problem on closure properties of Irreflexive relation

Lecture 28 Problem on closure properties of Irreflexive relation

Section 5: Symmetric relation

Lecture 29 Symmetric relation with examples

Lecture 30 Minimum and Maximum cardinality of a symmetric relation

Lecture 31 Number of symmetric relations possible on a set with n elements

Lecture 32 Problems on Symmetric relation

Lecture 33 Relationship between reflexive and symmetric relations

Lecture 34 Relationship between reflexive and symmetric relations continued

Lecture 35 Relationship between reflexive and symmetric relations continued

Lecture 36 Problems on symmetric relation

Lecture 37 Problem on closure properties of symmetric relation

Lecture 38 Closure properties of symmetric relations continued

Lecture 39 Closure properties of symmetric relations continued

Lecture 40 Closure properties of symmetric relations continued

Lecture 41 Relationship between Irreflexive and symmetric relations

Lecture 42 Relationship between Irreflexive and symmetric relations with venn diagram

Lecture 43 Relationship between Irreflexive and symmetric relations with venn diagram

Section 6: Anti symmetric relation

Lecture 44 Anti symmetric relation with examples

Lecture 45 Minimum and Maximum cardinality of an antisymmetric relation

Lecture 46 Number of antisymmetric relations possible on a set with n elements

Lecture 47 Relationship between symmetric and antisymmetric relations

Lecture 48 Relationship between symmetric and antisymmetric relations

Lecture 49 Relationship between symmetric and antisymmetric relations continued

Lecture 50 Relationship between Irreflexive and antisymmetric relations

Lecture 51 Closure properties of antisymmetric relations

Lecture 52 Closure properties of antisymmetric relations continued

Lecture 53 Closure properties of antisymmetric relations continued

Lecture 54 Problems on antisymmetric relations

Section 7: Asymmetric relation

Lecture 55 Asymmetric relation with example

Lecture 56 Maximum cardinality of Asymmetric relation possible

Lecture 57 Number of asymmetric relations possible on a set with n elements

Lecture 58 Relationship between Asymmetric and Reflexive relations

Lecture 59 Relationship between Asymmetric and Reflexive relation with venn diagram

Lecture 60 Relationship between Asymmetric and Irreflexive relations

Lecture 61 Relationship between Asymmetric and Symmetric relations

Lecture 62 Relationship between Asymmetric and Antisymmetric relation

Lecture 63 Closure properties of Asymmetric relations

Section 8: Transitive relation

Lecture 64 Transitive relation with examples

Lecture 65 Minimum and Maximum cardinality of a transitive relation

Lecture 66 Problems on Transitive relation

Section 9: Equivalence relation and Partially Ordered Relation

Lecture 67 Equivalence relation explained

Lecture 68 Examples on Equivalence relation

Lecture 69 Examples on Equivalence relation

Lecture 70 Examples on Equivalence relation

Lecture 71 Partial Ordered Relation explained

Lecture 72 Relation which is both equivalent and partially ordered

Lecture 73 Examples on Partially ordered relation

Lecture 74 POSET explained

Lecture 75 Examples of POSET

Lecture 76 Problem

Lecture 77 Problem

Lecture 78 Closure properties of Equivalence relations continued

Lecture 79 Closure properties of Equivalence relations continued

Lecture 80 Problem on Equivalence relation

Lecture 81 Problem on Equivalence relation

Lecture 82 Problem on Equivalence relation

Lecture 83 Problem

Lecture 84 Problem

Lecture 85 Totally Ordered Set – TOSET

Lecture 86 Examples of TOSET

Section 10: Hasse Diagam

Lecture 87 Hasse diagram explained

Section 11: Bonus Section

Lecture 88 Bonus Section

Any computer science student,Anybody who is interested to do a research in computer science,Any Engineer who wants to build logical thinking,Any Engineer,Anybody who likes to analyse mathematics,Any body who is preparing for exams like GATE , PGEE , ISRO etc.,Anybody who wants to master set theory,Anybody who wants to understand advanced concepts of Discrete Mathematics,Anybody who wants to learn Discrete Mathematics from scratch,Anyone who wants to learn set theory from scratch