Computer Science - Combinatorics (English)

   Monday, April 14, 2025   

Starting a new Lecture Notes Series on Computer Science - Combinatorics

Youtube Lecture Playlist Credits 

Channel Name: nptelhrd

So Let Us Start to This Journey of Learning 

Computer Science - Combinatorics By Lecture Notes together!

Lecture 1: Mod-01 Lec-01 Pigeon hole principle - (Part 1)

Lecture 2: Mod-01 Lec-02 Pigeon hole principle - (Part 2)

Lecture 3: Mod-01 Lec-03 Pigeon hole principle - (Part 3)

Lecture 4: Mod-01 Lec-04 Pigeon hole principle - (Part 4)

Lecture 5: Mod-02 Lec-05 Elementary concepts and basic counting principles

Lecture 6: Mod-02 Lec-06 Elementary concepts; Binomial theorem; Bijective proofs - Part (1)

Lecture 7: Mod-02 Lec-07 Bijective proofs -- Part (2)

Lecture 8: Mod-02 Lec-08 Bijective proofs - Part (3); Properties of binomial coefficients;

Lecture 9: Mod-02 Lec-09 Combinatorial identities - Part (2); Permutations of multisets -- Part (1)

Lecture 10: Mod-02 Lec-10 Permutations of multisets -- Part (2)

Lecture 11: Mod-02 Lec-11 Multinomial Theorem, Combinations of Multisets -- Part (1)

Lecture 12: Mod-02 Lec-12 Combinations of Multisets - Part (2)

Lecture 13: Mod-02 Lec-13 Combinations of Multisets -- Part (3), Bounds for binomial coefficients

Lecture 14: Mod-02 Lec-14 Sterling's Formula, Generalization of Binomial coefficients - Part (1)

Lecture 15: Mod-02 Lec-15 Generalization of Binomial coefficients - Part (2)

Lecture 16: Mod-02 Lec-16 Generalization of Binomial coefficients - Part (3); Double counting - Part (1)

Lecture 17: Mod-03 Lec-17 Double counting - Part (2)

Lecture 18: Mod-03 Lec-18 Hall's Theorem for regular bipartite graphs; Inclusion exclusion principle - Part (1)

Lecture 19: Mod-03 Lec-19 Inclusion exclusion principle - Part (2)

Lecture 20: Mod-03 Lec-20 Inclusion exclusion principle - Part (3)

Lecture 21: Mod-03 Lec-21 Inclusion exclusion principle - Part (4)

Lecture 22: Mod-03 Lec-22 Inclusion exclusion principle - Part (5)

Lecture 23: Mod-04 Lec-23 Recurrence Relations - Part (1)

Lecture 24: Mod-04 Lec-24 Recurrence Relations - Part (2)

Lecture 25: Mod-04 Lec-25 Recurrence Relations - Part (3)

Lecture 26: Mod-04 Lec-26 Recurrence Relations - Part (4)

Lecture 27: Mod-04 Lec-27 Recurrence Relations - Part (5)

Lecture 28: Mod-04 Lec-28 Generating functions - Part (1)

Lecture 29: Mod-04 Lec-29 Generating functions - Part (2)

Lecture 30: Mod-04 Lec-30 Solving recurrence relations using generating functions - Part (1)

Lecture 31: Mod-04 Lec-31 Solving recurrence relations using generating functions - Part (2)

Lecture 32: Mod-04 Lec-32 Exponential generating functions - Part (1)

Lecture 33: Mod-04 Lec-33 Exponential generating functions - Part (2), Partition Number - Part (1)

Lecture 34: Mod-05 Lec-34 Partition Number - Part (2)

Lecture 35: Mod-05 Lec-35 Partition Number - Part (3)

Lecture 36: Mod-05 Lec-36 Partition Number - Part (4); Catalan Numbers - Part (1)

Lecture 37: Mod-05 Lec-37 Catalans Numbers - Part (2)

Lecture 38: Mod-05 Lec-38 Catalan Numbers - Part (3), Sterling numbers of the 2nd kind

Lecture 39: Mod-05 Lec-39 Difference Sequences

Lecture 40: Mod-05 Lec-40 Sterling Numbers

Lecture 41: Mod-05 Lec-41 Summary