Discrete Mathematics - Vol 2
Engineering · 29 chapters · 342 sections · about 218 hours
Chapters
29 chapters · 342 sections- 1Introduction to Tutorial 4: Part I11 sections
- 2Introduction14 sections
- 3Countable and Uncountable Sets10 sections
- 4Module No # 0511 sections
- 5Countability of the set of all strings over a finite alphabet12 sections
- 6Module No # 0510 sections
- 7Cantor's Theorem6 sections
- 8Uncomputable Functions8 sections
- 9Tutorial 516 sections
- 10Basic Rules of Counting7 sections
- 11Permutation and Combination8 sections
- 12Combinatorial Proofs7 sections
- 13Counting Using Recurrence Equations10 sections
- 14Solving Linear Homogenous Recurrence Equations – Part I10 sections
- 15Solving Linear Homogeneous Recurrence Equations – Part II9 sections
- 16Valid Sequences Analysis26 sections
- 17Module No#0813 sections
- 18Subsequence Existence17 sections
- 19Lecture -39: Solving Linear Non- Homogeneous Recurrence Equations9 sections
- 20Catalan Numbers13 sections
- 21Catalan Numbers - Derivation of Closed Form Formula17 sections
- 22Counting Using Principle of Inclusion-Exclusion12 sections
- 23Full Binary Tree Definition14 sections
- 24Graph Theory Basics16 sections
- 25Introduction to Bipartite Graphs and Matching12 sections
- 26Proof of Hall's Marriage Theorem9 sections
- 27Various Operations on Graphs10 sections
- 28Vertex and Edge Connectivity9 sections
- 29Introduction to Tutorial 816 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