Discrete Math For Computer Science

Discrete math: Logic, Sets, Relations, Functions, Graph Theory. Learn discrete mathematics for computer science

What you’ll learn
Understand and explain important concepts of Discrete Math
Understand what is logic
Understand what is set and what operations can we do with sets
Understand what is function and what properties it can have
Understand what is combinatorics
Being able to compute permutations, variations, combinations
Requirements
Computer & Internet
Description
Save your precious time by taking this course, in this course I explain discrete math concepts in a fast and engaging way, The course content contains: Logic, Sets, Relations, Functions, Combinatorics, Graphs. Every programmer should know what is discrete mathematics, and what are the main concepts of discrete mathematics. This course is designed to provide you the knowledge you need in a reasonable time period. Also, in the course are plenty of exercises on which you can practice and if you have any problems, you can always post a question, most of the time I respond within a day.My name is Luke, and I am currently teaching over 60k students. And here is what students say about mu courses:Gustav Gimlich : “Good course, Instructor is explaining well. I also like that there is a lot of exercises. Money good spend.”Nouf : “the course deserve million stars,thankyouuu”Debarghya Roy : “Awesome explanation”Mohammad Shaik : “very nicely explained with good and simple examples.”Willane Paiva de Souza : “Great explanations, precise and at the right speed.”… and many more 🙂

Overview

Section 1: Introduction

Lecture 1 Introduction

Lecture 2 Say Hello

Section 2: Logic

Lecture 3 What is logic ?

Lecture 4 Expression and Logical Connectives

Lecture 5 Logical Formula

Lecture 6 Quantifiers

Lecture 7 PRACTICE | Logic

Section 3: Sets, Relations, Functions

Lecture 8 What is Set?

Lecture 9 Set Operations

Lecture 10 PRACTICE | Sets

Lecture 11 Relations

Lecture 12 Number Sets

Lecture 13 Functions

Lecture 14 Function Composition

Section 4: Combinatorics

Lecture 15 Combinatorics Introduction

Lecture 16 Permutations

Lecture 17 Variations

Lecture 18 Combinations

Lecture 19 PRACTICE | Combinatorics

Section 5: Graphs

Lecture 20 What is graph?

Lecture 21 Dijkstra’s Shortest Path Algorithm

Section 6: Bonus

Lecture 22 Missing Lecture?

Lecture 23 Bonus Lecture: My other courses

Anyone who wants to learn Discrete Math,Anyone who wants to learn Sets, Relations, Functions,Anyone who wants to understand Logic and Graphs