
Explore lattice properties, including upper bounds, join and meet operations, and distributive lattices, with examples from power set lattices and visual hash diagrams.
learn how to determine connectivity in graphs, distinguish edge connectivity and vertex connectivity, and identify how removing edges can disconnect a graph while exploring related bounds and examples.
Explore directed graphs, defining in-degree and out-degree of a vertex, with D-plus and D-minus notations, sources and sinks, and example analysis of how degrees relate.
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 continues, for that, the course is a MUST for any Math or SC 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 of their education. Discrete Mathematics gives students the ability to understand Math language and based on that, the course is divided into 8 sections. The sections are:
.
.
How is it delivered?
I know visually seeing a problem getting solved is the easiest and the most direct way for a student to learn so I designed the course keeping this in mind. The materials are delivered mostly through videos to make complex subject easy to comprehend. More details on certain lessons are delivered through text files to provide more explanation or examples. The course is taught in plain English, away from cloudy, complicated mathematical jargons and that is to help the student learn the material rather than getting stuck with fancy words.
.