Discrete Mathematics - Vol 1
Engineering · 27 chapters · 355 sections · about 228 hours
Chapters
27 chapters · 355 sections- 1Introduction to Mathematical Logic13 sections
- 2Logical Equivalence16 sections
- 3SAT Problem17 sections
- 4Rules of Inference16 sections
- 5Resolution12 sections
- 6Tutorial 1: Part I16 sections
- 7Tutorial 1: Part II23 sections
- 8Predicate Logic13 sections
- 9Rules of Inferences in Predicate Logic - part A16 sections
- 10Nested Quantifiers = part B8 sections
- 11Proof Strategies-I10 sections
- 12Proof Strategies-II7 sections
- 13Induction12 sections
- 14Lecture - 1314 sections
- 15Lecture -1412 sections
- 16Sets10 sections
- 17Relations8 sections
- 18Irreflexive Relation18 sections
- 19Operations on Relations11 sections
- 20Transitive Closure of Relations6 sections
- 21Warshall’s Algorithm for Computing Transitive Closure10 sections
- 22Lecture -2016 sections
- 23Equivalence Relation9 sections
- 24Lecture -2218 sections
- 25Partial Ordering - part A18 sections
- 26Cover of an Element in a Poset - part B19 sections
- 27Functions7 sections
About this course
Discrete mathematics is the study of mathematical structures that are fundamentally countable or distinct, as opposed to continuous. It forms the foundation for computer science and is crucial for understanding algorithms, data structures, and computational logic