NPTEL : Discrete Mathematical Structures (Computer Science and Engineering)

Co-ordinators : Prof. Kamala Krithivasan


Lecture 1 - Propositional Logic

Lecture 2 - Propositional Logic (Continued)

Lecture 3 - Predicates & Quantifiers

Lecture 4 - Predicates & Quantifiers (Continued)

Lecture 5 - Logical Inference

Lecture 6 - Resolution Principles & Application to PROLOG

Lecture 7 - Methods of Proof

Lecture 8 - Normal Forms

Lecture 9 - Proving Programs Correct (Continued)

Lecture 10 - Sets

Lecture 11 - Induction

Lecture 12 - Set Operations On Strings

Lecture 13 - Relations

Lecture 14 - Graphs

Lecture 15 - Graphs (Continued)

Lecture 16 - Trees

Lecture 17 - Trees And Graphs

Lecture 18 - Special Properties Of Relations

Lecture 19 - Closure Of Relations

Lecture 20 - Closure Properties Of Relations

Lecture 21 - Order Relations

Lecture 22 - Order Relations And Equivalence Relations

Lecture 23 - Equivalence Relations And Partitions

Lecture 24 - Functions

Lecture 25 - Functions (Continued)

Lecture 26 - Functions (Continued)

Lecture 27 - Pigeonhole Principle

Lecture 28 - Permutations And Combinations

Lecture 29 - Permutations And Combinations (Continued)

Lecture 30 - Generating Functions

Lecture 31 - Generating Functions (Continued)

Lecture 32 - Recurrence Relations

Lecture 33 - Recurrence Relations (Continued)

Lecture 34 - Recurrence Relations (Continued)

Lecture 35 - Algebras

Lecture 36 - Algebras (Continued)

Lecture 37 - Algebras (Continued)

Lecture 38 - Finite State Automaton

Lecture 39 - Finite State Automaton (Continued)

Lecture 40 - Lattices