DM-9-Combinatorics-Some previous gate questions

This lecture contains numerical problems related to all templates

[kindykomal]

Great video, well explained. Thank you sir

[Bstarinfo]

Thanks for teaching us in this easy way sir.Great material.

[Anoopegi]

if roses are different than how can we solve this problem

[jackofalltrades]

Very useful material thanks for uploading 😊

[keshavgupta]

The answer for gate 1999 question should be (n+1)Pk. Sir please check as we have n+1 choices and k elements.According to your answer 01010 and 10100 are same

[satyakiguha]

in 1991, selecting n positions to fills 0's out of 3n positions....ie 3nCn?

[chetanrajput]

Why we didn't just add the solutions in flower problem?

[payalsagar]

sir why did you take n and k both equal to 2, i mean if it wolud b a matter of both values being same then why the need to take to variables n and k instead they might have told that there are n zeroes and k ones

[pritamsaha]

in gate 1999 problem n zeroes and k ones such that ones are not
consider the example 0_0_0 (the '_' indicates one's) then the number of zeros is n here, then number of one's is (n-1)
then why not option A is the correct one?

[shamim-io]

Sir why cant we apply template 1 in 10 roses problem?

[ShubhamSingh-fg]

Is these tutorial series of discreate mathematics covers gate syallabus.

[namankumr]

What is the mistake in last question which sir said, can someone help??

[azhark]

@Gate cs lectures by gate book
Please add lectures on recurrence relations and peigion hole principle

[sushmitanigam]

sir what if all 10 roses are different in the first problem?

[sandy]

sir please explain deeply the 2001 question

[satyakiguha]

in gate 1999 problem n zeroes and k ones such that ones are not is mentioned about the possible values of n and if n=5, k=1...there will be no possible solutions....so don't we have to check whether there are enough 0's to separate the ones?shouldn't there be any constraint on values of n and k?