- Home
- Courses
- Engineering
- Discrete Mathematical Structures
Curriculum
- 1 Section
- 37 Lessons
- 10 Weeks
Expand all sectionsCollapse all sections
- Discrete Mathematical Structures37
- 2.1Lecture 1: Propositional Logic
- 2.2Lecture 2: Propositional Logic (Contd.)
- 2.3Lecture 3: Predicates & Quantifiers
- 2.4Lecture 4: Predicates & Quantifiers (Contd.)
- 2.5Lecture 5: Logical Inference
- 2.6Lecture 6: Resolution Principles & Application to PROLOG
- 2.7Lecture 7: Methods of Proof
- 2.8Lecture 8: Normal Forms
- 2.9Lecture 10: Sets
- 2.10Lecture 12: Set Operations on Strings Over an Alphabet
- 2.11Lecture 14: Graphs
- 2.12Lecture 15: Graphs (Contd.)
- 2.13Lecture 16: Trees
- 2.14Lecture 17: Trees and Graphs
- 2.15Lecture 18: Special Properties of Relations
- 2.16Lecture 19: Closure of Relations
- 2.17Lecture 20: Closure of Relations (Contd.)
- 2.18Lecture 21: Order Relations
- 2.19Lecture 22: Order and Relations and Equivalence Relations
- 2.20Lecture 23: Equivalence relations and partitions
- 2.21Lecture 24: Functions
- 2.22Lecture 25: Functions 2
- 2.23Lectures 26 Functions 3
- 2.24Lecture 27: Pigeonhole Principle
- 2.25Lecture 28: Permutations and combinations
- 2.26Lecture 29: Permutations and Combinations(Contd…)
- 2.27Lecture 30: Generating Functions
- 2.28Lecture 31: Generating Functions 2
- 2.29Lecture 32: Recurrence Relations
- 2.30Lecture 33: Recurrence Relations contd..
- 2.31Lecture 34: Recurrence Relations(contd..)
- 2.32Lecture 35: Algebras
- 2.33Lecture 36: Algebras 2
- 2.34Lecture 37: Algebras 3
- 2.35Lecture 38: Finite State Automaton
- 2.36Lecture 39: Finite State Automaton(contd….)
- 2.37Lecture 40: Lattices
Lecture 39: Finite State Automaton(contd….)
Prev