Discrete structures are foundational material for computer science. By foundational we mean that relatively few computer scientists will be working primarily on discrete structures, but that many other areas of computer science require the ability to work with concepts from discrete structures. Discrete structures include important material from su...
Discrete structures are foundational material for computer science. By foundational we mean that relatively few computer scientists will be working primarily on discrete structures, but that many other areas of computer science require the ability to work with concepts from discrete structures. Discrete structures include important material from su...
Lecture 01: Introduction to Propositional Logic
32mLecture 02: Introduction to Propositional Logic (Contd.)
32mLecture 03 : Introduction to Propositional Logic (Contd.)
32mLecture 04: Introduction to Propositional Logic (Contd.)
32mLecture 05: Introduction to Propositional Logic (Contd.)
32mLecture 06: Introduction to Propositional Logic (Contd.)
32mLecture 07: Predicate Logic
37mLecture 08: Predicate Logic (Contd.)
34mLecture 09 : Predicate Logic (Contd.)
36mLecture 10 : Predicate Logic (Contd.)
38mLecture 15 : Proof Techniques (Contd.)
39mLecture 14 : Proof Techniques (Contd.)
39mLecture 13 : Proof Techniques (Contd.)
39mLecture 12 : Proof Techniques (Contd.)
39mLecture 11 : Proof Techniques
39mLecture 20 : Sets and Functions (Contd.)
35mLecture 19 : Sets and Functions (Contd.)
35mLecture 18 : Sets and Functions (Contd.)
35mLecture 17 : Sets and Functions (Contd.)
35mLecture 16 : Sets and Functions
35mLecture 25 : Relations and their Properties (Contd.)
40mLecture 24 : Relations and their Properties (Contd.)
40mLecture 23 : Relations and their Properties (Contd.)
40mLecture 22 : Relations and their Properties (Contd.)
40mLecture 21 : Relations and their Properties
40mLecture 30 : Recursion (Contd.)
41mLecture 29 : Recursion (Contd.)
41mLecture 28 : Recursion (Contd.)
41mLecture 27 : Recursion (Contd.)
41mLecture 26 : Recursion
41mLecture 35: Recurrence relations (Contd.)
40mLecture 34: Recurrence relations (Contd.)
40mLecture 33: Recurrence relations (Contd.)
40mLecture 32: Recurrence relations (Contd.)
40mLecture 31: Recurrence relations
40mLecture 40: Counting Techniques and Pigeonhole Principle (Contd.)
40mLecture 39: Counting Techniques and Pigeonhole Principle (Contd.)
40mLecture 38: Counting Techniques and Pigeonhole Principle (Contd.)
40mLecture 37: Counting Techniques and Pigeonhole Principle (Contd.)
40mLecture 36: Counting Techniques and Pigeonhole Principle
40mLecture 45 : Combinatorics (Contd.)
38mLecture 43 : Combinatorics (Contd.)
38mLecture 42 : Combinatorics (Contd.)
38mLecture 44 : Combinatorics (Contd.)
38mLecture 41 : Combinatorics
38mLecture 49 : Algebraic Structures (Contd.)
38mLecture 50 : Algebraic Structures (Contd.)
38mLecture 47 : Algebraic Structures (Contd.)
38mLecture 46 : Algebraic Structures
38mLecture 48 : Algebraic Structures (Contd.)
38mLecture 55: Ring and Modular Arithmetic (Contd.)
40mLecture 54: Ring and Modular Arithmetic (Contd.)
40mLecture 52: Ring and Modular Arithmetic (Contd.)
40mLecture 51: Ring and Modular Arithmetic
40mLecture 53: Ring and Modular Arithmetic (Contd.)
40mLecture 57 : Finite Field and Applications (Contd.)
39mLecture 56 : Finite Field and Applications
39mLecture 58 : Finite Field and Applications (Contd.)
37mLecture 59 : Finite Field and Applications (Contd.)
32mLecture 60 : Finite Field and Applications (Contd.)
38m