Modules / Lectures
Module NameDownload
Week_01_Assignment_01Week_01_Assignment_01
Week_02_Assignment_02Week_02_Assignment_02
Week_03_Assignment_03Week_03_Assignment_03
Week_04_Assignment_04Week_04_Assignment_04
Week_05_Assignment_05Week_05_Assignment_05
Week_06_Assignment_06Week_06_Assignment_06
Week_07_Assignment_07Week_07_Assignment_07
Week_08_Assignment_08Week_08_Assignment_08
Week_09_Assignment_09Week_09_Assignment_09
Week_10_Assignment_10Week_10_Assignment_10
Week_11_Assignment_11Week_11_Assignment_11
Week_12_Assignment_12Week_12_Assignment_12
noc18_cs53_Assignment1noc18_cs53_Assignment1
noc18_cs53_Assignment10noc18_cs53_Assignment10
noc18_cs53_Assignment11noc18_cs53_Assignment11
noc18_cs53_Assignment12noc18_cs53_Assignment12
noc18_cs53_Assignment13noc18_cs53_Assignment13
noc18_cs53_Assignment2noc18_cs53_Assignment2
noc18_cs53_Assignment3noc18_cs53_Assignment3
noc18_cs53_Assignment4noc18_cs53_Assignment4
noc18_cs53_Assignment5noc18_cs53_Assignment5
noc18_cs53_Assignment6noc18_cs53_Assignment6
noc18_cs53_Assignment7noc18_cs53_Assignment7
noc18_cs53_Assignment8noc18_cs53_Assignment8
noc18_cs53_Assignment9noc18_cs53_Assignment9
noc19_cs05_Assignment1noc19_cs05_Assignment1
noc19_cs05_Assignment10noc19_cs05_Assignment10
noc19_cs05_Assignment11noc19_cs05_Assignment11
noc19_cs05_Assignment12noc19_cs05_Assignment12
noc19_cs05_Assignment13noc19_cs05_Assignment13
noc19_cs05_Assignment2noc19_cs05_Assignment2
noc19_cs05_Assignment3noc19_cs05_Assignment3
noc19_cs05_Assignment4noc19_cs05_Assignment4
noc19_cs05_Assignment5noc19_cs05_Assignment5
noc19_cs05_Assignment6noc19_cs05_Assignment6
noc19_cs05_Assignment7noc19_cs05_Assignment7
noc19_cs05_Assignment8noc19_cs05_Assignment8
noc19_cs05_Assignment9noc19_cs05_Assignment9


Sl.No Chapter Name MP4 Download Transcript Download
1Motivation for CountingDownloadDownload
Verified
2Paper Folding ExampleDownloadDownload
Verified
3Rubik's Cube ExampleDownloadDownload
Verified
4Factorial ExampleDownloadDownload
Verified
5Counting in Computer ScienceDownloadDownload
Verified
6Motivation for Catalan numbersDownloadDownload
Verified
7Rule of Sum and Rule of ProductDownloadDownload
Verified
8Problems on Rule of Sum and Rule of ProductDownloadDownload
Verified
9Factorial ExplainedDownloadDownload
Verified
10Proof of n! - Part 1DownloadDownload
Verified
11Proof of n! - Part 2DownloadDownload
Verified
12Astronomical NumbersDownloadDownload
Verified
13Permutations - Part 1DownloadDownload
Verified
14Permutations - Part 2DownloadDownload
Verified
15Permutations - Part 3DownloadDownload
Verified
16Permutations - Part 4DownloadDownload
Verified
17Problems on PermutationsDownloadDownload
Verified
18Combinations - Part 1DownloadDownload
Verified
19Combinations - Part 2DownloadDownload
Verified
20Combinations - Part 3DownloadDownload
Verified
21Combinations - Part 4DownloadDownload
Verified
22Problems on CombinationsDownloadDownload
Verified
23Difference between Permuations and CombinationsDownloadDownload
Verified
24Combination with Repetition - Part 1DownloadDownload
Verified
25Combination with Repetition - Part 2DownloadDownload
Verified
26Combination with Repetition - ProblemsDownloadDownload
Verified
27Binomial theoremDownloadDownload
Verified
28Applications of Binomial theoremDownloadDownload
Verified
29Properties of Binomial theoremDownloadDownload
Verified
30Multinomial theoremDownloadDownload
Verified
31Problems on Binomial theoremDownloadDownload
Verified
32Pascal's TriangleDownloadDownload
Verified
33Fun facts on Pascal's TriangleDownloadDownload
Verified
34Catalan Numbers - Part 1DownloadDownload
Verified
35Catalan Numbers - Part 2DownloadDownload
Verified
36Catalan Numbers - Part 3DownloadDownload
Verified
37Catalan Numbers - Part 4DownloadDownload
Verified
38Examples of Catalan numbersDownloadDownload
Verified
39Chapter SummaryDownloadDownload
Verified
40Introduction to Set TheoryDownloadDownload
Verified
41Example, definiton and notationDownloadDownload
Verified
42Sets - Problems Part 1DownloadDownload
Verified
43Subsets - Part 1DownloadDownload
Verified
44Subsets - Part 2DownloadDownload
Verified
45Subsets - Part 3DownloadDownload
Verified
46Union and intersections of setsDownloadDownload
Verified
47Union and intersections of sets - Part 1DownloadDownload
Verified
48Union and intersections of sets - Part 2DownloadDownload
Verified
49Union and intersections of sets - Part 3DownloadDownload
Verified
50Cardinality of Union of two sets - Part 1DownloadDownload
Verified
51Cardinality of Union of sets - Part 2DownloadDownload
Verified
52Cardinality of Union of three setsDownloadDownload
Verified
53Power Set - Part 1DownloadDownload
Verified
54Power set - Part 2DownloadDownload
Verified
55Power set - Part 3DownloadDownload
Verified
56Connection betwenn Binomial Theorem and Power SetsDownloadDownload
Verified
57Power set - ProblemsDownloadDownload
Verified
58Complement of a setDownloadDownload
Verified
59De Morgan's Laws - Part 1DownloadDownload
Verified
60De Morgan's Laws - Part 2DownloadDownload
Verified
61A proof techniqueDownloadDownload
Verified
62De Morgan's Laws - Part 3DownloadDownload
Verified
63De Morgan's Laws - Part 4DownloadDownload
Verified
64Set difference - Part 1DownloadDownload
Verified
65Set difference - Part 2DownloadDownload
Verified
66Symmetric differenceDownloadDownload
Verified
67HistoryDownloadDownload
Verified
68SummaryDownloadDownload
Verified
69Motivational exampleDownloadPDF unavailable
70Introduction to StatementsDownloadPDF unavailable
71Examples and Non-examples of StatementsDownloadPDF unavailable
72Introduction to NegationDownloadPDF unavailable
73Negation - ExplanationDownloadPDF unavailable
74Negation - TruthtableDownloadPDF unavailable
75Examples for NegationDownloadPDF unavailable
76Motivation for OR operatorDownloadPDF unavailable
77Introduction to OR operatorDownloadPDF unavailable
78Truthtable for OR operatorDownloadPDF unavailable
79OR operator for 3 VariablesDownloadPDF unavailable
80Truthtable for AND operatorDownloadPDF unavailable
81 AND operator for 3 VariablesDownloadPDF unavailable
82Primitive and Compound statements - Part 1 DownloadPDF unavailable
83Primitive and Compound statements - Part 2DownloadPDF unavailable
84Problems involoving NOT, OR and AND operatorsDownloadPDF unavailable
85Introduction to implicationDownloadPDF unavailable
86Examples and Non-examples of Implication - Part 1DownloadPDF unavailable
87Examples and Non-examples of Implication - Part 2DownloadPDF unavailable
88Explanation of Implication DownloadPDF unavailable
89Introduction to Double ImplicationDownloadPDF unavailable
90Explanation of Double ImplicationDownloadPDF unavailable
91Converse, Inverse and ContrapositiveDownloadPDF unavailable
92XOR operator - Part 1DownloadPDF unavailable
93XOR operator - Part 2DownloadPDF unavailable
94XOR operator - Part 3DownloadPDF unavailable
95Problems DownloadPDF unavailable
96Tautology, Contradiction - Part 1DownloadPDF unavailable
97Tautology, Contradiction - Part 2DownloadPDF unavailable
98Tautology, Contradiction - Part 3DownloadPDF unavailable
99SAT Problem - Part 1DownloadPDF unavailable
100SAT Problem - Part 2DownloadPDF unavailable
101Logical Equivalence - Part 1DownloadPDF unavailable
102Logical Equivalence - Part 2DownloadPDF unavailable
103Logical Equivalence - Part 3DownloadPDF unavailable
104Logical Equivalence - Part 4DownloadPDF unavailable
105Motivation for laws of logicDownloadPDF unavailable
106Double negation - Part 1DownloadPDF unavailable
107Double negation - Part 2DownloadPDF unavailable
108Laws of LogicDownloadPDF unavailable
109De Morgan's Law - Part 1DownloadPDF unavailable
110De Morgan's Law - Part 2DownloadPDF unavailable
111Rules of Inferences - Part 1DownloadPDF unavailable
112Rules of Inferences - Part 2DownloadPDF unavailable
113Rules of Inferences - Part 3DownloadPDF unavailable
114Rules of Inferences - Part 4DownloadPDF unavailable
115Rules of Inferences - Part 5DownloadPDF unavailable
116Rules of Inferences - Part 6DownloadPDF unavailable
117Rules of Inferences - Part 7DownloadPDF unavailable
118ConclusionDownloadPDF unavailable
119Introduction to RelationDownloadPDF unavailable
120Graphical Representation of a RelationDownloadPDF unavailable
121Various setsDownloadPDF unavailable
122Matrix Representation of a RelationDownloadPDF unavailable
123Relation - An Example DownloadPDF unavailable
124Cartesian Product DownloadPDF unavailable
125Set Representation of a Relation DownloadPDF unavailable
126Revisiting Representations of a Relation DownloadPDF unavailable
127Examples of RelationsDownloadPDF unavailable
128Number of relations - Part 1DownloadPDF unavailable
129Number of relations - Part 2DownloadPDF unavailable
130Reflexive relation - IntroductionDownloadPDF unavailable
131Example of a Reflexive relationDownloadPDF unavailable
132Reflexive relation - Matrix representationDownloadPDF unavailable
133Number of Reflexive relationsDownloadPDF unavailable
134Symmetric Relation - IntroductionDownloadPDF unavailable
135Symmetric Relation - Matrix representationDownloadPDF unavailable
136Symmetric Relation - Examples and non examplesDownloadPDF unavailable
137Parallel lines revisitedDownloadPDF unavailable
138Number of symmetric relations - Part 1DownloadPDF unavailable
139Number of symmetric relations - Part 2DownloadPDF unavailable
140Examples of Reflexive and Symmetric RelationsDownloadPDF unavailable
141PatternDownloadPDF unavailable
142Transitive relation - Examples and non examplesDownloadPDF unavailable
143Antisymmetric relationDownloadPDF unavailable
144Examples of Transitive and Antisymmetric RelationDownloadPDF unavailable
145Antisymmetric - Graphical representation DownloadPDF unavailable
146Antisymmetric - Matrix representation DownloadPDF unavailable
147Number of Antisymmetric relationsDownloadPDF unavailable
148Condition for relation to be reflexiveDownloadPDF unavailable
149Few notationsDownloadPDF unavailable
150Condition for relation to be reflexive.DownloadPDF unavailable
151Condition for relation to be reflexive..DownloadPDF unavailable
152Condition for relation to be symmetricDownloadPDF unavailable
153Condition for relation to be symmetric.DownloadPDF unavailable
154Condition for relation to be antisymmetricDownloadPDF unavailable
155Equivalence relationDownloadPDF unavailable
156Equivalence relation - Example 4DownloadPDF unavailable
157Partition - Part 1DownloadPDF unavailable
158Partition - Part 2DownloadPDF unavailable
159Partition - Part 3DownloadPDF unavailable
160Partition - Part 4DownloadPDF unavailable
161Partition - Part 5DownloadPDF unavailable
162Partition - Part 5.DownloadPDF unavailable
163Motivational Example - 1DownloadPDF unavailable
164Motivational Example - 2DownloadPDF unavailable
165Commonality in examplesDownloadPDF unavailable
166Motivational Example - 3DownloadPDF unavailable
167Example - 4 ExplanationDownloadPDF unavailable
168Introduction to functions DownloadPDF unavailable
169Defintion of a function - Part 1DownloadPDF unavailable
170Defintion of a function - Part 2DownloadPDF unavailable
171Defintion of a function - Part 3DownloadPDF unavailable
172Relations vs Functions - Part 1DownloadPDF unavailable
173Relations vs Functions - Part 2DownloadPDF unavailable
174Introduction to One-One FunctionDownloadPDF unavailable
175One-One Function - Example 1DownloadPDF unavailable
176One-One Function - Example 2DownloadPDF unavailable
177One-One Function - Example 3DownloadPDF unavailable
178Proving a Function is One-OneDownloadPDF unavailable
179Examples and Non- examples of One-One functionDownloadPDF unavailable
180Cardinality condition in One-One function - Part 1DownloadPDF unavailable
181Cardinality condition in One-One function - Part 2DownloadPDF unavailable
182Introduction to Onto Function - Part 1DownloadPDF unavailable
183Introduction to Onto Function - Part 2DownloadPDF unavailable
184Definition of Onto FunctionDownloadPDF unavailable
185Examples of Onto FunctionDownloadPDF unavailable
186Cardinality condition in Onto function - Part 1DownloadPDF unavailable
187Cardinality condition in Onto function - Part 2DownloadPDF unavailable
188Introduction to BijectionDownloadPDF unavailable
189Examples of BijectionDownloadPDF unavailable
190Cardinality condition in Bijection - Part 1DownloadPDF unavailable
191Cardinality condition in Bijection - Part 2DownloadPDF unavailable
192Counting number of functionsDownloadPDF unavailable
193Number of functionsDownloadPDF unavailable
194Number of One-One functions - Part 1DownloadPDF unavailable
195Number of One-One functions - Part 2DownloadPDF unavailable
196Number of One-One functions - Part 3DownloadPDF unavailable
197Number of Onto functionsDownloadPDF unavailable
198Number of BijectionsDownloadPDF unavailable
199Counting number of functions.DownloadPDF unavailable
200Motivation for Composition of functions - Part 1DownloadPDF unavailable
201Motivation for Composition of functions - Part 2DownloadPDF unavailable
202Definition of Composition of functionsDownloadPDF unavailable
203Why study Composition of functionsDownloadPDF unavailable
204Example of Composition of functions - Part 1DownloadPDF unavailable
205Example of Composition of functions - Part 2DownloadPDF unavailable
206Motivation for Inverse functionsDownloadPDF unavailable
207Inverse functions DownloadPDF unavailable
208Examples of Inverse functionsDownloadPDF unavailable
209Application of inverse functions - Part 1DownloadPDF unavailable
210Three storiesDownloadPDF unavailable
211Three stories - Connecting the dotsDownloadPDF unavailable
212Mathematical induction - An illustrationDownloadPDF unavailable
213Mathematical Induction - Its essenceDownloadPDF unavailable
214Mathematical Induction - The formal wayDownloadPDF unavailable
215MI - Sum of odd numbersDownloadPDF unavailable
216MI - Sum of powers of 2DownloadPDF unavailable
217MI - Inequality 1DownloadPDF unavailable
218MI - Inequality 1 (solution)DownloadPDF unavailable
219MI - To prove divisibilityDownloadPDF unavailable
220MI - To prove divisibility (solution)DownloadPDF unavailable
221MI - Problem on satisfying inequalitiesDownloadPDF unavailable
222MI - Problem on satisfying inequalities (solutions)DownloadPDF unavailable
223MI - Inequality 2DownloadPDF unavailable
224MI - Inequality 2 solutionDownloadPDF unavailable
225Mathematical Induction - Example 9DownloadPDF unavailable
226Mathematical Induction - Example 10 solutionDownloadPDF unavailable
227Binomial Coeffecients - Proof by inductionDownloadPDF unavailable
228Checker board and Triomioes - A puzzleDownloadPDF unavailable
229Checker board and triominoes - SolutionDownloadPDF unavailable
230Mathematical induction - An important noteDownloadPDF unavailable
231Mathematical Induction - A false proofDownloadPDF unavailable
232A false proof - SolutionDownloadPDF unavailable
233Motivation for Pegionhole PrincipleDownloadPDF unavailable
234Group of n peopleDownloadPDF unavailable
235Set of n integgersDownloadPDF unavailable
23610 points on an equilateral triangleDownloadPDF unavailable
237Pegionhole Principle - A resultDownloadPDF unavailable
238Consecutive integersDownloadPDF unavailable
239Consecutive integers solutionDownloadPDF unavailable
240Matching initialsDownloadPDF unavailable
241Matching initials - SolutionDownloadPDF unavailable
242Numbers adding to 9DownloadPDF unavailable
243Numbers adding to 9 - SolutionDownloadPDF unavailable
244Deck of cardsDownloadPDF unavailable
245Deck of cards - SolutionDownloadPDF unavailable
246Number of errorsDownloadPDF unavailable
247Number of errors - SolutionDownloadPDF unavailable
248Puzzle - Challenge for youDownloadPDF unavailable
249Friendship - an interesting propertyDownloadPDF unavailable
250Connectedness through Connecting peopleDownloadPDF unavailable
251Traversing the bridgesDownloadPDF unavailable
252Three utilities problemDownloadPDF unavailable
253Coloring the India mapDownloadPDF unavailable
254Defintion of a GraphDownloadPDF unavailable
255Degree and degree sequenceDownloadPDF unavailable
256Relation between number of edges and degreesDownloadPDF unavailable
257Relation between number of edges and degrees - ProofDownloadPDF unavailable
258Hand shaking lemma - CorollaryDownloadPDF unavailable
259Problems based on Hand shaking lemmaDownloadPDF unavailable
260Havel Hakimi theorem - Part 1DownloadPDF unavailable
261Havel Hakimi theorem - Part 2DownloadPDF unavailable
262Havel Hakimi theorem - Part 3DownloadPDF unavailable
263Havel Hakimi theorem - Part 4DownloadPDF unavailable
264Havel Hakimi theorem - Part 5DownloadPDF unavailable
265Regular graph and irregular graphDownloadPDF unavailable
266WalkDownloadPDF unavailable
267TrailDownloadPDF unavailable
268Path and closed pathDownloadPDF unavailable
269Definitions revisitedDownloadPDF unavailable
270Examples of walk, trail and pathDownloadPDF unavailable
271Cycle and circuitDownloadPDF unavailable
272Example of cycle and circuitDownloadPDF unavailable
273Relation between walk and pathDownloadPDF unavailable
274Relation between walk and path - An induction proofDownloadPDF unavailable
275SubgraphDownloadPDF unavailable
276Spanning and induced subgraphDownloadPDF unavailable
277Spanning and induced subgraph - A resultDownloadPDF unavailable
278Introduction to TreeDownloadPDF unavailable
279Connected and Disconnected graphsDownloadPDF unavailable
280Property of a cycleDownloadPDF unavailable
281Edge condition for connectivityDownloadPDF unavailable
282Connecting connectedness and pathDownloadPDF unavailable
283Connecting connectedness and path - An illustrationDownloadPDF unavailable
284Cut vertexDownloadPDF unavailable
285Cut edgeDownloadPDF unavailable
286Illustration of cut vertices and cut edgesDownloadPDF unavailable
287NetworkX - Need of the hourDownloadPDF unavailable
288Introduction to Python - InstallationDownloadPDF unavailable
289Introduction to Python - BasicsDownloadPDF unavailable
290Introduction to NetworkXDownloadPDF unavailable
291Story so far - Using NetworkXDownloadPDF unavailable
292Directed, weighted and multi graphsDownloadPDF unavailable
293Illustration of Directed, weighted and multi graphsDownloadPDF unavailable
294Graph representations - IntroductionDownloadPDF unavailable
295Adjacency matrix representationDownloadPDF unavailable
296Incidence matrix representationDownloadPDF unavailable
297Isomorphism - IntroductionDownloadPDF unavailable
298Isomorphic graphs - An illustrationDownloadPDF unavailable
299Isomorphic graphs - A challengeDownloadPDF unavailable
300Non - isomorphic graphsDownloadPDF unavailable
301Isomorphism - A questionDownloadPDF unavailable
302Complement of a Graph - IntroductionDownloadPDF unavailable
303Complement of a Graph - IlliustrationDownloadPDF unavailable
304Self complementDownloadPDF unavailable
305Complement of a disconnected graph is connectedDownloadPDF unavailable
306Complement of a disconnected graph is connected - SolutionDownloadPDF unavailable
307Which is more? Connected graphs or disconnected graphs?DownloadPDF unavailable
308Bipartite graphsDownloadPDF unavailable
309Bipartite graphs - A puzzleDownloadPDF unavailable
310Bipartite graphs - Converse part of the puzzleDownloadPDF unavailable
311Definition of Eulerian GraphDownloadPDF unavailable
312Illustration of eulerian graphDownloadPDF unavailable
313Non- example of Eulerian graphDownloadPDF unavailable
314Litmus test for an Eulerian graphDownloadPDF unavailable
315Why even degree?DownloadPDF unavailable
316Proof for even degree implies graph is eulerianDownloadPDF unavailable
317A condition for Eulerian trailDownloadPDF unavailable
318Why the name EulerianDownloadPDF unavailable
319Can you traverse all location?DownloadPDF unavailable
320Defintion of Hamiltonian graphsDownloadPDF unavailable
321Examples of Hamiltonian graphsDownloadPDF unavailable
322Hamiltonian graph - A resultDownloadPDF unavailable
323A result on connectednessDownloadPDF unavailable
324A result on PathDownloadPDF unavailable
325Dirac's TheoremDownloadPDF unavailable
326Dirac's theorem - A noteDownloadPDF unavailable
327Ore's TheoremDownloadPDF unavailable
328Dirac's Theorem v/s Ore's TheoremDownloadPDF unavailable
329Eulerian and Hamiltonian Are they relatedDownloadPDF unavailable
330Importance of Hamiltonian graphs in Computer scienceDownloadPDF unavailable
331Constructing non intersecting roadsDownloadPDF unavailable
332Definition of a Planar graphDownloadPDF unavailable
333Examples of Planar graphsDownloadPDF unavailable
334V - E + R = 2DownloadPDF unavailable
335Illustration of V - E + R =2DownloadPDF unavailable
336V - E + R = 2; Use inductionDownloadPDF unavailable
337Proof of V - E + R = 2 DownloadPDF unavailable
338Famous non-planar graphsDownloadPDF unavailable
339Litmus test for planarityDownloadPDF unavailable
340Planar graphs - Inequality 1DownloadPDF unavailable
3413 Utilities problem - RevisitedDownloadPDF unavailable
342Complete graph on 5 vertices is non-planar - ProofDownloadPDF unavailable
343Prisoners and cellsDownloadPDF unavailable
344Prisoners example and Proper coloringDownloadPDF unavailable
345Chromatic number of a graphDownloadPDF unavailable
346Examples on Proper coloringDownloadPDF unavailable
347Recalling the India map problemDownloadPDF unavailable
348Recalling the India map problem - SolutionDownloadPDF unavailable
349NetworkX - DigraphsDownloadPDF unavailable
350NetworkX - Adjacency matrixDownloadPDF unavailable
351NetworkX- Random graphsDownloadPDF unavailable
352NetworkX - SubgarphDownloadPDF unavailable
353NetworkX - Isomorphic graphs Part 1DownloadPDF unavailable
354NetworkX - Isomorphic graphs Part 2DownloadPDF unavailable
355NetworkX - Isomorphic graphs: A game to playDownloadPDF unavailable
356NetworkX - Graph complementDownloadPDF unavailable
357NetworkX - Eulerian graphsDownloadPDF unavailable
358NetworkX - Bipaprtite graphsDownloadPDF unavailable
359NetworkX - ColoringDownloadPDF unavailable
360Counting in a creative wayDownloadPDF unavailable
361Example 1 - Fun with wordsDownloadPDF unavailable
362Words and the polynomialDownloadPDF unavailable
363Words and the polynomial - ExplainedDownloadPDF unavailable
364Example 2 - Picking five ballsDownloadPDF unavailable
365Picking five balls - SolutionDownloadPDF unavailable
366Picking five balls - Another versionDownloadPDF unavailable
367Defintion of Generating functionDownloadPDF unavailable
368Generating function examples - Part 1DownloadPDF unavailable
369Generating function examples - Part 2DownloadPDF unavailable
370Generating function examples - Part 3DownloadPDF unavailable
371Binomial expansion - A generating functionDownloadPDF unavailable
372Binomial expansion - ExplainedDownloadPDF unavailable
373Picking 7 balls - The naive wayDownloadPDF unavailable
374Picking 7 balls - The creative wayDownloadPDF unavailable
375Generating functions - Problem 1DownloadPDF unavailable
376Generating functions - Problem 2DownloadPDF unavailable
377Generating functions - Problem 3DownloadPDF unavailable
378Why Generating function?DownloadPDF unavailable
379Introduction to Advanced CountingDownloadPDF unavailable
380Example 1 : Dogs and CatsDownloadPDF unavailable
381Inclusion-Exclusion FormulaDownloadPDF unavailable
382Proof of Inclusion - Exlusion formulaDownloadPDF unavailable
383Example 2 : Integer solutions of an equationDownloadPDF unavailable
384Example 3 : Words not containing some stringsDownloadPDF unavailable
385Example 4 : Arranging 3 x's, 3 y's and 3 z'sDownloadPDF unavailable
386Example 5 : Non-multiples of 2 or 3DownloadPDF unavailable
387Example 6 : Integers not divisible by 5, 7 or 11DownloadPDF unavailable
388A tip in solving problemsDownloadPDF unavailable
389Example 7 : A dog nor a catDownloadPDF unavailable
390Example 8 : Brownies, Muffins and CookiesDownloadPDF unavailable
391Example 10 : Integer solutions of an equationDownloadPDF unavailable
392Example 11 : Seating Arrangement - Part 1DownloadPDF unavailable
393Example 11 : Seating Arrangement - Part 2DownloadPDF unavailable
394Example 12 : Integer solutions of an equationDownloadPDF unavailable
395Number of Onto Functions.DownloadPDF unavailable
396Formula for Number of Onto FunctionsDownloadPDF unavailable
397Example 13 : Onto FunctionsDownloadPDF unavailable
398Example 14 : No one in their own houseDownloadPDF unavailable
399DerangementsDownloadPDF unavailable
400Derangements of 4 numbersDownloadPDF unavailable
401Example 15 : Bottles and capsDownloadPDF unavailable
402Example 16 : Self gradingDownloadPDF unavailable
403Example 17 : Even integers and their placesDownloadPDF unavailable
404Example 18 : Finding total number of itemsDownloadPDF unavailable
405Example 19 : Devising a secret codeDownloadPDF unavailable
406Placing rooks on the chessboardDownloadPDF unavailable
407Rook PolynomialDownloadPDF unavailable
408Rook Polynomial.DownloadPDF unavailable
409Motivation for recurrence relationDownloadPDF unavailable
410Getting started with recurrence relationsDownloadPDF unavailable
411What is a recurrence relation?DownloadPDF unavailable
412Compound Interest as a recurrence relationDownloadPDF unavailable
413Examples of recurrence relationsDownloadPDF unavailable
414Example - Number of ways of climbing stepsDownloadPDF unavailable
415Number of ways of climbing steps: Recurrence relationDownloadPDF unavailable
416Example - Rabbits on an islandDownloadPDF unavailable
417Example - n-bit stringDownloadPDF unavailable
418Example - n-bit string without consecutive zeroDownloadPDF unavailable
419Solving Linear Recurrence Relations - A theoremDownloadPDF unavailable
420A note on the proofDownloadPDF unavailable
421Soving recurrence relation - Example 1DownloadPDF unavailable
422Soving recurrence relation - Example 2DownloadPDF unavailable
423Fibonacci SequenceDownloadPDF unavailable
424Introduction to Fibonacci sequenceDownloadPDF unavailable
425Solution of Fibbonacci sequenceDownloadPDF unavailable
426A basic introduction to 'complexity'DownloadPDF unavailable
427Intuition for 'complexity'DownloadPDF unavailable
428Visualizing complexity order as a graphDownloadPDF unavailable
429Tower of HanoiDownloadPDF unavailable
430Reccurence relation of Tower of HanoiDownloadPDF unavailable
431Solution for the recurrence relation of Tower of HanoiDownloadPDF unavailable
432A searching techniqueDownloadPDF unavailable
433Recurrence relation for Binary searchDownloadPDF unavailable
434Solution for the recurrence relation of Binary searchDownloadPDF unavailable
435Example: Door knocks exampleDownloadPDF unavailable
436Example: Door knocks example solutionDownloadPDF unavailable
437Door knock example and Merge sortDownloadPDF unavailable
438Introduction to Merge sort - 1DownloadPDF unavailable
439Recurrence relation for Merge sortDownloadPDF unavailable
440Intoduction to advanced topicsDownloadPDF unavailable
441Introduction to Chromatic polynomialDownloadPDF unavailable
442Chromatic polynomial of complete graphsDownloadPDF unavailable
443Chromatic polynomial of cycle on 4 vertices - Part 1DownloadPDF unavailable
444Chromatic polynomial of cycle on 4 vertices - Part 2DownloadPDF unavailable
445Correspondence between partition and generating functionsDownloadPDF unavailable
446Correspondence between partition and generating functions: In generalDownloadPDF unavailable
447Distinct partitions and odd partitionsDownloadPDF unavailable
448Distinct partitions and generating functionsDownloadPDF unavailable
449Odd partitions and generating functionsDownloadPDF unavailable
450Distinct partitions equals odd partitions: ObservationDownloadPDF unavailable
451Distinct partitions equals odd partitions: ProofDownloadPDF unavailable
452Why 'partitions' to 'polynomial'?DownloadPDF unavailable
453Example: Picking 4 letters from the word 'INDIAN'DownloadPDF unavailable
454Motivation for exponential generating functionDownloadPDF unavailable
455Recurrrence relation: The theorem and its proofDownloadPDF unavailable
456Introduction to Group TheoryDownloadPDF unavailable
457Uniqueness of the identity elementDownloadPDF unavailable
458Formal definition of a GroupDownloadPDF unavailable
459Groups: Examples and non-examplesDownloadPDF unavailable
460Groups: Special Examples Part 1DownloadPDF unavailable
461Groups: Special Examples Part 2DownloadPDF unavailable
462Subgroup: Defintion and examplesDownloadPDF unavailable
463Lagrange's theoremDownloadPDF unavailable
464Summary.DownloadPDF unavailable
465Conclusion.DownloadPDF unavailable