Discrete Mathematics


Lecture 1 - Introduction to the theory of sets


Lecture 2 - Set operation and laws of set operation


Lecture 3 - The principle of inclusion and exclusion


Lecture 4 - Application of the principle of inclusion and exclusion


Lecture 5 - Fundamentals of logic


Lecture 6 - Logical Inferences


Lecture 7 - Methods of proof of an implication


Lecture 8 - First order logic (1)


Lecture 9 - First order logic (2)


Lecture 10 - Rules of influence for quantified propositions


Lecture 11 - Mathematical Induction (1)


Lecture 12 - Mathematical Induction (2)


Lecture 13 - Sample space, events


Lecture 14 - Probability, conditional probability


Lecture 15 - Independent events, Bayes theorem


Lecture 16 - Information and mutual information


Lecture 17 - Basic definition


Lecture 18 - Isomorphism and sub graphs


Lecture 19 - Walks, paths and circuits operations on graphs


Lecture 20 - Euler graphs, Hamiltonian circuits


Lecture 21 - Shortest path problem


Lecture 22 - Planar graphs


Lecture 23 - Basic definition


Lecture 24 - Properties of relations


Lecture 25 - Graph of relations


Lecture 26 - Matrix of relation


Lecture 27 - Closure of relaton (1)


Lecture 28 - Closure of relaton (2)


Lecture 29 - Warshall's algorithm


Lecture 30 - Partially ordered relation


Lecture 31 - Partially ordered sets


Lecture 32 - Lattices


Lecture 33 - Boolean algebra


Lecture 34 - Boolean function (1)


Lecture 35 - Boolean function (2)


Lecture 36 - Discrete numeric function


Lecture 37 - Generating function


Lecture 38 - Introduction to recurrence relations


Lecture 39 - Second order recurrence relation with constant coefficients (1)


Lecture 40 - Second order recurrence relation with constant coefficients (2)


Lecture 41 - Application of recurrence relation