Translated by Google
Discrete Mathematics A-Z: Math,
From null Fr /h
In this course you will learn discrete mathematics and study mathematical logic, mathematical proofs, set theory, functions, relations, graph theory, number theory as well as combinations and permutations.
Each chapter of the course can be taken independently if required, and each chapter covers all of the listed topics in details so you will study everything that is necessary and in the order that most suits you as a student. As students usually come to this course for specific topic(s) and exercises, here is the comprehensive list of what you will learn from each chapter of this course:
Logic: Propositions, Connectives, Truth Tables, Logic Gates, Conditional and Biconditional Propositions, Rules of Inference, Predicates and Quantifiers
Proofs: Direct and Indirect Proofs, Proof by Induction and other Methods of Proof
Sets: Sets and Number Sets, Complement Sets, Cartesian Product, Operations, Boolean Algebra and De Morgan's Law
Functions and relations: Ordered Pair, Dom, Range, Inverse Relations
Graphs: Simple and Complete Graph, Bipartite Graph, Paths and Circuits, Euler Circuit and Euler Path, Hamiltonian Circuit and Hamiltonian Path, Trees
Numbers: Divisibility and Division Algorithm, Euclidean Algorithm
Combinatorics: Combinations, Permutations, Fundamental Principle of Counting
Each chapter of the course can be taken independently if required, and each chapter covers all of the listed topics in details so you will study everything that is necessary and in the order that most suits you as a student. As students usually come to this course for specific topic(s) and exercises, here is the comprehensive list of what you will learn from each chapter of this course:
Logic: Propositions, Connectives, Truth Tables, Logic Gates, Conditional and Biconditional Propositions, Rules of Inference, Predicates and Quantifiers
Proofs: Direct and Indirect Proofs, Proof by Induction and other Methods of Proof
Sets: Sets and Number Sets, Complement Sets, Cartesian Product, Operations, Boolean Algebra and De Morgan's Law
Functions and relations: Ordered Pair, Dom, Range, Inverse Relations
Graphs: Simple and Complete Graph, Bipartite Graph, Paths and Circuits, Euler Circuit and Euler Path, Hamiltonian Circuit and Hamiltonian Path, Trees
Numbers: Divisibility and Division Algorithm, Euclidean Algorithm
Combinatorics: Combinations, Permutations, Fundamental Principle of Counting
Extra information
basic math operations
willingness to learn
willingness to learn
Location
At teacher's location :
- shop, Safi, Maroc
About Me
An engineer / researcher who looks for giving an abstract image of computing world by giving simple examples and technics which help anyone (old or teenager) to understand computer science
Education
holder of many diplomas such as: DUT / DEUG / LF / LP and a master degree in Internet of things and mobile systems, im preparing my Phd in discret mathematics and algorithms optimization
Experience / Qualifications
working as software engineer in many companies such as Perfect Shore / Atos
now im working as R&D engineer (full stack) at Cdiscount
now im working as R&D engineer (full stack) at Cdiscount
Age
Teenagers (13-17 years old)
Adults (18-64 years old)
Seniors (65+ years old)
Student level
Beginner
Intermediate
Advanced
Duration
60 minutes
The class is taught in
French
English
Arabic
German
Skills
Reviews
Availability of a typical week
(GMT -05:00)
New York
At teacher's location
Mon
Tue
Wed
Thu
Fri
Sat
Sun
00-04
04-08
08-12
12-16
16-20
20-24
Learn the fundamentals of C#
Work with primitive types and expressions
Work with non-primitive types (classes, structs, arrays and enums)
Learn the difference between value types and reference types
Control the flow of programs using conditional statements
Use arrays and lists
Work with files and directories
Work with text
Work with date and time
Debug C# applications effectively
Work with primitive types and expressions
Work with non-primitive types (classes, structs, arrays and enums)
Learn the difference between value types and reference types
Control the flow of programs using conditional statements
Use arrays and lists
Work with files and directories
Work with text
Work with date and time
Debug C# applications effectively
Similar classes
Similar classes
Good-fit Instructor Guarantee
Contact Nour