GATE (Graduate Aptitude Test in Engineering) Computer Science & IT (CS) Combinatorics-Counting Study Material (Page 1 of 2)

Choose Programs:

🎓 Study Material (1190 Notes): 2024-2025 Syllabus

Rs. 1000.00 -OR-

3 Year Validity (Multiple Devices)

Topic-wise Notes & SampleDetails

🎯 302 Numeric, 2894 MCQs (& PYQs) with Full Explanations (2024-2025 Exam)

Rs. 650.00 -OR-

3 Year Validity (Multiple Devices)

CoverageDetailsSample Explanation

Help me Choose & Register (Watch Video) Already Subscribed?

Pigeonhole Principle

Edit

Pigeonhole Principle

At times, this “pigeonhole principle” is also referred to as the Dirichlet՚s box principle or Dirichlet՚s drawer principle. Although the pigeonhole principle is simple to state, it has a wide range of applications. It says that, if n items are put into m containers, with , then at least one container must contain more than one item.

… (698 more words, 1 figure) …

Subscribe (by clicking here) to view full notes and track progress.

Inclusion-Exclusion Principle

Edit

Inclusion-Exclusion Principle

  • This is a somewhat familiar topic, it is related to counting in a set, which we have already seen. The inclusion – exclusion principle is a counting technique which generalizes the familiar method of obtaining the number of elements in the union of two finite sets; this “familiar” method is the formula which we have seen as,

  • This formula is to be generalized in Inclusion-…

… (144 more words, 3 figures) …

Subscribe (by clicking here) to view full notes and track progress.