| Lecture No. | Description | Lecture By |
|---|---|---|
| Lecture 1 | Formal Logic: Statement, Symbolic Representation and Tautologies. | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 2 | Quantifiers, Predicates and Validity | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 3 | Normal forms | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 4 | Propositional Logic, Predicate Logic. | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 5 | Direct Proof, Proof by Contraposition | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 6 | Proof by exhaustive cases and proof by contradiction | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 7 | principle of mathematical induction, principle of complete induction., pigeonhole principle. | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 8 | permutation and combination, pascal’s triangles, binominal theorem. | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 9 | Sets, Subsets, power set, binary and unary operations on a set, set operations/set identities | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 10 | fundamental counting principles, principle of inclusion and exclusion Relation. | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 11 | properties of binary relation, closures, partial ordering, equivalence relation, | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 12 | properties of function, composition of function, inverse. | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 13 | Lattices: sub lattices, direct product, definition of Boolean algebra, properties. | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 14 | Isomorphic structures (in particulars, structures with binary operations) sub algebra. | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 15 | direct product and homomorphism, | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 16 | Boolean function, Boolean expression, representation & minimization of Boolean Function | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 17 | Principle of Well Ordering Recursive definitions | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 18 | solution methods for linear | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 19 | first-order recurrence relations with constant coefficients-1 | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 20 | first-order recurrence relations with constant coefficients-2 | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 21 | GCD, LCM | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 22 | Permutation function, composition of cycles. | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 23 | Fundamental Theorem of Arithmetic | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 24 | primes, Congruence | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 25 | Euler Phi function, Fermat’s Little Theorem | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 26 | Primality and Factoring, Simple Cryptosystems, RSA Cryptosystem. | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 27 | Groups, Group identity and uniqueness, inverse and its uniqueness. | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 28 | isomorphism and homomorphism, subgroups, | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 29 | Cosets and Lagrange’s theorem | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 30 | Permutation group and Cayley ’s theorem (without proof) | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 31 | Error Correcting codes and groups. | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 32 | Normal subgroup and quotient groups. | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 33 | Graph Terminology, Isomorphism, and Isomorphism as relations. | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 34 | Cut-Vertices, Planar graphs. | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 35 | Euler’s formula (proof) | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 36 | Four color problem and the chromatic number of a graph. | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 37 | Euler graphs | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 38 | Hamiltonian graphs | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 39 | Five color theorem | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 40 | Vertex Coloring, Edge Coloring | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 41 | Trees terminology | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 42 | In order, preorder | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 43 | Post order trees traversal algorithms | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 44 | Directed graphs | Lecture by , Lecture by , Lecture by , Lecture by |
| Lecture 45 | Computer representation of graphs. | Lecture by , Lecture by , Lecture by , Lecture by |