Computer Sc - Discrete Mathematical Structures

Course Lectures

• Lecture 1 - Propositional Logic

  Play
• Lecture 2 - Propositional Logic (Contd.)

  Play
• Lecture 3 - Predicates & Quantifiers

  Play
• Lecture 4 - Predicates & Quantifiers (Contd.)

  Play
• Lecture 5 -Logical Inference

  Play
• Lecture 6 -Resolution Principles & Application to PROLOG

  Play
• Lecture 7 - Methods of Proof

  Play
• Lecture 8 - Normal Forms

  Play
• Lecture 9 - Proving programs correct

  Play
• Lecture 10 - Sets

  Play
• Lecture 11 - Induction

  Play
• Lecture 12 - Set Operations on Strings Over an Alphabet

  Play
• Lecture 13 - Relations

  Play
• Lecture 14- Graphs

  Play
• Lecture 15 - Graphs (Contd.)

  Play
• Lecture 16 - Trees

  Play
• Lecture 17 - Trees and Graphs

  Play
• Lecture 18 - Special Properties of Relations

  Play
• Lecture -19 - Closure of Relations

  Play
• Lecture 20 - Closure of Relations (Contd.)

  Play
• Lecture 21 - Order Relations

  Play
• Lecture 22 - Order and Relations and Equivalence Relations

  Play
• Lecture 23 - Equivalence relations and partitions

  Play
• Lecture 24 - Functions

  Play
• Lecture 25 - Functions (Contd.)

  Play
• Lectures 26 - Functions (Contd.)

  Play
• Lecture 27-Pigeonhole Principle

  Play
• Lecture 28 - Permutations and combinations

  Play
• Lecture 29 - Permutations and Combinations(Contd...)

  Play
• Lecture 30 - Generating Functions

  Play
• Lecture 31- Generating Functions

  Play
• Lecture 32 - Recurrence Relations

  Play
• Lecture 33 - Recurrence Relations

  Play
• Lecture 34-Recurrence Relations(contd..)

  Play
• Lecture 35-Algebras

  Play
• Lecture 36-Algebras(contd...)

  Play
• Lecture 37-Algebras(contd...)

  Play
• Lecture 38-Finite State Automaton

  Play
• Lecture 39-Finite State Automaton(contd....)

  Play
• Lecture 40-Lattices

  Play