Master Discrete Math for Computer Science and Mathematics Students
What you’ll learn
- You will learn and develop the ability to think, read and write abstractly and Mathematically.
- You will learn the fundamentals of Set Theory including set builder notation, and set operations and properties.
- You will learn tautologies, contradictions, De Morgan’s Laws in Logic, logical equivalence, and formulating quantified statements.
- You will lear how to create truth tables and tell the falsehood and truthfulness of a compound statements.
- You will know how to write, read and prove Mathematical statements using a variety of methods.
- You will understand boolean expressions, black boxes, logical gates and digital circuits.
- You will understand the Fundamental Theorem of Arithmetics, modular arithmetic, and learn how to find GCD & LCM.
- You will acquire a solid foundation in functions, function composition & combination, bijective and inverse functions.
- You will learn how to find equivalence relations and equivalence classes.
- You will learn essential concepts in Statistics and Combinatorics.
- You will master arithmetic and geometric sequences, and partial sums.
- You will learn the fundamental concepts in Graph Theory like incidence and adjacency matrices, walks, eccentricity, hamiltonian paths and circuits, connectedness, and Ore’s Theorem.
Requirements
- A fair background in algebra.
Description
WHAT IS THIS COURSE ABOUT?
Discrete Mathematics (DM), or Discrete Math is the backbone of Mathematics and Computer Science. DM is the study of topics that are discrete rather than continuous, for that, the course is a MUST for any Math or CS student. The topics that are covered in this course are the most essential ones, those that will touch every Math and Science student at some point in their education. The goal of this course is to build the mathematical foundation for computer science courses such as data structures, algorithms, relational and database theory, and for mathematics courses such as linear and abstract algebra, combinatorics, probability, logic and set theory, and number theory.
Discrete Mathematics gives students the ability to understand Math language and based on that, the course is divided into the following sections:
- Sets
- Logic
- Number Theory
- Proofs
- Functions
- Relations
- Graph Theory
- Statistics
- Combinatorics
- and Sequences and Series
HOW IS IT DELIVERED?
I know outwardly seeing an issue getting settled is the simplest and the most immediate way for an understudy to advance so I planned the course remembering this. The materials are conveyed through recordings to make complex subjects simple to grasp. More subtleties on specific illustrations are conveyed through text records to give more clarifications or models. The course is educated in plain English, away from overcast, convoluted numerical language, to assist the understudy with learning the material rather than stalling out on extravagant words.
HOW DO I LEARN BETTER?
There are tests after each talk so you can test your insight and perceive the amount of the material has soaked in. I recommend you go through every example a few times to more readily comprehend the substance.
Who this course is for:
- This course is designed for students majoring or minoring in Computer Science, Mathematics, Mathematics Education, and Engineering.
Created by Miran Fattah
Last updated 2/2021
English
English [Auto]
Size: 4.71 GB
DOWNLOAD LINK:1 https://drive.google.com/drive/folders/1K2bSJCuYz6ufHy4Z_o8qhagNd1vbVVOp
DOWNLOAD LINK:2https://www.mediafire.com/file/81nf8scdhepnrlf/Udemy+-+Discrete+Mathematics.torrent/file
0 Comments